| /cts/tests/tests/content/src/android/content/res/cts/ |
| ArrayTest.java | 69 checkStringArray(R.array.integers, new String[] {null, null, null});
70 checkTextArray(R.array.integers, new String[] {null, null, null});
76 checkIntArray(R.array.integers, new int[] {0, 1, 101});
|
| ResourcesTest.java | 627 int[]array2 = mResources.getIntArray(R.array.integers);
763 checkStringArray(R.array.integers, new String[] {
766 checkTextArray(R.array.integers, new String[] {
|
| /external/libvpx/examples/includes/geshi/geshi/ |
| cil.php | 186 0 => '(?<=ldc\\.i4\\.)[0-8]|(?<=(?:ldarg|ldloc|stloc)\\.)[0-3]' # Pickup the opcodes that end with integers
|
| /external/webkit/WebCore/platform/cf/ |
| BinaryPropertyList.cpp | 59 IntegerArray(const int* integers, size_t size) : m_integers(integers), m_size(size) { ASSERT(integers); ASSERT(size); }
64 const int* integers() const { ASSERT(!isDeletedValue()); return m_integers; } function in class:WebCore::IntegerArray
95 return StringImpl::computeHash(reinterpret_cast<const UChar*>(array.integers()), array.size() / (sizeof(int) / sizeof(UChar)));
105 if (a.integers()[i] != b.integers()[i])
223 void BinaryPropertyListPlan::writeIntegerArray(const int* integers, size_t size)
227 pair<IntegerArrayMap::iterator, bool> addResult = m_integerArrays.add(IntegerArray(integers, size), 0);
231 writeInteger(integers[i])
[all...] |
| /external/chromium/third_party/libevent/test/ |
| regress.c | 1363 uint32_t integers[TEST_MAX_INT] = { local
1372 encode_int(tmp, integers[i]);
1375 integers[i], newlen - oldlen);
1383 if (integer != integers[i]) {
1385 integer, integers[i]);
1446 uint32_t integers[TEST_MAX_INT] = { local
1455 evtag_encode_tag(tmp, integers[i]);
1458 integers[i], newlen - oldlen);
1466 if (integer != integers[i]) {
1468 integer, integers[i])
[all...] |
| /external/v8/src/ |
| heap.h | 1661 uint32_t integers[2]; member in union:v8::internal::TranscendentalCache::Converter
[all...] |
| date.js | 385 // Conversion to integers.
[all...] |
| /libcore/luni/src/test/java/org/apache/harmony/luni/tests/java/util/ |
| ArrayListTest.java | 273 int[] integers = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 }; local
278 list2.add(integers[i]);
283 // Inserted elements should be equal to integers array
284 for (int i = 0; i < integers.length; i++) {
285 assertEquals(integers[i], list1.get(location + i));
290 assertEquals(strings[i], list1.get(i + integers.length - 1));
[all...] |
| /hardware/ril/mock-ril/src/js/ |
| simulated_radio.js | 608 rsp.integers = new Array();
609 rsp.integers[0] = lastCallFailCause;
724 rsp.integers = Array();
725 rsp.integers[0] = networkSelectionMode;
[all...] |
| /external/v8/test/mjsunit/ |
| smi-negative-zero.js | 28 // Ensure that operations on small integers handle -0.
|
| unicode-test.js | [all...] |
| /libcore/luni/src/test/java/org/apache/harmony/luni/tests/java/io/ |
| ObjectInputStreamTest.java | 1024 Integer[] integers = new Integer[] { 10, 20 }; local
[all...] |
| /hardware/ril/mock-ril/src/cpp/ |
| responses.cpp | 110 * Handle response for an array of integers
121 result[i] = rsp->integers(i);
|
| /hardware/ril/mock-ril/src/generated/cpp/ |
| ril.pb.h | 3360 inline ::google::protobuf::int32 RspIntegers::integers(int index) const { function in class:ril_proto::RspIntegers
3370 RspIntegers::integers() const { function in class:ril_proto::RspIntegers
[all...] |
| ril.pb.cpp | 601 "\n\013RspIntegers\022\020\n\010integers\030\001 \003(\005\"@\n\017RspGe"
[all...] |
| /external/dropbear/libtommath/ |
| bn.tex | 282 would require when working with large integers.
804 In figure \ref{fig:CMP} two integers $a$ and $b$ are being compared. In this case $a$ is said to be ``to the left'' of
[all...] |
| /external/dropbear/libtomcrypt/ |
| crypt.tex | [all...] |
| /external/grub/docs/ |
| texinfo.tex | [all...] |
