List of headMap() Examples

Examples of headMap()

edu.stanford.ppl.concurrent.SnapTreeMap.headMap()
java.util.NavigableMap.headMap()
Returns a view of the portion of this map whose keys are less than (or equal to, if {@code inclusive} is true) {@code toKey}. 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 toKey high endpoint of the keys in the returned map @param inclusive {@code true} if the high endpointis to be included in the returned view @return a view of the portion of this map whose keys are less than(or equal to, if {@code inclusive} is true) {@code toKey} @throws ClassCastException if {@code toKey} is not compatiblewith this map's comparator (or, if the map has no comparator, if {@code toKey} does not implement {@link Comparable}). Implementations may, but are not required to, throw this exception if {@code toKey} cannot be compared to keyscurrently in the map. @throws NullPointerException if {@code toKey} is nulland this map does not permit null keys @throws IllegalArgumentException if this map itself has arestricted range, and {@code toKey} lies outside thebounds of the range
java.util.SortedMap.headMap()
Returns a view of the portion of this map whose keys are strictly less than toKey. 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 toKey high endpoint (exclusive) of the keys in the returned map @return a view of the portion of this map whose keys are strictlyless than toKey @throws ClassCastException if toKey is not compatiblewith this map's comparator (or, if the map has no comparator, if toKey does not implement {@link Comparable}). Implementations may, but are not required to, throw this exception if toKey cannot be compared to keys currently in the map. @throws NullPointerException if toKey is null andthis map does not permit null keys @throws IllegalArgumentException if this map itself has arestricted range, and toKey lies outside the bounds of the range
java.util.TreeMap.headMap()
@throws ClassCastException {@inheritDoc} @throws NullPointerException if toKey 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.headMap()
@throws ClassCastException {@inheritDoc} @throws NullPointerException {@inheritDoc} @throws IllegalArgumentException {@inheritDoc}
org.apache.commons.collections.SortedBidiMap.headMap()
org.apache.commons.collections15.SortedBidiMap.headMap()
Return a view of the portion of this map whose keys are strictly less than the specified key. @param key Key higher than any in the returned map @return a head map

Examples of java.util.TreeMap.headMap()

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


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

View Full Code Here

Examples of java.util.TreeMap.headMap()

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

View Full Code Here

Examples of java.util.TreeMap.headMap()

        Object comparable = super.evaluateLookup(event, context);
        if (comparable == null) {
            return null;
        }
        comparable = EventBeanUtility.coerce(comparable, coercionType);
        return CompositeIndexQueryRange.handle(event, index.headMap(comparable, true), 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.headMap()

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

View Full Code Here

Examples of java.util.TreeMap.headMap()

                }
                if (!products.containsKey(productId)) {
                    continue;
                }
                TreeMap productMap = (TreeMap)products.get(productId);
                SortedMap subsetMap = productMap.headMap(requiredByDate);
                // iterate and 'reserve'
                Iterator subsetMapKeysIt = subsetMap.keySet().iterator();
                while (subsetMapKeysIt.hasNext()) {
                    Timestamp currentDate = (Timestamp)subsetMapKeysIt.next();
                    Map currentDateMap = (Map) subsetMap.get(currentDate);

View Full Code Here

Examples of java.util.TreeMap.headMap()

                }
                if (!products.containsKey(productId)) {
                    continue;
                }
                TreeMap productMap = (TreeMap)products.get(productId);
                SortedMap subsetMap = productMap.headMap(requiredByDate);
                // iterate and 'reserve'
                Iterator subsetMapKeysIt = subsetMap.keySet().iterator();
                while (subsetMapKeysIt.hasNext()) {
                    Timestamp currentDate = (Timestamp)subsetMapKeysIt.next();
                    Map currentDateMap = (Map) subsetMap.get(currentDate);

View Full Code Here

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

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

View Full Code Here

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

        Object toKey = it.next();
        Object second = it.next();
        Object firstValue = sm.get(first);
        Object secondValue = sm.get(second);
        
        SortedMap head = sm.headMap(toKey);
        assertEquals(1, head.size());
        assertEquals(true, sm.containsKey(first));
        assertEquals(true, head.containsKey(first));
        assertEquals(true, sm.containsValue(firstValue));
        assertEquals(true, head.containsValue(firstValue));

View Full Code Here

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

        
        Object firstValue = sm.get(first);
        Object secondValue = sm.get(second);
        Object toKeyValue = sm.get(toKey);
        
        SortedMap sub = sm.headMap(toKey);
        int size = sm.size();
        assertEquals(2, sub.size());
        sub.clear();
        assertEquals(0, sub.size());
        assertEquals(size - 2, sm.size());

View Full Code Here

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

        Object first = it.next();
        Object second = it.next();
        Object toKey = it.next();
        
        int size = sm.size();
        SortedMap sub = sm.headMap(toKey);
        assertEquals(2, sub.size());
        assertEquals(true, sm.containsKey(first));
        assertEquals(true, sub.containsKey(first));
        assertEquals(true, sm.containsKey(second));
        assertEquals(true, sub.containsKey(second));

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.