\
// compile like this: 
// g++ example.c stree_strmat.c stree_ukkonen.c repeats_supermax.c

// this illustrates a basic use of the library


#include "stree_ukkonen.h"
#include "repeats_supermax.h"

#include <iostream>

using std::cout;

int find_leaves(SUFFIX_TREE tree, STREE_NODE node) {
  int i=1;
  char * str;
  int pos;
  int index;
  while (stree_get_leaf(tree, node, i, &str, &pos, &index)) {
    i++;
    cout<<"pos "<<pos<<" in "<<str<<"\n";
  }
}
	 
int main() {
  SUFFIX_TREE tree;

  if ((tree=stree_new_tree(26, 0, LINKED_LIST, 0))==NULL) {
    cout<<"error creating suffix tree\n";
    exit(1);
  }

  if (stree_ukkonen_add_string(tree, "aabcaabxaaz", NULL, 11, 1)==0) {
    cout<<"error adding string to tree\n";
    exit(1);
  }

  //stree_ukkonen_add_string(tree, "aabc", NULL, 4, 2);


  //finding maximal repeats
  SUPERMAXIMALS repeat=supermax_find(tree, 0, 1);

  while (repeat!=0) {
    cout<<"repeat of length "<<repeat->M
	<<" and multiplicity "<<repeat->num_leaves<<"\n";
    stree_traverse_subtree(tree, repeat->node, find_leaves, NULL);
    cout<<"\n";
    SUPERMAXIMALS prev_repeat=repeat;
    repeat=repeat->next;
    free(prev_repeat);
  }
  
  //matching a string
  STREE_NODE node;
  int pos;
  cout<<"the number of characters of abxc matched in aabcaabxaaz is "
      <<stree_match(tree, "abxc", 4, &node, &pos)<<"\n";
  
  stree_delete_tree(tree);
}