First shot at implementing a very easy, very large LCP array with PSV/NSV queries
Tied in LCP. It predictably segfaults.
Now indexing in the correct direction
Actually saving all the data in the right format and not just single bytes
Added in a left-only extend and a right-only retract. Need to port mapping over to use them and then throw out the double-intervals and stuff and get rid of all the other extends.
Got retract working by this test.
Killed all the silly out-of-bounds access hacks. Actually keeping in range on the LCP
Cleaned up debug prints in retract. Now it works in a vaguely sane way.
Changing FMDIndex mapping around to be inchworm-style.
Mapping using retract tested, seems to actually work
CreateIndex builds
Scala-level tests all pass
Making a start on an alternate LCP algorithm. I think I want to implement a different one though.
Tried implementing the O(N) LCP algorithm, but it keeps wanting to scan through the ends of texts and doesn't seem to work
Now constructing the LCP the right way around. Also defining texts' EOT characters to never equal each other, saving us from ever having to read through one
Removing a bunch of useless wrapping and incrementing fucntions I don't need since I never cross a text boundary when I have the algorithm turned the right way around
Adding a test that compares the new LCP method to the super-easy scan one.
Hacking about with itimers in an attempt to make gprof say something saner-looking about my multithreaded code.
Forgot to add this important thread wrapper
Adding what will eventually be a mapping speed test tool