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/qtest/nntree.test | |
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/qtest/nntree.test')
-rw-r--r-- | libtests/qtest/nntree.test | 16 |
1 files changed, 16 insertions, 0 deletions
diff --git a/libtests/qtest/nntree.test b/libtests/qtest/nntree.test new file mode 100644 index 00000000..647ab24f --- /dev/null +++ b/libtests/qtest/nntree.test @@ -0,0 +1,16 @@ +#!/usr/bin/env perl +require 5.008; +use warnings; +use strict; + +require TestDriver; + +my $td = new TestDriver('nntree'); + +$td->runtest("nntree", + {$td->COMMAND => "nntree"}, + {$td->STRING => "all tests passed\n", + $td->EXIT_STATUS => 0}, + $td->NORMALIZE_NEWLINES); + +$td->report(1); |