question: private static int maxNumArcsForDedupByte ( int currentNumDedupBytes ) { int maxArcs = 1 + ( 2 * currentNumDedupBytes ) ; if ( currentNumDedupBytes > 5 ) { maxArcs *= currentNumDedupBytes ; } return Math . min ( maxArcs , 255 ) ; }
target:  Num arcs for nth dedup byte: if n <= 5: 1 + (2 * n) else: (1 + (2 * n)) * n <p> TODO: is there a better way to make the fst built to be more TopNSearcher friendly?