Mercurial > hg4j

comparison design.txt @ 21:e929cecae4e1

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Refactor to move revlog content to base class
author Artem Tikhomirov <tikhomirov.artem@gmail.com>
date Wed, 05 Jan 2011 04:10:28 +0100
parents 11cfabe692b3
children 603806cd2dc6
comparison
equal deleted inserted replaced
20:11cfabe692b3 21:e929cecae4e1
27 + dirstate.mtime 27 + dirstate.mtime
28 +calculate sha1 digest for file to see I can deal with nodeid 28 +calculate sha1 digest for file to see I can deal with nodeid
29 *.hgignored processing 29 *.hgignored processing
30 30
31 DataAccess - collect debug info (buffer misses, file size/total read operations) to find out better strategy to buffer size detection. 31 DataAccess - collect debug info (buffer misses, file size/total read operations) to find out better strategy to buffer size detection.
32 DataAccess - implement memory mapped files, compare performance.
32 delta merge 33 delta merge
33 Changeset to get index (local revision number) 34 Changeset to get index (local revision number)
34 RevisionWalker (on manifest) and WorkingCopyWalker (io.File) talking to ? and/or dirstate 35 RevisionWalker (on manifest) and WorkingCopyWalker (io.File) talking to ? and/or dirstate
35 36
36 Revlog.Inspector to get nodeid array of meaningful data exact size (nor heading 00 bytes, nor 12 extra bytes from the spec) 37 Revlog.Inspector to get nodeid array of meaningful data exact size (nor heading 00 bytes, nor 12 extra bytes from the spec)
50 and allows buffer management (i.e. reuse. Single buffer for all reads). 51 and allows buffer management (i.e. reuse. Single buffer for all reads).
51 Scheduling multiple operations (in future, to deal with writes - single queue for FS operations - no locks?) 52 Scheduling multiple operations (in future, to deal with writes - single queue for FS operations - no locks?)
52 53
53 File access: 54 File access:
54 * NIO and mapped files - should be fast. Although seems to give less control on mem usage. 55 * NIO and mapped files - should be fast. Although seems to give less control on mem usage.
55 * Regular InputStreams and chunked stream on top - allocate List<byte[]>, each (but last) chunk of fixed size (depending on initial file size) 56 * Regular InputStreams and chunked stream on top - allocate List<byte[]>, each (but last) chunk of fixed size (depending on initial file size)
56 57
57 <<<<< 58 <<<<<