Class CIDPath

Simple strategy that traverses a known path to a target CID.

All this strategy does is yield the next CID in the known path.

Implements

TraversalStrategy

Index

Constructors

Methods

isTarget traverse

Constructors

constructor

new CIDPath(pathToTarget: CID<unknown, number, number, Version>[]): CIDPath
Parameters
- pathToTarget: CID<unknown, number, number, Version>[]
Returns CIDPath
- Defined in packages/car/src/traversal-strategies/cid-path.ts:14

Methods

isTarget

isTarget(cid: CID): boolean
Returns true if the current CID is the target and we should switch to the export strategy
Parameters
- cid: CID
Returns boolean
Implementation of TraversalStrategy.isTarget
- Defined in packages/car/src/traversal-strategies/cid-path.ts:19

traverse

traverse<T extends BlockView<any, any, any, 0 | 1>>(
cid: CID,
_block?: T,
): AsyncGenerator<CID<unknown, number, number, Version>, void, undefined>
Traverse the DAG and yield the next CID to traverse
Type Parameters
- T extends BlockView<any, any, any, 0 | 1>
Parameters
- cid: CID
- Optional_block: T
Returns AsyncGenerator<CID<unknown, number, number, Version>, void, undefined>
Implementation of TraversalStrategy.traverse
- Defined in packages/car/src/traversal-strategies/cid-path.ts:23