Searched refs:odd (Results 1 - 25 of 41) sorted by relevance

12

/external/opencv/cvaux/src/
H A Dcvvideo.cpp53 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/
H A Dbcompos_test.cpp38 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()));
H A Dcount_test.cpp24 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
H A Dunary.h11 struct odd : public unary_function<int, bool> { struct in inherits:unary_function
H A Dunary_test.cpp47 //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()));
H A Dfind_test.cpp29 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
H A Drm_cp_test.cpp46 static bool odd(int a_) function
88 replace_if(v1.begin(), v1.end(), odd, 42);
163 replace_copy_if(v1.begin(), v1.end(), v2.begin(), odd, 42);
205 remove_if((int*)numbers, (int*)numbers + 6, odd);
236 remove_copy_if((int*)numbers, (int*)numbers + 6, (int*)result, odd);
/external/llvm/lib/Target/CellSPU/
H A DSPUNopFiller.cpp33 bool isEvenPlace; // the instruction slot (mem address) at hand is even/odd
60 odd = 3 } SPUOpPlace; enumerator in enum:__anon7575::SPUNopFiller::__anon7576
75 assert( isEvenPlace && "basic block start from odd address");
91 // padd: odd(wrong), even(wrong), ...
92 // to: nop(corr), odd(corr), even(corr)...
93 if( isEvenPlace && this_optype == odd && next_optype == even ) {
100 // padd: even(wrong), odd(wrong), ...
101 // to: lnop(corr), even(corr), odd(corr)...
102 else if ( !isEvenPlace && this_optype == even && next_optype == odd){
119 if (getOpPlacement( *J ) == odd) {
[all...]
/external/qemu/distrib/zlib-1.2.3/
H A Dcrc32.c378 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 an
[all...]
/external/kernel-headers/original/linux/
H A Daio_abi.h59 #error edit for your odd byteorder.
/external/chromium/chrome/browser/resources/sync_internals/
H A Dsync_node_browser.css45 #node-browser tr:nth-child(odd) {
/external/zlib/
H A Dcrc32.c385 unsigned long odd[GF2_DIM]; /* odd-power-of-two zeros operator */ local
391 /* put operator for one zero bit in odd */
392 odd[0] = 0xedb88320UL; /* CRC-32 polynomial */
395 odd[n] = row;
400 gf2_matrix_square(even, odd);
402 /* put operator for four zero bits in odd */
403 gf2_matrix_square(odd, even);
409 gf2_matrix_square(even, odd);
418 /* another iteration of the loop with odd an
[all...]
/external/clang/test/Sema/
H A Dext_vector_components.c47 float2 od(float3 x) { return x.odd; }
/external/chromium/chrome/browser/autofill/
H A Dcredit_card.cc409 bool odd = false; local
416 if (odd) {
422 odd = !odd;
/external/icu4c/test/intltest/
H A Dtestidna.cpp996 UChar odd[MAX_DEST_SIZE]; local
1009 memcpy(odd,expected,(expectedLen+1) * U_SIZEOF_UCHAR);
1013 evenLen = func(odd,-1,even,MAX_DEST_SIZE,options, &parseError, &status);
1019 oddLen = func(even,-1,odd,MAX_DEST_SIZE,options, &parseError, &status);
1028 u_strCaseCompare(odd,oddLen, expected,expectedLen, 0, &status) !=0 ){
1034 u_strncmp(odd,expected,expectedLen) !=0 ){
1046 memcpy(odd,expected,(expectedLen+1) * U_SIZEOF_UCHAR);
1050 evenLen = func(odd,-1,even,MAX_DEST_SIZE,options|UIDNA_ALLOW_UNASSIGNED, &parseError, &status);
1056 oddLen = func(even,-1,odd,MAX_DEST_SIZE,options|UIDNA_ALLOW_UNASSIGNED, &parseError, &status);
1065 u_strCaseCompare(odd,oddLe
[all...]
/external/emma/core/java12/com/vladium/emma/report/html/
H A DReportGenerator.java282 boolean odd = true;
284 for (Iterator packages = item.getChildren (order); packages.hasNext (); odd = ! odd)
300 addItemRow (pkg, odd, childSummaryTable, headerColumns, childHREF, false);
399 boolean odd = true;
401 for (Iterator srcORclsFiles = item.getChildren (order); srcORclsFiles.hasNext (); odd = ! odd)
417 addItemRow (srcORcls, odd, childSummaryTable, headerColumns, childHREF, false);
559 boolean odd = false;
561 for (Iterator methods = cls.getChildren (order2); methods.hasNext (); odd
900 addItemRow(final IItem item, final boolean odd, final HTMLTable table, final int [] columns, final String nameHREF, final boolean anchor) argument
1024 addClassItemRow(final IItem item, final boolean odd, final HTMLTable table, final int [] columns, final String nameHREF, final boolean anchor) argument
[all...]
/external/mesa3d/src/pixelflinger2/
H A Dllvm_texture.cpp226 Value * odd = NULL; local
239 odd = builder.CreateAnd(tc, builder.getInt32(1 << SHIFT), name("tc_odd"));
257 odd = builder.CreateICmpNE(odd, builder.getInt32(0));
260 condBranch.ifCond(odd);
H A Dtexture.cpp114 unsigned odd = 0; local
119 odd = tc & (1 << shift);
132 tc = odd ? size - 1 - tc : tc;
/external/jdiff/src/jdiff/
H A DDiffMyers.java121 /* True if southeast corner is on an odd
123 final boolean odd = (fmid - bmid & 1) != 0;
158 if (odd && bmin <= d && d <= bmax && bd[bdiagoff + d] <= fd[fdiagoff + d])
190 if (!odd && fmin <= d && d <= fmax && bd[bdiagoff + d] <= fd[fdiagoff + d])
/external/openssl/crypto/modes/asm/
H A Dghash-x86.pl373 my $odd = $cnt&1;
374 my $nix = $odd ? $nlo : $nhi;
376 &shl (&LB($nlo),4) if ($odd);
381 &mov (&LB($nlo),&BP($cnt/2,$inp)) if (!$odd && $cnt>=0);
383 &and ($nhi,0xf0) if ($odd);
387 &mov ($nhi,$nlo) if (!$odd && $cnt>=0);
/external/mesa3d/docs/
H A DMESA_swap_control.spec88 this is typically the time required to display both the even and odd
/external/libvpx/vpx_scale/arm/neon/
H A Dvp8_vpxyv12_copysrcframe_func_neon.asm103 ;copy last line for Y if y_height is odd
209 ;copy last line for U & V if uv_height is odd
/external/chromium-trace/src/shared/css/
H A Dabout_memory.css156 table.list:not([class*='filtered']) tr:nth-child(odd) td {
/external/libvpx/vp8/encoder/ppc/
H A Dfdct_altivec.asm55 ;# a/A are the even rows 0,2 b/B are the odd rows 1,3
/external/dropbear/libtommath/
H A Dbn.tex196 RSA cryptography you only require exponentiation with odd moduli so even moduli support can be safely removed.
205 \hline Exponentiation with odd moduli only & BN\_S\_MP\_EXPTMOD\_C \\
210 \hline Exponentiation with random odd moduli & (The above plus the following) \\
217 \hline Modular inverse odd moduli only & BN\_MP\_INVMOD\_SLOW\_C \\
280 It may seem odd to compare LibTomMath to GnuPG since the math in GnuPG is only a small portion of the entire application.
1377 Montgomery is a specialized reduction algorithm for any odd moduli. Like Barrett reduction a pre--computation
1385 For the given odd moduli $a$ the precomputation value is placed in $mp$. The reduction is computed with the
1408 Which calculates $a = R$ for the odd moduli $b$ without using multiplication or division.
1579 a root with the sign of the input for odd roots. For example, performing $4^{1/2}$ will return $2$ whereas $(-8)^{1/3}$

Completed in 3099 milliseconds

12