úÎ! Æ ægÿV      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œžŸ ¡¢£€¥Š§š©ª«¬­®¯°±²³Žµ¶·ž¹º»ŒœŸ¿ÀÁÂÃÄÅÆÇÈÉÊËÌÍÎÏÐÑÒÓÔÕÖ×ØÙÚÛÜÝÞßàáâãäåæçèéêëìíîïðñòóôõö÷øùúûüýþÿ      !"#$%&'()*+,-./01 2 3 4 5 6 7 8 9:; < = > ? @ A B C D E F G H I J KLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œžŸ ¡¢£€¥Š§š©ª«¬­®¯°±²³Žµ¶·ž¹º»ŒœŸ¿ÀÁÂÃÄÅÆÇÈÉÊËÌÍÎÏÐÑÒÓÔÕÖ×ØÙÚÛÜÝÞßàáâãäåæçèéêëìíîïðñòóôõö÷øùúûüýþÿ      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œžŸ ¡¢£€¥Š§š©ª«¬­®¯°±²³Žµ¶·ž¹º»ŒœŸ¿ÀÁÂÃÄÅÆÇÈÉÊËÌÍÎÏÐÑÒÓÔÕÖ×ØÙÚÛÜÝÞßàáâãäåæçèéêëìíîïðñòóôõö÷øùúûüýþÿ      !"#$%&'()*+,-./0123456789:;<=>?@ABCD E F G H I J K L!M!N!O!P!Q!R!S!T!U!V!W"X"Y"Z"["\"]"^"_"`"a"b"c"d"e"f"g#h#i#j#k#l#m#n#o#p#q#r#s$t$u$v$w%x%y%z%{%|%}%~%%€%%‚%ƒ%„%…%†&‡&ˆ&‰&Š&‹&Œ&&Ž&&&‘&’&“&”&•&–&—&˜&™&š&›&œ&&ž&Ÿ& &¡&¢&£&€&¥&Š&§'š'©'ª'«'¬'­'®'¯'°'±'²'³'Ž'µ'¶'·'ž'¹'º'»'Œ'œ'Ÿ'¿'À'Á'Â'Ã'Ä'Å'Æ'Ç'È'É'Ê'Ë'Ì'Í'Î'Ï'Ð'Ñ'Ò'Ó'Ô'Õ'Ö'×'Ø'Ù'Ú'Û'Ü'Ý'Þ'ß'à'á'â'ã'ä'å'æ'ç'è'é'ê'ë'ì'í'î'ï'ð'ñ'ò(ó(ô(õ(ö(÷(ø(ù(ú(û(ü(ý(þ(ÿ()))))))** * * * + +++,,,,,,,,,,,----- -!-"-#-$.%.&.'.(.).*.+.,.-.../.0.1.2.3.4.5.6/7/8/9/:/;/</=/>/?0@0A0B0C0D0E0F0G0H0I0J0K0L0M0N0O0P0Q0R0S0T0U0V0W0X0Y0Z0[0\0]0^0_0`0a0b0c0d0e0f1g1h1i1j1k1l1m1n1o1p2q2r2s2t2u2v2w2x2y3z3{3|3}3~33€33‚3ƒ3„3…†4‡4ˆ4‰4Š4‹4Œ44Ž555‘5’5“5”6•6–6—6˜6™6š6›6œ66ž6Ÿ6 6¡6¢6£6€6¥6Š6§7š7©7ª7«7¬7­7®7¯7°7±7²7³7Ž7µ7¶7·7ž7¹7º7»7Œ7œ7Ÿ7¿7À7Á7Â7Ã7Ä7Å7Æ7Ç7È7É7Ê7Ë7Ì7Í7Î7Ï7Ð7Ñ7Ò7Ó7Ô7Õ7Ö7×7Ø7Ù7Ú7Û7Ü7Ý7Þ7ß7à7á7â7ã7ä7å7æ7ç7è7é7ê7ë7ì7í7î7ï7ð7ñ7ò7ó7ô7õ7ö7÷7ø7ù7ú7û7ü7ý7þ7ÿ7777778888 8 8 8 8 8888888888888888888 8!8"8#8$8%8&8'8(8)8*8+8,8-8.8/808182838485969798999:9;9<9=9>9?9@9A9B9C9D9E9F9G9H9I9J9K9L9M9N9O9P:Q:R:S:T:U:V:W:X:Y;Z;[;\;];^;_;`;a;b;c;defghijkl<m<n=o=p=q=r=s=t=u=v=w=x=y=z>{>|>}>~>?€??‚?ƒ?„?…?†?‡?ˆ?‰?Š?‹?Œ??Ž???‘?’?“?”?•?–?—?˜?™?š?›?œ??ž?Ÿ? ?¡?¢?£?€?¥?Š?§?š?©?ª?«?¬?­?®?¯?°?±?²?³?Ž?µ?¶?·?ž?¹?º?»?Œ?œ?Ÿ?¿?À?Á?Â?Ã?Ä?Å?Æ?Ç?È?É?Ê?Ë?Ì?Í?Î?Ï?Ð?Ñ?Ò?Ó?Ô?Õ?Ö?×?Ø?Ù?Ú?Û?Ü?Ý?Þ?ß?à?á?â?ã?ä?å?æ?ç?è?é?ê?ë?ì?í?î?ï?ð?ñ?ò?ó?ô?õ?ö?÷?ø?ù?ú?û?ü?ý?þ?ÿ?????????? ? ? ? ? ??????????????????? ?!?"?#?$?%?&?'?(?)?*?+?,?-?.?/?0?1?2?3?4?5?6?7?8?9?:?;?<?=?>???@?A?B@C@D@E@F@G@H@I@J@K@L@M@N@O@P@Q@R@S@T@U@V@W@X@Y@ZA[B\B]B^B_C`CaCbCcCdCeCfCgChCiCjCkClCmDnDoDpDqDrDsDtDuDvDwExEyEzE{E|E}E~EE€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ª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ÉGÊGËGÌGÍGÎHÏHÐHÑHÒHÓHÔHÕHÖH×HØIÙIÚIÛIÜIÝIÞJßJàJáJâJãJäJåJæJçJèJéJêJëJìJíJîKïKðKñKòKóKôKõKöK÷KøKùKúKûKüKýKþKÿKKKKKKKKKK K K K K KKKKKKKKLLLLLMMMMMM M!N"N#N$N%N&N'N(N)N*N+O,O-O.O/O0O1O2O3O4O5O6O7O8O9O:O;O<O=O>O?O@OAOBOCODOEOFOGOHOIOJOKOLOMONOOOPOQOROSOTOUOVOWOXOYOZO[O\O]O^O_O`OaPbPcPdPePfPgPhPiPjPkPlPmPnPoPpPqPrPsPtPuPvPwPxPyPzP{P|P}P~PQ€RS‚SƒS„S…S†S‡SˆT‰TŠT‹TŒTTŽTTT‘T’T“T”T•T–T—T˜U™UšV›VœVWžXŸX X¡X¢X£X€X¥XŠX§XšX©XªX«X¬X­X®X¯X°X±X²X³XŽXµX¶X·XžX¹XºY»YŒZœ[Ÿ\¿]À]Á]Â]Ã]Ä]Å]Æ]Ç]È]É]Ê]Ë]Ì]Í^Î^Ï_Ð_Ñ_Ò_Ó_Ô_Õ_Ö_×`Ø`Ù`Ú`Û`ÜaÝaÞaßaàaáaâaãaäaåaæaçaèaéaêaëaìaíaîaïaðañaòaóaôbõböb÷bøcùcúcûcücýcþcÿcccccccccc c c c c cdddddddddddddddddd e!f"f#f$f%f&f'g(g)g*g+g,g-h.h/h0h1h2h3h4h5h6i7i8i9i:j;j<j=j>j?j@jAjBjCjDjEjFjGjHjIjJjKjLjMjNjOjPjQjRjSjTjUjVjWjXjYjZj[j\j]j^j_k`kakbkckdkekfkgkhkikjkkklkmknkokpkqkrksktkulvlwlxlylzl{l|l}l~ll€ll‚lƒl„l…l†l‡mˆm‰mŠm‹mŒmmŽmmm‘m’m“m”m•n–n—n˜n™nšn›nœnnžnŸn n¡n¢n£n€n¥nŠn§nšn©nªn«n¬n­o®o¯o°o±o²o³oŽoµo¶o·ožo¹oºo»oŒoœoŸo¿oÀoÁoÂoÃoÄoÅoÆoÇoÈoÉoÊoËoÌoÍoÎoÏoÐoÑoÒoÓoÔoÕoÖo×oØoÙpÚpÛpÜpÝpÞpßpàpápâpãpäpåpæpçpèpépêpëpìpípîpïpðpñpòpópôpõpöp÷pøpùpúpûpüpýpþpÿp p p p p p p p p p q q q q q q q q q q q q q q q q q q q r r r r r !s "s #s $t %u &u 'u (u )u *u +u ,u -u .u /u 0u 1u 2u 3u 4u 5u 6u 7u 8u 9u :u ;u <u =u >u ?u @u Au Bu Cu Du Eu Fu Gu Hu Iu Ju Ku Lu Mu Nu Ou Pu Qu Ru Su Tu Uu Vu Wu Xu Yu Zu [u \u ]v ^v _v `v av bv cv dv ev fw gx hx ix jx kx lx mx nx ox px qx rx sx tx ux vx wy xy yy zy {y |y }y ~y y €y y ‚y ƒy „y …y †y ‡y ˆy ‰y Šy ‹y Œy y Žy y y ‘y ’y “y ”y •y –y —y ˜y ™y šy ›z œz z žz Ÿz  z ¡z ¢z £z €z ¥z Šz §z šz ©z ªz «z ¬z ­z ®z ¯z °z ±z ²z ³z Žz µz ¶z ·z ž{ ¹{ º{ »{ Œ{ œ{ Ÿ{ ¿{ À{ Á{ Â{ Ã{ Ä{ Å{ Æ{ Ç{ È{ É{ Ê{ Ë{ Ì{ Í{ Î{ Ï{ Ð{ Ñ{ Ò{ Ó{ Ô{ Õ| Ö| ×| Ø} Ù} Ú~ Û Ü ݀ ހ ߁ à á â ã ä å æ ç è é ê ë ì í î ï‚ ð‚ ñ‚ ò‚ ó‚ ô‚ õƒ öƒ ÷ƒ øƒ ùƒ úƒ ûƒ üƒ ýƒ þƒ ÿƒ ƒ ƒ ƒ ƒ ƒ ƒ ƒ ƒ ƒ ƒ ƒ ƒ ƒ ƒ ƒ ƒ ƒ ƒ ƒ ƒ ƒ ƒ ƒ ƒ ƒ ƒ ƒ ƒ ƒ ƒ ƒ ƒ ƒ !ƒ "ƒ #ƒ $ƒ %„ &„ '„ („ )„ *„ +„ ,„ -„ .„ /„ 0„ 1„ 2„ 3„ 4„ 5„ 6„ 7„ 8„ 9„ :„ ;„ <„ =„ >„ ?„ @„ A„ B„ C„ D„ E„ F„ G„ H„ I„ J„ K„ L„ M„ N„ O„ P„ Q„ R„ S„ T„ U„ V… W… X… Y… Z… [… \… ]… ^… _… `… a… b† c† d† e† f† g† h† i† j† k† l† m† n† o† p† q† r† s† t† u† v† w† x† y† z† {† |† }† ~† † €† † ‚† ƒ† „† …† †† ‡† ˆ† ‰† Š† ‹† Œ† † Ž† † † ‘† ’† “† ”† •† –† —† ˜† ™† š† ›† œ† † ž† Ÿ†  † ¡† ¢† £† €† ¥† Š† §† š† ©† ª† «† ¬† ­† ®† ¯† °† ±† ²† ³† Ž† µ† ¶† ·† ž† ¹† º† »† Œ† œ† Ÿ† ¿† À† Á† † Æ Ć ņ Ɔ dž Ȇ Ɇ ʆ ˆ ̆ ͆ Ά φ І ц ҆ ӆ Ԇ Ն ֆ ׆ ؆ ن چ ۆ ܆ ݆ ކ ߆ à† á† â† ã† ä† å† æ† ç† è† é† ê† ë† ì† í† î† ï† ð† ñ† ò† ó† ô† õ† ö† ÷† ø† ù† ú† û† ü† ý† þ† ÿ† † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † † !† "† #† $† %† &† '† († )† *† +† ,† -† .† /† 0† 1† 2† 3† 4† 5† 6† 7† 8† 9† :† ;† <† =† >† ?† @† A† B† C† D† E† F† G† H† I† J† K† L† M† N† O† P† Q† R† S† T† U† V† W† X† Y† Z† [† \† ]† ^† _‡ `ˆ aˆ bˆ cˆ dˆ eˆ fˆ gˆ hˆ iˆ jˆ kˆ lˆ mˆ nˆ oˆ pˆ qˆ rˆ sˆ tˆ uˆ vˆ wˆ xˆ yˆ zˆ {ˆ |ˆ }‰ ~‰ ‰ €‰ ‰ ‚‰ ƒ‰ „‰ …‰ †‰ ‡‰ ˆ‰ ‰‰ Š‰ ‹‰ Œ‰ ‰ Ž‰ ‰ ‰ ‘‰ ’‰ “Š ”Š •Š –Š —Š ˜‹ ™‹ š‹ ›‹ œ‹ ‹ ž‹ Ÿ‹  Œ ¡Œ ¢Œ £Œ €Œ ¥Œ ŠŒ §Œ šŒ © ª «Ž ¬Ž ­Ž ®Ž ¯Ž °Ž ±Ž ²Ž ³Ž ŽŽ µŽ ¶Ž ·Ž žŽ ¹Ž ºŽ »Ž ŒŽ œŽ ŸŽ ¿Ž ÀŽ Á  Ï ď ŏ Ə Ǐ ȏ ɏ ʏ ˏ ̏ ͏ Ώ Ϗ Џ я ҏ ӏ ԏ Տ ֏ ׏ ؏ ُ ڏ ۏ ܏ ݏ ޏ ߏ à á â ã ä å æ ç è é ê ë ì í î ï ð ñ ò ó ô õ ö ÷ ø ù ú û ü ý þ ÿ               ‘ ‘ ‘ ‘ ‘ ‘ ‘ ‘ ‘ ‘ ‘ ‘ ‘ ‘ ‘ ‘ ‘ ‘ ‘ !‘ "‘ #‘ $‘ %‘ &‘ '‘ (‘ )‘ *‘ +‘ ,‘ -‘ .‘ /‘ 0‘ 1’ 2’ 3’ 4“ 5” 6” 7” 8• 9• :• ;• <• =• >• ?• @• A• B• C• D• E• F• G• H• I• J• K• L• M• N• O• P– Q– R– S– T– U– V– W– X– Y– Z– [– \– ]– ^– _– `– a– b– c– d– e– f– g– h– i– j– k– l– m– n– o– p– q– r– s– t— u— v— w— x— y— z— {— |— }— ~— — €— — ‚— ƒ— „— …— †— ‡˜ ˆ˜ ‰˜ Š˜ ‹˜ Œ˜ ˜ Ž˜ ˜ ˜ ‘˜ ’˜ “˜ ”˜ •˜ –˜ —˜ ˜˜ ™˜ š˜ ›˜ œ˜ ™ ž™ Ÿ™  ™ ¡™ ¢™ £™ €™ ¥š Šš §š šš ©š ªš «š ¬š ­š ®š ¯š °› ±› ²› ³› Ž› µ› ¶› ·› ž› ¹› º› »› Œ› œ› Ÿ› ¿› À› Á› › Û ě Ŝ Ɯ ǜ ȝ ɝ ʝ ˝ ̝ ͝ Ν ϝ Н ѝ ҝ ӝ ԝ ՞ ֞ מ ؞ ٞ ڞ ۞ ܞ ݞ ޞ ߞ àž áž âž ãž äž åž æž çž èž éž êž ëž ìž íž îž ïž ðž ñž òž óž ôž õž öž ÷ž øž ùž úž ûž üž ýž þž ÿž ž ž ž ž ž ž ž ž ž ž Ÿ Ÿ Ÿ Ÿ               ¡ ¡ ¡ ¡ ¡ ¡ ¡ ¡ ¡ ¢ ¢ ¢ !¢ "£ #£ $£ %£ &€ '€ (¥ )¥ *¥ +¥ ,¥ -¥ .¥ /¥ 0¥ 1¥ 2¥ 3¥ 4¥ 5¥ 6¥ 7¥ 8¥ 9¥ :¥ ;Š <Š =Š >Š ?Š @Š A§ B§ C§ D§ E§ F§ Gš Hš Iš J© K© L© M© N© O© P© Q© R© S© T© U© V© W© X© Y© Z© [© \© ]© ^© _© `© a© b© c© d© e© f© g© h© i© j© k© l© m© n© o© p© q© r© s© t© u© v© w© x© y© z© {© |ª }ª ~ª ª €ª ª ‚ª ƒª „ª …ª †ª ‡ª ˆ« ‰« Š« ‹« Œ« « Ž« « « ‘« ’¬ “¬ ”¬ •¬ –¬ —¬ ˜¬ ™¬ š¬ ›¬ œ¬ ¬ ž¬ Ÿ¬  ¬ ¡¬ ¢¬ £¬ €¬ ¥¬ Š¬ §¬ š¬ ©¬ ª¬ «¬ ¬¬ ­¬ ®¬ ¯¬ °¬ ±¬ ²¬ ³¬ Ž¬ µ¬ ¶¬ ·¬ ž¬ ¹¬ º¬ »¬ Œ¬ œ¬ Ÿ¬ ¿¬ À¬ Á¬ ¬ ì Ĭ Ŭ Ƭ Ǭ Ȭ ɬ ʬ Ë­ Ì­ Í­ έ Ï­ Э Ñ® Ò® Ó¯ Ô¯ Õ° Ö° ×° Ø° Ù° Ú± Û² ܲ ݳ ÞŽ ßµ à¶ á· â· ãž ä¹ åº æ» ç» è» é» ê» ëŒ ìœ íŸ î¿ ïÀ ðÁ ñÁ ò ó ô õà öà ÷à øà ùà úà ûà üà ýà þà ÿÃÃÃÃÃÃÃÃÃà à à à à ÄÅÆÆÆÆÆÇÇÇÇÇÇÇÈÈÈÈÉ É!Ê"Ê#Ë$Ë%Ë&Ì'Ì(Í)Í*Í+Í,Í-Î.Î/Î0Î1Î2Ï3Ð4Ð5Ñ6Ò7Ò8Ò9Ò:Ò;Ò<Ò=Ò>Ò?Ó@ÓAÓBÓCÓDÔEÔFÔGÕHÕIÖJÖKÖLÖM×NØOÙPÚQÛRÛSÛTÛUÛàSafe',.=>?EHSUVXÊæ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 pJ. It is needed to maintain backwards compatibility for V1 and V2 patches.darcs#Show and read lists without braces.darcs®Show 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.darcsSShow lists without braces. Read with arbitrary nested parens and flatten them out.darcsžShowing 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.nThis means that 'FL (FL p)' etc would be ambiguous, so there are no instances for 'FL p' or other list types.  Safe',.=>?EHSUVX×darcsA 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  DataKindsg extension. It tracks different types of repositories, e.g. to indicate when a rebase is in progress.VdarcsReflect +> to the value level so that code can explicitly switch on it.(darcsA reflection of +> at the value level so that code can explicitly switch on it.+darcs<This type is intended to be used as a phantom type via the  DataKinds extension, normally as part of $4. Indicates whether or not a rebase is in progress. !"#$%&'()*+,-$%&!" +,-'#()* Safe',.=>?EHSUVXÙD1darcs@Used for indicating a patch type without having a concrete patch123123 None',.=>?EHSUVXÚ 4567845678Safe',.=>?EHSUVXÚèÿÿ $µŽ% ¶·ž&ô'’‘ŽŒ‹Š‰ˆ‡†…„ƒ( ®­)¬«ª©š§*+í,âá  àß-ýüûúöõ.€/0 Ÿžœ›š™˜—–•”“1³²±°¯2À¿Ÿ3"!#ïî4uvqptrlksnmo5PNOM6ìë7 8DG9:;<=>EF?JKL@ABCHIQRSTUVWXYZ[\^_`abcdefghijwxyz{|}~‚¡¢£€¥Š¹º»ŒœÁÂÃÄÅÆÇÈÉÊËÌÍÎÏÐÑÒÓÔÕÖ×ØÙÚÛÜÝÞãäåæçèéêðñòó÷øù9:ÿÿ $µŽ% ¶·ž&ô'’‘ŽŒ‹Š‰ˆ‡†…„ƒ( ®­)¬«ª©š§*+í,âá  àß-ýüûúöõ.€/0 Ÿžœ›š™˜—–•”“1³²±°¯2À¿Ÿ4uvqptrlksnmo5NOM8DG9:;<=>EF?JKL@ABCHIQRSTUVWXYZ[\^_`abcdefghijwxyz{|}~‚¢£€¥Š¹º»ŒœÁÂÃÄÅÆÇÈÉÊËÌÍÎÏÐÑÒÓÔÕÖ×ØÙÚÛÜÝÞãäåæçèéêðñòó÷øù3"!#ïî¡7 6ìëP9: None',.=>?EHSUVXñ;darcsJAn witness aware equality class. A minimal definition defines any one of <, = and >.<darcsyIt 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 context=darcsCompare two things with the same starting witness. If the things compare equal, evidence of the ending witnesses being equal will be returned.>darcsCompare two things with the same ending witness. If the things compare equal, evidence of the starting witnesses being equal will be returned.?darcs?U is used to pass around evidence (or lack thereof) of two witness types being equal.;=><?@AB?@A;=><B=4>4 Safe',.=>?EHSUVXEdarcsEŸ 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  M (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 çb (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?).WdarcsWö unescapes whitespace, which is escaped in the replace patch file format. It will also unescape escaped carets, which is useful for escaping a leading caret that should not invert the regChars. All other escapes are left for the unescaping in X.XdarcsX© assembles the filter function. It handles special chars, and also unescaping of escaped special chars. If a non-special char is still escaped by now we get a failure.EE Safe',.=>?EHSUVXHYdarcsbreakOutToken tokChars input splits the input  ByteString into F (before, token, after), where token6 is the first non-empty substring consisting only of 9s in tokChars, or E if no token was found. The 9s in tokChars5 should not have code points larger than 255 (0xff).Fdarcs$tryTokReplace tokChars old new input tries to find the token old and replace it with the token new everywhere in the input , returning F the modified input, unless the token new is already in the input in which case EN 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.Gdarcs&forceTokReplace tokChars old new input" replaces all occurrences of the old token with the new one, throughout the input.Hdarcs:Check if a token replace operation touches the given line.IdarcsBreak a  Bytestring into tokens, according to J, discarding non-tokens.FGHIJFGHIJSafe',.=>?EHSUVXpKdarcsLift an isomorphism between a and b to one between f a and f b. Like +F, except we can only map invertible functions (i.e. an Isomorphisms).Mdarcs@Lightweight type ismomorphisms (a.k.a. invertible functions). If Iso fw bw :: Iso a bthen fw and bw are supposed to satisfyfw . bw = id = bw . fwOdarcsApply an iso under a functor.Pdarcs.Apply an iso under cps (which is a cofunctor).KLMNOPMNKLOPSafe"#',.=>?EHSUVXfÛQdarcsAType 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.Rdarcs!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 E as a last resort).WThe 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.cThe last component is a list of descriptors for each single switch/flag that the option is made of.The R7 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, b]are necessary to make chaining of options a la typed printf/scanf possible. In a nutshell, af 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 T and UÍ 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 Q! below). For a primitive option, b gets instantiated to v -> a, where vV 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 U and T 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 -> ... -> aTo 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 flagsTdarcs1Convert option value (back) to flag list, in CPS.UdarcsaConvert flag list to option value, in CPS. Note: as a pure function, it is not supposed to fail.Vdarcs7Check for erros in a flag list, returns error messages.Wdarcs9Descriptions, one for each flag that makes up the option.Xdarcs Identity R , unit for YYdarcsR composition, associativeZdarcs³Normalise a flag list by parsing and then unparsing it. This adds all implicit (default) flags to the list, which is useful as long as there is legacy code that circumvents the R5 abstraction and directly tests for flag membership.2onormalise opts = (oparse opts . ounparse opts) id[darcs!The list of default flags for an R.&defaultFlags opts = onormalise opts []\darcsLift an isomorphism between b and c to one between R d f a b and R d f a c.The forward component of the M is needed for T, the backward component for U4. For the other two components this is the identity.]darcs|Combine two list valued options of the same type "in parellel". This is done by concatenating the resulting option values (U ), flags (T ), errors (V), and descriptors (W'), respectively, of the input options.^darcs Unit for ]._darcs¶Parse 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 fs`darcsOperator version of _"opt ? flags = parseFlags opt flagsbdarcsSee ] and ^.QRSTUVWXYZ[\]^_`RSTUVWXYZ[\Q]^_``52005 Tomasz ZielonkaGPLdarcs-devel@darcs.net experimentalportableNone',.=>?EHSUVXk‡ddarcs’Registers an IO action to run just before darcs exits. Useful for removing temporary files and directories, for example. Referenced in Issue1914.dede2005 Benedikt SchmidtGPLdarcs-devel@darcs.net experimentalportableSafe',.=>?EHSUVXugZdarcsQassoc list mapping characters to strings eg (c,s) means that %c is replaced by sfdarcsÿ parse 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"gdarcsTfor every mapping (c,s), add a mapping with uppercase c and the urlencoded string sfgfgSafe',.=>?EHSUVXv%hijklhjlkiSafe',.=>?EHSUVXŠœ mdarcsÿLData 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.qdarcs|Q represents a prioritised queue, with two-tier priority. The left list contains higher priority items than the right list.sdarcs©A 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.ydarcs­A 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.ŠdarcsŠ5 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.!mnopqrstuvwxyz|{}~€‚ƒ„…†‡ˆ‰Š‹Œ!yz|{}~€‚stuvwxqr†ˆ‰‡Š‹Œƒ„…mnopSafe',.=>?EHSUVX’þ”darcs Encode a ð 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 9s as produced by •.•darcs Decode a [ into a ðu according to the user's locale with the ghc specific //ROUNDTRIP feature added. This means the result may contain 9Ls that are not valid Unicode in case decoding with the user's locale fails.”•–—”•–— 2008 Eric KowGPLdarcs-devel@darcs.net experimentalportableSafe',.=>?EHSUVX¡˜darcs bsingular This (Noun "batch") "" == "this batch" plural This (Noun "batch") "" == "these batches"œdarcsThis only distinguishes between nouns with a final -ch, and nouns which do not. More irregular nouns will just need to have their own type tplural (Noun "batch") "" == "batches" plural (Noun "bat") "" == "bats" plural (Noun "mouse") "" == "mouses" -- :-(ždarcs/Things that have a plural and singular spelling¡darcs 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˜™š›œž Ÿ¡¢£€¥Š¡ž Ÿœš›˜™¢£€¥Š2005 Tomasz ZielonkaGPLdarcs-devel@darcs.net experimentalportableNone',.=>?EHSUVX£ªª«¬­®¯°±²³Žµ¶·ž¹º»ŒœŸ±°«¬ª­®¯²³Žµ¶·ºŒœŸ»¹žN(c) The University of Glasgow 2001, David Roundy 2003-2005GPL (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',.=>?EHSUVXЗ¿darcsyPointer to a filesystem, possibly with start/end offsets. Supposed to be fed to (uncurry mmapFileByteString) or similar.Àdarcsÿ2readIntPS skips any whitespace at the beginning of its argument, and reads an Int from the beginning of the PackedString. If there is no integer at the beginning of the string, it returns Nothing, otherwise it just returns the int read, along with a B.ByteString containing the remainder of its input.ÁdarcsNDrop leading white space, where white space is defined as consisting of ' ', '\t', '\n', or '\r'.Âdarcs"Split at first occurrence of ' ', '\t', '\n', or '\r'.Ídarcsÿ"Decompress 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).ÏdarcsORead an entire file, which may or may not be gzip compressed, directly into a [.ÓdarcsORead standard input, which may or may not be gzip compressed, directly into a [.ÔdarcsERead in a FileSegment into a Lazy ByteString. Implemented using mmap.Õdarcs<Like readFilePS, this reads an entire file directly into a [ÿú, but it is even more efficient. It involves directly mapping the file to memory. This has the advantage that the contents of the file never need to be copied. Also, under memory pressure the page may simply be discarded, wile in the case of readFilePS it would need to be written to swap. If you read many small files, mmapFilePS will be less memory-efficient than readFilePS, since each mmapFilePS takes up a separate page of memory. Also, you can run into bus errors if the file is modified.ÙdarcsWReturn the B.ByteString between the two lines given, or Nothing if they do not appear.Údarcs&Simpler but less efficient variant of Ù.Ûdarcs0Test if a ByteString is made of ascii charactersÜdarcs Decode a  ByteString containing UTF-8 to a ð9. Decoding errors are flagged with the U+FFFD character.Ýdarcs Encode a ð to a  ByteString using UTF-8.Þdarcs Decode a  ByteString to a ðP according to the current locale, using lone surrogates for un-decodable bytes.ßdarcs Encode a ð to a  ByteStringÿ according to the current locale, converting lone surrogates back to the original byte. If that fails (because the locale does not support the full unicode range) then encode using utf-8, assuming that the un-ecodable characters come from patch meta data. See also ¬â."þ¿ÀÁÂÃÄÅÆÇÈÉÊËÌÍÎÏÐÑÒÓÔÕÖ×ØÙÚÛÜÝÞß"ÏÕÐÑÓÒ¿ÔÎÍÁÂÈÉÄÆÇÅÀÃ×ÖÙþÛÞßÜÝÊËÌØÚ62003 David Roundy 2005 Benedikt SchmidtGPLdarcs-devel@darcs.net experimentalportableNone',.=>?EHSUVXæ<ádarcs¬create 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)\darcs'mark hash value where collision occured]darcsGreturn arrays with changes in a and b (1 indexed), offsets start with 0^darcs@set changes array for a and b and return number of changed lines_darcsQreturn (xmid, ymid, cost) for the two substrings a[off_a+1..off_a+1+l_a] and b`darcsAfind position on diag d with one more insert/delete going forwardadarcsHfollow snake from northwest to southeast, x and y are absolute positionsbdarcsBfind position on diag d with one more insert/delete going backwardcdarcsHfollow snake from southeast to northwest, x and y are absolute positionsãdarcsEtry to create nicer diffs by shifting around regions of changed linesddarcs<goto next unchanged line, return the given line if unchangededarcsRskip at least one unchanged line, if there is none advance behind the last linefdarcsgoto n-th next unchanged linegdarcs8goto next changed line, return the given line if changedhdarcs@goto previous unchanged line, return the given line if unchangedàáâãäåáãäåàâNone',.=>?EHSUVXøidarcs.the longest common subsequence of unique itemsjdarcsÿZThe patientLcs algorithm is inspired by the "patience" algorithm (for which I don't have a reference handy), in that it looks for unique lines, and uses them to subdivide the problem. I use lcs to diff the unique lines. It is slower, but should lead to "better" diffs, in the sense of ones that better align with what humans think changed.ÿÅNote that when compared with the Meyers algorithm used in darcs, this is somewhat slower (maybe 4x in some of my tests), but is lacking its stack overflow problem. I'm not sure how it scales in general, but it scales fine (just 10x slower than GNU diff) when comparing a 6M american english dictionary with a british english dictionary of the same size (which isn't a great test, but is the largest pair of somewhat-differing files I could find).âNote that the patientLcs algorithm is slower than the one used in lcs for sequences with mostly unique elements (as is common in text files), but much *faster* when the sequence has a high degree of redundancy. i.e. lines usrsharedictwords vs lines (cat usrsharedict words | tr 'a-z' a)kdarcs`LCS'ÿ stands for ``Longest Common Subsequence,'' and it is a relatively challenging problem to find an LCS efficiently. I'm not going to explain here what an LCS is, but will point out that it is useful in finding how two sequences (lists, in this case) differ. This module implements the Hunt-Szymanski algorithm, which is appropriate for applications in which the sequence is on an infinite alphabet, such as diffing the lines in two files, where many, or most lines are unique. In the best case scenario, a permutation of unique lines, this algorithm is $O(nlog n)$. In the worst case scenario, that of a finite alphabet (i.e. where the number of elements in the sequence is much greater than the number of unique elements), it is an $O(n^2log n)$ algorithm, which is pretty terrible.ææNone',.=>?EHSUVX®çéèêêçéèNone',.=>?EHSUVX9øldarcsl! is the Strict Monad for parsing.mdarcsÔParserState represents the internal state of the parser. We make it strict and specialize it on ByteString. This is purely to help GHC optimize. If performance were not a concern, it could be replaced with (a, ByteString).ndarcs&Applies a parsing function inside the í monad.odarcs@Allows for the inspection of the input that is yet to be parsed.îdarcsRun the parserïdarcsïT checks if the next space delimited token from the input stream matches a specific 9. Uses > inside íD to handle failed matches, so that it always returns () on success.ðdarcsð_ fetches the next whitespace delimited token from from the input and checks if it matches the  ByteString input. Uses > inside íD to handle failed matches, so that it always returns () on success.ñdarcs;Only succeeds if the characters in the input exactly match str.òdarcsò? looks for optional spaces followed by the end of input. Uses > inside íD to handle failed matches, so that it always returns () on success.pdarcspN drops leading spaces and then breaks the string at the next space. Returns E when the string is empty after dropping leading spaces, otherwise it returns the first sequence of non-spaces and the remainder of the input.ódarcsLike p except that it is in ParserMôdarcsHAccepts the next character and returns it. Only fails at end of input.õdarcs6Only succeeds at end of input, consumes no characters.ödarcsKAccepts only the specified character. Consumes a character, if available.÷darcshParse an integer and return it. Skips leading whitespaces and | uses the efficient ByteString readInt.ødarcsMDiscards spaces until a non-space character is encountered. Always succeeds.ùdarcs#Discards any characters as long as p# returns True. Always | succeeds.údarcsTakes characters while p returns True. Always succeeds.ûdarcsEquivalent to takeTill (==c)7, except that it is optimized for | the equality case.üdarcsTakes exactly n bytes, or fails.ýdarcsÿ1This is a highly optimized way to read lines that start with a particular character. To implement this efficiently we need access to the parser's internal state. If this is implemented in terms of the other primitives for the parser it requires us to consume one character at a time. That leads to (>>=) wasting significant time.qdarcsHelper function for ý.þdarcsThis is a highly optimized way to read lines that start with a particular character, and stops when it reaches a particular | character. See ý8 for details on why this | defined here as a primitive.rdarcsHelper function for þ.sdarcsPApplies a function to the input stream and discards the result of the function.ÿdarcsIf p fails it returns x%, otherwise it returns the result of p.darcs(Attempts each option until one succeeds.darcs§Ensure that a parser consumes input when producing a result Causes the initial state of the input stream to be held on to while the parser runs, so use with caution.darcs applies the parser functions to a string and checks that each parser produced a result as it goes. The strictness is in the í instance for l.tdarcs,Convert from a lazy tuple to a strict tuple.íîïðñòóôõö÷øùúûüýþÿíüîö÷ÿøùñïðòûóôõúýþNone',.=>?EHSUVX?Ž)darcs"Just copy pristine and inventories*darcs*First do a lazy clone then copy everything+darcs8Same as Normal but omit telling user they can interrumpt-darcs!Just files already known to darcs.darcs!All files, i.e. look for new ones/darcsAll files, even boring onesdçéè      !"#$%&'(+)*,-./0123546789:;<=>?@ABCDEFGHIJKLMNOPRQSTUVWXY[Z\]^_`abcdefghidbcd\]^iY[ZefghVWXSTUPRQMNOJKLGHIçéèDEF>?@;<=89:67354012,-./(+)*$%&'!"# _`aABC     None',.2=>?EHSUVXJL¥darcsProduce 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.udarcsTDo something with the internals of a PackedString. Beware of altering the contents!¡¢€£¥Š§š©ª«¬­®¯¢€£¥Š§š©ª®¡¯«¬­22003 Peter Simons 2003 David RoundyGPLdarcs-devel@darcs.net experimentalportableNone',.=>?EHSUVXž€/¹darcsAn  MCalenderTime is an underspecified vœ 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 E*. This uses almost the same fields as v1, a notable exception being that we introduce Ç. to indicate if a weekday was specified or notÉdarcs^Read/interpret a date string, assuming UTC if timezone is not specified in the string (see wA) Warning! This errors out if we fail to interpret the dateÊdarcsŽConvert 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 dateËdarcs4Return the local timezone offset from UTC in secondswdarcsParse a date string with Ír Warning! This errors out if we fail to interpret the date Uses its first argument as the default time zone.Ìdarcs 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.ÍdarcsŠParse a date string, assuming a default timezone if the date string does not specify one. The date formats understood are those of Î and xÎdarcs Display a vF in the ISO 8601 format without any separators, e.g. 20080825142503Ïdarcs+The current time in the format returned by Îydarcs%Case-insensitive variant of Parsec's z function.{darcs%Case-insensitive variant of Parsec's | function.}darcsMatch a parser at least n times.~darcsMatch a parser at least n times, but no more than m times.xdarcs5Try each of these date parsers in the following order €‚darcs"CVS-style date/times, e.g. 200708:25 14:25:39 GMT Note that time-zones are optional here.darcss"Old"-style dates, e.g. Tue Jan 3 14:08:07 EST 1999 darcs-doc: Question (what does the "old" stand for really?)€darcs;ISO 8601 dates and times. Please note the following flaws:I am reluctant to implement: years > 9999<truncated representations with implied century (89 for 1989)I have not implemented:!repeated durations (not relevant)-lowest order component fractions in intervalsnegative dates (BC)-I have not verified or have left too relaxed:!the difference between 24h and 0h·allows stuff like 2005-1212; either you use the hyphen all the way (2005-12-12) or you don't use it at all (20051212), but you don't use it halfway, likewise with timevNo bounds checking whatsoever on intervals! (next action: read iso doc to see if bounds-checking required?) -}ƒdarcsThree types of ISO 8601 date:6calendar date, e.g., 1997-07-17, 1997-07, 199707, 1997#week+day in year, e.g., 1997-W32-4day in year, e.g, 1997-273„darcsRNote that this returns a function which sets the time on another calendar (see € for a list of flawsÐ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)…darcs… p xs/ parses a string with the obligatory parser pä. If this suceeds, it continues on to the rest of the input using the next parsers down the chain. Each part of the chain consists of a parser for a separator and for the content itself. The separator is optional.oA good use of this function is to help in parsing ISO ISO 8601 dates and times. For example, the parser *optchain year [(dash, month), (dash, day)]³ accepts dates like 2007 (only the year is used), 2007-07 (only the year and month), 200707 (only the year and month with no separator), 2007-07-19 (year, month and day).†darcshOne or more space. WARNING! This only matches on the space character, not on whitespace in general‡darcs;English three-letter day abbreviations (e.g. Mon, Tue, Wed)ˆdarcsFour-digit year‰darcs:One or two digit month (e.g. 3 for March, 11 for November)Šdarcs January is 1, February is 2, etc‹darcs=English three-letter month abbreviations (e.g. Jan, Feb, Mar)Œdarcs day in one or two digit notationdarcshour in two-digit notationŽdarcsminute in two-digit notationdarcssecond in two-digit notationdarcslimited timezone support+HHMM or -HHMMUniversal timezones: UTC, UTZones from GNU coreutilslib5getdate.y, less half-hour ones -- sorry Newfies.>any sequence of alphabetic characters (WARNING! treated as 0!)ÒdarcsAIn English, either a date followed by a time, or vice-versa, e.g,yesterday at noonyesterday tea time12:00 yesterdaySee ‘ and ’w Uses its first argument as "now", i.e. the time relative to which "yesterday", "today" etc are to be interpreted‘darcs:Specific dates in English as specific points of time, e.g,today yesterday/last week (i.e. the beginning of that interval)4 months ago (via “)The first argument is "now".“darcs0English expressions for points in the past, e.g. 4 months ago 1 day agoday before yesterdaySee ”Ódarcs*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 “)ÔdarcsˆDurations in English that begin with the word "last", E.g. "last 4 months" is treated as the duration between 4 months ago and now’darcs Either an „; or one of several common English time expressions like noon or 'tea time'”darcsSome English durations, e.g.day4 score7 years 12 monthswThis is not particularly strict about what it accepts. For example, "7 yeares", "4 scores" or "1 days" are just fine.•darcs+The very beginning of time, i.e. 1970-01-01ÕdarcsTrivially convert a v to a fully specified ¹ (note that this sets the Ç flag to FalseÖdarcsReturns the first v that falls within a ¹p 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 0T for the seconds field. Maybe we should rename it something happier. See also Ù–darcs– i d multiplies every field in d with i‡FIXME; this seems like a terrible idea! it seems like we should get rid of it if at all possible, maybe adding an invertDiff functionÙdarcssSet a calendar to UTC time any eliminate any inconsistencies within (for example, where the weekday is given as ThursdayN, but this does not match what the numerical date would lead one to expect)—darcs— c mc- replaces any field which is specified in mc with the equivalent field in c -copyCalendar c nullMCalendar == nullMCalendarÚdarcsZero the time fields of a v"¹ºÅœÇ»ŒÃŸ¿ÀÁÄÆÈÉÊËÌÍÎÏÐÑÒÓÔÕÖ×ØÙÚ"ÏÉÌÍËÒÓÔÐÑÊÙ¹ºÅœÇ»ŒÃŸ¿ÀÁÄÆØ×ÕÖÚÈÎ2004 David RoundyGPLdarcs-devel@darcs.net experimentalportableNone',.=>?EHSUVXØ× Ü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˜ x y is true if x <= y < (x + one_day)+ Note that this converts the two dates to  ClockTime& to avoid any timezone-related errors™darcs™ x1 x2 y is true if  x1 <= y < x2 Since x1 and x2U can be underspecified, we simply assume the first date that they could stand for.šdarcsš x1 x2 y is true if  x1 <= y < x2›darcs› x1 x2 y is true if  x1 <= y < x2œdarcsœ  range exact is true if exact5 falls within the a range of dates represented by rangeÿY. The purpose of this function is to support matching on partially specified dates. That is, if you only specify the date 2007, this function should match any dates within that year. On the other hand, if you specify 2007-01, this function will match any dates within that month. This function only matches up to the second.ÞdarcsÞ s" return the first matcher in ß that can parse sßdarcsß d9 returns the list of matchers that will be applied on dm. If you wish to extend the date parsing code, this will likely be the function that you modify to do so.darcs ms' returns the first successful match in ms* It is an error if there are no matchesàdarcsà d; shows the possible interpretations for the date string d/ and how they match against the current dateádarcsà iso d; shows the possible interpretations for the date string dK and how they match against the date represented by the ISO 8601 string isoždarcshelper function for à and áŸdarcsŸ c dm tells us if dm applies to v c; or if dm? just represents the failure to parse a date, in which case c is moot.ÜÝÞßàáÞÜÝßàáNone',.=>?EHSUVX+cG darcs g is a wrapper around '[Printable] -> [Printable]' which allows to handle the special case of an empty  ( in a non-uniform manner. The simplest  Documents are built from ðs using  .édarcs?A set of printers to print different types of text to a handle.¡darcsThe State associated with a óV. Contains a set of printers for each hanlde, and the current prefix of the document.ódarcsA ó is a bit of enriched text. ós are concatenated using  from class 7, which is right-associative.ödarcsA öT is either a String, a packed string, or a chunk of text with both representations.¢darcsö representation of a space£darcsö representation of a newline.údarcsA ó representing a space (" ")ûdarcsA ó representing a newlineüdarcsA ó representing a "-"ýdarcsA ó representing a "+"þdarcsA ó representing a "\"ÿdarcsA ó that represents "("darcsA ó that represents ")"darcs parens d = lparen <> d <> rparendarcs&Fail with a stack trace and the given ó as error message.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 0.darcs puts a ó), followed by a newline on stdout using 0darcs eputDocLn puts a ó), followed by a newline to stderr using 0å. 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 hputDocWith puts a ó- on the given handle using the given printer. darcs hputDocLnWith puts a óE, followed by a newline on the given handle using the given printer. darcshputDoc puts a ó on the given handle using 0 darcs hputDocLn puts a ó3, followed by a newline on the given handle using 0. darcslike  & but with compress data before writing darcsWrite a ó% to stderr if debugging is turned on.€darcs€ h prints a list of ös to the handle h It uses binary output of  ByteString9s. If these not available, converts according to locale.¥darcs¥ h prints a ö to the handle h.darcs renders a ó into a ð5 with control codes for the special features of the ó.darcs renders a ó into a ðA using a given set of printers. If content is only available as  ByteString*, decode according to the current locale.darcs renders a ó into [C 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 renders a ó into a list of  Printables` using a set of printers. Each item of the list corresponds to a string that was added to the ó.darcs builds a Doc from a ð and a [> representing the same text, but does not check that they do.darcs builds a ó from a ð:. 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 1darcs 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 ð, using 1 directly"darcs" creates a ó" containing invisible text from a String#darcs# creates a ó containing hidden text from a String$darcs$ creates a ó containing a user chunk from a String*darcs* creates a ó containing colored text from a String+darcs+ n s is a ó representing s line-wrapped at n characters,darcs Creates a ó from any ö.-darcsCreates an invisible ó from any ö..darcsCreates a hidden ó from any ö./darcs Creates... WTF is a userchunk???0darcs0 is a ò which uses the set 'simplePriners\'' on any handle.§darcsFA set of default printers suitable for any handle. Does not use color.1darcs1 is the simplest è3: it just concatenates together the pieces of the ó2darcs2 is the è6 for hidden text. It just replaces the document with 3Þ. 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.3darcs The empty óšdarcsConcatenation of two ós5darcsa 5 b is a  b if a is not empty, else empty6darcsa 6 b is a followed by b. with a space in between if both are non-empty7darcsa 7 b is a above b©darcs vplus a b is a above b4 with an empty line in between if both are non-empty8darcsPile ó s vertically9darcsPile ó*s vertically, with a blank line in between:darcs Concatenate ós horizontally;darcs Concatenate ó(s horizontally with a space as separator<darcs Quote a string for screen output=darcs () is concatenation,  is the 3 ó?darcsdTogether with the language extension OverloadedStrings, this allows to use string literals where a ó is expected.\âäåãçæèéêëìíîïðñòóôõö÷øùúûüýþÿ      !"#$%&'()*+,-./0123456789:;<\óôõ356789:;üûýúþÿ #"+<$òéêëìíîïðñè021ö÷øù4,-./âäåãçæ%&'()*     !š66675©5None',.=>?EHSUVX: @darcsÿŸFormats 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.ªdarcsæTurns a piece of string into a q-encoded block Applies q-encoding, for use in e-mail header values, as defined in RFC 2047. It just takes a string and builds an encoded-word from it, it does not check length or necessity.@ABCAB@C None',.=>?EHSUVXZì«darcsThe «> type is a record containing the variables which control how ó"s will be rendered on some output.¬darcsoverall use of color­darcsoverall use of escaping®darcs1overall use of colored lines (only hunks for now)¯darcs$alternative to color (bold, inverse)°darcsdon't escape isprints±darcsdon't escape 8-bit chars²darcsextra chars to never escape³darcsextra chars to always escapeŽdarcsescape trailing spacesµdarcsignore r at end of lines¶darcs$escape spaces (used with poTrailing)·darcs·¡ returns a suitable policy for a given handle. The policy is chosen according to environment variables, and to the type of terminal which the handle representsHdarcsH h7 returns a set of printers suitable for outputting to hždarcsž policy< tries to color a Doc, according to policy po. That is, if policy has  poLineColor4 set, then colors the line, otherwise does nothing.¹darcs¹ policy string escapes string$ according to the rules defined in policy, turning it into a ó.ºdarcsº policy c tells wether c0 will be left as-is when escaping according to policy»darcs»G tells wether a character is a printable character of the ascii range.ŒdarcsŒ2 represents a special character as a string. *  quoteChar '^c' (where ^c is a control character) is "^c" * Otherwise,  quoteChar returns "hex", where hex1 is the hexadecimal number of the character.œdarcsœ policy doc marks docC with the appropriate marking for escaped characters according to policyŸdarcsŸ policy color doc colors doc with color color if policyZ is not set to use an alternative to color. In that case, it makes the text bold instead.¿darcs¿ doc tries to make docm (usually a single escaped char) stand out with the help of only plain ascii, i.e., no color or font style.Àdarcs)the string to reset the terminal's color.ÁdarcsÁ color doc returns a colorized version of doc. color/ is a string that represents a color, given by ÂÃdarcsà boldens a doc.ÄdarcsÄ* returns an invert video version of a doc.DEFGHIJKGDEFHIKJ!2008 David RoundyGPLdarcs-devel@darcs.net experimentalportableNone',.=>?EHSUVXeLdarcsbeginTedious k/ starts a tedious process and registers it in Å with the key kC. 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?Mdarcs endTedious k* unregisters the tedious process with key k , printing Done" if such a tedious process exists.OdarcsXXX: document this constant ­®LMNOPQRSTUV LMN­®VQRSTPOU"2003 David RoundyGPLdarcs-devel@darcs.net experimentalportableNone',.2=>?EHSUVXhPcdarcscommand to rundarcs any argumentsdarcsexitcode, stderr WXY\[Z]^_`abc `ac_b^Y\[Z]WXãNone',.=>?EHSUVXin ÆÇÈÉÊËÌÍÎÏ#None',.=>?EHSUVXtükdarcsonly shown on helpndarcs!Ask the user for a line of input.odarcsAsk the user to press EnterpdarcsaskUserListItem prompt xs enumerates xs? on the screen, allowing the user to choose one of the itemsqdarcsPrompt the user for a yes or nordarcsÿHPrompt 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.ndarcsThe prompt to displaydarcsThe string the user entered.odarcsThe prompt to display ghijklmnopqr onpghijklmqrSafe',.=>?EHSUVXv U]U]$Safe',.=>?EHSUVXvÈstuust%Safe',.=>?EHSUVXwŽuwxyz{|}~€‚ƒ„…{|}€~yzwx‚„ƒ…u&None',.=>?EHSUVX‘¶ †darcs† abstracts over ‹ and Š# for code constructing these values‡darcs An empty †, e.g. NilFL or NilRLˆdarcsA †e constructed from a completely polymorphic value, for example the constructors for primitive patches‰darcs Compose two †C 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 Ð2 is needed, rather than writing the more obvious  (ÑO p) which would notionally have the same quantification of the type witnesses.ÐdarcsÐ5 is a type level composition operator. For example,  Ð ( p)  is equivalent to  \x ->  (p x) ÑdarcsÑ is similar to ], but the type argument is universally quantified instead of being existentially quantified.Ž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 ‹ value¡darcs Unwrap a Š value†ˆ‡‰Š‹ŒŽ‘’“”•–—˜™š›œžŸ ¡‘’Ž“Œ”•–—˜™š›œžŸ‹Š ¡†ˆ‡‰'None',.=>?EHSUVX¡ü §darcsParallel Pairs©darcs(Forking Pair (Explicit starting context) ˆ wX wY \ / \ / \ / wU | | | wA «darcs Joining Pairs­darcs)Forking Pairs (Implicit starting context)¯darcs Reverse lists²darcs Forward listsµdarcsDirected Forward Pairs¹darcsfilterOutFLFL p xs deletes any x in xs for which  p x == IsEq (indicating that xX has no effect as far as we are concerned, and can be safely removed from the chain)ÇdarcsMonadic fold over an ²a associating to the left, i.e. from left to right. The order of arguments follows the standard foldM from base.Ý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.<§š©ª«¬­®¯±°²Ž³µ¶·ž¹º»ŒœŸ¿ÀÁÂÃÄÅÆÇÈÉÊËÌÍÎÏÐÑÒÓÔÕÖ×ØÙÚÛÜÝÞßàáâ<µ¶²Ž³¯±°­®«¬§š©ª·žÖ×ÓÕÎÒÌÍÈÊÉËԻďºŸ¿ŒœàáÀÁÛÜÆÇÂÃÑÚÏÐÝÞßâØÙ§1š1«1¬1­1®1°5³5µ1¶1Œ5œ5à5á5(None',.=>?EHSUVXš"ø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_MiddleùdarcsSee øòóôõö÷øùúûüýþÿòó÷üýúûùøôöõþÿ)None',.=>?EHSUVX©@*None',.=>?EHSUVXª  +None',.=>?EHSUVXŽ darcsÿ PatchDebug 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. darcsRA dummy method so we can export/import PatchDebug(..) without triggering warnings    ,None',.=>?EHSUVXŸdarcsÿFCommuteFn 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.  -None',.=>?EHSUVXÆdarcs:Commute represents things that can be (possibly) commuted.darcs commutes an ¯ past an ².darcs% commutes a RL past a single element.darcs% commutes a single element past a FL. darcs › attempts to commute a single element past a FL. If any individual commute fails, then we return the patch that first patch that cannot be commuted past.!darcsTBuild a commuter between a patch and itself using the operation from the type class. ! !.None',.=>?EHSUVXè¬ $darcs split an ²8 into "left" and "right" lists according to a predicate pÁ, using commutation as necessary. If a patch does satisfy the predicate but cannot be commuted past one that does not satisfy the predicate, it goes in the "middle" list; to sum up, we have:  all p left and all (not.p) right&, while midddle is mixed. Note that p0 should be invariant under commutation (i.e. if x1 can commute to x2 then 'p x1  = p x2').%darcs split an ¯á into "left" and "right" lists according to a predicate, using commutation as necessary. If a patch does satisfy the predicate but cannot be commuted past one that does not satisfy the predicate, it goes in the "left" list.+darcs+ x xs removes x from xs if x6 can be commuted to its head. Otherwise it returns E,darcs, is like + except with ¯-darcs- ab abc returns Just c' where all the patches in abk 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 E..darcs. is like removeSubsequenceFL except that it works on ¯/darcsThis is a minor variant of 02 with each permutation is simply returned as a ²0darcs0 p:>:psE 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 qX :> 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 c1darcs1 is like 0", except that we operate on an ¯g (in other words, we are pushing things to the end of a patch sequence instead of to the beginning).2darcsoPartition a list into the patches that merge 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$%&'()*+,-./0123+,*&()'$%/10-.23/darcs-devel@darcs.net experimentalportableNone',.=>?EHSUVXïã6darcs!Things that can always be merged.)Instances should obey the following laws:SymmetryAmerge (p :\/: q) == q' :/\: p' <=> merge (q :\/: p) == p' :/\: q' MergesCommuteFmerge (p :\/: q) == q' :/\: p' ==> commute (p :> q') == Just (q :> p'):that is, the two branches of a merge commute to each other:darcs#The natural, non-conflicting merge.6789:;<6789:;<0None',.=>?EHSUVX<š?darcsSee module documentation for Darcs.Patch.Choices.CdarcsA sequence of Des where each patch is either @, A, or B€. 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 A or B- are mixed together; when a patch is marked BG, its dependencies are not updated until we retrieve the final result.ÒdarcsThis internal type tags a D with a 8, to distinguish A from B patches.Ódarcsthe D in questionÔdarcsD = A, G = BDdarcsA patch with a E attached to it.EdarcsE 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 iW 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, E" is a non-empty, reversed list of <s.ÕdarcsInternal function to tag a D as A or B.Idarcs Create a C@ from a sequence of patches, so that all patches are initially A.Jdarcs@Label a sequence of patches, maybe using the given parent label.Kdarcs Create a CR from an already labelled sequence of patches, so that all patches are initially A.LdarcsLike N but lumps together A and B- patches. This is more efficient than using N and then catenating A and B: sections because we have to commute less. (This is what C are optimized for.)IseparateFirstFromMiddleLast c == case getChoices c of f:>m:>l -> f:>m+>+lMdarcsLike N but lumps together @ and A patches.IseparateFirstMiddleFromLast c == case getChoices c of f:>m:>l -> f+>+m:>lNdarcs'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 A, and all patches in last are B.Ödarcs3Internal function to commute patches in the common × segment so that all B patches are behind A ones. Patches A that depend on any B are promoted to B.OdarcsUse the given monadic C transformer on the A section of a C., then fold the result back into the original C.PdarcsGiven a D* determine to which section of the given CF it belongs. This is not trivial to compute, since a patch tagged as A may be forced to actually be B3 by dependencies. We return a possibly re-ordered C, so as not to waste the commutation effort.Qdarcs5Force all patches matching the given predicate to be @^, pulling any dependencies with them. This even forces any patches that were already tagged B.Rdarcs>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 B.Sdarcs9Force a single patch labelled with the given label to be @^, pulling any dependencies with them. This even forces any patches that were already tagged B.Tdarcs Make all A patches either @ or BH. This does *not* modify any patches that are already determined to be B by dependencies.Udarcs Similar to Q% only that patches are forced to be B% regardless of their previous status.ØdarcsBInternal function working directly on the constituent parts of a C and taking an accumulating ¯ to build up a new @$ section. It forces patches to be A or B, depending on the 8 parameter (G means B, D means Al). It does this regardless of the previous status of patches and also pulls any dependent patches with it.Vdarcs>Force all patches labelled with one of the given labels to be Ba, pulling any dependencies with them. This even forces any patches that were previously tagged @.Wdarcs9Force a single patch labelled with the given label to be BK, pulling any dependencies with them, regardless of their previous status.XdarcsForce a patch with the given E to be AI, pulling any dependencies with it, regardless of their previous status.YdarcsTurn @ patches into A ones and A into B ones.ZdarcsTurn A patches into @ and B patches into A%. Does *not* pull dependencies into @0, instead patches that cannot be commuted past B patches stay A.[darcsSubstitute a single D? with an equivalent list of patches, preserving its status as @, A or B-). The patch is looked up using equality of Es.Ødarcsaccumulator for @ patchesdarcs original @ sectiondarcs original A and B section?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[C?@ABIKPNMLQRSUVWXZYTO[DEFHJG1None',.=>?EHSUVXDRgdarcsÿ€This 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. fghijklmn ghijmkfnl2None',.=>?EHSUVXPqdarcsjTake a list of paragraphs and format them to the given line length, with a blank line between paragraphs.sdarcs»Take a list of words and split it up so that each chunk fits into the specified width when spaces are included. Any words longer than the specified width end up in a chunk of their own.vdarcs!Quote a string for screen output.wdarcsFormat a list of _Ýs 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.xdarcsVProduce a String composed by the elements of [String] each enclosed in double quotes. pqrstuvwx pqrsutvwx3None',.=>?EHSUVXRëƒdarcspGiven an ssh URL or file path, split it into user@host, repodir, and the file (with any _darcs/ prefix removed) y|z{}~€‚ƒ„ €}~‚y{z|„ƒ%2008 David Roundy <droundy@darcs.net>GPLdarcs-devel@darcs.net experimentalportableSafe',.=>?EHSUVXUJÿ     ……ÿ     4Safe',.2=>?EHSUVXXóˆdarcsA drop-in replacement for Ùq, which allows us to catch anything but a signal. Useful for situations where we don't want to inhibit ctrl-C.†‡ˆ‰Š‹‡‹‰ˆŠ†5Safe',.=>?@AEHSUVXdlÚdarcslThe firstJustM returns the first Just entry in a list of monadic operations. This is close to `listToMaybe ÿ sequence`, but the sequence operator evaluates all monadic members of the list before passing it along (i.e. sequence is strict). The firstJustM is lazy in that list member monads are only evaluated up to the point where the first Just entry is obtained.darcsïThe 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.Ž‘’“Ž‘’“6None',.=>?EHSUVX{rÛdarcs"Identifier (key) for a connection.ÜdarcscA re-usable connection to a remote darcs in transfer-mode. It contains the three standard handles.ÝdarcsExpected properties:2only ever runs once in the lifetime of the program"environment variables override alltries Putty first on Windowsfalls back to plain old sshÞdarcsËGlobal mutable variable that contains open connections, identified by the repoid part of the ssh file name. Only one thread can use a connection at a time, which is why we stuff them behind their own ßs.>We distinguish between a failed connection (represented by a EÁ entry in the map) and one that was never established (the repoid is not in the map). Once a connection fails, either when trying to establish it or during usage, it will not be tried again.àdarcstWait for an existing connection to become available or, if none is available, try to create a new one and cache it.ádarcs~Try to create a new ssh connection to a remote darcs that runs the transfer-mode command. This is tried only once per repoid.âdarcscMark any connection associated with the given ssh file path as failed, so it won't be tried again.¡darcs°Return 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.àdarcsremote darcs commanddarcs destinationdarcswrapper for the action”–•—˜™š›œžŸ ¡¢£€˜™š›œžŸ”–•—¡¢£€ 7None',.=>?EHSUVXÞܧdarcsÿŸThis 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) or .«darcs³This 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.­darcs€Paths which are relative to the local darcs repository and normalized. Note: These are understood not to have the dot in front.²darcs_FileName is an abstract type intended to facilitate the input and output of unicode filenames.ždarcsži translates whitespace in filenames to a darcs-specific format (numerical representation according to ão 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¹B 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"¿darcs”convert a path string into a sequence of directories strings "/", "." and ".." are generally interpreted as expected. Behaviour with too many '..' is to leave them.$Examples: Splitting: "aabbIcc" -> ["aa","bb","cc"] Ignoring "." and extra "/": "aa.Ibb" -> ["aa","bb"] "aa//bb" -> ["aa","bb"] "aa9bb/" -> ["aa","bb"] Handling "..": "aa..#bb/cc" -> ["bb","cc"] "aabb....cc" -> ["cc"] "aa..bb..4cc" -> ["cc"] "../cc" -> ["..","cc"]Âdarcs7Make the second path relative to the first, if possibleädarcs3Ensure directory exists and is not a symbolic link.ÆdarcsEInterpret a possibly relative path wrt the current working directory.ÇdarcsÿŸTake 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.ådarcseConvert to posix, remove trailing slashes, and (under Posix) reduce multiple leading slashes to one.Èdarcs'The root directory as an absolute path.ÌdarcscExecute either the first or the second argument action, depending on whether the given path is an ¬ or stdin/stdout.ædarcsgNormalize the path separator to Posix style (slash, not backslash). This only affects Windows systems.çdarcsHReduce multiple leading slashes to one. This only affects Posix systems.Ñ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.ÒdarcsWarning : this is less rigorous than isMaliciousPath but it's to allow for subpath representations that don't start with ./ÓdarcsšConstruct 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.ÔdarcsSame as  filterPath, but for ordinary _ s (as opposed to AnchoredPath).ÕdarcsÿIteratively 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).Ödarcs)Transform a SubPath into an AnchoredPath.×darcs1Check whether a path is a prefix of another path.Ødarcs'Append an element to the end of a path.Ùdarcs™Catenate 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]ÜdarcsATake a "root" directory and an anchored path and produce a full _. Moreover, you can use  anchorPath "" to get a relative _.ßdarcsòTake a relative FilePath and turn it into an AnchoredPath. The operation is (relatively) unsafe. 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. Also, there are certain invariants about AnchoredPath that this function tries hard to preserve, but probably cannot guarantee (i.e. this is a best-effort thing). You should sanitize any FilePaths before you declare them "good" by converting into AnchoredPath (using this function).ádarcsšTake a prefix path, the changed prefix path, and a path to change. Assumes the prefix path is a valid prefix. If prefix is wrong return AnchoredPath [].âdarcs4Append a String to the last Name of an AnchoredPath.>§š©ª«¬­®¯°±²³Žµ¶·ž¹º»ŒœŸ¿ÀÁÂÃÄÅÆÇÈÉÊËÌÍÎÏÐÑÒÓÔÕÖ×ØÙÚÛÜÝÞßàáâãä>²³Žµ¶Ÿ¿ŒœÁž¹º»À¬ÇÆÈ«ÉËÌʪÍέÂÃÄÖ·°±®¯ÏÐÕÅÑÒÔÓ©ã䧚àØÜ×ÚÛÙÝÞâßá8None',.=>?@AEHSUVX!bdarcsGiven  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.darcsÆAbstraction 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 "." >>= expandœWhen 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). darcs©Get 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 E if the path is invalid.darcsFind a  by its path. Gives E6 if the path is invalid, or does not point to a Blob.darcsFind a  by its path. Gives E6 if the path is invalid, or does not point to a Tree. darcsList all contents of a ."darcsôExpand 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).#darcsäUnfold 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.$darcsàCheck 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.&darcsORead a Blob into a Lazy ByteString. Might be backed by an mmap, use with care.'darcsõFor 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.(darcsÿ'For 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.èdarcs™Helper function for taking the union of AnchoredPath lists that are already sorted. This function does not check the precondition so use it carefully.*darcsÿ€Cautiously 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./darcsÿ»Lay 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)./¢€£      !"#$%&'()*+,-./0/    ¢€£!"#$  '()*&%+-.,/09None',.=>?EHSUVXA8 6darcs~Change content of a file at a given path. The change will be eventually flushed to disk, but might be buffered for some time.>darcs=Grab content of a file in the current Tree at the given path.?darcsBCheck for existence of a node (file or directory, doesn't matter).@darcs#Check for existence of a directory.AdarcsCheck for existence of a file.CdarcsA B) monad. A sort of like IO but it keeps a D] around as well, which is a sort of virtual filesystem. Depending on how you obtained your Bc, the actions in your virtual filesystem get somehow reflected in the actual real filesystem. For I4, nothing happens in real filesystem, however with  plainTreeIO?, the plain tree will be updated every now and then, and with  hashedTreeIO- a darcs-style hashed tree will get updated.DdarcsInternal state of the Br monad. Keeps track of the current Tree content, unsync'd changes and a current working directory (of the monad).HdarcsÿcRun a TreeIO action without storing any changes. This is useful for running monadic tree mutations for obtaining the resulting Tree (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 a form of modified Tree.édarcsÊModifies an item in the current Tree. This action keeps an account of the modified data, in changed and changesize, for subsequent flush operations. Any modifications (as in "modifyTree") are allowed.Jdarcs“Replace an item with a new version without modifying the content of the tree. This does not do any change tracking. Ought to be only used from a sync  implementation for a particular storage format. The presumed use-case is that an existing in-memory Blob is replaced with a one referring to an on-disk file.êdarcs:If buffers are becoming large, sync, otherwise do nothing.58:976;<=?@A>BCDEFGHIJKLMIH>679:8A@?=<EDCBGFJKML;5:None',.=>?EHSUVXJjQdarcsrun a list of R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.Rdarcsüa 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.Wdarcsrun a list of Rs without any feedback messagesPQRSTUVWPQRSTUVW;None',.=>?EHSUVXZx\darcs@Compute a darcs-compatible hash value for a tree-like structure._darcsCRead and parse a darcs-style hashed directory listing from a given dir and with a given hash.ëdarcsµRead in a darcs-style hashed tree. This is mainly useful for reading "pristine.hashed". You need to provide the root hash you are interested in (found in _darcs/hashed_inventory).bdarcs1Write a Tree into a darcs-style hashed directory.ìdarcsCreate a hashed file from a _ê and content. In case the file exists it is kept untouched and is assumed to have the right content. XXX Corrupt files should be probably renamed out of the way automatically or something (probably when they are being read though).cdarcsRun a B action in a hashed setting. The initial1 tree is assumed to be fully available from the  directoryk, and any changes will be written out to same. Please note that actual filesystem files are never removed.cdarcsactiondarcsinitialdarcs directory YZ[\]^_`abc `bc_a^[\YZ]None',.=>?EHSUVXc_hdarcsosxCacheDir assumes ~LibraryCaches/ exists.idarcsBxdgCacheDir returns the $XDG_CACHE_HOME environment variable, or ~/.cache3 if undefined. See the FreeDesktop specification: Fhttp://standards.freedesktop.org/basedir-spec/basedir-spec-latest.htmljdarcsMgetRecursiveContents returns all files under topdir that aren't directories.kdarcs—getRecursiveContentsFullPath returns all files under topdir that aren't directories. Unlike getRecursiveContents this function returns the full path. defghijk edfgihjk<None',.=>?EHSUVXf”mdarcs Write out fulla tree to a plain directory structure. If you instead want to make incremental updates, refer to Darcs.Util.Tree.Monad.lmlm=None',.=>?@AEHSUVX“ídarcs1nextF is the position of the next item, in bytes.îdarcsresitemF is the item extracted.ïdarcss_fileIDs contains the fileids of the files and folders inside, in a folder item and its own fileid for file item).ðdarcs@marks if the item has changed since the last update to the indexñdarcs0next is the position of the next item, in bytes.òdarcs{treeitem is Nothing in case of the item doesn't exist in the tree or is filtered by a FilterTree. Or a TreeItem otherwise.ódarcsresitem is the item extracted.ôdarcs«Description of a a single indexed item. The structure itself does not contain any data, just pointers to the underlying mmap (bytestring is a pointer + offset + length).ÿgThe structure is recursive-ish (as opposed to flat-ish structure, which is used by git...) It turns out that it's hard to efficiently read a flat index with our internal data structures -- we need to turn the flat index into a recursive Tree object, which is rather expensive... As a bonus, we can also efficiently implement subtree queries this way (cf. q).õdarcsÿLay out the basic index item structure in memory. The memory location is given by a ForeignPointer () and an offset. The path and type given are written out, and a corresponding Item is given back. The remaining bits of the item can be filled out using update.ödarcs=Read the on-disk representation into internal data structure.See the module-level section  Index format- for details on how the index is structured.÷darcskUpdate an existing item with new hash and optionally mtime (give Nothing when updating directory entries).ødarcsÝGives a ForeignPtr to mmapped index, which can be used for reading and updates. The req_size parameter, if non-0, expresses the requested size of the index file. mmapIndex will grow the index if it is smaller than this.pdarcskReturn a list containing all the file/folder names in an index, with their respective ItemType and FileID.qdarcsRead an index and build up a — object from it, referring to current working directory. The initial Index object returned by readIndex is not directly useful. However, you can use äåC on it. Either way, to obtain the actual Tree object, call update.The usual use pattern is this: Hdo (idx, update) <- readIndex tree <- update =<< filter predicate idx*The resulting tree will be fully expanded.rdarcs8Will add and remove files in index to make it match the ' object given (it is an error for the c to contain a file or directory that does not exist in a plain form in current working directory).sdarcs‹Check 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.tdarcsSFor a given file or folder path, get the corresponding fileID from the filesystem. nopqrstuvw qrsopntuvw>None',.=>?EHSUVX”"†z{|}~†{z|~}?None',.=>?EHSUVX–ŸdarcsThe Z type is a list of all flags that can ever be passed to darcs, or to one of its commands.Á4ŒŽ€òÊ5ú"†0,¹ÁÅÉÝùð ¡£ŸƒíÞÌÒñ“>ŽºÂÆÄŠß­‚„…‡ˆ‹‘’”•–—˜™š›œž ¢€¥Š§š©ª«¬®¯°±²³µ¶·ž»ŒœŸ¿ÀÇÈÉËÍÎÏÐÑÓÔÕÖ×ØÙÚÛÜàáâãäåæçèéêëìîïóôõö÷øûüýþÿ     !#$%&'()*+-./1236789:;<=?Á4ŒŽ€òÊ5ú"†0,¹ÁÅÉÝùð ¡£ŸƒíÞÌÒñ“>ŽºÂÆÄŠß­‚„…‡ˆ‹‘’”•–—˜™š›œž ¢€¥Š§š©ª«¬®¯°±²³µ¶·ž»ŒœŸ¿ÀÇÈÉËÍÎÏÐÑÓÔÕÖ×ØÙÚÛÜàáâãäåæçèéêëìîïóôõö÷øûüýþÿ     !#$%&'()*+-./1236789:;<=?@None"#',.=>?EHSUVX͆Bdarcs@The raw material from which multi-valued options are built. See Q.ùdarcsA I) that requires a single argument of type a and handles flags of type f.HdarcsThis is Q& instantiated with 'DarcsOptDescr and J.IdarcsWe do not instantiate the d in R d f directly with ú%. Instead we (post-) compose it with (->) æç+. Modulo newtype noise, this is the same as  type 'DarcsOptDescr 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).JdarcsqThis type synonym is here for brevity and because we want to import the data constructors (but not the type) of  qualified.Kdarcs.Construct an 'DarcsOptDescr with no arguments.Ldarcs#Construct an 'DarcsOptDescr with a ð argument.Mdarcs-Construct an 'DarcsOptDescr with an optional ð argument.Ndarcs$Construct an 'DarcsOptDescr with an ¬ argument.Odarcs$Construct an 'DarcsOptDescr with an « argument.Pdarcs-Construct an 'DarcsOptDescr with an optional ¬ argument.ûdarcsNGet the long switch names from a raw option. Used to construct error messages.üdarcsGiven a list of B*, find all flags that match a given value.ýdarcsGiven a list of Bc, find all values that match a given flag list in the order in which they appear in the flag list.þdarcs?The first element of a list, or a default if the list is empty.ÿdarcsLAppend " [DEFAULT" to the help text of options that match the default value.Qdarcs Construct a H$ from a default value and a list of B.HPrecondition: the list must have an entry for each possible value (type v).Rdarcs Construct a 8S valued option with a single flag that takes no arguments and has no default flag.JThe arguments are: short switches, long switches, flag value, help string.Sdarcs Construct a > ð0 valued option with a single flag that takes a ð" argument and has no default flag.eThe arguments are: short switches, long switches, flag constructor, single flag parser, help string.Tdarcs Construct a > ¬1 valued option with a single flag that takes an ¬" argument and has no default flag.eThe arguments are: short switches, long switches, flag constructor, single flag parser, help string.Udarcs Similar to Sc, except that the flag can be given more than once. The flag arguments are collected in a list of ðs.Vdarcs Similar to U., except that the flag arguments are optional.Wdarcs Similar to Tc, except that the flag can be given more than once. The flag arguments are collected in a list of ¬s.darcs^A multi-arg option, defined in terms of a single-arg option, returning a list of single args.’The parameters are: single argument description, short switches, long switches, flag constructor, flag list parser, arg name string, help string.XdarcseA deprecated option. If you want to deprecate only some flags and not the whole option, extract the BÌ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.«¬ÇÉBCDEFGHIJKLMNOPQRSTUVWXJHIKLMNOPBCDEFGQRSUVTWX¬«ÇÉANone',.=>?EHSUVXÏ ZZBNone',.=>?EHSUVXÏÂ[\]^\]^[CNone',.=>?EHSUVXА _`abcdefgh cdefgh_`abDNone',.=>?EHSUVXÒÄmdarcsFThis class is used to decode patches from their binary representation.mnopqrsmnpoqrsENone',.=>?EHSUVXÔÏ€darcs#An object is located by giving the ‚ of the parent } and a ©.©wxyz{|}~€‚ƒ„…†‚ƒ€|}~wxyz{„…†©FNone',.4=>?EHSUVXßñŒdarcs&This is used to track changes to files’darcs‰This is an invalid patch e.g. there is a patch 'Move Autoconf.lhs Autoconf.lhs.in' where there is no Autoconf.lhs in the darcs repo“darcslthis is used for duplicate patches that don't have any effect, but we still want to keep track of them”darcsUThe PatchId identifies a patch and can be created from a PatchInfo with makePatchname—darcsÄThe 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 stringŒ“’‘Ž”•–—˜™š›œž—˜™š›”•–œŒ“’‘ŽžGNone',.=>?@AEHSUVXêŸdarcsÿ-trackOrigRename takes an old and new name and attempts to apply the mapping to the OrigFileNameOf pair. If the old name is the most up-to-date name of the file in question, the first element of the OFNO will match, otherwise if the up-to-date name was originally old, the second element will match.ÁdarcsÿwithFileNames 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.ª«®¬­¯°±²³Žµž¶·¹º»ŒœŸ¿ÀÁª«®¬­ŒœŸº»Á¿À¯°±²³Žµž¶·¹H2002-2005 David RoundyGPLdarcs-devel@darcs.net experimentalportableNone',.=>?@AEHSUVXñ,ÓdarcsApply a patch to a , yielding a new .ÕdarcsÆAttempts to apply a given replace patch to a Tree. If the apply fails (if the file the patch applies to already contains the target token), we return Nothing, otherwise we return the updated Tree.ÎÏÐÑÒÓÔÕÎÏÐÒÓÔÕÑINone',.=>?EHSUVXòØÙÚÛÜÝÝÛÜØÙÚJNone',.=>?EHSUVXþ6ædarcsÿshowContextPatch 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 Jé.ÞàßãäáâåæçèéëêìíçèìéëêÞàßãäáâåæíKNone',.=>?EHSUVX'íîdarcsîA 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.darcs:The isAscii limitation is due to the use of BC.pack below.ü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.ýdarcsNaddJunk adds a line that contains a random number to make the patch unique.ÿdarcsDGet the name, including an "UNDO: " prefix if the patch is inverted.darcsReturns the author of a patch.darcs&Returns the name of the patch. Unlike ÿH, it does not preprend "UNDO: " to the name if the patch is inverted.darcsReturns the author of a patch.darcsüRead the date from raw patch (meta) data and convert it to UTC. The raw data may contain timezone info. This is for compatibiltity with patches that were created before 2003-11, when darcs still created patches that contained localized date strings. darcsGet the log message of a patch. darcs.Get the tag name, if the patch is a tag patch.darcsÿConvert a metadata ByteString to a string. It first tries to convert using UTF-8, and if that fails, tries the locale encoding. We try UTF-8 first because UTF-8 is clearly recognizable, widely used, and people may have UTF-8 patches even when UTF-8 is not their locale.darcs×Hash on patch metadata (patch name, author, date, log, and "inverted" flag. Robust against context changes but does not garantee patch contents. Usually used as matcher or patch identifier (see Darcs.Patch.Match).darcs(Patch is stored between square brackets. Ò[ <patch name> <patch author>*<patch date> <patch log (may be empty)> (indented one) <can have multiple lines in patch log,> <as long as they're preceded by a space> <and don't end with a square bracket.> ]=note that below I assume the name has no newline in it. See X for the inverse operation. There are more assumptions, see validation functions above.darcs Parser for î> as stored in patch bundles and inventory files, for example: «[Document the foo interface John Doe <john.doe@example.com>**20110615084241 Ignore-this: 85b94f67d377c4ab671101266ef9c229 Nobody knows what a 'foo' is, so describe it. ]See  for the inverse operation.$îïôðñòóõö÷øùúûüýþÿ     $îïôðñòóûüþýÿ     õ÷ùöøúLNone',.=>?EHSUVX)»MNone',.=>?EHSUVX*‘NNone',.=>?EHSUVX1ñ!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 !p 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.!"#$%&'#$!"'%&ONone',.=>?EHSUVXKP5darcstryToShrink ps simplifies ps> by getting rid of self-cancellations or coalescing patchesÑQuestion (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?6darcstryShrinkingInverse psŠ deletes the first subsequence of primitive patches that is followed by the inverse subsequence, if one exists. If not, it returns Nothing7darcs7 ps coalesces as many patches in ps< as possible, sorting the results in some standard order.8darcs£It 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 8Û 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.9darcs9 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).[darcskThis class describes the abstract interface to primitive patches that is indepenent of the on-disk format.1+,-./0123487596:;D=<?>@BCAEFGHMPOJQIKLNRSTUVWXYZ[1;D=<?>@BCAEF487596:GHMPOJQIKLN23/01-.+,ZXYVWRSTU[PNone',.=>?EHSUVXQpdarcsp p1 p25 is used to provide an arbitrary ordering between p1 and p21. Basically, identical patches are equal and Move < DP < FP < ChangePrefF. Everything else is compared in dictionary order of its arguments.abcdigefhjkmlnopjkmlnabcdigefhopQNone',.=>?EHSUVXSªdarcsModify a binary file ;binary FILENAME oldhex *HEXHEXHEX ... newhex *HEXHEXHEX ...RNone',.=>?EHSUVXTXSNone%',.=>?EHSUVXUTNone',.=>?EHSUVXUÌ ˆ‰Š‹ŒŽ‘ ‰Š‹ŒˆŽ‘UNone',.=>?EHSUVXozdarcs p1 :> p2 tries to combine p1 and p2ÿ7 into a single patch without intermediary changes. For example, two hunk patches modifying adjacent lines can be coalesced into a bigger hunk patch. Or a patch which moves file A to file B can be coalesced with a patch that moves file B into file C, yielding a patch that moves file A to file C.darcs shrinkABit ps tries to simplify psI by one patch, the first one we find that coalesces with its neighbour darcstryOne acc p ps pushes p as far down psh as we can go until we can either coalesce it with something or it can't go any further. Returns Just2 if we manage to get any coalescing out of this darcsThe heart of "sortCoalesceFL" darcs  new ps is almost like  new :>: psB except as an alternative to consing, we first try to coalesce new with the head of ps=. If this fails, we try again, using commutation to push new9 down the list until we find a place where either (a) new is LT the next member of the list  bsee 'comparePrim'u commutation fails or (c) coalescing succeeds. The basic principle is to coalesce if we can and cons otherwise.ÿAs an additional optimization, pushCoalescePatch outputs a Left value if it wasn't able to shrink the patch sequence at all, and a Right value if it was indeed able to shrink the patch sequence. This avoids the O(N) calls to lengthFL that were in the older code.†Also note that pushCoalescePatch is only ever used (and should only ever be used) as an internal function in in sortCoalesceFL2.VNone',.=>?EHSUVXp(WNone',.=>?EHSUVXpÖjjXNone',.1=>?EHSUVXqœ©|}~€‚ƒ„ž£Ÿ ¡¢€¥Š§ž£Ÿ ¡¢Š§€¥|}~‚ƒ€©„YNone%',.=>?EHSUVXrúZNone',.=>?EHSUVXsš[None',.=>?EHSUVXtV\None',.=>?EHSUVXuêNone',.=>?EHSUVXu²*,-./013487596:;D=<?>@BCAEFQJPOMHRSTUVWXYZ[*HMOPJQ3,-./01VWRSTUZXY;D=<?>@BCAEF487596:[]None',.1=>?EHMSUVX{!¿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 are¿ÀÁÂÃÄ¿ÀÁÂÃÄ^None',.=>?EHSUVX{ÿÍÍ_None%',.=>?EHSUVX“…Ïdarcsÿ€A 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.Ódarcs’This generic splitter just lets the user edit the printed representation of the patch. Should not be used expect for testing and experimentation.ÔdarcsÝNever 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.ÕdarcsŽSplit 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.ÏÐÑÒÓÔÕÖÏÐÑÒÓÔÕÖ`None',.=>?EHSUVX–ë×darcsWPatches whose concrete effect which can be expressed as a list of primitive patches.(A minimal definition would be either of effect or effectRL.×ØÙ×ØÙaNone',.=>?EHSUVXºñ darcsabstract over  'FL'/'RL'ÜdarcsFNonable represents the class of patches that can be turned into a Non.ÞdarcsA Þ stores a context with a PrimJ patch. It is a patch whose effect isn't visible - a Non-affecting patch.àdarcsOunNon 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 cyT 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'']çdarcsTcommutePrimsOrAddToCtx takes a WL of prims and attempts to commute them past a Non.édarcsÿgcommuteOrRemFromCtx 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?êdarcs~commuteOrRemFromCtxFL 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.ìdarcsB(>*) attempts to modify a Non, by commuting a given patch past it.ídarcsJ(*>>) attempts to modify a Non by commuting it past a given WL of patches.îdarcsJ(>>*) attempts to modify a Non by commuting a given WL of patches past it.ïdarcsVNons are equal if their context patches are equal, and they have an equal prim patch.ÜÝÞßàáâãäåæçèéêëìíîÞßÜÝàâáäãçåéæêèëìíîbNone',.=>?EHSUVXŒ7cNone%',.=>?EHSUVXÁŒÿdarcsIf ÿ x :> y succeeds, we know that that x commutes past yO without any conflicts. This function is useful for patch types for which commute† is defined to always succeed; so we need some way to pick out the specific cases where commutation succeeds without any conflicts. øùúûüýþÿ þÿüýøùúûdNone',.=>?EHSUVXÓŸ darcs ! attempts to commute two patches p1 and p2Œ, in their original order, with the given commute function. If the commute function doesn't know how to handle the patches (i.e. it returns Unknown as a result), then we try again with  invert p2 and  invert p1( (inverting the results, if succesful).^TODO: when can the first attempt fail, but the second not? What's so clever in this function?darcs|If we have two Filepatches which modify different files, we can return a result early, since the patches trivially commute.darcsEAttempt to commute two patches, the first of which is a Merger patch.darcscactualMerge attempts to perform a merge; if successful, it returns the "right" branch of the mergeTTODO: why does this code throw away the other branch, only for merge to rebuild it?darcs}merger 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 (p1d is the "first" patch in the repo ordering), the resulting Merger is therefore a representation of p2.77eNone',.=>?EHSUVXԌfNone',.=>?EHSUVXÖ,darcs5High-level representation of a piece of patch summary!"#$#!"$gNone',.=>?EHSUVX×''hNone',.=>?@AEHSUVX×Ðwxyz{--wxyz{iNone',.=>?EHSUVXØ®žžjNone',.=>?EHSUVXÝá:darcsThe Named6 type adds a patch info about a patch, that is a name.NamedP info deps p represents patch p with name info. depsz is a list of dependencies added at the named patch level, compared with the unnamed level (ie, dependencies added with darcs record --ask-deps).:;<=>?@ABCDEFGH:;>?<=@ABCDEFGHkNone',.=>?EHSUVXë_darcsA _ÿ 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.cdarcsqCommute a name patch and a primitive patch. They trivially commute so this just involves changing the witnesses.ddarcsqCommute a primitive patch and a name patch. They trivially commute so this just involves changing the witnesses.edarcsuCommute a name patch and a named patch. In most cases this is trivial but we do need to check explicit dependencies.fdarcsuCommute a named patch and a name patch. In most cases this is trivial but we do need to check explicit dependencies. _`abcdefg _`abcdefglNone',.=>?EHSUVXïudarcs{A single rebase fixup, needed to ensure that the actual patches being stored in the rebase state have the correct context.ydarcs/Split a sequence of fixups into names and primsuvwxyz{|uvwz|{yxmNone',.=>?EHSUVX­‡darcsžA 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 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.‹darcs°Given 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 ˆ% patches then it is dropped entirely.ŒdarcsLike ‹ but for a list of fixups.‡‰ˆŠ‹Œ‡‰ˆ‹ŒŠnNone',.1=>?EHSUVXl•darcseA patch that lives in a repository where a rebase is in progress. Such a repository will consist of Normal! patches along with exactly one  Suspended patch.(Most rebase operations will require the  Suspended+ patch to be at the end of the repository.NormalP represents a normal patch within a respository where a rebase is in progress. Normal p. is given the same on-disk representation as pa, so a repository can be switched into and out of rebasing mode simply by adding or removing a  Suspended/ patch and setting the appropriate format flag. The single  Suspended9 patch contains the entire rebase state, in the form of ‡s.*Note that the witnesses are such that the  Suspended 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.(See Note [Rebase representation] in the ëìU for a discussion of the design choice to embed the rebase state in a single patch.˜darcs3add fixups for the name and effect of a patch to a •™darcsTremove fixups (actually, add their inverse) for the name and effect of a patch to a ••–—˜™š›•–—š›˜™oNone',.1=>?EHSUVX+„²darcsÿ A layer inbetween the 'Named p' type and 'PatchInfoAnd p' design for holding "internal" patches such as the rebase container. Ideally these patches would be stored at the repository level but this would require some significant refactoring/cleaning up of that code.µdarcslift a function over an ² of patches to one over a 'WrappedNamed rt'. The function is only applied to "normal" patches, and any rebase container patch is left alone.ºdarcs;Return a list of the underlying patches that are actually active: in the repository, i.e. not suspended as part of a rebaseÁdarcs Is the given ²« patch an internal implementation detail that shouldn't be visible in the UI or included in tags/matchers etc? Two-level checker for efficiency: if the value of this is Ew for a given patch type then there's no need to inspect patches of this type at all, as none of them can be internal.Âdarcs Is the given ²o patch an internal implementation detail that shouldn't be visible in the UI or included in tags/matchers etc?µdarcs6If the patch might be a rebase container patch, then p and q must be the same type, as no transformation is applied. This function provides a witness to this requirement: if 'RebaseTypeOf rt' might be ,/, then it must be able to return a proof that p and q* are equal. If 'RebaseTypeOf rt' must be -=, then this function can never be called with a valid value.­®¯°±²Ž³µ¶·ž¹º»ŒœŸ¿ÀÁÂòŽ³¶º¹·žŒ»œŸ¿­ÁÂõ°±®¯ÀpNone',.=>?EHSUVXBš ÙdarcsÙ wA wBD represents the info of a patch, marked with the patch's witnesses.ÛdarcsÛ p wA wBu represents a hope we have to get a patch through its info. We're not sure we have the patch, but we know its info.ÝdarcsSimpleHopefully is a variant of  Either String adapted for type witnesses. Actually is the equivalent of Right , while  Unavailable is Left.àdarcsà p C (x y) is C String (p C (x y))* in a form adapted to darcs patches. The C (x y)F represents the type witness for the patch that should be there. The  HopefullyH type just tells whether we expect the patch to be hashed or not, and Ý" does the real work of emulating C.  Hopefully sh- represents an expected unhashed patch, and Hashed hash sh3 represents an expected hashed patch with its hash.çdarcsç i p1 creates a PatchInfoAnd containing p with info i.èdarcsn2pia' creates a PatchInfoAnd representing a Named patch.ìdarcsì hp tries to get a patch from a Ûš value. If it fails, it outputs an error "failed to read patch: <description of the patch>". We get the description of the patch from the info part of hpídarcsí 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.îdarcs hopefullyM is a version of  hopefully which calls fail! in a monad instead of erroring.ÙÚÛÜÝÞßàáâãäåæçèéêëìíîïðñòàáâÝÞßÛÜÙÚãçèéêëíìäæîðñïòåqNone',.1=>?EHSUVXVS 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. darcsÿThe 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. 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 ²X of patches that "follow" the PatchSet, and concatenates the patches into the PatchSet. darcsƒRuns a progress action for each tag and patch in a given PatchSet, using the passed progress message. Does not alter the PatchSet. darcs > returns the PatchInfos corresponding to the tags of a given  .                rNone',.=>?EHSUVXc± darcsžGiven the repository contents, get the rebase container patch, and its contents. The rebase patch can be anywhere in the repository and is returned without being commuted to the end. darcsÝGiven the repository contents, get the rebase container patch, its contents, and the rest of the repository contents. The rebase patch can be anywhere in the repository and is returned without being commuted to the end. darcsRemove the rebase patch from a  .darcs Remove the rebase patch from an ¯ of patches. darcs¯Given the repository contents, get the rebase container patch, its contents, and the rest of the repository contents. The rebase patch must be at the head of the repository.darcsSame as   but for an ¯ of patches. darcsSame as   but for an ² of patches.         sNone',.=>?EHSUVXh8 !darcs Evaluate an ² list and report progress. "darcs Evaluate an ¯ list and report progress. #darcs Evaluate an ¯w list and report progress. In addition to printing the number of patches we got, show the name of the last tag we got. ! " # " ! #tNone',.=>?EHSUVXhþ $ $uNone',.=>?EHSUVX„¢ &darcs°A 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. *darcsƒUsed for displaying during 'rebase changes'. 'Named (RebaseChange p)' is very similar to 'RebaseSelect p' but slight mismatches (: embeds an ²1) makes it not completely trivial to merge them. -darcs¶Encapsulate a single patch in the rebase state together with its fixups. Used during interactive selection to make sure that each item presented to the user corresponds to a patch. 0darcsGet hold of the Û patch inside a  -. 1darcs\Turn a list of items back from the format used for interactive selection into a normal list 2darcs®Turn a list of rebase items being rebased into a list suitable for use by interactive selection. Each actual patch being rebased is grouped together with any fixups needed. 4darcshSplit a list of rebase patches into those that will have conflicts if unsuspended and those that won't.darcspushThrough (ps :> (qs :> te)) tries to commute as much of ps as possible through both qs and te , giving %psStuck :> (qs' :> te') :> psCommuted,. Anything that can be commuted ends up in  psCommuted" and anything that can't goes in psStuck.darcsForcibly commute a _V with a patch, dropping any dependencies if necessary and recording them in the patch 6darcsÿTurn 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. 7darcsLike  65, but any fixups are "reified" into a separate patch. % & ' ( ) * + , - . / 0 1 2 3 4 5 6 7 - . / 2 1 6 7 4 0 & ' ( ) % 5 * + , 3vNone',.=>?@AEHMSUVX‡! _darcsApply a patch to set of ²s, yielding the new set of ²s and Œs ] ^ _ ] _ ^wNone',.=>?EHSUVX‡ç f fx2010 Petr RockaiMITdarcs-devel@darcs.net experimentalportableNone',.=>?@AEHSUVX‰ª g h i j k l m j k m l i g hyNone',.=>?EHSUVX­F darcs xs ys cs0' represents two sequences of patches that have cs in common, in other words  xs +<+ cs and  ys +<+ csdarcs cs xs ys/ represents two sequences of patches that have cs in common, in other words  cs +>+ xs and  cs +>+ ys wdarcs wt 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 xq 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 Nona objects, which include any necessary context to uniquely define the patch that is referred to.YThe 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  x or  y patch. ~darcs ~ p is True if p is either an  | or  y. darcs \ is used when converting from Darcs V1 patches (Mergers) to Darcs V2 patches (Conflictors).darcsmergeAfterConflicting3 takes as input a sequence of conflicting patches xxxG (which therefore have no effect) and a sequence of primitive patches yyyz that follow said sequence of conflicting patches, and may depend upon some of the conflicting patches (as a resolution).darcsIf xs consists only of  z patches,  xs returns Just pxs those patches (so lengthFL pxs == lengthFL xs). Otherwise, it returns E. €darcs<This is used for unit-testing and for internal sanity checksdarcs xs ys> returns the set of patches that can be commuted out of both xs and ys& along with the remnants of both listsdarcs xs ys@ returns the set of patches that can be commuted out of both xs and ys& along with the remnants of both lists w x y z { | } ~  € w x y z { | € ~ } zNone',.1=>?EHMSUVX®\ › œ  › œ {None',.1=>?EHMSUVX¯: ž ¹ º ž ¹ º|None',.=>?EHSUVX°}None',.=>?EHSUVX°®~None',.=>?EHSUVX±\ Ú ÚNone',.=>?EHSUVX² w w€None',.=>?EHSUVX²È¿¿ëNone',.=>?EHSUVX³~H!$G  7opÐÑÒÓÕâáäãßàæèéëêì&578ADCB@>?<=JOPMHSWYZ×Ø"#$:<=>?@ABC² ÚH$!Y:²WS=<?>@BC<=Dàæéëêèìß>AãäHMP7 GZ×ØOJ po875BCÒÐÓÕÑAáâ#$"?@& ځNone',.=>?EHSUVXìŠ ßdarcs$S(ealed) Patch and his dependencies. àdarcsSearchs dependencies in repoFL of the patches in  getDepsFL.darcstaggedIntersection takes two  s and splits them into a common intersection portion and two sets of patches. The intersection, however, is only lazily determined, so there is no guarantee that all intersecting patches will be included in the intersection  `. This is a pretty efficient function, because it makes use of the already-broken-up nature of  s.îNote that the first argument to taggedIntersection should be the repository that is more cheaply accessed (i.e. local), as taggedIntersection does its best to reduce the number of inventories that are accessed from its rightmost argument.darcs takes a tag's î, t0, and a   and attempts to find t0 in one of the  ®s in the PatchSet. If the tag is found, the PatchSet is split up, on that tag, such that all later patches are in the "since last tag" patch list. If the tag is not found, E is returned. âdarcssplitOnTag takes a tag's î, and a  Á, and attempts to find the tag in the PatchSet, returning a pair: the clean PatchSet "up to" the tag, and a RL of patches after the tag; If the tag is not in the PatchSet, we return Nothing.darcsh unfolds a single Tagged object in a PatchSet, adding the tag and patches to the PatchSet's patch list. ãdarcsgetUncovered ps returns the î for all the patches in ps« that are not depended on by anything else *through explicit dependencies*. Tags are a likely candidate, although we may also find some non-tag patches in this list.¹Keep in mind that in a typical repository with a lot of tags, only a small fraction of tags would be returned as they would be at least indirectly depended on by the topmost ones. ädarcsslightlyOptimizePatchset- only works on the surface inventory (see optimizePatchset‘) and only optimises at most one tag in there, going for the most recent tag which has no non-depended patch after it. Older tags won't be cleanF, which means the PatchSet will not be in 'clean :> unclean' state. ídarcsÝMerge two FLs (say L and R), starting in a common context. The result is a FL starting in the original end context of L, going to a new context that is the result of applying all patches from R on top of patches from L."While this function is similar to 98, there are some important differences to keep in mind:9€ does not correctly deal with duplicate patches whereas this one does (Question from Eric Kow: in what sense? Why not fix 9/?) (bf: I guess what was meant here is that  íS works in the the way it does because it considers patch meta data whereas 96 cannot since it must work for primitive patches, too.darcsÿ`Remove a patch from FL, using PatchInfo equality. The result is Just whenever the patch has been found and removed. If the patch is not present in the sequence at all or any commutation fails, we get Nothing. First two cases are optimisations for the common cases where the head of the list is the patch to remove, or the patch is not there at all.ÿVA note on the witness types: the patch to be removed is typed as if it had to be the first in the list, since it has the same pre-context as the list. The types fit together (internally, in this module) because we commute the patch to the front before removing it and commutation inside a sequence does not change the sequence's contexts. darcsSame as  only for ¯. ß à á â ã ä å æ ç è é ê ë ì í î ã î æ ê ç é å ä á â ì ë è í à ߂None',.=>?EHSUVX 2 !darcs«hashBundle creates a SHA1 string of a given a FL of named patches. This allows us to ensure that the patches in a received patchBundle have not been modified in transit."darcsÿIn makeBundle2, it is presumed that the two patch sequences are identical, but that they may be lazily generated. If two different patch sequences are passed, a bundle with a mismatched hash will be generated, which is not the end of the world, but isn't very useful either.#darcsfilterGpgDashes unescapes a clearsigned patch, which will have had any lines starting with dashes escaped with a leading "- ".$darcs˜unavailablePatches converts a list of PatchInfos into a RL of PatchInfoAnd Unavailable patches. This is used to represent the Context of a patchBundle.%darcsNpiUnavailable returns an Unavailable within a PatchInfoAnd given a PatchInfo.&darcsigetContext parses a context list, returning a tuple containing the list, and remaining ByteString input.'darcs`(-:-) is used to build up a Sealed FL of patches and tuple it, along with any unconsumed input.(darcs³getPatches attempts to parse a sequence of patches from a ByteString, returning the FL of as many patches-with-info as were successfully parsed, along with any unconsumed input.)darcsÄsillyLex takes a ByteString and breaks it upon the first newline, having removed any leading spaces. The before-newline part is unpacked to a String, and tupled up with the remaining ByteString. òdarcs ò1 scans the context in the file of the given name. ódarcsdMinimize the context of a bundle to be sent, taking into account the patches selected to be sent ôdarcspatchFilename maps a patch description string to a safe (lowercased, spaces removed and ascii-only characters) patch filename. ï ð ñ ò ó ô ï ð ñ ò ô óƒNone',.=>?EHSUVX  õ õ„None',.=>?@AEHSUVXHN*darcsA Matcher is made of a ++ which we will use to match patches and a String representing it.+darcsDA type for predicates over patches which do not care about contexts,darcs applyMatcher applies a matcher to a patch. <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, --hash and --index make haveNonrangeMatch true, but not  --from-patch or  --to-patch. >darcshaveNonrangeExplicitMatch flags is just like haveNonrangeMatch flagsB, but ignores "internal matchers" used to mask "internal patches" ?darcshavePatchsetMatch flagsR tells whether there is a "patchset match" in the flag list. A patchset match is --match or --patch, or  --context , but not  --from-patch nor (!) --index2. Question: Is it supposed not to be a subset of haveNonrangeMatch? Adarcs 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. CdarcssecondMatch 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ÂstrictJust is a strict version of the Just constructor, used to ensure that if we claim we've got a pattern match, that the pattern will actually match (rathern than fail to compile properly). EdarcsnonrangeMatcherb is the criterion that is used to match against patches in the interval. It is 'Just m' when the --patch, --match, --tag/ options are passed (or their plural variants). FdarcsnonrangeMatcherIsTag* returns true if the matching option was '--tag'.darcs firstMatcherz returns the left bound of the matched interval. This left bound is also specified when we use the singular versions of --patch, --match and --tag . Otherwise,  firstMatcher returns Nothing. GdarcsmatchAPatch fs p tells whether p$ matches the matchers in the flags fs/darcs hasLastn fs return the --last argument in fs , if any. JdarcsmatchFirstPatchset 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.0darcs dropn n ps drops the n last patches from ps. KdarcsmatchSecondPatchset fs ps returns the part of psG before its second matcher, ie the one that comes last dependencywise. Ldarcs„Split on the second matcher. Note that this picks up the first match starting from the earliest patch in a sequence, as opposed to  K? which picks up the first match starting from the latest patch1darcsfindAPatch m ps returns the last patch in ps matching m , and calls ó if there is none. MdarcsmatchAPatchset m ps returns a prefix of ps ending in a patch matching m , and calls ó if there is none. NdarcsgetMatchingTag m ps, where m is a * which matches tags returns a  7 containing all patches in the last tag which matches mo. 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. OdarcsmatchExists m ps* tells whether there is a patch matching m in ps Qdarcs applyNInv& n ps applies the inverse of the last n patches of ps.2darcs applyInvp› tries to get the patch that's in a 'PatchInfoAnd patch', and to apply its inverse. If we fail to fetch the patch then we share our sorrow with the user.3darcs a version of Ì for ¯ lists that cater for contexts.4darcsXkeyword (operator), argument name, help description, list of examples, matcher function LdarcsThe first element is the patches before and including the first patch matching the second matcher, the second element is the patches after it- % & ' ( , 3 0 ) - . 9 1 2 / 7 8 4 5 6 * + : ; < = > ? @ A B C D E F G H I J K L M N O P Q- ; < : J K L H G @ A C = > ? D P E % & ' O Q I N M B F ( , 3 0 ) - . 9 1 2 / 7 8 4 5 6 * +…None"#',.=>?EHSUVXOœ WdarcsUsed by: clone XdarcsUsed by: amend Ydarcs:Used by: rebase pull/apply, send, push, pull, apply, fetch [darcsUsed by: rebase unsuspend/reify \darcs7Used by: unrecord, obliterate, rebase suspend, rollback ]darcs Used by: diff ^darcs Used by: log5darcs TODO: see ‡í.6darcs TODO: see ‡í. Vdarcs#show files/contents, dist, annotate ( , 3 0 ) - . 9 1 2 / 7 8 4 5 6 * + V W X Y Z [ \ ] ^ _ ` a ( , 3 0 ) - . 9 1 2 / 7 8 4 5 6 * + V W X Y [ \ ] ^ a Z _ `†None"#',.=>?EHSUVXe qdarcs)TODO: reconsider this grouping of options µdarcs3Options for darcs iself that act like sub-commands. Àdarcs À/ instantiates the first two type parameters of Rd to what we need in darcs. The first parameter is instantiated to The flag type is instantiate to J. ÌdarcséTODO 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. ÔdarcsTODO: Returning -1™ if the argument cannot be parsed as an integer is not something I expected to find in a Haskell program. Instead, the flag should take either a plain ð5 argument (leaving it to a later stage to parse the ð to an < ), or else a > <9, taking the possibility of a failed parse into account. ×darcs --repodir9 is there for compatibility, should be removed eventuallyoIMHO the whole option can disappear; it overlaps with using an extra (non-option) argument, which is how e.g.  darcs get is usually invoked. ßdarcsconvert, clone, init ïdarcsTODO: see issue2395 darcs&push, apply, rebase apply: default to % darcspull, rebase pull: default to ' darcs:Deprecated flag, still present to output an error message.ÿDçéè      !"#$%&'(+)*,-./0123546789:;<=>?@ABCDEFGHIJKLMNOPRQSTUY[Z\]^_`abcdefgh ( , 3 0 ) - . 9 1 2 / 7 8 4 5 6 * + V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j o m l k n p q r t s u v w x y z { ~ | }   ‚ € ƒ „ … † ‡ ˆ ‰ Š ‹ Œ  Ž  ‘  ’ “ ” • – — ˜ ™ š › œ  ž Ÿ   ¢ ¡ £ ¥ € Š § š © ª « ¬ ­ ® ¯ ° ± ² ³ Ž µ · ž ¹ ¶ º » Œ œ Ÿ ¿ À Á Â Ã Ä Å Æ Ç È É Ê Ë Ì Í Î Ï Ð Ñ Ò Ó Ô Õ Ö × Ø Ù Ú Û Ü Ý Þ ß à á â ã ä å æ ç è é ê ë ì í î ï ð ñ ò ó ô õ ö ÷ ø ù ú û ü ý þ ÿ                           ! " # $ % & ' ( ) *ÿ& À œ Ÿ ¿ µ · ž ¹ ¶ Á ± ² ³ Ž  Ãefgh Ä Å Æ     È É ÇSTU Ê ® ¯ ° ËPRQ Ì Í Ï Î Ð Ñ ª « ¬ ­ Ò Ó Ô Õ Ö67 Ù Ø × § š © Û Ú £ ¥ € Š Ü Ý Þ ß354 à á ⠟   ¢ ¡ ã ä › œ  ž å – — ˜ ™ šJKLDEFGHI æ ç è é012,-./ABC ë ì í î ï ê ðçéè ñ “ ” • ò Ž  ‘  ’ ó ‹ Œ  ô>?@ õ89: ö „ … † ‡ ˆ ‰ Š ÷ ø ù ú ü ý þ ÿ    ‚ € ƒ  { ~ | } $%&'  !"# bcd  _`a Y[Z ) û x y z u v w \]^ q r t s MNO ;<=     (+)*         j o m l k n p   e f g h i ! " # $ % º » Œ & b c d ' ( *‡None',.=>?EHSUVXoì _darcsInstantiate a I with an ¬QRSWVUTXYZ[\]^_`HI À _ ÀHI _ˆNone',.=>?EHSUVX‘Ð adarcsfTries to perform some task if it can obtain the lock, Otherwise, just gives up without doing the task cdarcs cK 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. ddarcs dÿ$ 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).7darcsÿCreates a directory based on the path parameter; if a relative path is given the dir is created in the darcs temp dir. If an absolute path is given this dir will be created if it doesn't exist. If it is specified as a temporary dir, it is deleted after finishing the job. idarcs i is like  j:, except that it doesn't delete the directory afterwards. jdarcs j™ 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_TMPDIRp, 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_TMPDIRW variable is set temporary directory is not removed, this can be useful for debugging. |darcsÚDo 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. gz| ` a b c d e f g h i j k l m n o p q r s t u v w x y z { | ` a b c d e j i k m t u v q r s n o p w x y z lgz| f g h { |‰None',.=>?EHSUVXŒ4 8darcs-if pipe to ssh, can choose to compress or not9darcsotherwise, can specify printers:darcsgetSystemEncoding) fetches the current encoding from locale darcs5Get the name of the darcs executable (as supplied by getExecutablePath) …darcsnSend an email, optionally containing a patch bundle (more precisely, its description and the bundle itself);darcsÿlGiven two shell commands as arguments, execute the former. The latter is then executed if the former failed because the executable wasn't found (code 127), wasn't executable (code 126) or some other exception occurred (save from a resource vanished/broken pipe error). Other failures (such as the user holding ^C) do not cause the second command to be tried. Ž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. darcs•On 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 ðe. It also uses certain special variants of this encoding to determine how to handle encoding errors.See GHC.IO.Encoding for details.bIn 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.mSo we want to use this encoding variant for *all* IO and for (almost) all conversions between raw bytes and ðBs. 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.GNote that it isn't thread-safe and has a global effect on your program.<On Windows, this function does (and should) not do anything. ’darcsisUTF8K checks if an encoding is UTF-8 (or ascii, since it is a subset of UTF-8). ƒdarcshandle to write email todarcsFromdarcsTodarcsSubjectdarcsCCdarcsbody …darcsfromdarcstodarcssubjectdarcsccdarcs send commanddarcs(content,bundle)darcsbody } ~  €  ‚ ƒ „ … † ‡ ˆ ‰ Š ‹ Œ  Ž   ‘ ’ ‚ ƒ … † ‰ Š ‡ ˆ €  ‹ Œ „ } ~   Ž   ‘ ’ŠNone',.=>?EHSUVXĔ “darcs “ 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 on standard output. –darcs – runs '$PAGER' and shows a patch in it. —darcs —@ prints a patch, together with its context, on standard output. “ ” • – — • — – “ ”‹22008 Dmitry Kurochkin <dmitry.kurochkin@gmail.com>GPLdarcs-devel@darcs.net experimentalportableNone',.=>?EHSUVXÈ;>darcs>J will inspect the current waiting-to-start queue, if the pipe isn't full,mnop€‚ ˜ ™ š › œ  ž Ÿ š ™  œ ˜ ›€‚ ž ŸmnopŒNone',.=>?EHSUVXÕê ¥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 €‚   ¡ ¢ £ € ¥ Š § š ¡ ¢ ¥ Š § š  €‚ £ €None',.=>?EHSUVXÝR?darcs0This makes darcs-1 (non-hashed repos) filenames.$The name consists of three segments:˜timestamp (ISO8601-compatible yyyymmmddHHMMSS; note that the old-fashioned (non-hashed) format expects this date to be exactly as in the patch, ignoring, any timezone info, which is why we use Ì here)SHA1 hash of the authorHSHA1 hash of the patch name, author, date, log, and "inverted" flag. © ª © ªŽNone',.=>?EHSUVXû «darcsžRepresentation of the format of a repository. Each sublist corresponds to a line in the format file. Currently all lines are expected to be singleton words.@darcsHDefine string constants in one place, for reuse in show/parse functions.AdarcsHDefine string constants in one place, for reuse in show/parse functions.BdarcsHDefine string constants in one place, for reuse in show/parse functions. Ž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. ·darcsIdentify the format of the repository at the given location (directory, URL, or SSH path). Fails if we weren't able to identify the format. ždarcsdIdentify the format of the repository at the given location (directory, URL, or SSH path). Return H 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. ºdarcsŠCreate a repo format. The first argument is whether to use the old (darcs-1) format; the second says whether the repo has a working tree. »darcs » source returns F: an error message if we cannot write to a repo in format source, or E if there's no such problem. Œdarcs Œ source target returns FG an error message if we cannot transfer patches from a repo in format source to a repo in format target, or E if there are no such problem. œdarcs œ source returns F; an error message if we cannot read from a repo in format source, or E if there's no such problem.CdarcsC{ applies a function that maps format-entries to an optional error message, to each repoformat entry. Returning any errors.Ddarcs<Does this version of darcs know how to handle this property? « ¬ ­ ° ¯ ² ± ® ³ Ž µ ¶ · ž ¹ º » Œ œ « ¬ ­ ° ¯ ² ± ® ³ · ž º ¹ » œ Œ Ž µ ¶None',.=>?EHSUVX Ec ÁdarcsCCache is an abstract type for hiding the underlying cache locations ÕdarcsiunionRemoteCaches 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 repositoty 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}Compares two caches, a remote cache is greater than a local one. The order of the comparison is given by: local < http < ssh Ø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. Þdarcs(hashedFilePath cachelocation subdir hash( returns the physical filename of hash hash in the subdir section of  cachelocation.Edarcs0hashedFilePathReadOnly cachelocation subdir hash( returns the physical filename of hash hash in the subdir section of  cachelocationF. If directory, assume it is non-bucketed cache (old cache location). ßdarcspeekInCache cache subdir hash tells whether cache# and contains an object with hash hashS 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 namev is likely to be useful soon: pipelined downloads will add it to the (low-priority) queue, for the rest it is a noop. ádarcsŒNote 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.FdarcsWe hace a list of locations (cachez) ordered from "closest/fastest" (typically, the destination repo) to "farthest/slowest" (typically, the source repo). copyFileUsingCache! first checks whether given file fº is present in some writeable location, if yes, do nothing. If no, it copies it to the last writeable location, which would be the global cache by default, or the destination repo if  `--no-cache`à is passed. Function does nothing if there is no writeable location at all. If the copy should occur between two locations of the same filesystem, a hard link is actually made. TODO document oos&: what happens when we only speculate?GdarcsÿlChecks if a given cache entry is reachable or not. It receives an error caught during execution and the cache entry. If the caches is not reachable it is blacklisted and not longer tried for the rest of the session. If it is reachable it is whitelisted and future errors with such cache get ignore. To determine reachability: * For a local cache, if the given source doesn't exist anymore, it is blacklisted. * For remote sources if the error is timeout, it is blacklisted, if not, it checks if _darcs/hashed_inventory exist, if it does, the entry is whitelisted, if it doesn't, it is blacklisted.HdarcsIReturns a list of reachables cache entries, removing blacklisted entries.Idarcs<Checks if the _darcs/hashed_inventory exist and is reachableJdarcseGet contents of some hashed file taking advantage of the cache system. We hace a list of locations (cacheÿ4) ordered from "closest/fastest" (typically, the destination repo) to "farthest/slowest" (typically, the source repo). First, if possible it copies the file from remote location to local. Then, it reads it contents, and links the file across all writeable locations including the destination repository.Kdarcs"write compression filename content writes content to the file filename" according to the policy given by  compression. â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.% Á Â Ã Ä Å Æ Ç È Ê É Ë Ì Í Î Ï Ð Ñ Ò Ó Ô Õ Ö × Ø Ù Ú Û Ü Ý Þ ß à á â ã ä å% Ø Ù Á Â È Ê É Ã Ä Å Æ Ç Ë Ì Í Î Ï Ð Ñ Ò Ý Ô Õ ã ä Ú à á â ß × Û Ü Þ Ó Ö åNone',.=>?EHSUVX ]^ ô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.Ldarcs¢tryMakeBoringRegexp attempts to create a Regex from a given String. The evaluation is forced, to ensure any malformed exceptions are thrown here, and not later. ùdarcsÔboringRegexps 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.Mdarcs%The lines that will be inserted into _darcsprefsbinaries when  darcs initX is run. Hence, a list of comments, blank lines and regular expressions (ERE dialect).hNote that while this matches .gz and .GZ, it will not match .gZ, i.e. it is not truly case insensitive. darcs(addRepoSource adds a new entry to _darcsprefs)repos and sets it as default in _darcsprefspdefaultrepo, unless --no-set-default or --dry-run is passed, or it is the same repository as the current one. darcsˆdelete 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, ï ñ ð ò ó ô õ ö ÷ ø ù ú û ü ý þ ÿ          ü  ý þ ÷ ö      ÿ ò ù ú ó ï ñ ð û  ø õ ô  ‘None',.=>?EHSUVX •Ü darcs(Non-trivial interaction between options. darcsDThis 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. darcsdUgly. The alternative is to put the remoteRepos accessor into the IO monad, which is hardly better. darcs q takes a String that may be a file path or a URL. It returns either the URL, or an absolute version of the path. darcs2maybeFixSubPaths (repo_path, orig_path) file_paths tries to turn  file_paths into ­_s, taking into account the repository path and the original path from which darcs was invoked.A ­ is a path under& (or inside) the repo path. This does notz mean it must exist as a file or directory, nor that the path has been added to the repository; it merely means that it could be added.ÿWhen converting a relative path to an absolute one, this function first tries to interpret the relative path with respect to the current working directory. If that fails, it tries to interpret it with respect to the repository directory. Only when that fails does it put a NothingE in the result at the position of the path that cannot be converted.?It is intended for validating file arguments to darcs commands. !darcs ! is a variant of  € that throws out non-repository paths and duplicates from the result. See there for details. TODO: why filter out null paths from the input? why here and not in  ? "darcs "K takes a list of flags and returns the url of the repository specified by Repodir "directory"P in that list of flags, if any. This flag is present if darcs was invoked with --repodir=DIRECTORY %darcs %J 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 []t if it could not get it. Note that it may only return multiple possibilities when reading from global preferences *darcs *G takes a list of flags and returns the sendmail command to be used by  darcs send$. Looks for a command specified by SendmailCmd "command"P 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 option ,darcs ,J 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"P in that list of flags, if any. This flag is present if darcs was invoked with --subject=SUBJECT -darcs -c 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"K in that list of flags. Returns the addresses as a comma separated string.Tíð ¡£Ÿ ` Ä Ê Ë Ì Ò Ó Ô Õ Ù ß â ê í î ï ñ ò ô õ ö û ü ý ÿ          & ( )                   ! " # $ % & ' ( ) * + , - . / 0Tíð ¡£Ÿ              / 0      ! " % & ' * # $ , . - ) + (  ñ ) û ý  Ô ` ò í î Ó  ï  Ä Ê ê  Ì õ ô  ß ö Ù  Õ Ë Ò â ÿ  ü (  &’None',.=>?EHSUVX N 1darcsÁA convenience function to call from all darcs command functions before applying any patches. It checks for malicious paths in patches, and prints an error message and fails if it finds one. 2darcs9Filter out patches that contains some malicious file path 1 2 3 1 2 3“2009 Petr RockaiMITdarcs-devel@darcs.net experimentalportableNone',.=>?EHSUVX Ÿ  4 4”None',.=>?EHSUVX €U 6darcsexternal merge tool commanddarcstell whether we want GUI pauseNdarcsexternal merge tool commanddarcstell whether we want GUI pausedarcspath to merge basedarcspath to side 1 of the mergedarcspath to side 2 of the mergedarcs%path where resolved content should go 5 6 7 5 6 7•None',.=>?@AEHMSUVX šA 9darcs;Apply patches, emitting warnings if there are any IO errors :darcs"Apply patches, ignoring all errors ;darcsPThe default mode of applying patches: fail if the directory is not as we expect f 8 9 : ; f 9 : 8 ;–None',.=>?EHSUVX «Ð bdarcs:Replace the pristine hash at the start of a raw, unparsed  U or add it if none is present. ddarcsDskipPristineHash drops the 'pristine: HASH' prefix line, if present. P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h Q R S T U P Y Z [ X W V \ ^ _ ` a ] b c d e f g h—None',.=>?EHSUVX ¶) tdarcsA  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 directory now), and the tentative state, which represents work in progress that will eventually become the new recorded state unless something goes wrong. ~darcs ~ repository function modifies the cache of  repository with function., remove duplicates and sort the results with  Ö. t u v w x y z { | } ~  €  ‚ ƒ t u v w x } ~  { y z | €  ‚ ƒ˜GPL-2None$',.=>?EHSUVX ,,Odarcsthe patch-indexPdarcsÉall the PatchIds tracked by this patch index, with the most recent patch at the head of the list (note, stored in the reverse order to this on disk for backwards compatibility with an older format).Qdarcs information file with a given IDRdarcsGtimespans where a file with a certain id corresponds to given filenamesSdarcsHtimespans where a certain filename corresponds to a file with a given idTdarcs9info about a given fileid, e.g.. is a file or a directoryUdarcs…On-disk version of patch index version 1 is the one introduced in darcs 2.10 2 changes the pids order to newer-to-olderVdarcs\'applyPatchMods pmods pindex' applies a list of PatchMods to the given patch index pindexWdarcs$create new filespan for created fileXdarcs?start new span for name fn for file fid starting with patch pidYdarcs"stop current span for file name fnZdarcs?start new span for name fn for file fid starting with patch pid[darcs"stop current span for file name fn\darcs)insert touching patchid for given file id]darcs)insert touching patchid for given file id^darcslookup current fid of filepath_darcsClookup current fid of filepatch, returning a Maybe to allow failure`darcs'lookup all the file ids of a given pathadarcs>return all fids of matching subpaths of the given filepathbdarcs§returns a single file id if the given path is a file if it is a directory, if returns all the file ids of all paths inside it, at any point in repository historycdarcs<Creates patch index that corresponds to all patches in repo.ddarcsconvert patches to patchmodsedarcs.return set of current filenames in patch indexfdarcsžremove all patch effects of given patches from patch index. assumes that the given list of patches is a suffix of the patches tracked by the patch-indexgdarcs=update the patch index to the current state of the repositoryhdarcsT'createPatchIndexFrom repo pmods' creates a patch index from the given patchmods.idarcs5Load patch-index from disk along with some meta data.jdarcsZIf patch-index is useful as it is now, read it. If not, create or update it, then read it. ˆdarcsWRead-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 Darcs ‰darcsRead-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 scratch ‹darcs+Read-only. Checks the two following things:  ˆ ‰CThen only if it exists and it is not explicitely disabled, returns True, else returns FalseJ (or an error if it exists and is explicitely disabled at the same time). Œdarcs’Creates patch-index (ignoring whether it is explicitely disabled). If it is ctrl-c'ed, then aborts, delete patch-index and mark it as disabled. darcsQChecks 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.kdarcsStores patch-index on disk. ŽdarcsDeletes patch-index (_darcs/patch_index/< and its contents) and mark repository as disabled (creates _darcs/no_patch_index).ldarcs.return set of current filepaths in patch indexmdarcs@return set of current filepaths in patch index, for internal use darcsAChecks if patch index can be created and build it with interrupt.ndarcsÈChecks whether a patch index can (and should) be created. If we are not in an old-fashioned repo, and if we haven't been told not to, then we should create a patch index if it doesn't already exist. darcsDReturns 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). ‘darcs\If 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). ’darcs^Dump information in patch index. Patch-index should be checked to exist beforehand. Read-only. “darcs€Read-only sanity check on patch-index. Patch-index should be checked to exist beforehand. It may not be in sync with repository.jdarcsFPatchSet of the repository, used if we need to create the patch-index. 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 patches. ‘darcsThe repositorydarcsKPatchSet of patches of repository (in case patch-index needs to be created)darcs.PatchFilter ready to be used by SelectChanges. ‡ ˆ ‰ Š ‹ Œ  Ž   ‘ ’ “ ˆ ‰  ‹ Œ Š Ž  ‡ ‘  ’ “™None',.=>?@AEHSUVX öodarcsreadHashFile c subdir hash reads the file with hash hash" in dir subdir, fetching it from  Á c if needed.pdarcsgeta objtype name stuff tries to get an object of type objtype named name in stuff. darcsZGrab a whole pristine tree from a hash, and, if asked, write files in the working copy. ždarcsgReturns 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. ¡darcs_getHashedFiles returns all hash files targeted by files in hashroots in the hashdir directory.  ž Ÿ   ¡  Ÿ   ¡ žšNone',.=>?EHSUVX Qi ŠdarcsŠRead the contents of pending. The return type is currently incorrect as it refers to the tentative state rather than the recorded state.qdarcs'Read the contents of tentative pending.rdarcs'Read the contents of tentative pending.sdarcsURead the pending file with the given suffix. CWD should be the repository directory.tdarcs(Write the contents of tentative pending.udarcsJWrite the contents of new pending. CWD should be the repository directory. §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 backÿ The 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 itvdarcsv. can be seen as a first pass approximation of  §« that works without having to do any commutation. It either returns a sifted pending (if the input is simple enough for this crude approach) or has no effect. šdarcstentativelyRemoveFromPending p± 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.8Question (Eric Kow): how do we detect patch equivalence?wdarcsÕA sequence of primitive patches (candidates for the pending patch) is considered simple if we can reason about their continued status as pending patches solely on the basis of them being hunk/binary patches.éSimple here seems to mean that all patches are either hunk/binary patches, or patches that cannot (indirectly) depend on hunk/binary patches. For now, the only other kinds of patches in this category are changepref patches.ÿ—It might be tempting to add, say, adddir patches but it's probably not a good idea because Darcs also inverts patches a lot in its reasoning so an innocent addir may be inverted to a rmdir which in turn may depend on a rmfile, which in turn depends on a hunk/binary. Likewise, we would not want to add move patches to this category for similar reasons of a potential dependency chain forming. ©darcs+makeNewPending repo YesUpdateWorking pendPs verifies that the pendPsh could be applied to pristine if we wanted to, and if so writes it to disk. If it can't be applied, pendPsA must be somehow buggy, so we save it for forensics and crash. ªdarcs<Replace the pending patch with the tentative pending. If NoUpdateWorkingQ, this merely deletes the tentative pending without replacing the current one.LQuestion (Eric Kow): shouldn't this also delete the tentative pending if YesUpdateWorking;? I'm just puzzled by the seeming inconsistency of the NoUpdateWorking doing deletion, but YesUpdateWorking not bothering. «darcs>tentativelyAddToPending repo NoDryRun YesUpdateWorking pend ps appends ps to the pending patch.It has no effect with NoUpdateWorking.œThis fuction is unsafe because it accepts a patch that works on the tentative pending and we don't currently track the state of the tentative pending. ¬darcssetTentativePending is basically unsafe. It overwrites the pending state with a new one, not related to the repository state. ­darcs prepend repo YesUpdateWorking ps prepends ps9 to the pending patch It's used right before removing psj from the repo. This ensures that the pending patch can still be applied on top of the recorded state.{This function is basically unsafe. It overwrites the pending state with a new one, not related to the repository state. ©darcsDrecorded state of the repository, to check if pending can be applied ¥ Š § š © ª « ¬ ­ Š § š ª © « ¬ ­ ¥›None',.=>?EHSUVX ŽÀ ³darcsÿFrom a repository and a list of SubPath'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.xdarcsLike  ³8 but with the pending patch passed as a parameter. The  tE parameter is not used, we need it only to avoid abiguous typing of p.ydarcsAIs the given path in (or equal to) the _darcs metadata directory? µdarcs Construct a  °L 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. ¶darcs]Construct a Tree filter that removes any darcs metadata files the Tree might have contained. ·darcs5For a repository and an optional list of paths (when Eÿ, 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 copy + 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.g-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.ÿE-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.zdarcs7filteredWorking useidx scan relevant index pending_treeA reads the working tree and filters it according to options and relevant file paths. The  pending_tree is understood to have relevant( already applied and is used (only) if  useidx == 2 and scan == ,G to act as a guide for filtering the working tree. Note that even if useidx  2W, the index is still used to avoid filtering boring files that darcs knows about (see  µ).{darcs‰Witnesses the fact that in the absence of a working directory, we pretend that the working dir updates magically to the tentative state. ¹darcsÑObtains 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. ºdarcsÒObtains 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  ºI that takes the UseIndex and ScanKnown options into account, similar to  žG. We are only interested in the resulting tree, not the patch, so the ç option is irrelevant. ŒdarcsoObtains a Tree corresponding to the complete working copy of the repository (modified and non-modified files). œdarcsObtains the recorded  with the pending patch applied. ŸdarcsObtains the recorded ÿ with the pending patch applied, plus the pending patch itself. The pending patch should start at the recorded state (we even verify that it applies, and degrade to renaming pending and starting afresh if it doesn't), but we've set to say it starts at the tentative state.UQuestion (Eric Kow) Is this a bug? Darcs.Repository.Pending.readPending says it is ¿darcsÿTMark the existing index as invalid. This has to be called whenever the listing of pristine changes and will cause darcs to update the index next time it tries to read it. (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.) ÂdarcssRemove any patches (+dependencies) from a sequence that conflict with the recorded or unrecorded changes in a repo|darcs_Automatically detect file moves using the index. TODO: This function lies about the witnesses.}darcsÄSearch for possible replaces between the recordedAndPending state and the unrecorded (or working) state. Return a Sealed FL list of replace patches to be applied to the recordedAndPending state. ÃdarcsAdd 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. ÂdarcsWRecorded patches from repository, starting from same context as the patches to filterdarcs9Repository itself, used for grabbing unrecorded changesdarcsPatches to filterdarcs>True iff any patches were removed, possibly filtered patches}darcs0pending tree (including possibly detected moves)darcs working tree,-./012 ° ± ² ³ Ž µ ¶ · ž ¹ º » Œ œ Ÿ ¿ À Á  à Ä ³ µ ° ± ² ¶ Ž · Ÿ ¹ º œ Œ ž » À Á ¿012,-./  à ĜNone',.=>?EHSUVX žï~darcsnSets scripts in or below the current directory executable. A script is any file that starts with the bytes #!/. This is used for --set-scripts-executable. Å Æ Ç Å Æ ÇGPL-2None',.=>?EHSUVX È{ Èdarcs:The status of a given directory: is it a darcs repository? Édarcs'looks like a repository with some error Êdarcs safest guess Ìdarcs5Tries to identify the repository in a given directory Ídarcs*identifyRepository identifies the repo at urlI. Warning: you have to know what kind of patches are found in that repo. ÎdarcsidentifyRepositoryFor repo url& identifies (and returns) the repo at urlE, but fails if it is not compatible for reading from and writing to. Ñdarcsÿ|hunt 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 succeeds ÔdarcsfindAllReposInDir topDir) returns all paths to repositories under topDir. È É Ê Ë Ì Í Î Ï Ð Ñ Ò Ó Ô Ì Í Î È É Ê Ë Ó Ï Ò Ð Ñ ÔžNone',.=>?EHSUVX >‰)darcsAThe way patchfiles, inventories, and pristine trees are stored. €, means all files are in the same directory.  means we create a second level of subdirectories, such that all files whose hash starts with the same two letters are in the same directory.‚darcs‚ 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—revertTentativeChanges swaps the tentative and "real" hashed inventory files, and then updates the tentative pristine with the "real" inventory hash. âdarcsÿ—finalizeTentativeChanges 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. ãdarcs|readHashedPristineRoot attempts to read the pristine hash from the current inventory, returning Nothing if it cannot do so. ädarcsQcleanPristine removes any obsolete (unreferenced) entries in the pristine cache. ådarcs8filterDirContents returns the contents of the directory d& except files whose names begin with çZ (directories . and .., hidden files) and files whose names are filtered by the function f, if dir! is empty, no paths are returned. ædarcs+Set difference between two lists of hashes. çdarcsYcleanInventories removes any obsolete (unreferenced) files in the inventories directory.ƒdarcsRspecialPatches list of special patch files that may exist in the directory _darcspatches. èdarcsQcleanPatches removes any obsolete (unreferenced) files in the patches directory.„darcsˆaddToSpecificInventory adds a patch to a specific inventory file, and returns the FilePath whichs corresponds to the written-out patch. édarcsHWarning: this allows to add any arbitrary patch! Used by convert import.…darcs‰Attempt to remove an FL of patches from the tentative inventory. This is used for commands that wish to modify already-recorded patches.=Precondition: it must be possible to remove the patches, i.e.!the patches are in the repository'any necessary commutations will succeed†darcsxwriteHashFile takes a Doc and writes it as a hash-named file, returning the filename that the contents were written to. êdarcs-readRepo returns the "current" repo patchset. ëdarcs-readRepo returns the tentative repo patchset.‡darcs5readRepoUsingSpecificInventory uses the inventory at invPath to read the repository repo.ˆdarcsRead a  i from the repository (assumed to be located at the current working directory) by following the chain of  Q%s, starting with the given one. The  Á| parameter is used to locate patches and parent inventories, since not all of them need be present inside the current repo.‰darcseRead an inventory from a file. Fails with an error message if file is not there or cannot be parsed. ìdarcs(copyRepo copies the hashed inventory of repo to the repository located at remote. ídarcswwriteAndReadPatch 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. ïdarcsÖwriteHashIfNecessary 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.Šdarcsÿ°listInventoriesWith returns a list of the inventories hashes. The first argument is to choose directory format. The first argument can be readInventoryPrivate or readInventoryLocalPrivate. The second argument specifies whether the files are expected to be stored in plain or in bucketed format. The third argument is the directory of the parent inventory files. The fourth argument is the directory of the head inventory file. ðdarcsvlistInventories returns a list of the inventories hashes. This function attempts to retrieve missing inventory files.‹darcsŽRead the given inventory file if it exist, otherwise return an empty inventory. Used when we expect that some inventory files may be missing. ñdarcsReturn inventories hashes by following the head inventory. This function does not attempt to retrieve missing inventory files. òdarcsOlistInventoriesRepoDir returns 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.ŒdarcsŸReturn a list of the patch filenames, extracted from inventory files, by starting with the head inventory and then following the chain of parent inventories.CThis function does not attempt to download missing inventory files.kThe first argument specifies whether the files are expected to be stored in plain or in bucketed format.=The second argument is the directory of the parent inventory.:The third argument is the directory of the head inventory. ódarcsdlistPatchesLocalBucketed is similar to listPatchesLocal, but it read the inventory directory under darcsDir in bucketed format. ôdarcsžcopyPristine copies a pristine tree into the current pristine dir, and possibly copies a clean working copy. The target is read from the passed-in dir/inventory name combination. õdarcsPcopyPartialsPristine copies the pristine entries for a given list of filepaths. údarcs)applyToTentativePristine applies a patch pI to the tentative pristine tree, and updates the tentative pristine hash þdarcsÿGiven a sequence of patches anchored at the end of the current repository, actually pull them to the end of the repository by removing any patches with the same name and then adding the passed in sequence. Typically callers will have obtained the passed in sequence using  findCommon and friends. darcsçSlightly 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. So the type should rather be 4... -> Repo rt p wR wU wT -> IO (Repo rt p wR wU wR) darcs‹grab the pristine hash of _darcs/hash_inventory, and retrieve whole pristine tree, possibly writing a clean working copy in the process. darcs"Used by the commands dist and diff darcsWrites 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.darcs8Returns the patches that make the most recent tag dirty. darcsÿ&XOR 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/ .6 b c Õ Ö × Ø Ù Ú Û Ü Ý Þ ß à á â ã ä å æ ç è é ê ë ì í î ï ð ñ ò ó ô õ ö ÷ ø ù ú û ü ý þ ÿ        6 Û Ü Ý Þ ß à Ù Ú á â ä å ç è ô õ ú û é  ê ë í î ì ã b c ð ñ ò ó ï æ   ÷ ü ý ù ø þ ÿ ö     Õ Ö × Ø ŸNone',.=>?EHSUVX @ç   None',.=>?EHSUVX Aµ              ¡None',.=>?EHSUVX G© darcsÿ;Some common flags that are needed to run rebase jobs. Normally flags are captured directly by the implementation of the specific job's function, but the rebase infrastructure needs to do work on the repository directly that sometimes needs these options, so they have to be passed as part of the job definition.                  ¢GPL-2None',.=>?EHSUVX KoŽdarcs Similar to j (  Ú)H, exepts it stops execution if file it's going to fetch already exists. !darcsACreate packs from the current recorded version of the repository.   !   !£None',.=>?EHSUVX L= " # $ " # $€None',.=>?EHSUVX M & ' & '¥None',.=>?EHSUVX ndarcsWThis type allows us to check multiple patch types against the constraints required by  .‘darcskThis type allows us to check multiple patch types against the constraints required by most repository jobs’darcsaThis is just an internal type to Darcs.Repository.Job for calling runJob in a strongly-typed way *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. RepoJobO is used to wrap up the polymorphism, and the various functions that act on a RepoJobZ are responsible for instantiating the underlying action with the appropriate patch type. +darcsThe most common RepoJobS; the underlying action can accept any patch type that a darcs repository may use. ,darcs(A job that only works on darcs 1 patches -darcs(A job that only works on darcs 2 patches .darcs8A job that works on any repository where the patch type p has Y p = j.TThis was added to support darcsden, which inspects the internals of V1 prim patches.QIn future this should be replaced with a more abstract inspection API as part of  PrimPatch. 3darcsFapply a given RepoJob to a repository in the current working directory 4darcs4apply a given RepoJob to a repository in a given url 5darcsXapply a given RepoJob to a repository in the current working directory, taking a lock 6darcs]run a lock-taking job in an old-fashion repository. only used by `darcs optimize upgrade`. 7darcsÿTApply 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. 8darcsIf the $* of the given repo indicates that we have -, then F& the repo with the refined type, else ET. NB The amount of types we have to import to make this simple check is ridiculous! ( ) * + , - . / 0 1 2 3 4 5 6 7 8 * + , - . / 0 1 ( ) 5 6 7 3 4 8 2ŠNone"#$',.=>?EHSUVX }ä “darcs working tree”darcsrecorded and pending•darcsunrecorded paths ;darcs’Return all files available under the original working directory regardless of their repo state. Subdirectories get a separator (slash) appended. <darcs Return all files available under the original working directory that are unknown to darcs but could be added. Subdirectories get a separator (slash) appended. =darcsšReturn all files available under the original working directory that are known to darcs (either recorded or pending). Subdirectories get a separator (slash) appended. >darcsŠReturn 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.–darcsdTurn an action that creates all possible completions into one that removes already given arguments. ; < = > ? @ ; = < > @ ?§None',.=>?EHSUVX ~ A B C D E F C D E A B FšNone',.=>?EHSUVX …€—darcs)This keeps only NonWritable Repo entries.˜darcsuThis function fetches all patches that the given repository has with fetchFileUsingCache, unless --lazy is passed. HdarcsrwritePatchSet is like patchSetToRepository, except that it doesn't touch the working directory or pristine cache. IdarcsJReplace the existing pristine with a new one (loaded up in a Tree object). G H I G I HîNone',.=>?EHSUVX †F\Û Á Â Ã Ä Å Æ Ç Ë Ì Í Î Ï Ð Ñ å t u v w x y { | } ~  « · ¹ º œ Ÿ ¿ À Â Ã Ä Å Æ Ç Ì Î Ï Ð Ò Ó ë ö ÷ ü ÿ             " # * + , - . / 0 1 2 3 4 5 7 A B C D E G H I\ t y { | } u v w x Î Ï Ð Ñ Á Â Ã Ä Å Æ Ç Ë Ì Í * + , - . / 0 1 Ì Î  5 7 3 4 2 H Ó Ï Ò Ð I   Ä Ã ÷ ü « ë       " # ÿ C D E A B G ö Å     Û Æ Ç ~ å ¹ º ·  Ÿ œ À ¿©None',.=>?EHSUVX ɐ0 Jdarcs¬The 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 together Odarcs<The dynamic parameters for interactive selection of patches. Qdarcstotal number of patches Rdarcsnumber of already-seen patches Sdarcsthe patches we offer Tdarcsthe user's choices UdarcsA PatchSelectionContext> contains all the static settings for selecting patches. See PatchSelectionM™darcs7The type of the function we use to filter patches when --match is given. _darcsâWhen asking about patches, we either ask about them in oldest-first or newest first (with respect to the current ordering of the repository), and we either want an initial segment or a final segment of the poset of patches. bW: ask for an initial segment, first patches first (default for all pull-like commands) c‚: ask for an initial segment, last patches first (used to ask about dependencies in record, and for pull-like commands with the  --reverse flag). a‰: ask for a final segment, last patches first. (default for unpull-like commands, except for selecting *primitive* patches in rollback) `‹: ask for a final segment, first patches first. (used for selecting primitive patches in rollback, and for unpull-like commands with the  --reverse flag«IOW: First = initial segment Last = final segment Reversed = start with the newest patch instead of oldest As usual, terminology is not, ahem, very intuitive.šdarcsA  _ is š` if the segment of patches we ask for is at the opposite end of where we start to present them.›darcsA  _\ is reversed if the order in which patches are presented is latest (or newest) patch first. ddarcsA  U for selecting Prim patches. edarcsA  U for selecting full patches (Û patches) fdarcs A generic  U.œdarcsFor commands without --match, œ matches all patchesdarcs3 selects patches according to the given match flags gdarcsRun a PatchSelection action in the given  U. hdarcsThe equivalent of  g for the  darcs log command idarcs3Generates the help for a set of basic and advanced  J groups. jdarcsThe keys used by a list of keyPress groups. kdarcsKThe function for selecting a patch to amend record. Read at your own risks.ždarcsÓThis ensures that the selected patch commutes freely with the skipped patches, including pending and also that the skipped sequences has an ending context that matches the recorded state, z, of the repository.Ÿdarcs"Runs a function on the underlying  PatchChoices object darcs justDone n notes that n! patches have just been processed¡darcs)The actual interactive selection process. ldarcs Returns a Sealed24 version of the patch we are asking the user about.¢darcs6Returns the patches we have yet to ask the user about.£darcsModify the underlying  PatchChoices by some function mdarcsreturns Just f if the  l only modifies f, Nothing otherwise. ndarcs decide True selects the current patch, and  decide False deselects it. odarcslike  n, but for all patches touching file€darcsUndecide the current patch. pdarcsFocus the next patch. qdarcsFocus the previous patch.¥darcsTSplit the current patch (presumably a hunk), and add the replace it with its parts.ŠdarcsPShows the patch that is actually being selected the way the user should see it.§darcszReturns a list of the currently selected patches, in their original context, i.e., not commuted past unselected patches.šdarcs-Prints the list of the selected patches. See §.©darcsSkips all remaining patches.ªdarcs0The singular form of the noun for items of type p.«darcs.The plural form of the noun for items of type p. udarcs$The question to ask about one patch. vdarcs4Asks the user about one patch, returns their answer.¬darcs,Ask the user what to do with the next patch. wdarcs9Shows the current patch as it should be seen by the user.­darcsThe interactive part of  darcs changes xdarcs.Skips patches we should not ask the user about®darcsIThe action bound to space, depending on the current status of the patch.0 J K L M N O P Q R S T U V W X ] Y ^ \ [ Z _ ` b a c d e f g h i j k l m n o p q r s t u v w x y0 _ ` b a c h k g d f e U V r W X ] Y ^ \ [ Z N O P Q R S T l x p q s w n o t m v u J K L M j i yªNone',.=>?EHSUVX ë+ |darcsYspecify whether to ask about dependencies with respect to a particular repository, or not darcsZTransformer for interactions with a hijack warning state that we need to thread through €darcshOptions for how to deal with the situation where we are somehow modifying a patch that is not our own darcsaccept all hijack requests ‚darcs0prompt once, accepting subsequent hijacks if yes ƒdarcs always prompt „darcs3Get 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 editorFIt 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 values †darcsgUpdate 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 way ‡darcs getAuthorX tries to return the updated author for the patch. There are two different scenarios:Z[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 recorddarcshpatch name, long description and possibly the path to the temporary file that should be removed later †darcsverb: command name ‡darcsverb: command namedarcsselect: prompt for new auhordarcsnew author: explict new authordarcspatch to update | } ~  €  ‚ ƒ „ … † ‡ „ ‡ † | } ~  €  ‚ ƒ …«None',.=>?EHSUVX ûa Šdarcs Š action flags patchesE prints a string representing the action that would be taken if the  --dry-runG 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. ‹darcsÿaGiven a repository and two common command options, classify the given list of subpaths 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. Ždarcs"For each directory in the list of ­Ms, add all paths under that directory to the list. If the first argument is G", then include even boring files.MThis is used by the add and remove commands to handle the --recursive option. ˆ ‰ Š ‹ Œ  Ž   ‘ ˆ ‹ ‰ Š Œ  Ž   ‘¬None',.=>?EHSUVX Ç –darcsA  –1 represents a command like add, record etc. The  parsedFlagsM type represents the options that are passed to the command's implementation ­darcsA  ­ is a  –' where the options type has been hidden Ädarcs|Set the DARCS_PATCHES and DARCS_PATCHES_XML environment variables with info about the given patches, for use in post-hooks. ÅdarcswSet the DARCS_FILES environment variable to the files touched by the given patch, one per line, for use in post-hooks.¯darcs}Set some environment variable to the given value, unless said value is longer than 10K characters, in which case do nothing.9 ’ “ ” • – — ˜ š Ÿ   ž  ¢ ¡ § š œ ™ › £ € ¥ Š © ª « ¬ ­ ® ¯ ° ± ² ³ Ž µ ¶ · ž ¹ º » Œ œ Ÿ ¿ À Á Â Ã Ä Å Æ Ç È É Ê9 © ª « ¬ – — ˜ š Ÿ   ž  ¢ ¡ § š œ ™ › £ € ¥ Š ­ ® Ž µ » Œ ž · ¶ Ÿ ’ “ ” • º ¯ ° ± ² ³ œ ¹ À ¿ Á Â Ã Ä Å Æ Ç È É Ê­None',.=>?EHSUVX Ñ Ìdarcs Variant of Ýï‘. Return a string describing the usage of a command, derived from the header (first argument) and the options described by the second argument.;Sequences of long switches are presented on separate lines. Ë Ì Í Î Ï Ð Ì Ë Ð Ï Í Î®None',.=>?EHSUVX .°darcs Runs the  N code±darcsThe interactive part of darcs whatsnew Òdarcs’status is an alias for whatsnew, with implicit Summary and LookForAdds flags. We override the default description, to include the implicit flags. Ñ Ò Ñ Ò¯None',.=>?EHSUVX ì Ó Ô Ó Ô°None',.=>?EHSUVX B²darcs genericObliterateCmd is the function that executes the "obliterate" and "unpull" commands. The first argument is the name under which the command is invoked (unpull or  obliterate).³darcs>Get the union of the set of patches in each specified location Ùdarcs–matchingHead 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. Õ Ö × Ø Ù Õ × Ø Ö Ù±None',.=>?EHSUVX  Ú Ú²None',.=>?EHSUVX " ŽdarcsProgress of BisectµdarcsDirection of Bisect trackdown¶darcsBisect Patch Tree·darcs2Functions defining a strategy for executing a testždarcs!test only the last recorded state¹darcslinear search (with --linear)ºdarcs+exponential backoff search (with --backoff)»darcsbinary search (with --bisect)Œdarcs#Create Bisect PatchTree from the RLœdarcsConvert PatchTree back to RLŸdarcsIterate the Patch Tree·darcs test command¿darcsnumber of patches to skipdarcspatches not yet skippedŸdarcs test command Û Û³None',.=>?EHSUVX "¹ Ý ÝŽNone',.=>?EHSUVX #o Þ ÞµNone',.=>?EHSUVX $% ß ߶None',.=>?EHSUVX $Û à à·None',.=>?EHSUVX %‘ á â á âžNone',.=>?EHSUVX &O ã ã¹None',.=>?EHSUVX ' ä äºNone',.=>?EHSUVX '» å å»None',.=>?EHSUVX (q æ ç è é ê ç æ ê é èŒNone',.=>?EHSUVX )G ë ëœNone',.=>?EHSUVX +”Àdarcs$A list of all valid preferences for _darcsprefsprefs.Àdarcs(name, one line description) ì ìŸNone',.=>?EHSUVX ,J í í¿None',.=>?EHSUVX - î îÀNone',.=>?EHSUVX 67ÁdarcsŠGiven a set of characters and a string, returns true iff the string contains only characters from the set. A set beginning with a caret (^%) is treated as a complementary set.ÂdarcsThis function checks for  --token-chars’ on the command-line. If found, it validates the argument and returns it, without the surrounding square brackets. Otherwise, it returns either J or à as explained in Ä.…Note: Limitations in the current replace patch file format prevents tokens and token-char specifiers from containing any whitespace.J ï ïJÁNone"#',.=>?EHSUVX 8 ñdarcs8check is an alias for repair, with implicit DryRun flag. ð ñ ð ñÂNone',.=>?EHSUVX BÃÅdarcs‡makeRemovePatch builds a list of patches to remove the given filepaths. This function does not recursively process directories. The  Recursivee flag should be handled by the caller by adding all offspring of a directory to the files list.ÆdarcsPTakes a file path and returns the FL of patches to remove that, wrapped in a † . Returns Ey in case the path cannot be removed (if it is not tracked, or if it's a directory and it's not tracked). The three ž arguments are the recorded state, the unrecorded state excluding the removal of this file, and the unrecorded state including the removal of this file. ò ó ô ò ó ôÃNone',.=>?EHSUVX E] darcscommit is an alias for recordÇdarcsGCheck user specified patch name is not accidentally a command line flag õ ö ÷ ù  ø ú û ü ý þ ÿ      õ ö ÷ ù  ø ú û ü ý þ ÿÄNone',.=>?EHSUVX FË  ÅNone',.=>?EHSUVX G‰ÆNone',.=>?EHSUVX MíÈdarcs*known to darcs, but absent in working copyÉdarcsTakes two filenames (as Subpathž), and tries to move the first into/onto the second. Needs to guess what that means: renaming or moving into a directory, and whether it is a post-hoc move.Êdarcstree of the working directorydarcs$tree of recorded and pending changesdarcstree of recorded changesÇNone',.=>?EHSUVX e ËdarcsA set of repository paths. Ìg means every path in the repo, it usually originates from an empty list of path arguments. The list of ­Js is always kept in sorted order with no duplicates and normalised (as in ðñÖ). This has the nice effect of getting rid of the idiotic "./" that Darcs insists on prepending to repo paths (which can make things like comparing paths returned from different parts of the code base a nightmare).It uses ­[ for easier compatibility and lists because the number of elements is expected to be small.ÍdarcsÍ is isomorphic to >! but with the opposite semantics.About the name: I like the data constructor names, they are pretty suggestive. The data type name is up for grabs; a possible alternative is AtMost.Îdarcs,This is mostly for conversion to legacy APIsÏdarcsIntersection of two ËsÐdarcsConvert a list of ­s to a Ë.Ñdarcs"Convert a list of repo paths to a Ë.. Partial function! Use only with repo paths.Òdarcs Convert a Ë to something that e.g. Û takes as parameter.Ódarcs Convert a Ë to a óL. Uses the English module to generate a nicely readable list of file names.Ôdarcs'Lift a function transforming a list of _ to one that transforms a Ë.Õdarcs Convert a _ to a ­.}Note: Should call this only with paths we get from the repository. This guarantees that they are relative (to the repo dir).Ödarcs Convert a ­ to a _ . Same as ¯ and only here for symmetry.ÈNone',.=>?EHSUVX qú×darcsÿÞTake a list of filenames and patches and produce a list of patches that actually touch the given files with a list of touched file names, a list of original-to-current filepath mappings, indicating the original names of the affected files and possibly an error. Additionaly, the function takes a "depth limit" -- maxcount, that could be Nothing (return everything) or "Just n" -- returns at most n patches touching the file (starting from the beginning of the patch list).ØdarcsšNote, lazy pattern matching is required to make functions like filterPatchesByNames lazy in case you are only not interested in the first element. E.g.:)let (fs, _, _) = filterPatchesByNames ...darcschanges is an alias for log×darcsmaxcountdarcs filenamesdarcs patchlistÉNone',.=>?EHSUVX rÈ  ÊNone',.=>?EHSUVX tÀ!darcsGThis is designed for use in an atexit handler, e.g. in Darcs.RunCommand!""!Ë2003 David RoundyGPLdarcs-devel@darcs.net experimentalportableNone',.=>?EHSUVX { ÙdarcsLThis function performs the actual distribution action itself. NB - it does not_ perform the pre-dist, that should already have completed successfully before this is invoked.%darcs Flags/optionsdarcsThe path to the repositorydarcs,An action to perform on the archive contents#$%#$%ÌNone',.=>?EHSUVX €pÚdarcs¡Returns the command we should use for diff as a tuple (command, arguments). This will either be whatever the user specified via --diff-command or the default  ~}. Note that this potentially involves parsing the user's diff-command, hence the possibility for failure with an exception.&'&'ÍNone',.=>?EFHSUVX ‡ÇÛdarcs<Similarly for when the function changes all three witnesses.ÜdarcsNeed this to make ÇX work with a function that changes the last two (identical) witnesses at the same time.ÝdarcsuThis part of the help is split out because it is used twice: in the help string, and in the prompt for confirmation.Þdarcsgunescape turns r n " \ into their unescaped form, leaving any other -preceeded characters as they are.((ÎNone',.=>?EHSUVX ‹<ßdarcsß= takes a list of flags and returns the context specified by  Context cP in that list of flags, if any. This flag is present if darcs was invoked with --context=FILE-./01./-10ÏNone',.=>?EHSUVX Œ22Ð2004, 2007 David RoundyGPLdarcs-devel@darcs.net experimentalportableNone',.=>?EHSUVX á3434Ñ2002-2004 David RoundyGPLdarcs-devel@darcs.net experimentalportableNone',.=>?EHSUVX àdarcsCommand options55ÒNone',.=>?EHSUVX ”³8darcs*This class is a hack to abstract over pullapply and rebase pullapply.ádarcsQsendSanitizedEmail sends a sanitized email using the given sendmailcmd It takes  DacrsFlagJ options a file with the mail contents, To:, Subject:, CC:, and mail body6789;:<=89;:<=67ÓNone',.=>?EHSUVX •¡6?@ABC@?A6BCÔNone',.=>?EHSUVX –DEFDEFÕNone',.=>?EHSUVX —Ïâdarcschanges is an alias for logGGòSafe',.=>?EHSUVX ˜…ãäåÖNone',.=>?EHSUVX š-Jdarcsurldarcsbodydarcs mime typedarcsresultIJKLIJKL×None',.=>?EHSUVX ›óædarcsPOST the patch via HTTPçdarcssend patch via emailMMØNone',.=>?EHSUVX ŸNdarcs“The commands that darcs knows about (e.g. whatsnew, record), organized into thematic groups. Note that hidden commands are also listed here.NNÙNone',.=>?EHSUVX ÑE èdarcs#A finite map from long switches to Is.édarcs:Result of parsing a defaults line: switch and argument(s).êdarcs;Name of a normal command, or name of super and sub command.Odarcs-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 ALLt 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.DConflicting 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.ëdarcsMake a ê; from a possible super command name and a sub command name.ìdarcsTurn a ê into a ð. For a í% concatenate with a space in between.îdarcs@Parse a list of lines from a defaults file, returning a list of H, given the current working directory, the command name, and a list of  DarcsOption for the command.RIn the result, defaults for the given command come first, then come defaults for ALL commands..We check that matching options actually exist.Wlines matching the command name: the option must exist in the command's option map.lines matching ALLC: there must be at least *some* darcs command with that option.ÿ]It is debatable whether these checks are useful. On the one hand they can help detect typos in defaults files. On the other hand they make it difficult to use different versions of darcs in parallel: a default for an option that is only available in a later version will make the earlier version produce an error. Maybe reduce this to a warning?ïdarcsExtract é5s from lines of a defaults file that match the given ê. The syntax is & supercmd subcmd [--]switch [args...] ,for (super) commands with a sub command, and # cmd default [--]default [args...] #for normal commands (including the ALL pseudo command).ðdarcsûSearch an option list for a switch. If found, apply the flag constructor from the option to the arg, if any. The first parameter is the current working directory, which, depending on the option type, may be needed to create a flag from an argument.EFails if (default has argument /= corresponding option has argument).ñdarcs0Get all the longSwitches from a list of options.òdarcs Build an è from a list of  DarcsOptions.ódarcsNList of option switches of all commands (except help but that has no options).OOÚNone',.=>?EHSUVX ÙxôdarcsÊReturns the working directory for the posthook. For most commands, the first parameter is returned. For the 'get' command, the path of the newly created repository is returned if it is not an ssh url.õdarcsxChecks if the number of extra arguments matches the number of extra arguments supported by the command as specified in  Œ. Extra arguments are arguments that follow the command but aren't considered a flag. In `darcs push xyz`, xyz would be an extra argument.PPÛNone',.=>?EHSUVX æ;ödarcsStarting from a list of  ©Ts, unwrap one level to get a list of command names together with their subcommands.÷darcsGiven a list of (normal) arguments to the help command, produce a list of possible completions for the next (normal) argument.Udarcs?Help on each environment variable in which Darcs is interested.ødarcsñThis module is responsible for emitting a darcs "man-page", a reference document used widely on Unix-like systems. Manpages are primarily used as a quick reference, or "memory jogger", so the output should be terser than the user manual.ŸBefore modifying the output, please be sure to read the man(7) and man-pages(7) manpages, as these respectively describe the relevant syntax and conventions.'The lines of the manpage to be printed.QRSTUQTUSRùóôõö÷øóùåóùúóûüóýþóýÿóôóôóôóóóó ó ó ó ö ö óóôóôóôóôóôóóóóóôóôóôóôóôóôóô ó!ó"ö #ó$%ó&ó'óô(óôáó)ö *ó+,ó-ó$.ó/ó01óô2ó34ó56óô7óô8ö9:ö9;ö9<ö9=ö9>?@AóBCö9DóEö9Fö9GóHIö9JóBKóBLö9MóHNóHOö9Pö9Qö9Ró5Só5Tó5Uó5VóûWóûXóûYóûZóû[óû\óû]óû^óû_óû`óûaóûbócdóefógðóehóeió3jó3kó3ló3mó3nó3oó3pó3qó3ró3só3tó3uó3vó3wó3xó3yó3zó3{ó3|ó3}ó3~ó€óó‚óƒó„…ó„†óH‡ó+ˆó+‰ó+Šó+‹óŒó$Žó$ó$ó$‘ó$’ó$“ó$”ó$•ó$–ó$—ó$˜ó$™ó$šó$›ó$œó$ó$žó$Ÿó$ ó$¡ó$¢ó$£ó$€ó$¥ó$Šó$§ó$šó$©ó$ªó$«óà¬ó­ó®ó¯ó°ó±ó²ó³óŽóµó¶ó·óžó¹óºó»óŒóœóŸó¿óÀóÁóÂóÃó0Äó0Åó0Æó0Çó0Èó0Éó0Êó0ËóùÌóùÍóùÎóùÏóùÐóùÑóùÒóùÓóùÔóùÕóùÖóù×óùØóùÙóùÚóùÛóùÜóùÝóùÞóùßóùàóùáóùâóùãóùäóùåóæçóýèóýéóêóëóìóíóîóôïóôðóôñóôòóôóóôôóôõóôöóô÷óôøóôùóôúóôûóôüóýþóýÿóýö ö ö ö ö ö ö ö ö  ö      !"#$%&'()*+,-./012344567889:;<=>?@ABC D D E F G H I JKL M N O P Q R S T U V W X Y Z [ \]^__`abccdefghijklmnopqrstuvwxyz{|}~€‚‚ƒ„…†‡‡ˆ‰Š‹ŒŒŽ‘’“”•–—˜™š›œžŸ ¡¢£€€¥Š§§š©ª«¬­®¯°±²³Žµ¶·ž¹º»ŒœŸ¿ÀÁÂÃÄÅÆÇÈÉÊËÌÍÎÏÐÑÒÓÔÕÖ×ØÙÚÛÜÝÞßàáâãäåæçèéêëìíîïëðñòëóôõö÷øùúûüýþÿ×      !"#$%&'()*+,-./0012334567889:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[Z\\]^_`abcdefghijklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œžŸ ¡¢£€¥Š§š©ª«¬­®¯°±²³Žµ¶·žž¹º»ŒœŸ¿ÀÁÂÃÄÅÆÇÈÉÊËÌÍÎÏÐÑÒÓÔÕÖ×ØÙÚÛÜÝÞßàáâãäåæçèéêëìíîïèððñòóôõö÷øùúûüýþÿ      !"#$%&'()*+,-./0123456789:;<=>? þ @ A B C D E F!G!H!I!J!K!L!M!N!O!P!Q"R"R"S"T"U"V"W"X"Y"Z"["\"]"^"_"`#a#a#b#c#d#e#f#g#h#i#j#k$l$l$m$n%o%p%q%r%s%t%u%v%w%x%y%z%{%|%}&~&&€&&‚&ƒ&„&„&…&…&†&†&‡&ˆ&‰&Š&‹&Œ&&Ž&&&‘&’&“&”&•&–&—&˜&™&š&›'œ'œ'''ž'ž'Ÿ'Ÿ' '¡'¢'£'€'¥'Š'Š'§'š'©'ª'«'¬'­'®'¯'°'±'²'³'Ž'µ'¶'·'ž'¹'º'»'Œ'œ'Ÿ'¿'À'Á'Â'Ã'Ä'Å'Æ'Ç'È'É'Ê'Ë'Ì'Í'Î'Ï'Ð'Ñ'Ò'Ó'Ô'Õ'Ö'×'Ø'Ù'Ú'Û'Ü'Ý'Þ'ß'à'á(â(â(ã(ä(å(æ(ç(è(é(ê(ë(ì(í(î)ï)ð)ñ)ò)ó)ô)õ*ö*÷*ø*ù*ú+û+ü+ý+þ,ÿ,,,,,,,,,, - - - - -----.............. .!.".#.$/%/&/'/(/)/*/+/,/-0.0/000102030405060708090:0;0<0=0>0?0@0A0B0C0D0E0F0G0H0I0J0K0L0M0N0O0P0Q0R0S0T1U1V1W1X1Y1Z1[1\1]1^2_2`2a2b2c2d2e2f2g3h3i3j3k3l3m3n3o3p3q3r3st4u4v4w4x4y4z4{4|5}5~55€55‚6ƒ6„6…6†6‡6‡6ˆ6‰6Š6‹6Œ66Ž666‘6’6“6”7•7•7–7—7˜7ç7™7š7›7œ77ž7Ÿ7 7¡7¢7£7€7¥7Š7§7š7©7ª7«7¬7­7®7¯7°7±7²7³7Ž7µ7¶7·7ž7¹7º77»7Œ7œ7Ÿ7¿7À7Á7Â7Ã7Ä7Å7Æ7Ç7È7É7Ê7Ë7Ì7Í7Î7Ï7Ð7Ñ7Ò7Ó7Ô7Õ7Ö7×7Ø7Ù7Ú7Û7Ü7Ý7Þ7ß7à7á7â7ã7ä7å7æ7ç7è7é7ê7ë7ì7í7î7ï8ð8å8ä8ñ8ò8ó8ô8õ8ö8V8÷8ø8ù8ù8ú8û8ü8ý8þ8ÿ8888888888 8 8 8 8 8888888888888899Z9999 9!9"9#9[9$9%9&9'9(9)9*9+9,9-9.9/9091929394:5:6:7:7:8:9:::;:<;=;>;?;@;A;B;C;D;E;F;GHIJKLMNO<P<Q=R=S=T=U=V=W=X=Y=Z=[=\=]>^>_>`>a>b?Ü?ò?c?d?e?f?g?h?i?j?9?;?k?l?m?g?f?e?n?o?p?q?r?s?t?u?v?w?x?y?z?{?|?}?~??€??‚?ƒ?„?…?†?‡?ˆ?‰?Š?‹?Œ??Ž???‘?’?“?”?•?Z?[?–?—?˜?™?š?›?K?M?E?G?H?J?œ??ž?Ÿ? ?¡?¢?£?€?¥?Š?§?š?©?ª?«?¬?­?®?¯?°?±?(?²?)?³?Ž?µ?¶?·?ž?¹?º?»?Œ?œ?Ÿ?¿?"?À?Á?Â?Ã?Ä?Å?Æ?Ç?È?É?Ê?%?Ë?Ì?Í?Î?Ï?Ð?Ñ?Ò?Ó?Ô?Õ?Ö?×?Ø?Ù?Ú?Û?Ü?Ý?Þ?Q?5?7?ß?<?à?á?â?ã?ä?å?æ?ç?è?é?ê?ë?ì?í?î?ï?ð?ñ?ò?ó?ô?õ?ö?÷?ø?N?ù?ú?û?ü?ý?þ?ÿ?????????? ? ? ? ? @@@@@@@@ß@@@@@@@@@@@@ @!@"@#@$A%B&B'B(B)C*C+C,C-C.C/C0C1C2C3C4C5C6C7D8D9D:D;D<D=DéD>D?D@EAEAEBECEDEEEFEùEGEHEIEJEJEKELEMENEOEPEQERFSFTFUFVFWFXFYFZF[F\F]F^F^F_F`FaFbFcFdFeFfFgFhFiFjFkFlFmFnFoGpGqGrGsGtGuGvGwGxGyGzG{G|G}G~GG€GG‚GƒG„G…G†G‡GˆG‰GŠG‹GŒGGŽGGG‘G’G“H”H•H–H—H˜H™HšH›HœHIžIŸI I¡I¢I£J€J¥JŠJ§JšJ©JªJ«J¬J­J®J¯J°J±J²J³KŽKŽKµK¶K·KžK¹KºK»KŒKœKŸK¿KÀKÁKÂKÃKÄKÅKÆKÇKÈKÉKÊKËKÌKÍKÎKÏKÐKÑKÒKÓKÔKÕKÖK×KØKÙLÚLÛLÜLÜLÝMÞMßMàMáMâMãMäNåNæNNçNNèNéNêNëNìOíOîOïOðOñOòOóOôOõOöO÷OøOùOúOûOüOýOþOÿOOOOOOOOOO O O O O OOOOOOOOOOOOOOOOOOO O!O"P#P$P%P&P'P(P)P*P+P,P-P.P/P0P1P2P3P4P5P6P7P8P9P:P;P<P=P>P?P@QARBSCSDSESFSGSHSITJTKTLTMTNTOTPTQTRTSTTTUTVTWTXTYUZU[V\V]V^W_X,X)X`XaXbXcX`XdX)XeXfXgXhXiX6X8X9X:X;X<XHXGXjXkXlXmXIX5YnYAZB[T\Z]o]p]q]r]s]t]u]v]w]x]y]z]{]|^}^~___€__‚_ƒ_„_…`†`‡`ˆ`‰`Ša‹aŒaaaŽaaa‘a’a“a”a•a–a—a˜a a™aša›aœaažaŸa b¡b¢b£b€c¥cŠc§cšc©cªc«c¬c­c®c¯c°c±c²c³cŽcµc¶c·cžc¹cºd»dŒdœdŸd¿dÀdÁdÂdÃdÄdÅdÆdÇdUdVdWdXdYeÈfÉfÊfËfÌfÍfÎgÏgDgÐgÑgÒgÓhÔhÕhÖh×h\h]hØhÙ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üjýjþjÿj j k k k k k k k k k k k k k k k k k k k k k k l l l l l l l l l l !l "l #l $l %l &l 'l (l )m *m +m ,m -m .m /m 0m 1m 2m 3m 4m 5m 6m 7n 8n 9n -n :n ;n .n /n <n =n >n ?n @n An Bn Cn Dn En Fn Gn Hn In Jn Kn Lo Mo No Oo Po Qo Ro So To Uoäoßoàoáo Voâoão Wo Xo Yo Zo [o \o ]o ^o _o `o ao bo co do eo fo go ho io jo ko lo mo no oo po qo rp sp tp up vp wp xp yp zp zpåp {p |p }p ~p p €p p ‚p ƒp „p …p †p ‡p ˆp ‰p Šp ‹p Œp p Žp p p ‘p ’p “p ”p •p –p —p ˜p ™p šp ›p œp p žp Ÿp  q ¡q ¡q ¢q ¢q £q €q ¥q Šq §q šq ©q ªq «q ¬q ­q ®q ¯q °q ±r ²r ³r Žr µr ¶s ·s žs ¹t ºu »u Œu Œu œu Ÿu ¿u Àu Áu Âu Ãu Äu Åu Æu Çu Èu Éu Êu Ëu Ìu Íu Îu Ïu Ðu Ñu Òu Óu Ôu Õu Öu ×u Øu Ùu Úu Ûu Üu Ýu Þu ßu àu áu âu ãu äu åu æu çu èu éu êu ëu ìu íu îu ïu ðu ñv òv óv ôv õv öv ÷v øv ùv úw ûx üx ýx þx ÿx x x x x x x x x x x x y y y y y y y y y y y y y y y y y y y y y y !y "y #y $y %y &y 'y (y )y *y +y ,y -y .y /z,z,z 0z]z^zÓzÐzÑzÒznz 1zÚzÛzHzGzIzÜz zTz9z:z6z8z\zZz<z;zBz_{,{,{ 0{]{^{Ó{Ð{Ñ{Ò{n{ 1{Ú{Û{H{G{I{Ü{ {T{9{:{6{8{\{Z{<{;{B{_| 2| 3| 4} 5} 6~ 7 8 9€ :€ ; < = > ? @ A B C D E F G H I J K‚ L‚ M‚ N‚ O‚ P‚ Qƒ Rƒ Sƒ Tƒ Uƒ Vƒ Wƒ Xƒ Yƒ Zƒ [ƒ \ƒ ]ƒ ^ƒ _ƒ `ƒ aƒ bƒ cƒ dƒ eƒ fƒ gƒ hƒ iƒ jƒ kƒ lƒ mƒ nƒ oƒ pƒ qƒ rƒ sƒ tƒ uƒ vƒ wƒ xƒ yƒ zƒ {ƒ |ƒ }ƒ ~ƒ ƒ €ƒ „ ‚„ ƒ„ „„ …„؄لڄۄz„|„„€„{„}„~„†„‡„ˆ„‚„„„Š„ †„ ‡„ ˆ„ ‰„ Š„ ‹„ Œ„ „ Ž„ „ „ ‘„ ’„ “„ ”„ •„ –„ —„ ˜„ ™„ š„ ›„ œ„ „ ž„ Ÿ„  „ ¡… ¢… £… €… ¥… Š… §… š… ©… ª… «… ¬… ­† ®† ¯† °† ±†á†â†ã†ä† ²†džƆ‰† ³†…† Ž† µ† µ† ¶†h†ˆ̆ ·†p†p†q†§† ž† ¹†š†¡†£†¡†¢†€† º† º† »† Œ† œ† Ÿ† ¿† À† Á† † Æ Æ Ć ņ Ɔ dž Ȇ Ɇ ʆ ʆ ˆ ̆ ͆ Ά Ά φ І ц®† ҆¯† ӆž†Ÿ† †Æ Ԇ Ն ֆ ׆ ؆ ن چ ۆ ܆ ݆e†f†߆ ކ ߆ò†c†d† † † à† ᆠ↠ã† ä† å† æ† ç† è† é† ê† ë† ì† í† î† ï† ð† ñ† ò† ó† ô† õ† ö† ÷†í† ø† ù† ú† û† ü† ý† þ† ÿ† † † † †å† † † † † † † † † † † † † † † † † † † † † † † † † † † † † † !† "† #† $† %† &† '† († )† *† +† ,† -† .†§† /† 0† 1† 2† 3† 4† 5† 6† 7† 8† 9† :† ;† <† =† >† ?† @† A† B† C† D† E† F† G† H† I† J† K† L† M† N† O† P† Q† R† S† T† U† V† W† X† Y† Z† [† \† ]† ^† _† `† a† b† c† d† e† f† g† h† i† j† k† l† m† n† o† p† q† r† s† t† u† v† w† x† y† z† {† |† }† ~† ‡ €ˆ ˆ ‚ˆ ƒˆ „ˆ …ˆ †ˆ ‡ˆ ˆˆ ‰ˆ Šˆ ‹ˆ Œˆ ˆ Žˆ ˆ ˆ ‘ˆ ’ˆ “ˆ ”ˆ •ˆ –ˆ —ˆ ˜ˆ ™ˆ šˆ ›ˆ œˆ ‰ ž‰ Ÿ‰  ‰ ¡‰ ¢‰ £‰ €‰ ¥‰ Š‰ §‰ š‰ ©‰ ª‰ «‰ ¬‰ ­‰ ®‰ ¯‰}‰ °‰ ±‰ ²Š ³Š ŽŠ µŠ ¶Š ·‹ ž‹ ¹‹ º‹ »‹ Œ‹ œ‹ Ÿ‹ ¿Œ ÀŒ ÁŒ Œ Ì Č Ō ƌ nj ȍ ɍ ʎ ˎ ̎ ͎ Ύ ώ ЎŽ ю Ҏ ӎ Ԏ Վ ֎ ׎ ؎ َ ڎ ێ ܎ ݎ ގ ߏ à á â à ã ä å æ çF è é ê ë ì í î ï ð ñ ò ó ô õ ö ÷ ø ù ú û ü ý þ ÿ                                  ! " # $ % & ' ( ) *‘ +‘ ,‘h‘ -‘ ő .‘ /‘ 0‘ 1‘ 2‘ ‘ 3‘ 4‘ 5‘ ‘ 6‘ 7‘ 8‘ 9‘ :‘ ;‘ <‘ =‘ >‘ ?‘ @‘ A‘ B‘ C‘ D‘ E‘ F‘ G‘ H‘ I’ J’ K’ L“ M” N” O” P• Q• R• S• T• U• V• W• X• Y• Z• [• \• ]• ^• _• `• a• b• c• d• e• f• g• h– i– j– j– k– l– m– n– o– p– q– r– s– t– u– v– w– x– y– z– {– |– }– ~– – €– – ‚– ƒ– „– …– †– ‡– ˆ– ‰– Š– ‹— Œ— — Ž— — — ‘— ’— “— ”— •— –— —— ˜— ™— š— ›— œ— — ž˜ Ÿ˜  ˜ ¡˜ ¢˜ £˜ €˜ ¥˜ Š˜ §˜ š˜ ©˜ ª˜ «˜ ¬˜ ­˜ ®˜ ¯˜ °˜ ±˜ ²˜ ³˜ Ž™ µ™ ¶™ ·™ ž™ ¹™™™ ºš »š Œš œš Ÿš ¿š Àš Áš š Ú Ě ś ƛ ƛ Ǜ ț ɛ ʛ ˛ ̛ ͛ Λ ϛ Л ћ қ Œ› ӛU›S› ԛ ՛ ֜ ל 2œ ؝ ٝ ڝ ۝ ܝ ݝ ޝ ߝ à á â ã ä åž æž æž çž èž éž êž ëž ìž íž îž ïž ðž ñž òž óž ôž õž öž ÷ž øž ùž úž ûž üž ýž þžèž ÿž ž ž ž ž ž ž ž ž ž ž ž ž ž ž ž ž ž ž ž ž ž ž ž ž Ÿ Ÿ Ÿ Ÿ           !  "  #¡ $¡ $¡ %¡ &¡ '¡ (¡ )¡ *¡ +¢ ,¢ -¢ .¢ /£ 0£ 1£ 2£ 3€ 4€ 5¥ 6¥ 7¥ 8¥ 8¥ 9¥ :¥ ;¥ <¥ =¥ >¥ ?¥ @¥ A¥ B¥ C¥ D¥ E¥ F¥ GŠ HŠ IŠ JŠ KŠ LŠ M§ N§ N§ O§ P§ Q§ Rš Sš Tš U© V© V© W© X© Y© Z© [© \© ]© ^© _© `© a© b© b© è© c© ó© ö©§© © d© e© f© g© h© i© j© k© l© m© n© o© p© q© r© s© t© u© v© w© x© y©© z© {© |© }© ~© ª €ª €ª ª ‚ª ƒª „ª …ª †ª ‡ª ˆª ‰ª >« Š« ‹« Œ« « Ž« « «J« ‘« ’¬ “¬ ”¬ •¬ –¬ —¬ —¬ ˜¬ ™¬ š¬ ›¬ œ¬ ¬ ž¬ Ÿ¬  ¬ ¡¬ ¢¬ £¬ €¬ ¥¬ Š¬ §¬ š¬ ©¬ ª¬ «¬ ¬¬ ­¬ ­¬ ®¬ ¯¬ °¬ ±¬ ²¬ ³¬ Ž¬ µ¬ ¶¬ ·¬ ž¬ ¹¬ º¬ »¬©¬ Œ¬ œ¬ Ÿ¬ ¿¬ À¬ Á¬ ¬ ì Ĭ á¬ à¬ ã¬ ä­ Å­ï­ Æ­ Ç­ È­ É® Ê® ˯ ̯ Í° ΰ Ï° а Ñ° Ò± Ó² Ô² Õ³ ÖŽ ×µ ض Ù· Ú· Ûž ܹ ݺ Þ» ß» à» á» â» ãŒ äœ åŸ æ¿ çÀ èÁ éÁ ê ë ì íà îà îÃåà à à óà òà õà à à ïà à à èà à )à à 1à ðà à îà ñà òà óÄ ôÅ õÆÆ öÆ ÷Æ øÆ ùÇ úÇ ûÇ üÇ ýÇ þÇ ÿÇÈÈÈÈÉÉÊÊË Ë Ë Ì Ì ÍÍÍÍÍÎÎÎÎÎÏ ýÐÐÑÒÒÒÒÒÒ ûÒÒÒ Ó!Ó"Ó#Ó$Ó%Ô–Ô&Ô'Õ(Õ)Ö*Ö+Ö,Ö-×.Ø/Ù0Ú1Û2Û3Û4Û/Û56 7 8 9: ;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^þ_]^ù`abcdefghijklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹Œ Ž   ‘ ’ “ ” • – — ˜ ™ š › œ  ž Ÿ   ¡ ¢ £ € ¥ Š §!šã©ãªã«ã¬ã­ã œã,ã-ã®ã¯&°&±0²0³0Ž0µ0¶0·0žóg¹5º6»6Œ6œ6Ÿó¿À6Á6Â6ÃóôÄ7J7Å7Æ7Ç8È9É9Ê;Ë;Ì=Í=Î=Ï=Ð=Ñ=Ò=Ó=Ô=Õ=Ö=×=Ø@ÙóÝÞ@Ú@Û@Ü@Ý@Þ@ßGàKáKâKãKäQåUæUçUèUéUêaëdPdQdìdífîrïrðuñuòyóyôyõyöy÷yøùúûüý‚þ‚ÿ‚‚‚‚‚‚‚„„„ „ „ „ „ „„„„……ˆ‰‰‰‰ó󋍎ŽŽ Ž!Ž"#$%&'()*+”,˜-˜.˜/˜0˜1˜2˜3˜4˜5˜6˜7˜8˜9˜:˜;˜<˜=˜>˜?˜@˜A˜B˜C˜D˜E˜F˜G˜H˜I˜J˜K˜L™M™NšOšPšQšRšSšTšU›V›W›X›Y›Z›[œ\ž]ž^ž_ž`žažbžcždžežfžgžhžižjžk¢lóàm¥n¥o¥pŠqŠrŠsŠtšušv©w©x©y©z©{©|©}©~©©€©©‚©ƒ©„©…©†©‡©©©ª©ˆ©‰©Š¬â®‹®Œ°°Ž²²²‘²’²“²”²•²–²—²˜²™²šœ›ÀœÀÀžÀŸÂ Â¡Ã¢Æ£Æ€Æ¥ÇŠÇ§ÇšÇ©ÇªÇ«Ç¬Ç­Ç®Ç¯Ç°Ç±È²È˳̎͵Ͷͷ͞ÎѹҺÕò3ò»ò ­×Œ×œÙŸÙ&Ù¿ÙÀÙÁÙÂÙÃÙÄÙÅÙÆÙÇÙÈÚÉÚÊÛËÛÌÛÍÎdarcs-2.14.3-inplace Darcs.PreludeDarcs.Util.RatifiedDarcs.Util.ByteStringDarcs.Util.WorkaroundDarcs.Util.FileDarcs.Util.DateTimeDarcs.Patch.FormatDarcs.Patch.RepoTypeDarcs.Patch.TypeDarcs.Patch.Witnesses.UnsafeDarcs.Patch.Witnesses.EqDarcs.Patch.RegCharsDarcs.Patch.TokenReplaceDarcs.UI.Options.IsoDarcs.UI.Options.CoreDarcs.Util.AtExitDarcs.Util.CommandLineDarcs.Util.Download.RequestDarcs.Util.EncodingDarcs.Util.EnglishDarcs.Util.GlobalDarcs.Util.Diff.MyersDarcs.Util.Diff.PatienceDarcs.Util.DiffDarcs.Patch.ReadMonadsDarcs.Repository.FlagsDarcs.Util.HashDarcs.Util.IsoDateDarcs.Util.DateMatcherDarcs.Util.PrinterDarcs.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.InvertDarcs.Patch.InspectDarcs.Patch.DebugDarcs.Patch.CommuteFnDarcs.Patch.CommuteDarcs.Patch.PermutationsDarcs.Patch.MergeDarcs.Patch.ChoicesDarcs.Patch.BracketedDarcs.Util.TextDarcs.Util.URLDarcs.Util.SignalHandlerDarcs.Util.ExceptionDarcs.Util.SshDarcs.Util.PathDarcs.Util.TreeDarcs.Util.Tree.MonadDarcs.Patch.MonadProgressDarcs.Util.Tree.HashedDarcs.Util.Tree.PlainDarcs.Util.IndexDarcs.Util.CompatDarcs.UI.Options.FlagsDarcs.UI.Options.UtilDarcs.UI.Options.MarkdownDarcs.UI.Commands.Util.TreeDarcs.Patch.SummaryDataDarcs.Patch.Read#Darcs.Patch.Prim.FileUUID.ObjectMapDarcs.Patch.Index.TypesDarcs.Patch.ApplyMonadDarcs.Patch.ApplyDarcs.Patch.TouchesFilesDarcs.Patch.ShowDarcs.Patch.InfoDarcs.Patch.FileHunkDarcs.Patch.ViewingDarcs.Patch.RepairDarcs.Patch.Prim.ClassDarcs.Patch.Prim.V1.CoreDarcs.Patch.Prim.V1.ReadDarcs.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.V1.CoreDarcs.Patch.V1.ShowDarcs.Patch.SplitDarcs.Patch.EffectDarcs.Patch.V2.NonDarcs.Patch.Bracketed.InstancesDarcs.Patch.ConflictDarcs.Patch.V1.CommuteDarcs.Patch.V1.ReadDarcs.Patch.SummaryDarcs.Patch.Prim.FileUUID.ShowDarcs.Patch.Prim.FileUUID.ApplyDarcs.Patch.Prim.FileUUIDDarcs.Patch.NamedDarcs.Patch.Rebase.NameDarcs.Patch.Rebase.FixupDarcs.Patch.Rebase.ItemDarcs.Patch.Rebase.ContainerDarcs.Patch.Named.WrappedDarcs.Patch.PatchInfoAndDarcs.Patch.SetDarcs.Patch.RebaseDarcs.Patch.ProgressDarcs.Patch.MatchableDarcs.Patch.Rebase.ViewingDarcs.Patch.Index.MonadDarcs.Patch.ApplyPatchesDarcs.Patch.AnnotateDarcs.Patch.V2.RepoPatchDarcs.Patch.V2.PrimDarcs.Patch.V1.PrimDarcs.Patch.V1.ApplyDarcs.Patch.V1.ViewingDarcs.Patch.RepoPatchDarcs.Patch.V2Darcs.Patch.V1Darcs.Patch.DependsDarcs.Patch.BundleDarcs.Patch.DummyDarcs.Patch.MatchDarcs.UI.Options.MatchingDarcs.UI.Options.AllDarcs.UI.OptionsDarcs.Util.LockDarcs.UI.ExternalDarcs.UI.PrintPatchDarcs.Util.DownloadDarcs.Util.ExternalDarcs.Repository.OldDarcs.Repository.FormatDarcs.Repository.CacheDarcs.Repository.PrefsDarcs.UI.FlagsDarcs.UI.CommandsAuxDarcs.Repository.DiffDarcs.Repository.ResolutionDarcs.Repository.ApplyPatchesDarcs.Repository.InventoryDarcs.Repository.InternalTypesDarcs.Repository.PatchIndexDarcs.Repository.HashedIODarcs.Repository.PendingDarcs.Repository.StateDarcs.Repository.WorkingDarcs.Repository.IdentifyDarcs.Repository.HashedDarcs.Repository.TestDarcs.Repository.RepairDarcs.Repository.RebaseDarcs.Repository.PacksDarcs.Repository.MergeDarcs.Repository.MatchDarcs.Repository.JobDarcs.UI.CompletionDarcs.Repository.CreateDarcs.Repository.CloneDarcs.UI.SelectChangesDarcs.UI.PatchHeaderDarcs.UI.Commands.UtilDarcs.UI.CommandsDarcs.UI.UsageDarcs.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.PushDarcs.UI.Commands.OptimizeDarcs.UI.Commands.MoveDarcs.UI.Commands.MarkConflictsDarcs.UI.Commands.LogDarcs.UI.Commands.InitDarcs.UI.Commands.GZCRCsDarcs.UI.Commands.DistDarcs.UI.Commands.DiffDarcs.UI.Commands.ConvertDarcs.UI.Commands.CloneDarcs.UI.Commands.AnnotateDarcs.UI.Commands.AmendDarcs.UI.Commands.AddDarcs.UI.ApplyPatchesDarcs.UI.Commands.PullDarcs.UI.Commands.ApplyDarcs.UI.Commands.RebaseDarcs.Util.Download.HTTPDarcs.UI.Commands.SendDarcs.UI.TheCommandsDarcs.UI.DefaultsDarcs.UI.RunCommandDarcs.UI.Commands.Help DarcsFlagSystem.Console.GetOptOptDescr DarcsOptDescr Data.FunctorFunctorsetEnvCautiouslyDarcs.Util.Download.CurlTreefilterDarcsUtil.Path AbsolutePathwritePatchIfNecessary readFileNameDarcs.Patch.Prim Darcs.PatchRebasemaxCountDarcs.Repository usageInfoFilePath normaliseVersionbaseGHC.Base++ghc-primGHC.PrimseqGHC.Listzip System.IOprint Data.Tuplefstsnd otherwisemap$GHC.Num fromInteger-GHC.Real fromRationalGHC.EnumenumFrom enumFromThen enumFromToenumFromThenTo GHC.Classes==>=negatefail>>=>>fmapreturn fromIntegral realToFrac toInteger toRational<>memptymappendmconcat<*>pure*>BoundedEnumEq GHC.FloatFloating FractionalIntegralMonadNumOrdGHC.ReadReadReal RealFloatRealFracGHC.ShowShow Applicative Data.FoldableFoldableData.Traversable Traversable SemigroupMonoid GHC.TypesBoolCharDoubleFloatInt integer-gmpGHC.Integer.TypeInteger GHC.MaybeMaybeOrderingRationalIOWord Data.EitherEitherFalseNothingJustTrueLeftRightLTEQGTsequencemapM sequenceAtraversereadIOreadLn appendFile writeFilereadFileinteract getContentsgetLinegetCharputStrLnputStrputCharGHC.IO.Handle.Text hGetContentsGHC.IO.ExceptionioErrorGHC.IO userErrorIOErrornotElemallanyorand concatMapconcat sequence_mapM_productsumminimummaximumelemlengthnullfoldl1foldr1foldlfoldrfoldMap Data.OldListunwordswordsunlineslines Text.Readreadreadseitherlex readParenreadList readsPrecText.ParserCombinators.ReadPReadSatanhacoshasinhtanhcoshsinhatanacosasintancossinlogBase**sqrtexpatan2isIEEEisNegativeZeroisDenormalized isInfiniteisNaN scaleFloat significandexponent encodeFloat decodeFloat floatRange floatDigits floatRadix<$>lcmgcd^^oddevendivModquotRemmoddivremquotrecip/floorceilingroundtruncateproperFractionmaxBoundminBoundfromEnumtoEnumsucc showParen showStringshowCharshowsShowSshowListshow showsPrecunzip3unzipzipWith3zipWithzip3!!reversebreakspansplitAtdroptake dropWhile takeWhilecycle replicaterepeatiteratescanr1scanrscanl1scanlinitlasttailhead Data.Maybemaybeuncurrycurrysubtractsignumabs*+asTypeOfuntil$!flip.constid=<<stimessconcat<$<*liftA2StringGHC.Err undefinederrorWithoutStackTraceerror/=<=compare&&||not<>maxminbytestring-0.10.8.2Data.ByteString intercalatedirectory-1.3.3.0System.DirectorygetCurrentDirectorygetDirectoryContents renameFile time-1.8.0.2Data.Time.Clock.POSIXgetCurrentTime unix-2.7.2.2System.Posix.SignalsinstallHandler raiseSignalsigTERMsigPIPEsigINTsigHUPsigALRMsigABRTSignal CatchInfoOnce CatchInfo CatchOnceCatchIgnoreDefaultHandlerFileNameFormat OldFormat NewFormat UserFormat ListFormatListFormatDefault ListFormatV1 ListFormatV2PatchListFormatpatchListFormat$fEqFileNameFormat$fShowFileNameFormat SRepoType IsRepoTypesingletonRepoType RebaseTypeOfRepoType rebaseType IsRebaseType SRebaseType SIsRebase SNoRebase RebaseTypeIsRebaseNoRebase$fIsRebaseTypeNoRebase$fIsRebaseTypeIsRebase$fIsRepoTypeRepoType PatchType patchType unsafeCoercePunsafeCoercePStartunsafeCoercePEndunsafeCoerceP2unsafeCoerceP1 impossiblebugEq2 unsafeCompare=\/==/\=EqCheckIsEqNotEqisIsEq $fShowEqCheck $fEqEqCheckregChars tryTokReplaceforceTokReplaceannotateReplace breakToTokens defaultToks IsoFunctorimapIsoundercps PrimOptSpecOptSpecounparseoparseocheckodescoid^ onormalise defaultFlagsoimapoappendoempty parseFlags?$fIsoFunctorOptSpec$fMonoidOptSpec$fSemigroupOptSpecatexit withAtexitparseCmd addUrlencoded toSeconds startOfTimeformatDateTime parseDateTime fromClockTimeConnectionErrorCouldNotResolveHostCouldNotConnectToServerOperationTimeoutQUrlState inProgress waitToStart pipeLength randomJunk UrlRequesturlfilecachablepriorityCachable UncachableMaxAgePriorityHighLowreadQaddUsingPriorityinsertQpushQdeleteQelemQemptyQnullQ $fEqPriority$fShowCachable $fEqCachable$fEqConnectionError$fReadConnectionError$fShowConnectionErrorencodedecode encodeUtf8 decodeUtf8ThisPronounItNoun Countablepluralsingular englishNum andClauses orClausesitemizepresentParticiple capitalize$fCountableNoun$fCountablePronoun$fCountableThis setDebugMode whenDebugMode withDebugMode debugMessage debugFail putTimingsetTimingsMode timingsMode addCRCWarninggetCRCWarningsresetCRCWarnings addBadSourcegetBadSourcesList isBadSourceaddReachableSourceisReachableSourcedarcsdirdefaultRemoteDarcsCmddarcsLastMessagedarcsSendMessagedarcsSendMessageFinal FileSegment readIntPS dropSpace breakSpaceisFunkyhashPSsubstrPS 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$fShowDiffAlgorithmParserMparselexChar lexStringstringlexEofmyLex'anyChar endOfInputcharint skipSpace skipWhiletakeTill takeTillCharlinesStartingWithlinesStartingWithEndingWithoptionchoice checkConsumes parseStrictly$fAlternativeSM$fApplicativeSM $fFunctorSM $fMonadPlusSM $fParserMSM $fMonadSM HookConfigcmdprompt HooksConfigprepost PatchFormat PatchFormat1 PatchFormat2 ForgetParentYesForgetParentNoForgetParentWithWorkingDir NoWorkingDir WantGuiPauseYesWantGuiPauseNoWantGuiPauseWorkRepo WorkRepoDirWorkRepoPossibleURLWorkRepoCurrentDir ExternalMergeYesExternalMergeNoExternalMergeAllowConflictsNoAllowConflictsYesAllowConflictsYesAllowConflictsAndMark CloneKind LazyClone NormalClone CompleteClone ScanKnownScanAll ScanBoringUseIndex IgnoreIndex SetDefault YesSetDefault NoSetDefault RemoteRepos LeaveTestDirYesLeaveTestDirNoLeaveTestDirSetScriptsExecutableYesSetScriptsExecutableNoSetScriptsExecutableRunTest YesRunTest NoRunTest IncludeBoringYesIncludeBoringNoIncludeBoring LookForMovesYesLookForMovesNoLookForMovesLookForReplacesYesLookForReplacesNoLookForReplaces LookForAddsYesLookForAdds NoLookForAddsUMaskYesUMaskNoUMaskDryRun YesDryRunNoDryRunUseCache YesUseCache NoUseCache UpdateWorkingYesUpdateWorkingNoUpdateWorkingReorder NoReorder RemoteDarcsDefaultRemoteDarcsWithPatchIndex YesPatchIndex NoPatchIndex Compression NoCompressionGzipCompression VerbosityQuietNormalVerbosityVerbose remoteDarcs $fEqVerbosity$fShowVerbosity$fEqCompression$fShowCompression$fEqWithPatchIndex$fShowWithPatchIndex$fEqRemoteDarcs$fShowRemoteDarcs $fEqReorder$fEqUpdateWorking$fShowUpdateWorking $fEqUseCache$fShowUseCache $fEqDryRun $fShowDryRun $fEqUMask $fShowUMask$fEqLookForAdds$fShowLookForAdds$fEqLookForReplaces$fShowLookForReplaces$fEqLookForMoves$fShowLookForMoves$fEqIncludeBoring$fShowIncludeBoring $fEqRunTest $fShowRunTest$fEqSetScriptsExecutable$fShowSetScriptsExecutable$fEqLeaveTestDir$fShowLeaveTestDir$fEqRemoteRepos$fShowRemoteRepos$fEqSetDefault$fShowSetDefault $fEqUseIndex$fShowUseIndex $fEqScanKnown$fShowScanKnown $fEqCloneKind$fShowCloneKind$fEqAllowConflicts$fShowAllowConflicts$fEqExternalMerge$fShowExternalMerge $fEqWorkRepo$fShowWorkRepo$fEqWantGuiPause$fShowWantGuiPause$fEqWithWorkingDir$fShowWithWorkingDir$fEqForgetParent$fShowForgetParent$fEqPatchFormat$fShowPatchFormatSHA1HashSHA256NoHash encodeBase16 decodeBase16sha256 sha256sumrawHashmatchsha1Xorsha1zero sha1shortsha1PS showAsHex $fBinarySHA1 $fShowSHA1 $fShowHash$fEqHash $fOrdHash $fReadHash $fDataHash$fEqSHA1 $fOrdSHA1 MCalendarTimemctYearmctMonthmctDaymctHourmctMinmctSec mctPicosecmctWDaymctYDay mctTZNamemctTZmctIsDSTmctWeek TimeInterval readUTCDatecleanLocalDate getLocalTzreadUTCDateOldFashioned parseDateshowIsoDateTimegetIsoDateTimeiso8601Intervaliso8601DurationenglishDateTimeenglishInterval englishLasttoMCalendarTimeunsafeToCalendarTime addToMCalsubtractFromMCal resetCalendar unsetTime$fShowMCalendarTime DateMatcherDMparseDateMatcher getMatcherstestDate testDateAtColorBlueRedGreenCyanMagentaPrinter Printers'PrinterscolorP invisiblePhiddenP userchunkPdefP lineColorT lineColorSDocunDoc PrintableSPSBothspacenewlineminusplus backslashlparenrparenparenserrorDoc putDocWith putDocLnWithputDocputDocLn ePutDocLn hPutDocWith hPutDocLnWithhPutDoc hPutDocLn hPutDocCompr debugDocLn renderStringrenderStringWithrenderPS renderPSs renderPSWith renderPSsWithprefix prefixLinesinsertBeforeLastline lineColor hiddenPrefix unsafeBothunsafeBothText packedStringunsafePackedString invisiblePS userchunkPS unsafeChartext unsafeText invisibleText hiddenText userchunkblueTextredText greenText magentaTextcyanText colorTextwrapText printableinvisiblePrintablehiddenPrintableuserchunkPrintablesimplePrinters simplePrinterinvisiblePrinteremptydoc<+>$$vcatvsephcathsepquoted $fMonoidDoc$fSemigroupDoc $fIsStringDoc formatHeader makeEmail readEmailprop_qp_roundtriptraceDoc assertDocshowDoc fancyPrintersenvironmentHelpColorenvironmentHelpEscapeWhiteenvironmentHelpEscape beginTedious endTedious tediousSizeminlist progressListprogressprogressKeepLatest finishedOne finishedOneIOsetProgressModewithoutProgress ExecExceptionRedirectAsIsNullFileStdout RedirectsrenderExecExceptionexecexecInteractivewithoutNonBlockreadInteractiveProcess$fShowExecException$fExceptionExecException$fShowRedirect PromptConfigpPromptpBasicCharacterspAdvancedCharacterspDefaultpHelpaskUseraskEnteraskUserListItem promptYorn promptChar BSWrapperappPrec$fShowBSWrapperShow2 showDict2Show1 showDict1ShowDict ShowDictClassShowDictRecord showsPrecDshowD showListD showsPrec1show1 showsPrec2show2showOp2GapemptyGapfreeGapjoinGap FreeRightFreeLeft FlippedSealSealed2Sealedsealseal2flipSeal unsafeUnsealunsafeUnsealFlipped unsafeUnseal2unsealunsealMliftSMmapSeal mapFlippedunseal2mapSeal2 unsealFlipped unFreeLeft unFreeRight $fShowSealed $fEqSealed $fShowSealed2$fGapFreeRight $fGapFreeLeft:||:Fork:/\::\/:RL:<:NilRLFL:>:NilFL:>nullFLnullRL filterOutFLFL filterOutRLRLfilterRL+>++<+ reverseFL reverseRLconcatFLconcatRLspanFLspanFL_M splitAtFL splitAtRLbunchFLfoldFL_MallFLanyFLallRLanyRLfoldlFLfoldlRLmapFL_FL mapFL_FL_M sequenceFL_ zipWithFLmapRL_RLmapFLfilterFLmapRLlengthFLlengthRLisShorterThanRL snocRLSealedtoFL dropWhileFL dropWhileRLeqFLeqFLRev eqFLUnsafe+>>++<<+initsFL $fShow2:>$fEq:>$fEq2:>$fShow:> $fShow1:> $fShow2FL $fShow1FL$fShowFL $fShow2RL $fShow1RL$fShowRL $fShow2:\/: $fShow:\/: $fShow2:/\: $fShow:/\:FZipper flToZippernullFZlengthFZfocusclownsjokers rightmostrightleftmostlefttoEndtoStartInvertinvertinvertFLinvertRL $fInvert:> $fInvertRL $fInvertFL PatchInspectlistTouchedFiles hunkMatches$fPatchInspectRL$fPatchInspectFL PatchDebugpatchDebugDummy$fPatchDebugRL$fPatchDebugFLMergeFnTotalCommuteFn CommuteFn commuterIdRL commuterIdFL mergerIdFLtotalCommuterIdFL commuterFLId commuterRLIdtotalCommuterFLIdtotalCommuterFLFLCommutecommute commuteRLFL commuteRL commuteFLcommuteFLorComplain selfCommuter $fCommuteRL $fCommuteFL partitionFL partitionRLcommuteWhatWeCanFLgenCommuteWhatWeCanFLcommuteWhatWeCanRLgenCommuteWhatWeCanRL removeCommonremoveFLremoveRLremoveSubsequenceFLremoveSubsequenceRLsimpleHeadPermutationsFLheadPermutationsFLheadPermutationsRLpartitionConflictingFLinverseCommuter$fEq2RL$fEq2FLMergemerge selfMergermergeFL naturalMergeprop_mergeSymmetricprop_mergeCommute $fMergeRL $fMergeFLSlotInFirstInMiddleInLast PatchChoices LabelledPatchLabellabel getLabelIntunLabel patchChoices labelPatchesmkPatchChoicesseparateFirstFromMiddleLastseparateFirstMiddleFromLast getChoices refineChoices patchSlotforceMatchingFirst forceFirsts forceFirstselectAllMiddlesforceMatchingLast forceLasts forceLast forceMiddlemakeEverythingLatermakeEverythingSooner substitute$fMergeLabelledPatch$fPatchInspectLabelledPatch$fCommuteLabelledPatch$fInvertLabelledPatch$fEq2LabelledPatch$fEq2PatchChoice$fMergePatchChoice$fPatchInspectPatchChoice$fCommutePatchChoice $fEqLabel BracketedFL Bracketed SingletonBracedParens unBracketed unBracketedFL mapBracketedmapBracketedFLFL$fPatchListFormatBracketedsentence formatText formatParas formatPara breakCommandchompTrailingNewlinequotepathlistshowCommandLine SshFilePathsshUhostsshReposshFile isRelative isAbsoluteisValidLocalPath isHttpUrlisSshUrl isSshNopath splitSshUrl sshFilePathOf setExecutable stdoutIsAPipewithSignalsHandledcatchNonSignalcatchInterrupt tryNonSignalwithSignalsBlocked$fExceptionSignalException$fShowSignalExceptioncatchall firstJustIO clarifyErrorsprettyException prettyErrordieSSHCmdSSHSCPSFTP SshSettingssshscpsftpwindows defaultSshcopySSHtransferModeHeadergetSSHenvironmentHelpSshenvironmentHelpScpenvironmentHelpSshPort$fShowSshSettings$fEqSshSettings AnchoredPathNameAbsoluteOrRemotePathAbsolutePathOrStdSubPath FilePathLike toFilePath FilePathOrURLtoPathFileNamefp2fnfn2fpfn2psps2fnsp2fn encodeWhite decodeWhiteencodeWhiteNamedecodeWhiteNameownName superName breakOnDirnormPathisParentOrEqOfmovedirfilename makeSubPathOf simpleSubPath isSubPathOf doesPathExist ioAbsolute makeAbsolute rootDirectorymakeAbsoluteOrStdstdOutioAbsoluteOrStduseAbsoluteOrStdioAbsoluteOrRemoteisRemotesetCurrentDirectoryisMaliciousPathisMaliciousSubPath filterPathsfilterFilePathsgetUniquePathName floatSubPathisPrefix appendPathcatPathsparentparents anchorPathflattenmakeName floatPath anchoredRootreplacePrefixPath appendToNameunsafeMakeName eqAnycase$fBinaryFileName$fShowFileName$fFilePathOrURLFileName$fFilePathLikeFileName $fShowSubPath$fFilePathLikeSubPath$fFilePathOrURLSubPath$fShowAbsolutePath$fFilePathLikeAbsolutePath$fFilePathOrURLAbsolutePath$fShowAbsolutePathOrStd$fShowAbsoluteOrRemotePath#$fFilePathOrURLAbsoluteOrRemotePath$fFilePathLike[]$fCharLikeChar$fFilePathOrURL[] $fEqFileName $fOrdFileName $fEqSubPath $fOrdSubPath$fEqAbsolutePath$fOrdAbsolutePath$fEqAbsolutePathOrStd$fOrdAbsolutePathOrStd$fEqAbsoluteOrRemotePath$fOrdAbsoluteOrRemotePath$fEqName $fShowName $fOrdName$fEqAnchoredPath$fShowAnchoredPath$fOrdAnchoredPath FilterTreeitemstreeHashItemTypeTreeTypeBlobTypeTreeItemSubTreeStubBlob listImmediateitemHashitemType emptyTree emptyBlobmakeBlob makeBlobBSmakeTreemakeTreeWithHashlookupfindfindFilefindTreelist expandUpdateexpand expandPath checkExpandrestrictreadBlobzipCommonFileszipFileszipTrees diffTrees modifyTreeupdateSubtrees updateTreepartiallyUpdateTreeoverlayaddMissingHashes$fFilterTreeTreem$fShowItemType $fEqItemType $fOrdItemTypeTreeRWcreateDirectoryunlinkrenamecopyTreeROcurrentDirectory withDirectoryexistsdirectoryExists fileExistsTreeIO TreeMonad TreeStatetree initialState runTreeMonadvirtualTreeMonad virtualTreeIO replaceItemfindM findTreeM findFileM $fTreeRORWST $fTreeRWRWST MonadProgressrunProgressActionsProgressActionpaAction paMessage paOnErrorsilentlyRunProgressActions$fMonadProgressRWSTdecodeDarcsHashdecodeDarcsSize darcsLocation darcsTreeHashdarcsUpdateHashesdarcsAddMissingHashesreadDarcsHashedDirreadDarcsHashedreadDarcsHashedNosizewriteDarcsHashed hashedTreeIOwithCurrentDirectory getFileStatusdoesDirectoryReallyExistremoveFileMayNotExist osxCacheDir xdgCacheDirgetRecursiveContentsgetRecursiveContentsFullPath readPlainTreewritePlainTreeIndex updateIndex listFileIDs readIndexupdateIndexFromindexFormatValid getFileIDalignxlate32xlate64$fFilterTreeIndexMIO $fShowItem canonFilename mkStdoutTemp maybeRelinksloppyAtomicCreate atomicCreate ExactVersion ListCommandsHelp ListOptionsNoTestTestOnlyChangesToFilesChangesToAllFilesTimingsDebug DebugHTTPToCcOutputOutputAutoNameMailSubject InReplyToCharset SendmailCmdAuthor SelectAuthor PatchNameOnePatch SeveralPatchOneHash AfterPatch UpToPatch AfterHashUpToHashTagNameLastNMaxCountPatchIndexRange 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 UseFormat2UseNoWorkingDir 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$fIsoFunctorRawOptSpecoptionsMarkdowntreeHasAnycasetreeHas treeHasDir treeHasFileSummOpSummAddSummRmSummMod SummDetail SummAddDir SummRmDirSummFileSummMvSummNone $fOrdSummOp $fEqSummOp$fOrdSummDetail$fEqSummDetail ReadPatch readPatch'readPatchPartial readPatch bracketedFLpeekfor $fReadPatchRL $fReadPatchFL$fReadPatchBracketed ObjectMap getObject putObject listObjectsObject Directory DirContentLocationLUUID FileContentisBlob isDirectory$fEqUUID $fOrdUUID $fShowUUID $fEqLocation$fShowLocationPatchModPTouch PCreateFile PCreateDirPRenamePRemovePInvalidPDuplicateTouchPatchIdPIDpatchIdFileIdcnamecount showFileId pid2stringshortzero$fBinaryFileId$fBinaryPatchId $fEqFileId $fShowFileId $fOrdFileId $fShowPatchId $fOrdPatchId $fEqPatchId$fShowPatchMod $fEqPatchMod$fFunctorPatchMod ApplyMonadApplyMonadBase nestedApply liftApply getApplyStateApplyMonadTreemDoesDirectoryExistmDoesFileExist mReadFilePSmCreateDirectorymRemoveDirectory mCreateFile mRemoveFilemRename mModifyFilePS mChangePrefApplyMonadStateApplyMonadStateOperationsApplyMonadTransApplyMonadOver runApplyMonadToTreetoTree withFileNames withFiles $fToTreeTree$fApplyMonadTreeRWST$fApplyMonadStateTree$fApplyMonadTreeRWST0$fApplyMonadTransTreem$fMonadProgressStateT$fApplyMonadTreeStateT$fApplyMonadTreeStateT0$fMonadProgressStateT0$fApplyMonadTreeStateT1$fApplyMonadTreeStateT2Apply ApplyStateapplyeffectOnFilePathsapplyToFilePaths applyToTree applyToStatemaybeApplyToTree $fApplyRL $fApplyFLselectTouchingdeselectNotTouchingselectNotTouchingchooseTouchingchoosePreTouching lookTouch ShowPatch showNicely descriptionsummary summaryFLthingthingsShowContextPatchshowContextPatchShowPatchBasic showPatch ShowPatchFor ForDisplay ForStorage displayPatchformatFileName PatchInfo_piDate_piName _piAuthor_piLog isInverted validDate validDatePSvalidLog validLogPS validAuthor validAuthorPS rawPatchInfo patchinfoaddJunk invertNamejustName justAuthorjustLogdisplayPatchInfopiNamepiRenamepiAuthorisTagpiDate piDateString setPiDatepiLogpiTagtoXml toXmlShort escapeXML makePatchname showPatchInfo readPatchInfo$fShowPatchInfo $fEqPatchInfo$fOrdPatchInfoIsHunkisHunkFileHunk showFileHunkshowContextHunk $fShowPatchRL$fShowContextPatchRL$fShowPatchBasicRL $fShowPatchFL$fShowContextPatchFL$fShowPatchBasicFL RepairToFLapplyAndTryToFixFLapplyAndTryToFixisInconsistent mapMaybeSnd $fCheckRL $fCheckFL $fRepairFL PrimApply applyPrimFLPrimReadreadPrimPrimShowshowPrim showPrimCtx PrimDetails summarizePrim PrimCanonize tryToShrinktryShrinkingInversesortCoalesceFLcanonize canonizeFLcoalesce PrimConstructaddfilermfileadddirrmdirmove changeprefhunk tokreplacebinary primFromHunk anIdentity PrimClassify primIsAddfile primIsRmfile primIsAdddir primIsRmdir primIsMove primIsHunkprimIsTokReplace primIsBinary primIsSetpref is_filepatch FromPrims fromPrims ToFromPrimtoPrimFromPrimfromPrim PrimPatchBasePrimOf PrimPatchPrimPatchCommon$fPrimPatchBaseRL$fPrimPatchBaseFL $fFromPrimsRL $fFromPrimsFL $fFromPrimFL DirPatchTypeRmDirAddDir FilePatchTypeRmFileAddFileHunk TokReplaceBinaryPrimMoveDPFP ChangePref isIdentity comparePrim$fEq2FilePatchType$fEq2DirPatchType$fEqPrim $fEq2Prim$fPatchDebugPrim$fPatchInspectPrim $fInvertPrim $fIsHunkPrim$fPrimConstructPrim$fPrimClassifyPrim$fEqFilePatchType$fOrdFilePatchType$fEqDirPatchType$fOrdDirPatchType$fPrimReadPrim$fPrimDetailsPrimshowHunk$fPrimShowPrim$fShowDirPatchType$fShowFilePatchType $fShow1Prim $fShow2Prim $fShowPrimCommuteFunctionPerhapsUnknownFailed Succeeded toPerhaps cleverCommute speedyCommutecommuteFiledircommuteFilepatches $fCommutePrim$fMonadPlusPerhaps$fAlternativePerhaps$fMonadPerhaps$fApplicativePerhaps$fFunctorPerhaps$fPrimCanonizePrim $fShowSimple$fPrimApplyPrim$fRepairToFLPrim $fApplyPrim$fPrimPatchCommonPrimHunkMoveManifest DemanifestIdentityHMH $fEq2Hunk $fShow2Hunk $fShow1Hunk $fEq2HunkMove$fEqHunk $fShowHunk $fEqHunkMove$fShowHunkMove$fReadPatchPrim RepoPatchV1PPMergerRegremisMerger mergerUndo$fPatchDebugRepoPatchV1$fCheckRepoPatchV1$fPatchListFormatRepoPatchV1$fFromPrimRepoPatchV1$fPrimPatchBaseRepoPatchV1$fShow2RepoPatchV1$fShow1RepoPatchV1$fShowRepoPatchV1 showPatch_$fShowPatchBasicRepoPatchV1Splitter applySplitter canonizeSplit rawSplitter noSplitter primSplitterreversePrimSplitterEffecteffecteffectRL $fEffectRL $fEffectFLNonablenonNonunNonshowNonsshowNonreadNonsreadNoncommuteOrAddToCtxcommuteOrAddToCtxRLcommutePrimsOrAddToCtxremNonscommuteOrRemFromCtxcommuteOrRemFromCtxFL>**>>>>*$fEqNon $fShow1Non $fShowNon$fWLRL$fWLFL$fShowPatchBasicBracketed$fFromPrimBracketed$fEffectBracketed$fPrimPatchBaseBracketed ConflictStateOkay Conflicted DuplicatedIsConflictedPrimIsCCommuteNoConflictscommuteNoConflictsConflictresolveConflictsconflictedEffectlistConflictedFilesmangleUnravelled$fCommuteNoConflictsRL$fCommuteNoConflictsFL$fShowIsConflictedPrim $fConflictRL $fConflictFL$fEqConflictState$fOrdConflictState$fShowConflictState$fReadConflictState publicUnravelunravelmerger$fEqRepoPatchV1$fEq2RepoPatchV1$fInvertRepoPatchV1$fIsHunkRepoPatchV1$fEffectRepoPatchV1$fConflictRepoPatchV1$fCommuteNoConflictsRepoPatchV1$fPatchInspectRepoPatchV1$fCommuteRepoPatchV1$fMergeRepoPatchV1$fReadPatchRepoPatchV1plainSummaryPrimplainSummaryPrims plainSummary xmlSummary$fOrdSummChunk $fEqSummChunk displayHunk$fShowPatchPrim$fShowContextPatchPrim$fShowPatchBasicPrim$fPatchListFormatPrimhunkEdit$fApplyMonadTransObjectMapm$fApplyMonadObjectMapStateT$fToTreeObjectMap$fApplyMonadObjectMapStateT0$fApplyMonadStateObjectMap$fFromPrimPrim$fPrimPatchBasePrim$fPrimPatchPrimNamedNamedP namepatch anonymous infopatchadddepsgetdepspatch2patchinfo patchname patchcontents fmapNamed fmapFL_NamedcommuterIdNamedcommuterNamedId mergerIdNamed$fPatchDebugNamed $fShow2Named $fShow1Named$fShowContextPatchNamed$fShowPatchBasicNamed $fCheckNamed$fConflictNamed$fPatchInspectNamed $fMergeNamed$fCommuteNamed $fInvertNamed $fEq2Named $fRepairNamed $fApplyNamed$fReadPatchNamed$fPatchListFormatNamed $fIsHunkNamed $fEffectNamed$fPrimPatchBaseNamed$fShowPatchNamed $fShowNamed$fEqShowDepsFormat RebaseNameAddNameDelNameRenamecommuteNamePrimcommutePrimNamecommuteNameNamedcommuteNamedNamecanonizeNamePair$fEq2RebaseName$fEffectRebaseName$fPrimPatchBaseRebaseName$fApplyRebaseName$fPatchInspectRebaseName$fInvertRebaseName$fCommuteRebaseName$fReadPatchRebaseName$fShowPatchRebaseName$fShowPatchBasicRebaseName$fShow2RebaseName$fShow1RebaseName$fShowRebaseName RebaseFixup PrimFixup NameFixup namedToFixupsflToNamesPrimscommuteNamedFixupcommuteNamedFixupscommuteFixupNamed$fCommuteRebaseFixup$fPatchInspectRebaseFixup$fInvertRebaseFixup$fEq2RebaseFixup$fEffectRebaseFixup$fApplyRebaseFixup$fPrimPatchBaseRebaseFixup$fShow2RebaseFixup$fShow1RebaseFixup$fShowRebaseFixup RebaseItemToEditFixup countToEdit simplifyPushsimplifyPushes$fPatchInspectRebaseItem$fCheckRebaseItem$fReadPatchRebaseItem$fShowPatchRebaseItem$fShowPatchBasicRebaseItem$fShow2RebaseItem$fShow1RebaseItem$fShowRebaseItem SuspendedItemsaddFixupsToSuspendedremoveFixupsFromSuspended$fRepairToFLSuspended$fCheckSuspended$fReadPatchSuspended$fPrimPatchBaseSuspended$fShowPatchSuspended$fShowPatchBasicSuspended$fApplySuspended$fConflictSuspended$fEffectSuspended$fPatchInspectSuspended$fShow2Suspended$fShow1Suspended$fRepairInternalFLRebaseFixup$fRepairInternalFLRebaseItem$fRepairInternalFL$fRepairSuspended$fShowSuspendedrunInternalChecker:~~:ReflRebaseType:~: ReflPatch WrappedNamedNormalPRebasePfmapFL_WrappedNamedactivecontentsmkRebase toRebasing fromRebasinggeneraliseRepoTypeWrappednamedInternalCheckernamedIsInternalremoveInternalFL$fMergeWrappedNamed$fCommuteWrappedNamed$fEffectWrappedNamed$fApplyWrappedNamed$fCheckWrappedNamed$fConflictWrappedNamed$fRepairWrappedNamed$fPatchInspectWrappedNamed$fShowPatchWrappedNamed$fShowContextPatchWrappedNamed$fShowPatchBasicWrappedNamed$fIsHunkWrappedNamed$fPatchListFormatWrappedNamed$fInvertWrappedNamed$fPrimPatchBaseWrappedNamed$fShow2WrappedNamed$fShow1WrappedNamed$fReadPatchReadRebasing$fPatchListFormatReadRebasing$fReadPatchWrappedNamed$fShowWrappedNamed WPatchInfo unWPatchInfo PatchInfoAndPIAPSimpleHopefullyActually Unavailable HopefullycompareWPatchInfoinfo patchDescwinfopiapn2piapatchInfoAndPatch fmapFLPIAPgeneraliseRepoTypePIAP hopefullyconscientiously hopefullyMactually createHashed extractHash unavailable$fPatchDebugPatchInfoAnd$fIsHunkPatchInfoAnd$fEffectPatchInfoAnd$fReadPatchPatchInfoAnd$fRepairPatchInfoAnd$fApplyPatchInfoAnd$fPatchInspectPatchInfoAnd$fMergePatchInfoAnd$fCommutePatchInfoAnd$fShowPatchPatchInfoAnd$fShowContextPatchPatchInfoAnd$fShowPatchBasicPatchInfoAnd$fPatchListFormatPatchInfoAnd$fInvertPatchInfoAnd$fEq2PatchInfoAnd$fPrimPatchBasePatchInfoAnd$fShow2PatchInfoAnd$fShow1PatchInfoAnd$fEq2WPatchInfo$fShowSimpleHopefully$fShowHopefully$fShowPatchInfoAndTaggedPatchSetSealedPatchSetOrigin emptyPatchSet patchSet2RL patchSet2FL appendPSFLprogressPatchSettags patchSetfMap $fShow2Tagged $fShow1Tagged$fShow2PatchSet$fShow1PatchSet $fShowTagged$fShowPatchSet takeAnyRebasetakeAnyRebaseAndTrailingPatches dropAnyRebasetakeHeadRebasetakeHeadRebaseFL progressFL progressRLprogressRLShowTags MatchableWDDNamedWithDroppedDepswddPatch wddDependedOn RebaseChangeRCFwdRCRev RebaseSelectRSFwdRSRevrsToPiafromRebaseSelecttoRebaseSelecttoRebaseChangespartitionUnconflicted commuterIdWDDextractRebaseSelectreifyRebaseSelect$fPatchInspectRebaseSelect$fCommuteRebaseSelect$fEq2RebaseSelect$fInvertRebaseSelect$fReadPatchRebaseSelect$fShowPatchRebaseSelect$fShowContextPatchRebaseSelect$fShowPatchBasicRebaseSelect$fEffectRebaseSelect$fConflictRebaseSelect$fApplyRebaseSelect$fPatchDebugRebaseSelect$fPrimPatchBaseRebaseSelect$fShow2RebaseSelect$fShow1RebaseSelect$fShowRebaseSelect$fMatchableRebaseChange$fPatchListFormatRebaseChange$fIsHunkRebaseChange $fCommuteNoConflictsRebaseChange$fPatchInspectRebaseChange$fCommuteRebaseChange$fInvertRebaseChange$fPrimPatchBaseRebaseChange$fReadPatchRebaseChange$fShowContextPatchRebaseChange$fShowPatchRebaseChange$fShowPatchBasicRebaseChange$fEffectRebaseChange$fApplyRebaseChange$fPatchDebugRebaseChange$fShowRebaseChange$fShow2RebaseChange$fShow1RebaseChange$fConflictRebaseChange$fEffectWithDroppedDeps$fPrimPatchBaseWithDroppedDeps withPatchMods makePatchIDapplyToFileMods$fApplyMonadTreeFileModMonad$fApplyMonadTreeFileModMonad0$fFunctorFileModMonad$fApplicativeFileModMonad$fMonadFileModMonad$fMonadStateFileModMonad applyPatchesAnnotateannotateAnnotateResult annotateFileannotateDirectory machineFormatformat$fAnnotatePatchInfoAnd$fAnnotateWrappedNamed$fAnnotateNamed $fAnnotateFL$fAnnotatePrim$fAnnotatePrim0$fShowFileOrDirectory$fEqFileOrDirectory$fShowAnnotated RepoPatchV2 Duplicate EtacilpudNormal Conflictor InvConflictor isDuplicate isForwardmergeUnravelled isConsistent$fIsHunkRepoPatchV2$fEffectRepoPatchV2$fNonableRepoPatchV2$fShow2RepoPatchV2$fShow1RepoPatchV2$fShowRepoPatchV2$fReadPatchRepoPatchV2$fShowPatchRepoPatchV2$fShowContextPatchRepoPatchV2$fShowPatchBasicRepoPatchV2$fPatchListFormatRepoPatchV2$fAnnotateRepoPatchV2$fRepairToFLRepoPatchV2$fApplyRepoPatchV2$fPatchInspectRepoPatchV2$fCommuteRepoPatchV2$fInvertRepoPatchV2$fEq2RepoPatchV2$fToFromPrimRepoPatchV2$fFromPrimRepoPatchV2$fCheckRepoPatchV2$fCommuteNoConflictsRepoPatchV2$fConflictRepoPatchV2$fPatchDebugRepoPatchV2$fPrimPatchBaseRepoPatchV2$fMergeRepoPatchV2unPrim$fToFromPrimPrim$fAnnotateRepoPatchV1$fRepairToFLRepoPatchV1$fApplyRepoPatchV1$fShowPatchRepoPatchV1$fShowContextPatchRepoPatchV1 RepoPatch$fRepoPatchRepoPatchV2$fMatchableRepoPatchV2$fRepoPatchRepoPatchV1$fMatchableRepoPatchV1 SPatchAndDepsgetDepsgetPatchesBeyondTag splitOnTag getUncoveredslightlyOptimizePatchsetremoveFromPatchSetfindCommonAndUncommonfindCommonWithThem findUncommon countUsThem mergeThempatchSetIntersection patchSetUnionmerge2FLareUnrelatedRepos makeBundleN scanBundlecontextPatchesscanContextFile minContext patchFilename DummyPatch$fPrimPatchCommonDummyPrim$fPatchDebugDummyPrim$fShow2DummyPrim$fPrimPatchDummyPrim$fPrimApplyDummyPrim$fPrimReadDummyPrim$fPrimShowDummyPrim$fPrimDetailsDummyPrim$fPrimClassifyDummyPrim$fPrimCanonizeDummyPrim$fPrimConstructDummyPrim$fRepairToFLDummyPrim$fApplyDummyPrim$fCommuteDummyPrim$fShowContextPatchDummyPrim$fShowPatchDummyPrim$fShowPatchBasicDummyPrim$fReadPatchDummyPrim$fPatchInspectDummyPrim$fInvertDummyPrim$fEq2DummyPrim$fPatchListFormatDummyPrim$fIsHunkDummyPrim$fPatchDebugDummyPatch$fRepoPatchDummyPatch$fPrimPatchBaseDummyPatch$fRepairToFLDummyPatch$fCheckDummyPatch$fCommuteNoConflictsDummyPatch$fFromPrimDummyPatch$fConflictDummyPatch$fMergeDummyPatch$fEffectDummyPatch$fAnnotateDummyPatch$fMatchableDummyPatch$fApplyDummyPatch$fCommuteDummyPatch$fShow2DummyPatch$fShowContextPatchDummyPatch$fShowPatchDummyPatch$fShowPatchBasicDummyPatch$fReadPatchDummyPatch$fPatchInspectDummyPatch$fInvertDummyPatch$fEq2DummyPatch$fPatchListFormatDummyPatch$fIsHunkDummyPatchInclusiveOrExclusive Inclusive Exclusive MatchFlagaddInternalMatcher matchParserhelpOnMatchershaveNonrangeMatchhaveNonrangeExplicitMatchhavePatchsetMatchgetNonrangeMatchS firstMatchgetFirstMatchS secondMatchcheckMatchSyntaxnonrangeMatchernonrangeMatcherIsTag matchAPatch matchPatch hasIndexRangematchFirstPatchsetmatchSecondPatchset splitSecondFLmatchAPatchsetgetMatchingTag matchExistsapplyInvToMatcher applyNInv $fShowMatcher$fShowMatchFlag$fEqInclusiveOrExclusive$fEqIncludeInternalPatches matchUpToOnematchOneContextmatchOneNontag matchSeveral matchLastmatchSeveralOrFirstmatchSeveralOrLast matchRangematchSeveralOrRange matchFrommatchAnycontext GzcrcsAction GzcrcsCheck GzcrcsRepair TestStrategy ChangesFormatGenXml CountPatchesNetworkOptionsnoHttpPipelining 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 anyVerbosityhookspreHookpostHookuseCache xmlOutputdryRun dryRunXmlpipe interactive pauseForGuiaskDeps selectDepschangesReverseworkReporepoDirreponamepossiblyRemoteRepo remoteReposnotInRemoteFlagName notInRemoterepoCombinatorallowUnrelatedRepos justThisRepowithWorkingDir setDefaultauthoraskLongCommentkeepDatelogfilelookfor lookforaddslookforreplaces lookformovesuseIndex includeBoringallowProblematicFilenamesallowCaseDifferingFilenamesallowWindowsReservedFilenames onlyToFiles recursive diffAlgorithm withContextextDiff testChangesrunTest leaveTestDir headerFields sendToContextsendmail sendmailCmdminimizecharseteditDescriptionccApplyreplyhappyForwardingapplyAssignverify conflictsNo conflictsYes externalMergecompressusePacks patchIndexNo patchIndexYes storeInMemoryoutput maybeSummarynetworkumasksetScriptsExecutable restrictPaths amendUnrecord selectAuthormachineReadable cloneKindmarks readMarks writeMarkshashed patchFormatdistnamedistzip changesFormattokens forceReplace testStrategyfiles directoriespendingnullFlag enumPatches gzcrcsActionssiblingsreorderoptimizePatchIndex$fYesNoWithWorkingDir$fYesNoWantGuiPause$fYesNoUseIndex$fYesNoLeaveTestDir$fYesNoSetScriptsExecutable$fYesNoRunTest$fYesNoIncludeBoring$fYesNoLookForMoves$fYesNoLookForReplaces$fYesNoLookForAdds $fYesNoDryRun$fYesNoUseCache$fYesNoReorder$fYesNoWithPatchIndex$fYesNoCompression$fYesNoEnumPatches$fYesNoXmlOutput$fYesNoWithContext$fYesNoSummary$fEqEnumPatches$fShowEnumPatches$fEqRootAction$fShowRootAction$fEqStdCmdAction$fShowStdCmdAction $fEqXmlOutput$fShowXmlOutput$fEqSelectDeps$fShowSelectDeps$fEqRepoCombinator$fShowRepoCombinator$fEqAskLongComment$fShowAskLongComment$fEqWithContext$fShowWithContext$fEqExternalDiff$fShowExternalDiff$fEqTestChanges$fEqSign $fShowSign $fEqVerify $fShowVerify $fEqOutput $fShowOutput $fEqSummary $fShowSummary$fEqChangesFormat$fShowChangesFormat$fEqTestStrategy$fShowTestStrategy$fEqGzcrcsAction$fShowGzcrcsActionoptDescrwithLockwithLockCanFailenvironmentHelpLockswithTemp withOpenTempwithStdoutTemp tempdirLocenvironmentHelpTmpdirenvironmentHelpKeepTmpdir withPermDir withTempDirwithDelayedDir rmRecursive withNamedTemp readBinFile readTextFilereadDocBinFile appendBinFileappendTextFileappendDocBinFile writeBinFile writeTextFilewriteDocBinFilewriteAtomicFilePSgzWriteAtomicFilePSgzWriteAtomicFilePSsgzWriteDocFile addToErrorLocwithNewDirectory sendmailPath diffProgram darcsProgrampipeDoc pipeDocSSH sendEmail generateEmail haveSendmail sendEmailDoc resendEmail execDocPipeexecPipeIgnoreError signStringverifyPSviewDoc viewDocWitheditTexteditFilesetDarcsEncodingsgetSystemEncoding isUTF8Locale printFriendly showFriendly printPatchprintPatchPagercontextualPrintPatchmaxPipelineLength copyUrlFirstcopyUrlwaitUrldisableHTTPPipelining setDebugHTTPenvironmentHelpProxyenvironmentHelpProxyPassword copyFileOrUrl cloneTree cloneFilebackupByRenamingbackupByCopying fetchFilePSfetchFileLazyPS gzFetchFilePSspeculateFileOrUrl readOldRepooldRepoFailMsg RepoFormatRF RepoPropertyDarcs1Darcs2HashedInventoryRebaseInProgress UnknownFormat formatHas addToFormatremoveFromFormatidentifyRepoFormattryIdentifyRepoFormatwriteRepoFormatcreateRepoFormat writeProblemtransferProblem readProblem$fShowRepoProperty$fShowRepoFormat$fEqRepoPropertyCacheCaCacheLoc cacheType cacheWritable cacheSource CacheTypeRepo WritableOrNotWritable NotWritable HashedDirHashedPristineDirHashedPatchesDirHashedInventoriesDir hashedDir allHashedDirs unionCachesunionRemoteCachescompareByLocality repo2cache cacheHashokayHashfetchFileUsingCachewritable isThisRepo bucketFolderhashedFilePath peekInCachespeculateFileUsingCachespeculateFilesUsingCachewriteFileUsingCache cleanCachescleanCachesWithHintreportBadSources$fShowCacheLoc $fEqCacheLoc $fShowCache$fEqWritableOrNot$fShowWritableOrNot $fEqCacheType$fShowCacheType$fEqOrOnlySpeculate $fEqFromWhereFileType BinaryFileTextFilewriteDefaultPrefsdarcsdirFilterglobalPrefsDirglobalPrefsDirDocenvironmentHelpHome getGlobalglobalCacheDir boringRegexpsboringFileFilterfiletypeFunction addToPreflist getPreflist setPreflist defPrefval getPrefval setPrefval changePrefval defaultrepogetDefaultRepoPath addRepoSource deleteSources getCachesgetMotdshowMotdprefsUrl prefsDirPathprefsFilesHelp $fEqFileTypeverbosequietenumeratePatches scanKnown diffingOpts wantGuiPause isInteractivewillRemoveLogFile lookForAddslookForReplaces lookForMovesallowConflictsfixRemoteReposfixUrlmaybeFixSubPaths fixSubPaths getRepourlfileHelpAuthorenvironmentHelpEmail getAuthor promptAuthor getEasyAuthorgetDateenvironmentHelpSendmailgetSendmailCmd getOutput getSubjectgetCc getInReplyTo hasXmlOutput hasLogfile checkPathsmaliciousPatcheshasMaliciousPathtreeDiffstandardResolutionexternalResolutionpatchsetConflictResolutions DefaultIO runTolerantly runSilently runDefault$fApplyMonadTreeDefaultIO$fApplyMonadTreeDefaultIO0$fMonadProgressDefaultIO$fTolerantMonadTolerantIO$fTolerantMonadSilentIO$fApplyMonadTreeTolerantWrapper $fApplyMonadTreeTolerantWrapper0$fFunctorDefaultIO$fApplicativeDefaultIO$fMonadDefaultIO$fFunctorTolerantIO$fApplicativeTolerantIO$fMonadTolerantIO$fFunctorSilentIO$fApplicativeSilentIO$fMonadSilentIO$fFunctorTolerantWrapper$fApplicativeTolerantWrapper$fMonadTolerantWrapper$fTolerantMonadTolerantWrapperInventoryEntry InventoryinventoryParentinventoryPatches HeadInventory PristineHash PatchHash InventoryHash ValidHash getValidHash mkValidHashinventoryPatchNamesemptyInventoryparseInventory showInventoryshowInventoryPatchesshowInventoryEntrypokePristineHashpeekPristineHashskipPristineHash pristineNameprop_inventoryParseShowprop_peekPokePristineHashprop_skipPokePristineHash$fValidHashInventoryHash$fValidHashPatchHash$fValidHashPristineHash$fEqInventoryHash$fShowInventoryHash $fEqPatchHash$fShowPatchHash$fEqPristineHash$fShowPristineHash $fEqInventory$fShowInventory Repository PristineType NoPristine PlainPristineHashedPristine repoLocationwithRepoLocation repoFormatrepoPristineType repoCache modifyCache repoPatchTypecoerceRcoerceUcoerceTmkRepo$fShowPristineType$fEqPristineType$fShowRepository PatchFilterdoesPatchIndexExistisPatchIndexDisabledcreateOrUpdatePatchIndexDiskcanUsePatchIndexcreatePIWithInterruptisPatchIndexInSyncdeletePatchIndexattemptCreatePatchIndexgetRelevantSubsequencemaybeFilterPatchesdumpPatchIndexpiTest$fShowFileIdSpan$fEqFileIdSpan$fOrdFileIdSpan$fShowFilePathSpan$fEqFilePathSpan$fOrdFilePathSpan$fShowFileInfo $fEqFileInfo $fOrdFileInfo copyHashedpathsAndContentscopyPartialsHashed cleanHashdirgetHashedFiles $fEqObjType pendingName readPendingsiftForPendingtentativelyRemoveFromPendingmakeNewPendingfinalizePendingtentativelyAddToPendingsetTentativePendingprepend$fShowPatchBasicFLM$fReadPatchFLM TreeFilterapplyTreeFilterrestrictSubpathsmaybeRestrictSubpathsrestrictBoringrestrictDarcsdirunrecordedChangesreadPendingAndWorking readRecordedreadUnrecordedreadUnrecordedFiltered readWorkingreadRecordedAndPendinginvalidateIndexfilterOutConflictsaddPendingDiffToPending addToPendingapplyToWorkingsetScriptsExecutablePatches IdentifyRepo BadRepository NonRepositoryGoodRepositorymaybeIdentifyRepositoryidentifyRepositoryidentifyRepositoryForamInRepositoryamInHashedRepositoryseekRepoamNotInRepositoryfindRepositoryfindAllReposInDirUpdatePristineDontUpdatePristineDontUpdatePristineNorReverthashedInventoryhashedInventoryPathinventoriesDirinventoriesDirPath pristineDirpristineDirPath patchesDirpatchesDirPathrevertTentativeChangesfinalizeTentativeChangesreadHashedPristineRoot cleanPristinefilterDirContents diffHashListscleanInventories cleanPatchesaddToTentativeInventoryreadRepoHashedreadTentativeRepocopyHashedInventorywriteAndReadPatchwriteTentativeInventorylistInventorieslistInventoriesLocallistInventoriesRepoDirlistPatchesLocalBucketed copyPristinecopyPartialsPristine unrevertUrltentativelyAddPatchtentativelyAddPatches_tentativelyAddPatch_applyToTentativePristineapplyToTentativePristineCwdtentativelyRemovePatchestentativelyRemovePatches_tentativelyReplacePatchesfinalizeRepositoryChangesrevertRepositoryChangescleanRepositorycreatePristineDirectoryTree#createPartialsPristineDirectoryTree withRecorded withTentativereorderInventoryreadReporepoXor$fEqUpdatePristinegetTest runPosthook runPrehook testTentativeRepositoryConsistencyRepositoryConsistentBrokenPristine BrokenPatchesreplayRepositoryInTempreplayRepository checkIndexRebaseJobFlagsrjoCompression rjoVerbosityrjoUpdateWorkingwithManualRebaseUpdate rebaseJobstartRebaseJobmaybeDisplaySuspendedStatuspacksDirfetchAndUnpackPatchesfetchAndUnpackBasic createPackstentativelyMergePatchesconsiderMergeToWorkingannounceMergeConflicts$fEqMakeChangesgetNonrangeMatchgetOnePatchsetIsPrimV1toPrimV1RepoJobV1JobV2Job PrimV1JobRebaseAwareJob RebaseJobStartRebaseJob withUMaskFlagwithRepositorywithRepositoryLocation withRepoLockwithOldRepoLockwithRepoLockCanFailcheckRepoIsNoRebase$fIsPrimV1Prim$fIsPrimV1Prim0fileArgsunknownFileArgs knownFileArgsmodifiedFileArgsprefArgsnoArgsEmptyRepositorycreateRepositorycreateRepositoryV1createRepositoryV2 writePristinecloneRepository writePatchSetreplacePristineKeyPresskpkpHelpInteractiveSelectionMInteractiveSelectionContextISCtotalcurrentlpschoicesPatchSelectionContext allowSkipAllPatchSelectionOptions matchFlags WhichChangesLast LastReversedFirst FirstReversedselectionContextPrimselectionContextselectionContextGeneric runSelection viewChangeshelpForkeysForwithSelectedPatchFromRepo currentPatch currentFiledecidedecideWholeFileskipOnebackOne printSummarybackAll isSingleFile promptUsershowCur skipMundaneaskAboutDepends$fEqWhichChanges$fShowWhichChanges AskAboutDepsNoAskAboutDepsHijackT HijackOptions IgnoreHijackRequestHijackPermissionAlwaysRequestHijackPermissiongetLog runHijackTupdatePatchHeader announceFilestestTentativeAndMaybeExitprintDryRunMessageAndExitfilterExistingPathsgetUniqueRepositoryNamegetUniqueDPatchName expandDirscheckUnrelatedReposrepoTags CommandArgs CommandOnlySuperCommandOnlySuperCommandSub DarcsCommand SuperCommandcommandProgramName commandName commandHelpcommandDescriptioncommandExtraArgscommandExtraArgHelpcommandCommand commandPrereqcommandCompleteArgscommandArgdefaultscommandBasicOptionscommandAdvancedOptionscommandDefaultscommandCheckOptionscommandParseOptionscommandSubCommandsCommandControl CommandData HiddenCommand GroupNameWrappedCommandextractCommandsextractAllCommands normalCommand hiddenCommand commandGroupwrappedCommandNamewrappedCommandDescription withStdOptscommandAlloptionscommandOptions nodefaultsgetSubcommands commandAlias commandStubdisambiguateCommands putVerboseputInfo putWarningputVerboseWarningabortRunsetEnvDarcsPatchessetEnvDarcsFiles defaultRepo formatOptionsusagesubusagegetCommandMiniHelpgetCommandHelpwhatsnewstatusunrevert writeUnrevertunrecordgetLastPatchesunpull obliterate matchingHead transferModetest$fShowBisectDirtagshowTagsshowReposhowPatchIndex showIndexshowPristineCmd showFilesshowDeps showContentsSpelling showAuthors rankAuthorscanonizeAuthorcompiledAuthorSpellings showCommandsetprefrollbackrevertreplacerepaircheckremovermunadd RecordConfig_workingRepoDirsse recordConfigrecordcommitpushoptimizemv$fShowFileKind $fEqFileKind$fShowFileStatus markconflicts$fTraversableOnly$fFoldableOnly $fFunctorOnly$fEqOnly $fOrdOnly $fShowOnlylog getLogInfo changelogchanges initialize initializeCmd doCRCWarningsgzcrcsdist doFastZip doFastZip' diffCommand getDiffDocconvert $fShowState $fShowRefId$fShowCopyRenameNames $fShowObjectclonegetput cloneToSSH makeRepoNameamend amendrecordaddStandardPatchApplier PatchApplierApplierRepoTypeConstraintrepoJob PatchProxy"$fPatchApplierStandardPatchApplierfetchpullpullCmd fetchPatches revertableapplyCmdgetPatchBundlerebase $fPatchApplierRebasePatchApplierfetchUrlpostUrl requestUrl waitNextUrlsendcommandControlList applyDefaults runTheCommandhelpCmdlistAvailableCommands printVersionenvironmentHelpsingletonRebaseType unescapeCharsnormalRegChars breakOutTokenFTableData.ByteString.Internal ByteStringmarkColldiffArrcmpseqfindDiagfindOne findSnake findOneRev findSnakeRev nextUnchangedskipOneUnChangednextUnchangedN nextChanged prevUnchangedlcus patientLcslcsSM ParserStatework peekInputmyLexlinesStartingWith'linesStartingWithEndingWith' alterInputstupleunsafeWithInternalsQold-time-1.1.0.3-856d8d7ed6c070e3f52a85d3a368fd9173eb457af389571e558cfbd574411b00 System.Time CalendarTimereadDatedateTimecaseCharparsec-3.1.13.0Text.Parsec.Char caseStringmanyNmanyNtoM cvsDateTimeiso8601DateTime oldDateTimerfc2822DateTime iso8601Date iso8601TimeoptchainmySpacesdayNameyearmonthNum intToMonth monthNamedayhourminutesecondzone englishDate englishTime englishAgoenglishDuration theBeginning multiplyDiff copyCalendar withinDay dateRange cDateRangewithinsamePartialDate tryMatchers testDateAtCal showMatcherDocumentStspacePnewlinePhPrintPrintableshPrintPrintable renderWithsimplePrinters'appendvplusqEncodePolicypoColorpoEscape poLineColor poAltColor poIsprintpo8bitpoNoEscXpoEscX poTrailingpoCRpoSpace getPolicylineColorTransescapenoEscapeisPrintableAscii quoteChar markEscapecolor makeAsciiart resetColor withColorsetColormakeBold makeInvert _progressDatacurl_pipelining_enabledcurl_enable_debug curl_last_urlcurl_wait_next_urlcurl_request_urlpipeliningEnabled cachableToIntSteppedPoly PatchChoicepcPatch _pcIsLast pcSetLast pushLastspcsMiddleLastsforceMatchingMiddleOrLastcatch firstJustMRepoId Connection detectSshsshConnectionsGHC.MVarMVargetSshConnectionnewSshConnectiondropSshConnectionord simpleClean pathToPosix normSlashes sortedUnion modifyItem flushSomereadDarcsHashed'fsCreateHashedFilenextFresitemF_fileIDschangednexttreeitemresitemItem createItempeekItem updateItem mmapIndexSingleArgOptDescr switchNames rawUnparserawParsedefHeadaddDefaultHelpmultiArgtrackOrigRenamevalidCharForDate readPatchDatemetadataToStringstorePatchInfo readBinary coalesceFwd shrinkABittryOnesortCoalesceFL2pushCoalescePatchWL mergerCommute actualMerge SummChunk dropRebaseRLtakeHeadRebaseRL pushThroughforceCommuteNameCommonRLCommonmergeAfterConflicting allNormal pullCommon pullCommonRLtaggedIntersectionmaybeSplitSetOnTagunwrapOneTagged fastRemoveFL fastRemoveRL hashBundle makeBundle2filterGpgDashesunavailablePatches piUnavailable getContext-:- getPatchessillyLexMatcherMatchFun applyMatcher strictJust firstMatcherhasLastndropn findAPatch applyInvpsafetakeprimitiveMatchersindexindexeswithDir PipeToSsh PipeToOtherget_system_encoding ortryrunningGHC.IO.EncodinggetFileSystemEncodingsetLocaleEncodingcheckWaitToStart makeFilename darcs1Format darcs2FormathashedInventoryFormat findProblemsisKnownhashedFilePathReadOnlycopyFileUsingCachecheckCacheReachabilityfilterBadSources checkHashedInventoryReachabilityfetchFileUsingCachePrivatewritetryMakeBoringRegexpdefaultBinariesexternallyResolveFile PatchIndexpidsInfoMap FilePathSpans FileIdSpansFileInfoversionapplyPatchModscreateFidStartSpan startFpSpan stopFpSpan startFidSpan stopFidSpan createInfo insertTouch lookupFid lookupFid' lookupFidf' lookupFids lookupFids'createPatchIndexDiskpatches2patchModsfpSpans2fileNamesremovePidSuffixupdatePatchIndexDiskcreatePatchIndexFromloadPatchIndexloadSafePatchIndexstorePatchIndexfpSpans2filePathsfpSpans2filePaths' canCreatePI readHashFilegetareadTentativePendingreadNewPendingreadPendingFilewriteTentativePendingwriteNewPending crudeSiftisSimplerestrictSubpathsAfter inDarcsDirfilteredWorkingworkDirLessRepoWitnessgetMoves getReplacessetScriptsExecutable_ DirLayout PlainLayoutBucketedLayoutapplyToHashedPristinespecialPatchesaddToSpecificInventoryremoveFromTentativeInventory writeHashFilereadRepoUsingSpecificInventoryreadRepoFromInventoryListreadInventoryPrivatelistInventoriesWithreadInventoryLocalPrivatelistPatchesLocalmisplacedPatchesfetchFilesUsingCachevoid UsesPrimV1IsTree RepoPatchTypehaveknownnew notYetListed dropNonReposfetchPatchesIfNecessaryMatchCriterionbackwardreversedtriviswantedwspfr liftChoicesjustDone textSelecttodo modifyChoices postponeNext splitCurrentreprselected printSelectedskipAll textSelectOnetextView getDefaultrunInteractiveinteractiveHunksgenericObliterateCmd remotePatches BisectState BisectDir PatchTreeStrategyoneTest trackLinear trackBackoff trackBisectpatchTreeFromRL patchTree2RLtrackNextBisecttrackNextBackoff validPrefDataisTok chooseToks filenameToks replaceHelpmakeRemovePatch makeRemoveGapcheckNameIsNotOptionShadowmoveFile fileStatusPathSet EverythingOnlyfromOnly isectPathSetsps2psfps2psps2fps showPathSet liftToPathSetfp2spsp2fpfilterPatchesByNamesdoDistgetDiffCmdAndArgsW3W2 convertHelp'unescapeaddFilessendSanitizedEmailweakhashPostSendMail OptionMapCmdName mkCmdName showCmdNameSuperCmd parseDefaultsparseDefaultsLines defaultToFlagoptionSwitches optionMapallOptionSwitchesgetPosthookDirextraArgumentsError unwrapTree completeArgs manpageLines