mirror of
https://github.com/status-im/nimbus-eth1.git
synced 2025-01-29 05:25:34 +00:00
6e0397e276
* Fix debug noise in `hashify()` for perfectly normal situation why: Was previously considered a fixable error * Fix test sample file names why: The larger test file `goerli68161.txt.gz` is already in the local archive. So there is no need to use the smaller one from the external repo. * Activate `accounts_cache` module from `db/ledger` why: A copy of the original `accounts_cache.nim` source to be integrated into the `Ledger` module wrapper which allows to switch between different `accounts_cache` implementations unser tha same API. details: At a later state, the `db/accounts_cache.nim` wrapper will be removed so that there is only one access to that module via `db/ledger/accounts_cache.nim`. * Fix copyright headers in source code
82 lines
2.7 KiB
Nim
82 lines
2.7 KiB
Nim
# Nimbus - Types, data structures and shared utilities used in network sync
|
|
#
|
|
# Copyright (c) 2023 Status Research & Development GmbH
|
|
# Licensed under either of
|
|
# * Apache License, version 2.0, ([LICENSE-APACHE](LICENSE-APACHE) or
|
|
# http://www.apache.org/licenses/LICENSE-2.0)
|
|
# * MIT license ([LICENSE-MIT](LICENSE-MIT) or
|
|
# http://opensource.org/licenses/MIT)
|
|
# at your option. This file may not be copied, modified, or
|
|
# distributed except according to those terms.
|
|
|
|
## Iterators for non-persistent backend of the Aristo DB
|
|
## =====================================================
|
|
##
|
|
import
|
|
../aristo_init/[memory_db, memory_only],
|
|
".."/[aristo_desc, aristo_init],
|
|
./walk_private
|
|
|
|
export
|
|
memory_db,
|
|
memory_only
|
|
|
|
# ------------------------------------------------------------------------------
|
|
# Public iterators (all in one)
|
|
# ------------------------------------------------------------------------------
|
|
|
|
iterator walkVtxBe*[T: MemBackendRef|VoidBackendRef](
|
|
_: type T;
|
|
db: AristoDbRef;
|
|
): tuple[n: int, vid: VertexID, vtx: VertexRef] =
|
|
## Iterate over filtered memory backend or backend-less vertices. This
|
|
## function depends on the particular backend type name which must match
|
|
## the backend descriptor.
|
|
for (n,vid,vtx) in walkVtxBeImpl[T](db):
|
|
yield (n,vid,vtx)
|
|
|
|
iterator walkKeyBe*[T: MemBackendRef|VoidBackendRef](
|
|
_: type T;
|
|
db: AristoDbRef;
|
|
): tuple[n: int, vid: VertexID, key: HashKey] =
|
|
## Similar to `walkVtxBe()` but for keys.
|
|
for (n,vid,key) in walkKeyBeImpl[T](db):
|
|
yield (n,vid,key)
|
|
|
|
iterator walkFilBe*[T: MemBackendRef|VoidBackendRef](
|
|
be: T;
|
|
): tuple[n: int, qid: QueueID, filter: FilterRef] =
|
|
## Iterate over backend filters.
|
|
for (n,qid,filter) in walkFilBeImpl[T](be):
|
|
yield (n,qid,filter)
|
|
|
|
iterator walkFifoBe*[T: MemBackendRef|VoidBackendRef](
|
|
be: T;
|
|
): tuple[qid: QueueID, fid: FilterRef] =
|
|
## Walk filter slots in fifo order.
|
|
for (qid,filter) in walkFifoBeImpl[T](be):
|
|
yield (qid,filter)
|
|
|
|
# -----------
|
|
|
|
iterator walkPairs*[T: MemBackendRef|VoidBackendRef](
|
|
_: type T;
|
|
db: AristoDbRef;
|
|
): tuple[vid: VertexID, vtx: VertexRef] =
|
|
## Walk over all `(VertexID,VertexRef)` in the database. Note that entries
|
|
## are unsorted.
|
|
for (vid,vtx) in walkPairsImpl[T](db):
|
|
yield (vid,vtx)
|
|
|
|
iterator replicate*[T: MemBackendRef|VoidBackendRef](
|
|
_: type T;
|
|
db: AristoDbRef;
|
|
): tuple[vid: VertexID, key: HashKey, vtx: VertexRef, node: NodeRef] =
|
|
## Variant of `walkPairsImpl()` for legacy applications.
|
|
for (vid,key,vtx,node) in replicateImpl[T](db):
|
|
yield (vid,key,vtx,node)
|
|
|
|
# ------------------------------------------------------------------------------
|
|
# End
|
|
# ------------------------------------------------------------------------------
|