mirror of
https://github.com/status-im/nimbus-eth1.git
synced 2025-01-16 15:25:24 +00:00
f926222fec
* Remove all journal related stuff * Refactor function names journal*() => delta*(), filter*() => delta*() * remove `trg` fileld from `FilterRef` why: Same as `kMap[$1]` * Re-type FilterRef.src as `HashKey` why: So it is directly comparable to `kMap[$1]` * Moved `vGen[]` field from `LayerFinalRef` to `LayerDeltaRef` why: Then a separate `FilterRef` type is not needed, anymore * Rename `roFilter` field in `AristoDbRef` => `balancer` why: New name more appropriate. * Replace `FilterRef` by `LayerDeltaRef` type why: This allows to avoid copying into the `balancer` (see next patch set) most of the time. Typically, only one instance is running on the backend and the `balancer` is only used as a stage before saving data. * Refactor way how to store data persistently why: Avoid useless copy when staging `top` layer for persistently saving to backend. * Fix copyright header?
68 lines
2.3 KiB
Nim
68 lines
2.3 KiB
Nim
# Nimbus - Types, data structures and shared utilities used in network sync
|
|
#
|
|
# Copyright (c) 2023-2024 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[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 (vid,vtx) in walkVtxBeImpl[T](db):
|
|
yield (vid,vtx)
|
|
|
|
iterator walkKeyBe*[T: MemBackendRef|VoidBackendRef](
|
|
_: type T;
|
|
db: AristoDbRef;
|
|
): tuple[vid: VertexID, key: HashKey] =
|
|
## Similar to `walkVtxBe()` but for keys.
|
|
for (vid,key) in walkKeyBeImpl[T](db):
|
|
yield (vid,key)
|
|
|
|
# -----------
|
|
|
|
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
|
|
# ------------------------------------------------------------------------------
|