| /external/guava/guava/src/com/google/common/collect/ |
| ContiguousSet.java | 42 @Override public ContiguousSet<C> headSet(C toElement) {
43 return headSet(checkNotNull(toElement), false);
46 @Override ContiguousSet<C> headSet(C toElement, boolean inclusive) {
47 return headSetImpl(checkNotNull(toElement), inclusive);
50 @Override public ContiguousSet<C> subSet(C fromElement, C toElement) {
52 checkNotNull(toElement);
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,
60 checkNotNull(toElement);
[all...] |
| ForwardingSortedSet.java | 76 public SortedSet<E> headSet(E toElement) {
77 return delegate().headSet(toElement);
86 public SortedSet<E> subSet(E fromElement, E toElement) {
87 return delegate().subSet(fromElement, toElement);
163 @Beta protected SortedSet<E> standardSubSet(E fromElement, E toElement) {
164 return tailSet(fromElement).headSet(toElement);
|
| SortedMultisets.java | 50 @Override public SortedSet<E> subSet(E fromElement, E toElement) {
51 return multiset().subMultiset(fromElement, BoundType.CLOSED, toElement,
55 @Override public SortedSet<E> headSet(E toElement) {
56 return multiset().headMultiset(toElement, BoundType.OPEN).elementSet();
121 @Override public SortedMultiset<E> headMultiset(E toElement,
123 return forwardMultiset().tailMultiset(toElement, boundType)
128 BoundType fromBoundType, E toElement, BoundType toBoundType) {
129 return forwardMultiset().subMultiset(toElement, toBoundType, fromElement,
|
| StandardRowSortedTable.java | 96 public SortedSet<R> headSet(R toElement) {
97 checkNotNull(toElement);
99 sortedBackingMap().headMap(toElement), factory).rowKeySet();
103 public SortedSet<R> subSet(R fromElement, R toElement) {
105 checkNotNull(toElement);
107 sortedBackingMap().subMap(fromElement, toElement), factory)
|
| ImmutableSortedSet.java | 592 * {@code toElement} greater than an earlier {@code toElement}. However, this
594 * original {@code toElement}.
597 public ImmutableSortedSet<E> headSet(E toElement) {
598 return headSet(toElement, false);
601 ImmutableSortedSet<E> headSet(E toElement, boolean inclusive) {
602 return headSetImpl(checkNotNull(toElement), inclusive);
615 * original {@code toElement}, instead of throwing an exception, if passed a
616 * {@code toElement} greater than an earlier {@code toElement}
[all...] |
| EmptyContiguousSet.java | 61 @Override ContiguousSet<C> headSetImpl(C toElement, boolean inclusive) {
66 C fromElement, boolean fromInclusive, C toElement, boolean toInclusive) {
|
| EmptyImmutableSortedSet.java | 105 ImmutableSortedSet<E> headSetImpl(E toElement, boolean inclusive) {
111 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) {
|
| RegularImmutableSortedSet.java | 200 ImmutableSortedSet<E> headSetImpl(E toElement, boolean inclusive) {
204 elements, checkNotNull(toElement), comparator(), FIRST_AFTER, NEXT_HIGHER);
207 elements, checkNotNull(toElement), comparator(), FIRST_PRESENT, NEXT_HIGHER);
214 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) {
216 .headSetImpl(toElement, toInclusive);
|
| /libcore/luni/src/main/java/java/util/ |
| NavigableSet.java | 164 * {@code fromElement} to {@code toElement}. If {@code fromElement} and
165 * {@code toElement} are equal, the returned set is empty unless {@code
177 * @param toElement high endpoint of the returned set
181 * {@code fromElement}, inclusive, to {@code toElement}, exclusive
183 * {@code toElement} cannot be compared to one another using this
187 * {@code toElement} cannot be compared to elements currently in
190 * {@code toElement} is null and this set does
193 * greater than {@code toElement}; or if this set itself
195 * {@code toElement} lies outside the bounds of the range.
198 E toElement, boolean toInclusive)
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| NamedNodesCollection.cpp | 48 if (node->hasID() && toElement(node)->getIdAttribute() == id)
|
| StaticNodeList.cpp | 53 if (node->isElementNode() && toElement(node)->getIdAttribute() == elementId)
|
| UserActionElementSet.cpp | 46 clearFlags(toElement(node), IsActiveFlag | InActiveChainFlag | IsHoveredFlag);
57 return hasFlags(toElement(node), flags);
64 return setFlags(toElement(node), flags);
71 return clearFlags(toElement(node), flags);
|
| ContainerNodeAlgorithms.cpp | 49 if (ElementShadow* shadow = toElement(node)->shadow()) {
86 if (ElementShadow* shadow = toElement(node)->shadow()) {
105 if (ElementShadow* shadow = toElement(node)->shadow()) {
127 if (ElementShadow* shadow = toElement(node)->shadow()) {
|
| NodeRenderingContext.cpp | 60 if (toElement(renderer->node())->shouldBeReparentedUnderRenderView(renderer->style()))
70 Element* element = m_node->isElementNode() ? toElement(m_node) : 0;
116 ASSERT(!m_node->isElementNode() || !toElement(m_node)->shouldBeReparentedUnderRenderView(m_style.get()));
137 if (m_node->isElementNode() && toElement(m_node)->shouldBeReparentedUnderRenderView(m_style.get())) {
172 Element* element = toElement(m_node);
196 Element* element = toElement(m_node);
211 Element* element = toElement(m_node);
|
| NodeTraversal.h | 105 return toElement(node);
116 return toElement(node);
127 return toElement(node);
138 return toElement(node);
149 return toElement(node);
159 return toElement(node);
167 return toElement(node);
175 return toElement(node);
183 return toElement(node);
|
| NodeRenderingTraversal.cpp | 72 return toElement(parent)->pseudoElement(AFTER);
91 return toElement(parent)->pseudoElement(BEFORE);
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| ImmutableSortedSet.java | 296 public ImmutableSortedSet<E> headSet(E toElement) {
297 checkNotNull(toElement);
299 return unsafeDelegateSortedSet(sortedDelegate.headSet(toElement), true);
317 ImmutableSortedSet<E> headSet(E toElement, boolean inclusive) {
318 checkNotNull(toElement);
320 E tmp = higher(toElement);
324 toElement = tmp;
326 return headSet(toElement);
333 public ImmutableSortedSet<E> subSet(E fromElement, E toElement) {
334 return subSet(fromElement, true, toElement, false)
[all...] |
| EmptyContiguousSet.java | 59 @Override ContiguousSet<C> headSetImpl(C toElement, boolean inclusive) {
64 C fromElement, boolean fromInclusive, C toElement, boolean toInclusive) {
|
| RegularContiguousSet.java | 43 /* @Override */ ContiguousSet<C> headSetImpl(C toElement, boolean inclusive) {
44 return range.intersection(Ranges.upTo(toElement, BoundType.forBoolean(inclusive)))
54 /* @Override */ ContiguousSet<C> subSetImpl(C fromElement, boolean fromInclusive, C toElement,
57 toElement, BoundType.forBoolean(toInclusive))).asSet(domain);
|
| /external/chromium_org/third_party/WebKit/Source/core/css/ |
| SiblingTraversalStrategies.h | 150 ASSERT(element == toElement(m_siblings[m_nth]));
164 ASSERT(element == toElement(m_siblings[m_nth]));
178 ASSERT(element == toElement(m_siblings[m_nth]));
192 ASSERT(element == toElement(m_siblings[m_nth]));
206 ASSERT(element == toElement(m_siblings[m_nth]));
221 ASSERT(element == toElement(m_siblings[m_nth]));
236 ASSERT(element == toElement(m_siblings[m_nth]));
251 ASSERT(element == toElement(m_siblings[m_nth]));
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| SafeTreeSet.java | 118 @Override public SortedSet<E> headSet(E toElement) {
119 return headSet(toElement, false);
122 @Override public NavigableSet<E> headSet(E toElement, boolean inclusive) {
124 delegate.headSet(checkValid(toElement), inclusive));
172 E fromElement, boolean fromInclusive, E toElement, boolean toInclusive) {
175 checkValid(toElement), toInclusive));
178 @Override public SortedSet<E> subSet(E fromElement, E toElement) {
179 return subSet(fromElement, true, toElement, false);
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentSkipListSet.java | 370 * {@code toElement} is null
375 E toElement,
379 toElement, toInclusive));
384 * @throws NullPointerException if {@code toElement} is null
387 public NavigableSet<E> headSet(E toElement, boolean inclusive) {
388 return new ConcurrentSkipListSet<E>(m.headMap(toElement, inclusive));
403 * {@code toElement} is null
406 public NavigableSet<E> subSet(E fromElement, E toElement) {
407 return subSet(fromElement, true, toElement, false);
412 * @throws NullPointerException if {@code toElement} is nul
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/editing/ |
| SplitTextNodeContainingElementCommand.cpp | 60 parent = toElement(firstChild);
|
| /external/chromium_org/third_party/WebKit/Source/core/dom/shadow/ |
| ElementShadow.h | 111 if (ElementShadow* shadow = toElement(this)->shadow())
138 return toElement(parent)->shadow();
|
| /external/chromium_org/third_party/WebKit/Source/core/html/ |
| HTMLDetailsElement.cpp | 77 return toElement(child);
82 return toElement(content->firstChild());
|
