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

small simplifications

Browse Source
This commit is contained in:
pippellia-btc
2025-05-28 17:02:53 +02:00
parent 364432a161
commit 921b21d6c1
1 changed files with 5 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
pkg/walks/walks.go
View File

@@ -131,7 +131,7 @@ func generate(ctx context.Context, walker Walker, start ...graph.ID) ([]graph.ID
}
node := randomElement(start)
path := make([]graph.ID, 0, averageLenght(Alpha))
path := make([]graph.ID, 0, expectedLenght(Alpha))
path = append(path, node)
for {
@@ -182,18 +182,15 @@ func ToUpdate(ctx context.Context, walker Walker, delta graph.Delta, walks []Wal
toUpdate := make([]Walk, 0, expectedUpdates(walks, delta))
resampleProbability := resampleProbability(delta)
var pos int
var isInvalid, shouldResample bool
for _, walk := range walks {
pos = walk.Index(delta.Node)
pos := walk.Index(delta.Node)
if pos == -1 {
// the walk doesn't visit node, skip
continue
}
shouldResample = rand.Float64() < resampleProbability
isInvalid = (pos < walk.Len()-1) && slices.Contains(delta.Remove, walk.Path[pos+1])
shouldResample := rand.Float64() < resampleProbability
isInvalid := (pos < walk.Len()-1) && slices.Contains(delta.Remove, walk.Path[pos+1])
switch {
case shouldResample:
@@ -282,7 +279,7 @@ func findCycle[S []K, K comparable](s S) int {
return -1
}
func averageLenght(alpha float64) int {
func expectedLenght(alpha float64) int {
switch {
case alpha < 0 || alpha > 1:
panic("alpha must be between 0 and 1 (excluded)")