mirror of
https://github.com/qpdf/qpdf.git
synced 2024-09-30 14:09:09 +00:00
4a1cce0a47
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.
17 lines
300 B
Perl
17 lines
300 B
Perl
#!/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);
|