Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
test-tree-itor.C File Reference
#include <gsl/gsl_rng.h>
#include <iostream>
#include <memory>
#include <tpl_dynBinHeap.H>
#include <tpl_dynSetTree.H>
Include dependency graph for test-tree-itor.C:

Go to the source code of this file.

Classes

struct  GslRngDeleter
 

Typedefs

using GslRngHandle = std::unique_ptr< gsl_rng, GslRngDeleter >
 

Functions

template<class Tree >
void test (size_t n, unsigned long seed)
 
void usage ()
 
int main (int argc, char *argv[])
 

Typedef Documentation

◆ GslRngHandle

using GslRngHandle = std::unique_ptr<gsl_rng, GslRngDeleter>

Definition at line 41 of file test-tree-itor.C.

Function Documentation

◆ main()

int main ( int  argc,
char *  argv[] 
)

Definition at line 81 of file test-tree-itor.C.

References Aleph::divide_and_conquer_partition_dp(), and seed.

◆ test()

template<class Tree >
void test ( size_t  n,
unsigned long  seed 
)

◆ usage()

void usage ( )

Definition at line 74 of file test-tree-itor.C.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::exit().

Referenced by main().