/external/guava/guava/src/com/google/common/collect/ |
D | ContiguousSet.java | 94 @Override public ContiguousSet<C> headSet(C toElement, boolean inclusive) { in headSet() argument 95 return headSetImpl(checkNotNull(toElement), inclusive); in headSet() 125 @Override public ContiguousSet<C> tailSet(C fromElement, boolean inclusive) { in tailSet() argument 126 return tailSetImpl(checkNotNull(fromElement), inclusive); in tailSet() 132 /*@Override*/ abstract ContiguousSet<C> headSetImpl(C toElement, boolean inclusive); in headSetImpl() argument 137 /*@Override*/ abstract ContiguousSet<C> tailSetImpl(C fromElement, boolean inclusive); in tailSetImpl() argument
|
D | RegularImmutableSortedSet.java | 219 ImmutableSortedSet<E> headSetImpl(E toElement, boolean inclusive) { in headSetImpl() argument 220 return getSubSet(0, headIndex(toElement, inclusive)); in headSetImpl() 223 int headIndex(E toElement, boolean inclusive) { in headIndex() argument 226 inclusive ? FIRST_AFTER : FIRST_PRESENT, NEXT_HIGHER); in headIndex() 237 ImmutableSortedSet<E> tailSetImpl(E fromElement, boolean inclusive) { in tailSetImpl() argument 238 return getSubSet(tailIndex(fromElement, inclusive), size()); in tailSetImpl() 241 int tailIndex(E fromElement, boolean inclusive) { in tailIndex() argument 246 inclusive ? FIRST_PRESENT : FIRST_AFTER, NEXT_HIGHER); in tailIndex()
|
D | DescendingImmutableSortedSet.java | 47 ImmutableSortedSet<E> headSetImpl(E toElement, boolean inclusive) { in headSetImpl() argument 48 return forward.tailSet(toElement, inclusive).descendingSet(); in headSetImpl() 58 ImmutableSortedSet<E> tailSetImpl(E fromElement, boolean inclusive) { in tailSetImpl() argument 59 return forward.headSet(fromElement, inclusive).descendingSet(); in tailSetImpl()
|
D | RegularImmutableSortedMap.java | 113 public ImmutableSortedMap<K, V> headMap(K toKey, boolean inclusive) { in headMap() argument 114 return getSubMap(0, keySet.headIndex(checkNotNull(toKey), inclusive)); in headMap() 118 public ImmutableSortedMap<K, V> tailMap(K fromKey, boolean inclusive) { in tailMap() argument 119 return getSubMap(keySet.tailIndex(checkNotNull(fromKey), inclusive), size()); in tailMap()
|
D | ForwardingNavigableSet.java | 210 public NavigableSet<E> headSet(E toElement, boolean inclusive) { in headSet() argument 211 return delegate().headSet(toElement, inclusive); in headSet() 225 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { in tailSet() argument 226 return delegate().tailSet(fromElement, inclusive); in tailSet()
|
D | SortedMultisets.java | 143 public NavigableSet<E> headSet(E toElement, boolean inclusive) { in headSet() argument 145 multiset().headMultiset(toElement, BoundType.forBoolean(inclusive))); in headSet() 149 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { in tailSet() argument 151 multiset().tailMultiset(fromElement, BoundType.forBoolean(inclusive))); in tailSet()
|
D | BoundType.java | 50 static BoundType forBoolean(boolean inclusive) { in forBoolean() argument 51 return inclusive ? CLOSED : OPEN; in forBoolean()
|
D | TreeRangeSet.java | 279 public NavigableMap<Cut<C>, Range<C>> headMap(Cut<C> toKey, boolean inclusive) { in headMap() argument 280 return subMap(Range.upTo(toKey, BoundType.forBoolean(inclusive))); in headMap() 284 public NavigableMap<Cut<C>, Range<C>> tailMap(Cut<C> fromKey, boolean inclusive) { in tailMap() argument 285 return subMap(Range.downTo(fromKey, BoundType.forBoolean(inclusive))); in tailMap() 440 public NavigableMap<Cut<C>, Range<C>> headMap(Cut<C> toKey, boolean inclusive) { 441 return subMap(Range.upTo(toKey, BoundType.forBoolean(inclusive))); 445 public NavigableMap<Cut<C>, Range<C>> tailMap(Cut<C> fromKey, boolean inclusive) { 446 return subMap(Range.downTo(fromKey, BoundType.forBoolean(inclusive))); 520 boolean inclusive = complementLowerBoundWindow.hasUpperBound() 523 Iterators.peekingIterator(positiveRangesByUpperBound.headMap(startingPoint, inclusive) [all …]
|
D | RegularContiguousSet.java | 50 @Override ContiguousSet<C> headSetImpl(C toElement, boolean inclusive) { in headSetImpl() argument 51 return intersectionInCurrentDomain(Range.upTo(toElement, BoundType.forBoolean(inclusive))); in headSetImpl() 65 @Override ContiguousSet<C> tailSetImpl(C fromElement, boolean inclusive) { in tailSetImpl() argument 66 return intersectionInCurrentDomain(Range.downTo(fromElement, BoundType.forBoolean(inclusive))); in tailSetImpl()
|
/external/icu/icu4c/source/i18n/unicode/ |
D | tzrule.h | 140 UBool inclusive, UDate& result) const = 0; 157 UBool inclusive, UDate& result) const = 0; 322 UBool inclusive, UDate& result) const; 339 UBool inclusive, UDate& result) const; 557 UBool inclusive, UDate& result) const; 574 UBool inclusive, UDate& result) const; 763 UBool inclusive, UDate& result) const; 780 UBool inclusive, UDate& result) const;
|
D | rbtz.h | 258 virtual UBool getNextTransition(UDate base, UBool inclusive, TimeZoneTransition& result) const; 268 …virtual UBool getPreviousTransition(UDate base, UBool inclusive, TimeZoneTransition& result) const; 312 …UBool findNext(UDate base, UBool inclusive, UDate& time, TimeZoneRule*& from, TimeZoneRule*& to) c… 313 …UBool findPrev(UDate base, UBool inclusive, UDate& time, TimeZoneRule*& from, TimeZoneRule*& to) c…
|
/external/icu/android_icu4j/src/main/java/android/icu/util/ |
D | RuleBasedTimeZone.java | 322 public TimeZoneTransition getNextTransition(long base, boolean inclusive) { in getNextTransition() argument 331 if (tt > base || (inclusive && tt == base)) { in getNextTransition() 337 if (inclusive && tt == base) { in getNextTransition() 343 finalRules[1].getRawOffset(), finalRules[1].getDSTSavings(), inclusive); in getNextTransition() 345 finalRules[0].getRawOffset(), finalRules[0].getDSTSavings(), inclusive); in getNextTransition() 364 if (tt < base || (!inclusive && tt == base)) { in getNextTransition() 394 public TimeZoneTransition getPreviousTransition(long base, boolean inclusive) { in getPreviousTransition() argument 402 if (inclusive && tt == base) { in getPreviousTransition() 410 if (inclusive && tt == base) { in getPreviousTransition() 416 finalRules[1].getRawOffset(), finalRules[1].getDSTSavings(), inclusive); in getPreviousTransition() [all …]
|
D | TimeArrayTimeZoneRule.java | 90 public Date getNextStart(long base, int prevOffset, int prevDSTSavings, boolean inclusive) { in getNextStart() argument 94 if (time < base || (!inclusive && time == base)) { in getNextStart() 107 public Date getPreviousStart(long base, int prevOffset, int prevDSTSavings, boolean inclusive) { in getPreviousStart() argument 111 if (time < base || (inclusive && time == base)) { in getPreviousStart()
|
D | AnnualTimeZoneRule.java | 175 public Date getNextStart(long base, int prevRawOffset, int prevDSTSavings, boolean inclusive) { in getNextStart() argument 182 if (d != null && (d.getTime() < base || (!inclusive && (d.getTime() == base)))) { in getNextStart() 191 …public Date getPreviousStart(long base, int prevRawOffset, int prevDSTSavings, boolean inclusive) { in getPreviousStart() argument 198 if (d != null && (d.getTime() > base || (!inclusive && (d.getTime() == base)))) { in getPreviousStart()
|
D | InitialTimeZoneRule.java | 69 boolean inclusive) { in getNextStart() argument 79 int prevDSTSavings, boolean inclusive) { in getPreviousStart() argument
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
D | RuleBasedTimeZone.java | 344 public TimeZoneTransition getNextTransition(long base, boolean inclusive) { in getNextTransition() argument 353 if (tt > base || (inclusive && tt == base)) { in getNextTransition() 359 if (inclusive && tt == base) { in getNextTransition() 365 finalRules[1].getRawOffset(), finalRules[1].getDSTSavings(), inclusive); in getNextTransition() 367 finalRules[0].getRawOffset(), finalRules[0].getDSTSavings(), inclusive); in getNextTransition() 386 if (tt < base || (!inclusive && tt == base)) { in getNextTransition() 418 public TimeZoneTransition getPreviousTransition(long base, boolean inclusive) { in getPreviousTransition() argument 426 if (inclusive && tt == base) { in getPreviousTransition() 434 if (inclusive && tt == base) { in getPreviousTransition() 440 finalRules[1].getRawOffset(), finalRules[1].getDSTSavings(), inclusive); in getPreviousTransition() [all …]
|
D | TimeArrayTimeZoneRule.java | 96 public Date getNextStart(long base, int prevOffset, int prevDSTSavings, boolean inclusive) { in getNextStart() argument 100 if (time < base || (!inclusive && time == base)) { in getNextStart() 114 public Date getPreviousStart(long base, int prevOffset, int prevDSTSavings, boolean inclusive) { in getPreviousStart() argument 118 if (time < base || (inclusive && time == base)) { in getPreviousStart()
|
D | AnnualTimeZoneRule.java | 188 public Date getNextStart(long base, int prevRawOffset, int prevDSTSavings, boolean inclusive) { in getNextStart() argument 195 if (d != null && (d.getTime() < base || (!inclusive && (d.getTime() == base)))) { in getNextStart() 205 …public Date getPreviousStart(long base, int prevRawOffset, int prevDSTSavings, boolean inclusive) { in getPreviousStart() argument 212 if (d != null && (d.getTime() > base || (!inclusive && (d.getTime() == base)))) { in getPreviousStart()
|
D | InitialTimeZoneRule.java | 78 boolean inclusive) { in getNextStart() argument 90 int prevDSTSavings, boolean inclusive) { in getPreviousStart() argument
|
/external/icu/icu4c/source/i18n/ |
D | rbtz.cpp | 544 RuleBasedTimeZone::getNextTransition(UDate base, UBool inclusive, TimeZoneTransition& result) const… in getNextTransition() argument 552 UBool found = findNext(base, inclusive, transitionTime, fromRule, toRule); in getNextTransition() 563 RuleBasedTimeZone::getPreviousTransition(UDate base, UBool inclusive, TimeZoneTransition& result) c… in getPreviousTransition() argument 571 UBool found = findPrev(base, inclusive, transitionTime, fromRule, toRule); in getPreviousTransition() 736 RuleBasedTimeZone::findNext(UDate base, UBool inclusive, UDate& transitionTime, in findNext() argument 746 if (tt > base || (inclusive && tt == base)) { in findNext() 753 if (inclusive && tt == base) { in findNext() 762 … UBool avail0 = r0->getNextStart(base, r1->getRawOffset(), r1->getDSTSavings(), inclusive, start0); in findNext() 763 … UBool avail1 = r1->getNextStart(base, r0->getRawOffset(), r0->getDSTSavings(), inclusive, start1); in findNext() 787 if (tt < base || (!inclusive && tt == base)) { in findNext() [all …]
|
D | zrule.cpp | 129 int32_t prevDSTSavings, UBool inclusive, UDate& result) { in izrule_getNextStart() argument 130 …*)rule)->InitialTimeZoneRule::getNextStart(base, prevRawOffset, prevDSTSavings, inclusive, result); in izrule_getNextStart() 135 int32_t prevDSTSavings, UBool inclusive, UDate& result) { in izrule_getPreviousStart() argument 136 …le)->InitialTimeZoneRule::getPreviousStart(base, prevRawOffset, prevDSTSavings, inclusive, result); in izrule_getPreviousStart()
|
D | tzrule.cpp | 354 UBool inclusive, in getNextStart() argument 363 if (tmp < base || (!inclusive && (tmp == base))) { in getNextStart() 378 UBool inclusive, in getPreviousStart() argument 387 if (tmp > base || (!inclusive && (tmp == base))) { in getPreviousStart() 544 UBool inclusive, in getNextStart() argument 549 if (time < base || (!inclusive && time == base)) { in getNextStart() 564 UBool inclusive, in getPreviousStart() argument 569 if (time < base || (inclusive && time == base)) { in getPreviousStart()
|
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
D | RegularContiguousSet.java | 48 @Override ContiguousSet<C> headSetImpl(C toElement, boolean inclusive) { in headSetImpl() argument 49 return intersectionInCurrentDomain(Range.upTo(toElement, BoundType.forBoolean(inclusive))); in headSetImpl() 63 @Override ContiguousSet<C> tailSetImpl(C fromElement, boolean inclusive) { in tailSetImpl() argument 64 return intersectionInCurrentDomain(Range.downTo(fromElement, BoundType.forBoolean(inclusive))); in tailSetImpl()
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/ |
D | SafeTreeSet.java | 122 @Override public NavigableSet<E> headSet(E toElement, boolean inclusive) { in headSet() argument 124 delegate.headSet(checkValid(toElement), inclusive)); in headSet() 186 @Override public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { in tailSet() argument 187 return new SafeTreeSet<E>(delegate.tailSet(checkValid(fromElement), inclusive)); in tailSet()
|
/external/icu/icu4c/source/test/intltest/ |
D | tzrulets.h | 45 UDate start, UDate end, UBool inclusive); 47 UDate start, UDate end, UBool inclusive);
|