| 1 |
|
package org.apache.lucene.search; |
| 2 |
|
|
| 3 |
|
|
| 4 |
|
|
| 5 |
|
|
| 6 |
|
|
| 7 |
|
|
| 8 |
|
|
| 9 |
|
|
| 10 |
|
|
| 11 |
|
|
| 12 |
|
|
| 13 |
|
|
| 14 |
|
|
| 15 |
|
|
| 16 |
|
|
| 17 |
|
|
| 18 |
|
|
| 19 |
|
import junit.framework.TestCase; |
| 20 |
|
import org.apache.lucene.analysis.SimpleAnalyzer; |
| 21 |
|
import org.apache.lucene.document.*; |
| 22 |
|
import org.apache.lucene.index.IndexReader; |
| 23 |
|
import org.apache.lucene.index.IndexWriter; |
| 24 |
|
import org.apache.lucene.index.TermFreqVector; |
| 25 |
|
import org.apache.lucene.store.RAMDirectory; |
| 26 |
|
import org.apache.lucene.util.English; |
| 27 |
|
|
| 28 |
|
import java.io.IOException; |
| 29 |
|
|
| 30 |
|
|
| 31 |
|
@author |
| 32 |
|
@version |
| 33 |
|
|
|
|
|
| 94.5% |
Uncovered Elements: 3 (55) |
Complexity: 15 |
Complexity Density: 0.43 |
|
| 34 |
|
public class TestMultiThreadTermVectors extends TestCase { |
| 35 |
|
private RAMDirectory directory = new RAMDirectory(); |
| 36 |
|
public int numDocs = 100; |
| 37 |
|
public int numThreads = 3; |
| 38 |
|
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
| 39 |
1
|
public TestMultiThreadTermVectors(String s) {... |
| 40 |
1
|
super(s); |
| 41 |
|
} |
| 42 |
|
|
|
|
|
| 100% |
Uncovered Elements: 0 (9) |
Complexity: 2 |
Complexity Density: 0.29 |
|
| 43 |
1
|
public void setUp() throws Exception {... |
| 44 |
1
|
IndexWriter writer |
| 45 |
|
= new IndexWriter(directory, new SimpleAnalyzer(), true); |
| 46 |
|
|
| 47 |
|
|
| 48 |
101
|
for (int i = 0; i < numDocs; i++) { |
| 49 |
100
|
Document doc = new Document(); |
| 50 |
100
|
Fieldable fld = new Field("field", English.intToEnglish(i), Field.Store.YES, Field.Index.UN_TOKENIZED, Field.TermVector.YES); |
| 51 |
100
|
doc.add(fld); |
| 52 |
100
|
writer.addDocument(doc); |
| 53 |
|
} |
| 54 |
1
|
writer.close(); |
| 55 |
|
|
| 56 |
|
} |
| 57 |
|
|
|
|
|
| 78.6% |
Uncovered Elements: 3 (14) |
Complexity: 5 |
Complexity Density: 0.5 |
1
PASS
|
|
| 58 |
1
|
public void test() {... |
| 59 |
|
|
| 60 |
1
|
IndexReader reader = null; |
| 61 |
|
|
| 62 |
1
|
try { |
| 63 |
1
|
reader = IndexReader.open(directory); |
| 64 |
4
|
for(int i = 1; i <= numThreads; i++) |
| 65 |
3
|
testTermPositionVectors(reader, i); |
| 66 |
|
|
| 67 |
|
|
| 68 |
|
} |
| 69 |
|
catch (IOException ioe) { |
| 70 |
0
|
fail(ioe.getMessage()); |
| 71 |
|
} |
| 72 |
|
finally { |
| 73 |
1
|
if (reader != null) { |
| 74 |
1
|
try { |
| 75 |
|
|
| 76 |
1
|
reader.close(); |
| 77 |
|
} catch (IOException ioe) { |
| 78 |
0
|
ioe.printStackTrace(); |
| 79 |
|
} |
| 80 |
|
} |
| 81 |
|
} |
| 82 |
|
} |
| 83 |
|
|
|
|
|
| 100% |
Uncovered Elements: 0 (27) |
Complexity: 7 |
Complexity Density: 0.41 |
|
| 84 |
3
|
public void testTermPositionVectors(final IndexReader reader, int threadCount) {... |
| 85 |
3
|
MultiThreadTermVectorsReader[] mtr = new MultiThreadTermVectorsReader[threadCount]; |
| 86 |
9
|
for (int i = 0; i < threadCount; i++) { |
| 87 |
6
|
mtr[i] = new MultiThreadTermVectorsReader(); |
| 88 |
6
|
mtr[i].init(reader); |
| 89 |
|
} |
| 90 |
|
|
| 91 |
|
|
| 92 |
|
|
| 93 |
3
|
int threadsAlive = mtr.length; |
| 94 |
66
|
while (threadsAlive > 0) { |
| 95 |
63
|
try { |
| 96 |
|
|
| 97 |
63
|
Thread.sleep(10); |
| 98 |
63
|
threadsAlive = mtr.length; |
| 99 |
71
|
for (int i = 0; i < mtr.length; i++) { |
| 100 |
68
|
if (mtr[i].isAlive() == true) { |
| 101 |
60
|
break; |
| 102 |
|
} |
| 103 |
|
|
| 104 |
8
|
threadsAlive--; |
| 105 |
|
|
| 106 |
|
} |
| 107 |
|
|
| 108 |
|
} catch (InterruptedException ie) {} |
| 109 |
|
} |
| 110 |
|
|
| 111 |
3
|
long totalTime = 0L; |
| 112 |
9
|
for (int i = 0; i < mtr.length; i++) { |
| 113 |
6
|
totalTime += mtr[i].timeElapsed; |
| 114 |
6
|
mtr[i] = null; |
| 115 |
|
} |
| 116 |
|
|
| 117 |
|
|
| 118 |
|
|
| 119 |
|
} |
| 120 |
|
|
| 121 |
|
} |
| 122 |
|
|
|
|
|
| 90% |
Uncovered Elements: 5 (50) |
Complexity: 12 |
Complexity Density: 0.36 |
|
| 123 |
|
class MultiThreadTermVectorsReader implements Runnable { |
| 124 |
|
|
| 125 |
|
private IndexReader reader = null; |
| 126 |
|
private Thread t = null; |
| 127 |
|
|
| 128 |
|
private final int runsToDo = 100; |
| 129 |
|
long timeElapsed = 0; |
| 130 |
|
|
| 131 |
|
|
|
|
|
| 100% |
Uncovered Elements: 0 (4) |
Complexity: 1 |
Complexity Density: 0.25 |
|
| 132 |
6
|
public void init(IndexReader reader) {... |
| 133 |
6
|
this.reader = reader; |
| 134 |
6
|
timeElapsed = 0; |
| 135 |
6
|
t=new Thread(this); |
| 136 |
6
|
t.start(); |
| 137 |
|
} |
| 138 |
|
|
|
|
|
| 60% |
Uncovered Elements: 2 (5) |
Complexity: 2 |
Complexity Density: 0.67 |
|
| 139 |
68
|
public boolean isAlive() {... |
| 140 |
0
|
if (t == null) return false; |
| 141 |
|
|
| 142 |
68
|
return t.isAlive(); |
| 143 |
|
} |
| 144 |
|
|
|
|
|
| 85.7% |
Uncovered Elements: 1 (7) |
Complexity: 3 |
Complexity Density: 0.6 |
|
| 145 |
6
|
public void run() {... |
| 146 |
6
|
try { |
| 147 |
|
|
| 148 |
606
|
for (int i = 0; i < runsToDo; i++) |
| 149 |
600
|
testTermVectors(); |
| 150 |
|
} |
| 151 |
|
catch (Exception e) { |
| 152 |
0
|
e.printStackTrace(); |
| 153 |
|
} |
| 154 |
6
|
return; |
| 155 |
|
} |
| 156 |
|
|
|
|
|
| 100% |
Uncovered Elements: 0 (15) |
Complexity: 2 |
Complexity Density: 0.15 |
|
| 157 |
600
|
private void testTermVectors() throws Exception {... |
| 158 |
|
|
| 159 |
600
|
int numDocs = reader.numDocs(); |
| 160 |
600
|
long start = 0L; |
| 161 |
60587
|
for (int docId = 0; docId < numDocs; docId++) { |
| 162 |
59998
|
start = System.currentTimeMillis(); |
| 163 |
59991
|
TermFreqVector [] vectors = reader.getTermFreqVectors(docId); |
| 164 |
59996
|
timeElapsed += System.currentTimeMillis()-start; |
| 165 |
|
|
| 166 |
|
|
| 167 |
59997
|
verifyVectors(vectors, docId); |
| 168 |
|
|
| 169 |
59975
|
start = System.currentTimeMillis(); |
| 170 |
59974
|
TermFreqVector vector = reader.getTermFreqVector(docId, "field"); |
| 171 |
59999
|
timeElapsed += System.currentTimeMillis()-start; |
| 172 |
|
|
| 173 |
60000
|
vectors = new TermFreqVector[1]; |
| 174 |
60000
|
|