List of tailMap() Examples

Examples of tailMap()

edu.stanford.ppl.concurrent.SnapTreeMap.tailMap()
java.util.NavigableMap.tailMap()
Returns a view of the portion of this map whose keys are greater than (or equal to, if {@code inclusive} is true) {@code fromKey}. The returned map is backed by this map, so changes in the returned map are reflected in this map, and vice-versa. The returned map supports all optional map operations that this map supports.
The returned map will throw an {@code IllegalArgumentException}on an attempt to insert a key outside its range. @param fromKey low endpoint of the keys in the returned map @param inclusive {@code true} if the low endpointis to be included in the returned view @return a view of the portion of this map whose keys are greater than(or equal to, if {@code inclusive} is true) {@code fromKey} @throws ClassCastException if {@code fromKey} is not compatiblewith this map's comparator (or, if the map has no comparator, if {@code fromKey} does not implement {@link Comparable}). Implementations may, but are not required to, throw this exception if {@code fromKey} cannot be compared to keyscurrently in the map. @throws NullPointerException if {@code fromKey} is nulland this map does not permit null keys @throws IllegalArgumentException if this map itself has arestricted range, and {@code fromKey} lies outside thebounds of the range
java.util.SortedMap.tailMap()
Returns a view of the portion of this map whose keys are greater than or equal to fromKey. The returned map is backed by this map, so changes in the returned map are reflected in this map, and vice-versa. The returned map supports all optional map operations that this map supports.
The returned map will throw an IllegalArgumentException on an attempt to insert a key outside its range. @param fromKey low endpoint (inclusive) of the keys in the returned map @return a view of the portion of this map whose keys are greaterthan or equal to fromKey @throws ClassCastException if fromKey is not compatiblewith this map's comparator (or, if the map has no comparator, if fromKey does not implement {@link Comparable}). Implementations may, but are not required to, throw this exception if fromKey cannot be compared to keys currently in the map. @throws NullPointerException if fromKey is null andthis map does not permit null keys @throws IllegalArgumentException if this map itself has arestricted range, and fromKey lies outside the bounds of the range
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
java.util.concurrent.ConcurrentNavigableMap.tailMap()
@throws ClassCastException {@inheritDoc} @throws NullPointerException {@inheritDoc} @throws IllegalArgumentException {@inheritDoc}
lombok.val.tailMap()
org.apache.commons.collections.SortedBidiMap.tailMap()
org.apache.commons.collections15.SortedBidiMap.tailMap()
Return a view of the portion of this map whose keys are greater than or equal to the specified key. @param key Key less than or equal to any in the returned map @return a tail map

Examples of java.util.TreeMap.tailMap()

        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

Examples of java.util.TreeMap.tailMap()

        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

Examples of java.util.TreeMap.tailMap()

        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

Examples of java.util.TreeMap.tailMap()

        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

Examples of java.util.TreeMap.tailMap()

        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

Examples of java.util.TreeMap.tailMap()


    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

Examples of java.util.concurrent.ConcurrentNavigableMap.tailMap()

    /**
     * headMap returns map with keys in requested range
     */
    public void testTailMapContents() {
        ConcurrentNavigableMap map = map5();
        SortedMap sm = map.tailMap(two);
        assertFalse(sm.containsKey(one));
        assertTrue(sm.containsKey(two));
        assertTrue(sm.containsKey(three));
        assertTrue(sm.containsKey(four));
        assertTrue(sm.containsKey(five));

View Full Code Here

Examples of lombok.val.tailMap()

      }
    });
    
    for (CommentInfo javadoc : javadocs) {
      try {
        Integer key = nodePositions.tailMap(javadoc.endPos).firstKey();
        Node node = nodePositions.get(key);
        if (node instanceof JavadocContainer) {
          attachJavadocToNode(javadoc, (JavadocContainer) node);
        }
      } catch (NoSuchElementException e) {

View Full Code Here

Examples of org.apache.commons.collections.SortedBidiMap.tailMap()

        Object second = it.next();
        Object firstValue = sm.get(first);
        Object fromKeyValue = sm.get(fromKey);
        Object secondValue = sm.get(second);
        
        SortedMap sub = sm.tailMap(fromKey);
        assertEquals(sm.size() - 1, sub.size());
        assertEquals(true, sm.containsKey(first));
        assertEquals(false, sub.containsKey(first));
        assertEquals(true, sm.containsValue(firstValue));
        assertEquals(false, sub.containsValue(firstValue));

View Full Code Here

Examples of org.apache.commons.collections.SortedBidiMap.tailMap()

        
        Object firstValue = sm.get(first);
        Object fromKeyValue = sm.get(fromKey);
        Object secondValue = sm.get(second);
        
        SortedMap sub = sm.tailMap(fromKey);
        int size = sm.size();
        assertEquals(size - 3, sub.size());
        sub.clear();
        assertEquals(0, sub.size());
        assertEquals(3, sm.size());

View Full Code Here

0 1 2 3 4 5

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.