| 1 |
|
package org.apache.lucene.analysis; |
| 2 |
|
|
| 3 |
|
|
| 4 |
|
|
| 5 |
|
|
| 6 |
|
|
| 7 |
|
|
| 8 |
|
|
| 9 |
|
|
| 10 |
|
|
| 11 |
|
|
| 12 |
|
|
| 13 |
|
|
| 14 |
|
|
| 15 |
|
|
| 16 |
|
|
| 17 |
|
|
| 18 |
|
|
| 19 |
|
import java.io.IOException; |
| 20 |
|
import java.io.Reader; |
| 21 |
|
|
| 22 |
|
|
| 23 |
|
|
| 24 |
|
|
|
|
|
| 100% |
Uncovered Elements: 0 (23) |
Complexity: 6 |
Complexity Density: 0.38 |
|
| 25 |
|
public class KeywordTokenizer extends Tokenizer { |
| 26 |
|
|
| 27 |
|
private static final int DEFAULT_BUFFER_SIZE = 256; |
| 28 |
|
|
| 29 |
|
private boolean done; |
| 30 |
|
private final char[] buffer; |
| 31 |
|
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
| 32 |
1
|
public KeywordTokenizer(Reader input) {... |
| 33 |
1
|
this(input, DEFAULT_BUFFER_SIZE); |
| 34 |
|
} |
| 35 |
|
|
|
|
|
| 100% |
Uncovered Elements: 0 (3) |
Complexity: 1 |
Complexity Density: 0.33 |
|
| 36 |
1
|
public KeywordTokenizer(Reader input, int bufferSize) {... |
| 37 |
1
|
super(input); |
| 38 |
1
|
this.buffer = new char[bufferSize]; |
| 39 |
1
|
this.done = false; |
| 40 |
|
} |
| 41 |
|
|
|
|
|
| 100% |
Uncovered Elements: 0 (16) |
Complexity: 4 |
Complexity Density: 0.33 |
|
| 42 |
2
|
public Token next() throws IOException {... |
| 43 |
2
|
if (!done) { |
| 44 |
1
|
done = true; |
| 45 |
1
|
StringBuffer buffer = new StringBuffer(); |
| 46 |
1
|
int length; |
| 47 |
1
|
while (true) { |
| 48 |
2
|
length = input.read(this.buffer); |
| 49 |
2
|
if (length == -1) break; |
| 50 |
|
|
| 51 |
1
|
buffer.append(this.buffer, 0, length); |
| 52 |
|
} |
| 53 |
1
|
String text = buffer.toString(); |
| 54 |
1
|
return new Token(text, 0, text.length()); |
| 55 |
|
} |
| 56 |
1
|
return null; |
| 57 |
|
} |
| 58 |
|
} |