mirror of
https://github.com/facebook/sapling.git
synced 2024-10-11 01:07:15 +03:00
a7555791cd
Summary: Strictly speaking, it doesn't care if it's the length is SHA1_BYTES * 2. It just has to be even. Also, size_t comes from stddef.h. Test Plan: make local Reviewers: durham, lcharignon Subscribers: mitrandir, mjpieters Differential Revision: https://phabricator.intern.facebook.com/D3626828 |
||
|---|---|---|
| .. | ||
| .hgignore | ||
| bsearch_test.c | ||
| bsearch.c | ||
| bsearch.h | ||
| buffer.c | ||
| buffer.h | ||
| checksum_test.c | ||
| checksum.c | ||
| checksum.h | ||
| CMakeLists.txt | ||
| convert.h | ||
| internal_result.h | ||
| node_test.c | ||
| node.c | ||
| node.h | ||
| null_test.c | ||
| README | ||
| result.h | ||
| tests.c | ||
| tests.h | ||
| tree_arena.c | ||
| tree_arena.h | ||
| tree_convert_rt.c | ||
| tree_convert_test.c | ||
| tree_convert.c | ||
| tree_copy_test.c | ||
| tree_copy.c | ||
| tree_diff_test.c | ||
| tree_diff.c | ||
| tree_disk_test.c | ||
| tree_disk.c | ||
| tree_dump.c | ||
| tree_iterate_rt.c | ||
| tree_iterator_test.c | ||
| tree_iterator.c | ||
| tree_iterator.h | ||
| tree_path.c | ||
| tree_path.h | ||
| tree_test.c | ||
| tree.c | ||
| tree.h | ||
fastmanifest is a tree-based implementation to speed up manifest operations in Mercurial. Its design is optimized for quick deserialization from a persistent store. In compact form, the entire tree is relocatable without any traversals.