/frameworks/base/core/java/android/text/ |
TextDirectionHeuristic.java | 27 * @param start start index, inclusive. 39 * @param start start index, inclusive.
|
/frameworks/support/v4/java/android/support/v4/text/ |
TextDirectionHeuristicCompat.java | 27 * @param start start index, inclusive. 39 * @param start start index, inclusive.
|
/libcore/luni/src/main/java/java/util/ |
TreeMap.java | 698 Bound fromBound = fromInclusive ? INCLUSIVE : EXCLUSIVE; 699 Bound toBound = toInclusive ? INCLUSIVE : EXCLUSIVE; 704 return new BoundedMap(true, fromInclusive, INCLUSIVE, toExclusive, EXCLUSIVE); 707 public NavigableMap<K, V> headMap(K to, boolean inclusive) { 708 Bound toBound = inclusive ? INCLUSIVE : EXCLUSIVE; 716 public NavigableMap<K, V> tailMap(K from, boolean inclusive) { 717 Bound fromBound = inclusive ? INCLUSIVE : EXCLUSIVE; 722 return new BoundedMap(true, fromInclusive, INCLUSIVE, null, NO_BOUND) [all...] |
/libcore/luni/src/main/java/java/util/concurrent/ |
ThreadLocalRandom.java | 107 * given least value (inclusive) and bound (exclusive). 123 * between 0 (inclusive) and the specified value (exclusive). 152 * given least value (inclusive) and bound (exclusive). 168 * between 0 (inclusive) and the specified value (exclusive). 183 * given least value (inclusive) and bound (exclusive).
|
/external/icu4c/i18n/unicode/ |
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...] |
/dalvik/dexgen/src/com/android/dexgen/rop/ |
ByteBlock.java | 30 /** {@code >= 0;} bytecode offset (inclusive) of the start of the block */ 46 * @param start {@code >= 0;} bytecode offset (inclusive) of the start 110 * Gets the bytecode offset (inclusive) of the start of this block.
|
/dalvik/dx/src/com/android/dx/cf/code/ |
ByteBlock.java | 30 /** {@code >= 0;} bytecode offset (inclusive) of the start of the block */ 46 * @param start {@code >= 0;} bytecode offset (inclusive) of the start 110 * Gets the bytecode offset (inclusive) of the start of this block.
|
/external/chromium/third_party/libjingle/source/talk/base/ |
time.h | 51 bool TimeIsBetween(uint32 earlier, uint32 middle, uint32 later); // Inclusive 52 bool TimeIsLaterOrEqual(uint32 earlier, uint32 later); // Inclusive
|
/external/guava/guava/src/com/google/common/collect/ |
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)))
|
/external/skia/tests/ |
UnicodeTest.cpp | 12 // Unicode Variation Selector ranges: inclusive 27 // [min, max], [min, max] ... inclusive
|
/frameworks/base/docs/html/tools/help/ |
dmtracedump.jd | 62 <td>Minimum threshold for including child nodes in the graph (child's inclusive time as a 63 percentage of parent inclusive time). If this option is not used, the default threshold is
|
/libcore/luni/src/main/java/java/lang/ |
CharSequence.java | 48 * Returns a {@code CharSequence} from the {@code start} index (inclusive) 52 * the start offset of the sub-sequence. It is inclusive, that
|
/external/webkit/Source/JavaScriptCore/icu/unicode/ |
uset.h | 122 * start..end, inclusive. 123 * @param start first character of the range, inclusive 124 * @param end last character of the range, inclusive 174 * @param start first character in the set, inclusive 175 * @param end last character in the set, inclusive 334 * @param start the first character of the range to add, inclusive 335 * @param end the last character of the range to add, inclusive 366 * @param start the first character of the range to remove, inclusive 367 * @param end the last character of the range to remove, inclusive 404 * @param start first character, inclusive, of range to be retaine [all...] |
/external/webkit/Source/WebCore/icu/unicode/ |
uset.h | 122 * start..end, inclusive. 123 * @param start first character of the range, inclusive 124 * @param end last character of the range, inclusive 174 * @param start first character in the set, inclusive 175 * @param end last character in the set, inclusive 334 * @param start the first character of the range to add, inclusive 335 * @param end the last character of the range to add, inclusive 366 * @param start the first character of the range to remove, inclusive 367 * @param end the last character of the range to remove, inclusive 404 * @param start first character, inclusive, of range to be retaine [all...] |
/dalvik/vm/alloc/ |
MarkSweep.h | 31 /* Lowest address (inclusive)
|
/external/chromium/base/ |
rand_util.h | 17 // Returns a random number between min and max (inclusive). Thread-safe.
|
/external/chromium/net/base/ |
net_errors.h | 35 // (inclusive) to net::ERR_CERT_END (exclusive) in *decreasing* order.
|
/external/clang/test/SemaCXX/ |
init-priority-attr.cpp | 24 Two coo[2] __attribute__((init_priority(3))); // expected-error {{init_priority attribute requires integer constant between 101 and 65535 inclusive}}
|
/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)))
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/ |
SafeTreeMap.java | 143 @Override public NavigableMap<K, V> headMap(K toKey, boolean inclusive) { 145 delegate.headMap(checkValid(toKey), inclusive)); 225 @Override public NavigableMap<K, V> tailMap(K fromKey, boolean inclusive) { 227 delegate.tailMap(checkValid(fromKey), inclusive));
|
SafeTreeSet.java | 122 @Override public NavigableSet<E> headSet(E toElement, boolean inclusive) { 124 delegate.headSet(checkValid(toElement), inclusive)); 186 @Override public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { 187 return delegate.tailSet(checkValid(fromElement), inclusive);
|
/external/icu4c/i18n/ |
rbtz.cpp | 528 RuleBasedTimeZone::getNextTransition(UDate base, UBool inclusive, TimeZoneTransition& result) /*const*/ { 536 UBool found = findNext(base, inclusive, transitionTime, fromRule, toRule); 547 RuleBasedTimeZone::getPreviousTransition(UDate base, UBool inclusive, TimeZoneTransition& result) /*const*/ { 555 UBool found = findPrev(base, inclusive, transitionTime, fromRule, toRule); 720 RuleBasedTimeZone::findNext(UDate base, UBool inclusive, UDate& transitionTime, 730 if (tt > base || (inclusive && tt == base)) { 737 if (inclusive && tt == base) { 746 UBool avail0 = r0->getNextStart(base, r1->getRawOffset(), r1->getDSTSavings(), inclusive, start0); 747 UBool avail1 = r1->getNextStart(base, r0->getRawOffset(), r0->getDSTSavings(), inclusive, start1); 771 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/qemu/distrib/sdl-1.2.15/docs/man3/ |
SDL_UserEvent.3 | 30 \fBSDL_UserEvent\fR is in the \fBuser\fR member of the structure \fI\fBSDL_Event\fR\fR\&. This event is unique, it is never created by SDL but only by the user\&. The event can be pushed onto the event queue using \fI\fBSDL_PushEvent\fP\fR\&. The contents of the structure members or completely up to the programmer, the only requirement is that \fBtype\fR is a value from \fBSDL_USEREVENT\fP to \fBSDL_NUMEVENTS-1\fP (inclusive)\&.
|