| /external/clang/test/Analysis/ |
| NewDelete-path-notes.cpp | 18 struct Odd {
24 void test(Odd *odd) {
25 odd->kill(); // expected-note{{Calling 'Odd::kill'}}
27 delete odd; // expected-warning {{Attempt to free released memory}}
364 // CHECK-NEXT: <string>Calling 'Odd::kill'</string>
366 // CHECK-NEXT: <string>Calling 'Odd::kill'</string>
|
| /frameworks/opt/telephony/src/java/com/android/internal/telephony/cdma/sms/ |
| CdmaSmsSubaddress.java | 23 public byte odd; field in class:CdmaSmsSubaddress
|
| /external/opencv/cvaux/src/ |
| cvvideo.cpp | 53 CvMat odd_stub, *odd = (CvMat*)fieldOdd; local
59 CV_CALL( odd = cvGetMat( odd, &odd_stub ));
61 if( !CV_ARE_TYPES_EQ( frame, even ) || !CV_ARE_TYPES_EQ( frame, odd ))
64 if( frame->cols != even->cols || frame->cols != odd->cols ||
65 frame->rows != even->rows*2 || odd->rows != even->rows )
75 memcpy( odd->data.ptr + even->step*y,
|
| /external/stlport/test/unit/ |
| bcompos_test.cpp | 38 binary_compose<logical_and<bool>, odd, positive>
39 b = binary_compose<logical_and<bool>, odd, positive>(logical_and<bool>(), odd(), positive());
52 compose2(logical_and<bool>(), odd(), positive()));
|
| count_test.cpp | 24 static int odd(int a_);
62 int elements = count_if(numbers.begin(), numbers.end(), odd);
66 count_if(numbers.begin(), numbers.end(), odd, elements);
70 int CountTest::odd(int a_) function in class:CountTest
|
| unary.h | 11 struct odd : public unary_function<int, bool> { struct in inherits:unary_function
|
| unary_test.cpp | 47 //unary_negate<odd>::argument_type arg_val = 0;
48 int* p = find_if((int*)array, (int*)array + 3, unary_negate<odd>(odd()));
55 int* p = find_if((int*)array, (int*)array + 3, not1(odd()));
|
| find_test.cpp | 29 static bool odd(int a_);
78 int *location = find_if((int*)numbers, (int*)numbers + 6, odd);
84 int *out_range = find_if((int*)numbers_even, (int*)numbers_even + 6, odd);
107 bool FindTest::odd(int a_) function in class:FindTest
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| bcompos_test.cpp | 38 binary_compose<logical_and<bool>, odd, positive>
39 b = binary_compose<logical_and<bool>, odd, positive>(logical_and<bool>(), odd(), positive());
52 compose2(logical_and<bool>(), odd(), positive()));
|
| count_test.cpp | 24 static int odd(int a_);
62 int elements = count_if(numbers.begin(), numbers.end(), odd);
66 count_if(numbers.begin(), numbers.end(), odd, elements);
70 int CountTest::odd(int a_) function in class:CountTest
|
| unary.h | 11 struct odd : public unary_function<int, bool> { struct in inherits:unary_function
|
| unary_test.cpp | 47 //unary_negate<odd>::argument_type arg_val = 0;
48 int* p = find_if((int*)array, (int*)array + 3, unary_negate<odd>(odd()));
55 int* p = find_if((int*)array, (int*)array + 3, not1(odd()));
|
| find_test.cpp | 29 static bool odd(int a_);
78 int *location = find_if((int*)numbers, (int*)numbers + 6, odd);
84 int *out_range = find_if((int*)numbers_even, (int*)numbers_even + 6, odd);
107 bool FindTest::odd(int a_) function in class:FindTest
|
| /ndk/tests/device/test-stlport/unit/ |
| bcompos_test.cpp | 38 binary_compose<logical_and<bool>, odd, positive>
39 b = binary_compose<logical_and<bool>, odd, positive>(logical_and<bool>(), odd(), positive());
52 compose2(logical_and<bool>(), odd(), positive()));
|
| count_test.cpp | 24 static int odd(int a_);
62 int elements = count_if(numbers.begin(), numbers.end(), odd);
66 count_if(numbers.begin(), numbers.end(), odd, elements);
70 int CountTest::odd(int a_) function in class:CountTest
|
| unary.h | 11 struct odd : public unary_function<int, bool> { struct in inherits:unary_function
|
| unary_test.cpp | 47 //unary_negate<odd>::argument_type arg_val = 0;
48 int* p = find_if((int*)array, (int*)array + 3, unary_negate<odd>(odd()));
55 int* p = find_if((int*)array, (int*)array + 3, not1(odd()));
|
| find_test.cpp | 29 static bool odd(int a_);
78 int *location = find_if((int*)numbers, (int*)numbers + 6, odd);
84 int *out_range = find_if((int*)numbers_even, (int*)numbers_even + 6, odd);
107 bool FindTest::odd(int a_) function in class:FindTest
|
| /external/chromium_org/chrome/browser/resources/signin_internals/ |
| signin_index.css | 41 tr:nth-child(odd) {
45 table.signin-details tr:nth-child(odd).ok {
73 tr[highlighted]:nth-child(odd) {
|
| /external/chromium_org/chrome/browser/resources/ |
| identity_internals.css | 15 tr:nth-child(odd) {
|
| /external/chromium_org/chrome/browser/resources/quota_internals/ |
| main.css | 18 tr:nth-child(odd) {
|
| /external/eigen/Eigen/src/Geometry/ |
| EulerAngles.h | 42 const Index odd = ((a0+1)%3 == a1) ? 0 : 1; local
44 const Index j = (a0 + 1 + odd)%3;
45 const Index k = (a0 + 2 - odd)%3;
77 if (!odd)
|
| /external/chromium_org/chrome/browser/resources/memory_internals/ |
| list.css | 10 table.list tr:nth-child(odd) td {
|
| /external/qemu/distrib/zlib-1.2.3/ |
| crc32.c | 378 unsigned long odd[GF2_DIM]; /* odd-power-of-two zeros operator */ local
384 /* put operator for one zero bit in odd */
385 odd[0] = 0xedb88320L; /* CRC-32 polynomial */
388 odd[n] = row;
393 gf2_matrix_square(even, odd);
395 /* put operator for four zero bits in odd */
396 gf2_matrix_square(odd, even);
402 gf2_matrix_square(even, odd);
411 /* another iteration of the loop with odd and even swapped *
[all...] |
| /bionic/libc/kernel/common/linux/ |
| aio_abi.h | 46 #error edit for your odd byteorder.
|
