List of firstEntry() Examples

Examples of firstEntry()

java.util.NavigableMap.firstEntry()
Returns a key-value mapping associated with the least key in this map, or {@code null} if the map is empty. @return an entry with the least key,or {@code null} if this map is empty
java.util.TreeMap.firstEntry()
@since 1.6
org.ardverk.dht.storage.Index.Values.firstEntry()
org.xtreemfs.babudb.index.LSMTree.firstEntry()
Returns the first entry. @return the first entry

Examples of java.util.TreeMap.firstEntry()


    public void test_TreeMap_Constructor_Map() {
        TreeMap treeMap = new TreeMap(tm);
        assertEquals(tm.size(), treeMap.size());
        assertEquals(tm.firstKey(), treeMap.firstKey());
        assertEquals(tm.firstEntry(), treeMap.firstEntry());
        assertEquals(tm.lastKey(), treeMap.lastKey());
        assertEquals(tm.lastEntry(), treeMap.lastEntry());
        assertEquals(tm.keySet(), treeMap.keySet());


        String key = new Integer(100).toString();

View Full Code Here

Examples of java.util.TreeMap.firstEntry()

            treeMap.firstKey();
            fail("should throw NoSuchElementException");
        } catch (NoSuchElementException e) {
            // Expected
        }
        assertNull(treeMap.firstEntry());


        try {
            treeMap.lastKey();
            fail("should throw NoSuchElementException");
        } catch (NoSuchElementException e) {

View Full Code Here

Examples of java.util.TreeMap.firstEntry()


        if (useOffset) {
            payload.setOffset(offset);
            topValues.putAll(serverAggregatorResult);
        } else {
            Entry<byte[], byte[]> valueEntry = serverAggregatorResult.firstEntry();
            byte[] currentOrder = valueEntry.getKey();


            boolean isBetter;
            if (isAscending) {
                isBetter = topOrder.compareTo(currentOrder) > 0;

View Full Code Here

Examples of org.ardverk.dht.storage.Index.Values.firstEntry()

    if (values == null) {
      return ResponseFactory.notFound();
    }
    
    if (values.size() == 1) {
      Map.Entry<KUID, Context> value = values.firstEntry();
      return delete(src, key, value.getKey());
    }
    
    return ResponseFactory.list(
        StatusLine.MULTIPLE_CHOICES, key, values);

View Full Code Here

Examples of org.ardverk.dht.storage.Index.Values.firstEntry()

    if (values == null) {
      return ResponseFactory.notFound();
    }
    
    if (values.size() == 1) {
      Map.Entry<KUID, Context> value = values.firstEntry();
      return head(src, key, value.getKey());
    }
    
    return ResponseFactory.list(
        StatusLine.MULTIPLE_CHOICES, key, values);

View Full Code Here

Examples of org.ardverk.dht.storage.Index.Values.firstEntry()

    if (values == null) {
      return null;
    }
    
    if (values.size() == 1) {
      Map.Entry<KUID, Context> value = values.firstEntry();
      return value(src, key, value.getKey(), value.getValue());
    }
    
    return ResponseFactory.list(
        StatusLine.MULTIPLE_CHOICES, key, values);

View Full Code Here

Examples of org.xtreemfs.babudb.index.LSMTree.firstEntry()

            map.put(keys[i], vals[i]);
        }
        
        for (byte[] key : map.keySet())
            assertEquals(new String(map.get(key)), new String(tree.lookup(key)));
        assertEquals(new String(map.firstKey()), new String(tree.firstEntry().getKey()));
        
        // create, materialize and link a new snapshot
        int snapId = tree.createSnapshot();
        tree.materializeSnapshot(SNAP_FILE, snapId);
        tree.linkToSnapshot(SNAP_FILE);

View Full Code Here

Examples of org.xtreemfs.babudb.index.LSMTree.firstEntry()

        tree.materializeSnapshot(SNAP_FILE, snapId);
        tree.linkToSnapshot(SNAP_FILE);
        
        for (byte[] key : map.keySet())
            assertEquals(new String(map.get(key)), new String(tree.lookup(key)));
        assertEquals(new String(map.firstKey()), new String(tree.firstEntry().getKey()));
        
        // insert some more keys-value pairs
        byte[][] newKeys = new byte[][] { "00001".getBytes(), "00006".getBytes(), "00002".getBytes(),
            "00007".getBytes(), "00008".getBytes(), "00009".getBytes(), "00003".getBytes() };
        byte[][] newVals = new byte[][] { null, "gf".getBytes(), "werr".getBytes(), "afds".getBytes(),

View Full Code Here

Examples of org.xtreemfs.babudb.index.LSMTree.firstEntry()

                map.remove(newKeys[i]);
        }
        
        for (byte[] key : map.keySet())
            assertEquals(new String(map.get(key)), new String(tree.lookup(key)));
        assertEquals(new String(map.firstKey()), new String(tree.firstEntry().getKey()));
        
        // perform a prefix lookup
        Iterator<Entry<byte[], byte[]>> it = tree.prefixLookup(new byte[0]);
        Iterator<Entry<byte[], byte[]>> entries = map.entrySet().iterator();

View Full Code Here

Examples of org.xtreemfs.babudb.index.LSMTree.firstEntry()

        tree.materializeSnapshot(SNAP_FILE2, snapId);
        tree.linkToSnapshot(SNAP_FILE2);
        
        for (byte[] key : map.keySet())
            assertEquals(new String(map.get(key)), new String(tree.lookup(key)));
        assertEquals(new String(map.firstKey()), new String(tree.firstEntry().getKey()));
        
        // delete all entries
        for (byte[] key : keys) {
            map.remove(key);
            tree.delete(key);

View Full Code Here

0 1 2

TOP

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.