h$O,      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                                                                                                                               !!!!!!!!!!!!!!!!!!!!""""########$$$$$$$$$$$%%%%%%%%%%%%%%%%&&&&&&&&&&&&''''((((((((()))))))))))))))))))))))))))))))))))*********************************************************************************++++++++++++++,,,,,,--------........////000000000000001111111122222222222222222233333333333333 3 3 3 3 3 4 4 4 5 5 5 5 5 5 5 5 5 5 5 5  6 6 6 6 6 6 6 6 7 7 7 7 7 7 7 7 7 7 7 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; < < < < < < < < < = = = = = = = = = = = > > > > > > > > ? ? @ @ @ @ @ @ @ @ @ @ @ @ @ A A A A B B B B B B B B B B B B B B B B B B B B B B B B B B B C C C C C C C C C D D D D D D D D D D D D D D D D D D D D D D D D E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F F G G G G G G G G G G G G G G G G G G G G G G G G G G G G G G G H I I I I J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J J K K K K KKKKKKKKKKLLLLLLLLLLLLLLLLLLLLLMMMMMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOOOOOOOOOOOOOOOOOOOOOPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPQQQQQQQQQQQRRRRSSSSSSSSSSSSSSSSTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUVVVVVVVVWWWWWWWWWWWWWWWWWWWWWWWWWXXXXXXYYYYYYYZZZZZZZZZZZ[[[[[[[[[[\\\\\\\\\\\\\\\\\\\\\\\]]]]]]]]]]^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^________________________________`abcccccccdddddddddddddddddeefffghhhhhhhhhhhhhhhhhhhhhhhhhhhhiijkkllmmmmmmmmnnnnnnnnnnnoooooooooooooooppqqqqqqqqqqqrrrrrrrrrrrrrrrrrrrrrrsssssstttttttttuvvvvwwwwwwwwwwwwwwwwwwwwwwwwxxxxxxxxyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyzzzzzzzzzzzzzzzzzzzzz{||}}~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~None#$'(-/2359>?PdarcsA reflection of > at the value level so that code can explicitly switch on it.darcsReflect > to the value level so that code can explicitly switch on it.darcs Extract the  from a darcs;This type is intended to be used as a phantom type via the  DataKinds extension. It tracks different types of repositories, e.g. to indicate when a rebase is in progress.darcsA reflection of > at the value level so that code can explicitly switch on it.darcs?Q0None#$'(-/2359>?Q $% &'( )*+U,  -.P/01234T#!"56dabc78 9EH:;<=>?FG@MKLABCDIJNOQRSVWfghijklmnopqstuvwxyz{|}~ $% &'( )*+U,  -.P/012356abc9EH:;<=>?FG@MKLABCDIJOQRSVWfghijklmnopqstuvwxyz{|}~4T#!"N8 7d None#$'(-/2359>?XdarcsAn witness aware equality class. A minimal definition defines any one of ,  and .darcsIt is unsafe to define a class instance via this method, because if it returns True then the default implementations of  and , will coerce the equality of two witnesses.&Calling this method is safe, although  or  would be better choices as it is not usually meaningul to compare two patches that don't share either a starting or an ending contextdarcsCompare two things with the same starting witness. If the things compare equal, evidence of the ending witnesses being equal will be returned.darcsCompare two things with the same ending witness. If the things compare equal, evidence of the starting witnesses being equal will be returned.darcs is used to pass around evidence (or lack thereof) of two witness types being equal.44 None#$'(-/2359>?[bdarcs returns a filter function that tells if a char is a member of the regChar expression or not. The regChar expression is basically a set of chars, but it can contain ranges with use of the   (dash), and it can also be specified as a complement set by prefixing with ^ (caret). The dash and caret, as well as the backslash, can all be escaped with a backslash to suppress their special meaning. NOTE: The R (dot) is allowed to be escaped. It has no special meaning if it is not escaped, but the default  filename_toks7 in Darcs.Commands.Replace uses an escaped dot (WHY?). None#$'(-/2359>?^darcs$tryTokReplace tokChars old new input tries to find the token old and replace it with the token new everywhere in the input , returning G the modified input, unless the token new is already in the input in which case F is returned. A token is a sequence of bytes that match the class defined by tokChars<. This function is supposed to work efficiently with large inputs i.e. whole files.darcs&forceTokReplace tokChars old new input" replaces all occurrences of the old token with the new one, throughout the input.darcs:Check if a token replace operation touches the given line.darcsBreak a  Bytestring into tokens, according to , discarding non-tokens. None#$'(-/2359>?c darcson-disk format for V1 patchesdarcson-disk format for V2 patchesdarcsdisplay formatdarcs1This type is used to tweak the way that lists of p are shown for a given Patch type p. It is needed to maintain backwards compatibility for V1 and V2 patches.darcs#Show and read lists without braces.darcsShow lists with a single layer of braces around the outside, except for singletons which have no braces. Read with arbitrary nested braces and parens and flatten them out.darcsShow lists without braces. Read with arbitrary nested parens and flatten them out.darcsTemporary hack to disable use of showContextSeries for darcs-3 patches, until I find out how to fix this.darcsShowing and reading lists of patches. This class allows us to control how lists of patches are formatted on disk. For legacy reasons V1 patches have their own special treatment (see ). Other patch types use the default format which just puts them in a sequence without separators or any prelude/epilogue.This means that 'FL (FL p)' etc would be ambiguous, so there are no instances for 'FL p' or other list types.   None#$'(-/2359>?edarcsThis nullary type class flags code that should only be used for the tests. No instance of it should be defined in either the darcs library or the main darcs executable.None#$'(-/2359>?gdarcsLift an isomorphism between a and b to one between f a and f b. Like +, except we can only map invertible functions (i.e. an Isomorphisms).darcsLightweight type ismomorphisms (a.k.a. invertible functions). If Iso fw bw :: Iso a bthen fw and bw are supposed to satisfyfw . bw = id = bw . fwdarcsApply an iso under a functor.darcs.Apply an iso under cps (which is a cofunctor).None#$'(-/2359>?|7darcsType of primitive (not yet combined) options. The type parameter b gets instantiated to (v -> a), adding one argument of type v) to the answer type of the continuation.darcs!A type for option specifications.It consists of four components: a parser, an unparser, a checker, and a list of descriptions.The parser converts a flag list to some result value. This can never fail: we demand that primitive parsers are written so that there is always a default value (use ? with default F as a last resort).The unparser does the opposite of the parser: a value is converted back to a flag list.The checker returns a list of error messages (which should be empty if there are no problems found). This can be used to e.g. check whether there are conflicting flags in the list.Separating the checker and parser is unusual. The reason for this is that we want to support flags coming from multiple sources, such as the command line or a defaults file. Prioritising these sources is done by concatenating the flag lists in the order of precedence, so that earlier flags win over later ones. That means that when parsing the (final) flag list, conflicting flags are resolved by picking the first flag that matches an option. The checker, on the other hand, can be called for each source separately.The last component is a list of descriptors for each single switch/flag that the option is made of.The 7 type is heavily parameterized. The type arguments are: fThe flag type, such as .d0A type that describes an single flag, such as  or . It should be a .Abstracting over these types is not technically necessary: for the intended application in Darcs, we could as well fix them as d=, and f=, saving two type parameters. However, doing that here would only obscure what's going on, making the code harder to understand, not easier. Besides, the resulting more general type signatures give us additional guarantees, known as "free theorems" (free as in beer, not in speak). In contrast, the type parameters a, bare necessary to make chaining of options a la typed printf/scanf possible. In a nutshell, a is the result type of a function that consumes the result of parsing or unparsing an option, while b+ is the complete type of such a function.The  and  members use continuation passing style, which is the reason for their apparently "inverted" type signature. To understand them, it helps to look at the type of "primitive" (not yet combined) options (see ! below). For a primitive option, b gets instantiated to v -> a, where v is the type of values associated with the option. The whole option spec then has type  o :: 'OptSpec' d f a (v -> a) so that the  and  members are instantiated to  ounparse :: forall a. ([f] -> a) -> (x -> a) oparse :: forall a. (x -> a) -> ([f] -> a),which can be easily seen to be equivalent to + ounparse :: x -> [f] oparse :: [f] -> x:Chaining such options results in a combined option of type 6 o1 ^ o2 ^ ... :: OptSpec d f a (v1 -> v2 -> ... -> a) that is, b gets instantiated to  v1 -> v2 -> ... -> aTo use such an option (primitive or combined), you pass in the consumer. A typical consumer of option values is a command implementation. Given , cmd :: v1 -> v2 -> ... -> [String] -> IO ()/we can parse the flags and pass the results to cmd: ! oparse (o1 ^ o2 ^ ...) cmd flagsdarcs1Convert option value (back) to flag list, in CPS.darcsConvert flag list to option value, in CPS. Note: as a pure function, it is not supposed to fail.darcs7Check for erros in a flag list, returns error messages.darcs9Descriptions, one for each flag that makes up the option.darcs Identity  , unit for darcs composition, associativedarcsNormalise a flag list by parsing and then unparsing it. This adds all implicit (default) flags to the list.2onormalise opts = (oparse opts . ounparse opts) iddarcs!The list of default flags for an .&defaultFlags opts = onormalise opts []darcsLift an isomorphism between b and c to one between  d f a b and  d f a c.The forward component of the  is needed for , the backward component for 4. For the other two components this is the identity.darcsCombine two list valued options of the same type "in parellel". This is done by concatenating the resulting option values ( ), flags ( ), errors (), and descriptors ('), respectively, of the input options.darcs Unit for .darcsParse a list of flags against a primitive option spec, returning the value associated with the option. As noted above, this cannot fail because options always have a default value. parseFlags o fs = oparse o id fsdarcsUnparse a primitive option spec and append it to a list of flags.darcsOperator version of "opt ? flags = parseFlags opt flagsdarcsSee  and .52005 Tomasz ZielonkaGPLdarcs-devel@darcs.net experimentalportableNone#$'(-/2359>?}darcsRegisters an IO action to run just before darcs exits. Useful for removing temporary files and directories, for example. Referenced in Issue1914.2005 Benedikt SchmidtGPLdarcs-devel@darcs.net experimentalportableNone#$'(-/2359>?darcsparse a commandline returning a list of strings (intended to be used as argv) and a bool value which specifies if the command expects input on stdin format specifiers with a mapping in ftable are accepted and replaced by the given strings. E.g. if the ftable is [(s:,"Some subject")], then "%s" is replaced by "Some subject"darcsfor every mapping (c,s), add a mapping with uppercase c and the urlencoded string sNone#$'(-/2359>?BNone#$'(-/2359>? darcsData type to represent a connection error. The following are the codes from libcurl which map to each of the constructors: * 6 -> CouldNotResolveHost : The remote host was not resolved. * 7 -> CouldNotConnectToServer : Failed to connect() to host or proxy. * 28 -> OperationTimeout: the specified time-out period was reached.darcsQ represents a prioritised queue, with two-tier priority. The left list contains higher priority items than the right list.darcsA UrlState object contains a map of url -> InProgressStatus, a Q of urls waiting to be started, the current pipe length and the unique junk to create unique filenames.darcsA UrlRequest object contains a url to get, the file into which the contents at the given url should be written, the cachability of this request and the request's priority.darcs will try and take an element from the Q, preferring elements from the high priority list.darcs>Return a function for adding an element based on the priority.darcs& inserts a low priority item into a Q.darcs' inserts a high priority item into a Q.darcs5 removes any instances of a given element from the Q.darcs checks for membership in a Q.darcs is an empty Q.darcs# checks if the Q contains no items.!!22008 Dmitry Kurochkin GPLdarcs-devel@darcs.net experimentalportableNone#$'(-/2359>?  None#$'(-/2359>?Qdarcs Encode a O into a  according to the user's locale with the ghc specific //ROUNDTRIP feature added. This means the argument is allowed to contain non-Unicode :s as produced by .darcs Decode a  into a O according to the user's locale with the ghc specific //ROUNDTRIP feature added. This means the result may contain :s that are not valid Unicode in case decoding with the user's locale fails.2005 Tomasz ZielonkaGPLdarcs-devel@darcs.net experimentalportableNone#$'(-/2359>?(c) The University of Glasgow 2001, David Roundy 2003-2005GPL (I'm happy to also license this file BSD style but don't want to bother distributing two license files with darcs.droundy@abridgegame.org experimentalportableNone#$'(-/2359>?jdarcsPointer to a filesystem, possibly with start/end offsets. Supposed to be fed to (uncurry mmapFileByteString) or similar.darcsDrop leading white space, where white space is defined as consisting of ' ', 't', 'n', or 'r'.darcsDecompress the given bytestring into a lazy list of chunks, along with a boolean flag indicating (if True) that the CRC was corrupted. Inspecting the flag will cause the entire list of chunks to be evaluated (but if you throw away the list immediately this should run in constant space).darcsRead an entire file, which may or may not be gzip compressed, directly into a .darcsRead standard input, which may or may not be gzip compressed, directly into a .darcsRead in a FileSegment into a Lazy ByteString. Implemented using mmap.darcs?darcscreate a list of changes between a and b, each change has the form (starta, lima, startb, limb) which means that a[starta, lima) has to be replaced by b[startb, limb)darcstry to create nicer diffs by shifting around regions of changed linesNone#$'(-/2359>?None#$'(-/2359>?@None#$'(-/2359>? darcsLocation of the lock file.darcs.Location of the (one and only) head inventory.darcs8Location of the (one and only) tentative head inventory.darcsLocation of parent inventories.darcsLocation of pristine trees.darcsLocation of patches.darcsLocation of index files.darcsLocation of the rebase patchdarcsLocation of format filedarcsLocation of pending filesdarcsLocation of unrevert bundle.darcs7Location of old style (unhashed) files and directories.None#$'(-/2359>?darcs"Just copy pristine and inventoriesdarcs*First do a lazy clone then copy everythingdarcs8Same as Normal but omit telling user they can interrumptdarcs!Just files already known to darcsdarcs!All files, i.e. look for new onesdarcsAll files, even boring onesNone#$'(-/2359>? darcs"Undirected graph represented as a  of adjacency s.darcsSet of vertices, represented as a list for efficiency (yes, indeed).darcsVertices are represented as =.darcs,Determine the maximal independent sets in a  of a .darcsThe classic Bron-Kerbosch algorithm for determining the maximal independent sets in a .darcsEnumerate all (simple) graphs of a given size (number of vertices).darcsSplit a  into connected components. For efficiency we don't represent the result as a list of Graphs, but rather of s.darcsWhether  is equivalent to .darcsWhether ) generates only maximal independent sets.darcsWhether  generates all maximal independent sets.darcsComplete specification of the  function.None#$'(-/2359>?darcsurldarcsbodydarcs mime typedarcsresultNone#$'(-/2359>?darcsProduce a base16 (ascii-hex) encoded string from a hash. This can be turned back into a Hash (see "decodeBase16". This is a loss-less process.darcs0Take a base16-encoded string and decode it as a Hash-. If the string is malformed, yields NoHash.darcs(Compute a sha256 of a (lazy) ByteString.darcs%Same as previous but general purpose.darcsParse a , directly from its B16 encoding, given as a  , or return F. The implementation is quite low-level and optimized because the current implementation of RepoPatchV3 has to read lots of 9 hashes, and profiling showed that this is a bottleneck.22003 Peter Simons 2003 David RoundyGPLdarcs-devel@darcs.net experimentalportableNone#$'(-/2359>?{darcsAn  MCalenderTime is an underspecified  It is used for parsing dates. For example, if you want to parse the date '4 January', it may be useful to underspecify the year by setting it to F*. This uses almost the same fields as 1, a notable exception being that we introduce . to indicate if a weekday was specified or notdarcsRead/interpret a date string, assuming UTC if timezone is not specified in the string (see ) Warning! This errors out if we fail to interpret the datedarcsConvert a date string into ISO 8601 format (yyyymmdd variant) assuming local timezone if not specified in the string Warning! This errors out if we fail to interpret the datedarcs4Return the local timezone offset from UTC in secondsdarcs Similar to  , except we ignore timezone info in the input string. This is incorrect and ugly. The only reason it still exists is so we can generate file names for old-fashioned repositories in the same way that old darcs versions expected them. You should not use this function except for the above stated purpose.darcsParse a date string, assuming a default timezone if the date string does not specify one. The date formats understood are those of  and darcs Display a  in the ISO 8601 format without any separators, e.g. 20080825142503darcs+The current time in the format returned by darcsIntervals in ISO 8601, e.g.,2008-09/2012-08-17T16:302008-09/P2Y11MT16H30MP2Y11MT16H30M/2012-08-17T16:30See darcsDurations in ISO 8601, e.g.,P4Y (four years)P5M (five months)"P4Y5M (four years and five months)2P4YT3H6S (four years, three hours and six seconds)darcsIn English, either a date followed by a time, or vice-versa, e.g,yesterday at noonyesterday tea time12:00 yesterdaySee  and  Uses its first argument as "now", i.e. the time relative to which "yesterday", "today" etc are to be interpreteddarcs*English expressions for intervals of time,1before tea time (i.e. from the beginning of time)&after 14:00 last month (i.e. till now) between last year and last month2in the last three months (i.e. from then till now)!4 months ago (i.e. till now; see )darcsDurations in English that begin with the word "last", E.g. "last 4 months" is treated as the duration between 4 months ago and nowdarcs+The very beginning of time, i.e. 1970-01-01darcsTrivially convert a  to a fully specified  (note that this sets the  flag to FalsedarcsReturns the first  that falls within a  This is only unsafe in the sense that it plugs in default values for fields that have not been set, e.g. January for the month or 0 for the seconds field. Maybe we should rename it something happier. See also darcsSet a calendar to UTC time any eliminate any inconsistencies within (for example, where the weekday is given as Thursday, but this does not match what the numerical date would lead one to expect)darcsZero the time fields of a ##2004 David RoundyGPLdarcs-devel@darcs.net experimentalportableNone#$'(-/2359>?darcsA  combines a potential parse for a date string with a "matcher" function that operates on a given date. We use an existential type on the matcher to allow the date string to either be interpreted as a point in time or as an interval.darcs s" return the first matcher in  that can parse sdarcs d9 returns the list of matchers that will be applied on d. If you wish to extend the date parsing code, this will likely be the function that you modify to do so.darcs d; shows the possible interpretations for the date string d/ and how they match against the current datedarcs iso d; shows the possible interpretations for the date string d and how they match against the date represented by the ISO 8601 string isoNone#$'(-/2359>?WXYZ[\]^_`e][_`^eXY\Z None#$'(-/2359>?darcs?A set of printers to print different types of text to a handle.darcsA  is a bit of enriched text. s are concatenated using  from class 8, which is right-associative.darcsA  is either a String, a packed string, or a chunk of text with both representations.darcsA  representing a space (" ")darcsA  representing a newlinedarcsA  representing a "-"darcsA  representing a "+"darcsA  representing a "\"darcsA  that represents "("darcsA  that represents ")"darcs parens d = lparen <> d <> rparendarcsTurn a % into a sentence. This appends a ".".darcsFormat a list of ts as quoted text. It deliberately refuses to use English.andClauses but rather separates the quoted strings only with a space, because this makes it usable for copy and paste e.g. as arguments to another shell command.darcs puts a # on stdout using the given printer.darcs puts a ;, followed by a newline on stdout using the given printer.darcs puts a $ on stdout using the simple printer .darcs puts a ), followed by a newline on stdout using darcs hputDocWith puts a - on the given handle using the given printer.darcs hputDocLnWith puts a , followed by a newline on the given handle using the given printer.darcshputDoc puts a  on the given handle using darcs hputDocLn puts a 3, followed by a newline on the given handle using .darcslike & but with compress data before writingdarcsWrite a % to stderr if debugging is turned on.darcs renders a  into a O5 with control codes for the special features of the .darcs renders a  into a O using a given set of printers. If content is only available as  ByteString*, decode according to the current locale.darcs renders a  into  with control codes for the special features of the Doc. See also  readerString.darcs renders a  into a list of  PackedStrings, one for each line.darcs renders a  into a  using a given set of printers.darcs renders a  into a list of  PackedStrings4, one for each chunk of text that was added to the #, using the given set of printers.darcs builds a Doc from a O and a > representing the same text, but does not check that they do.darcs builds a  from a O:. The string is stored in the Doc as both a String and a .darcs builds a  from a  using darcs builds a  from a  using darcs creates a  with invisible text from a darcs creates a " representing a user chunk from a .4Rrrright. And what, please is that supposed to mean?darcs- creates a Doc containing just one character.darcs creates a  from a String, using .darcs creates a  from a O, using  directlydarcs creates a " containing invisible text from a Stringdarcs creates a  containing hidden text from a Stringdarcs creates a  containing a user chunk from a Stringdarcs creates a  containing colored text from a Stringdarcs n s is a  representing s line-wrapped at n charactersdarcsGiven a list of Os representing the words of a paragraph, format the paragraphs using & and separate them with an empty line.darcs A variant of 5 that takes a list of strings as input. Useful when {- LANGUAGE CPP -}7 makes it impossible to use multiline string literals.darcs Creates a  from any .darcsCreates an invisible  from any .darcsCreates a hidden  from any .darcs Creates... WTF is a userchunk???darcs is a 4 which uses the set 'simplePriners'' on any handle.darcs is the simplest 3: it just concatenates together the pieces of the darcs is the 6 for hidden text. It just replaces the document with . It's useful to have a printer that doesn't actually do anything because this allows you to have tunable policies, for example, only printing some text if it's to the terminal, but not if it's to a file or vice-versa.darcs The empty darcsa  b is a  b if a is not empty, else emptydarcsa  b is a followed by b. with a space in between if both are non-emptydarcsa  b is a above bdarcsa  b is a above b4 with an empty line in between if both are non-emptydarcsPile  s verticallydarcsPile *s vertically, with a blank line in betweendarcs Concatenate s horizontallydarcs Concatenate (s horizontally with a space as separatordarcs Quote a string for screen outputdarcs () is concatenation,  is the  darcsTogether with the language extension OverloadedStrings, this allows to use string literals where a  is expected.6655! 2008 Eric KowGPLdarcs-devel@darcs.net experimentalportableNone#$'(-/2359>?ӑdarcs singular This (Noun "batch") "" == "this batch" plural This (Noun "batch") "" == "these batches"darcsThis only distinguishes between nouns with a final -ch, and nouns which do not. More irregular nouns will just need to have their own type plural (Noun "batch") "" == "batches" plural (Noun "bat") "" == "bats" plural (Noun "mouse") "" == "mouses" -- :-(darcs/Things that have a plural and singular spellingdarcs englishNum 0 (Noun "watch") "" == "watches" englishNum 1 (Noun "watch") "" == "watch" englishNum 2 (Noun "watch") "" == "watches"darcs,Given a list of things, combine them thusly: 4orClauses ["foo", "bar", "baz"] == "foo, bar or baz"darcs,Given a list of things, combine them thusly: 4orClauses ["foo", "bar", "baz"] == "foo, bar or baz"darcs%Capitalize the first letter of a word"None#$'(-/2359>?darcsFormats an e-mail header by encoding any non-ascii characters using UTF-8 and Q-encoding, and folding lines at appropriate points. It doesn't do more than that, so the header name and header value should be well-formatted give or take line length and encoding. So no non-ASCII characters within quoted-string, quoted-pair, or atom; no semantically meaningful signs in names; no non-ASCII characters in the header name; etcetera.#None#$'(-/2359>?darcs eputDocLn puts a ), followed by a newline to stderr using . Like putDocLn, it encodes with the user's locale. This function is the recommended way to output messages that should be visible to users on the console, but cannot (or should not) be silenced even when --quiet is in effect.darcs h7 returns a set of printers suitable for outputting to h$2008 David RoundyGPLdarcs-devel@darcs.net experimentalportableNone#$'(-/2359>?ڱdarcsbeginTedious k/ starts a tedious process and registers it in  with the key k. A tedious process is one for which we want a progress indicator.Wouldn't it be safer if it had type String -> IO ProgressDataKey, so that we can ensure there is no collision? What happens if you call beginTedious twice with the same string, without calling endTedious in the meantime?darcs endTedious k* unregisters the tedious process with key k , printing Done" if such a tedious process exists.darcsXXX: document this constant  %2003 David RoundyGPLdarcs-devel@darcs.net experimentalportableNone#$'(-/2359>?۸darcscommand to rundarcs any argumentsdarcsexitcode, stderr  &None#$'(-/2359>?darcsonly shown on helpdarcs!Ask the user for a line of input.darcsAsk the user to press EnterdarcsaskUserListItem prompt xs enumerates xs? on the screen, allowing the user to choose one of the itemsdarcsPrompt the user for a yes or nodarcsPrompt the user for a character, among a list of possible ones. Always returns a lowercase character. This is because the default character (ie, the character shown in uppercase, that is automatically selected when the user presses the space bar) is shown as uppercase, hence users may want to enter it as uppercase.darcsThe prompt to displaydarcsThe string the user entered.darcsThe prompt to display  None#$'(-/2359>?߅jrjr'None#$'(-/2359>?(None#$'(-/2359>?  )None#$'(-/2359>? darcs abstracts over  and # for code constructing these valuesdarcs An empty , e.g. NilFL or NilRLdarcsA  constructed from a completely polymorphic value, for example the constructors for primitive patchesdarcs Compose two  values together in series, e.g. 'joinGap (+>+)' or 'joinGap (:>:)'darcs p is  forall y . exists x . p x y  In other words the caller is free to specify the right witness, and then the left witness is an existential. Note that the order of the type constructors is important for ensuring that  x  is dependent on the  y  that is supplied.darcs p is  forall x . exists y . p x y  In other words the caller is free to specify the left witness, and then the right witness is an existential. Note that the order of the type constructors is important for ensuring that  y  is dependent on the  x  that is supplied. This is why Stepped2 is needed, rather than writing the more obvious  ( p) which would notionally have the same quantification of the type witnesses.darcs The same as $ but for two parameters (wX and wY).darcsA  type is a way of hide an existentially quantified type parameter, in this case wX, inside the type. Note that the only thing we can currently recover about the existentially quantified type wX is that it exists.darcs Unwrap a  valuedarcs Unwrap a  value*None#$'(-/2359>?pdarcsParallel Pairsdarcs(Forking Pair (Explicit starting context)  wX wY \ / \ / \ / wU | | | wA darcs Joining Pairsdarcs)Forking Pairs (Implicit starting context)darcs Reverse listsdarcs Forward listsdarcsDirected Forward PairsdarcsfilterOutFLFL p xs deletes any x in xs for which  p x == IsEq (indicating that x has no effect as far as we are concerned, and can be safely removed from the chain)darcsMonadic fold over an  associating to the left, sequencing effects from left to right. The order of arguments follows the standard foldM from base.darcsMonadic fold over an  associating to the right, sequencing effects from right to left. Mostly useful for prepend-like operations with an effect where the order of effects is not relevant.darcsThe "natural" fold over an & i.e. associating to the right. Like . only with the more useful order of arguments.darcs;The "natural" fold over an RL i.e. associating to the left.darcsRight associative fold for s that transforms a witnessed state in the direction opposite to the ". This is the "natural" fold for #s i.e. the one which replaces the  with the passed operator.darcsThe analog of  for #s. This is the "natural" fold for #s i.e. the one which replaces the  with the passed operator.darcsLike  only for s. This function is supposed to be lazy: elements before the split point should not be touched.darcsLike  only for s. This function is supposed to be lazy: elements before the split point should not be touched.darcsLike  only for s. This function is supposed to be lazy: elements before the split point should not be touched.darcsCheck that two 7s are equal element by element. This differs from the  instance for  which uses commutation.darcs Prepend an  to an ). This traverses only the left hand side.darcs Append an  to an *. This traverses only the right hand side.11111155115555+None#$'(-/2359>?darcs"Clowns to the left of me, jokers to the right. Here I am, stuck in the middle of you" 0http://en.wikipedia.org/wiki/Stuck_in_the_MiddledarcsSee ,None#$'(-/2359>?N-None#$'(-/2359>?darcsDuring a rebase, we use "fixup" patches to maintain the correct context for the real "items" that are being stored in the rebase that the user wants to keep. As the context of the rebase changes, new fixups get added to the beginning that then need to be pushed past as many items as possible.There are multiple fixup types and multiple ways of representing the items being stored in the rebase, so this is polymorphic in both types. Also, the structure of the results varies - in some cases it will be a single value, sometimes an FL, or sometimes zero or one values (Maybe2), so the output types are separate variables. A typical instantiation would be something like PushFixupFn Fixup Item (FL Item) (FL Fixup)..None#$'(-/2359>?darcsThe 4 operation must be self-inverse, i.e. an involution:invert . invert = iddarcsDelete the first subsequence of patches that is followed by an inverse subsequence, if one exists. If not return F./None#$'(-/2359>?darcsPatchDebug is a hook class for temporarily adding debug information. To use it, add any methods that are required, implement those methods where needed, and then make it available in the relevant contexts. For example it can be temporarily added as a superclass of Patchy. The advantage of having it here already is that everything is (or should be) declared as an instance of it, so you can use defaulting or just leave out declarations of instance methods and code will still compile.darcsA dummy method so we can export/import PatchDebug(..) without triggering warnings0None#$'(-/2359>?darcsCommuteFn is the basis of a general framework for building up commutation operations between different patch types in a generic manner. Unfortunately type classes are not well suited to the problem because of the multiple possible routes by which the commuter for (FL p1, FL p2) can be built out of the commuter for (p1, p2) - and more complicated problems when we start building multiple constructors on top of each other. The type class resolution machinery really can't cope with selecting some route, because it doesn't know that all possible routes should be equivalent.Note that a CommuteFn cannot be lazy i.e. commute patches only when the resulting sequences are demanded. This is because of the possibility of failure (F): all the commutes must be performed before we can know whether the overall commute succeeds.darcs&TODO document laziness or lack thereofdarcs&TODO document laziness or lack thereofdarcs&TODO document laziness or lack thereofdarcs&TODO document laziness or lack thereofdarcsMake use of the inverse-commute law to reduce the number of cases when defining commute for complicated patch types.1None#$'(-/2359>?darcs:Commute represents things that can be (possibly) commuted.)Instances should obey the following laws:Symmetrycommute (p:>q) == Just (q':>p') <=> commute (q':>p') == Just (p':>q)If an instance Invert p exists, thencommute (p:>q) == Just (q':>p') <=> commute (invert q:>invert p) == Just (invert p':>invert q')#The more general Square-Commute lawcommute (p:>q) == Just (q':>p') => commute (invert p:>q') == Just (q:>invert p')is required to hold only for primitive patches, i.e. if there is no instance Merge p, because together with merge, it implies that any two patches commute.darcs commutes an  past an .darcs% commutes a RL past a single element.darcs% commutes a single element past a FL.darcsBuild a commuter between a patch and itself using the operation from the type class.2darcs-devel@darcs.net experimentalportableNone#$'(-/2359>?& darcs9Patches that can always be merged, even if they conflict.)Instances should obey the following laws: symmetrymerge (p :\/: q) == q' :/\: p' <=> merge (q :\/: p) == p' :/\: q' merge-commutemerge (p :\/: q) == q' :/\: p' ==> commute (p :> q') == Just (q :> p');that is, the two branches of a merge commute to each other. extensioncleanMerge (p :\/: q) == Just (q' :/\: p') => merge (p :\/: q) == q' :/\: p' that is,  is an extension of .darcsClass of patches that can, possibly, be merged cleanly, that is, without conflict.,Every patch type can be made an instance of  in a trivial way by defining  _ = F0, which vacuously conforms to all required laws.)Instances should obey the following laws: symmetrycleanMerge (p :\/: q) == Just (q' :/\: p') <=> cleanMerge (q :\/: p) == Just (p' :/\: q')If an instance  p exists, then we also require  merge-commutecleanMerge (p :\/: q) == Just (q' :/\: p') ==> commute (p :> q') == Just (q :> p')that is, the two branches of a clean merge commute to each other.If an instance  p exists, then we also require  square-mergecleanMerge (p :\/: q) == Just (q' :/\: p') => cleanMerge (invert p :\/: q') == Just (q :/\: invert p')1Here is a picture that explains why we call this  square-merge:  A---p--->X A<--p^---X | | | | | | | | q q' => q q' | | | | v v v v Y---p'-->B Y<--p'^--Bdarcs%Cleanly merge a single patch with an  of patches.darcs Synonym for .darcsLift a merge function over p :/: q to a merge function over  p :/: FL qdarcsLift a merge function over p :/: q to a merge function over  FL p :/: qdarcsLift a merge function over p :/: q to a merge function over  FL p :/: FL qdarcsSwap the two patches, $, then swap again. Used to exploit  when defining .darcsSwap the two patches, apply an arbitrary merge function, then swap again.darcsSwap the two patches, $, then swap again. Used to exploit prop_cleanMergeSymmetric when defining .darcsCombine a list of patch sequences, all starting at the same state, into a single sequence that also starts at the same state, using cleanMerge. If the merge fails, we return the two sequences that could not be merged so we can issue more detailed error messages.darcs0Whether the given pair of patches satisfies the symmetry law.darcs0Whether the given pair of patches satisfies the  merge-commute law.3None#$'(-/2359>? darcs Split an  according to a predicate, using commutation as necessary, into those that satisfy the predicate and can be commuted to the left, and those that do not satisfy it and can be commuted to the right. Whatever remains stays in the middle.Note that the predicate p, should be invariant under commutation: if commute(x:>y)==Just(y':>x') then p x == p x' && p y == p y'.darcs Split an  according to a predicate, using commutation as necessary, into those that satisfy the predicate and can be commuted to the right, and those that don't, i.e. either do not satisfy the predicate or cannot be commuted to the right.Note that the predicate p, should be invariant under commutation: if commute(x:>y)==Just(y':>x') then p x == p x' && p y == p y'.darcs x xs removes x from xs if x6 can be commuted to its head. Otherwise it returns Fdarcs is like  except with darcs ab abc returns Just c' where all the patches in ab have been commuted out of it, if possible. If this is not possible for any reason (the set of patches ab is not actually a subset of abc., or they can't be commuted out) we return F.darcs is like removeSubsequenceFL except that it works on darcsThis is a minor variant of 2 with each permutation is simply returned as a darcs p:>:ps returns all the permutations of the list in which one element of ps is commuted past p%Suppose we have a sequence of patches  X h a y s-t-c k#Suppose furthermore that the patch c depends on t, which in turn depends on s. This function will return X :> h a y s t c k h :> X a y s t c k a :> X h y s t c k y :> X h a s t c k s :> X h a y t c k k :> X h a y s t c darcs  is like ", except that we operate on an  (in other words, we are pushing things to the end of a patch sequence instead of to the beginning). darcsAll permutations of an . darcsPartition a list into the patches that merge cleanly with the given patch and those that don't (including dependencies)darcs=predicate; if true we would like the patch in the "left" listdarcsinput darcs"left", "middle" and "right"darcs>predicate; if true we would like the patch in the "right" listdarcsinput darcs"left" and "right" results    4None#$'(-/2359>?& darcs.It is natural to think of conflicting patches p and q as a parallel pair p:/:q because this is how conflicting patches arise. But then Darcs comes along and merges them anyway by converting one of them to a conflictor. Thus, inside a sequence of patches we may see them as a sequential pair (p:>q'). In that case, commute+ will always succeed, as expressed by the prop_mergeCommute law.   is a restricted version of commute that should fail in this case but otherwise give the same result as commute.Primitive patch types have no conflictors, so for them we have commute == commuteNoConflicts.)Instances should obey the following laws:SymmetrycommuteNoConflicts (p:>q) == Just (q':>p') <=> commuteNoConflicts (q':>p') == Just (p':>q)Square-Commute (if an instance  p exists)commuteNoConflicts (p:>q) == Just (q':>p') => commuteNoConflicts (invert p:>q') == Just (q:>invert p')  is a restriction of commute?commuteNoConflicts (p:>q) == Just r => commute (p:>q) == Just r darcsAn alternative to commute to be used if correctness of your code depends on the validity of the square-commute law, or to determine whether patches are in conflict. A parallel pair of patches p:/:q is conflicting if and only if commuteNoConflicts(p^:>q)/ fails. Its main use is so that we can define   cleanly. darcsThe non-conflicting merge of p:/:q tries to commute the inverse p^ of p with q. If it succeeds then the part of the result that corresponds to p^7 is re-inverted. This is also known as a "clean merge".Note that to maintain consistency in the presence of conflictors we must use use   here and not commute:. Otherwise we run into contradictions as explained below.Concretely, suppose we use commute here and that q5 is a conflictor that represents the primitive patch r- and conflicts (only) with (primitive patch) p^ . That is, q results from the conflicted merge(r:/:p^)=(s:/:q), where s* is another conflictor. Now, according to prop_mergeCommute we get commute(p^:>q)=Just(r:>s) , and thus #mergeNoConflict(p:/:q)=Just(s^:/:r)) in contradiction to our assumption that p^:/:q are in conflict i.e. mergeNoConflict(p^:/:q) fails. (This argument takes for granted that the addition of conflictors to prim patches preserves their commute behavior. This is not yet stated as a law but all implementations obviously adhere to it.)?As a side note, the fact that we now get an inverse conflictor s^ as part of the result leads to further problems. For instance, whether our repo is conflicted now depends on the order of patches: (p:>r)$ is not conflicted, but its commute (q:>s^) obviously is. In fact, (q:>s^) is nothing else but the (identity-preserving) "force-commute" of (p:>r), see the thread at https:/lists.osuosl.org pipermail darcs-devel2017-November/018403.html  5None#$'(-/2359>?'c darcsGiven an ssh URL or file path, split it into user@host, repodir, and the file (with any _darcs/ prefix removed) %2008 David Roundy GPLdarcs-devel@darcs.net experimentalportableNone#$'(-/2359>?(,  6None#$'(-/2359>?)X darcsA drop-in replacement for , which allows us to catch anything but a signal. Useful for situations where we don't want to inhibit ctrl-C.  7None#$'(-/2359>?, darcsThe firstJustIO is a slight modification to firstJustM: the entries in the list must be IO monad operations and the firstJustIO will silently turn any monad call that throws an exception into Nothing, basically causing it to be ignored. darcs,Terminate the program with an error message. darcsHandle only actual IO exceptions i.e. not "user errors" e.g. those raised by calling .We use  all over the place to signify erroneous conditions and we normally don't want to handle such errors. darcsLike  + but restricted to returning a given value. darcsLike  * but restricted to handling non-existence. darcsHandle only a those exceptions for which the predicate succeeds. 8None#$'(-/2359>?- darcsReturn the command and arguments needed to run an ssh command First try the appropriate darcs environment variable and SSH_PORT defaulting to "ssh" and no specified port.  9None#$'(-/2359>?F darcsThis is a type of "sane" file paths. These are always canonic in the sense that there are no stray slashes, no ".." components and similar. They are usually used to refer to a location within a Tree, but a relative filesystem path works just as well. These are either constructed from individual name components (using "appendPath", "catPaths" and "makeName"), or converted from a FilePath ("floatPath" -- but take care when doing that). darcsThis is for situations where a string (e.g. a command line argument) may take the value "-" to mean stdin or stdout (which one depends on context) instead of a normal file path. darcsPaths which are relative to the local darcs repository and normalized. Note: These are understood not to have the dot in front. darcsFor displaying paths to the user. It should never be used for on-disk patch storage. This adds the "./" for consistency with how repo paths are displayed by  showPatch and friends, except for the root path which is displayed as plain ".". darcs Interpret an   as relative the current working directory. Intended for IO operations in the file system. Use with care! darcs  translates whitespace in filenames to a darcs-specific format (numerical representation according to  surrounded by backslashes). Note that backslashes are also escaped since they are used in the encoding. encodeWhite "hello there" == "hello\32\there" encodeWhite "hello\there" == "hello\92\there" darcs  interprets the Darcs-specific "encoded" filenames produced by  decodeWhite "hello\32\there" == "hello there" decodeWhite "hello\92\there" == "hello\there" decodeWhite "hello\there" == error "malformed filename" darcs7Make the second path relative to the first, if possible darcsInterpret a possibly relative path wrt the current working directory. darcsTake an absolute path and a string representing a (possibly relative) path and combine them into an absolute path. If the second argument is already absolute, then the first argument gets ignored. This function also takes care that the result is converted to Posix convention and normalized. Also, parent directories ("..") at the front of the string argument get canceled out against trailing directory parts of the absolute path argument.Regarding the last point, someone more familiar with how these functions are used should verify that this is indeed necessary or at least useful. darcsExecute either the first or the second argument action, depending on whether the given path is an   or stdin/stdout. darcsWhat is a malicious path?#A spoofed path is a malicious path. =Darcs only creates explicitly relative paths (beginning with "./">), so any not explicitly relative path is surely spoofed.-Darcs normalizes paths so they never contain "/../", so paths with "/../" are surely spoofed.A path to a darcs repository's meta data can modify "trusted" patches or change safety defaults in that repository, so we check for paths containing  "/_darcs/"' which is the entry to darcs meta data.To do?How about get repositories?Would it be worth adding a --semi-safe-paths option for allowing changes to certain preference files (_darcs/prefs/) in sub repositories'?TODO: Properly review the way we handle paths on Windows - it's not enough to just use the OS native concept of path separator. Windows often accepts both path separators, and repositories always use the UNIX separator anyway. darcsIteratively tries find first non-existing path generated by buildName, it feeds to buildName the number starting with -1. When it generates non-existing path and it isn't first, it displays the message created with buildMsg. Usually used for generation of the name like  path_ number when  path# already exist (e.g. darcs.net_0). darcs1Check whether a path is a prefix of another path. darcs'Append an element to the end of a path. darcsCatenate two paths together. Not very safe, but sometimes useful (e.g. when you are representing paths relative to a different point than a Tree root). darcs&Get parent (path) of a given path. foobarbaz -> foo/bar darcs%List all parents of a given path. foobarbaz -> [.,foo, foo/bar] darcsIf the patch is under a directory, split into Right of the first component (which must be a directory name) and the rest of teh path. Otherwise return Left of the single component. This function is *undefined* on the root path (which has no components). darcsTake a "root" directory and an anchored path and produce a full t. Moreover, you can use  anchorPath "" to get a relative t. darcsMake a   from a O. If the input O4 is invalid, that is, "", ".", "..", or contains a  , return I with an error message. darcsTake a relative FilePath and turn it into an AnchoredPath. This is a partial function. Basically, by using floatPath, you are testifying that the argument is a path relative to some common root -- i.e. the root of the associated Tree object. In particular, the input path may not contain any ocurrences of "." or ".." after normalising. You should sanitize any FilePaths before you declare them "good" by converting into AnchoredPath (using this function), especially if the FilePath come from any external source (command line, file, environment, network, etc) darcs3Replace the second arg's parent with the first arg. darcsMake a   from a . darcsThe effect of renaming on paths. The first argument is the old path, the second is the new path, and the third is the possibly affected path we are interested in. darcsConstruct a filter from a list of AnchoredPaths, that will accept any path that is either a parent or a child of any of the listed paths, and discard everything else. darcs)Transform a SubPath into an AnchoredPath. darcsIs the given path in (or equal to) the _darcs metadata directory?5 5 :None#$'(-/2359>?Y darcsGiven  pred tree , produce a   that only has items for which pred returns True. The tree might contain stubs. When expanded, these will be subject to filtering as well. darcsAbstraction of a filesystem tree. Please note that the Tree returned by the respective read operations will have TreeStub items in it. To obtain a Tree without such stubs, call expand on it, eg.: (tree <- readDarcsPristine "." >>= expandWhen a Tree is expanded, it becomes "final". All stubs are forced and the Tree can be traversed purely. Access to actual file contents stays in IO though.A Tree may have a Hash associated with it. A pair of Tree's is identical whenever their hashes are (the reverse need not hold, since not all Trees come equipped with a hash). darcsGet hash of a Tree. This is guaranteed to uniquely identify the Tree (including any blob content), as far as cryptographic hashes are concerned. Sha256 is recommended. darcs)Get a hash of a TreeItem. May be Nothing. darcs Look up a  % item (an immediate subtree or blob). darcsFind a   by its path. Gives F if the path is invalid. darcsFind a   by its path. Gives F6 if the path is invalid, or does not point to a Blob. darcsFind a   by its path. Gives F6 if the path is invalid, or does not point to a Tree. darcsList all contents of a  . darcsLike   but for multiple paths. darcs>All paths in the tree that that have the given path as prefix.explodePath t p == Prelude.filter (p `isPrefix`) (map fst (list t)) darcsExpand a stubbed Tree into a one with no stubs in it. You might want to filter the tree before expanding to save IO. This is the basic implementation, which may be overriden by some Tree instances (this is especially true of the Index case). darcsUnfold a path in a (stubbed) Tree, such that the leaf node of the path is reachable without crossing any stubs. Moreover, the leaf ought not be a Stub in the resulting Tree. A non-existent path is expanded as far as it can be. darcsCheck the disk version of a Tree: expands it, and checks each hash. Returns either the expanded tree or a list of AnchoredPaths where there are problems. The first argument is the hashing function used to create the tree. darcsGiven two Trees, a guide and a tree., produces a new Tree that is a identical to tree5, but only has those items that are present in both tree and guide. The guide Tree may not contain any stubs. darcsRead a Blob into a Lazy ByteString. Might be backed by an mmap, use with care. darcsFor every pair of corresponding blobs from the two supplied trees, evaluate the supplied function and accumulate the results in a list. Hint: to get IO actions through, just use sequence on the resulting list. NB. This won't expand any stubs. darcsFor each file in each of the two supplied trees, evaluate the supplied function (supplying the corresponding file from the other tree, or Nothing) and accumulate the results in a list. Hint: to get IO actions through, just use sequence on the resulting list. NB. This won't expand any stubs. darcsCautiously extracts differing subtrees from a pair of Trees. It will never do any unneccessary expanding. Tree hashes are used to cut the comparison as high up the Tree branches as possible. The result is a pair of trees that do not share any identical subtrees. They are derived from the first and second parameters respectively and they are always fully expanded. It might be advantageous to feed the result into   or  . darcs:Modify a Tree (by replacing, or removing or adding items). darcsDoes not expand the tree. darcsDoes not expand the tree. darcsLay one tree over another. The resulting Tree will look like the base (1st parameter) Tree, although any items also present in the overlay Tree will be taken from the overlay. It is not allowed to overlay a different kind of an object, nor it is allowed for the overlay to add new objects to base. This means that the overlay Tree should be a subset of the base Tree (although any extraneous items will be ignored by the implementation). darcsSpecification of  2 2  ;None#$'(-/2359>?_  darcs  specialized to B darcs,A monad transformer that adds state of type   and an environment of type   (for the current directory). darcsInternal state of the  . Keeps track of the current   content and unsync'd changes. darcsRun a   action without storing any changes. This is useful for running monadic tree mutations for obtaining the resulting   (as opposed to their effect of writing a modified tree to disk). The actions can do both read and write -- reads are passed through to the actual filesystem, but the writes are held in memory in the form of a modified  . darcs  specialized to B darcsCheck for existence of a file. darcs#Check for existence of a directory. darcsCheck for existence of a node (file or directory, doesn't matter). darcs=Grab content of a file in the current Tree at the given path. darcsChange content of a file at a given path. The change will be eventually flushed to disk, but might be buffered for some time. darcsCreate a directory. darcsRemove the item at a path. darcsRename the item at a path. darcs,Copy an item from some path to another path.  <None#$'(-/2359>?a darcsrun a list of  s. In some monads (typically IO-based ones), the progress and error messages will be used. In others they will be ignored and just the actions will be run. darcsa monadic action, annotated with a progress message that could be printed out while running the action, and a message that could be printed out on error. Actually printing out these messages is optional to allow non-IO monads to just run the action. darcsrun a list of  s without any feedback messages  =None#$'(-/2359>?dH darcsCompute a darcs-compatible hash value for a tree-like structure. darcsRead and parse a darcs-style hashed directory listing from a given dir and with a given hash. darcs1Write a Tree into a darcs-style hashed directory. darcsRun a   action in a hashed setting. The initial1 tree is assumed to be fully available from the  directory, and any changes will be written out to same. Please note that actual filesystem files are never removed. darcsactiondarcsinitialdarcs directory >None#$'(-/2359>?f darcsosxCacheDir assumes ~LibraryCaches/ exists. darcsxdgCacheDir returns the $XDG_CACHE_HOME environment variable, or ~/.cache3 if undefined. See the FreeDesktop specification: http://standards.freedesktop.org/basedir-spec/basedir-spec-latest.html darcsgetRecursiveContents returns all files under topdir that aren't directories. darcsgetRecursiveContentsFullPath returns all files under topdir that aren't directories. Unlike getRecursiveContents this function returns the full path.  ?None#$'(-/2359>?g darcs Write out full tree to a plain directory structure. If you instead want to make incremental updates, refer to Darcs.Util.Tree.Monad.  @None#$'(-/2359>?l~ darcsReturn a list containing all the file/folder names in an index, with their respective ItemType and FileID. darcsRead an index and build up a   object from it, referring to current working directory. The initial Index object returned by openIndex is not directly useful. However, you can use  on it. Either way, to obtain the actual Tree object, call update.The usual use pattern is this: do (idx, update) <- openIndex tree <- update =<< filter predicate idx*The resulting tree will be fully expanded. darcs8Will add and remove files in index to make it match the  ' object given (it is an error for the   to contain a file or directory that does not exist in a plain form in current working directory). darcs4Read the index, starting with the root, to create a  . darcsCheck that a given file is an index file with a format we can handle. You should remove and re-create the index whenever this is not true. darcsFor a given file or folder path, get the corresponding fileID from the filesystem. ANone#$'(-/2359>?l  BNone#$'(-/2359>?t darcsTries to perform some task if it can obtain the lock, Otherwise, just gives up without doing the task darcs  safely creates an empty file (not open for writing) and returns its name.The temp file operations are rather similar to the locking operations, in that they both should always try to clean up, so exitWith causes trouble. darcs  creates a temporary file, and opens it. Both of them run their argument and then delete the file. Also, both of them (to my knowledge) are not susceptible to race conditions on the temporary file (as long as you never delete the temporary file; that would reintroduce a race condition). darcs  is like  :, except that it doesn't delete the directory afterwards. darcs  creates a temporary directory, runs the action and then removes the directory. The location of that directory is determined by the contents of _darcsprefs#tmpdir, if it exists, otherwise by  $DARCS_TMPDIR, and if that doesn't exist then whatever your operating system considers to be a a temporary directory (e.g. $TMPDIR under Unix, $TEMP under Windows).If none of those exist it creates the temporary directory in the current directory, unless the current directory is under a _darcs directory, in which case the temporary directory in the parent of the highest _darcs directory to avoid accidentally corrupting darcs's internals. This should not fail, but if it does indeed fail, we go ahead and use the current directory anyway. If $DARCS_KEEP_TMPDIR variable is set temporary directory is not removed, this can be useful for debugging. darcsDo an action in a newly created directory of the given name. If the directory is successfully created but the action raises an exception, the directory and all its content is deleted. Caught exceptions are re-thrown.  CNone#$'(-/2359>?x darcsfetchFile fileOrUrl cache returns the content of its argument (either a file or an URL). If it has to download an url, then it will use a cache as required by its second argument.We always use default remote darcs, since it is not fatal if the remote darcs does not exist or is too old -- anything that supports transfer-mode should do, and if not, we will fall back to SFTP or SCP. darcsfetchFileLazyPS fileOrUrl cache lazily reads the content of its argument (either a file or an URL). Warning: this function may constitute a fd leak; make sure to force consumption of file contents to avoid that. See "fetchFilePS" for details. darcsremote darcs executabledarcs(path representing the origin file or URLdarcsdestination pathdarcs%tell whether file to copy is cachable   DNone #$'(-/2359>? darcsRepresentation of the format of a repository. Each sublist corresponds to a line in the format file. darcs4Is a given property contained within a given format? darcs,Add a single property to an existing format. darcs1Remove a single property from an existing format. darcsIdentify the format of the repository at the given location (directory, URL, or SSH path). Fails if we weren't able to identify the format. darcsIdentify the format of the repository at the given location (directory, URL, or SSH path). Return I reason if it fails, where reason explains why we weren't able to identify the format. Note that we do no verification of the format, which is handled by   or   on the resulting  . darcs(Write the repo format to the given file. darcsCreate a repo format. The first argument specifies the patch format; the second says whether the repo has a working tree. darcs  source returns G: an error message if we cannot write to a repo in format source, or F if there's no such problem. darcs  source target returns G an error message if we cannot transfer patches from a repo in format source to a repo in format target, or F if there are no such problem. darcs  source returns G; an error message if we cannot read from a repo in format source, or F if there's no such problem.  ENone#$'(-/2359>? darcsCache is an abstract type for hiding the underlying cache locations darcsunionRemoteCaches merges caches. It tries to do better than just blindly copying remote cache entries:If remote repository is accessed through network, do not copy any cache entries from it. Taking local entries does not make sense and using network entries can lead to darcs hang when it tries to get to unaccessible host.If remote repository is local, copy all network cache entries. For local cache entries if the cache directory exists and is writable it is added as writable cache, if it exists but is not writable it is added as read-only cache.This approach should save us from bogus cache entries. One case it does not work very well is when you fetch from partial repository over network. Hopefully this is not a common case. darcs < computes the cache hash (i.e. filename) of a packed string. darcs"fetchFileUsingCache cache dir hash receives a list of caches cache-, the directory for which that file belongs dir and the hash of the file to fetch. It tries to fetch the file from one of the sources, trying them in order one by one. If the file cannot be fetched from any of the sources, this operation fails. darcsThis keeps only     entries. darcs(hashedFilePath cachelocation subdir hash( returns the physical filename of hash hash in the subdir section of  cachelocation. darcspeekInCache cache subdir hash tells whether cache# and contains an object with hash hash in a writable position. Florent: why do we want it to be in a writable position? darcs/speculateFileUsingCache cache subdirectory name takes note that the file name is likely to be useful soon: pipelined downloads will add it to the (low-priority) queue, for the rest it is a noop. darcsNote that the files are likely to be useful soon: pipelined downloads will add them to the (low-priority) queue, for the rest it is a noop. darcs5writeFileUsingCache cache compression subdir contents write the string contents to the directory subdir, except if it is already in the cache, in which case it is a noop. Warning (?) this means that in case of a hash collision, writing using writeFileUsingCache is a noop. The returned value is the filename that was given to the string. darcs2Prints an error message with a list of bad caches.' ' FNone#$'(-/2359>? darcsThe   type is a list of all flags that can ever be passed to darcs, or to one of its commands.  GNone#$'(-/2359>?B darcsThe raw material from which multi-valued options are built. See  . darcsThis is  instantiated with   and  . darcsWe do not instantiate the d in  d f directly with %. Instead we (post-) compose it with (->) +. Modulo newtype noise, this is the same as  type   f =  (  -> f)This is so we can pass a directory relative to which an option argument is interpreted (if it has the form of a relative path). darcsThis type synonym is here for brevity and because we want to import the data constructors (but not the type) of   qualified. darcs Construct a   with no arguments. darcs Construct a   with a O argument. darcs Construct a   with an optional O argument. darcs Construct a   with an   argument. darcs Construct a   with an   argument. darcs Construct a   with an optional   argument. darcs Construct a  $ from a default value and a list of  .Precondition: the list must have an entry for each possible value (type v). darcs Construct a 9 valued option with a single flag that takes no arguments and has no default flag.The arguments are: short switches, long switches, flag value, help string. darcs Construct a ? O0 valued option with a single flag that takes a O" argument and has no default flag.The arguments are: short switches, long switches, flag constructor, single flag parser, help string. darcs Construct a ?  1 valued option with a single flag that takes an  " argument and has no default flag.The arguments are: short switches, long switches, flag constructor, single flag parser, help string. darcs Similar to  , except that the flag can be given more than once. The flag arguments are collected in a list of Os. darcs Similar to  ., except that the flag arguments are optional. darcs Similar to  , except that the flag can be given more than once. The flag arguments are collected in a list of  s. darcsA deprecated option. If you want to deprecate only some flags and not the whole option, extract the  s out of the original option and create a new deprecated option. The strings in the first argument are appended to the automatically generated error message in case additional hints should be provided.  HNone#$'(-/2359>?  INone#$'(-/2359>?F  JNone#$'(-/2359>? darcs-The path of the global preference directory; ~/.darcs on Unix, and %APPDATA%/darcs on Windows. darcs6The relative path of the global preference directory; ~/.darcs on Unix, and %APPDATA%/darcs3 on Windows. This is used for online documentation. darcsboringRegexps returns a list of the boring regexps, from the local and global prefs/boring files. Any invalid regexps are filtered, preventing an exception in (potentially) pure code, when the regexps are used. darcs(addRepoSource adds a new entry to _darcsprefs)repos and sets it as default in _darcsprefsdefaultrepo, unless --no-set-default or --dry-run is passed, or it is the same repository as the current one. darcsdelete references to other repositories. Used when cloning to a ssh destination. Assume the current working dir is the repository. darcs?Fetch and return the message of the day for a given repository. darcs6Display the message of the day for a given repository,  KNone#$'(-/2359>?h   LNone#$'(-/2359>?2darcs#An object is located by giving the  of the parent  and a  .  MNone#$'(-/2359>?NNone#$'(-/2359>?ZdarcsSee module documentation for Darcs.Patch.Choices.darcsA sequence of es where each patch is either , , or . The representation is optimized for the case where we start chosing patches from the left of the sequence: patches that are = are commuted to the head immediately, but patches that are  or - are mixed together; when a patch is marked , its dependencies are not updated until we retrieve the final result.darcsA patch with a  attached to it.darcs mp i acts as a temporary identifier to help us keep track of patches during the selection process. These are useful for finding patches that may have moved around during patch selection (being pushed forwards or backwards as dependencies arise).)The identifier is implemented as a tuple  Label mp i. The i is an integer, expected to be unique within the patches being scrutinised. The mp is motivated by patch splitting; it provides a convenient way to generate a new identifier from the patch being split. For example, if we split a patch identified as Label Nothing 56, the resulting sub-patches could be identified as Label (Just (Label Nothing 5))1,  Label (Just (Label Nothing 5)) 2, etc.IOW, " is a non-empty, reversed list of =s.darcs Create a  from a sequence of patches, so that all patches are initially .darcsLabel a sequence of patches, maybe using the given parent label.darcs Create a  from an already labelled sequence of patches, so that all patches are initially .darcsLike  but lumps together  and - patches. This is more efficient than using  and then catenating  and : sections because we have to commute less. (This is what  are optimized for.)separateFirstFromMiddleLast c == case getChoices c of f:>m:>l -> f:>m+>+ldarcsLike  but lumps together  and  patches.separateFirstMiddleFromLast c == case getChoices c of f:>m:>l -> f+>+m:>ldarcs'Retrieve the resulting sections from a . The result is a triple first:>middle:>last, such that all patches in first are , all patches in middle are , and all patches in last are .darcsUse the given monadic  transformer on the  section of a ., then fold the result back into the original .darcsGiven a * determine to which section of the given  it belongs. This is not trivial to compute, since a patch tagged as  may be forced to actually be 3 by dependencies. We return a possibly re-ordered , so as not to waste the commutation effort.darcs5Force all patches matching the given predicate to be , pulling any dependencies with them. This even forces any patches that were already tagged .darcs>Force all patches labelled with one of the given labels to be , pulling any dependencies with them. This even forces any patches that were already tagged .darcs9Force a single patch labelled with the given label to be , pulling any dependencies with them. This even forces any patches that were already tagged .darcs Make all  patches either  or . This does *not* modify any patches that are already determined to be  by dependencies.darcs Similar to % only that patches are forced to be % regardless of their previous status.darcs>Force all patches labelled with one of the given labels to be , pulling any dependencies with them. This even forces any patches that were previously tagged .darcs9Force a single patch labelled with the given label to be , pulling any dependencies with them, regardless of their previous status.darcsForce a patch with the given  to be , pulling any dependencies with it, regardless of their previous status.darcsTurn  patches into  ones and  into  ones.darcsTurn  patches into  and  patches into %. Does *not* pull dependencies into 0, instead patches that cannot be commuted past  patches stay .darcsSubstitute a single ? with an equivalent list of patches, preserving its status as ,  or -). The patch is looked up using equality of s.ONone#$'(-/2359>?darcs&This is used to track changes to filesdarcsthis is used for duplicate patches that don't have any effect, but we still want to keep track of themdarcsThe PatchId identifies a patch and can be created from a PatchInfo with makePatchnamedarcsThe FileId for a file consists of the FilePath (creation name) and an index. The index denotes how many files with the same name have been added before (and subsequently deleted or moved)darcsConvert FileId to stringPNone#$'(-/2359>?darcswithFileNames takes a maybe list of existing rename-pairs, a list of filenames and an action, and returns the resulting triple of affected files, updated filename list and new rename details. If the rename-pairs are not present, a new list is generated from the filesnames.Q2002-2005 David RoundyGPLdarcs-devel@darcs.net experimentalportableNone#$'(-/2359>?~darcsApply a patch to a  , yielding a new  .darcsAttempts to apply a given patch to a Tree. If the apply fails, we return Nothing, otherwise we return the updated Tree.  RNone#$'(-/2359>?SNone#$'(-/2359>?darcsThis class is used only for user interaction, not for storage. The default implementations for  and  are suitable only for  PrimPatch and  RepoPatch types. Logically,  should default to  while  should default to /. We define them the other way around so that / gives reasonable results for all patch types.darcsshowContextPatch is used to add context to a patch, as diff -u does. Thus, it differs from showPatch only for hunks. It is used for instance before putting it into a bundle. As this unified context is not included in patch representation, this requires access to the tree.darcs Format a   to a  according to the given .NOTE: This is not only used for display but also to format patch files. This is why we have to do the white space encoding here. See ."Besides white space encoding, for  we just pack it into a . For  we must emulate the non-standard darcs-1 encoding of file paths: it is an UTF8 encoding of the raw byte stream, interpreted as code points. See also S.TNone#$'(-/2359>?˫ darcsA PatchInfo value contains the metadata of a patch. The date, name, author and log fields are UTF-8 encoded text in darcs 2.4 and later, and just sequences of bytes (decoded with whatever is the locale when displayed) in earlier darcs.'The members with names that start with '_' are not supposed to be used directly in code that does not care how the patch info is stored._piLegacyIsInverted:Historically, the  isInverted; flag was used to indicate that a Named patch was inverted.)We no longer support direct inversion of ~# patches, except sometimes via the / wrapper which tracks inversion in the wrapper.However, going even further back in time, inverted patches could be written out by darcs rollback. This was changed in 2008 so any patches on disk with this flag set would have been written by a darcs from prior to then. As they still exist, including in the darcs repository itself, we need to support them.As far as current darcs is concerned, the flag should be treated like any other field in $ apart from never being set freshly:,There is no semantic relationship between a  with piLegacyIsInverted = False and the same  with piLegacyIsInverted = True5. For example they are not inverses of each other.:New or amended patches should never be written out with _piLegacyIsInverted = True.We do need to maintain backwards compatibility so we take care to preserve things like the hash, on-disk format etc. A patch with _piLegacyIsInverted = True4 should work with all the normal darcs operations.The flag is completely separate and orthogonal to the tracking of explicit inversion in the  wrapper. The  wrapper is only used in memory and never stored to disk so there should be no confusion when reading a patch from disk. Within the codebase they serve completely different purposes and should not interact at all.darcs:See the long description of this field in the docs above.darcspatchinfo date name author log constructs a new  value with the given details, automatically assigning an Ignore-this header to guarantee the patch is unique. The function does not verify the date string's sanity.darcsaddJunk adds a line that contains a random number to make the patch unique.darcsGet the name, including an "UNDO: " prefix if the patch is a legacy inverted patch.darcsReturns the author of a patch.darcs&Returns the name of the patch. Unlike , it does not preprend "UNDO: " to the name if the patch has the legacy inverted flag set.darcsReturns the author of a patch.darcsGet the log message of a patch.darcs.Get the tag name, if the patch is a tag patch.darcsHash on patch metadata (patch name, author, date, log, and the legacy "inverted" flag. Robust against context changes but does not guarantee patch contents. Usually used as matcher or patch identifier (see Darcs.Patch.Match).darcs Parser for > as stored in patch bundles and inventory files, for example: [Document the foo interface John Doe **20110615084241 Ignore-this: 85b94f67d377c4ab671101266ef9c229 Nobody knows what a 'foo' is, so describe it. ]See  for the inverse operation.##UNone#$'(-/2359>?9darcs:Replace the pristine hash at the start of a raw, unparsed  or add it if none is present.darcsskipPristineHash drops the 'pristine: HASH' prefix line, if present.VNone#$'(-/2359>?darcsGrab a whole pristine tree from a hash, and, if asked, write files in the working tree.darcsReturns a list of pairs (FilePath, (strict) ByteString) of the pristine tree starting with the hash root. path should be either "." or end with "/" Separator "/" is used since this function is used to generate zip archives from pristine trees.darcsgetHashedFiles returns all hash files targeted by files in hashroots in the hashdir directory.WNone#$'(-/2359>? darcs3Faster equality tests for patches with an identity.darcsStorable identities.The methods here can be used to help implement ReadPatch and ShowPatch for a patch type containing the identity.:As with all Read/Show pairs, We expect that the output of showId ForStorage a can be parsed by  to produce a.darcsConstraint for patches that have an identity that is signed, i.e. can be positive (uninverted) or negative (inverted).Provided that an instance Invert0 exists, inverting a patch inverts its identity:%ident (invert p) = invertId (ident p)darcsSigned identities.Like for class Invert, we require that  is self-inverse:invertId . invertId = id0We also require that inverting changes the sign:(positiveId . invertId = not . positiveIdSide remark: in mathematical terms, these properties can be expressed by stating that  is an involution and that  is a "homomorphism of sets with an involution" (there is no official term for this) from a9 to the simplest non-trivial set with involution, namely 9 with the involution .darcs'Class of patches that have an identity.It generalizes named prim patches a la camp (see Darcs.Patch.Prim.Named) and Named patches i.e. those with a PatchInfo.Patch identity should be invariant under commutation: if there is also an  instance  p, thencommute (p :> q) == Just (q' :> p') => ident p == ident p' && ident q == ident q'The converse should also be true: patches with the same identity can be commuted (back) to the same context and then compare equal. Assuming / p :: p wX wY, (ps :> q) :: (RL p :> p) wX wZ then:ident p == ident q => commuteRL (ps :> q) == Just (p :> _)As a special case we get that parallel patches with the same identity are equal: if p :: p wX wY, q :: p wX wZ, then&ident p == ident q => p =\/= q == IsEqIn general, comparing patches via their identity is coarser than (structural) equality, so we only have)unsafeCompare p q => (ident p == ident q)darcsThis function is similar to merge&, but with one important difference: merge works on patches for which there is not necessarily a concept of identity (e.g. primitive patches, conflictors, etc). Thus it does not even try to recognize patches that are common to both sequences. Instead these are passed on to the Merge instance for single patches. This instance may handle duplicate patches by creating special patches (Duplicate, Conflictor).We do not want this to happen for named patches, or in general for patches with an identity. Instead, we want to discard one of the two duplicates, retaining only one copy. This is done by the fastRemoveFL calls below. We call mergeFL only after we have ensured that the head of the left hand side does not occur in the right hand side.darcsRemove a patch from an FL of patches with an identity. The result is G3 whenever the patch has been found and removed and F otherwise. If the patch is not found at the head of the sequence we must first commute it to the head before we can remove it.We assume that this commute always succeeds. This is justified because patches are created with a (universally) unique identity, implying that if two patches have the same identity, then they have originally been the same patch; thus being at a different position must be due to commutation, meaning we can commute it back.darcsSame as  only for .darcsFind the common and uncommon parts of two lists that start in a common context, using patch identity for comparison. Of the common patches, only one is retained, the other is discarded, similar to .darcs+Try to commute patches matching any of the  s in the set to the head of an >, i.e. backwards in history. It is not required that all the s are found in the sequence, but if they do then the traversal terminates as soon as the set is exhausted.darcs+Try to commute patches matching any of the  s in the set to the head of an =, i.e. forwards in history. It is not required that all the s are found in the sequence, but if they do then the traversal terminates as soon as the set is exhausted.darcsLike  but drag dependencies with us.darcsThe  requirement here is not technically needed but makes sense logically.XNone#$'(-/2359>?YNone#$'(-/2359>?ZNone#$'(-/2359>?darcsThis type exists for legacy support of on-disk format patch formats. It is a wrapper type that explicitly tracks the nesting of braces and parens in the on-disk representation of such patches. It is used as an intermediate form when reading such patches normally, and also for round-tripping such patches when checking the hash in bundles. It shouldn't be used for anything else.  [None#$'(-/2359>?darcsThis class is used to decode patches from their binary representation.\None#$&'(-/2359>?darcsThis property states that no prefix of the context commutes with the rest of the  patch and that the context never contains a patch and its inverse.darcs6This property states that patches in the context of a : patch as well as the patch itself are positive. It does not necessarily hold for all  patches.darcsIdentity of a contexted patch.darcs patches conflict with each other if the identity of one is in the context of the other or they cannot be merged cleanly.darcs(We sometimes want to pattern match on a  patch but still guard against violation of teh invariants. So we export a view that is isomorphic to the 4 type but doesn't allow to manipulate the internals.darcs Convert a  patch into a plain  with the patch at the end.darcsA  patch with empty context.darcs Add a patch to the context of a  patch. This is the place where we take care of the invariants.darcsAdd an  of patches to the context.darcsAdd an / of patches to the context but invert it first.darcsAdd an  of patches to the context.darcs)(Definition 10.2) Commute a patch past a  patch. This commutes it past the context and then past the patch itself. If it succeeds, the patch that we commuted past gets dropped. Note that this does not* succeed if the inverted patch is in the  patch.darcs;Not defined in the paper but used in the commute algorithm.darcsEquality between  patches reduces to equality of the identifiers of the patches referred to if we look at them from the same context. (This assumes witnesses aren't coerced in an unsafe manner.)]None#$'(-/2359>??darcs is implemented by single patches that can be repaired (Prim, Patch, RepoPatchV2) There is a default so that patch types with no current legacy problems don't need to have an implementation.darcs and  deal with repairing old patches that were were written out due to bugs or that we no longer wish to support.  is implemented by collections of patches (FL, Named, PatchInfoAnd) that might need repairing.^None#$'(-/2359>? darcs,Mangle conflicting alternatives if possible.darcs'Result of mangling a single Unravelled.darcsA list of conflicting alternatives. They form a connected component of the conflict graph i.e. one transitive conflict.darcssiftForPending ps( simplifies the candidate pending patch ps through a combination of looking for self-cancellations (sequences of patches followed by their inverses), coalescing, and getting rid of any hunk/binary patches we can commute out the backThe visual image of sifting can be quite helpful here. We are repeatedly tapping (shrinking) the patch sequence and shaking it (sift). Whatever falls out is the pending we want to keep. We do this until the sequence looks about as clean as we can get itdarcstryToShrink ps simplifies ps> by getting rid of self-cancellations or coalescing patchesQuestion (Eric Kow): what properties should this have? For example, the prim1 implementation only gets rid of the first self-cancellation it finds (as far as I can tell). Is that OK? Can we try harder?darcs ps coalesces as many patches in ps< as possible, sorting the results in some standard order.darcsIt can sometimes be handy to have a canonical representation of a given patch. We achieve this by defining a canonical form for each patch type, and a function  which takes a patch and puts it into canonical form. This routine is used by the diff function to create an optimal patch (based on an LCS algorithm) from a simple hunk describing the old and new version of a file.darcs ps puts a sequence of primitive patches into canonical form. Even if the patches are just hunk patches, this is not necessarily the same set of results as you would get if you applied the sequence to a specific tree and recalculated a diff.Note that this process does not preserve the commutation behaviour of the patches and is therefore not appropriate for use when working with already recorded patches (unless doing amend-record or the like).darcsEither  or cancel inverses.?primCoalesce (p :> q) == Just r => apply r = apply p >> apply q1primCoalesce (p :> q) == Just r => lengthFL r < 2darcs6Coalesce adjacent patches to one with the same effect..apply (primCoalesce p q) == apply p >> apply qdarcsIf ' is addition, then this is subtraction.:Just r == primCoalesce p q => primDecoalesce r p == Just q//_None#$'(-/2359>?darcs p1 p25 is used to provide an arbitrary ordering between p1 and p21. Basically, identical patches are equal and Move < DP < FP < ChangePref. Everything else is compared in dictionary order of its arguments.`None#$'(-/2359>?aNone#$&'(-/2359>?\bNone#$'(-/2359>?cNone#$&'(-/2359>?dNone#$'(-/2359>?'  eNone#$'(-/2359>?fNone#$'(-/2359>?gNone#$'(-/2359>?hNone#$'(-/2359>?]  iNone #$&'(-/2359>?jNone#$'(-/2359>?/kNone#$'(-/2359>?qlNone#$'(-/2359>?None#$'(-/2359>?..mNone#$&'(-/2359>?darcsA splitter is something that can take a patch and (possibly) render it as text in some format of its own choosing. This text can then be presented to the user for editing, and the result given to the splitter for parsing. If the parse succeeds, the result is a list of patches that could replace the original patch in any context. Typically this list will contain the changed version of the patch, along with fixup pieces to ensure that the overall effect of the list is the same as the original patch. The individual elements of the list can then be offered separately to the user, allowing them to accept some and reject others.There's no immediate application for a splitter for anything other than Prim (you shouldn't go editing named patches, you'll break them!) However you might want to compose splitters for FilePatchType to make splitters for Prim etc, and the generality doesn't cost anything.darcsThis generic splitter just lets the user edit the printed representation of the patch. Should not be used expect for testing and experimentation.darcsNever splits. In other code we normally pass around Maybe Splitter instead of using this as the default, because it saves clients that don't care about splitting from having to import this module just to get noSplitter.darcsSplit a primitive hunk patch up by allowing the user to edit both the before and after lines, then insert fixup patches to clean up the mess.nNone#$'(-/2359>?!  oNone#$'(-/2359>?darcsThe format of a merger is ,Merger undos unwindings conflicting original.undos = the effect of the merger unwindings = TODO: eh? conflicting = the patch we conflict withoriginal = the patch we really arepNone#$'(-/2359>?qNone#$'(-/2359>?fdarcsGet hold of the underlying primitives for a given patch, placed in the context of the patch. If there are conflicts then context patches will be needed.darcsAn  represents a primitive patch, together with any other primitives that are required to place the primitive in a different context. Typically, the presence of context patches indicates that the underlying primitive would be in conflict in the given context.We have the following invariants: - if a context contains a patch, that context does not also contain the inverse of that patch (when commuted next to each other) - if either context contains a patch that commutes with the underlying patch, then neither context contains the inverse of that patch (when commuted next to each other) Another way of putting it is that all possible pairs of patch+inverse that can be reached by commutation are removed.darcsGiven a list of unwound patches, use commutation and cancellation of inverses to remove intermediate contexts. This is not guaranteed to be possible in general, but should be possible if the patches that were unwound were all originally recorded (unconflicted) in the same context, e.g. as part of the same ~.darcscontext beforedarcsunderlying primitivesdarcs context afterrNone#$'(-/2359>?OdarcsThis type tags a patch with a . and also hides the context witnesses (as in Sealed2 ), so we can put them in a list.sNone #$'(-/2359>?tNone #$'(-/2359>?uNone#$'(-/2359>?ovNone#$'(-/2359>?adarcsPatches whose concrete effect can be expressed as a list of primitive patches.(A minimal definition would be either of effect or effectRL.wNone#$'(-/2359>?#darcsNonable represents the class of patches that can be turned into a Non.darcsA  stores a context with a Prim patch. It is a patch whose effect isn't visible - a Non-affecting patch.darcsunNon converts a Non into a FL of its context followed by the primitive patch.darcs3showNons creates a Doc representing a list of Nons.darcs)showNon creates a Doc representing a Non.darcs:readNons is a parser that attempts to read a list of Nons.darcs7readNon is a parser that attempts to read a single Non.darcs x cy tries to commute x past cy" and always returns some variant cy'. If commutation suceeds, the variant is just straightforwardly the commuted version. If commutation fails, the variant consists of x prepended to the context of cy.darcs xs cy commutes as many patches of xs past cy as possible, adding any that don't commute to the context of cy. Suppose we have x1 x2 x3 [c1 c2 y]and that in our example x1 fails to commute past c1&, this function would commute down to x1 [c1'' c2'' y''] x2' x3' and return [x1 c1'' c2'' y'']darcscommutePrimsOrAddToCtx takes a WL of prims and attempts to commute them past a Non.darcscommuteOrRemFromCtx attempts to remove a given patch from a Non. If the patch was not in the Non, then the commute will succeed and the modified Non will be returned. If the commute fails then the patch is either in the Non context, or the Non patch itself; we attempt to remove the patch from the context and then return the non with the updated context.TODO: understand if there is any case where p is equal to the prim patch of the Non, in which case, we return the original Non, is that right?darcscommuteOrRemFromCtxFL attempts to remove a FL of patches from a Non, returning Nothing if any of the individual removes fail.darcs(*>) attemts to modify a Non by commuting it past a given patch.darcs(>*) attempts to modify a Non, by commuting a given patch past it.darcs(*>>) attempts to modify a Non by commuting it past a given WL of patches.darcs(>>*) attempts to modify a Non by commuting a given WL of patches past it.darcsNons are equal if their context patches are equal, and they have an equal prim patch.xNone#$'(-/2359>?!-darcsThe first parameter is a context containing all patches preceding the ones for which we want to calculate the conflict resolution, which is the second parameter. Each element of the result list represents the resolution of one maximal set of transitively conflicting alternatives, in other words, a connected subset of the conflict graph. But the elements themselves must not conflict with each other, guaranteeing that they can be cleanly merged into a single  of prims.darcsBy definition, a conflicting patch is resolved if another patch (that is not itself conflicted) depends on the conflict. If the representation of conflicts is self-contained as it is for V1 and V2, then we can calculate the maximal set of conflicting alternatives for a conflict separately for each conflictor at the end of a repo. This function can then be used to lift this to an  of patches.So, when looking for conflicts in a list of patches, we go through the whole list looking for individual patches that represent a conflict. But then we try to commute them past all the patches we've already seen. If we fail, i.e. there's something that depends on the conflict, then we forget about the conflict; this is the Nothing case of the commuteNoConflictsFL call. Otherwise the patch is now in the correct position to extract the conflicting alternatives.  yNone#$'(-/2359>?'Wdarcs is used to represents prim patches that are duplicates of, or conflict with, another prim patch in the repository. Normal prim: A primitive patch Duplicate x!: This patch has no effect since x' is already present in the repository. !Etacilpud x: invert (Duplicate x)Conflictor ix xx x: ix0 is the set of patches: * that conflict with x and also conflict with another patch in the repository. * that conflict with a patch that conflict with xxx6 is the sequence of patches that conflict *only* with xx$ is the original, conflicting patch.ix and x are stored as Non objects, which include any necessary context to uniquely define the patch that is referred to.The intuition is that a Conflictor should have the effect of inverting any patches that x conflicts with, that haven't already been undone by another Conflictor in the repository. Therefore, the effect of a Conflictor is  invert xx.InvConflictor ix xx x: like invert (Conflictor ix xx x)darcs p is True if p is either a  or  patch.darcs p is True if p is either an  or .darcs is used when converting from Darcs V1 patches (Mergers) to Darcs V2 patches (Conflictors).darcs?(darcsmerger takes two patches, (which have been determined to conflict) and constructs a Merger patch to represent the conflict. p1' is considered to be conflicting with p2 (p1 is the "first" patch in the repo ordering), the resulting Merger is therefore a representation of p2.{None#$'(-/2359>?)Q|None#$'(-/2359>?)}None#$'(-/2359>?)~None#$'(-/2359>?.darcs2This slightly ad-hoc class is here so we can call  with patch types that wrap a  , such as  RebaseChange.darcsThe Named6 type adds a patch info about a patch, that is a name.NamedP info deps p represents patch p with name info. deps is a list of dependencies added at the named patch level, compared with the unnamed level (ie, dependencies added with darcs record --ask-deps).darcsThis instance takes care of handling the interaction between conflict resolution and explicit dependencies. By definition, a conflict counts as resolved if another patch depends on it. This principle extends to explicit dependencies between 7 patches, but not to (aggregate) implicit dependencies.'This means we count any patch inside a ! patch as resolved if some later  patch depends on it explicitly. The patches contained inside a  patch that is not explicitly depended on must be commuted one by one past those we know are resolved. It is important to realize that we must not do this commutation at the ) patch level but at the level below that.None#$'(-/2359>?4darcsA  encapsulates the concept of the name of a patch, without any contents. This allows us to track explicit dependencies in the rebase state, changing them to follow uses of amend-record or unsuspend on a depended-on patch, and warning the user if any are lost entirely.darcs Commute a  and a primitive patch. They trivially commute so this just involves changing the witnesses. This is unsafe if the patch being commuted actually has a name (e.g. Named or PatchInfo - PrimWithName is ok),darcs Commute a primitive patch and a . They trivially commute so this just involves changing the witnesses. This is unsafe if the patch being commuted actually has a name (e.g. Named or PatchInfo - PrimWithName is ok),darcsCommute an unnamed patch with a named patch. This is unsafe if the second patch actually does have a name (e.g. Named, PatchInfoAnd, etc), as it won't check the explicit dependencies.darcsCommute an unnamed patch with a named patch. This is unsafe if the first patch actually does have a name (e.g. Named, PatchInfoAnd, etc), as it won't check the explicit dependencies.darcsCommute a name patch and a named patch. In most cases this is trivial but we do need to check explicit dependencies.darcsCommute a named patch and a name patch. In most cases this is trivial but we do need to check explicit dependencies.  None#$'(-/2359>?5darcsA single rebase fixup, needed to ensure that the actual patches being stored in the rebase state have the correct context.darcs/Split a sequence of fixups into names and primsNone#$'(-/2359>?". We get the description of the patch from the info part of hpdarcs er hp! tries to extract a patch from a 7. If it fails, it applies the error handling function er2 to a description of the patch info component of hp. Note: this function must be lazy in its second argument, which is why we use a lazy pattern match.darcs hopefullyM is a version of  hopefully which calls fail! in a monad instead of erroring.None#$'(-/2359>?=darcs;Apply patches, emitting warnings if there are any IO errorsdarcs"Apply patches, ignoring all errorsdarcsThe default mode of applying patches: fail if the directory is not as we expectNone#$'(-/2359>?Eo darcsA  is a single chunk of a  . It has a  representing a clean tag, the hash of the previous inventory (if it exists), and the list of patches since that previous inventory.darcsThe patches in a repository are stored in chunks broken up at "clean" tags. A tag is clean if the only patches before it in the current repository ordering are ones that the tag depends on (either directly or indirectly). Each chunk is stored in a separate inventory file on disk.A  represents a repo's history as the list of patches since the last clean tag, and then a list of patch lists each delimited by clean tags.Because the invariants about clean tags can only be maintained if a  contains the whole history, the first witness is always forced to be . The type still has two witnesses so it can easily be used with combinators like  and Fork.The history is lazily loaded from disk so does not normally need to be all kept in memory.darcs; is a type used to represent the initial context of a repo.darcs takes a # and returns an equivalent, linear  of patches.darcs takes a # and returns an equivalent, linear  of patches.darcs takes a  and a  of patches that "follow" the PatchSet, and concatenates the patches into the PatchSet.darcsRuns a progress action for each tag and patch in a given PatchSet, using the passed progress message. Does not alter the PatchSet.darcsThe tag names of all tags of a given .darcsSplit a  before the latest known clean tag. The left part is what comes before the tag, the right part is the tag and its non-dependencies.darcsDrop the last n patches from the given .None#$'(-/2359>?Gdarcs Evaluate an  list and report progress.darcs Evaluate an  list and report progress.darcs Evaluate an  list and report progress. In addition to printing the number of patches we got, show the name of the last tag we got.None#$'(-/2359>?KYdarcs Take a tag's , and a &, and attempt to find the tag in the . If found, return a new 6, in which the tag is now clean (and the last of the  list), while all patches that are not covered by the tag are in the trailing list of patches. If the tag is not in the  , we return F.darcs Reorder a ( such that the latest tag becomes clean.darcs Return the  for all the patches in a 4 that are not depended on by any tag (in the given ).This is exactly the set of patches that a new tag recorded on top of the  would explicitly depend on.darcs Create a new  section for the most recent clean tag found in the tail of un- patches without re-ordering patches. Note that earlier tags may remain un-! even if they are actually clean.darcsSplit a  at the latest clean tag. The left part is what comes before the tag, the right part is the tag and its non-dependencies.None#$'(-/2359>?L8darcsApply a patch to set of  s, yielding the new set of  s and s2010 Petr RockaiMITdarcs-devel@darcs.net experimentalportableNone #$'(-/2359>?MsdarcsThis constraint expresses what is needed for a repo patch to support the high-level interface to annotation (currently annotateFile and annotateDirectory)None#$'(-/2359>?MNone#$'(-/2359>?N&None#$'(-/2359>?NnNone#$'(-/2359>?NNone#$'(-/2359>?O66None#$'(-/2359>?T0darcsA patch, together with a list of patch names that it used to depend on, but were lost during the rebasing process. The UI can use this information to report them to the user.darcsGet hold of the  patch inside a  and wrap it in a .darcsSplit a list of rebase patches into those that will have conflicts if unsuspended and those that won't.darcsGiven a list of rebase items, try to push a new fixup as far as possible into the list as possible, using both commutation and coalescing. If the fixup commutes past all the ToEdit% patches then it is dropped entirely.darcsLike  but for a list of fixups.darcsTurn a selected rebase patch back into a patch we can apply to the main repository, together with residual fixups that need to go back into the rebase state (unless the rebase is now finished). Any fixups associated with the patch will turn into conflicts.darcsLike 5, but any fixups are "reified" into a separate patch.None#$'(-/2359>?XSdarcsA single item in the rebase state consists of either a patch that is being edited, or a fixup that adjusts the context so that a subsequent patch that is being edited "makes sense".ToEdit/ holds a patch that is being edited. The name ( PatchInfo) of the patch will typically be the name the patch had before it was added to the rebase state; if it is moved back into the repository it must be given a fresh name to account for the fact that it will not necessarily have the same dependencies or content as the original patch. This is typically done by changing the  Ignore-This junk.Fixup* adjusts the context so that a subsequent ToEdit$ patch is correct. Where possible, Fixup changes are commuted as far as possible into the rebase state, so any remaining ones will typically cause a conflict when the ToEdit* patch is moved back into the repository.None#$'(-/2359>?]Hdarcs A single  Suspended9 patch contains the entire rebase state, in the form of  RebaseItems.The witnesses are such that a  Suspended appears to have no effect. This behaviour is only kept so we can read old-style rebase patches, where the entire rebase state was kept in a single patch on disk.darcs3add fixups for the name and effect of a patch to a darcsremove fixups (actually, add their inverse) for the name and effect of a patch to a darcsAdd  patches for editing to a . The patches to be suspended are renamed by replacing the junk in their  Patchinfo.The reason we rename patches immediately when suspending them is that the user may pull an identical copy from a clone, Which means we have the same patch name twice, once in the normal repo and once suspended. Furthermore, they can again suspend that copy, leaving us with multiple copies of the same patch in the rebase state. This is bad because it invalidates most of the invariants for RebaseName fixups. See issue2445 and tests/rebase-repull.sh for examples which lead to crashes when we don't do the renaming here.None#$'(-/2359>?`darcsA patch that lives in a repository where an old-style rebase is in progress. Such a repository will consist of Normal! patches along with exactly one  Suspended patch.;It is here only so that we can upgrade an old-style rebase.NormalP represents a normal patch within a respository where a rebase is in progress.  NormalP p. is given the same on-disk representation as p, so a repository can be switched into and out of rebasing mode simply by adding or removing a RebaseP/ patch and setting the appropriate format flag.*Note that the witnesses are such that the RebaseP patch has no effect on the context of the rest of the repository; in a sense the patches within it are dangling off to one side from the main repository.None#$'(-/2359>?cdarcsWrapper type to allow formal inversion of patches which aren't really invertible.darcs#Wrap a patch to make it (formally) ). The result is initially positive i.e. .darcs!Get the underlying patch from an 9, assuming (as a precondition) that it is positive i.e. .darcs&Run a function on the patch inside an . The function has to be parametric in the witnesses, so we can run it with both a  and a  patch.None#$'(-/2359>?cdNone#$'(-/2359>?dNone#$'(-/2359>?fdarcsA  Repository is a token representing the state of a repository on disk. It is parameterized by the patch type in the repository, and witnesses for the recorded state of the repository (i.e. what darcs get would retrieve), the unrecorded state (what's in the working tree now), and the tentative state, which represents work in progress that will eventually become the new recorded state unless something goes wrong.None#$'(-/2359>?kJ darcs2Remove unreferenced entries in the pristine cache.darcs+Set difference between two lists of hashes.darcs7Remove unreferenced files in the inventories directory.darcsList of special patch files that may exist in the directory _darcspatches. We must not clean those.darcs3Remove unreferenced files in the patches directory.darcsReturn a list of the inventories hashes. This function attempts to retrieve missing inventory files from the cache.darcsReturn inventories hashes by following the head inventory. This function does not attempt to retrieve missing inventory files.darcs7Return a list of the inventories hashes. The argument repoDir is the directory of the repository from which we are going to read the head inventory file. The rest of hashed files are read from the global cache.darcslistPatchesLocalBucketed is similar to listPatchesLocal, but it read the inventory directory under darcsDir in bucketed format.  None #$'(-/2359>?ldarcsgot a rebase operation to run where it is required that a rebase is already in progressdarcsGot a rebase operation to run where we may need to initialise the rebase state first. Make sure you have taken the lock before calling this.darcs/Generic status display for non-rebase commands.  None#$'(-/2359>?p9darcs takes a root hash, a patch p) and attempts to apply the patch to the   identified by h. If we encounter an old, size-prefixed pristine, we first convert it to the non-size-prefixed format, then apply the patch.darcs)applyToTentativePristine applies a patch p to the tentative pristine tree, and updates the tentative pristine hashdarcs"Used by the commands dist and diffdarcsreadHashedPristineRoot attempts to read the pristine hash from the current inventory, returning Nothing if it cannot do so.darcsgrab the pristine hash of _darcs/hash_inventory, and retrieve whole pristine tree, possibly writing a clean working tree in the process.  None#$'(-/2359>?x darcsRead the contents of pending.darcs'Read the contents of tentative pending.darcs(Write the contents of tentative pending.darcsRemove as much as possible of the given list of prim patches from the pending patch. The "as much as possible" is due to --look-for-* options which cause changes that normally must be explicitly done by the user (such as add, move, and replace) to be inferred from the the diff between pristine and working. These changes cannot be removed from pending because they have never been part of it.This function is used by Darcs whenever it adds a patch to the repository (eg. with apply or record). Think of it as one part of transferring patches from pending to somewhere else.darcs Similar to , but also takes the (old) difference between pending and working into account. It is used by amend and record commands to adjust the pending patch. See the docs for  below for details.darcs+makeNewPending repo YesUpdatePending pendPs verifies that the pendPs could be applied to pristine if we wanted to, and if so writes it to disk. If it can't be applied, pendPs must be somehow buggy, so we save it for forensics and crash.darcs?( darcsRead-only. Checks if patch-index exists for this repository it works by checking if: _darcs/patch_index/, and its corresponding files are all present?patch index version is the one handled by this version of DarcsdarcsRead-only. Checks if _darcs/noPatchIndex9 exists, that is, if patch-index is explicitely disabled.darcsCreate or update patch index if _darcs/no_patch_index exists, delete it if patch index exists, update itif not, create it from scratchdarcs+Read-only. Checks the two following things: Then only if it exists and it is not explicitely disabled, returns True, else returns False (or an error if it exists and is explicitely disabled at the same time).darcsCreates patch-index (ignoring whether it is explicitely disabled). If it is ctrl-c'ed, then aborts, delete patch-index and mark it as disabled.darcsChecks if patch-index exists and is in sync with repository (more precisely with _darcs/hashed_inventory>). That is, checks if patch-index can be used as it is now.darcsDeletes patch-index (_darcs/patch_index/< and its contents) and mark repository as disabled (creates _darcs/no_patch_index).darcsChecks if patch index can be created and build it with interrupt.darcsReturns an RL in which the order of patches matters. Useful for the annotate command. If patch-index does not exist and is not explicitely disabled, silently create it. (Also, if it is out-of-sync, which should not happen, silently update it).darcsIf a patch index is available, returns a filter that takes a list of files and returns a  PatchFilter that only keeps patches that modify the given list of files. If patch-index cannot be used, return the original input. If patch-index does not exist and is not explicitely disabled, silently create it. (Also, if it is out-of-sync, which should not happen, silently update it).darcsDump information in patch index. Patch-index should be checked to exist beforehand. Read-only.darcsRead-only sanity check on patch-index. Patch-index should be checked to exist beforehand. It may not be in sync with repository.darcs&Sequence of patches you want to filterdarcs=The repository (to attempt loading patch-index from its path)darcs>PatchSet of repository (in case we need to create patch-index)darcs8File(s) about which you want patches from given sequencedarcsFiltered sequence of patchesdarcsThe repositorydarcsPatchSet of patches of repository (in case patch-index needs to be created)darcs.PatchFilter ready to be used by SelectChanges.  2009 Petr RockaiMITdarcs-devel@darcs.net experimentalportableNone#$'(-/2359>?None#$'(-/2359>? darcsFrom a repository and a list of AnchoredPath's, construct a filter that can be used on a Tree (recorded or unrecorded state) of this repository. This constructed filter will take pending into account, so the subpaths will be translated correctly relative to pending move patches.darcs Construct a  that removes any boring files that are not also contained in the argument  .The standard use case is for the argument to be the recorded state, possibly with further patches applied, so as not to discard any files already known to darcs. The result is usually applied to the full working state.darcsConstruct a Tree filter that removes any darcs metadata files the Tree might have contained.darcs5For a repository and an optional list of paths (when F, take everything) compute a (forward) list of prims (i.e. a patch) going from the recorded state of the repository (pristine) to the unrecorded state of the repository (the working tree + pending). When a list of paths is given, at least the files that live under any of these paths in either recorded or unrecorded will be included in the resulting patch. NB. More patches may be included in this list, eg. the full contents of the pending patch. This is usually not a problem, since selectChanges will properly filter the results anyway.'This also depends on the options given:-look-for-moves: Detect pending file moves using the index. The resulting patches are added to pending and taken into consideration, when filtering the tree according to the given path list.-look-for-adds: Include files in the working state that do not exist in the recorded + pending state.+-include-boring: Include even boring files.-look-for-replaces: Detect pending replace patches. Like detected moves, these are added to the pending patch. Note that, like detected moves, these are mere proposals for the user to consider or reject.-ignore-times: Disables index usage completely -- for each file, we read both the unrecorded and the recorded copy and run a diff on them. This is very inefficient, although in extremely rare cases, the index could go out of sync (file is modified, index is updated and file is modified again within a single second).Note that use of the index is also disabled when we detect moves or replaces, since this implies that the index is out of date.darcsObtains a Tree corresponding to the "recorded" state of the repository: this is the same as the pristine cache, which is the same as the result of applying all the repository's patches to an empty directory.darcsObtains a Tree corresponding to the "unrecorded" state of the repository: the modified files of the working tree plus the "pending" patch. The optional list of paths allows to restrict the query to a subtree.Limiting the query may be more efficient, since hashes on the uninteresting parts of the index do not need to go through an up-to-date check (which involves a relatively expensive lstat(2) per file.darcs A variant of  that takes the UseIndex and ScanKnown options into account, similar to . We are only interested in the resulting tree, not the patch, so the  option is irrelevant.darcsObtains the relevant (according to the given filter) part of the working tree.darcsObtains the recorded   with the pending patch applied.darcsMark the existing index as invalid. This has to be called whenever the listing of pristine+pending changes and will cause darcs to update the index. This will happen either when we call updateIndex in finalizeRepositoryChanges or else when we try to read the index the next time. (NB. This is about files added and removed from pristine: changes to file content in either pristine or working are handled transparently by the index reading code.)darcsUpdate the index so that it matches pristine+pending. If the index does not exist or is invalid, create a new one.darcsRemove any patches (+dependencies) from a sequence that conflict with the recorded or unrecorded changes in a repodarcsAdd an  of patches started from the pending state to the pending patch. TODO: add witnesses for pending so we can make the types precise: currently the passed patch can be applied in any context, not just after pending.darcsAdd an  of patches starting from the working state to the pending patch, including as much extra context as is necessary (context meaning dependencies), by commuting the patches to be added past as much of the changes between pending and working as is possible, and including anything that doesn't commute, and the patch itself in the new pending patch.darcs9Repository itself, used for grabbing unrecorded changesdarcsRecorded patches from repository, starting from same context as the patches to filterdarcsPatches to filterdarcs>True iff any patches were removed, possibly filtered patchesNone#$'(-/2359>?{darcs working treedarcsexternal merge tool commanddarcstell whether we want GUI pausedarcs our effectdarcs their effectdarcs!them merged (standard_resolution)  None#$'(-/2359>?1darcsConstraint for a patch type p that ensures  rt p is .darcsPatches that can be matched.darcs.The string that is emitted when the user runs darcs help patterns.darcshaveNonrangeMatch flags# tells whether there is a flag in flags: which corresponds to a match that is "non-range". Thus, --match, --patch, and --hash make haveNonrangeMatch true, but not  --from-patch or  --to-patch.darcs firstMatch fs tells whether fs implies a "first match", that is if we match against patches from a point in the past on, rather than against all patches since the creation of the repository.darcssecondMatch fs tells whether fs implies a "second match", that is if we match against patches up to a point in the past on, rather than against all patches until now.darcs"Whether a patch matches the given -s. This should be invariant under inversion:&matchAPatch (invert p) = matchAPatch pdarcsmatchFirstPatchset fs ps returns the part of ps before its first matcher, ie the one that comes first dependencywise. Hence, patches in matchFirstPatchset fs ps- are the context for the ones we don't want.darcsmatchSecondPatchset fs ps returns the part of ps before its second matcher, ie the one that comes last dependencywise.darcsSplit on the second matcher. Note that this picks up the first match starting from the earliest patch in a sequence, as opposed to ? which picks up the first match starting from the latest patchdarcsmatchAPatchset m ps returns a prefix of ps ending in a patch matching m , and calls  if there is none.darcsgetMatchingTag m ps, where m is a  which matches tags returns a 7 containing all patches in the last tag which matches m. Last tag means the most recent tag in repository order, i.e. the last one you'd see if you ran darcs log -t m . Calls  if there is no matching tag.darcs7Rollback (i.e. apply the inverse) of what remains of a  after we extract a . This is the counterpart of getOnePatchset and is used to create a matching state. In particular, if the match is --index=n then rollback the last (n-1) patches; if the match is --tag, then rollback patches that are not depended on by the tag; otherwise rollback patches that follow the latest matching patch.darcsmatchingHead returns the repository up to some tag. The tag t is the last tag such that there is a patch after t that is matched by the user's query.darcsThe first element is the patches before and including the first patch matching the second matcher, the second element is the patches after it))None#$'(-/2359>?darcsUsed by: clonedarcsUsed by: amenddarcs:Used by: rebase pull/apply, send, push, pull, apply, fetchdarcsUsed by: rebase unsuspend/reifydarcs7Used by: unrecord, obliterate, rebase suspend, rollbackdarcs Used by: diffdarcsUsed by: show dependenciesdarcs Used by: logdarcs#show files/contents, dist, annotate  None#$'(-/2359>? darcs)TODO: reconsider this grouping of optionsdarcs3Options for darcs iself that act like sub-commands.darcs/ instantiates the first two type parameters of  to what we need in darcs. The first parameter is instantiated to The flag type is instantiate to  .darcsTODO someone wrote here long ago that any time --dry-run is a possibility automated users should be able to examine the results more easily with --xml. See also issue2397. dryRun w/o xml is currently used in add, pull, and repair.darcsThis option is for when a new repo gets created. Used for clone, convert import, convert darcs-2, and initialize. For clone and initialize it has the same effect as giving the name as a normal argument.The  --repodir alias is there for compatibility, should be removed eventually.7TODO We need a way to deprecate options / option names.darcsconvert, clone, initdarcsTODO: see issue2395darcs&push, apply, rebase apply: default to darcspull, rebase pull: default to darcs&pull, apply, rebase pull, rebase applydarcs:Deprecated flag, still present to output an error message.None#$'(-/2359>?CdarcsInstantiate a   with an    None #$'(-/2359>?darcs(Non-trivial interaction between options.darcsThis will become dis-entangled as soon as we inline these functions.darcs2Non-trivial interaction between options. Explicit -i or -a dominates, else --count, --xml, or  --dry-run imply -a, else use the def argument.darcsUgly. The alternative is to put the remoteRepos accessor into the IO monad, which is hardly better. However, accessing the flag list directly here is benign, as we only map over the list and don't change the order.darcs takes a String that may be a file path or a URL. It returns either the URL, or an absolute version of the path.darcsUsed by commands that expect arguments to be paths in the current repo. Invalid paths are dropped and a warning is issued. This may leave no valid paths to return. Although these commands all fail if there are no remaining valid paths, they do so in various different ways, issuing error messages tailored to the command.darcsUsed by commands that interpret a set of optional path arguments as "restrict to these paths", which affects patch selection (e.g. in log command) or selection of subtrees (e.g. in record). Because of the special meaning of "no arguments", we must distinguish it from "no valid arguments". A result of F6 here means "no restriction to the set of paths". If G4 is returned, the set is guaranteed to be non-empty.darcs takes a list of flags and returns the url of the repository specified by Repodir "directory" in that list of flags, if any. This flag is present if darcs was invoked with --repodir=DIRECTORYdarcs takes a list of flags and returns the author of the change specified by Author "Leo Tolstoy"/ in that list of flags, if any. Otherwise, if Pipe is present, asks the user who is the author and returns the answer. If neither are present, try to guess the author, from repository or global preference files or environment variables, and if it's not possible, ask the user.darcs try to guess the author, from repository or global preference files or environment variables, and if it's not possible or alwaysAsk parameter is true, ask the user. If store parameter is true, the new author is added into  _darcs/prefs.darcs tries to get the author name first from the repository preferences, then from global preferences, then from environment variables. Returns [] if it could not get it. Note that it may only return multiple possibilities when reading from global preferences.darcs takes a list of flags and returns the sendmail command to be used by  darcs send$. Looks for a command specified by SendmailCmd "command" in that list of flags, if any. This flag is present if darcs was invoked with --sendmail-command=COMMAND! Alternatively the user can set $SENDMAIL. which will be used as a fallback if present.darcsAccessor for output optiondarcs takes a list of flags and returns the subject of the mail to be sent by  darcs send$. Looks for a subject specified by Subject "subject" in that list of flags, if any. This flag is present if darcs was invoked with --subject=SUBJECTdarcs takes a list of flags and returns the addresses to send a copy of the patch bundle to when using  darcs send'. looks for a cc address specified by  Cc "address" in that list of flags. Returns the addresses as a comma separated string.  None#$'(-/2359>? darcs5Get the name of the darcs executable (as supplied by getExecutablePath)darcsSend an email, optionally containing a patch bundle (more precisely, its description and the bundle itself)darcs editFile f lets the user edit a file which could but does not need to already exist. This function returns the exit code from the text editor and a flag indicating if the user made any changes.darcsOn Posix systems, GHC by default uses the user's locale encoding to determine how to decode/encode the raw byte sequences in the Posix API to/from O. It also uses certain special variants of this encoding to determine how to handle encoding errors.See GHC.IO.Encoding for details.In particular, the default variant used for command line arguments and environment variables is /ROUNDTRIP, which means that any/ byte sequence can be decoded and re-encoded w/o failure or loss of information. To enable this, GHC uses code points that are outside the range of the regular unicode set. This is what you get with .We need to preserve the raw bytes e.g. for file names passed in by the user and also when reading file names from disk; also when re-generating files from patches, and when we display them to the user.So we want to use this encoding variant for *all* IO and for (almost) all conversions between raw bytes and Os. The encoding used for IO from and to handles is controlled by  which we use here to make it equal to the //ROUNDTRIP variant.setDarcsEncoding should be called before the first time any darcs operation is run, and again if anything else might have set those encodings to different values.Note that it isn't thread-safe and has a global effect on your program.?Adarcs opts patch prints patch4 in accordance with the flags in opts, ie, whether  --verbose or  --summary" were passed at the command-line.darcs flags patch returns a % representing the right way to show patch given the list flags! of flags darcs was invoked with.darcs prints a patch, together with its context, on standard output.None#$'(-/2359>?Π  None#$'(-/2359>?}darcsA  is a context together with some patches. The context consists of unavailable patches.darcs Interpret a  in the context of a ?. This means we match up a possible tag in the context of the +. This fails if the tag couldn't be found.darcsMinimize the context of an ' of patches to be packed into a bundle.None #$'(-/2359>?܋darcsrevertTentativeChanges swaps the tentative and "real" hashed inventory files, and then updates the tentative pristine with the "real" inventory hash.darcsfinalizeTentativeChanges trys to atomically swap the tentative inventory/pristine pointers with the "real" pointers; it first re-reads the inventory to optimize it, presumably to take account of any new tags, and then writes out the new tentative inventory, and finally does the atomic swap. In general, we can't clean the pristine cache at the same time, since a simultaneous get might be in progress.darcsAdd (append) a patch to the tentative inventory. | Warning: this allows to add any arbitrary patch! Used by convert import.darcs-readRepo returns the "current" repo patchset.darcs-readRepo returns the tentative repo patchset.darcsCopy the hashed inventory from the given location to the given repository, possibly using the given remote darcs binary.darcswriteAndReadPatch makes a patch lazy, by writing it out to disk (thus forcing it), and then re-reads the patch lazily.darcswriteTentativeInventory writes patchSet as the tentative inventory.darcswriteHashIfNecessary writes the patch and returns the resulting info/hash, if it has not already been written. If it has been written, we have the hash in the PatchInfoAnd, so we extract and return the info/hash.darcsAtomically copy the tentative state to the recorded state, thereby committing the tentative changes that were made so far. This includes inventories, pending, and the index.darcsSlightly confusingly named: as well as throwing away any tentative changes, revertRepositoryChanges also re-initialises the tentative state. It's therefore used before makign any changes to the repo.darcsWrites out a fresh copy of the inventory that minimizes the amount of inventory that need be downloaded when people pull from the repository.Specifically, it breaks up the inventory on the most recent tag. This speeds up most commands when run remotely, both because a smaller file needs to be transfered (only the most recent inventory). It also gives a guarantee that all the patches prior to a given tag are included in that tag, so less commutation and history traversal is needed. This latter issue can become very important in large repositories.darcsRead inventories and patches from a repository and return them as a 4. Note that patches and inventories are read lazily.darcsXOR of all hashes of the patches' metadata. It enables to quickly see whether two repositories have the same patches, independently of their order. It relies on the assumption that the same patch cannot be present twice in a repository. This checksum is not cryptographically secure, see  +http://robotics.stanford.edu/~xb/crypto06b/ .darcsUpgrade a possible old-style rebase in progress to the new style.None#$'(-/2359>?.GPL-2None#$'(-/2359>?darcsCreate packs from the current recorded version of the repository.None#$'(-/2359>?5None#$'(-/2359>?<darcsCreate a new pristine and working tree in the current working directory, corresponding to the state of the  returned by getOnePatchSet for the same .None#$'(-/2359>?darcsA  is a general way of associating an identity with an underlying (presumably unnamed) primitive type. This is required, for example, for V3 patches. Normally the members of the name type will be generated in some way when a patch is initially created, to guarantee global unqiueness across all repositories.None#$&'(-/2359>?darcsA handy synonym for .darcsA handy synonym for .darcseffectdarcs conflictsdarcsidentity  None#$'(-/2359>?/None#$'(-/2359>?QdarcsSigned patch identity. The % hash of the non-inverted meta data ( ) plus an = for the sequence number within the named patch, starting with 1. The = gets inverted together with the patch and must never be 0 else we could not distinguish between the patch and its inverse.darcsThis should only be used for testing, as it exposes the internal structure of a .darcs$Create an infinite list of positive s.None#$'(-/2359>?None#$'(-/2359>?None#$'(-/2359>?FGPL-2None#$'(-/2359>?darcs:The status of a given directory: is it a darcs repository?darcs'looks like a repository with some errordarcs safest guessdarcs5Tries to identify the repository in a given directorydarcs*identifyRepository identifies the repo at url. Warning: you have to know what kind of patches are found in that repo.darcsidentifyRepositoryFor repo url& identifies (and returns) the repo at url, but fails if it is not compatible for reading from and writing to.darcshunt upwards for the darcs repository This keeps changing up one parent directory, testing at each step if the current directory is a repository or not. The result is: Nothing, if no repository found Just (Left errorMessage), if bad repository found Just (Right ()), if good repository found. WARNING this changes the current directory for good if matchFn succeedsdarcsfindAllReposInDir topDir) returns all paths to repositories under topDir.None#$'(-/2359>? darcsA RepoJob wraps up an action to be performed with a repository. Because repositories can contain different types of patches, such actions typically need to be polymorphic in the kind of patch they work on. RepoJob is used to wrap up the polymorphism, and the various functions that act on a RepoJob are responsible for instantiating the underlying action with the appropriate patch type.darcsThe most common RepoJob; the underlying action can accept any patch type that a darcs repository may use.darcs(A job that only works on darcs 1 patchesdarcs(A job that only works on darcs 2 patchesdarcs8A job that works on any repository where the patch type p has  p = .This was added to support darcsden, which inspects the internals of V1 prim patches.In future this should be replaced with a more abstract inspection API as part of  PrimPatch.darcsapply a given RepoJob to a repository in the current working directorydarcs4apply a given RepoJob to a repository in a given urldarcsApply a given RepoJob to a repository in the current working directory. However, before doing the job, take the repo lock and initializes a repo transaction, unless this is a dry-run.darcsrun a lock-taking job in an old-fashion repository. only used by `darcs optimize upgrade`.darcsApply a given RepoJob to a repository in the current working directory, taking a lock. If lock not takeable, do nothing. If old-fashioned repository, do nothing. The job must not touch pending or pending.tentative, because there is no call to revertRepositoryChanges. This entry point is currently only used for attemptCreatePatchIndex.darcsIf the * of the given repo indicates that we have , then G& the repo with the refined type, else F. NB The amount of types we have to import to make this simple check is ridiculous!None#$%'(-/2359>?{darcsReturn all files available under the original working directory regardless of their repo state. Subdirectories get a separator (slash) appended.darcsReturn all files available under the original working directory that are unknown to darcs but could be added. Subdirectories get a separator (slash) appended.darcsReturn all files available under the original working directory that are known to darcs (either recorded or pending). Subdirectories get a separator (slash) appended.darcsReturn all files available under the original working directory that are modified (relative to the recorded state). Subdirectories get a separator (slash) appended.darcs-Return the available prefs of the given kind.darcsReturn an empty list.None#$'(-/2359>?None#$'(-/2359>?darcsReplace the existing pristine with a new one (loaded up in a Tree object).None#$'(-/2359>?   None#$'(-/2359>?'darcsThe type of the answers to a "shall I [wiggle] that [foo]?" question They are found in a [[KeyPress]] bunch, each list representing a set of answers which belong togetherdarcs? darcsspecify whether to ask about dependencies with respect to a particular repository, or notdarcsTransformer for interactions with a hijack warning state that we need to thread throughdarcsOptions for how to deal with the situation where we are somehow modifying a patch that is not our owndarcsaccept all hijack requestsdarcs0prompt once, accepting subsequent hijacks if yesdarcs always promptdarcs3Get the patch name and long description from one of/the configuration (flags, defaults, hard-coded)an existing log filestdin (e.g. a pipe) a text editorIt ensures the patch name is not empty nor starts with the prefix TAG.The last result component is a possible path to a temporary file that should be removed later.darcs5Run a job that involves a hijack confirmation prompt.See  for initial valuesdarcsUpdate the metadata for a patch. This potentially involves a bit of interactivity, so we may return Nothing= if there is cause to abort what we're doing along the waydarcs getAuthor tries to return the updated author for the patch. There are two different scenarios:[explicit] Either we want to override the patch author, be it by prompting the user (select.) or having them pass it in from the UI ( new_author), or[implicit] We want to keep the original author, in which case we also double-check that we are not inadvertently "hijacking" somebody else's patch (if the patch author is not the same as the repository author, we give them a chance to abort the whole operation)darcspatchname optiondarcs pipe optiondarcslogfile optiondarcsaskLongComment optiondarcs4possibly an existing patch name and long descriptiondarcschanges to recorddarcspatch name, long description and possibly the path to the temporary file that should be removed laterdarcsverb: command name darcspatch to edit, must be conflict-free as conflicts can't be preserved when changing the identity of a patch. If necessary this can be achieved by calling fmapFL_Named effect on an Named p, first, but some callers might already have Named (PrimOf p) available. darcsnew primitives to adddarcsverb: command namedarcsselect: prompt for new auhordarcsnew author: explict new authordarcspatch to update  None #$'(-/2359>?darcsA + represents a command like add, record etc.darcsSet the DARCS_PATCHES and DARCS_PATCHES_XML environment variables with info about the given patches, for use in post-hooks.darcsSet the DARCS_FILES environment variable to the files touched by the given patch, one per line, for use in post-hooks.55None #$'(-/2359>?None #$'(-/2359>?0darcs action flags patches prints a string representing the action that would be taken if the  --dry-run option had not been passed to darcs. Then darcs exits successfully. action. is the name of the action being taken, like "push" flags0 is the list of flags which were sent to darcs patches7 is the sequence of patches which would be touched by action.darcsGiven a repository and two common command options, classify the given list of paths according to whether they exist in the pristine or working tree. Paths which are neither in working nor pristine are reported and dropped. The result is a pair of path lists: those that exist only in the working tree, and those that exist in pristine or working.  None #$'(-/2359>?Cdarcs An alias for , with implicit -l (and thus implicit -s) flags. We override the default description, to include these flags.None#$'(-/2359>?None #$'(-/2359>?None#$'(-/2359>?)None#$'(-/2359>?pNone#$'(-/2359>?None#$'(-/2359>?None#$'(-/2359>?ENone#$'(-/2359>?None#$'(-/2359>?None#$'(-/2359>?None #$'(-/2359>?fNone#$'(-/2359>?None#$'(-/2359>?None#$'(-/2359>?KNone#$'(-/2359>?None#$'(-/2359>?None #$'(-/2359>?!None#$'(-/2359>?hNone #$'(-/2359>?darcs8check is an alias for repair, with implicit DryRun flag.None#$'(-/2359>?DNone #$'(-/2359>?darcscommit is an alias for recordNone #$'(-/2359>? None#$'(-/2359>?QNone #$'(-/2359>?None#$'(-/2359>? darcschanges is an alias for logNone #$'(-/2359>?dNone#$'(-/2359>?darcsThis is designed for use in an atexit handler, e.g. in Darcs.RunCommand2003 David RoundyGPLdarcs-devel@darcs.net experimentalportableNone#$'(-/2359>? darcs Flags/optionsdarcsThe path to the repositorydarcs,An action to perform on the archive contentsNone#$'(-/2359>?ZNone #$'(-/2359>?None #$'(-/2359>?None#$'(-/2359>? 1None#$'(-/2359>? xNone#$'(-/2359>? None #$'(-/2359>?!None #$'(-/2359>?!dNone #$'(-/2359>?!2004, 2007 David RoundyGPLdarcs-devel@darcs.net experimentalportableNone #$'(-/2359>?"<2002-2004 David RoundyGPLdarcs-devel@darcs.net experimentalportableNone#$'(-/2359>?"None#$'(-/2359>?#ndarcs*This class is a hack to abstract over pullapply and rebase pullapply.  None #$'(-/2359>?#None#$'(-/2359>?$1None#$'(-/2359>?$None#$'(-/2359>?%hdarcsThe commands that darcs knows about (e.g. whatsnew, record), organized into thematic groups. Note that hidden commands are also listed here.None#$'(-/2359>?+darcs-Apply defaults from all sources to a list of  s (e.g. from the command line), given the command (and possibly super command) name, and a list of all options for the command.Sources for defaults are"the builtin (hard-coded) defaults,2the defaults file in the user's configuration, and,the defaults file in the current repository.Note that the pseudo command ALL is allowed in defaults files to specify that an option should be the default for all commands to which it applies.The order of precedence for conflicting options (i.e. those belonging to same group of mutually exclusive options) is from less specific to more specific. In other words, options from the command line override all defaults, per-repo defaults override per-user defaults, which in turn override the built-in defaults. Inside the options from a defaults file, options for the given command override options for the ALL pseudo command.Conflicting options at the same level of precedence are not allowed.Errors encountered during processing of command line or defaults flags are formatted and added as (separate) strings to the list of error messages that are returned together with the resulting flag list.darcsmaybe name of super commanddarcsthe darcs commanddarcsthe original working directory, i.e. the one from which darcs was invokeddarcslines from user defaultsdarcslines from repo defaultsdarcsflags from command lineNone #$'(-/2359>?+None#$'(-/2359>?,4None #$'(-/2359>?,                                                                                                                               !!!!!!!!!!!!!!!!!!!!""" " # # # # # # # # $ $ $ $ $ $ $ $ $ $ $ % % % % % % % % % % % % % % % % & & & & & & & & & & & & ' ' ' ' ( ( ( ( ( ( ( ( ( ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * + + + + + + + + + + + + + + , , , , , , - - - - - - - - . . . . . . . . / / / / 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 4 4 4 5 5 5 5 5 5 5 5 5 5 5 5  6 6 6 6 6 6 6 6 7 7 7 7 7 7 7 7 7 7 7 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 9 9 9 9 9 99 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 99 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 : ::: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : ; ; ; ; ; ; ; ; ; ; ;;; ; ; ; ; ; ; < < < < < < < < < = = = = = = = = = = = > > > > > > > > ? ? @ @ @ @ @ @ @ @ @ @ @ @ @ A A A A B B B B B B B B B B B B B B B B B B B B B B B B B B B C C C C C C C C C D D D D D D D DD D D D D D D D D D D D D D D D E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E E FFF F F F F F F F FFF F F FFFF F F F F F F F F F F F F F F F FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGHIIIIJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJKKKKKKKKKKKKKKLLLLLLL L LLLLLLLLLLLLLMMMMMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOOOOOOOOOOOOOOOOOOOOOPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPQQQQQQQQQQQRRRRSSSSSSSSSSSSSSSSTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUVVVVVVVVWWWWWWWWWWWWWWWWWWWWWWWWWXXXXXXYYYYYYYZZZZZZZZZZZ[[[[[[[[[[\\\\\\\\\\\\\\\\\\\\\\\]]]]]]]]]]^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^________________________________`abcccccccdddddddddddddddddeefffghhhhhhhhhhhhhhhhhhhhhhhhhhhhiijkkllmmmmmmmmnnnnnnnnnnnoooooooooooooooppqqqqqqqqqqqrrrrrrrrrrrrrrrrrrrrrrsssssstttttttttuvvvvwwwwwwwwwwwwwwwwwwwwwwwwxxxxxxxxyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyzzzzzzzzzzzzzzzzzzzzz{||}}~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~             $N#darcs-2.16.4-6f4et5Z3QwEK3zj6Lmh9t8 Darcs.PreludeDarcs.Util.ParserDarcs.Util.RatifiedDarcs.Util.ByteStringDarcs.Util.WorkaroundDarcs.Util.DateTimeDarcs.Patch.RepoTypeDarcs.Patch.Witnesses.UnsafeDarcs.Patch.Witnesses.EqDarcs.Patch.RegCharsDarcs.Patch.TokenReplaceDarcs.Patch.FormatDarcs.Test.TestOnlyDarcs.UI.Options.IsoDarcs.UI.Options.CoreDarcs.Util.AtExitDarcs.Util.CommandLineDarcs.Util.Download.RequestDarcs.Util.DownloadDarcs.Util.EncodingDarcs.Util.GlobalDarcs.Util.Diff.MyersDarcs.Util.Diff.PatienceDarcs.Util.DiffDarcs.Repository.PathsDarcs.Repository.FlagsDarcs.Util.GraphDarcs.Util.HTTPDarcs.Util.HashDarcs.Util.IsoDateDarcs.Util.DateMatcherDarcs.Util.PrinterDarcs.Util.EnglishDarcs.UI.EmailDarcs.Util.Printer.ColorDarcs.Util.ProgressDarcs.Util.ExecDarcs.Util.PromptDarcs.Util.ShowDarcs.Patch.Witnesses.ShowDarcs.Patch.Witnesses.SealedDarcs.Patch.Witnesses.OrderedDarcs.Patch.Witnesses.WZipperDarcs.Patch.Witnesses.MaybeDarcs.Patch.Rebase.PushFixupDarcs.Patch.InvertDarcs.Patch.DebugDarcs.Patch.CommuteFnDarcs.Patch.CommuteDarcs.Patch.MergeDarcs.Patch.PermutationsDarcs.Patch.CommuteNoConflictsDarcs.Util.URLDarcs.Util.SignalHandlerDarcs.Util.ExceptionDarcs.Util.SshDarcs.Util.PathDarcs.Util.TreeDarcs.Util.Tree.MonadDarcs.Patch.MonadProgressDarcs.Util.Tree.HashedDarcs.Util.FileDarcs.Util.Tree.PlainDarcs.Util.IndexDarcs.Util.CompatDarcs.Util.LockDarcs.Util.ExternalDarcs.Repository.FormatDarcs.Repository.CacheDarcs.UI.Options.FlagsDarcs.UI.Options.UtilDarcs.UI.Options.MarkdownDarcs.UI.Commands.Util.TreeDarcs.Repository.PrefsDarcs.Patch.SummaryData#Darcs.Patch.Prim.FileUUID.ObjectMapDarcs.Patch.InspectDarcs.Patch.ChoicesDarcs.Patch.Index.TypesDarcs.Patch.ApplyMonadDarcs.Patch.ApplyDarcs.Patch.TouchesFilesDarcs.Patch.ShowDarcs.Patch.InfoDarcs.Repository.InventoryDarcs.Repository.HashedIODarcs.Patch.IdentDarcs.Patch.FileHunkDarcs.Patch.ViewingDarcs.Patch.BracketedDarcs.Patch.ReadDarcs.Patch.V3.ContextedDarcs.Patch.RepairDarcs.Patch.Prim.ClassDarcs.Patch.Prim.V1.CoreDarcs.Patch.Prim.V1.ReadDarcs.Patch.Prim.V1.MangleDarcs.Patch.Prim.V1.DetailsDarcs.Patch.Prim.V1.ShowDarcs.Patch.Prim.V1.CommuteDarcs.Patch.Prim.V1.CoalesceDarcs.Patch.Prim.V1.ApplyDarcs.Patch.Prim.V1Darcs.Patch.Prim.FileUUID.CoreDarcs.Patch.Prim.FileUUID.Read!Darcs.Patch.Prim.FileUUID.Details!Darcs.Patch.Prim.FileUUID.Commute"Darcs.Patch.Prim.FileUUID.CoalesceDarcs.Patch.SplitDarcs.Patch.FromPrimDarcs.Patch.V1.CoreDarcs.Patch.V1.ShowDarcs.Patch.UnwindDarcs.Patch.SummaryDarcs.Patch.Prim.FileUUID.ShowDarcs.Patch.Prim.FileUUID.ApplyDarcs.Patch.Prim.FileUUIDDarcs.Patch.EffectDarcs.Patch.V2.NonDarcs.Patch.ConflictDarcs.Patch.V2.RepoPatchDarcs.Patch.V1.CommuteDarcs.Patch.V1.ReadDarcs.Patch.V1.ApplyDarcs.Patch.V1.ViewingDarcs.Patch.NamedDarcs.Patch.Rebase.NameDarcs.Patch.Rebase.FixupDarcs.Patch.PatchInfoAndDarcs.Repository.ApplyPatchesDarcs.Patch.SetDarcs.Patch.ProgressDarcs.Patch.DependsDarcs.Patch.Index.MonadDarcs.Patch.AnnotateDarcs.Patch.V2.PrimDarcs.Patch.V1.PrimDarcs.Patch.RepoPatchDarcs.Patch.Rebase.ChangeDarcs.Patch.Rebase.Legacy.ItemDarcs.Patch.Rebase.SuspendedDarcs.Patch.Named.WrappedDarcs.Patch.InvertibleDarcs.Repository.OldDarcs.Repository.InternalTypesDarcs.Repository.TraverseDarcs.Repository.RebaseDarcs.Repository.PristineDarcs.Repository.PendingDarcs.Repository.PatchIndexDarcs.Repository.DiffDarcs.Repository.StateDarcs.Repository.ResolutionDarcs.Patch.MatchDarcs.UI.Options.MatchingDarcs.UI.Options.AllDarcs.UI.OptionsDarcs.UI.FlagsDarcs.UI.ExternalDarcs.UI.PrintPatchDarcs.UI.Commands.Convert.UtilDarcs.Patch.BundleDarcs.Repository.HashedDarcs.Repository.RepairDarcs.Repository.PacksDarcs.Repository.MergeDarcs.Repository.MatchDarcs.Patch.Prim.WithNameDarcs.Patch.V3.CoreDarcs.Patch.V3.ResolutionDarcs.Patch.Prim.NamedDarcs.Patch.V3Darcs.Repository.WorkingDarcs.Repository.TestDarcs.Repository.IdentifyDarcs.Repository.JobDarcs.UI.CompletionDarcs.Repository.CreateDarcs.Repository.CloneDarcs.UI.SelectChangesDarcs.UI.PatchHeaderDarcs.UI.CommandsDarcs.UI.UsageDarcs.UI.Commands.UtilDarcs.UI.Commands.WhatsNewDarcs.UI.Commands.UnrevertDarcs.UI.Commands.UnrecordDarcs.UI.Commands.TransferModeDarcs.UI.Commands.TestDarcs.UI.Commands.TagDarcs.UI.Commands.ShowTagsDarcs.UI.Commands.ShowRepo Darcs.UI.Commands.ShowPatchIndexDarcs.UI.Commands.ShowIndexDarcs.UI.Commands.ShowFiles"Darcs.UI.Commands.ShowDependenciesDarcs.UI.Commands.ShowContentsDarcs.UI.Commands.ShowAuthorsDarcs.UI.Commands.ShowDarcs.UI.Commands.SetPrefDarcs.UI.Commands.RollbackDarcs.UI.Commands.RevertDarcs.UI.Commands.ReplaceDarcs.UI.Commands.RepairDarcs.UI.Commands.RemoveDarcs.UI.Commands.RecordDarcs.UI.Commands.OptimizeDarcs.UI.Commands.MoveDarcs.UI.Commands.MarkConflictsDarcs.UI.Commands.LogDarcs.UI.Commands.InitDarcs.UI.Commands.GZCRCsDarcs.UI.Commands.DistDarcs.UI.Commands.Diff Darcs.UI.Commands.Convert.Import Darcs.UI.Commands.Convert.Export Darcs.UI.Commands.Convert.Darcs2Darcs.UI.Commands.ConvertDarcs.UI.Commands.CloneDarcs.UI.Commands.SendDarcs.UI.Commands.PushDarcs.UI.Commands.AnnotateDarcs.UI.Commands.AmendDarcs.UI.Commands.AddDarcs.UI.ApplyPatchesDarcs.UI.Commands.PullDarcs.UI.Commands.ApplyDarcs.UI.Commands.RebaseDarcs.UI.TheCommandsDarcs.UI.DefaultsDarcs.UI.RunCommandDarcs.UI.Commands.Help DarcsFlagSystem.Console.GetOptOptDescr DarcsOptDescr Data.FunctorFunctorsetEnvCautiouslyPreludefoldrTreefilterDarcsUtil.Path AbsolutePath showFriendlywritePatchIfNecessary readFileNameNamed InvertibleDarcs.Patch.PrimDarcs.Patch.V2Darcs.Patch.V1 Darcs.PatchDarcs.RepositoryVersionbaseGHC.Base++ghc-primGHC.PrimseqGHC.Listzip System.IOprint Data.Tuplefstsnd otherwisemap$GHC.Num fromInteger-GHC.Real fromRationalGHC.EnumenumFrom enumFromThen enumFromToenumFromThenTo GHC.Classes==>=negate>>=>>fmapreturnControl.Monad.Failfail fromIntegral realToFrac toInteger toRational<>memptymappendmconcat<*>pure*>BoundedEnumEq GHC.FloatFloating FractionalIntegralMonadNumOrdGHC.ReadReadReal RealFloatRealFracGHC.ShowShow MonadFail Applicative Data.FoldableFoldableData.Traversable Traversable SemigroupMonoid GHC.TypesBoolCharDoubleFloatIntinteger-wired-inGHC.Integer.TypeInteger GHC.MaybeMaybeOrderingRationalIOWord Data.EitherEitherFalseNothingJustTrueLeftRightLTEQGT<$>StringreadListconst.id<*<$mapM_ Text.Readread*attoparsec-0.13.2.5-3Ta7Wj3K9PO4plIoTGCGZT Data.Attoparsec.ByteString.Char8 skipSpace skipWhiletakeTillanyChar#Data.Attoparsec.ByteString.InternaltakeParserData.Attoparsec.CombinatoroptionchoiceData.Attoparsec.Internal endOfInputsequencemapM sequenceAtraverseControl.ApplicativeoptionalreadIOreadLn appendFile writeFilereadFileinteract getContentsgetLinegetCharputStrLnputStrputCharGHC.IO.Handle.Text hGetContentsGHC.IO.ExceptionioErrorGHC.IOFilePath userErrorIOErrornotElemallanyorand concatMapconcat sequence_productsumminimummaximumelemlengthnullfoldl1foldr1foldlfoldMap Data.OldListunwordswordsunlineslinesreadseitherlex readParen readsPrecText.ParserCombinators.ReadPReadSatanhacoshasinhtanhcoshsinhatanacosasintancossinlogBase**sqrtexpatan2isIEEEisNegativeZeroisDenormalized isInfiniteisNaN scaleFloat significandexponent encodeFloat decodeFloat floatRange floatDigits floatRadixlcmgcd^^oddevendivModquotRemmoddivremquotrecip/floorceilingroundtruncateproperFractionmaxBoundminBoundfromEnumtoEnumsucc showParen showStringshowCharshowsShowSshowListshow showsPrecunzip3unzipzipWith3zipWithzip3!!reversebreakspansplitAtdrop dropWhile takeWhilecycle replicaterepeatiteratescanr1scanrscanl1scanlinitlasttailhead Data.Maybemaybeuncurrycurrysubtractsignumabs*+asTypeOfuntil$!flip=<<stimessconcatliftA2GHC.Err undefinederrorWithoutStackTraceerrorcompare<<=>maxmin/=&&||notbytestring-0.10.10.0Data.ByteString intercalatedirectory-1.3.6.0System.DirectorygetCurrentDirectory time-1.9.3Data.Time.Clock.POSIXgetCurrentTime unix-2.7.2.2System.Posix.SignalsinstallHandler raiseSignalsigTERMsigPIPEsigINTsigHUPsigALRMsigABRTSignal CatchInfoOnce CatchInfo CatchOnceCatchIgnoreDefaultHandler SRepoType IsRepoTypesingletonRepoType RebaseTypeOfRepoType rebaseType IsRebaseType SRebaseType SIsRebase SNoRebase RebaseTypeIsRebaseNoRebase$fIsRebaseTypeNoRebase$fIsRebaseTypeIsRebase$fIsRepoTypeRepoType unsafeCoercePunsafeCoercePStartunsafeCoercePEndunsafeCoerceP1Eq2 unsafeCompare=\/==/\=EqCheckIsEqNotEqisIsEq $fShowEqCheck $fEqEqCheckregChars tryTokReplaceforceTokReplaceannotateReplace breakToTokens defaultToksFileNameFormatFileNameFormatV1FileNameFormatV2FileNameFormatDisplay ListFormatListFormatDefault ListFormatV1 ListFormatV2 ListFormatV3PatchListFormatpatchListFormat$fEqFileNameFormat$fShowFileNameFormatTestOnly IsoFunctorimapIsoundercps PrimOptSpecOptSpecounparseoparseocheckodescoid^ onormalise defaultFlagsoimapoappendoempty parseFlags unparseOpt?$fIsoFunctorOptSpec$fMonoidOptSpec$fSemigroupOptSpecatexit withAtexitparseCmd addUrlencoded toSeconds startOfTimeformatDateTime parseDateTime fromClockTimeConnectionErrorCouldNotResolveHostCouldNotConnectToServerOperationTimeoutQUrlState inProgress waitToStart pipeLength randomJunk UrlRequesturlfilecachablepriorityCachable UncachableMaxAgePriorityHighLowreadQaddUsingPriorityinsertQpushQdeleteQelemQemptyQnullQ$fEqConnectionError$fReadConnectionError$fShowConnectionError$fShowCachable $fEqCachable $fEqPrioritymaxPipelineLengthdisableHTTPPipelining setDebugHTTPenvironmentHelpProxyenvironmentHelpProxyPasswordencodedecode encodeUtf8 decodeUtf8 setDebugMode whenDebugMode withDebugMode debugMessage putTimingsetTimingsMode timingsMode addCRCWarninggetCRCWarningsresetCRCWarningsdarcsdirdefaultRemoteDarcsCmddarcsLastMessagedarcsSendMessagedarcsSendMessageFinal FileSegment dropSpaceisFunkyhashPSsubstrPS breakFirstPS breakLastPSlinesPS unlinesPS#prop_unlinesPS_linesPS_left_inverseprop_linesPS_lengthprop_unlinesPS_length gzDecompressisGZFile gzReadFilePS gzWriteFilePSgzWriteFilePSs gzWriteHandle gzReadStdin readSegment mmapFilePS fromPS2Hex fromHex2PSpropHexConversionbetweenLinesPSspec_betweenLinesPSisAsciiunpackPSFromUTF8packStringToUTF8 decodeLocale encodeLocalePArray getChangesgetSliceshiftBoundariesinitPaLen DiffAlgorithm PatienceDiff MyersDiff$fEqDiffAlgorithm$fShowDiffAlgorithmmakeDarcsdirPathlockPathhashedInventoryhashedInventoryPathtentativeHashedInventorytentativeHashedInventoryPathinventoriesDirinventoriesDirPathtentativePristinePath pristineDirpristineDirPath patchesDirpatchesDirPath indexPathindexInvalidPath rebasePathtentativeRebasePath formatPath pendingPathtentativePendingPathnewPendingPath unrevertPatholdPristineDirPatholdCurrentDirPatholdCheckpointDirPatholdInventoryPatholdTentativeInventoryPath HookConfigcmdprompt HooksConfigprepost PatchFormat PatchFormat1 PatchFormat2 PatchFormat3 ForgetParentYesForgetParentNoForgetParentWithWorkingDir NoWorkingDir WantGuiPauseYesWantGuiPauseNoWantGuiPauseWorkRepo WorkRepoDirWorkRepoPossibleURLWorkRepoCurrentDir ExternalMergeYesExternalMergeNoExternalMergeAllowConflictsNoAllowConflictsYesAllowConflictsYesAllowConflictsAndMark CloneKind LazyClone NormalClone CompleteClone ScanKnownScanAll ScanBoringUseIndex IgnoreIndexInheritDefaultYesInheritDefaultNoInheritDefault SetDefault YesSetDefault NoSetDefault RemoteRepos LeaveTestDirYesLeaveTestDirNoLeaveTestDirSetScriptsExecutableYesSetScriptsExecutableNoSetScriptsExecutableRunTest YesRunTest NoRunTest IncludeBoringYesIncludeBoringNoIncludeBoring LookForMovesYesLookForMovesNoLookForMovesLookForReplacesYesLookForReplacesNoLookForReplaces LookForAddsYesLookForAdds NoLookForAddsUMaskYesUMaskNoUMaskDryRun YesDryRunNoDryRunUseCache YesUseCache NoUseCache UpdatePendingYesUpdatePendingNoUpdatePendingReorder NoReorder RemoteDarcsDefaultRemoteDarcsWithPatchIndex YesPatchIndex NoPatchIndex Compression NoCompressionGzipCompression VerbosityQuietNormalVerbosityVerbose remoteDarcs$fEqPatchFormat$fShowPatchFormat$fEqForgetParent$fShowForgetParent$fEqWithWorkingDir$fShowWithWorkingDir$fEqWantGuiPause$fShowWantGuiPause $fEqWorkRepo$fShowWorkRepo$fEqExternalMerge$fShowExternalMerge$fEqAllowConflicts$fShowAllowConflicts $fEqCloneKind$fShowCloneKind $fEqScanKnown$fShowScanKnown $fEqUseIndex$fShowUseIndex$fEqInheritDefault$fShowInheritDefault$fEqSetDefault$fShowSetDefault$fEqRemoteRepos$fShowRemoteRepos$fEqLeaveTestDir$fShowLeaveTestDir$fEqSetScriptsExecutable$fShowSetScriptsExecutable $fEqRunTest $fShowRunTest$fEqIncludeBoring$fShowIncludeBoring$fEqLookForMoves$fShowLookForMoves$fEqLookForReplaces$fShowLookForReplaces$fEqLookForAdds$fShowLookForAdds $fEqUMask $fShowUMask $fEqDryRun $fShowDryRun $fEqUseCache$fShowUseCache$fEqUpdatePending$fShowUpdatePending $fEqReorder$fEqRemoteDarcs$fShowRemoteDarcs$fEqWithPatchIndex$fShowWithPatchIndex$fEqCompression$fShowCompression $fEqVerbosity$fShowVerbosity ComponentGraph VertexSetVertexltmisbkmis genGraphs genComponents componentsprop_ltmis_eq_bkmis#prop_ltmis_maximal_independent_sets'prop_ltmis_all_maximal_independent_setsprop_components$fShowComponent copyRemotecopyRemoteLazyspeculateRemotepostUrlSHA1HashSHA256NoHash encodeBase16 decodeBase16sha256 sha256sumrawHashmatchsha1Xorsha1zero sha1shortsha1PS showAsHexsha1Readsha1Show $fBinarySHA1 $fShowSHA1$fEqSHA1 $fOrdSHA1 $fShowHash$fEqHash $fOrdHash $fReadHash MCalendarTimemctYearmctMonthmctDaymctHourmctMinmctSec mctPicosecmctWDaymctYDay mctTZNamemctTZmctIsDSTmctWeek TimeInterval readUTCDatecleanLocalDate getLocalTzreadUTCDateOldFashioned parseDateshowIsoDateTimegetIsoDateTimeiso8601Intervaliso8601DurationenglishDateTimeenglishInterval englishLast theBeginningtoMCalendarTimeunsafeToCalendarTime addToMCalsubtractFromMCal resetCalendar unsetTime$fShowMCalendarTime DateMatcherDMparseDateMatcher getMatcherstestDate testDateAtparselexWordlexChar lexStringcharstringint takeTillChar checkConsumeslinesStartingWithlinesStartingWithEndingWithColorBlueRedGreenCyanMagentaPrinter Printers'PrinterscolorP invisiblePhiddenP userchunkPdefP lineColorT lineColorSDocunDoc PrintableSPSBothspacenewlineminusplus backslashlparenrparenparenssentencepathlist putDocWith putDocLnWithputDocputDocLn hPutDocWith hPutDocLnWithhPutDoc hPutDocLn hPutDocCompr debugDocLn renderStringrenderStringWithrenderPS renderPSs renderPSWith renderPSsWithprefix prefixLinesinsertBeforeLastline lineColor hiddenPrefix unsafeBothunsafeBothText packedStringunsafePackedString invisiblePS userchunkPS unsafeChartext unsafeText invisibleText hiddenText userchunkblueTextredText greenText magentaTextcyanText colorTextwrapText formatText formatWords printableinvisiblePrintablehiddenPrintableuserchunkPrintablesimplePrinters simplePrinterinvisiblePrinteremptydoc<+>$$$+$vcatvsephcathsepquoted $fMonoidDoc$fSemigroupDoc $fIsStringDocThisPronounItNoun Countablepluralsingular englishNum andClauses orClauses anyOfClauseitemizeVerticalitemizepresentParticiple capitalize$fCountableNoun$fCountablePronoun$fCountableThis formatHeader makeEmail readEmailprop_qp_roundtrip ePutDocLndebugDoctraceDocunsafeRenderStringColored fancyPrintersenvironmentHelpColorenvironmentHelpEscapeWhiteenvironmentHelpEscape beginTedious endTedious tediousSizeminlist progressListprogressprogressKeepLatest finishedOne finishedOneIOsetProgressModewithoutProgress ExecExceptionRedirectAsIsNullFileStdout RedirectsrenderExecExceptionexecexecInteractivewithoutNonBlockreadInteractiveProcess$fShowExecException$fExceptionExecException$fShowRedirect PromptConfigpPromptpBasicCharacterspAdvancedCharacterspDefaultpHelpaskUseraskEnteraskUserListItem promptYorn promptChar BSWrapperappPrec$fShowBSWrapperShow2 showDict2Show1 showDict1 showsPrec1show1 showsPrec2show2showOp2GapemptyGapfreeGapjoinGap FreeRight FRInternalFreeLeft FLInternalPolyunPoly FlippedSealSealed2Sealedsealseal2flipSeal unsafeUnseal unsafeUnseal2unsealmapSeal mapFlippedunseal2mapSeal2 unsealFlipped unFreeLeft unFreeRight $fShowSealed $fEqSealed $fShowSealed2$fGapFreeRight $fGapFreeLeft:||:Fork:/\::\/:RL:<:NilRLFL:>:NilFL:>nullFLnullRL filterOutFLFL filterOutRLRLfilterRL+>++<+ reverseFL reverseRLconcatFLconcatRLspanFLspanFL_M splitAtFL splitAtRLbunchFLfoldFL_MfoldRL_MallFLanyFLallRLanyRLfoldrFLfoldlRLfoldrwFLfoldlwRLmapFL_FL mapFL_FL_M sequenceFL_ zipWithFLmapRL_RLmapFLfilterFLmapRLlengthFLlengthRLisShorterThanRL snocRLSealedtoFL dropWhileFL dropWhileRL takeWhileRLspanRLbreakRLeqFL eqFLUnsafe+>>++<<+initsFL concatRLFL $fShow2:>$fEq:>$fEq2:>$fShow:> $fShow1:> $fShow2FL $fShow1FL$fShowFL $fShow2RL $fShow1RL$fShowRL $fShow2:\/: $fShow:\/: $fShow2:/\: $fShow:/\:FZipper flToZippernullFZlengthFZfocusclownsjokers rightmostrightleftmostlefttoEndtoStartMaybe2Nothing2Just2 maybeToFL maybeToRLmapMB_MB PushFixupFn dropFixupspushFixupFLFL_FLFLFLpushFixupFLFL_FLFLFLFLpushFixupFLMB_FLFLMBpushFixupIdFL_FLFLFLpushFixupIdMB_FLFLMBpushFixupIdMB_FLIdFLFLInvertinvertinvertFLinvertRL dropInverses $fInvert:> $fInvertRL $fInvertFL PatchDebugpatchDebugDummy$fPatchDebugRL$fPatchDebugFLPartialMergeFnMergeFnTotalCommuteFn CommuteFn commuterIdRL commuterIdFL mergerIdFLtotalCommuterIdFL commuterFLId commuterRLId commuterRLFLtotalCommuterFLIdtotalCommuterFLFLinvertCommuterCommutecommute commuteRLFL commuteRL commuteFL selfCommuter $fCommuteRL $fCommuteFLMergemerge CleanMerge cleanMerge cleanMergeFL selfMergermergeFL mergerFLId mergerFLFL swapMerge swapMergerswapCleanMerge mergeListprop_mergeSymmetricprop_mergeCommute$fCleanMergeFL $fMergeFL partitionFL partitionFL' partitionRLcommuteWhatWeCanFLgenCommuteWhatWeCanFLcommuteWhatWeCanRLgenCommuteWhatWeCanRL removeCommonremoveFLremoveRLremoveSubsequenceFLremoveSubsequenceRLsimpleHeadPermutationsFLheadPermutationsFLheadPermutationsRLpermutationsRLpartitionConflictingFL$fEq2RL$fEq2FLCommuteNoConflictscommuteNoConflictsmergeNoConflicts SshFilePathsshUhostsshReposshFile isRelative isAbsoluteisValidLocalPath isHttpUrlisSshUrl isSshNopath splitSshUrl sshFilePathOf setExecutable stdoutIsAPipewithSignalsHandledcatchNonSignalcatchInterrupt tryNonSignalwithSignalsBlocked$fExceptionSignalException$fShowSignalExceptioncatchallcatchNonExistence firstJustIO clarifyErrorsprettyException prettyErrordiehandleOnlyIOError ifIOErrorifDoesNotExistError handleOnlySSHCmdSSHSCPSFTP SshSettingssshscpsftpwindows defaultSshcopySSHtransferModeHeadergetSSHenvironmentHelpSshenvironmentHelpScpenvironmentHelpSshPort$fShowSshSettings$fEqSshSettings AnchoredPathNameAbsoluteOrRemotePathAbsolutePathOrStdSubPath FilePathLike toFilePath FilePathOrURLtoPath displayPathrealPath encodeWhite decodeWhite makeSubPathOf simpleSubPath doesPathExist ioAbsolute makeAbsolutemakeAbsoluteOrStdstdOutioAbsoluteOrStduseAbsoluteOrStdioAbsoluteOrRemoteisRemotesetCurrentDirectoryisMaliciousSubPathgetUniquePathNameisPrefix appendPathcatPathsparentparents breakOnDir anchorPathname2fpflattenmakeName floatPath anchoredRoot replaceParent rawMakeName eqAnycaseencodeWhiteNamedecodeWhiteNamemovedirfilename filterPaths floatSubPath inDarcsdir darcsdirNameisRoot $fShowSubPath$fFilePathLikeSubPath$fFilePathOrURLSubPath$fShowAbsolutePath$fFilePathLikeAbsolutePath$fFilePathOrURLAbsolutePath$fShowAbsolutePathOrStd$fShowAbsoluteOrRemotePath#$fFilePathOrURLAbsoluteOrRemotePath$fFilePathLike[]$fCharLikeChar$fFilePathOrURL[]$fShowCorruptPatch$fExceptionCorruptPatch$fEqCorruptPatch$fBinaryAnchoredPath$fEqAnchoredPath$fShowAnchoredPath$fOrdAnchoredPath $fBinaryName$fEqName $fShowName $fOrdName$fEqAbsoluteOrRemotePath$fOrdAbsoluteOrRemotePath$fEqAbsolutePathOrStd$fOrdAbsolutePathOrStd$fEqAbsolutePath$fOrdAbsolutePath $fEqSubPath $fOrdSubPath FilterTreeitemstreeHashItemTypeTreeTypeBlobTypeTreeItemSubTreeStubBlob listImmediateitemHashitemType emptyTree emptyBlobmakeBlob makeBlobBSmakeTreemakeTreeWithHashlookupfindfindFilefindTreelist explodePaths explodePath expandUpdateexpand expandPath checkExpandrestrictreadBlobzipCommonFileszipFileszipTrees diffTrees modifyTreeupdateSubtrees updateTreepartiallyUpdateTreeoverlayaddMissingHashesprop_explodePath$fFilterTreeTreem$fShowItemType $fEqItemType $fOrdItemTypeTreeIO TreeMonad TreeStatetree runTreeMonadvirtualTreeMonad virtualTreeIO fileExistsdirectoryExistsexistscreateDirectoryunlinkrenamecopyfindM findTreeM findFileM MonadProgressrunProgressActionsProgressActionpaAction paMessage paOnErrorsilentlyRunProgressActions$fMonadProgressRWSTdecodeDarcsHashdecodeDarcsSize darcsLocation darcsTreeHashdarcsUpdateHashesdarcsAddMissingHashesreadDarcsHashedDirreadDarcsHashedreadDarcsHashedNosizewriteDarcsHashed hashedTreeIOwithCurrentDirectory getFileStatusdoesDirectoryReallyExistremoveFileMayNotExist osxCacheDir xdgCacheDirgetRecursiveContentsgetRecursiveContentsFullPath readPlainTreewritePlainTreeIndex listFileIDs openIndexupdateIndexFrom treeFromIndexindexFormatValid getFileIDalign$fFilterTreeIndexMIO$fShowCorruptIndex$fExceptionCorruptIndex$fEqCorruptIndex $fShowItem canonFilename maybeRelinksloppyAtomicCreate atomicCreatewithLockwithLockCanFailenvironmentHelpLockswithTemp withOpenTemp tempdirLocenvironmentHelpTmpdirenvironmentHelpKeepTmpdir withPermDir withTempDirwithDelayedDir withNamedTemp readBinFile readTextFilereadDocBinFile appendBinFileappendTextFileappendDocBinFile writeBinFile writeTextFilewriteDocBinFilewriteAtomicFilePSgzWriteAtomicFilePSgzWriteAtomicFilePSsgzWriteDocFile addToErrorLocwithNewDirectory copyFileOrUrl cloneTree cloneFilebackupByRenamingbackupByCopying fetchFilePSfetchFileLazyPS gzFetchFilePSspeculateFileOrUrl RepoFormatRF RepoPropertyDarcs1Darcs2Darcs3HashedInventoryRebaseInProgressRebaseInProgress_2_16 UnknownFormat formatHas addToFormatremoveFromFormatidentifyRepoFormattryIdentifyRepoFormatwriteRepoFormatcreateRepoFormat writeProblemtransferProblem readProblem$fShowRepoProperty$fShowRepoFormat$fEqRepoPropertyCacheCacheLoc cacheType cacheWritable cacheSource CacheTypeRepo Directory WritableOrNotWritable NotWritable HashedDirHashedPristineDirHashedPatchesDirHashedInventoriesDir hashedDir allHashedDirsmkCache cacheEntries unionCachesunionRemoteCaches repo2cache cacheHashokayHashfetchFileUsingCachewritable dropNonReposclosestWritableDirectory isThisRepo bucketFolderhashedFilePath peekInCachespeculateFileUsingCachespeculateFilesUsingCachewriteFileUsingCache cleanCachescleanCachesWithHintreportBadSources$fShowCacheLoc $fEqCacheLoc $fShowCache $fEqFromWhere$fEqOrOnlySpeculate $fEqCacheType$fShowCacheType$fEqWritableOrNot$fShowWritableOrNot ExactVersion ListCommandsHelp ListOptionsNoTestTestOnlyChangesToFilesChangesToAllFilesTimingsDebug DebugHTTPToCcOutputOutputAutoNameMailSubject InReplyToCharset SendmailCmdAuthor SelectAuthor PatchNameOnePatch SeveralPatchOneHash AfterPatch UpToPatch AfterHashUpToHashTagNameLastNMaxCount IndexRangeOneIndex NumberPatchesOneTagAfterTagUpToTag GenContextContextCountLogFile RmLogFile DontRmLogFileDistNameDistZipAll Recursive NoRecursiveMinimize NoMinimize RestrictPathsDontRestrictPathsAskDeps NoAskDeps IgnoreTimesDontIgnoreTimes UseMyersDiffUsePatienceDiff IntersectionUnion ComplementSignSignAsNoSignSignSSLHappyForwardingNoHappyForwardingVerify VerifySSLRemoteDarcsOptEditDescriptionNoEditDescriptionToksEditLongCommentNoEditLongCommentPromptLongCommentKeepDate NoKeepDate MarkConflicts SkipConflictsBoring SkipBoring AllowCaseOnlyDontAllowCaseOnlyAllowWindowsReservedDontAllowWindowsReserved DontGrabDepsDontPromptForDependenciesPromptForDependenciesCompress NoCompress UnCompress WorkRepoUrl RemoteRepoNewRepo NotInRemoteReplyApplyAsMachineReadable HumanReadablePipe InteractiveDiffCmdSummary NoSummary PauseForGui NoPauseForGuiUnified NonUnifiedReverseForwardCompleteLazy DiffFlags XMLOutput ForceReplace OnePatternSeveralPattern AfterPattern UpToPatternNonApply NonVerifyNonForceDisableDontSetScriptsExecutableOnceLinearBackoffBisectHashed UseFormat1 UseFormat2 UseFormat3UseNoWorkingDir UseWorkingDirSiblingFilesNoFiles Directories NoDirectoriesPending NoPending PosthookCmd NoPosthook AskPosthook RunPosthook PrehookCmd NoPrehook AskPrehook RunPrehook StoreInMemory ApplyOnDiskNoHTTPPipeliningPacksNoPacksNoCacheAllowUnrelatedReposCheckRepair JustThisRepo ReadMarks WriteMarksNullFlagNoAmendUnrecord AmendUnrecordPatchIndexFlagNoPatchIndexFlag EnumPatches NoEnumPatches $fEqDarcsFlag$fShowDarcsFlag RawOptSpecRawNoArg RawStrArg RawAbsPathArgRawAbsPathOrStdArgRawOptAbsPathArgPrimDarcsOptionFlagnoArgstrArg optStrArg absPathArgabsPathOrStdArg optAbsPathArg withDefault singleNoArg singleStrArgsingleAbsPathArg multiStrArgmultiOptStrArgmultiAbsPathArg deprecated parseIntArgparseIndexRangeArg showIntArgshowIndexRangeArg$fIsoFunctorRawOptSpec$fShowArgumentParseError$fExceptionArgumentParseError$fEqArgumentParseErroroptionsMarkdowntreeHasAnycasetreeHas treeHasDir treeHasFileFileType BinaryFileTextFilewriteDefaultPrefsglobalPrefsDirglobalPrefsDirDocenvironmentHelpHome getGlobalglobalCacheDir boringRegexpsisBoring getPrefLinesfiletypeFunction addToPreflist getPreflist setPreflist defPrefval getPrefval setPrefval changePrefval defaultrepogetDefaultRepo addRepoSource deleteSources getCachesgetMotdshowMotdprefsUrl prefsDirPath prefsFilePathprefsFilesHelp $fEqFileTypeSummOpSummAddSummRmSummMod SummDetail SummAddDir SummRmDirSummFileSummMvSummNone$fOrdSummDetail$fEqSummDetail $fOrdSummOp $fEqSummOp ObjectMap getObject putObject listObjectsObject DirContentLocationLUUID FileContentisBlob isDirectory $fEqLocation$fShowLocation$fEqUUID $fOrdUUID $fShowUUID PatchInspectlistTouchedFiles hunkMatches$fPatchInspectRL$fPatchInspectFLSlotInFirstInMiddleInLast PatchChoices LabelledPatchLabellabel getLabelIntunLabel patchChoices labelPatchesmkPatchChoicesseparateFirstFromMiddleLastseparateFirstMiddleFromLast getChoices refineChoices patchSlotforceMatchingFirst forceFirsts forceFirstselectAllMiddlesforceMatchingLast forceLasts forceLast forceMiddlemakeEverythingLatermakeEverythingSooner substitute$fPatchInspectLabelledPatch$fCommuteLabelledPatch$fInvertLabelledPatch$fPatchInspectPatchChoice$fCommutePatchChoice $fEqLabelPatchModPTouch PCreateFile PCreateDirPRenamePRemovePDuplicateTouchPatchIdPIDpatchIdFileIdcnamecount showFileId pid2stringshortzero$fBinaryFileId$fShowPatchMod $fEqPatchMod$fFunctorPatchMod$fBinaryPatchId $fShowPatchId $fOrdPatchId $fEqPatchId $fEqFileId $fShowFileId $fOrdFileId ApplyMonadApplyMonadBase nestedApply liftApply getApplyStateApplyMonadTreemDoesDirectoryExistmDoesFileExist mReadFilePSmCreateDirectorymRemoveDirectory mCreateFile mRemoveFilemRename mModifyFilePS mChangePrefApplyMonadStateApplyMonadStateOperationsApplyMonadTransApplyMonadOver runApplyMonadToTreetoTree withFileNames withFiles $fToTreeTree$fApplyMonadTreeRWST$fApplyMonadStateTree$fApplyMonadTreeRWST0$fApplyMonadTransTreem$fMonadProgressStateT$fApplyMonadTreeStateT$fApplyMonadTreeStateT0$fMonadProgressStateT0$fApplyMonadTreeStateT1$fApplyMonadTreeStateT2Apply ApplyStateapplyunapply effectOnPaths applyToPaths applyToTree applyToStatemaybeApplyToTree $fApplyRL $fApplyFLdeselectNotTouchingselectNotTouchingchooseTouching lookTouch ShowPatchcontent descriptionsummary summaryFLthingthingsShowContextPatchshowContextPatchShowPatchBasic showPatch ShowPatchFor ForDisplay ForStorage displayPatchformatFileName PatchInfo_piDate_piName _piAuthor_piLog_piLegacyIsInverted validDate validDatePSvalidLog validLogPS validAuthor validAuthorPS rawPatchInfo patchinfoaddJunk replaceJunkjustName justAuthorjustLogdisplayPatchInfopiNamepiRenamepiAuthorisTagpiDate piDateStringpiLogpiTagtoXml toXmlShort escapeXML makePatchname showPatchInfo readPatchInfo$fShowPatchInfo $fEqPatchInfo$fOrdPatchInfoInventoryEntry InventoryinventoryParentinventoryPatches HeadInventory PristineHash PatchHash InventoryHash ValidHash getValidHash mkValidHashinventoryPatchNamesemptyInventoryparseHeadInventoryparseInventory showInventoryshowInventoryPatchesshowInventoryEntrypokePristineHashpeekPristineHashskipPristineHash pristineNameprop_inventoryParseShowprop_peekPokePristineHashprop_skipPokePristineHash$fValidHashInventoryHash$fValidHashPatchHash$fValidHashPristineHash $fEqInventory$fShowInventory$fEqPristineHash$fShowPristineHash $fEqPatchHash$fShowPatchHash$fEqInventoryHash$fShowInventoryHash copyHashedpathsAndContentscopyPartialsHashed cleanHashdirgetHashedFiles $fEqObjTypeIdEq2=\^/==/^\= StorableIdreadIdshowId SignedIdentSignedId positiveIdinvertIdIdentidentmerge2FL fastRemoveFL fastRemoveRLfastRemoveSubsequenceRL findCommonFLcommuteToPrefixcommuteToPostfixcommuteWhatWeCanToPostfixprop_identInvariantUnderCommute"prop_sameIdentityImpliesCommutableprop_equalImpliesSameIdentity $fIdEq2FLIsHunkisHunkFileHunk showFileHunk$fInvertFileHunkshowContextHunk $fShowPatchRL$fShowContextPatchRL$fShowPatchBasicRL $fShowPatchFL$fShowContextPatchFL$fShowPatchBasicFL BracketedFL Bracketed SingletonBracedParens unBracketed unBracketedFL mapBracketedmapBracketedFLFL$fShowPatchBasicBracketed$fPatchListFormatBracketed ReadPatch readPatch'readPatchPartial readPatch bracketedFLpeekfor $fReadPatchRL $fReadPatchFL$fReadPatchBracketed Contextedprop_ctxInvariantsprop_ctxPositive prop_ctxEqctxId ctxNoConflictctxViewctxToFLctxctxAddctxAddRL ctxAddInvFLctxAddFL commutePast commutePastRL ctxTouchesctxHunkMatchesshowCtxreadCtx$fShow1Contexted$fShowContexted$fOrdContexted $fEqContexted RepairToFLapplyAndTryToFixFLapplyAndTryToFixisInconsistent mapMaybeSnd $fCheckRL $fCheckFL $fRepairFLPrimMangleUnravelledmangleUnravelledMangled Unravelled PrimApply applyPrimFLPrimReadreadPrimPrimShowshowPrim showPrimCtx PrimDetails summarizePrimPrimSiftsiftForPending PrimCanonize tryToShrinksortCoalesceFLcanonize canonizeFLcoalesce primCoalesceprimDecoalesce PrimConstructaddfilermfileadddirrmdirmove changeprefhunk tokreplacebinary primFromHunk PrimClassify primIsAddfile primIsRmfile primIsAdddir primIsRmdir primIsMove primIsHunkprimIsTokReplace primIsBinary primIsSetpref is_filepatch PrimPatchprimCleanMerge DirPatchTypeRmDirAddDir FilePatchTypeRmFileAddFileHunk TokReplaceBinaryPrimMoveDPFP ChangePref isIdentity comparePrim$fInvertFilePatchType$fEq2FilePatchType$fInvertDirPatchType$fEq2DirPatchType$fEqPrim $fEq2Prim$fPatchDebugPrim$fPatchInspectPrim $fInvertPrim $fIsHunkPrim$fPrimConstructPrim$fPrimClassifyPrim$fEqDirPatchType$fOrdDirPatchType$fEqFilePatchType$fOrdFilePatchType$fPrimReadPrim$fPrimMangleUnravelledPrim$fPrimDetailsPrimshowHunk$fPrimShowPrim$fShowFilePatchType $fShow1Prim $fShow2Prim$fShowDirPatchType $fShowPrimCommuteFunctionPerhapsUnknownFailed Succeeded toPerhaps cleverCommute speedyCommutecommuteFiledircommuteFilepatches$fCleanMergePrim $fCommutePrim$fMonadPlusPerhaps$fAlternativePerhaps$fMonadPerhaps$fApplicativePerhaps$fFunctorPerhaps$fPrimCanonizePrim $fShowSimple$fPrimApplyPrim$fRepairToFLPrim $fApplyPrim$fPrimSiftPrimHunkMoveManifest DemanifestIdentityHMH $fEq2Hunk $fShow2Hunk $fShow1Hunk $fEq2HunkMove $fEqHunkMove$fShowHunkMove$fEqHunk $fShowHunk$fReadPatchPrimSplitter applySplitter canonizeSplit rawSplitter noSplitter primSplitterreversePrimSplitter ToFromPrimToPrimtoPrimFromPrimfromAnonymousPrimfromPrim fromPrims PrimPatchBasePrimOf$fPrimPatchBaseRL$fPrimPatchBaseFL RepoPatchV1PPMergerRegremisMerger mergerUndo$fPatchDebugRepoPatchV1$fCheckRepoPatchV1$fPatchListFormatRepoPatchV1$fToPrimRepoPatchV1$fFromPrimRepoPatchV1$fPrimPatchBaseRepoPatchV1$fShow2RepoPatchV1$fShow1RepoPatchV1$fShowRepoPatchV1 showPatch_$fShowPatchBasicRepoPatchV1Unwind fullUnwindUnwound mkUnwound squashUnwound$fInvertUnwound$fShowPatchBasicUnwound$fShow2Unwound$fShow1Unwound $fShowUnwoundconflictedEffect ConflictStateOkay Conflicted DuplicatedIsConflictedPrimIsClistConflictedFilesplainSummaryPrimplainSummaryPrims plainSummaryplainSummaryFL xmlSummary$fShowIsConflictedPrim $fSummaryFL$fOrdSummChunk $fEqSummChunk$fEqConflictState$fOrdConflictState$fShowConflictState$fReadConflictState displayHunk$fShowPatchPrim$fShowContextPatchPrim$fShowPatchBasicPrim$fPatchListFormatPrimhunkEdit$fApplyMonadTransObjectMapm$fApplyMonadObjectMapStateT$fToTreeObjectMap$fApplyMonadObjectMapStateT0$fApplyMonadStateObjectMapEffecteffect $fEffectRL $fEffectFLNonablenonNonunNonshowNonsshowNonreadNonsreadNoncommuteOrAddToCtxcommuteOrAddToCtxRLcommutePrimsOrAddToCtxremNonscommuteOrRemFromCtxcommuteOrRemFromCtxFL>**>>>>*$fEqNon $fShow1Non $fShowNon$fWLRL$fWLFLConflictresolveConflictsConflictDetailsconflictMangled conflictParts mangleOrFailcombineConflicts RepoPatchV2 Duplicate EtacilpudNormal Conflictor InvConflictor isDuplicate isForwardmergeUnravelled isConsistent$fIsHunkRepoPatchV2$fEffectRepoPatchV2$fNonableRepoPatchV2$fShow2RepoPatchV2$fShow1RepoPatchV2$fShowRepoPatchV2$fReadPatchRepoPatchV2$fShowPatchRepoPatchV2$fShowContextPatchRepoPatchV2$fShowPatchBasicRepoPatchV2$fPatchListFormatRepoPatchV2$fRepairToFLRepoPatchV2$fApplyRepoPatchV2$fPatchInspectRepoPatchV2$fCleanMergeRepoPatchV2$fCommuteRepoPatchV2$fInvertRepoPatchV2$fEq2RepoPatchV2$fToPrimRepoPatchV2$fFromPrimRepoPatchV2$fCheckRepoPatchV2$fCommuteNoConflictsRepoPatchV2$fUnwindRepoPatchV2$fConflictRepoPatchV2$fSummaryRepoPatchV2$fPatchDebugRepoPatchV2$fPrimPatchBaseRepoPatchV2$fMergeRepoPatchV2 publicUnravelunravelmerger$fEqRepoPatchV1$fEq2RepoPatchV1$fInvertRepoPatchV1$fIsHunkRepoPatchV1$fEffectRepoPatchV1$fSummaryRepoPatchV1$fUnwindRepoPatchV1$fConflictRepoPatchV1$fCommuteNoConflictsRepoPatchV1$fPatchInspectRepoPatchV1$fCommuteRepoPatchV1$fMergeRepoPatchV1$fCleanMergeRepoPatchV1$fReadPatchRepoPatchV1$fRepairToFLRepoPatchV1$fApplyRepoPatchV1$fShowPatchRepoPatchV1$fShowContextPatchRepoPatchV1ShowDepsFormatShowDepsVerboseShowDepsSummaryHasDepsgetdepsNamedP anonymous infopatchadddepspatch2patchinfo patchname patchcontents fmapNamed fmapFL_Named mergerIdNamedshowDependencies$fPatchDebugNamed $fShow2Named $fShow1Named$fShowContextPatchNamed$fShowPatchBasicNamed $fCheckNamed$fSummaryNamed$fPatchInspectNamed $fUnwindNamed$fConflictNamed $fMergeNamed$fCleanMergeNamed$fCommuteNamed $fEq2Named $fRepairNamed $fApplyNamed$fReadPatchNamed$fPatchListFormatNamed $fIsHunkNamed $fIdEq2Named $fIdentNamed $fEffectNamed$fPrimPatchBaseNamed$fHasDepsNamed$fShowPatchNamed$fEqShowDepsFormat $fShowNamed RebaseNameAddNameDelNameRenamecommuteNamePrimcommutePrimNamecommuterIdNamedcommuterNamedIdcommuteNameNamedcommuteNamedName pushFixupName$fEq2RebaseName$fPatchInspectRebaseName$fInvertRebaseName$fCommuteRebaseName$fReadPatchRebaseName$fShowPatchRebaseName$fShowPatchBasicRebaseName$fShow2RebaseName$fShow1RebaseName$fEqRebaseName$fShowRebaseName RebaseFixup PrimFixup NameFixup namedToFixupspushFixupFixupflToNamesPrimscommuteNamedFixupcommuteFixupNamed$fCommuteRebaseFixup$fReadPatchRebaseFixup$fShowPatchBasicRebaseFixup$fPatchListFormatRebaseFixup$fPatchInspectRebaseFixup$fInvertRebaseFixup$fApplyRebaseFixup$fPrimPatchBaseRebaseFixup$fShow2RebaseFixup$fShow1RebaseFixup$fShowRebaseFixup WPatchInfo unWPatchInfo PatchInfoAndG PatchInfoAnd HopefullycompareWPatchInfoinfo patchDescwinfopiapn2piapatchInfoAndPatch fmapFLPIAPfmapPIAP hopefullyconscientiously hopefullyMactually createHashed extractHash unavailable$fPatchDebugPatchInfoAndG$fIsHunkPatchInfoAndG$fEffectPatchInfoAndG$fReadPatchPatchInfoAndG$fApplyPatchInfoAndG$fPatchInspectPatchInfoAndG$fMergePatchInfoAndG$fCleanMergePatchInfoAndG$fCommutePatchInfoAndG$fShowPatchPatchInfoAndG$fShowContextPatchPatchInfoAndG$fShowPatchBasicPatchInfoAndG$fPatchListFormatPatchInfoAndG$fIdEq2PatchInfoAndG$fIdentPatchInfoAndG$fEq2PatchInfoAndG$fPrimPatchBasePatchInfoAndG$fConflictPatchInfoAndG$fRepairPatchInfoAndG$fShow2PatchInfoAndG$fShow1PatchInfoAndG$fEq2WPatchInfo$fShowPatchNotAvailable$fExceptionPatchNotAvailable$fShowPatchInfoAndG$fShowHopefully$fShowSimpleHopefully DefaultIO applyPatches runTolerantly runSilently runDefault$fApplyMonadTreeDefaultIO$fApplyMonadTreeDefaultIO0$fMonadProgressDefaultIO$fTolerantMonadTolerantIO$fTolerantMonadSilentIO$fApplyMonadTreeTolerantWrapper $fApplyMonadTreeTolerantWrapper0$fFunctorTolerantWrapper$fApplicativeTolerantWrapper$fMonadTolerantWrapper$fTolerantMonadTolerantWrapper$fFunctorSilentIO$fApplicativeSilentIO$fMonadSilentIO$fFunctorTolerantIO$fApplicativeTolerantIO$fMonadTolerantIO$fFunctorDefaultIO$fApplicativeDefaultIO$fMonadDefaultIOTaggedPatchSetSealedPatchSetOrigin emptyPatchSet patchSet2RL patchSet2FL appendPSFLprogressPatchSet patchSetTags inOrderTags patchSetSnoc patchSetSplit patchSetDrop $fShow2Tagged $fShow1Tagged$fShow2PatchSet$fShow1PatchSet $fShowTagged$fShowPatchSet progressFL progressRLprogressRLShowTags splitOnTagcleanLatestTag getUncoveredslightlyOptimizePatchsetremoveFromPatchSetfindCommonAndUncommonfindCommonWithThem findUncommon countUsThem mergeThempatchSetIntersection patchSetUnionareUnrelatedReposcontextPatches withPatchMods makePatchIDapplyToFileMods$fApplyMonadTreeFileModMonad$fApplyMonadTreeFileModMonad0$fFunctorFileModMonad$fApplicativeFileModMonad$fMonadFileModMonad$fMonadState(,)FileModMonad AnnotateRPAnnotateannotateAnnotateResult annotateFileannotateDirectory machineFormatformat$fAnnotatePrim$fAnnotatePrim0$fShowFileOrDirectory$fEqFileOrDirectory$fShowAnnotated2$fEqAnnotated2$fShowContent2 $fEqContent2unPrim RepoPatchWDDNamedWithDroppedDepswddPatch wddDependedOn RebaseChangeRCrcToPiatoRebaseChangespartitionUnconflicted simplifyPushsimplifyPushes commuterIdWDDextractRebaseChangereifyRebaseChangeaddNamedToRebase$fPatchListFormatRebaseChange$fIsHunkRebaseChange$fPatchInspectRebaseChange$fCommuteRebaseChange$fReadPatchRebaseChange$fShowContextPatchRebaseChange$fShowPatchRebaseChange$fShowPatchBasicRebaseChange$fSummaryRebaseChange$fApplyRebaseChange$fIdentRebaseChange$fHasDepsRebaseChange$fPatchDebugRebaseChange$fPrimPatchBaseRebaseChange$fShow2RebaseChange$fShow1RebaseChange$fEffectWithDroppedDeps$fPrimPatchBaseWithDroppedDeps$fShowRebaseChange RebaseItemToEditFixup$fReadPatchRebaseItem$fShow2RebaseItem$fShow1RebaseItem$fShowRebaseItem SuspendedItems countToEditaddFixupsToSuspendedremoveFixupsFromSuspendedaddToEditsToSuspended$fReadPatchSuspended$fShowPatchBasicSuspended$fPatchInspectSuspended$fShow2Suspended$fShow1Suspended$fShowSuspended WrappedNamedNormalPRebaseP fromRebasing$fCommuteWrappedNamed$fApplyWrappedNamed$fShowPatchBasicWrappedNamed$fPatchListFormatWrappedNamed$fIdentWrappedNamed$fPrimPatchBaseWrappedNamed$fShow2WrappedNamed$fShow1WrappedNamed$fReadPatchReadRebasing$fPatchListFormatReadRebasing$fReadPatchWrappedNamed$fShowWrappedNamed mkInvertiblefromPositiveInvertiblewithInvertible$fShowContextPatchInvertible$fShowPatchInvertible$fShowPatchBasicInvertible$fPrimPatchBaseInvertible$fPatchInspectInvertible$fApplyInvertible$fEq2Invertible$fCommuteInvertible$fInvertInvertible$fIdentInvertible$fSignedIdInvertibleId$fEqInvertibleId$fOrdInvertibleId readOldRepooldRepoFailMsg Repository PristineType NoPristine PlainPristineHashedPristine repoLocationwithRepoLocation repoFormatrepoPristineType repoCache modifyCacheunsafeCoerceRepoTypeunsafeCoercePatchType unsafeCoerceR unsafeCoerceU unsafeCoerceTmkRepo$fShowRepository$fShowPristineType$fEqPristineTypecleanRepository cleanPristine diffHashListscleanInventoriesspecialPatches cleanPatcheslistInventorieslistInventoriesLocallistInventoriesRepoDirlistPatchesLocalBucketedwithManualRebaseUpdatecheckOldStyleRebaseStatus rebaseJobstartRebaseJobmaybeDisplaySuspendedStatuswithTentativeRebasereadTentativeRebasewriteTentativeRebase readRebasecreateTentativeRebasecommuteOutOldStyleRebaseApplyDir ApplyNormal ApplyInvertedapplyToHashedPristineapplyToTentativePristineapplyToTentativePristineCwd#createPartialsPristineDirectoryTreereadHashedPristineRootcreatePristineDirectoryTree withRecorded withTentative readPendingreadTentativePendingwriteTentativePendingtentativelyRemoveFromPendingtentativelyRemoveFromPWmakeNewPendingfinalizePending revertPendingtentativelyAddToPendingsetTentativePending$fShowPatchBasicFLM$fReadPatchFLM PatchFilterdoesPatchIndexExistisPatchIndexDisabledcreateOrUpdatePatchIndexDiskcanUsePatchIndexcreatePIWithInterruptisPatchIndexInSyncdeletePatchIndexattemptCreatePatchIndexgetRelevantSubsequencemaybeFilterPatchesdumpPatchIndexpiTest$fShowFileInfo $fEqFileInfo $fOrdFileInfo$fShowFilePathSpan$fEqFilePathSpan$fOrdFilePathSpan$fShowFileIdSpan$fEqFileIdSpan$fOrdFileIdSpantreeDiff TreeFilterapplyTreeFilterrestrictSubpathsrestrictBoringrestrictDarcsdirunrecordedChangesreadPendingAndWorking readRecordedreadUnrecordedreadUnrecordedFiltered readWorkingreadRecordedAndPendinginvalidateIndex readIndex updateIndexfilterOutConflictsaddPendingDiffToPending addToPendingStandardResolutionmangled unmangledconflictedPathsstandardResolution warnUnmangled showUnmangledshowUnravelledannounceConflictsexternalResolutionpatchsetConflictResolutions PatchSetMatch IndexMatch PatchMatchTagMatch ContextMatch MatchFlag MatchableRP MatchablehelpOnMatchershaveNonrangeMatch patchSetMatch firstMatch secondMatchcheckMatchSyntax matchAPatch hasIndexRangematchFirstPatchsetmatchSecondPatchset splitSecondFLmatchAPatchsetgetMatchingTagrollbackToPatchSetMatch matchingHead $fShowMatcher$fShowMatchFailure$fExceptionMatchFailure$fShowMatchFlag matchUpToOnematchOneContextmatchOneNontag matchSeveral matchLastmatchSeveralOrFirstmatchSeveralOrLastmatchOneOrRange matchRangematchSeveralOrRange matchFrommatchAnycontext GzcrcsAction GzcrcsCheck GzcrcsRepair TestStrategy ChangesFormatGenXml CountPatchesNetworkOptionsnoHttpPipelining WithSummary YesSummaryNoVerify VerifyKeyring HeaderFields_to_cc_from_subject _inReplyTo TestChanges NoTestChangesYesTestChanges ExternalDiffdiffCmddiffOpts diffUnified WithContext NoContext YesContextLookForaddsreplacesmovesLogfile_logfile _rmlogfileAskLongCommentYesEditLongCommentRepoCombinatorNotInDefaultRepoNotInRemotePath SelectDepsNoDepsAutoDeps PromptDeps XmlOutputNoXmlYesXml StdCmdAction RootActionRootHelpYesEnumPatchesYesNoyesno DarcsOption rootActions stdCmdActionsdebug verbositytimings debugginghookspreHookpostHookuseCache xmlOutputdryRun dryRunXmlpipe interactive pauseForGuiaskDeps selectDepschangesReversemaxCountrepoDirnewRepopossiblyRemoteRepo remoteReposnotInRemoteFlagName notInRemoterepoCombinatorallowUnrelatedRepos justThisRepowithWorkingDir setDefaultinheritDefaultauthoraskLongCommentkeepDatelogfilelookfor lookforaddslookforreplaces lookformovesuseIndex includeBoringallowProblematicFilenamesallowCaseDifferingFilenamesallowWindowsReservedFilenames onlyToFiles recursive diffAlgorithm withContextextDiff testChangesrunTest leaveTestDir headerFields sendToContextsendmail sendmailCmdminimizecharseteditDescriptionapplyAssignverify conflictsNo conflictsYes externalMergereordercompressusePacks patchIndexNo patchIndexYes storeInMemoryoutput withSummary maybeSummarynetworkumasksetScriptsExecutable amendUnrecord selectAuthormachineReadable cloneKindmarks readMarks writeMarkshashed patchFormatdistnamedistzip changesFormattokens forceReplace testStrategyfiles directoriespendingnullFlag enumPatches gzcrcsActionssiblings$fYesNoInheritDefault$fYesNoWithWorkingDir$fYesNoWantGuiPause$fYesNoUseIndex$fYesNoLeaveTestDir$fYesNoSetScriptsExecutable$fYesNoRunTest$fYesNoIncludeBoring$fYesNoLookForMoves$fYesNoLookForReplaces$fYesNoLookForAdds $fYesNoDryRun$fYesNoUseCache$fYesNoReorder$fYesNoWithPatchIndex$fYesNoCompression$fYesNoEnumPatches$fYesNoXmlOutput$fYesNoWithContext$fYesNoWithSummary$fEqGzcrcsAction$fShowGzcrcsAction$fEqTestStrategy$fShowTestStrategy$fEqChangesFormat$fShowChangesFormat$fEqWithSummary$fShowWithSummary $fEqOutput $fShowOutput $fEqVerify $fShowVerify$fEqSign $fShowSign$fEqTestChanges$fEqExternalDiff$fShowExternalDiff$fEqWithContext$fShowWithContext$fEqAskLongComment$fShowAskLongComment$fEqRepoCombinator$fShowRepoCombinator$fEqSelectDeps$fShowSelectDeps $fEqXmlOutput$fShowXmlOutput$fEqStdCmdAction$fShowStdCmdAction$fEqRootAction$fShowRootAction$fEqEnumPatches$fShowEnumPatchesConfigoptDescrverbosequietenumeratePatches scanKnown diffingOpts wantGuiPause isInteractivewillRemoveLogFile lookForAddslookForReplaces lookForMovesallowConflictsfixRemoteReposfixUrl pathsFromArgspathSetFromArgs getRepourlfileHelpAuthorenvironmentHelpEmail getAuthor promptAuthor getEasyAuthorgetDateenvironmentHelpSendmailgetSendmailCmd getOutput getSubjectgetCc getInReplyTo hasXmlOutput hasLogfileworkRepo withNewRepo sendmailPath diffProgram darcsProgrampipeDoc pipeDocSSH sendEmail generateEmail haveSendmail sendEmailDoc resendEmail execDocPipe signStringverifyPSviewDoc viewDocWitheditTexteditFilesetDarcsEncodingsgetSystemEncoding isUTF8Locale printFriendlyshowWithSummary printSummary printContentprintContentWithPagercontextualPrintPatchMarks emptyMarkslastMarkgetMarkaddMark patchHash updatePendingBundleinterpretBundle makeBundle parseBundlereadContextFile minContextUpdatePristineDontUpdatePristineDontUpdatePristineNorRevertrevertTentativeChangesfinalizeTentativeChangesaddToTentativeInventoryreadRepoHashedreadTentativeRepocopyHashedInventorywriteAndReadPatchwriteTentativeInventorytentativelyAddPatchtentativelyAddPatches_tentativelyAddPatch_tentativelyRemovePatchestentativelyRemovePatches_finalizeRepositoryChangesrevertRepositoryChangesreorderInventoryreadReporepoXorupgradeOldStyleRebase$fEqUpdatePristineRepositoryConsistencyRepositoryConsistentBrokenPristine BrokenPatchesreplayRepositoryInTempreplayRepository checkIndexpacksDirfetchAndUnpackPatchesfetchAndUnpackBasic createPackstentativelyMergePatchesconsiderMergeToWorking$fEqMakeChangesgetRecordedUpToMatchgetOnePatchset PrimWithNamewnNamewnPatch$fShowContextPatchPrimWithName$fShowPatchPrimWithName$fShowPatchBasicPrimWithName$fReadPatchPrimWithName$fCleanMergePrimWithName$fCommutePrimWithName$fPrimDetailsPrimWithName$fPrimClassifyPrimWithName$fPrimApplyPrimWithName$fIsHunkPrimWithName$fAnnotatePrimWithName$fRepairToFLPrimWithName$fPatchListFormatPrimWithName$fApplyPrimWithName$fShow2PrimWithName$fShow1PrimWithName$fShowPrimWithName$fPatchInspectPrimWithName$fInvertPrimWithName$fEq2PrimWithName$fIdEq2PrimWithName$fIdentPrimWithName RepoPatchV3 ConflictorPPrimP+|-|$fShowPatchBasicRepoPatchV3$fReadPatchRepoPatchV3$fShowContextPatchRepoPatchV3$fShowPatchRepoPatchV3$fRepairToFLRepoPatchV3$fCheckRepoPatchV3$fUnwindRepoPatchV3$fSummaryRepoPatchV3$fIsHunkRepoPatchV3$fPatchListFormatRepoPatchV3$fApplyRepoPatchV3$fPatchDebugRepoPatchV3$fToPrimRepoPatchV3$fPrimPatchBaseRepoPatchV3$fShow2RepoPatchV3$fShow1RepoPatchV3$fShowRepoPatchV3$fEq2RepoPatchV3$fPatchInspectRepoPatchV3$fCommuteRepoPatchV3$fCommuteNoConflictsRepoPatchV3$fMergeRepoPatchV3$fCleanMergeRepoPatchV3$fIdentRepoPatchV3$fEffectRepoPatchV3$fConflictRepoPatchV3 $fShowNode NamedPrim PrimPatchIdunsafePrimPatchIdprop_primPatchIdNonZeropositivePrimPatchIds namedPrimanonymousNamedPrim$fStorableIdPrimPatchId$fSignedIdPrimPatchId$fEqPrimPatchId$fOrdPrimPatchId$fShowPrimPatchId$fFromPrimRepoPatchV3applyToWorkingsetScriptsExecutablePatchesgetTest runPosthook runPrehook testTentativeReadingOrWritingReadingWriting IdentifyRepo BadRepository NonRepositoryGoodRepositorymaybeIdentifyRepositoryidentifyRepositoryidentifyRepositoryForamInRepositoryamInHashedRepositoryseekRepoamNotInRepositoryfindRepositoryfindAllReposInDirIsPrimV1toPrimV1RepoJobV1JobV2Job PrimV1JobRebaseAwareJob RebaseJob OldRebaseJobStartRebaseJob withUMaskFlagwithRepositorywithRepositoryLocation withRepoLockwithOldRepoLockwithRepoLockCanFailcheckRepoIsNoRebase$fIsPrimV1Prim$fIsPrimV1Prim0fileArgsunknownFileArgs knownFileArgsmodifiedFileArgsprefArgsnoArgsEmptyRepositorycreateRepositorycreateRepositoryV1createRepositoryV2 writePristinecloneRepositoryreplacePristineKeyPresskpkpHelpInteractiveSelectionMInteractiveSelectionStateISCtotalcurrentlpschoicesSelectionConfig allowSkipAllPatchSelectionOptions matchFlags WhichChangesLast LastReversedFirst FirstReversedselectionConfigPrimselectionConfigselectionConfigGeneric runSelectionrunInvertibleSelection viewChangeshelpForkeysForwithSelectedPatchFromListinitialSelectionState currentPatch currentFiledecidedecideWholeFileskipOnebackOnebackAll isSingleFile promptUser skipMundaneaskAboutDepends$fEqWhichChanges$fShowWhichChanges AskAboutDepsNoAskAboutDepsHijackT HijackOptions IgnoreHijackRequestHijackPermissionAlwaysRequestHijackPermissiongetLog runHijackTupdatePatchHeader CommandArgs CommandOnlySuperCommandOnlySuperCommandSub DarcsCommand SuperCommandcommandProgramName commandName commandHelpcommandDescriptioncommandExtraArgscommandExtraArgHelpcommandCommand commandPrereqcommandCompleteArgscommandArgdefaultscommandBasicOptionscommandAdvancedOptionscommandDefaultscommandCheckOptionscommandSubCommandsCommandControl CommandData HiddenCommand GroupNameextractCommandsextractAllCommands normalCommand hiddenCommand commandGroup withStdOptscommandAlloptionscommandOptions nodefaultsgetSubcommands commandAlias commandStub superNamedisambiguateCommands putVerboseputInfo putFinished putWarningputVerboseWarningabortRunsetEnvDarcsPatchessetEnvDarcsFiles defaultRepousagesubusagegetCommandMiniHelpgetCommandHelpgetSuperCommandHelp announceFilestestTentativeAndMaybeExitprintDryRunMessageAndExitfilterExistingPathsgetUniqueRepositoryNamegetUniqueDPatchNamecheckUnrelatedReposgetLastPatchespreselectPatcheshistoryEditHelpwhatsnewstatusunrevert writeUnrevertunrecordunpull obliterate transferModetest$fShowBisectDirtagshowTagsshowReposhowPatchIndex showIndex showPristine showFilesshowDeps showContentsSpelling showAuthors rankAuthorscanonizeAuthorcompiledAuthorSpellings showCommandsetprefrollbackrevertreplacerepaircheckremovermunaddrecordcommitoptimizemv$fShowFileStatus$fShowFileKind $fEqFileKind markconflicts$fTraversableOnly$fFoldableOnly $fFunctorOnly$fEqOnly $fOrdOnly $fShowOnlylog logInfoFL simpleLogInfo changelogchanges initialize initializeCmd doCRCWarningsgzcrcsdist doFastZip doFastZip' diffCommand convertImport $fShowState $fShowObject$fShowCopyRenameNames $fShowRefId convertExport convertDarcs2convertclonegetput cloneToSSH makeRepoNameotherHelpInheritDefaultsendpushamend amendrecordaddStandardPatchApplier PatchApplierApplierRepoTypeConstraintrepoJob PatchProxyapplyPatchesStartapplyPatchesFinish"$fPatchApplierStandardPatchApplierfetchpullpullCmd fetchPatchesapplyCmdgetPatchBundlerebase $fPatchApplierRebasePatchAppliercommandControlList applyDefaults runTheCommand runWithHookshelpCmdlistAvailableCommands printVersionData.ByteString.Internal ByteString&vector-0.12.3.0-Iq8W8y7X87B1xSQfAcXis3 Data.VectorVector'old-time-1.1.0.3-8hXtrtEb00q34PiQR2jJlx System.Time CalendarTimereadDatedateTime englishDate englishTime englishAgoappend _progressDatacatchord PatchChoiceSimpleHopefullyFwdRevMatcherGHC.IO.EncodinggetFileSystemEncodingsetLocaleEncodingcontainers-0.6.2.1Data.Set.Internalinsertdeleteversionweakhash