Package cleo.search

Examples of cleo.search.Element

358
359
360
361
362
363
364
365
366
367
368
369
370
371
    int cnt = rand.nextInt(100) + 10;
    ArrayList<Element> elemList = new ArrayList<Element>(cnt);
    ArrayList<Hit<Element>> hitList = new ArrayList<Hit<Element>>(cnt);
   
    for(int i = 0; i < cnt; i++) {
      Element elem = new SimpleElement(i);
      elem.setTerms(terms);
      elem.setScore(rand.nextFloat());
      elem.setTimestamp(System.currentTimeMillis());
      elemList.add(elem);
     
      ctx.clear();
      selector.select(elem, ctx);
      hitList.add(new ElementHit<Element>(elem, ctx.getScore()));
View Full Code Here
391
392
393
394
395
396
397
398
399
400
401
402
403
      assertEquals(elemList.get(i), hitList.get(i).getElement());
    }
  }
 
  public void testStringPrefixSelector() {
    Element elem = new SimpleElement(1);
    elem.setTerms(new String[] {"open", "source", "software", "systems"});
    elem.setTimestamp(System.currentTimeMillis());
   
    SelectorContext ctx = new SelectorContext();
   
    Selector<Element> selector = new StrictPrefixSelector<Element>("soft", "system");
    assertTrue(selector.select(elem, ctx));
View Full Code Here
33
34
35
36
37
38
39
40
41
42
43
44
*/
public class TestElementHit extends TestCase {

  public void testCompareTo() {
    Random rand = new Random();
    Element e1 = new SimpleElement(10);
    Element e2 = new SimpleElement(11);
   
    String source = getClass().getSimpleName();
   
    // same score, same proximity, different elementId
    double score = rand.nextDouble();
View Full Code Here
123
124
125
126
127
128
129
130
131
132
133
 
  public void testFnvBloomFilter() {
    int indexFilter, queryFilter;
    BloomFilter<Integer> filter = new FnvBloomFilter(2);
   
    Element element = createElement(1, new String[] {"professional", "social", "network"});
    indexFilter = filter.computeIndexFilter(element);
   
    queryFilter = filter.computeQueryFilter(new String[]{"professional", "social", "network"});
    assertEquals(queryFilter, (queryFilter & indexFilter));
   
View Full Code Here
149
150
151
152
153
154
155
156
157
158
159
 
  public void testFnvBloomFilterLong() {
    long indexFilter, queryFilter;
    BloomFilter<Long> filter = new FnvBloomFilterLong(2);
   
    Element element = createElement(1, new String[] {"professional", "social", "network"});
    indexFilter = filter.computeIndexFilter(element);
   
    queryFilter = filter.computeQueryFilter(new String[]{"professional", "social", "network"});
    assertEquals(queryFilter, (queryFilter & indexFilter));
   
View Full Code Here
48
49
50
51
52
53
54
55
56
57
58
    assertEquals(capacity, c.capacity());
    assertEquals(0, c.size());
   
    int cnt = Math.max(1, rand.nextInt(1000));
    for(int i = 0; i < cnt; i++) {
      Element element = new SimpleElement(i);
      c.add(new ElementHit<Element>(element, rand.nextDouble()));
    }
   
    int size = Math.min(c.capacity(), cnt);
    assertEquals(size, c.size());
View Full Code Here
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
    float maxScore = 0;
    Collector<Element> c = new SortedCollector<Element>(capacity);
    assertTrue(c.isEmpty());
   
    for(int i = 0; i < 100; i++) {
      Element element = new SimpleElement(i);
      float score = rand.nextFloat();
      element.setScore(score);
      maxScore = Math.max(maxScore, score);
      c.add(new ElementHit<Element>(element, score));
    }
   
    assertEquals(capacity, c.capacity());
    assertEquals(capacity, c.size());
    assertFalse(c.isEmpty());
   
    List<Element> results = c.elements();
    assertEquals(capacity, results.size());
    assertEquals(maxScore, results.get(0).getScore());
   
    float score = maxScore;
    for(int i = 0, cnt = results.size(); i < cnt; i++) {
      Element element = results.get(i);
      assertTrue(score >= element.getScore());
      score = element.getScore();
    }
   
    c.clear();
    assertEquals(capacity, c.capacity());
    assertEquals(0, c.size());
View Full Code Here
107
108
109
110
111
112
113
114
115
116
117
    Collector<Element> c = new SortedCollector<Element>(capacity);
    assertTrue(c.isEmpty());
   
    double score = rand.nextDouble();
    for(int i = 0; i < numElems; i++) {
      Element element = new SimpleElement(i);
      c.add(element, score, getClass().getSimpleName());
    }
   
    assertEquals(capacity, c.capacity());
    assertEquals(capacity, c.size());
View Full Code Here
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
    Collector<Element> c = new SortedCollector<Element>(10, 10);
    assertEquals(10, c.capacity());
   
    double score = rand.nextDouble();
    for(int i = 0; i < c.capacity(); i++) {
      Element element = new SimpleElement(i);
      c.add(element, score, getClass().getSimpleName());
    }
   
    assertEquals(c.capacity(), c.size());
   
    for(int i = 0; i < c.capacity(); i++) {
      Element element = new SimpleElement(i + c.capacity());
      c.add(element, score, getClass().getSimpleName());
    }
   
    assertEquals(c.capacity(), c.size());
   
View Full Code Here
TOP

Related Classes of cleo.search.Element

  • cleo.search.test.TestBloomFilter
  • cleo.search.test.TestCollector
  • cleo.search.test.TestElementHit
  • cleo.search.test.TestNetworkSortedCollector
  • cleo.search.test.TestSelector
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.