qpdf/libtests/qtest/nntree.test

#!/usr/bin/env perl
require 5.008;
use warnings;
use strict;

chdir("nntree") or die "chdir testdir failed: $!\n";

require TestDriver;

my $td = new TestDriver('nntree');

$td->runtest("nntree",
	     {$td->COMMAND => "nntree"},
	     {$td->FILE => "nntree.out", $td->EXIT_STATUS => 0},
	     $td->NORMALIZE_NEWLINES);

$td->report(1);
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. 2021-01-16 08:31:56 -05:00			`#!/usr/bin/env perl`
			`require 5.008;`
			`use warnings;`
			`use strict;`

Add iterators to name/number tree helpers 2021-01-16 12:11:17 -05:00			`chdir("nntree") or die "chdir testdir failed: $!\n";`

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. 2021-01-16 08:31:56 -05:00			`require TestDriver;`

			`my $td = new TestDriver('nntree');`

			`$td->runtest("nntree",`
			`{$td->COMMAND => "nntree"},`
Add iterators to name/number tree helpers 2021-01-16 12:11:17 -05:00			`{$td->FILE => "nntree.out", $td->EXIT_STATUS => 0},`
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. 2021-01-16 08:31:56 -05:00			`$td->NORMALIZE_NEWLINES);`

			`$td->report(1);`