- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for recurse_32 (0.09 sec)
-
src/index/suffixarray/sais.go
if j > 0 { w-- sa[w] = j - 1 } } } // recurse_32 calls sais_32 recursively to solve the subproblem we've built. // The subproblem is at the right end of sa, the suffix array result will be // written at the left end of sa, and the middle of sa is available for use as // temporary frequency and bucket storage. func recurse_32(sa, oldTmp []int32, numLMS, maxID int) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 18 23:57:18 UTC 2024 - 32.4K bytes - Viewed (0) -
src/index/suffixarray/suffixarray_test.go
x := make([]byte, size) for i := range x { x[i] = "ab"[i%2] } testSA(t, x, build) }) t.Run("forcealloc", func(t *testing.T) { // Construct a pathological input that forces // recurse_32 to allocate a new temporary buffer. // The input must have more than N/3 LMS-substrings, // which we arrange by repeating an SLSLSLSLSLSL pattern // like ababab... above, but then we must also arrange
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 14.1K bytes - Viewed (0) -
src/index/suffixarray/sais2.go
// in which case there is a subproblem-sized middle of sa that // we can reuse for temporary space (saTmp). // When recurse_64 is called from sais_8_64, oldTmp is length 512 // (from text_64), and saTmp will typically be much larger, so we'll use saTmp. // When deeper recursions come back to recurse_64, now oldTmp is // the saTmp from the top-most recursion, it is typically larger than
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 18 23:57:18 UTC 2024 - 52.3K bytes - Viewed (0)