From 4a1cce0a470e6deed6dbeb6093e4e5c16f53439d Mon Sep 17 00:00:00 2001 From: Jay Berkenbilt Date: Sat, 16 Jan 2021 08:31:56 -0500 Subject: 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. --- libtests/build.mk | 1 + 1 file changed, 1 insertion(+) (limited to 'libtests/build.mk') 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 \ -- cgit v1.2.3-70-g09d2