NFD

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.