Open learner-long-life opened 4 months ago
Proposal:
Write Rust unit tests to build suffix trees for these cases, and verify the suffix tree created from either
Eq
xabxac$ (done)
xabxac$
aaaabaaaab
Start with repetition twice, increase as needed for a stress test.
abcdefghijklmnopqrstuvwxyz$
dynamic test, don't pass in the above string all at once, but add in new characters and test that suffix tree handles number of children at each node.
Constructor_false_result.pdf
Found our first false result, going to try and look further into why
Proposal:
Write Rust unit tests to build suffix trees for these cases, and verify the suffix tree created from either
Eq
trait and allow manually creating a SuffixTree that we make by hand to be correct.Cases
Case 1
xabxac$
(done)Case 2
aaaabaaaab
Start with repetition twice, increase as needed for a stress test.
Case 3
abcdefghijklmnopqrstuvwxyz$
dynamic test, don't pass in the above string all at once, but add in new characters and test that suffix tree handles number of children at each node.