lib 1400378

import com.abahgat.suffixtree.*;

svoid test_GeneralizedSuffixTree() {
  new GeneralizedSuffixTree in;
  
  String word = "cacao";
  in.put(word, 0);

  /* test that every substring is contained within the tree */
  for (String s : allSubstringsWithoutEmpty(word)) {
      assertTrue(in.search(s).contains(0));
  }
  assertEmpty(in.search("caco"));
  assertEmpty(in.search("cacaoo"));
  assertEmpty(in.search("ccacao"));

  in = new GeneralizedSuffixTree();
  word = "bookkeeper";
  in.put(word, 0);
  for (String s : allSubstringsWithoutEmpty(word)) {
      assertTrue(in.search(s).contains(0));
  }
  assertEmpty(in.search("books"));
  assertEmpty(in.search("boke"));
  assertEmpty(in.search("ookepr"));
}