File: debug-BTree.C

package info (click to toggle)
magnus 20060324-3
  • links: PTS
  • area: main
  • in suites: etch, etch-m68k
  • size: 19,404 kB
  • ctags: 20,466
  • sloc: cpp: 130,118; ansic: 37,076; tcl: 10,970; perl: 1,109; makefile: 963; sh: 403; yacc: 372; csh: 57; awk: 33; asm: 10
file content (32 lines) | stat: -rw-r--r-- 568 bytes parent folder | download | duplicates (3) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
 
// Copyright (C) 1995 The New York Group Theory Cooperative
// See magnus/doc/COPYRIGHT for the full notice.
//
// Contents: Informal tests of class BTree
//
// Principal Authors: Dmitry Bormotov
//


#include "global.h"
#include "BTree.h"


void main( )
{
  const numOfElt = 17;
  const char Elt[numOfElt+1] = "CAKRMGOTDXSLJZNPW";

  BTree<Char> T;
  for( int i = 0; i < numOfElt; ++i )
    T.insert(Elt[i]);
//  T.insert('Y');
  T.Delete('Z');
  T.printAll();
  

/*
  BTreeIterator<Char> I(T);
  for( ; !I.done(); I.next() )
    cout << I.value() << endl;
*/    
}