Viewing all changes in revision 5365.5.1.
- Committer: John Arbash Meinel
- Date: 2010-08-03 20:56:39 UTC
- mto: This revision was merged to the branch mainline in revision 5390.
- Revision ID: john@arbash-meinel.com-20100803205639-k23colcozyd14440
Implement a custom parser for chk btree leaves.
The basic parsing is actually quicker (47us to build this new structure vs 110us)
Most likely because we have 1 malloc rather than N per leaf.
Memory size is also much smaller. We'll lose a little bit if we
convert back and forth from keys, etc.
The basic parsing is actually quicker (47us to build this new structure vs 110us)
Most likely because we have 1 malloc rather than N per leaf.
Memory size is also much smaller. We'll lose a little bit if we
convert back and forth from keys, etc.
expand all
collapse all
added
removed
