Data packet storage based on array.
This is a minimal implementation of DataStore interfaces. It has small code size but every operation has O(N) time complexity.
Delete Data packets with given names.
Find Data that satisfies Interest.
Retrieve Data by exact name.
Insert one or more Data packets.
Arguments include:
List Data packets, optionally filtered by name prefix.
Optional
List Data names, optionally filtered by name prefix.
Data packet storage based on array.
Remarks
This is a minimal implementation of DataStore interfaces. It has small code size but every operation has O(N) time complexity.