pristine:0000000934-ad118feade239c62b229ed661b506cb3de1a097c3c50b06853b147ddd9cd88ed Starting with inventory: 0000001159-05c47e5e71f25076ed066786d674dbcbd0bf58b35a34eaa2ae464bee32666074 [TAG 0.5.2 Petr Rockai **20100606142514 Ignore-this: a9de3225cfe82d441dbf1ae823763caa ] hash: 0000000758-3122031a140e9dd56214d4db6d098baf2f7a746b6cb7602add6e8e9446f71a2b [Avoid (?) function within Storage.Hashed.Utils. Eric Kow **20090527114122 Ignore-this: 6120f35b754885f490a1337fa2a636a3 ] hash: 0000000268-afa6943493bec626a12cb790651a9b6de95c13aab1e0304e0c93896c02b6c89f [Cut unused Storage.Hashed.Utils.(?) function. Eric Kow **20090527114125 Ignore-this: 952f216b88fd2d0c8c52c833297af66 ] hash: 0000000315-557fdab9ebdfe9e383b759c16588d02a7ee6949d5948224af69465efb9d01712 [Eliminate use of Storage.Hashed.Utils.(?) in Storage.Hashed.Index. Petr Rockai **20100623195715 Ignore-this: ab3ea7afbfada3965b367379b85cb510 (Originally by Eric Kow.) ] hash: 0000000782-ed0b6890c6c754129e123d29314bfa14583ae15a9e0b7897c29fc3f8fbe32847 [Avoid haskell98 usage in Setup. Petr Rockai **20100716135625 Ignore-this: 9417788c715ad61835dc71c26b4c9819 ] hash: 0000000242-85a8f0f8fb79341580cd7ca28883e2cc7ac812650e067f01b51552ee354455c6 [Fix up compilation of the Diff module. Petr Rockai **20100727225648 Ignore-this: f208bcd2f23ec4f9e7bb0e6ffb5a919f ] hash: 0000000263-f908adf197d641e198dfc274efd1a1f3d3eaba9b9238089ef6c1a2ffad2ec0f2 [Make Hash an instance of Typeable and Data. Petr Rockai **20100809131723 Ignore-this: 4af4dff8b8ce39688a2c46cd53eebd47 ] hash: 0000000440-54e3f0cd8126cd506f60de45feef6cc823e14c43050438fc0fba3550b97668dd [Add a hopefully-efficient "copy" operation to TreeRW. Petr Rockai **20100809131831 Ignore-this: 53f44772af7b93e5c5e6fffb868e525d ] hash: 0000000660-8372485fc43a017b897435dbe17205376ee525ef3e0ab1f121122f97a0bb710a [Add more efficient partiallyUpdateTree and implement updateTree in terms of it. Petr Rockai **20100809131857 Ignore-this: de862ab101354e35eaccbaa8356fe7fb ] hash: 0000001645-40c726e38261a2b99f04657ae316755ccf44771ac05fd843a70dd260b00f1799 [Bump version to 0.5.3. Petr Rockai **20100809132316 Ignore-this: 65928e119d9a165cbe8b447269768db ] hash: 0000000191-a46ec4fa5188a7fcc3f50cbd5f018d7dfa6da3031e4aae03682e2eec2493523d [Factor out (general) addMissingHashes out of darcsAddMissingHashes. Petr Rockai **20100809175530 Ignore-this: 1f86d183a1c8083abb832f4fab611d1 ] hash: 0000001568-707ba8cdc0055465065ee5d26cb10d73649cae97fd807bad84ded9f042e61742 [Fix a bug in partiallyUpdateTree. Petr Rockai **20100809175625 Ignore-this: 8bfaa1b283122c6f67bacc1d1402e1d1 ] hash: 0000000463-e8fa16655f802f85c8d197e449a6caedc0581abc26c1f6de6a25c1a515678273 [Leave out useless forcing from partiallyUpdateTree. Petr Rockai **20100809175702 Ignore-this: c28b52ecf1f9a12677e106765df9d21e ] hash: 0000000323-1b544cde685ba884bdc8b93fa03e1fd128c7ccee45c66054fb65c6ccebd87657 [Rewrite TreeMonad's flush-to-disk logic and simplify its frontends. Petr Rockai **20100809180402 Ignore-this: b9f75f2196c5cab0aed2e7734374a099 Instead of flushing everything and starting with clean slate every circa 100 megabytes worth of changes, use a proper cache with aging: files that have been untouched for a long time get flushed first when the buffer is getting too big. ] hash: 0000008672-7719ca73b75af2cb6bf474217854342378bb356a044c1253dcb3367e8df64b82 [Improve error messages in modifyTree. Petr Rockai **20100811155715 Ignore-this: 4b34fb2e392094d2ffa19cfa42c2b7a5 ] hash: 0000000625-3819682c368cc24f7969990e48253c38f8a460173e98f8c1acf836983f1d8ab0 [Move documentation on index format to module-level. Eric Kow **20100814180414 Ignore-this: d47ee0c5686ef1e13d45f69bf6e6f60f The peekItem function is not exported, so its haddock does not show up on Hackage. ] hash: 0000002386-970dcee2fe12eb21c99c1fe834b88e1573432e931a69ff46ec2955db830a12eb [Fix hyperlink to Storage.Hashed.Index. Eric Kow **20100814181230 Ignore-this: 97107546fbf38de0fdb6e8f8d5633e98 Single quotes for functions, double-quotes for modules.. ] hash: 0000000357-9bc3e40e8a16e7691217a22195ce3f0dc6f3cd3aefff7ebaadf092cdb45e74c2 [Remove the (dead-ended) Packed experiment. Petr Rockai **20100811005550 Ignore-this: d1af98d3f32e6127b8a71e5de0e48ae8 ] hash: 0000016157-a9e58eeb838d665970a86cc9b553ade0d55d9ca49969ad92a78325c363e2d634 [Switch to a new Path representation. Petr Rockai **20100811005638 Ignore-this: b217b226c16c77f12633653993e59d8f ] hash: 0000032057-70de48e157e8b7b4d9dafad5c5289cc6cbec2c39bbcfdcf0002ee885672fd438 [Bump version to 0.6 -- major API changes are happening. Petr Rockai **20100811005815 Ignore-this: 50e590e0d3f2e73510afaa41c42ccdf8 ] hash: 0000000223-3688bbe9e24a3819e174b56648cb11165e45866e5e4f98e4622828e5a42bf60d [Much nicer Path views. Petr Rockai **20100811074011 Ignore-this: 2157db170a0b6179b53d87b105304f95 ] hash: 0000003304-b55064b235133d67ab88ee020a1f7c3dfb6ad8cea66bc3b227a1bf10a43feb0f [Add a safe to/from (byte)string interface to Path. Petr Rockai **20100811155732 Ignore-this: efa2c7ad95e620932de6499fd381feda ] hash: 0000001854-70ceb1eaf817a1b0dacc6d6554b8758005c6a572b2949963790ef7589ec9dfcf [Add an existsAnycase utility to Monad. Petr Rockai **20100811155830 Ignore-this: e372ce0f7de38234628ae3ba6ed28fb8 ] hash: 0000001317-9e74a6639319f26ab8189f28e1ba064e99b0afcbdc4801bd5982be4baf5538c7 [Add find*M utilities to Monad. Petr Rockai **20100811155902 Ignore-this: 269741e71ae77bb3860a4af84be28f7d ] hash: 0000000500-b9c3bac3ae5361c35535642f0ac8a678f37f4763de1682f5d6858478f2d92ebc [Fix Index (pathToBS always produces a non-empty path now). Petr Rockai **20100811155922 Ignore-this: 50399534cf27943011c54757a4a40a7b ] hash: 0000000286-96a1af01a22c75df1b6df023a75434d291bf896b95e56bf9aec5ec68e4905930 [Fix a bug in implementation of suffix in Path. Petr Rockai **20100820135823 Ignore-this: c3abf129bc5a17180603e0039d120a4b ] hash: 0000000316-bc639f1d1d82386093c19335d6064af26dac999819987b620a58b0fe15f60192 [Add type signature to findM'. Petr Rockai **20100820140625 Ignore-this: 68118c67979e07554ba5017864cd2a42 ] hash: 0000000575-f26ed3b23163ced6147b963f2b03076ec2309e9dc01044635c6e7c0a004feb76 [Add a couple more missing type signatures. Petr Rockai **20100820140833 Ignore-this: 567770926b66f302b52184afc001419f ] hash: 0000000532-d57f4f2c695ac29f8d2ebfdd01bb22cb300e33a3ef0a1ebab272da96f338eff5 [There is no need to flush a "virtual" TreeMonad. Petr Rockai **20100830201345 Ignore-this: d85b81532704323b48a8e40cc5d82f54 ] hash: 0000000683-e79f4cbf71ec67e243b7d54f9d4b0600ec87c1c4d807b391c3be668e188a8da8 [Fix findM'. Petr Rockai **20100830201410 Ignore-this: 369851049c397497841336818909b8ac ] hash: 0000000557-85e49ef3a44908903e8ecaf7edb1b84c2fb7e914135615326dcb0ae314991d2a [Expand the input Tree before writing it out in writePlainTree. Petr Rockai **20100830201443 Ignore-this: f96e1ecae8cf57e88a5d43d4e984d6cf ] hash: 0000000421-e75282c3d9349f7961e80214646f23e31c1f9dcfd5288c5a9de4cfb6ca095e94 [Fix Test to compile with latest iteration of Path. Petr Rockai **20100830201509 Ignore-this: 511f9baf595b75a8fc9a7cc5a98af925 ] hash: 0000000563-a19021a916c77f876ecddc7de175c6e64908a7e5713aa94534e3909abe37aa53 [Parametrise Storage.Hashed.Darcs with GetHash. Petr Rockai **20100902165005 Ignore-this: c955e7b7337edf0d4099c917e51e0ae ] hash: 0000002752-13ce3c53ea052ca4fd60d47499c466f5c761bac4f322da6b9ee63d71a5964120 [Drop the unused MonadError constraint on TreeMonad functions. Petr Rockai **20100902165011 Ignore-this: 1696f6a0b2a1fa06b464c05e789b5572 ] hash: 0000004305-4aa258359626d0b5be1188ddd5187b4fbc7bbc52c85e01a7ddb21e0c24023437 [Move S.H.Darcs decompression into getDarcsLocal. Petr Rockai **20100903022344 Ignore-this: c86c164980b1dac6fd6f37c677ed8dd ] hash: 0000000732-6d4adf179d9a6be1c1ec7051ea23a24dbc93255b05d6157e5569fa0c9900b3ad [Add currentTree to S.H.Monad and avoid exporting "tree". Petr Rockai **20100904144739 Ignore-this: 1ce2be8234a0a3de7e54f5b35345687a ] hash: 0000000772-498c5e8e3868c77bf72c5e56199cbfd5a3d53a9ae3968a286df2f11af5766877 [Substantially improve the Path module, adding test coverage along the way. Petr Rockai **20100904144934 Ignore-this: b5d7d2bbef3eab01ebda8d84632b2af4 ] hash: 0000009900-b7de2bc2226c2c82a17b155274d2daebff0d7d66da71f05d1459848e5195c42c [Make the arbitrary paths a bit trickier. (QC) Petr Rockai **20100904185824 Ignore-this: bfffa407a16c343d74a5b808f4e7a9a3 ] hash: 0000000615-f21d1d5a0f7ed635f864ee77524c17e8e9b15ec5fe61d4c0925450e016a62358 [Fix a bug in +/+ with absolute paths and leading .. in second argument. Petr Rockai **20100904185858 Ignore-this: b69c8b9ca0a47d89dc25d186b58096bc ] hash: 0000000395-a654098758b85bd138547b46b12adf7eef42541a9784f5b36189850cb1f04336 [Switch to pathlib for (Tree) path handling. Petr Rockai **20100906195826 Ignore-this: f56e7eca714b8c6cc3f38d46e67c2cff ] hash: 0000011475-3c5f11bb8a0c0df777f97cc31e30721b0a96998144acc5da64b163eb6c32d271 [Port over filesystem paths to pathlib (away from filepath). Petr Rockai **20100907125725 Ignore-this: 8fd9b462760028f0610eaab1d3cc1b64 ] hash: 0000008234-435c5edfcbf720ec0a21632f18c24fc26de588f64217c8db13c22aca696b8d04 [Update to reflect the Data.Path.Unsafe split. Petr Rockai **20100907132033 Ignore-this: 220384610e894d8dda669d1b001c06db ] hash: 0000000463-701a9448558012d2401bba68d61da886e71b9ad0c4e7eb7a3369ef4f1cab1b1c [Fix a bug in unsafePathFromBS usage in Index. Petr Rockai **20100907224416 Ignore-this: 7503155ad43e43f4bd85f20935c2b363 ] hash: 0000000884-efac8a77580ba7860e935dba9a93b26e8589a47211aedc75ebcbe791861eec39 [Re-export Data.Path.Unsafe from S.H.Path, for darcs' convenience. Petr Rockai **20100907224441 Ignore-this: 9ac606ce519434e25d2f8c0fe723f66 ] hash: 0000000382-195d8494f8830be86dedc3acc6e756462fedbaffc047e8269fdea311424c2f8b