Examples of org.apache.lucene.util.collections.IntToIntMap

Package org.apache.lucene.util.collections

Examples of org.apache.lucene.util.collections.IntToIntMap

org.apache.lucene.util.collections.IntToIntMap
An Array-based hashtable which maps primitive int to primitive int.
The hashtable is constracted with a given capacity, or 16 as a default. In case there's not enough room for new pairs, the hashtable grows.
Capacity is adjusted to a power of 2, and there are 2 * capacity entries for the hash. The pre allocated arrays (for keys, values) are at length of capacity + 1, when index 0 is used as 'Ground' or 'NULL'.
The arrays are allocated ahead of hash operations, and form an 'empty space' list, to which the key,value pair is allocated. @lucene.experimental

        new SimpleIntDecoder());


    // Check whether there are any associations
    hasAssociations = associationPayloadIter.init();


    ordinalToAssociationMap = new IntToIntMap();
  }

View Full Code Here

    assertEquals(IntToIntMap.GROUD, value);
  }
  
  @Test
  public void test0() {
    IntToIntMap map = new IntToIntMap();


    assertGround(map.get(0));
    
    for (int i = 0; i < 100; ++i) {
      int value = 100 + i;
      assertFalse(map.containsValue(value));
      map.put(i, value);
      assertTrue(map.containsValue(value));
      assertNotNull(map.get(i));
    }


    assertEquals(100, map.size());
    for (int i = 0; i < 100; ++i) {
      assertTrue(map.containsKey(i));
      assertEquals(100 + i, map.get(i));


    }


    for (int i = 10; i < 90; ++i) {
      map.remove(i);
      assertGround(map.get(i));
    }


    assertEquals(20, map.size());
    for (int i = 0; i < 100; ++i) {
      assertEquals(map.containsKey(i), !(i >= 10 && i < 90));
    }


    for (int i = 5; i < 85; ++i) {
      map.put(i, Integer.valueOf(5 + i));
    }
    assertEquals(95, map.size());
    for (int i = 0; i < 100; ++i) {
      assertEquals(map.containsKey(i), !(i >= 85 && i < 90));
    }
    for (int i = 0; i < 5; ++i) {
      assertEquals(map.get(i), (100 + i));
    }
    for (int i = 5; i < 85; ++i) {
      assertEquals(map.get(i), (5 + i));
    }
    for (int i = 90; i < 100; ++i) {
      assertEquals(map.get(i), (100 + i));
    }
  }

View Full Code Here

    }
  }


  @Test
  public void test1() {
    IntToIntMap map = new IntToIntMap();


    for (int i = 0; i < 100; ++i) {
      map.put(i, Integer.valueOf(100 + i));
    }
    
    HashSet<Integer> set = new HashSet<Integer>();
    
    for (IntIterator iterator = map.iterator(); iterator.hasNext();) {
      set.add(iterator.next());
    }


    assertEquals(set.size(), map.size());
    for (int i = 0; i < 100; ++i) {
      assertTrue(set.contains(Integer.valueOf(100+i)));
    }


    set.clear();
    for (IntIterator iterator = map.iterator(); iterator.hasNext();) {
      Integer integer = iterator.next();
      if (integer % 2 == 1) {
        iterator.remove();
        continue;
      }
      set.add(integer);
    }
    assertEquals(set.size(), map.size());
    for (int i = 0; i < 100; i+=2) {
      assertTrue(set.contains(Integer.valueOf(100+i)));
    }
  }

View Full Code Here

    }
  }
  
  @Test
  public void test2() {
    IntToIntMap map = new IntToIntMap();


    assertTrue(map.isEmpty());
    assertGround(map.get(0));
    for (int i = 0; i < 128; ++i) {
      int value = i * 4096;
      assertFalse(map.containsValue(value));
      map.put(i, value);
      assertTrue(map.containsValue(value));
      assertNotNull(map.get(i));
      assertFalse(map.isEmpty());
    }


    assertEquals(128, map.size());
    for (int i = 0; i < 128; ++i) {
      assertTrue(map.containsKey(i));
      assertEquals(i * 4096, map.get(i));
    }
    
    for (int i = 0 ; i < 200; i+=2) {
      map.remove(i);
    }
    assertEquals(64, map.size());
    for (int i = 1; i < 128; i+=2) {
      assertTrue(map.containsKey(i));
      assertEquals(i * 4096, map.get(i));
      map.remove(i);
    }
    assertTrue(map.isEmpty());
  }

View Full Code Here

    assertTrue(map.isEmpty());
  }
  
  @Test
  public void test3() {
    IntToIntMap map = new IntToIntMap();
    int length = 100;
    for (int i = 0; i < length; ++i) {
      map.put(i*64, 100 + i);
    }
    HashSet<Integer> keySet = new HashSet<Integer>();
    for (IntIterator iit = map.keyIterator(); iit.hasNext(); ) {
      keySet.add(iit.next());
    }
    assertEquals(length, keySet.size());
    for (int i = 0; i < length; ++i) {
      assertTrue(keySet.contains(i * 64));
    }
    
    HashSet<Integer> valueSet = new HashSet<Integer>();
    for (IntIterator iit = map.iterator(); iit.hasNext(); ) {
      valueSet.add(iit.next());
    }
    assertEquals(length, valueSet.size());
    int[] array = map.toArray();
    assertEquals(length, array.length);
    for (int value: array) {
      assertTrue(valueSet.contains(value));
    }
    
    int[] array2 = new int[80];
    array2 = map.toArray(array2);
    assertEquals(length, array2.length);
    for (int value: array2) {
      assertTrue(valueSet.contains(value));
    }
    
    int[] array3 = new int[120];
    array3 = map.toArray(array3);
    for (int i = 0 ;i < length; ++i) {
      assertTrue(valueSet.contains(array3[i]));
    }
    
    for (int i = 0; i < length; ++i) {
      assertTrue(map.containsValue(i + 100));
      assertTrue(map.containsKey(i*64));
    }
    
    for (IntIterator iit = map.keyIterator(); iit.hasNext(); ) {
      iit.next();
      iit.remove();
    }
    assertTrue(map.isEmpty());
    assertEquals(0, map.size());
    
  }

View Full Code Here

  }


  // now with random data.. and lots of it
  @Test
  public void test4() {
    IntToIntMap map = new IntToIntMap();
    int length = ArrayHashMapTest.RANDOM_TEST_NUM_ITERATIONS;
    
    // for a repeatable random sequence
    long seed = random.nextLong();
    Random random = new Random(seed);
    
    for (int i = 0; i < length; ++i) {
      int value = random.nextInt(Integer.MAX_VALUE);
      map.put(i*128, value);
    }


    assertEquals(length, map.size());


    // now repeat
    random.setSeed(seed);


    for (int i = 0; i < length; ++i) {
      int value = random.nextInt(Integer.MAX_VALUE);
      
      assertTrue(map.containsValue(value));
      assertTrue(map.containsKey(i*128));
      assertEquals(value, map.remove(i*128));
    }
    assertEquals(0, map.size());
    assertTrue(map.isEmpty());
  }

View Full Code Here

    assertTrue(map.isEmpty());
  }
  
  @Test
  public void testEquals() {
    IntToIntMap map1 = new IntToIntMap(100);
    IntToIntMap map2 = new IntToIntMap(100);
    assertEquals("Empty maps should be equal", map1, map2);
    assertEquals("hashCode() for empty maps should be equal", 
        map1.hashCode(), map2.hashCode());
    
    for (int i = 0; i < 100; ++i) {
      map1.put(i, 100 + i);
      map2.put(i, 100 + i);
    }
    assertEquals("Identical maps should be equal", map1, map2);
    assertEquals("hashCode() for identical maps should be equal", 
        map1.hashCode(), map2.hashCode());


    for (int i = 10; i < 20; i++) {
      map1.remove(i);
    }
    assertFalse("Different maps should not be equal", map1.equals(map2));
    
    for (int i = 19; i >=10; --i) {
      map2.remove(i);
    }
    assertEquals("Identical maps should be equal", map1, map2);
    assertEquals("hashCode() for identical maps should be equal", 
        map1.hashCode(), map2.hashCode());
    
    map1.put(-1,-1);
    map2.put(-1,-2);
    assertFalse("Different maps should not be equal", map1.equals(map2));
    
    map2.put(-1,-1);
    assertEquals("Identical maps should be equal", map1, map2);
    assertEquals("hashCode() for identical maps should be equal", 
        map1.hashCode(), map2.hashCode());
  }

View Full Code Here

TOP

Related Classes of org.apache.lucene.util.collections.IntToIntMap

org.apache.lucene.facet.enhancements.association.AssociationsPayloadIterator

org.apache.lucene.util.collections.IntToIntMapTest

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.