| /external/guava/guava/src/com/google/common/collect/ |
| BoundType.java | 36 * The endpoint value <i>is</i> considered part of the set ("inclusive").
43 static BoundType forBoolean(boolean inclusive) {
44 return inclusive ? CLOSED : OPEN;
|
| ContiguousSet.java | 46 @Override ContiguousSet<C> headSet(C toElement, boolean inclusive) {
47 return headSetImpl(checkNotNull(toElement), inclusive);
69 @Override ContiguousSet<C> tailSet(C fromElement, boolean inclusive){
70 return tailSetImpl(checkNotNull(fromElement), inclusive);
76 /*@Override*/ abstract ContiguousSet<C> headSetImpl(C toElement, boolean inclusive);
81 /*@Override*/ abstract ContiguousSet<C> tailSetImpl(C fromElement, boolean inclusive);
|
| EmptyImmutableSortedSet.java | 105 ImmutableSortedSet<E> headSetImpl(E toElement, boolean inclusive) {
116 ImmutableSortedSet<E> tailSetImpl(E fromElement, boolean inclusive) {
|
| RegularContiguousSet.java | 45 /* @Override */ ContiguousSet<C> headSetImpl(C toElement, boolean inclusive) {
46 return range.intersection(Ranges.upTo(toElement, BoundType.forBoolean(inclusive)))
63 /* @Override */ ContiguousSet<C> tailSetImpl(C fromElement, boolean inclusive) {
64 return range.intersection(Ranges.downTo(fromElement, BoundType.forBoolean(inclusive)))
|
| RegularImmutableSortedSet.java | 200 ImmutableSortedSet<E> headSetImpl(E toElement, boolean inclusive) {
202 if (inclusive) {
220 ImmutableSortedSet<E> tailSetImpl(E fromElement, boolean inclusive) {
222 if (inclusive) {
|
| /external/chromium_org/third_party/icu/source/test/intltest/ |
| tzrulets.h | 45 UDate start, UDate end, UBool inclusive);
47 UDate start, UDate end, UBool inclusive);
|
| /external/icu/icu4c/source/test/intltest/ |
| tzrulets.h | 45 UDate start, UDate end, UBool inclusive);
47 UDate start, UDate end, UBool inclusive);
|
| /libcore/luni/src/main/java/java/util/ |
| NavigableSet.java | 30 * whether lower and upper bounds are inclusive versus exclusive.
181 * {@code fromElement}, inclusive, to {@code toElement}, exclusive
202 * (or equal to, if {@code inclusive} is true) {@code toElement}. The
211 * @param inclusive {@code true} if the high endpoint
214 * (or equal to, if {@code inclusive} is true) {@code toElement}
227 NavigableSet<E> headSet(E toElement, boolean inclusive);
231 * than (or equal to, if {@code inclusive} is true) {@code fromElement}.
240 * @param inclusive {@code true} if the low endpoint
256 NavigableSet<E> tailSet(E fromElement, boolean inclusive);
|
| NavigableMap.java | 33 * whether lower and upper bounds are inclusive versus exclusive.
301 * equal to, if {@code inclusive} is true) {@code toKey}. The returned
310 * @param inclusive {@code true} if the high endpoint
313 * (or equal to, if {@code inclusive} is true) {@code toKey}
326 NavigableMap<K,V> headMap(K toKey, boolean inclusive);
330 * equal to, if {@code inclusive} is true) {@code fromKey}. The returned
339 * @param inclusive {@code true} if the low endpoint
342 * (or equal to, if {@code inclusive} is true) {@code fromKey}
355 NavigableMap<K,V> tailMap(K fromKey, boolean inclusive);
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentNavigableMap.java | 39 ConcurrentNavigableMap<K,V> headMap(K toKey, boolean inclusive);
46 ConcurrentNavigableMap<K,V> tailMap(K fromKey, boolean inclusive);
|
| /external/chromium_org/third_party/icu/source/i18n/unicode/ |
| basictz.h | 45 * @param inclusive Whether the base time is inclusive or not.
50 virtual UBool getNextTransition(UDate base, UBool inclusive, TimeZoneTransition& result) const = 0;
55 * @param inclusive Whether the base time is inclusive or not.
60 virtual UBool getPreviousTransition(UDate base, UBool inclusive, TimeZoneTransition& result) const = 0;
68 * @param start The start time of the evaluated time range (inclusive)
69 * @param end The end time of the evaluated time range (inclusive)
|
| tzrule.h | 132 * @param inclusive Whether the base time is inclusive or not.
140 UBool inclusive, UDate& result) const = 0;
149 * @param inclusive Whether the base time is inclusive or not.
157 UBool inclusive, UDate& result) const = 0;
314 * @param inclusive Whether the base time is inclusive or not.
322 UBool inclusive, UDate& result) const;
331 * @param inclusive Whether the base time is inclusive or not
[all...] |
| rbtz.h | 253 * @param inclusive Whether the base time is inclusive or not.
258 virtual UBool getNextTransition(UDate base, UBool inclusive, TimeZoneTransition& result) const;
263 * @param inclusive Whether the base time is inclusive or not.
268 virtual UBool getPreviousTransition(UDate base, UBool inclusive, TimeZoneTransition& result) const;
312 UBool findNext(UDate base, UBool inclusive, UDate& time, TimeZoneRule*& from, TimeZoneRule*& to) const;
313 UBool findPrev(UDate base, UBool inclusive, UDate& time, TimeZoneRule*& from, TimeZoneRule*& to) const;
|
| /external/icu/icu4c/source/i18n/unicode/ |
| basictz.h | 45 * @param inclusive Whether the base time is inclusive or not.
50 virtual UBool getNextTransition(UDate base, UBool inclusive, TimeZoneTransition& result) const = 0;
55 * @param inclusive Whether the base time is inclusive or not.
60 virtual UBool getPreviousTransition(UDate base, UBool inclusive, TimeZoneTransition& result) const = 0;
68 * @param start The start time of the evaluated time range (inclusive)
69 * @param end The end time of the evaluated time range (inclusive)
|
| tzrule.h | 132 * @param inclusive Whether the base time is inclusive or not.
140 UBool inclusive, UDate& result) const = 0;
149 * @param inclusive Whether the base time is inclusive or not.
157 UBool inclusive, UDate& result) const = 0;
314 * @param inclusive Whether the base time is inclusive or not.
322 UBool inclusive, UDate& result) const;
331 * @param inclusive Whether the base time is inclusive or not
[all...] |
| rbtz.h | 253 * @param inclusive Whether the base time is inclusive or not.
258 virtual UBool getNextTransition(UDate base, UBool inclusive, TimeZoneTransition& result) const;
263 * @param inclusive Whether the base time is inclusive or not.
268 virtual UBool getPreviousTransition(UDate base, UBool inclusive, TimeZoneTransition& result) const;
312 UBool findNext(UDate base, UBool inclusive, UDate& time, TimeZoneRule*& from, TimeZoneRule*& to) const;
313 UBool findPrev(UDate base, UBool inclusive, UDate& time, TimeZoneRule*& from, TimeZoneRule*& to) const;
|
| /external/chromium_org/third_party/icu/source/i18n/ |
| zrule.cpp | 129 int32_t prevDSTSavings, UBool inclusive, UDate& result) {
130 return ((InitialTimeZoneRule*)rule)->InitialTimeZoneRule::getNextStart(base, prevRawOffset, prevDSTSavings, inclusive, result);
135 int32_t prevDSTSavings, UBool inclusive, UDate& result) {
136 return ((InitialTimeZoneRule*)rule)->InitialTimeZoneRule::getPreviousStart(base, prevRawOffset, prevDSTSavings, inclusive, result);
|
| zrule.h | 220 * @param inclusive Whether the base time is inclusive or not.
228 int32_t prevDSTSavings, UBool inclusive, UDate& result);
238 * @param inclusive Whether the base time is inclusive or not.
246 int32_t prevDSTSavings, UBool inclusive, UDate& result);
|
| rbtz.cpp | 544 RuleBasedTimeZone::getNextTransition(UDate base, UBool inclusive, TimeZoneTransition& result) const {
552 UBool found = findNext(base, inclusive, transitionTime, fromRule, toRule);
563 RuleBasedTimeZone::getPreviousTransition(UDate base, UBool inclusive, TimeZoneTransition& result) const {
571 UBool found = findPrev(base, inclusive, transitionTime, fromRule, toRule);
736 RuleBasedTimeZone::findNext(UDate base, UBool inclusive, UDate& transitionTime,
746 if (tt > base || (inclusive && tt == base)) {
753 if (inclusive && tt == base) {
762 UBool avail0 = r0->getNextStart(base, r1->getRawOffset(), r1->getDSTSavings(), inclusive, start0);
763 UBool avail1 = r1->getNextStart(base, r0->getRawOffset(), r0->getDSTSavings(), inclusive, start1);
787 if (tt < base || (!inclusive && tt == base))
[all...] |
| vzone.cpp | 161 vzone_getNextTransition(VZone* zone, UDate base, UBool inclusive, ZTrans* result) {
162 return ((VTimeZone*)zone)->VTimeZone::getNextTransition(base, inclusive, *(TimeZoneTransition*)result);
166 vzone_getPreviousTransition(VZone* zone, UDate base, UBool inclusive, ZTrans* result) {
167 return ((VTimeZone*)zone)->VTimeZone::getPreviousTransition(base, inclusive, *(TimeZoneTransition*)result);
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| RegularContiguousSet.java | 43 /* @Override */ ContiguousSet<C> headSetImpl(C toElement, boolean inclusive) {
44 return range.intersection(Ranges.upTo(toElement, BoundType.forBoolean(inclusive)))
61 /* @Override */ ContiguousSet<C> tailSetImpl(C fromElement, boolean inclusive) {
62 return range.intersection(Ranges.downTo(fromElement, BoundType.forBoolean(inclusive)))
|
| EmptyContiguousSet.java | 59 @Override ContiguousSet<C> headSetImpl(C toElement, boolean inclusive) {
|
| /external/icu/icu4c/source/i18n/ |
| zrule.cpp | 129 int32_t prevDSTSavings, UBool inclusive, UDate& result) {
130 return ((InitialTimeZoneRule*)rule)->InitialTimeZoneRule::getNextStart(base, prevRawOffset, prevDSTSavings, inclusive, result);
135 int32_t prevDSTSavings, UBool inclusive, UDate& result) {
136 return ((InitialTimeZoneRule*)rule)->InitialTimeZoneRule::getPreviousStart(base, prevRawOffset, prevDSTSavings, inclusive, result);
|
| zrule.h | 220 * @param inclusive Whether the base time is inclusive or not.
228 int32_t prevDSTSavings, UBool inclusive, UDate& result);
238 * @param inclusive Whether the base time is inclusive or not.
246 int32_t prevDSTSavings, UBool inclusive, UDate& result);
|
| /external/chromium_org/third_party/smhasher/src/ |
| KeysetTest.h | 136 void SparseKeygenRecurse ( pfHash hash, int start, int bitsleft, bool inclusive, keytype & k, std::vector<hashtype> & hashes )
147 if(inclusive || (bitsleft == 1))
155 SparseKeygenRecurse(hash,i+1,bitsleft-1,inclusive,k,hashes);
165 bool SparseKeyTest ( hashfunc<hashtype> hash, const int setbits, bool inclusive, bool testColl, bool testDist, bool drawDiagram )
167 printf("Keyset 'Sparse' - %d-bit keys with %s %d bits set - ",keybits, inclusive ? "up to" : "exactly", setbits);
176 if(inclusive)
185 SparseKeygenRecurse(hash,0,setbits,inclusive,k,hashes);
|
