Searched refs:TESTSTRINGLEN (Results 1 – 3 of 3) sorted by relevance
1830 int TESTSTRINGLEN = 500; in RunMonkey() local1834 int[] expected = new int[TESTSTRINGLEN*2 + 1]; in RunMonkey()1836 boolean[] expectedBreaks = new boolean[TESTSTRINGLEN*2 + 1]; in RunMonkey()1837 boolean[] forwardBreaks = new boolean[TESTSTRINGLEN*2 + 1]; in RunMonkey()1838 boolean[] reverseBreaks = new boolean[TESTSTRINGLEN*2 + 1]; in RunMonkey()1839 boolean[] isBoundaryBreaks = new boolean[TESTSTRINGLEN*2 + 1]; in RunMonkey()1840 boolean[] followingBreaks = new boolean[TESTSTRINGLEN*2 + 1]; in RunMonkey()1841 boolean[] precedingBreaks = new boolean[TESTSTRINGLEN*2 + 1]; in RunMonkey()1901 for (i=0; i<TESTSTRINGLEN; i++) { in RunMonkey()
1831 int TESTSTRINGLEN = 500; in RunMonkey() local1835 int[] expected = new int[TESTSTRINGLEN*2 + 1]; in RunMonkey()1837 boolean[] expectedBreaks = new boolean[TESTSTRINGLEN*2 + 1]; in RunMonkey()1838 boolean[] forwardBreaks = new boolean[TESTSTRINGLEN*2 + 1]; in RunMonkey()1839 boolean[] reverseBreaks = new boolean[TESTSTRINGLEN*2 + 1]; in RunMonkey()1840 boolean[] isBoundaryBreaks = new boolean[TESTSTRINGLEN*2 + 1]; in RunMonkey()1841 boolean[] followingBreaks = new boolean[TESTSTRINGLEN*2 + 1]; in RunMonkey()1842 boolean[] precedingBreaks = new boolean[TESTSTRINGLEN*2 + 1]; in RunMonkey()1902 for (i=0; i<TESTSTRINGLEN; i++) { in RunMonkey()
4250 const int32_t TESTSTRINGLEN = 500; in RunMonkey() local4254 int expected[TESTSTRINGLEN*2 + 1]; in RunMonkey()4256 char expectedBreaks[TESTSTRINGLEN*2 + 1]; in RunMonkey()4257 char forwardBreaks[TESTSTRINGLEN*2 + 1]; in RunMonkey()4258 char reverseBreaks[TESTSTRINGLEN*2+1]; in RunMonkey()4259 char isBoundaryBreaks[TESTSTRINGLEN*2+1]; in RunMonkey()4260 char followingBreaks[TESTSTRINGLEN*2+1]; in RunMonkey()4261 char precedingBreaks[TESTSTRINGLEN*2+1]; in RunMonkey()4299 for (i=0; i<TESTSTRINGLEN; i++) { in RunMonkey()