aljaz/crawler_v2
1
0
Fork 0
mirror of https://github.com/aljazceru/crawler_v2.git synced 2025-12-18 16:04:21 +01:00
Code Issues Packages Projects Releases Wiki Activity

renamed to simple walker

Browse Source
This commit is contained in:
pippellia-btc
2025-06-02 11:43:04 +02:00
parent 5ef3dd08dd
commit 7d82354540
3 changed files with 69 additions and 62 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
pkg/walks/walker.go
View File

@@ -11,23 +11,23 @@ type Walker interface {
Follows(ctx context.Context, node graph.ID) ([]graph.ID, error)
}
type MapWalker struct {
type SimpleWalker struct {
follows map[graph.ID][]graph.ID
}
func NewWalker(m map[graph.ID][]graph.ID) *MapWalker {
return &MapWalker{follows: m}
func NewSimpleWalker(m map[graph.ID][]graph.ID) *SimpleWalker {
return &SimpleWalker{follows: m}
}
func (m *MapWalker) Follows(ctx context.Context, node graph.ID) ([]graph.ID, error) {
return m.follows[node], nil
func (w *SimpleWalker) Follows(ctx context.Context, node graph.ID) ([]graph.ID, error) {
return w.follows[node], nil
}
func (m *MapWalker) Update(ctx context.Context, delta graph.Delta) {
m.follows[delta.Node] = delta.New()
func (w *SimpleWalker) Update(ctx context.Context, delta graph.Delta) {
w.follows[delta.Node] = delta.New()
}
func NewCyclicWalker(n int) *MapWalker {
func NewCyclicWalker(n int) *SimpleWalker {
follows := make(map[graph.ID][]graph.ID, n)
for i := range n {
node := graph.ID(strconv.Itoa(i))
@@ -35,18 +35,18 @@ func NewCyclicWalker(n int) *MapWalker {
follows[node] = []graph.ID{next}
}
return &MapWalker{follows: follows}
return &SimpleWalker{follows: follows}
}
// CachedWalker is a walker with optional fallback that stores follow relationships
// in a compact format (uint32) for reduced memory footprint.
type cachedWalker struct {
type CachedWalker struct {
follows map[graph.ID][]graph.ID
fallback Walker
}
func NewCachedWalker(nodes []graph.ID, follows [][]graph.ID, fallback Walker) *cachedWalker {
w := cachedWalker{
func NewCachedWalker(nodes []graph.ID, follows [][]graph.ID, fallback Walker) *CachedWalker {
w := CachedWalker{
follows: make(map[graph.ID][]graph.ID, len(nodes)),
fallback: fallback,
}
@@ -58,7 +58,7 @@ func NewCachedWalker(nodes []graph.ID, follows [][]graph.ID, fallback Walker) *c
return &w
}
func (w *cachedWalker) Follows(ctx context.Context, node graph.ID) ([]graph.ID, error) {
func (w *CachedWalker) Follows(ctx context.Context, node graph.ID) ([]graph.ID, error) {
follows, exists := w.follows[node]
if !exists {
var err error