Searched refs:fromElement (Results 1 - 25 of 42) sorted by relevance

12

/external/guava/guava/src/com/google/common/collect/
H A DContiguousSet.java50 @Override public ContiguousSet<C> subSet(C fromElement, C toElement) { argument
51 checkNotNull(fromElement);
53 checkArgument(comparator().compare(fromElement, toElement) <= 0);
54 return subSet(fromElement, true, toElement, false);
57 @Override ContiguousSet<C> subSet(C fromElement, boolean fromInclusive, C toElement, argument
59 checkNotNull(fromElement);
61 checkArgument(comparator().compare(fromElement, toElement) <= 0);
62 return subSetImpl(fromElement, fromInclusive, toElement, toInclusive);
65 @Override public ContiguousSet<C> tailSet(C fromElement) { argument
66 return tailSet(checkNotNull(fromElement), tru
69 tailSet(C fromElement, boolean inclusive) argument
78 subSetImpl(C fromElement, boolean fromInclusive, C toElement, boolean toInclusive) argument
81 tailSetImpl(C fromElement, boolean inclusive) argument
[all...]
H A DForwardingSortedSet.java86 public SortedSet<E> subSet(E fromElement, E toElement) { argument
87 return delegate().subSet(fromElement, toElement);
91 public SortedSet<E> tailSet(E fromElement) { argument
92 return delegate().tailSet(fromElement);
163 @Beta protected SortedSet<E> standardSubSet(E fromElement, E toElement) { argument
164 return tailSet(fromElement).headSet(toElement);
H A DSortedMultisets.java50 @Override public SortedSet<E> subSet(E fromElement, E toElement) { argument
51 return multiset().subMultiset(fromElement, BoundType.CLOSED, toElement,
59 @Override public SortedSet<E> tailSet(E fromElement) { argument
60 return multiset().tailMultiset(fromElement, BoundType.CLOSED)
127 @Override public SortedMultiset<E> subMultiset(E fromElement, argument
129 return forwardMultiset().subMultiset(toElement, toBoundType, fromElement,
133 @Override public SortedMultiset<E> tailMultiset(E fromElement, argument
135 return forwardMultiset().headMultiset(fromElement, boundType)
H A DStandardRowSortedTable.java103 public SortedSet<R> subSet(R fromElement, R toElement) { argument
104 checkNotNull(fromElement);
107 sortedBackingMap().subMap(fromElement, toElement), factory)
112 public SortedSet<R> tailSet(R fromElement) { argument
113 checkNotNull(fromElement);
115 sortedBackingMap().tailMap(fromElement), factory).rowKeySet();
H A DImmutableSortedSet.java612 * {@code fromElement} smaller than an earlier {@code fromElement}. However,
614 * the original {@code fromElement}. Similarly, this method keeps the
619 public ImmutableSortedSet<E> subSet(E fromElement, E toElement) { argument
620 return subSet(fromElement, true, toElement, false);
624 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) {
625 checkNotNull(fromElement);
627 checkArgument(comparator.compare(fromElement, toElement) <= 0);
628 return subSetImpl(fromElement, fromInclusive, toElement, toInclusive);
638 * {@code fromElement} smalle
623 subSet( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
643 tailSet(E fromElement) argument
647 tailSet(E fromElement, boolean inclusive) argument
657 subSetImpl( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
660 tailSetImpl(E fromElement, boolean inclusive) argument
[all...]
H A DEmptyContiguousSet.java66 C fromElement, boolean fromInclusive, C toElement, boolean toInclusive) {
70 @Override ContiguousSet<C> tailSetImpl(C fromElement, boolean fromInclusive) { argument
65 subSetImpl( C fromElement, boolean fromInclusive, C toElement, boolean toInclusive) argument
H A DEmptyImmutableSortedSet.java111 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) {
116 ImmutableSortedSet<E> tailSetImpl(E fromElement, boolean inclusive) { argument
110 subSetImpl( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
H A DRegularImmutableSortedSet.java214 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) {
215 return tailSetImpl(fromElement, fromInclusive)
220 ImmutableSortedSet<E> tailSetImpl(E fromElement, boolean inclusive) { argument
224 elements, checkNotNull(fromElement), comparator(), FIRST_PRESENT, NEXT_HIGHER);
227 elements, checkNotNull(fromElement), comparator(), FIRST_AFTER, NEXT_HIGHER);
213 subSetImpl( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
H A DAbstractSortedMultiset.java105 public SortedMultiset<E> subMultiset(E fromElement, BoundType fromBoundType, E toElement, argument
107 return tailMultiset(fromElement, fromBoundType).headMultiset(toElement, toBoundType);
H A DRegularContiguousSet.java56 /* @Override */ ContiguousSet<C> subSetImpl(C fromElement, boolean fromInclusive, C toElement, argument
58 return range.intersection(Ranges.range(fromElement, BoundType.forBoolean(fromInclusive),
63 /* @Override */ ContiguousSet<C> tailSetImpl(C fromElement, boolean inclusive) { argument
64 return range.intersection(Ranges.downTo(fromElement, BoundType.forBoolean(inclusive)))
H A DConstraints.java178 @Override public SortedSet<E> subSet(E fromElement, E toElement) { argument
180 delegate.subSet(fromElement, toElement), constraint);
182 @Override public SortedSet<E> tailSet(E fromElement) { argument
183 return constrainedSortedSet(delegate.tailSet(fromElement), constraint);
H A DAbstractMultimap.java692 public SortedSet<V> subSet(V fromElement, V toElement) { argument
695 getKey(), getSortedSetDelegate().subSet(fromElement, toElement),
700 public SortedSet<V> tailSet(V fromElement) { argument
703 getKey(), getSortedSetDelegate().tailSet(fromElement),
980 public SortedSet<K> subSet(K fromElement, K toElement) { argument
981 return new SortedKeySet(sortedMap().subMap(fromElement, toElement));
985 public SortedSet<K> tailSet(K fromElement) { argument
986 return new SortedKeySet(sortedMap().tailMap(fromElement));
H A DSets.java850 public SortedSet<E> subSet(E fromElement, E toElement) { argument
851 return new FilteredSortedSet<E>(((SortedSet<E>) unfiltered).subSet(fromElement, toElement),
861 public SortedSet<E> tailSet(E fromElement) { argument
862 return new FilteredSortedSet<E>(((SortedSet<E>) unfiltered).tailSet(fromElement), predicate);
H A DSynchronized.java260 public SortedSet<E> subSet(E fromElement, E toElement) { argument
262 return sortedSet(delegate().subSet(fromElement, toElement), mutex);
274 public SortedSet<E> tailSet(E fromElement) { argument
276 return sortedSet(delegate().tailSet(fromElement), mutex);
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DImmutableSortedSet.java333 public ImmutableSortedSet<E> subSet(E fromElement, E toElement) { argument
334 return subSet(fromElement, true, toElement, false);
337 ImmutableSortedSet<E> subSet(E fromElement, boolean fromInclusive, E toElement, argument
339 checkNotNull(fromElement);
341 int cmp = comparator().compare(fromElement, toElement);
342 checkArgument(cmp <= 0, "fromElement (%s) is less than toElement (%s)", fromElement, toElement);
346 return tailSet(fromElement, fromInclusive).headSet(toElement, toInclusive);
349 public ImmutableSortedSet<E> tailSet(E fromElement) { argument
350 checkNotNull(fromElement);
358 tailSet(E fromElement, boolean inclusive) argument
[all...]
H A DEmptyContiguousSet.java64 C fromElement, boolean fromInclusive, C toElement, boolean toInclusive) {
68 @Override ContiguousSet<C> tailSetImpl(C fromElement, boolean fromInclusive) { argument
63 subSetImpl( C fromElement, boolean fromInclusive, C toElement, boolean toInclusive) argument
H A DRegularContiguousSet.java54 /* @Override */ ContiguousSet<C> subSetImpl(C fromElement, boolean fromInclusive, C toElement, argument
56 return range.intersection(Ranges.range(fromElement, BoundType.forBoolean(fromInclusive),
61 /* @Override */ ContiguousSet<C> tailSetImpl(C fromElement, boolean inclusive) { argument
62 return range.intersection(Ranges.downTo(fromElement, BoundType.forBoolean(inclusive)))
H A DSets.java838 public SortedSet<E> subSet(E fromElement, E toElement) { argument
839 return new FilteredSortedSet<E>(((SortedSet<E>) unfiltered).subSet(fromElement, toElement),
849 public SortedSet<E> tailSet(E fromElement) { argument
850 return new FilteredSortedSet<E>(((SortedSet<E>) unfiltered).tailSet(fromElement), predicate);
H A DSynchronized.java247 public SortedSet<E> subSet(E fromElement, E toElement) { argument
249 return sortedSet(delegate().subSet(fromElement, toElement), mutex);
261 public SortedSet<E> tailSet(E fromElement) { argument
263 return sortedSet(delegate().tailSet(fromElement), mutex);
/external/guava/guava-testlib/src/com/google/common/collect/testing/
H A DSafeTreeSet.java172 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) {
174 delegate.subSet(checkValid(fromElement), fromInclusive,
178 @Override public SortedSet<E> subSet(E fromElement, E toElement) { argument
179 return subSet(fromElement, true, toElement, false);
182 @Override public SortedSet<E> tailSet(E fromElement) { argument
183 return tailSet(fromElement, true);
186 @Override public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { argument
187 return delegate.tailSet(checkValid(fromElement), inclusive);
171 subSet( E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) argument
/external/chromium_org/chrome/browser/resources/print_preview/previewarea/
H A Dmargin_control_container.js360 var fromElement = event.fromElement;
361 while (fromElement != null) {
362 if (fromElement == this.getElement()) {
365 fromElement = fromElement.parentElement;
/external/guava/guava-tests/test/com/google/common/collect/
H A DForwardingSortedSetTest.java100 @Override public SortedSet<T> subSet(T fromElement, T toElement) { argument
101 return standardSubSet(fromElement, toElement);
/external/smali/util/src/main/java/org/jf/util/
H A DArraySortedSet.java136 public SortedSet<T> subSet(T fromElement, T toElement) { argument
146 public SortedSet<T> tailSet(T fromElement) { argument
/external/chromium_org/third_party/WebKit/Source/core/events/
H A DMouseEvent.idl59 [MeasureAs=MouseEventFromElement] readonly attribute Node fromElement;
H A DMouseEvent.h85 Node* fromElement() const;

Completed in 440 milliseconds

12