lkptr
|
Prueba de caja negra de la clase Bin_Tree<E>
.
More...
#include "Bin_Tree.h"
#include "Bin_Tree_Lib.h"
#include "BUnit.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
Go to the source code of this file.
Classes | |
class | test_Bin_Tree< E > |
Prueba la clase Bin_Tree<E> . More... | |
Defines | |
#define | lkptr_NULL_POINTERS_ARE_ALONE |
Functions | |
Bin_Tree< char > | make_FBHCID (std::ostream &COUT) |
Construye el árbol de letras (F (B (C (D))) (H (I))). | |
Bin_Tree< char > | make_FBHCID () |
Construye el árbol de letras (F (B (C (D))) (H (I))). | |
Bin_Tree< char > | make_ab_no () |
Construye el árbol de letras (a (b (f) (h)) (e (i) (k (l) (m (n) (o))))). | |
void | toLower (Bin_Tree< char > T) |
Pasa a minúscula todas las letras de "T" . | |
int | main () |
Programa principal desde donse se invocan todas las pruebas. |
Prueba de caja negra de la clase Bin_Tree<E>
.
Definition in file test_Bin_Tree.cpp.
#define lkptr_NULL_POINTERS_ARE_ALONE |
Definition at line 12 of file test_Bin_Tree.cpp.
Bin_Tree<char> make_FBHCID | ( | std::ostream & | COUT | ) |
Construye el árbol de letras (F (B (C (D))) (H (I))).
COUT
los resultados intermedios. F / \ F B H B F \ \ B F H C I B C F H \ B C D F H I D
Definition at line 87 of file test_Bin_Tree.cpp.
Bin_Tree<char> make_FBHCID | ( | ) |
Construye el árbol de letras (F (B (C (D))) (H (I))).
F / \ B H \ \ C I \ D
Definition at line 109 of file test_Bin_Tree.cpp.
Bin_Tree<char> make_ab_no | ( | ) |
Construye el árbol de letras (a (b (f) (h)) (e (i) (k (l) (m (n) (o))))).
a / \ / \ b e / \ / \ f h i k / \ l m / \ n o
Definition at line 153 of file test_Bin_Tree.cpp.
void toLower | ( | Bin_Tree< char > | T | ) |
Pasa a minúscula todas las letras de "T"
.
Definition at line 191 of file test_Bin_Tree.cpp.
int main | ( | ) |
Programa principal desde donse se invocan todas las pruebas.
Definition at line 922 of file test_Bin_Tree.cpp.