pylucene 3.5.0-3

[pylucene.git] / lucene-java-3.4.0 / lucene / src / test / org / apache / lucene / index / TestPrefixCodedTerms.java

diff --git a/lucene-java-3.4.0/lucene/src/test/org/apache/lucene/index/TestPrefixCodedTerms.java b/lucene-java-3.4.0/lucene/src/test/org/apache/lucene/index/TestPrefixCodedTerms.java
deleted file mode 100644 (file)
index 9578436..0000000
--- a/lucene-java-3.4.0/lucene/src/test/org/apache/lucene/index/TestPrefixCodedTerms.java
+++ /dev/null
@@ -1,136 +0,0 @@
-package org.apache.lucene.index;
-
-/**
- * Licensed to the Apache Software Foundation (ASF) under one or more
- * contributor license agreements.  See the NOTICE file distributed with
- * this work for additional information regarding copyright ownership.
- * The ASF licenses this file to You under the Apache License, Version 2.0
- * (the "License"); you may not use this file except in compliance with
- * the License.  You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-
-import java.util.ArrayList;
-import java.util.Collections;
-import java.util.Iterator;
-import java.util.List;
-import java.util.Set;
-import java.util.TreeSet;
-
-import org.apache.lucene.util.LuceneTestCase;
-import org.apache.lucene.util._TestUtil;
-
-public class TestPrefixCodedTerms extends LuceneTestCase {
-  
-  public void testEmpty() {
-    PrefixCodedTerms.Builder b = new PrefixCodedTerms.Builder();
-    PrefixCodedTerms pb = b.finish();
-    assertFalse(pb.iterator().hasNext());
-  }
-  
-  public void testOne() {
-    Term term = new Term("foo", "bogus");
-    PrefixCodedTerms.Builder b = new PrefixCodedTerms.Builder();
-    b.add(term);
-    PrefixCodedTerms pb = b.finish();
-    Iterator<Term> iterator = pb.iterator();
-    assertTrue(iterator.hasNext());
-    assertEquals(term, iterator.next());
-  }
-  
-  public void testRandom() {
-    Set<Term> terms = new TreeSet<Term>();
-    int nterms = atLeast(10000);
-    for (int i = 0; i < nterms; i++) {
-      Term term = new Term(_TestUtil.randomUnicodeString(random, 2), _TestUtil.randomUnicodeString(random));
-      terms.add(term);
-    }    
-    
-    PrefixCodedTerms.Builder b = new PrefixCodedTerms.Builder();
-    for (Term ref: terms) {
-      b.add(ref);
-    }
-    PrefixCodedTerms pb = b.finish();
-    
-    Iterator<Term> expected = terms.iterator();
-    for (Term t : pb) {
-      assertTrue(expected.hasNext());
-      assertEquals(expected.next(), t);
-    }
-    assertFalse(expected.hasNext());
-  }
-  
-  public void testMergeEmpty() {
-    List<Iterator<Term>> subs = Collections.emptyList();
-    assertFalse(CoalescedDeletes.mergedIterator(subs).hasNext());
-
-    subs = new ArrayList<Iterator<Term>>();
-    subs.add(new PrefixCodedTerms.Builder().finish().iterator());
-    subs.add(new PrefixCodedTerms.Builder().finish().iterator());
-    Iterator<Term> merged = CoalescedDeletes.mergedIterator(subs);
-    assertFalse(merged.hasNext());
-  }
-
-  public void testMergeOne() {
-    Term t1 = new Term("foo", "a");
-    PrefixCodedTerms.Builder b1 = new PrefixCodedTerms.Builder();
-    b1.add(t1);
-    PrefixCodedTerms pb1 = b1.finish();
-    
-    Term t2 = new Term("foo", "b");
-    PrefixCodedTerms.Builder b2 = new PrefixCodedTerms.Builder();
-    b2.add(t2);
-    PrefixCodedTerms pb2 = b2.finish();
-    
-    List<Iterator<Term>> subs = new ArrayList<Iterator<Term>>();
-    subs.add(pb1.iterator());
-    subs.add(pb2.iterator());
-    
-    Iterator<Term> merged = CoalescedDeletes.mergedIterator(subs);
-    assertTrue(merged.hasNext());
-    assertEquals(t1, merged.next());
-    assertTrue(merged.hasNext());
-    assertEquals(t2, merged.next());
-  }
-
-  public void testMergeRandom() {
-    PrefixCodedTerms pb[] = new PrefixCodedTerms[_TestUtil.nextInt(random, 2, 10)];
-    Set<Term> superSet = new TreeSet<Term>();
-    
-    for (int i = 0; i < pb.length; i++) {
-      Set<Term> terms = new TreeSet<Term>();
-      int nterms = _TestUtil.nextInt(random, 0, 10000);
-      for (int j = 0; j < nterms; j++) {
-        Term term = new Term(_TestUtil.randomUnicodeString(random, 2), _TestUtil.randomUnicodeString(random, 4));
-        terms.add(term);
-      }
-      superSet.addAll(terms);
-    
-      PrefixCodedTerms.Builder b = new PrefixCodedTerms.Builder();
-      for (Term ref: terms) {
-        b.add(ref);
-      }
-      pb[i] = b.finish();
-    }
-    
-    List<Iterator<Term>> subs = new ArrayList<Iterator<Term>>();
-    for (int i = 0; i < pb.length; i++) {
-      subs.add(pb[i].iterator());
-    }
-    
-    Iterator<Term> expected = superSet.iterator();
-    Iterator<Term> actual = CoalescedDeletes.mergedIterator(subs);
-    while (actual.hasNext()) {
-      assertTrue(expected.hasNext());
-      assertEquals(expected.next(), actual.next());
-    }
-    assertFalse(expected.hasNext());
-  }
-}