-
Sub-task
-
Resolution: Done
-
Medium
-
None
-
None
-
light refactory one
A hash table is needed to implement efficient lookup in hICN data structures.
Most of the time, the hash table will act as an index and its value will be an integer identifying the position inside the memory pool of the referenced element.