Use Intersect to Narrow Iterate Range and Reduce Memory Allocation

hypermodeinc · Jan 10, 2025 · a5576a1 · a5576a1
1 parent 25a8814
commit a5576a1
Showing 1 changed file with 4 additions and 0 deletions.
diff --git a/posting/list.go b/posting/list.go
@@ -1685,6 +1685,10 @@ func (l *List) Uids(opt ListOptions) (*pb.List, error) {
 		return out, nil
 	}
 
+	preAllowcateLength := x.MinInt(opt.First, l.mutationMap.len()+codec.ApproxLen(l.plist.Pack))
+	if opt.Intersect != nil {
+		preAllowcateLength = x.MinInt(preAllowcateLength, len(opt.Intersect.Uids))
+	}
 	// Pre-assign length to make it faster.
 	res := make([]uint64, 0, x.MinInt(opt.First, len(opt.Intersect.Uids), l.mutationMap.len()+codec.ApproxLen(l.plist.Pack)))