Mirror/MarginaliaSearch
1
0
Fork 0
mirror of https://github.com/MarginaliaSearch/MarginaliaSearch.git synced 2025-02-23 21:18:58 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Readme for array

Browse Source
This commit is contained in:
Viktor Lofgren 2023-03-04 19:17:30 +01:00
parent 0b7f8e1459
commit a0482273e0
1 changed files with 4 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
libraries/array/readme.md
View File

@ -30,7 +30,6 @@ array.forEach(0, 100, (pos, val) -> {
## Query Buffers
The library offers many operations for sorting and dealing with sorted data.
The classes [IntQueryBuffer](src/main/java/nu/marginalia/array/buffer/IntQueryBuffer.java)
and [LongQueryBuffer](src/main/java/nu/marginalia/array/buffer/LongQueryBuffer.java) are used
heavily in the search engine's query processing.
@ -73,5 +72,7 @@ buffer.finalizeFiltering();
Especially noteworthy are the operations `retain()` and `reject()` in
[IntArraySearch](src/main/java/nu/marginalia/array/algo/IntArraySearch.java) and [LongArraySearch](src/main/java/nu/marginalia/array/algo/LongArraySearch.java).
They keep or remove all items in the buffer that exist in the range. These are used
to offer an intersection operation for the B-Tree that has in practice sub-linear run time.
They keep or remove all items in the buffer that exist in the referenced range of the array,
which must be sorted.
These are used to offer an intersection operation for the B-Tree with sub-linear run time.