source: src/tests/avltree/avl_test.c @ d1ef1b0

ADTaaron-thesisarm-ehast-experimentalcleanup-dtorsctordeferred_resndemanglerenumforall-pointer-decayjacob/cs343-translationjenkins-sandboxmemorynew-astnew-ast-unique-exprnew-envno_listpersistent-indexerpthread-emulationqualifiedEnumresolv-newwith_gc
Last change on this file since d1ef1b0 was 6e4b913, checked in by Peter A. Buhr <pabuhr@…>, 8 years ago

allow 32-bit compilation of cfa-cpp, and 32-bit compilation of CFA programs (including CFA libraries)

  • Property mode set to 100644
File size: 1.1 KB
Line 
1#include "avl.h"
2#include "avl-private.h"
3
4extern "C" {
5  int strcmp(const char *, const char *);
6}
7
8int main(){
9  // operations:
10  // find(tree(K, V) *, K)
11  // int empty(tree(K, V) *);
12  // tree(K, V) * insert(tree(K, V) *, K, V);
13  // int remove(tree(K, V) **, K);
14
15  // int -> int
16  tree(int, int) * imap = create(-1, 0);
17  insert(&imap, 12, 13);
18  insert(&imap, 2, 3);
19  assert( height(imap) == 2 );
20
21  printf("%d %d %d\n", *find(imap, 2), *find(imap, 12), *find(imap, -1));
22
23  remove(&imap, -1);
24  delete(imap);
25
26  // int -> char *
27  tree(int, char *) * smap = create(-1, "baz");
28  insert(&smap, 12, "bar");
29  insert(&smap, 2, "foo");
30  assert( height(smap) == 2 );
31
32  printf("%s %s %s\n", *find(smap, 2), *find(smap, 12), *find(smap, -1));
33
34  remove(&smap, -2);
35  delete(smap);
36
37  // char* -> char*
38  int ?<?(char *a, char *b) {
39    return strcmp(a,b) < 0;
40  }
41  tree(char *, char *) * ssmap = create("queso", "cheese");
42  insert(&ssmap, "foo", "bar");
43  insert(&ssmap, "hello", "world");
44  assert( height(ssmap) == 2 );
45
46  printf("%s %s %s\n", *find(ssmap, "hello"), *find(ssmap, "foo"), *find(ssmap, "queso"));
47
48  remove(&ssmap, "foo");
49  delete(ssmap);
50}
Note: See TracBrowser for help on using the repository browser.