Searched defs:ordered (Results 1 - 10 of 10) sorted by relevance
/external/dropbear/libtomcrypt/src/pk/asn1/der/sequence/ |
H A D | der_decode_sequence_ex.c | 28 @param ordered Search an unordeded or ordered list 32 ltc_asn1_list *list, unsigned long outlen, int ordered) 90 if (!ordered && list[i].used == 1) { continue; } 110 if (!ordered) { continue; } 121 if (!ordered) { continue; } 133 if (!ordered) { continue; } 145 if (!ordered) { continue; } 156 if (!ordered) { continue; } 166 if (!ordered) { continu 31 der_decode_sequence_ex(const unsigned char *in, unsigned long inlen, ltc_asn1_list *list, unsigned long outlen, int ordered) argument [all...] |
/external/v8/test/cctest/ |
H A D | test-double.cc | 18 uint64_t ordered = V8_2PART_UINT64_C(0x01234567, 89ABCDEF); local 19 CHECK_EQ(3512700564088504e-318, Double(ordered).value()); 29 uint64_t ordered = V8_2PART_UINT64_C(0x01234567, 89ABCDEF); local 30 DiyFp diy_fp = Double(ordered).AsDiyFp(); 49 uint64_t ordered = V8_2PART_UINT64_C(0x01234567, 89ABCDEF); local 50 DiyFp diy_fp = Double(ordered).AsNormalizedDiyFp();
|
/external/freetype/src/sfnt/ |
H A D | ttkern.c | 52 FT_UInt32 avail = 0, ordered = 0; local 124 * Now check whether the pairs in this table are ordered. 150 ordered |= mask; 159 face->kern_order_bits = ordered;
|
/external/libvorbis/lib/ |
H A D | codebook.c | 32 int ordered=0; local 39 /* pack the codewords. There are two packings; length ordered and 44 if(i==c->entries)ordered=1; 46 if(ordered){ 47 /* length ordered. We only need to say how many codewords of 52 oggpack_write(opb,1,1); /* ordered */ 164 /* codeword ordering.... length ordered or unordered? */ 193 /* ordered */ 308 /* bisect search for the codeword in the ordered list */
|
/external/opencv/cv/src/ |
H A D | cvcalibinit.cpp | 116 bool ordered; // true if corners/neighbors are ordered counter-clockwise member in struct:CvCBQuad 401 if (quads[i].ordered) 532 // but all other quads are ordered consistently 575 start->ordered = true; 611 if (neighbor && neighbor->ordered == false && neighbor->count == 4) 615 neighbor->ordered = true; 708 if (neighbor && !neighbor->ordered && // is it an inner quad? 716 neighbor->ordered = true; 731 if (quads[i]->count < 4 && quads[i]->ordered) [all...] |
/external/kernel-headers/original/linux/ |
H A D | blkdev.h | 426 unsigned int ordered, next_ordered, ordseq; member in struct:request_queue
|
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
H A D | org.eclipse.help_3.5.0.v20100524.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.eclipse.core.resources_3.6.1.R36x_v20101007-1215.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.eclipse.jdt.launching_3.5.100.v20100526.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.apache.lucene_1.9.1.v20100518-1140.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
Completed in 217 milliseconds