Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
test_tree_node.C File Reference
#include <iostream>
#include <memory>
#include <string>
#include <stdexcept>
#include <ah-errors.H>
#include <tpl_tree_node.H>
#include <tpl_dynArray.H>
#include <cassert>
Include dependency graph for test_tree_node.C:

Go to the source code of this file.

Functions

void print_node (Tree_Node< int > *node, int level, int index)
 
bool is_string_an_int (const string &str)
 
int * string_to_deway (const string &str, size_t &size)
 
int main ()
 

Function Documentation

◆ is_string_an_int()

bool is_string_an_int ( const string &  str)

Definition at line 46 of file test_tree_node.C.

References Aleph::divide_and_conquer_partition_dp().

Referenced by string_to_deway().

◆ main()

◆ print_node()

void print_node ( Tree_Node< int > *  node,
int  level,
int  index 
)

Definition at line 39 of file test_tree_node.C.

References Aleph::divide_and_conquer_partition_dp(), and Aleph::Tree_Node< T >::get_data().

Referenced by main().

◆ string_to_deway()

int * string_to_deway ( const string &  str,
size_t &  size 
)