Class DataArray

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.

Implements

Index

Constructors

Methods

delete find get insert listData listNames

Constructors

constructor

new DataArray(): DataArray
Returns DataArray

Methods

delete

delete(...names): Promise<void>
Delete Data packets with given names.
Parameters
- Rest...names: readonly Name[]
Returns Promise<void>
Implementation of Delete.delete
- Defined in data-array.ts:47

find

find(interest): Promise<undefined | Data>
Find Data that satisfies Interest.
Parameters
- interest: Interest
Returns Promise<undefined | Data>
Implementation of Find.find
- Defined in data-array.ts:32

get

get(name): Promise<undefined | Data>
Retrieve Data by exact name.
Parameters
- name: Name
Returns Promise<undefined | Data>
Implementation of Get.get
- Defined in data-array.ts:28

insert

insert(...args): Promise<void>
Insert one or more Data packets.
Parameters
- Rest...args: (Data | AnyIterable<Data>)[] | [{}, ...(Data | AnyIterable<Data>)[]]
Returns Promise<void>
Remarks
Arguments include:
- an optional Options object
- zero or more Data, Iterable, or AsyncIterable
Implementation of Insert.insert
- Defined in data-array.ts:42

listData

listData(prefix?): AsyncIterable<Data>
List Data packets, optionally filtered by name prefix.
Parameters
- Optionalprefix: Name
Returns AsyncIterable<Data>
Implementation of ListData.listData
- Defined in data-array.ts:20

listNames

listNames(prefix?): AsyncIterable<Name>
List Data names, optionally filtered by name prefix.
Parameters
- Optionalprefix: Name
Returns AsyncIterable<Name>
Implementation of ListNames.listNames
- Defined in data-array.ts:16