Intersection algorithms
Missing docstring for bk. Check Documenter's build log for details.
Missing docstring for baezayates. Check Documenter's build log for details.
Missing docstring for svs. Check Documenter's build log for details.
Missing docstring for imerge2. Check Documenter's build log for details.
Union algorithms
Missing docstring for umerge. Check Documenter's build log for details.
Searching algorithms
Intersections.binarysearch — Functionbinarysearch(A, x, sp=1, ep=length(A))
Finds the insertion position of x in A in the range sp:ep
Intersections.doublingsearch — Functiondoublingsearch(A, x, sp=1, ep=length(A))
Finds the insertion position of x in A, starting at sp
Intersections.doublingsearchrev — Functiondoublingsearchrev(A, x, sp=1, ep=length(A))
Finds the insertion position of x in A, starting at the end
Intersections.seqsearch — Functionsearchrev(A, x, sp=1, ep=length(A))
Sequential search, i.e., it starts from sp to ep
Intersections.seqsearchrev — Functionseqsearchrev(A, x, sp=1, ep=length(A))
Reverse sequential search, i.e., it starts from ep to sp