Searched refs:inclusive (Results 1 - 25 of 76) sorted by relevance

1234

/external/guava/guava/src/com/google/common/collect/
H A DBoundType.java36 * The endpoint value <i>is</i> considered part of the set ("inclusive").
43 static BoundType forBoolean(boolean inclusive) { argument
44 return inclusive ? CLOSED : OPEN;
H A DContiguousSet.java46 @Override ContiguousSet<C> headSet(C toElement, boolean inclusive) { argument
47 return headSetImpl(checkNotNull(toElement), inclusive);
69 @Override ContiguousSet<C> tailSet(C fromElement, boolean inclusive){ argument
70 return tailSetImpl(checkNotNull(fromElement), inclusive);
76 /*@Override*/ abstract ContiguousSet<C> headSetImpl(C toElement, boolean inclusive); argument
81 /*@Override*/ abstract ContiguousSet<C> tailSetImpl(C fromElement, boolean inclusive); argument
H A DEmptyImmutableSortedSet.java105 ImmutableSortedSet<E> headSetImpl(E toElement, boolean inclusive) { argument
116 ImmutableSortedSet<E> tailSetImpl(E fromElement, boolean inclusive) { argument
H A DRegularContiguousSet.java45 /* @Override */ ContiguousSet<C> headSetImpl(C toElement, boolean inclusive) { argument
46 return range.intersection(Ranges.upTo(toElement, BoundType.forBoolean(inclusive)))
63 /* @Override */ ContiguousSet<C> tailSetImpl(C fromElement, boolean inclusive) { argument
64 return range.intersection(Ranges.downTo(fromElement, BoundType.forBoolean(inclusive)))
H A DRegularImmutableSortedSet.java200 ImmutableSortedSet<E> headSetImpl(E toElement, boolean inclusive) { argument
202 if (inclusive) {
220 ImmutableSortedSet<E> tailSetImpl(E fromElement, boolean inclusive) { argument
222 if (inclusive) {
/external/chromium_org/third_party/icu/source/test/intltest/
H A Dtzrulets.h45 UDate start, UDate end, UBool inclusive);
47 UDate start, UDate end, UBool inclusive);
/external/icu/icu4c/source/test/intltest/
H A Dtzrulets.h45 UDate start, UDate end, UBool inclusive);
47 UDate start, UDate end, UBool inclusive);
/external/chromium_org/third_party/icu/source/i18n/unicode/
H A Dbasictz.h45 * @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)
H A Dtzrule.h132 * @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 Whethe
[all...]
H A Drbtz.h253 * @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/
H A Dbasictz.h45 * @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)
H A Dtzrule.h132 * @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 Whethe
[all...]
H A Drbtz.h253 * @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/
H A Dzrule.cpp129 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);
128 izrule_getNextStart(IZRule* rule, UDate base, int32_t prevRawOffset, int32_t prevDSTSavings, UBool inclusive, UDate& result) argument
134 izrule_getPreviousStart(IZRule* rule, UDate base, int32_t prevRawOffset, int32_t prevDSTSavings, UBool inclusive, UDate& result) argument
H A Dzrule.h220 * @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);
H A Drbtz.cpp544 RuleBasedTimeZone::getNextTransition(UDate base, UBool inclusive, TimeZoneTransition& result) const { argument
552 UBool found = findNext(base, inclusive, transitionTime, fromRule, toRule);
563 RuleBasedTimeZone::getPreviousTransition(UDate base, UBool inclusive, TimeZoneTransition& result) const { argument
571 UBool found = findPrev(base, inclusive, transitionTime, fromRule, toRule);
736 RuleBasedTimeZone::findNext(UDate base, UBool inclusive, UDate& transitionTime, argument
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
820 findPrev(UDate base, UBool inclusive, UDate& transitionTime, TimeZoneRule*& fromRule, TimeZoneRule*& toRule) const argument
[all...]
H A Dvzone.cpp161 vzone_getNextTransition(VZone* zone, UDate base, UBool inclusive, ZTrans* result) { argument
162 return ((VTimeZone*)zone)->VTimeZone::getNextTransition(base, inclusive, *(TimeZoneTransition*)result);
166 vzone_getPreviousTransition(VZone* zone, UDate base, UBool inclusive, ZTrans* result) { argument
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/
H A DRegularContiguousSet.java43 /* @Override */ ContiguousSet<C> headSetImpl(C toElement, boolean inclusive) { argument
44 return range.intersection(Ranges.upTo(toElement, BoundType.forBoolean(inclusive)))
61 /* @Override */ ContiguousSet<C> tailSetImpl(C fromElement, boolean inclusive) { argument
62 return range.intersection(Ranges.downTo(fromElement, BoundType.forBoolean(inclusive)))
H A DEmptyContiguousSet.java59 @Override ContiguousSet<C> headSetImpl(C toElement, boolean inclusive) { argument
/external/icu/icu4c/source/i18n/
H A Dzrule.cpp129 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);
128 izrule_getNextStart(IZRule* rule, UDate base, int32_t prevRawOffset, int32_t prevDSTSavings, UBool inclusive, UDate& result) argument
134 izrule_getPreviousStart(IZRule* rule, UDate base, int32_t prevRawOffset, int32_t prevDSTSavings, UBool inclusive, UDate& result) argument
H A Dzrule.h220 * @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);
H A Drbtz.cpp544 RuleBasedTimeZone::getNextTransition(UDate base, UBool inclusive, TimeZoneTransition& result) const { argument
552 UBool found = findNext(base, inclusive, transitionTime, fromRule, toRule);
563 RuleBasedTimeZone::getPreviousTransition(UDate base, UBool inclusive, TimeZoneTransition& result) const { argument
571 UBool found = findPrev(base, inclusive, transitionTime, fromRule, toRule);
736 RuleBasedTimeZone::findNext(UDate base, UBool inclusive, UDate& transitionTime, argument
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
820 findPrev(UDate base, UBool inclusive, UDate& transitionTime, TimeZoneRule*& fromRule, TimeZoneRule*& toRule) const argument
[all...]
/external/chromium_org/third_party/smhasher/src/
H A DKeysetTest.h136 void SparseKeygenRecurse ( pfHash hash, int start, int bitsleft, bool inclusive, keytype & k, std::vector<hashtype> & hashes ) argument
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 ) argument
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);
/external/guava/guava-testlib/src/com/google/common/collect/testing/
H A DSafeTreeMap.java143 @Override public NavigableMap<K, V> headMap(K toKey, boolean inclusive) { argument
145 delegate.headMap(checkValid(toKey), inclusive));
225 @Override public NavigableMap<K, V> tailMap(K fromKey, boolean inclusive) { argument
227 delegate.tailMap(checkValid(fromKey), inclusive));
H A DSafeTreeSet.java122 @Override public NavigableSet<E> headSet(E toElement, boolean inclusive) { argument
124 delegate.headSet(checkValid(toElement), inclusive));
186 @Override public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { argument
187 return delegate.tailSet(checkValid(fromElement), inclusive);

Completed in 860 milliseconds

1234