Examples of java.util.TreeMap.tailMap()

java.util.TreeMap.tailMap()
@throws ClassCastException {@inheritDoc} @throws NullPointerException if fromKey is nulland this map uses natural ordering, or its comparator does not permit null keys @throws IllegalArgumentException {@inheritDoc} @since 1.6

            indexes.put(index, key);
          }
          if (firstIndex == null) {
            return indexes.values().iterator();
          }
          return indexes.tailMap(firstIndex).values().iterator();
        }
        else {
          MBeanAttributeKeyProvider keyProvider = mBeanInfo.getKeyProvider();
          return keyProvider.keyTailIterator(server, firstRowId);
        }

View Full Code Here

        lock.lock();
        try {
            TreeMap pool = getPool(direct ? directPools[index]
                    : heapPools[index]);
            if (pool != null) {
                for (Iterator iter = pool.tailMap(key).values().iterator(); iter
                        .hasNext();) {
                    Entry first = (Entry) iter.next();
                    Entry next = first.next;
                    if (next != null) {
                        first.next = next.next;

View Full Code Here

        Object comparable = super.evaluateLookup(event, context);
        if (comparable == null) {
            return null;
        }
        comparable = EventBeanUtility.coerce(comparable, coercionType);
        return CompositeIndexQueryRange.handle(event, index.tailMap(comparable), null, result, next);
    }


    public Collection<EventBean> lookup(EventBean[] eventPerStream, Map parent, Collection<EventBean> result, CompositeIndexQuery next, ExprEvaluatorContext context) {
        TreeMap index = (TreeMap) parent;
        Object comparable = super.evaluatePerStream(eventPerStream, context);

View Full Code Here

        Object comparable = super.evaluatePerStream(eventPerStream, context);
        if (comparable == null) {
            return null;
        }
        comparable = EventBeanUtility.coerce(comparable, coercionType);
        return CompositeIndexQueryRange.handle(eventPerStream, index.tailMap(comparable), null, result, next);
    }
}

View Full Code Here

        Object comparable = super.evaluateLookup(event, context);
        if (comparable == null) {
            return null;
        }
        comparable = EventBeanUtility.coerce(comparable, coercionType);
        return CompositeIndexQueryRange.handle(event, index.tailMap(comparable, false), null, result, next);
    }


    public Collection<EventBean> lookup(EventBean[] eventPerStream, Map parent, Collection<EventBean> result, CompositeIndexQuery next, ExprEvaluatorContext context) {
        TreeMap index = (TreeMap) parent;
        Object comparable = super.evaluatePerStream(eventPerStream, context);

View Full Code Here

        Object comparable = super.evaluatePerStream(eventPerStream, context);
        if (comparable == null) {
            return null;
        }
        comparable = EventBeanUtility.coerce(comparable, coercionType);
        return CompositeIndexQueryRange.handle(eventPerStream, index.tailMap(comparable, false), null, result, next);
    }
}

View Full Code Here


    public SortedMap getNodesAfter(Fqn fqn)
    {
        SortedMap sm = new TreeMap(fqnComparator);
        sm.putAll( nodes );
        return sm.tailMap(fqn);
    }


    public boolean isVersioningImplicit()
    {
        return versioningImplicit;

View Full Code Here

        } catch(java.util.NoSuchElementException e) {
        }
        
        TreeMap t = new TreeMap();
        try {
            SortedMap th = t.tailMap(null);
            fail("Should throw a NullPointerException");
        } catch( NullPointerException npe) {
            // expected
        }

View Full Code Here

        assertTrue("Returned collection of incorrect size", vals.size() == 399);
        assertEquals(399,vals.toArray().length);
        
        myTreeMap.put(300, objArray[300]);
        // Test for method values() in subMaps
        vals = myTreeMap.tailMap(400).values();
        assertEquals("Returned collection of incorrect size", vals.size(), 600);
        for (int i = 400; i < 1000; i++) {
            assertTrue("Collection contains incorrect elements "+i, vals
                    .contains(objArray[i]));
        }

View Full Code Here

        Object comparable = super.evaluatePerStream(eventPerStream, context);
        if (comparable == null) {
            return null;
        }
        comparable = EventBeanUtility.coerce(comparable, coercionType);
        return CompositeIndexQueryRange.handle(eventPerStream, index.tailMap(comparable), null, result, next);
    }
}

View Full Code Here

0 1

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.