Replace LUCKY links with actual links

This commit is contained in:
Sebastian Wilzbach 2017-02-28 23:35:24 +01:00
parent b22acefa9c
commit d548e8830a
22 changed files with 88 additions and 55 deletions

View file

@ -558,7 +558,8 @@ Params:
sorted = Whether the elements copied should be in sorted order.
The function $(D largestPartialIntersection) is useful for
e.g. searching an $(LUCKY inverted index) for the documents most
e.g. searching an $(LINK2 https://en.wikipedia.org/wiki/Inverted_index,
inverted index) for the documents most
likely to contain some terms of interest. The complexity of the search
is $(BIGOH n * log(tgt.length)), where $(D n) is the sum of lengths of
all input ranges. This approach is faster than keeping an associative