/lucene-3.6.0/lucene/contrib/highlighter/src/java/org/apache/lucene/search/highlight/ |
H A D | PositionSpan.java | 25 int end; field in class:PositionSpan 27 public PositionSpan(int start, int end) { argument 29 this.end = end;
|
/lucene-3.6.0/solr/solrj/src/java/org/apache/noggit/ |
H A D | CharArr.java | 45 protected int end; field in class:CharArr 55 public CharArr(char[] arr, int start, int end) { argument 56 set(arr,start,end); 60 public void setEnd(int end) { this.end = end; } argument 61 public void set(char[] arr, int start, int end) { argument 64 this.end = end; 69 public int getEnd() { return end; } 79 subSequence(int start, int end) argument 199 append(CharSequence csq, int start, int end) argument 229 append(CharSequence csq, int start, int end) argument [all...] |
H A D | CharUtil.java | 28 public long parseLong(char[] arr, int start, int end) { argument 31 for (int i=negative ? start+1 : start; i<end; i++) {
|
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/search/spans/ |
H A D | SpanFirstQuery.java | 27 * start to be zero and only checks the end boundary. 33 /** Construct a SpanFirstQuery matching spans in <code>match</code> whose end 34 * position is less than or equal to <code>end</code>. */ 35 public SpanFirstQuery(SpanQuery match, int end) { argument 36 super(match, 0, end); 41 assert spans.start() != spans.end(); 42 if (spans.start() >= end) 44 else if (spans.end() <= end) 57 buffer.append(end); [all...] |
H A D | SpanPositionRangeQuery.java | 26 * Checks to see if the {@link #getMatch()} lies between a start and end position 32 protected int end; field in class:SpanPositionRangeQuery 34 public SpanPositionRangeQuery(SpanQuery match, int start, int end) { argument 37 this.end = end; 43 assert spans.start() != spans.end(); 44 if (spans.start() >= end) 46 else if (spans.start() >= start && spans.end() <= end) 61 * @return the maximum end positio [all...] |
H A D | Spans.java | 26 * increasing start position and finally by increasing end position. */ 52 /** Returns the end position of the current match. Initially invalid. */ 53 public abstract int end(); method in class:Spans
|
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/search/ |
H A D | SpanFilterResult.java | 67 public void addPosition(int start, int end) argument 69 positions.add(new StartEnd(start, end)); 88 private int end; field in class:SpanFilterResult.StartEnd 91 public StartEnd(int start, int end) { argument 93 this.end = end; 98 * @return The end position of this match 101 return end;
|
/lucene-3.6.0/solr/core/src/java/org/apache/solr/analysis/ |
H A D | TrimFilter.java | 56 int end = 0; 63 // eat the end characters 64 for (end = len; end >= start && termBuffer[end - 1] <= ' '; end--) { 67 if (start > 0 || end < len) { 68 if (start < end) { 69 termAtt.copyBuffer(termBuffer, start, (end - start)); 75 int newEnd = offsetAtt.endOffset() - (start<end [all...] |
H A D | WordDelimiterIterator.java | 28 /** Indicates the end of iteration */ 38 /** end position of text, excluding trailing delimiters */ 44 int end; field in class:WordDelimiterIterator 46 /* does this string end with a possessive such as 's */ 117 current = end; 134 return end = DONE; 137 for (end = current + 1; end < endBounds; end++) { 138 int type = charType(text[end]); [all...] |
H A D | ReversedWildcardFilter.java | 95 int end = (start + len) - 1; 97 char endLow = buffer[end]; 100 for (int i = start; i < mid; ++i, --end) { 102 final char endHigh = buffer[end - 1]; 115 buffer[end] = frontLow; 116 buffer[--end] = frontHigh; 120 endLow = buffer[end - 1]; 123 buffer[end] = frontHigh; 131 buffer[end] = frontLow; 136 // surrogate only at the end [all...] |
/lucene-3.6.0/solr/solrj/src/java/org/apache/solr/common/util/ |
H A D | FastInputStream.java | 29 private int end; field in class:FastInputStream 37 public FastInputStream(InputStream in, byte[] tempBuffer, int start, int end) { argument 41 this.end = end; 51 if (pos >= end) { 53 if (pos >= end) return -1; 59 if (pos >= end) { 61 if (pos >= end) throw new EOFException(); 67 // this will set end to -1 at EOF 68 end [all...] |
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/analysis/ |
H A D | TokenFilter.java | 37 /** Performs end-of-stream operations, if any, and calls then <code>end()</code> on the 39 * <b>NOTE:</b> Be sure to call <code>super.end()</code> first when overriding this method.*/ 41 public void end() throws IOException { method in class:TokenFilter 42 input.end();
|
/lucene-3.6.0/solr/core/src/java/org/apache/solr/util/ |
H A D | BCDUtils.java | 48 // 0004, 004, 04, 4 will all end up being equal 52 // from the end to the start. The return value 58 public static int base10toBase100(char[] arr, int start, int end, argument 65 while (--end >= start) { 66 int val = arr[end]; 71 if (end > start) { 72 int val2 = arr[end-1]; 75 end--; 98 public static int base100toBase10(char[] arr, int start, int end, argument 103 for (int i=start; i<end; 185 base10toBase100SortableInt(char[] arr, int start, int end, char[] out, int outend ) argument 265 base100SortableIntToBase10(char[] arr, int start, int end, char[] out, int offset) argument 309 base10toBase10kSortableInt(char[] arr, int start, int end, char[] out, int outend ) argument 395 base10kSortableIntToBase10(char[] arr, int start, int end, char[] out, int offset) argument [all...] |
H A D | PrimUtils.java | 32 /** Sort the integer array from "start" inclusive to "end" exclusive in ascending order, 36 public static void sort(int start, int end, int[] array, IntComparator comparator) { argument 42 int length = end - start; 44 for (int i = start + 1; i < end; i++) { 53 int middle = (start + end) >>> 1; 56 int top = end - 1; 69 c = d = end - 1; 102 length = d - c < end - 1 - d ? d - c : end - 1 - d; 104 h = end [all...] |
/lucene-3.6.0/lucene/contrib/icu/src/test/org/apache/lucene/analysis/icu/segmentation/ |
H A D | TestLaoBreakIterator.java | 50 int start, end; 53 end = iterator.next(); 54 } while (end != BreakIterator.DONE && !isWord(text, start, end)); 56 assertTrue(end != BreakIterator.DONE); 57 assertEquals(tokens[i], new String(text, start, end - start)); 63 protected boolean isWord(char text[], int start, int end) { argument 65 for (int i = start; i < end; i += UTF16.getCharCount(codepoint)) { 66 codepoint = UTF16.charAt(text, 0, end, start);
|
/lucene-3.6.0/solr/solrj/src/java/org/apache/solr/client/solrj/response/ |
H A D | RangeFacet.java | 32 private final B end; field in class:RangeFacet 38 protected RangeFacet(String name, B start, B end, G gap, Number before, Number after) { argument 41 this.end = end; 64 return end; 81 public Numeric(String name, Number start, Number end, Number gap, Number before, Number after) { argument 82 super(name, start, end, gap, before, after); 89 public Date(String name, java.util.Date start, java.util.Date end, String gap, Number before, Number after) { argument 90 super(name, start, end, gap, before, after);
|
/lucene-3.6.0/lucene/contrib/queryparser/src/java/org/apache/lucene/queryParser/core/nodes/ |
H A D | QuotedFieldQueryNode.java | 37 * @param end 41 int end) { 42 super(field, text, begin, end); 56 return "<quotedfield start='" + this.begin + "' end='" + this.end 40 QuotedFieldQueryNode(CharSequence field, CharSequence text, int begin, int end) argument
|
H A D | FieldQueryNode.java | 48 * The term's end position. 50 protected int end; field in class:FieldQueryNode 64 * @param end 68 int end) { 72 this.end = end; 95 return "<field start='" + this.begin + "' end='" + this.end + "' field='" 130 return this.end; 133 public void setEnd(int end) { argument 67 FieldQueryNode(CharSequence field, CharSequence text, int begin, int end) argument [all...] |
H A D | PathQueryNode.java | 30 * contain the text, begin position and end position in the query. 54 * The term's end position. 56 int end; field in class:PathQueryNode.QueryText 63 * @param end 66 public QueryText(CharSequence value, int begin, int end) { argument 70 this.end = end; 78 clone.end = this.end; 97 * @return the end [all...] |
/lucene-3.6.0/solr/core/src/test/org/apache/solr/util/ |
H A D | PrimUtilsTest.java | 40 int end = start==maxSize ? maxSize : start + random.nextInt(maxSize-start); 41 for (int i=start; i<end; i++) { 44 PrimUtils.sort(start, end, a, comparator); 45 Arrays.sort(b, start, end); 46 for (int i=start; i<end; i++) { 47 assertEquals(a[i], b[end-(i-start+1)]);
|
/lucene-3.6.0/solr/core/src/java/org/apache/solr/search/function/ |
H A D | ReverseOrdFieldSource.java | 66 final int end = sindex.lookup.length; 71 return (float)(end - arr[doc]); 76 return (end - arr[doc]); 81 return (long)(end - arr[doc]); 86 return (double)(end - arr[doc]); 92 return Integer.toString((end - arr[doc]));
|
/lucene-3.6.0/lucene/contrib/queryparser/src/java/org/apache/lucene/queryParser/standard/nodes/ |
H A D | PrefixWildcardQueryNode.java | 39 * @param end 43 int begin, int end) { 44 super(field, text, begin, end); 42 PrefixWildcardQueryNode(CharSequence field, CharSequence text, int begin, int end) argument
|
/lucene-3.6.0/lucene/contrib/analyzers/common/src/java/org/apache/lucene/analysis/fa/ |
H A D | PersianCharFilter.java | 39 final int end = off + charsRead; 40 while (off < end) {
|
/lucene-3.6.0/lucene/contrib/analyzers/common/src/java/org/apache/lucene/analysis/reverse/ |
H A D | ReverseStringFilter.java | 273 int end = (start + len) - 1; 275 char endLow = buffer[end]; 278 for (int i = start; i < mid; ++i, --end) { 280 final char endHigh = buffer[end - 1]; 293 buffer[end] = frontLow; 294 buffer[--end] = frontHigh; 298 endLow = buffer[end - 1]; 301 buffer[end] = frontHigh; 309 buffer[end] = frontLow; 314 // surrogate only at the end [all...] |
/lucene-3.6.0/lucene/contrib/spatial/src/java/org/apache/lucene/spatial/ |
H A D | DistanceUtils.java | 352 int end = idx; 361 while (start < end && externalVal.charAt(start) == ' ') start++; 362 while (end > start && externalVal.charAt(end - 1) == ' ') end--; 363 if (start == end) { 366 out[i] = externalVal.substring(start, end); 368 end = externalVal.indexOf(',', start); 369 idx = end; 370 if (end [all...] |