diff options
| author | Jay Berkenbilt <ejb@ql.org> | 2021-01-16 14:31:56 +0100 |
|---|---|---|
| committer | Jay Berkenbilt <ejb@ql.org> | 2021-01-24 09:22:51 +0100 |
| commit | 4a1cce0a470e6deed6dbeb6093e4e5c16f53439d (patch) | |
| tree | c7a124914b6dc2f35fe254ae83a05d653017a9a3 /libtests/build.mk | |
| parent | 9ad6cfd45bbd84d85509327447bee6e9dcaa56c5 (diff) | |
| download | qpdf-4a1cce0a470e6deed6dbeb6093e4e5c16f53439d.tar.zst | |
Reimplement name and number tree object helpers
Create a computationally and memory efficient implementation of name
and number trees that does binary searches as intended by the data
structure rather than loading into a map, which can use a great deal
of memory and can be very slow.
Diffstat (limited to 'libtests/build.mk')
| -rw-r--r-- | libtests/build.mk | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/libtests/build.mk b/libtests/build.mk index 9a68aef2..6f88de32 100644 --- a/libtests/build.mk +++ b/libtests/build.mk @@ -16,6 +16,7 @@ BINS_libtests = \ main_from_wmain \ matrix \ md5 \ + nntree \ numrange \ pointer_holder \ predictors \ |