Tue, 27 Sep 2011 05:29:12 +0200 |
Artem Tikhomirov |
Facilitate cancellation and progress reporting in changelog and manifest iterations
|
Wed, 21 Sep 2011 18:26:16 +0200 |
Artem Tikhomirov |
Use memory-friendly set implementation to canonicalize filenames and nodeids
|
Sat, 17 Sep 2011 13:41:04 +0200 |
Artem Tikhomirov |
Share range check code
|
Sat, 03 Sep 2011 21:46:13 +0200 |
Artem Tikhomirov |
Use Path instead of plain String for manifest file names
|
Tue, 23 Aug 2011 22:30:56 +0200 |
Artem Tikhomirov |
Use StringProxy when parsing manifest to minimize number of useless conversions and array instances
|
Tue, 23 Aug 2011 21:27:56 +0200 |
Artem Tikhomirov |
Revert manifest parser changes - no single string and back to HashMap Pool
|
Fri, 19 Aug 2011 04:59:32 +0200 |
Artem Tikhomirov |
Improve manifest parsing: reduce number of arrays instantiated for Nodeid
|
Fri, 19 Aug 2011 03:36:25 +0200 |
Artem Tikhomirov |
Optimize memory usage (reduce number of objects instantiated) when pooling file names and nodeids during manifest parsing
|
Thu, 18 Aug 2011 03:46:36 +0200 |
Artem Tikhomirov |
Improve manifest parsing: decode bytes to chars once, minimize arraycopy on String instantiation, keep set of file revisions from previous manifest only
|
Tue, 16 Aug 2011 22:07:16 +0200 |
Artem Tikhomirov |
Handle revision constants correctly
|
Tue, 16 Aug 2011 04:03:29 +0200 |
Artem Tikhomirov |
Collect tags for a file - improve performance of 'sparse' manifest reads
|
Thu, 02 Jun 2011 05:13:39 +0200 |
Artem Tikhomirov |
Allow to cat a file with changeset revision
|
Thu, 19 May 2011 05:02:07 +0200 |
Artem Tikhomirov |
Due to discrepancy in manifest and changelor indexes, wrong manifest revisions got cached and compared
|
Thu, 19 May 2011 04:14:45 +0200 |
Artem Tikhomirov |
Basic information about branches
|
Tue, 17 May 2011 03:42:33 +0200 |
Artem Tikhomirov |
Issue 7: Correctly handle manifest and changelog with different number of (or non-matching) revisions
|
Mon, 18 Apr 2011 18:04:24 +0200 |
Artem Tikhomirov |
Pool objects to avoid memory polution with duplicates
|