@Override public String debug() { return mId + "; deps = " + Arrays.toString(cp); }
public List<SearchParameter.Include> getIncludes() { Collections.sort(myIncludes); return myIncludes; }
@Override public List<Class> getMessageClassToIntercept() { return Collections.emptyList(); }
public NavigableSet subSet(Object fromElement, boolean fromInclusive, Object toElement, boolean toInclusive) { return (NavigableSet)(descendingMap().subMap(fromElement, fromInclusive, toElement, toInclusive)).keySet(); } public NavigableSet headSet(Object toElement, boolean inclusive) {
/** * @since 1.6 */ public Map.Entry pollFirstEntry() { Entry e = getFirstEntry(); if (e == null) return null; Map.Entry res = new AbstractMap.SimpleImmutableEntry(e); delete(e); return res; }
/** * @since 1.6 */ public Map.Entry pollLastEntry() { Entry e = getLastEntry(); if (e == null) return null; Map.Entry res = new AbstractMap.SimpleImmutableEntry(e); delete(e); return res; }
public static Comparator reverseOrder(Comparator cmp) { return (cmp instanceof ReverseComparator) ? ((ReverseComparator)cmp).cmp : cmp == null ? reverseOrder() : new ReverseComparator(cmp); }
/** * @since 1.6 */ public Map.Entry lowerEntry(Object key) { Map.Entry e = getLowerEntry(key); return (e == null) ? null : new AbstractMap.SimpleImmutableEntry(e); }
/** * @since 1.6 */ public Map.Entry firstEntry() { Entry e = getFirstEntry(); return (e == null) ? null : new AbstractMap.SimpleImmutableEntry(e); }
/** * @since 1.6 */ public Map.Entry lastEntry() { Entry e = getLastEntry(); return (e == null) ? null : new AbstractMap.SimpleImmutableEntry(e); }
/** * @since 1.6 */ public Map.Entry floorEntry(Object key) { Entry e = getFloorEntry(key); return (e == null) ? null : new AbstractMap.SimpleImmutableEntry(e); }
public Map.Entry pollFirstEntry() { TreeMap.Entry e = first(); if (e == null) return null; Map.Entry result = new SimpleImmutableEntry(e); delete(e); return result; }
/** * @since 1.6 */ public Map.Entry ceilingEntry(Object key) { Entry e = getCeilingEntry(key); return (e == null) ? null : new AbstractMap.SimpleImmutableEntry(e); }
/** * @since 1.6 */ public Map.Entry higherEntry(Object key) { Entry e = getHigherEntry(key); return (e == null) ? null : new AbstractMap.SimpleImmutableEntry(e); }
public java.util.Map.Entry pollLastEntry() { TreeMap.Entry e = last(); if (e == null) return null; Map.Entry result = new SimpleImmutableEntry(e); delete(e); return result; }