package
23.1.1+incompatible
Repository: https://github.com/dgraph-io/dgraph.git
Documentation: pkg.go.dev

# Functions

ApplyFilter applies a filter to our UIDList.
ApplyFilterPacked applies the filter to a list of packed uids.
Difference returns the difference of two lists.
DifferencePacked performs the difference operation between two UidPack objects.
IndexOf performs a binary search on the uids slice and returns the index at which it finds the uid, else returns -1.
IndexOfPacked finds the index of the given uid in the UidPack.
IntersectCompressedWith intersects a packed list of UIDs with another list and writes the output to o.
IntersectCompressedWithBin is based on the paper "Fast Intersection Algorithms for Sorted Sequences" https://link.springer.com/chapter/10.1007/978-3-642-12476-1_3 Call seek on dec before calling this function.
IntersectCompressedWithLinJump performs the intersection linearly.
IntersectSorted calculates the intersection of multiple lists and performs the intersections from the smallest to the largest list.
IntersectSortedPacked calculates the intersection of multiple lists and performs the intersections from the smallest to the largest list.
IntersectWith intersects u with v.
IntersectWithBin is based on the paper "Fast Intersection Algorithms for Sorted Sequences" https://link.springer.com/chapter/10.1007/978-3-642-12476-1_3.
IntersectWithJump performs the intersection linearly but jumping jump steps between iterations.
IntersectWithLin performs the intersection linearly.
IntersectWithLinPacked performs the liner intersection between two compressed uid lists.
MergeSorted merges sorted lists.
MergeSortedPacked merges already sorted UidPack objects into a single UidPack.
ToUintsListForTest converts to list of uints for testing purpose only.