Actions
Task #1212
closed
Task #1211: ContentStore
CS structure
Start date:
Due date:
% Done:
100%
Estimated time:
12.00 h
Description
Design and implement the data structure for CS.
It should support:
- insert with duplicate detection
- efficient best match lookup, supporting selectors
- periodical cleanup
It's desirable (but not required) to defer implicit digest computation until it's needed.
Implicit digest is not needed in the common case where (1) no two Data packets have the same Name without digest (2) last component of Interest Name does not look like a digest and also happen to match a stored Data packet.
Note that CS design should be approved by the team before the implementation.
Updated by
Updated by Ilya Moiseenko almost 11 years ago
- Status changed from New to In Progress
- Assignee set to Ilya Moiseenko
- % Done changed from 0 to 40
Updated by Ilya Moiseenko almost 11 years ago
- Status changed from In Progress to Code review
- % Done changed from 40 to 100
Updated by Junxiao Shi almost 11 years ago
- Status changed from Code review to Closed
Basic functionality is working.
Logic seems incorrect if the last Interest Name component has exactly 32 octets.
eg. ndn:/amazon/book/THE-ELEMENTS-OF-STYLE,William-S.
Actions