Home
last modified time | relevance | path

Searched refs:fromElement (Results 1 – 25 of 40) sorted by relevance

12

/external/guava/guava/src/com/google/common/collect/
DContiguousSet.java50 @Override public ContiguousSet<C> subSet(C fromElement, C toElement) { in subSet() argument
51 checkNotNull(fromElement); in subSet()
53 checkArgument(comparator().compare(fromElement, toElement) <= 0); in subSet()
54 return subSet(fromElement, true, toElement, false); in subSet()
57 @Override ContiguousSet<C> subSet(C fromElement, boolean fromInclusive, C toElement, in subSet() argument
59 checkNotNull(fromElement); in subSet()
61 checkArgument(comparator().compare(fromElement, toElement) <= 0); in subSet()
62 return subSetImpl(fromElement, fromInclusive, toElement, toInclusive); in subSet()
65 @Override public ContiguousSet<C> tailSet(C fromElement) { in tailSet() argument
66 return tailSet(checkNotNull(fromElement), true); in tailSet()
[all …]
DForwardingSortedSet.java86 public SortedSet<E> subSet(E fromElement, E toElement) { in subSet() argument
87 return delegate().subSet(fromElement, toElement); in subSet()
91 public SortedSet<E> tailSet(E fromElement) { in tailSet() argument
92 return delegate().tailSet(fromElement); in tailSet()
163 @Beta protected SortedSet<E> standardSubSet(E fromElement, E toElement) { in standardSubSet() argument
164 return tailSet(fromElement).headSet(toElement); in standardSubSet()
DSortedMultisets.java50 @Override public SortedSet<E> subSet(E fromElement, E toElement) { in subSet() argument
51 return multiset().subMultiset(fromElement, BoundType.CLOSED, toElement, in subSet()
59 @Override public SortedSet<E> tailSet(E fromElement) { in tailSet() argument
60 return multiset().tailMultiset(fromElement, BoundType.CLOSED) in tailSet()
127 @Override public SortedMultiset<E> subMultiset(E fromElement, in subMultiset() argument
129 return forwardMultiset().subMultiset(toElement, toBoundType, fromElement, in subMultiset()
133 @Override public SortedMultiset<E> tailMultiset(E fromElement, in tailMultiset() argument
135 return forwardMultiset().headMultiset(fromElement, boundType) in tailMultiset()
DImmutableSortedSet.java619 public ImmutableSortedSet<E> subSet(E fromElement, E toElement) { in subSet() argument
620 return subSet(fromElement, true, toElement, false); in subSet()
624 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { in subSet() argument
625 checkNotNull(fromElement); in subSet()
627 checkArgument(comparator.compare(fromElement, toElement) <= 0); in subSet()
628 return subSetImpl(fromElement, fromInclusive, toElement, toInclusive); in subSet()
643 public ImmutableSortedSet<E> tailSet(E fromElement) { in tailSet() argument
644 return tailSet(fromElement, true); in tailSet()
647 ImmutableSortedSet<E> tailSet(E fromElement, boolean inclusive) { in tailSet() argument
648 return tailSetImpl(checkNotNull(fromElement), inclusive); in tailSet()
[all …]
DStandardRowSortedTable.java103 public SortedSet<R> subSet(R fromElement, R toElement) { in subSet() argument
104 checkNotNull(fromElement); in subSet()
107 sortedBackingMap().subMap(fromElement, toElement), factory) in subSet()
112 public SortedSet<R> tailSet(R fromElement) { in tailSet() argument
113 checkNotNull(fromElement); in tailSet()
115 sortedBackingMap().tailMap(fromElement), factory).rowKeySet(); in tailSet()
DRegularImmutableSortedSet.java214 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { in subSetImpl() argument
215 return tailSetImpl(fromElement, fromInclusive) in subSetImpl()
220 ImmutableSortedSet<E> tailSetImpl(E fromElement, boolean inclusive) { in tailSetImpl() argument
224 elements, checkNotNull(fromElement), comparator(), FIRST_PRESENT, NEXT_HIGHER); in tailSetImpl()
227 elements, checkNotNull(fromElement), comparator(), FIRST_AFTER, NEXT_HIGHER); in tailSetImpl()
DRegularContiguousSet.java56 /* @Override */ ContiguousSet<C> subSetImpl(C fromElement, boolean fromInclusive, C toElement, in subSetImpl() argument
58 return range.intersection(Ranges.range(fromElement, BoundType.forBoolean(fromInclusive), in subSetImpl()
63 /* @Override */ ContiguousSet<C> tailSetImpl(C fromElement, boolean inclusive) { in tailSetImpl() argument
64 return range.intersection(Ranges.downTo(fromElement, BoundType.forBoolean(inclusive))) in tailSetImpl()
DEmptyImmutableSortedSet.java111 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { in subSetImpl() argument
116 ImmutableSortedSet<E> tailSetImpl(E fromElement, boolean inclusive) { in tailSetImpl() argument
DEmptyContiguousSet.java66 C fromElement, boolean fromInclusive, C toElement, boolean toInclusive) { in subSetImpl() argument
70 @Override ContiguousSet<C> tailSetImpl(C fromElement, boolean fromInclusive) { in tailSetImpl() argument
DConstraints.java178 @Override public SortedSet<E> subSet(E fromElement, E toElement) { in subSet() argument
180 delegate.subSet(fromElement, toElement), constraint); in subSet()
182 @Override public SortedSet<E> tailSet(E fromElement) { in tailSet() argument
183 return constrainedSortedSet(delegate.tailSet(fromElement), constraint); in tailSet()
DAbstractSortedMultiset.java105 public SortedMultiset<E> subMultiset(E fromElement, BoundType fromBoundType, E toElement,
107 return tailMultiset(fromElement, fromBoundType).headMultiset(toElement, toBoundType);
DAbstractMultimap.java692 public SortedSet<V> subSet(V fromElement, V toElement) { in subSet() argument
695 getKey(), getSortedSetDelegate().subSet(fromElement, toElement), in subSet()
700 public SortedSet<V> tailSet(V fromElement) { in tailSet() argument
703 getKey(), getSortedSetDelegate().tailSet(fromElement), in tailSet()
980 public SortedSet<K> subSet(K fromElement, K toElement) { in subSet() argument
981 return new SortedKeySet(sortedMap().subMap(fromElement, toElement)); in subSet()
985 public SortedSet<K> tailSet(K fromElement) { in tailSet() argument
986 return new SortedKeySet(sortedMap().tailMap(fromElement)); in tailSet()
DSets.java850 public SortedSet<E> subSet(E fromElement, E toElement) {
851 return new FilteredSortedSet<E>(((SortedSet<E>) unfiltered).subSet(fromElement, toElement),
861 public SortedSet<E> tailSet(E fromElement) {
862 return new FilteredSortedSet<E>(((SortedSet<E>) unfiltered).tailSet(fromElement), predicate);
DSynchronized.java260 public SortedSet<E> subSet(E fromElement, E toElement) { in subSet() argument
262 return sortedSet(delegate().subSet(fromElement, toElement), mutex); in subSet()
274 public SortedSet<E> tailSet(E fromElement) { in tailSet() argument
276 return sortedSet(delegate().tailSet(fromElement), mutex); in tailSet()
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
DImmutableSortedSet.java333 public ImmutableSortedSet<E> subSet(E fromElement, E toElement) { in subSet() argument
334 return subSet(fromElement, true, toElement, false); in subSet()
337 ImmutableSortedSet<E> subSet(E fromElement, boolean fromInclusive, E toElement, in subSet() argument
339 checkNotNull(fromElement); in subSet()
341 int cmp = comparator().compare(fromElement, toElement); in subSet()
342 checkArgument(cmp <= 0, "fromElement (%s) is less than toElement (%s)", fromElement, toElement); in subSet()
346 return tailSet(fromElement, fromInclusive).headSet(toElement, toInclusive); in subSet()
349 public ImmutableSortedSet<E> tailSet(E fromElement) { in tailSet() argument
350 checkNotNull(fromElement); in tailSet()
352 return unsafeDelegateSortedSet(sortedDelegate.tailSet(fromElement), true); in tailSet()
[all …]
DRegularContiguousSet.java54 /* @Override */ ContiguousSet<C> subSetImpl(C fromElement, boolean fromInclusive, C toElement, in subSetImpl() argument
56 return range.intersection(Ranges.range(fromElement, BoundType.forBoolean(fromInclusive), in subSetImpl()
61 /* @Override */ ContiguousSet<C> tailSetImpl(C fromElement, boolean inclusive) { in tailSetImpl() argument
62 return range.intersection(Ranges.downTo(fromElement, BoundType.forBoolean(inclusive))) in tailSetImpl()
DEmptyContiguousSet.java64 C fromElement, boolean fromInclusive, C toElement, boolean toInclusive) { in subSetImpl() argument
68 @Override ContiguousSet<C> tailSetImpl(C fromElement, boolean fromInclusive) { in tailSetImpl() argument
DSets.java838 public SortedSet<E> subSet(E fromElement, E toElement) {
839 return new FilteredSortedSet<E>(((SortedSet<E>) unfiltered).subSet(fromElement, toElement),
849 public SortedSet<E> tailSet(E fromElement) {
850 return new FilteredSortedSet<E>(((SortedSet<E>) unfiltered).tailSet(fromElement), predicate);
DSynchronized.java247 public SortedSet<E> subSet(E fromElement, E toElement) { in subSet() argument
249 return sortedSet(delegate().subSet(fromElement, toElement), mutex); in subSet()
261 public SortedSet<E> tailSet(E fromElement) { in tailSet() argument
263 return sortedSet(delegate().tailSet(fromElement), mutex); in tailSet()
/external/guava/guava-testlib/src/com/google/common/collect/testing/
DSafeTreeSet.java172 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) { in subSet() argument
174 delegate.subSet(checkValid(fromElement), fromInclusive, in subSet()
178 @Override public SortedSet<E> subSet(E fromElement, E toElement) { in subSet() argument
179 return subSet(fromElement, true, toElement, false); in subSet()
182 @Override public SortedSet<E> tailSet(E fromElement) { in tailSet() argument
183 return tailSet(fromElement, true); in tailSet()
186 @Override public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { in tailSet() argument
187 return delegate.tailSet(checkValid(fromElement), inclusive); in tailSet()
/external/guava/guava-tests/test/com/google/common/collect/
DForwardingSortedSetTest.java100 @Override public SortedSet<T> subSet(T fromElement, T toElement) { in subSet() argument
101 return standardSubSet(fromElement, toElement); in subSet()
/external/webkit/Source/WebCore/dom/
DMouseEvent.h69 Node* fromElement() const;
DMouseEvent.idl56 readonly attribute Node fromElement;
DMouseEvent.cpp125 Node* MouseEvent::fromElement() const in fromElement() function in WebCore::MouseEvent
/external/webkit/Source/WebKit/win/Interfaces/
DDOMEvents.idl297 //readonly attribute Node fromElement;
298 HRESULT fromElement([out, retval] IDOMNode** result);

12