Home
last modified time | relevance | path

Searched refs:odd (Results 1 – 25 of 157) sorted by relevance

1234567

/external/opencv/cvaux/src/
Dcvvideo.cpp53 CvMat odd_stub, *odd = (CvMat*)fieldOdd; in cvDeInterlace() local
59 CV_CALL( odd = cvGetMat( odd, &odd_stub )); in cvDeInterlace()
61 if( !CV_ARE_TYPES_EQ( frame, even ) || !CV_ARE_TYPES_EQ( frame, odd )) in cvDeInterlace()
64 if( frame->cols != even->cols || frame->cols != odd->cols || in cvDeInterlace()
65 frame->rows != even->rows*2 || odd->rows != even->rows ) in cvDeInterlace()
75 memcpy( odd->data.ptr + even->step*y, in cvDeInterlace()
/external/stlport/test/unit/
Dbcompos_test.cpp38 binary_compose<logical_and<bool>, odd, positive> in bcompos1()
39 b = binary_compose<logical_and<bool>, odd, positive>(logical_and<bool>(), odd(), positive()); in bcompos1()
52 compose2(logical_and<bool>(), odd(), positive())); in bcompos2()
Dcount_test.cpp24 static int odd(int a_);
62 int elements = count_if(numbers.begin(), numbers.end(), odd); in countif1()
66 count_if(numbers.begin(), numbers.end(), odd, elements); in countif1()
70 int CountTest::odd(int a_) in odd() function in CountTest
Dfind_test.cpp29 static bool odd(int a_);
78 int *location = find_if((int*)numbers, (int*)numbers + 6, odd); in findif0()
84 int *out_range = find_if((int*)numbers_even, (int*)numbers_even + 6, odd); in findif0()
107 bool FindTest::odd(int a_) in odd() function in FindTest
Drm_cp_test.cpp46 static bool odd(int a_) in odd() function
88 replace_if(v1.begin(), v1.end(), odd, 42); in replif1()
163 replace_copy_if(v1.begin(), v1.end(), v2.begin(), odd, 42); in repcpif1()
205 remove_if((int*)numbers, (int*)numbers + 6, odd); in remif1()
236 remove_copy_if((int*)numbers, (int*)numbers + 6, (int*)result, odd); in remcpif1()
Dunary_test.cpp48 int* p = find_if((int*)array, (int*)array + 3, unary_negate<odd>(odd())); in unegate1()
55 int* p = find_if((int*)array, (int*)array + 3, not1(odd())); in unegate2()
Dunary.h11 struct odd : public unary_function<int, bool> { struct
/external/qemu/distrib/zlib-1.2.3/
Dcrc32.c378 unsigned long odd[GF2_DIM]; /* odd-power-of-two zeros operator */ local
385 odd[0] = 0xedb88320L; /* CRC-32 polynomial */
388 odd[n] = row;
393 gf2_matrix_square(even, odd);
396 gf2_matrix_square(odd, even);
402 gf2_matrix_square(even, odd);
412 gf2_matrix_square(odd, even);
414 crc1 = gf2_matrix_times(odd, crc1);
/external/zlib/src/
Dcrc32.c363 unsigned long odd[GF2_DIM]; /* odd-power-of-two zeros operator */ local
370 odd[0] = 0xedb88320UL; /* CRC-32 polynomial */
373 odd[n] = row;
378 gf2_matrix_square(even, odd);
381 gf2_matrix_square(odd, even);
387 gf2_matrix_square(even, odd);
397 gf2_matrix_square(odd, even);
399 crc1 = gf2_matrix_times(odd, crc1);
/external/eigen/Eigen/src/Geometry/
DEulerAngles.h42 const Index odd = ((a0+1)%3 == a1) ? 0 : 1; in eulerAngles() local
44 const Index j = (a0 + 1 + odd)%3; in eulerAngles()
45 const Index k = (a0 + 2 - odd)%3; in eulerAngles()
77 if (!odd) in eulerAngles()
/external/icu4c/test/intltest/
Dtestidna.cpp996 UChar odd[MAX_DEST_SIZE]; in testChaining() local
1009 memcpy(odd,expected,(expectedLen+1) * U_SIZEOF_UCHAR); in testChaining()
1013 evenLen = func(odd,-1,even,MAX_DEST_SIZE,options, &parseError, &status); in testChaining()
1019 oddLen = func(even,-1,odd,MAX_DEST_SIZE,options, &parseError, &status); in testChaining()
1028 u_strCaseCompare(odd,oddLen, expected,expectedLen, 0, &status) !=0 ){ in testChaining()
1034 u_strncmp(odd,expected,expectedLen) !=0 ){ in testChaining()
1046 memcpy(odd,expected,(expectedLen+1) * U_SIZEOF_UCHAR); in testChaining()
1050 … evenLen = func(odd,-1,even,MAX_DEST_SIZE,options|UIDNA_ALLOW_UNASSIGNED, &parseError, &status); in testChaining()
1056 … oddLen = func(even,-1,odd,MAX_DEST_SIZE,options|UIDNA_ALLOW_UNASSIGNED, &parseError, &status); in testChaining()
1065 u_strCaseCompare(odd,oddLen, expected,expectedLen, 0, &status) !=0 ){ in testChaining()
[all …]
/external/emma/core/java12/com/vladium/emma/report/html/
DReportGenerator.java282 boolean odd = true; in visit()
284 for (Iterator packages = item.getChildren (order); packages.hasNext (); odd = ! odd) in visit()
300 addItemRow (pkg, odd, childSummaryTable, headerColumns, childHREF, false); in visit()
399 boolean odd = true; in visit()
401 … for (Iterator srcORclsFiles = item.getChildren (order); srcORclsFiles.hasNext (); odd = ! odd) in visit()
417 addItemRow (srcORcls, odd, childSummaryTable, headerColumns, childHREF, false); in visit()
559 boolean odd = false; in visit()
561 … for (Iterator methods = cls.getChildren (order2); methods.hasNext (); odd = ! odd) in visit()
580 … addClassItemRow (method, odd, childSummaryTable, headerColumns, HREFname, createAnchors); in visit()
691 boolean odd = true; in visit()
[all …]
/external/llvm/test/CodeGen/AArch64/
Dextract.ll26 ; Order of lhs and rhs matters here. Regalloc would have to be very odd to use
38 ; Order of lhs and rhs matters here. Regalloc would have to be very odd to use
/external/chromium/chrome/browser/autofill/
Dcredit_card.cc409 bool odd = false; in IsValidCreditCardNumber() local
416 if (odd) { in IsValidCreditCardNumber()
422 odd = !odd; in IsValidCreditCardNumber()
/external/kernel-headers/original/linux/
Daio_abi.h59 #error edit for your odd byteorder.
/external/llvm/lib/Target/ARM/
DARMRegisterInfo.td301 // Pseudo-registers representing odd-even pairs of D registers. The even-odd
310 // Use the Q registers for the even-odd pairs.
314 // Prefer even-odd pairs as they are easier to copy.
319 // Pseudo-registers representing even-odd pairs of GPRs from R1 to R13/SP.
320 // These are needed by instructions (e.g. ldrexd/strexd) requiring even-odd GPRs.
325 // Register class representing a pair of even-odd GPRs.
/external/llvm/test/CodeGen/Thumb2/
D2013-03-06-vector-sext-operand-scalarize.ll4 ; with odd constructs like this. The code actually generated is incidental.
/external/clang/test/Sema/
Dext_vector_components.c47 float2 od(float3 x) { return x.odd; } in od()
/external/jdiff/src/jdiff/
DDiffMyers.java123 final boolean odd = (fmid - bmid & 1) != 0; in diag()
158 if (odd && bmin <= d && d <= bmax && bd[bdiagoff + d] <= fd[fdiagoff + d]) in diag()
190 if (!odd && fmin <= d && d <= fmax && bd[bdiagoff + d] <= fd[fdiagoff + d]) in diag()
/external/llvm/test/Archive/
DREADME.txt18 oddlen - a member with an odd lengthed name and content
/external/chromium/chrome/browser/resources/sync_internals/
Dsync_node_browser.css45 #node-browser tr:nth-child(odd) {
/external/llvm/test/Transforms/LoopUnroll/
Druntime-loop2.ll4 ; This test makes sure we're not unrolling 'odd' counts
/external/openssl/crypto/modes/asm/
Dghash-x86.pl370 my $odd = $cnt&1;
371 my $nix = $odd ? $nlo : $nhi;
373 &shl (&LB($nlo),4) if ($odd);
378 &mov (&LB($nlo),&BP($cnt/2,$inp)) if (!$odd && $cnt>=0);
380 &and ($nhi,0xf0) if ($odd);
384 &mov ($nhi,$nlo) if (!$odd && $cnt>=0);
/external/e2fsprogs/tests/d_loaddump/
Dscript19 echo "file fragment odd size" >> $TEST_DATA
/external/bison/data/m4sugar/
Dforeach.m490 # odd, then rounding the last $# up in the temporary macro is
178 # m4_bpatsubsts already validated an odd number of arguments; we only
247 # EXPRESSION([ARG1], [ARG2]). If there are an odd number of ARGs, the
251 # only output if $# is odd:

1234567