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

Docs for array and btree

Browse Source
This commit is contained in:
Viktor Lofgren 2023-03-04 18:06:53 +01:00
parent c5ccf0681b
commit cd476dd243
1 changed files with 14 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
libraries/array/readme.md
View File

@ -10,7 +10,7 @@ crosses a page boundary, it is not delegated and a bit slower.
It's a very C++-style library that does unidiomatic things with interface default
functions to get diamond inheritance.
# Quick demo:
## Quick demo:
```java
var array = LongArray.mmapForWriting(Path.of("/tmp/test"), 1<<16);
@ -25,4 +25,16 @@ array.forEach(0, 100, (pos, val) -> {
System.out.println(pos + ":" + val);
});
```
```
## Query Buffers
The library offers many operations for sorting and dealing with sorted data.
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)) which act upon the
classes [IntQueryBuffer](src/main/java/nu/marginalia/array/buffer/IntQueryBuffer.java)
and [LongQueryBuffer](src/main/java/nu/marginalia/array/buffer/LongQueryBuffer.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.