HomeSort by relevance Sort by last modified time
    Searched refs:upper (Results 1 - 25 of 391) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/chromium-libpac/test/
jstocstring.pl 16 $upper = uc();
17 print FILE "#define $upper \\\n";
  /external/chromium_org/third_party/WebKit/public/platform/
WebIDBKeyRange.h 43 WebIDBKeyRange(const WebIDBKey& lower, const WebIDBKey& upper, bool lowerOpen, bool upperOpen) { assign(lower, upper, lowerOpen, upperOpen); }
46 BLINK_EXPORT WebIDBKey upper() const;
51 BLINK_EXPORT void assign(const WebIDBKey& lower, const WebIDBKey& upper, bool lowerOpen, bool upperOpen);
  /external/chromium_org/content/common/indexed_db/
indexed_db_key_range.h 19 const IndexedDBKey& upper,
25 const IndexedDBKey& upper() const { return upper_; } function in class:content::IndexedDBKeyRange
indexed_db_key_range.cc 19 const IndexedDBKey& upper,
23 upper_(upper),
  /external/chromium_org/third_party/icu/source/samples/case/
ucase.c 25 static const UChar upper[] = {0x61, 0x42, 0x49, 0}; /* upper = "aBI" */ local
50 length = u_strToLower(buffer, sizeof(buffer)/sizeof(buffer[0]), upper,
51 sizeof(upper)/sizeof(upper[0]), "tr", &errorCode);
57 u_fprintf(out, "u_strToLower(%S, turkish) -> %S\n", upper, buffer);
63 length = u_strToUpper(buffer, sizeof(buffer)/sizeof(buffer[0]), upper,
64 sizeof(upper)/sizeof(upper[0]), "en", &errorCode);
  /external/icu/icu4c/source/samples/case/
ucase.c 25 static const UChar upper[] = {0x61, 0x42, 0x49, 0}; /* upper = "aBI" */ local
50 length = u_strToLower(buffer, sizeof(buffer)/sizeof(buffer[0]), upper,
51 sizeof(upper)/sizeof(upper[0]), "tr", &errorCode);
57 u_fprintf(out, "u_strToLower(%S, turkish) -> %S\n", upper, buffer);
63 length = u_strToUpper(buffer, sizeof(buffer)/sizeof(buffer[0]), upper,
64 sizeof(upper)/sizeof(upper[0]), "en", &errorCode);
  /external/chromium_org/ui/aura/test/
test_windows.cc 58 bool ObjectIsAbove(T* upper, T* lower) {
59 DCHECK_EQ(upper->parent(), lower->parent());
60 DCHECK_NE(upper, lower);
61 const std::vector<T*>& children = upper->parent()->children();
63 std::find(children.begin(), children.end(), upper) - children.begin();
69 bool WindowIsAbove(Window* upper, Window* lower) {
70 return ObjectIsAbove<Window>(upper, lower);
73 bool LayerIsAbove(Window* upper, Window* lower) {
74 return ObjectIsAbove<ui::Layer>(upper->layer(), lower->layer());
test_windows.h 35 // Returns true if |upper| is above |lower| in the window stacking order.
36 bool WindowIsAbove(Window* upper, Window* lower);
38 // Returns true if |upper|'s layer is above |lower|'s layer in the layer
40 bool LayerIsAbove(Window* upper, Window* lower);
  /external/chromium_org/third_party/WebKit/Source/modules/indexeddb/
IDBKeyRange.h 51 static IDBKeyRange* create(IDBKey* lower, IDBKey* upper, LowerBoundType lowerType, UpperBoundType upperType)
53 return new IDBKeyRange(lower, upper, lowerType, upperType);
62 IDBKey* upper() const { return m_upper.get(); } function in class:blink::FINAL
72 static IDBKeyRange* bound(ExecutionContext*, const ScriptValue& lower, const ScriptValue& upper, bool lowerOpen, bool upperOpen, ExceptionState&);
77 IDBKeyRange(IDBKey* lower, IDBKey* upper, LowerBoundType lowerType, UpperBoundType upperType);
IDBKeyRange.idl 30 [ImplementedAs=upperValue, CallWith=ScriptState] readonly attribute any upper;
37 [CallWith=ExecutionContext, RaisesException] static IDBKeyRange bound(any lower, any upper, optional boolean lowerOpen = false, optional boolean upperOpen = false);
IDBKeyRange.cpp 54 IDBKeyRange::IDBKeyRange(IDBKey* lower, IDBKey* upper, LowerBoundType lowerType, UpperBoundType upperType)
56 , m_upper(upper)
124 IDBKey* upper = scriptValueToIDBKey(toIsolate(context), upperValue); local
126 if (!lower || !lower->isValid() || !upper || !upper->isValid()) {
130 if (upper->isLessThan(lower)) {
131 exceptionState.throwDOMException(DataError, "The lower key is greater than the upper key.");
134 if (upper->isEqual(lower) && (lowerOpen || upperOpen)) {
135 exceptionState.throwDOMException(DataError, "The lower key and upper key are equal and one of the bounds is open.");
139 return IDBKeyRange::create(lower, upper, lowerOpen ? LowerBoundOpen : LowerBoundClosed, upperOpen ? UpperBoundOpen : UpperBoundClosed)
    [all...]
  /external/chromium_org/third_party/WebKit/Source/web/
WebIDBKeyRange.cpp 40 void WebIDBKeyRange::assign(const WebIDBKey& lower, const WebIDBKey& upper, bool lowerOpen, bool upperOpen)
42 if (!lower.isValid() && !upper.isValid())
45 m_private = IDBKeyRange::create(lower, upper, lowerOpen ? IDBKeyRange::LowerBoundOpen : IDBKeyRange::LowerBoundClosed, upperOpen ? IDBKeyRange::UpperBoundOpen : IDBKeyRange::UpperBoundClosed);
60 WebIDBKey WebIDBKeyRange::upper() const function in class:blink::WebIDBKeyRange
64 return WebIDBKey(m_private->upper());
  /external/chromium_org/ui/gfx/
color_utils_unittest.cc 74 HSL upper = {0.4, 0.5, 0.6}; local
75 EXPECT_TRUE(IsWithinHSLRange(hsl, lower, upper));
78 EXPECT_TRUE(IsWithinHSLRange(hsl, lower, upper));
80 EXPECT_TRUE(IsWithinHSLRange(hsl, lower, upper));
82 EXPECT_TRUE(IsWithinHSLRange(hsl, lower, upper));
84 EXPECT_TRUE(IsWithinHSLRange(hsl, lower, upper));
86 EXPECT_TRUE(IsWithinHSLRange(hsl, lower, upper));
88 EXPECT_TRUE(IsWithinHSLRange(hsl, lower, upper));
94 HSL upper = {1.2, -1, -1}; local
96 EXPECT_TRUE(IsWithinHSLRange(hsl, lower, upper));
    [all...]
  /external/libcxx/test/algorithms/alg.sorting/alg.binary.search/upper.bound/
Android.mk 17 test_makefile := external/libcxx/test/algorithms/alg.sorting/alg.binary.search/upper.bound/Android.mk
19 test_name := algorithms/alg.sorting/alg.binary.search/upper.bound/upper_bound
23 test_name := algorithms/alg.sorting/alg.binary.search/upper.bound/upper_bound_comp
  /external/bison/lib/
c-strcaseeq.h 34 # define CASEEQ(other,upper) \
35 (c_isupper (upper) ? ((other) & ~0x20) == (upper) : (other) == (upper))
37 # define CASEEQ(other,upper) \
38 (c_isupper (upper) ? (other) == (upper) || (other) == (upper) - 'A' + 'a' : (other) == (upper))
40 # define CASEEQ(other,upper) \
    [all...]
  /external/guava/guava/src/com/google/common/collect/
Ranges.java 81 * lower} and strictly less than {@code upper}.
84 * equal to</i> {@code upper}
86 public static <C extends Comparable<?>> Range<C> open(C lower, C upper) {
87 return create(Cut.aboveValue(lower), Cut.belowValue(upper));
92 * {@code lower} and less than or equal to {@code upper}.
95 * upper}
97 public static <C extends Comparable<?>> Range<C> closed(C lower, C upper) {
98 return create(Cut.belowValue(lower), Cut.aboveValue(upper));
103 * {@code lower} and strictly less than {@code upper}.
106 * upper}
    [all...]
SortedLists.java 70 int upper = list.size() - 1; local
71 // Everything between lower and upper inclusive compares at >= 0.
72 while (lower < upper) {
73 int middle = (lower + upper + 1) >>> 1;
76 upper = middle - 1;
94 int upper = foundIndex; local
96 // Everything between lower and upper inclusive compares at <= 0.
97 while (lower < upper) {
98 int middle = (lower + upper) >>> 1;
103 upper = middle
268 int upper = list.size() - 1; local
    [all...]
  /external/chromium_org/third_party/webrtc/common_audio/resampler/
sinc_resampler_neon.cc 27 const float* upper = input_ptr + kKernelSize; local
28 for (; input_ptr < upper; ) {
  /external/icu/icu4c/source/i18n/
collationweights.cpp 219 printf("length of upper limit 0x%08lx is %ld\n", upperLimit, upperLength);
222 // Permit upperLength<middleLength: The upper limit for secondaries is 0x10000.
226 printf("error: no space between lower & upper limits\n");
235 printf("error: lower limit 0x%08lx is a prefix of upper limit 0x%08lx\n", lowerLimit, upperLimit);
240 /* if the upper limit is a prefix of the lower limit then the earlier test lowerLimit>=upperLimit has caught it */
242 WeightRange lower[5], middle, upper[5]; /* [0] and [1] are not used - this simplifies indexing */ local
245 uprv_memset(upper, 0, sizeof(upper));
254 * upper[2] 2
255 * upper[3]
    [all...]
  /external/libcxx/test/localization/locale.categories/category.ctype/locale.ctype.byname/
is_1.pass.cpp 39 assert(f.is(F::upper, L'A'));
40 assert(!f.is(F::upper, L'a'));
64 assert(f.is(F::upper, L'\x00DA'));
82 assert(f.is(F::upper, L'A'));
83 assert(!f.is(F::upper, L'a'));
107 assert(!f.is(F::upper, L'\x00DA'));
  /external/chromium_org/net/spdy/
spdy_frame_builder.h 108 uint32 upper = htonl(value >> 32); local
110 return (WriteBytes(&upper, sizeof(upper)) &&
  /external/libcxx/test/localization/locale.categories/category.ctype/
ctype_base.pass.cpp 26 // static const mask upper = 1 << 3;
47 assert(std::ctype_base::upper);
57 & std::ctype_base::upper
69 test(std::ctype_base::upper);
  /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
util.rb 128 # within the given lower and upper bounds,
140 def bound( lower, upper=nil )
142 return self unless upper
143 return upper if self > upper
  /external/chromium_org/third_party/WebKit/Source/build/scripts/
media_feature_symbol.py 18 chr = chr.upper()
  /external/chromium_org/third_party/qcms/src/
transform_util.c 41 int upper, lower; local
43 upper = ceil(value);
46 value = table[upper]*(1. - (upper - value)) + table[lower]*(upper - value);
57 uint32_t upper = (value + 65534) / 65535; /* equivalent to ceil(value/65535) */ local
59 /* interp is the distance from upper to value scaled to 0..65535 */
62 value = (table[upper]*(interp) + table[lower]*(65535 - interp))/65535; // 0..65535*65535
77 uint32_t upper = (value + PRECACHE_OUTPUT_MAX-1) / PRECACHE_OUTPUT_MAX; local
80 /* interp is the distance from upper to value scaled to 0..PRECACHE_OUTPUT_MAX *
96 int upper, lower; local
    [all...]

Completed in 8537 milliseconds

1 2 3 4 5 6 7 8 91011>>