HomeSort by relevance Sort by last modified time
    Searched defs:order (Results 76 - 100 of 152) sorted by null

1 2 34 5 6 7

  /external/emma/core/java12/com/vladium/emma/report/lcov/
ReportGenerator.java 122 final ItemComparator order = local
124 for (Iterator packages = item.getChildren(order); packages.hasNext(); )
147 final ItemComparator order = m_typeSortComparators[id]; local
148 for (Iterator srcORclsFiles = item.getChildren(order);
208 final ItemComparator order = m_typeSortComparators[ local
211 for (Iterator classes = item.getChildren(order);
  /external/emma/core/java12/com/vladium/emma/report/txt/
ReportGenerator.java 176 final ItemComparator order = m_typeSortComparators [PackageItem.getTypeMetadata ().getTypeID ()]; local
177 for (Iterator packages = item.getChildren (order); packages.hasNext (); )
225 final ItemComparator order = m_typeSortComparators [m_srcView ? SrcFileItem.getTypeMetadata ().getTypeID () : ClassItem.getTypeMetadata ().getTypeID ()]; local
226 for (Iterator srcORclsFiles = item.getChildren (order); srcORclsFiles.hasNext (); )
267 final ItemComparator order = m_typeSortComparators [ClassItem.getTypeMetadata ().getTypeID ()]; local
268 for (Iterator classes = item.getChildren (order); classes.hasNext (); )
317 final ItemComparator order = m_typeSortComparators [MethodItem.getTypeMetadata ().getTypeID ()]; local
318 for (Iterator methods = item.getChildren (order); methods.hasNext (); )
  /external/icu4c/i18n/
ucal.cpp 611 UResourceBundle *order = ures_getByKey(rb, prefRegion, NULL, status); local
614 order = ures_getByKey(rb, "001", NULL, status);
622 for (int i = 0; i < ures_getSize(order); i++) {
624 const UChar *type = ures_getStringByIndex(order, i, &len, status);
657 ures_close(order);
bmsearch.cpp 44 uint32_t order; member in struct:CEI
179 uint32_t order; local
192 order = ucol_next(elements, &status);
195 if (order == (uint32_t)UCOL_NULLORDER) {
200 cont = isContinuation(order);
201 order &= strengthMask;
203 if (toShift && variableTop > order && (order & UCOL_PRIMARYORDERMASK) != 0) {
205 order &= UCOL_PRIMARYORDERMASK;
207 order = UCOL_IGNORABLE
229 uint32_t order; local
    [all...]
ucol_bld.cpp 620 uint32_t order = 0; local
630 order = ucol_getNextCE(UCA, &s, status);
631 if(isContinuation(order)) {
635 if((order&UCOL_CASE_BIT_MASK)== UCOL_UPPER_CASE) {
880 uint32_t order = 0; local
884 order = ucol_getNextCE(src->UCA, &s, status);
885 if(order == UCOL_NO_MORE_CES) {
888 tok->expCEs[tok->noOfExpCEs++] = order;
    [all...]
  /external/iproute2/tc/
f_u32.c 954 __u32 order = 0; local
1012 } else if (matches(*argv, "order") == 0) {
1014 if (get_u32(&order, *argv, 0)) {
1015 fprintf(stderr, "Illegal \"order\"\n");
1123 if (order) {
1124 if (TC_U32_NODE(t->tcm_handle) && order != TC_U32_NODE(t->tcm_handle)) {
1125 fprintf(stderr, "\"order\" contradicts \"handle\"\n");
1128 t->tcm_handle |= order;
1157 fprintf(f, "order %d ", TC_U32_NODE(handle));
  /external/openssl/crypto/ec/
ec_lcl.h 188 BIGNUM order, cofactor; member in struct:ec_group_st
ecp_smpl.c 283 BIGNUM *a,*b,*order,*tmp_1,*tmp_2; local
301 order = BN_CTX_get(ctx);
302 if (order == NULL) goto err;
    [all...]
ec_asn1.c 177 ASN1_INTEGER *order; member in struct:ec_parameters_st
248 ASN1_SIMPLE(ECPARAMETERS, order, ASN1_INTEGER),
645 /* set the order */
651 ret->order = BN_to_ASN1_INTEGER(tmp, ret->order);
652 if (ret->order == NULL)
925 if (!params->order || !params->base || !params->base->data)
945 /* extract the order */
946 if ((a = ASN1_INTEGER_to_BN(params->order, a)) == NULL)
977 /* set the generator, order and cofactor (if present) *
    [all...]
  /external/openssl/crypto/
mem_dbg.c 136 static unsigned long order = 0; /* number of memory requests */ variable
179 unsigned long order; member in struct:mem_st
248 * appropriate order (long-time lock first).
525 if (order == break_order_num)
528 m->order=order;
530 m->order=order++;
533 m->order,
589 mp->order, mp->addr, mp->num)
    [all...]
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
rmepsilon.h 209 // States sorted in topological order when (acyclic) or generic
210 // topological order (cyclic).
217 vector<StateId> order; local
219 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic);
223 states.resize(order.size());
224 for (StateId i = 0; i < (StateId)order.size(); i++)
225 states[order[i]] = i;
  /external/tremolo/Tremolo/
codec_internal.h 96 int order; member in struct:__anon7781
  /external/zlib/contrib/puff/
puff.c 20 * assumed to be 16 bits, for arrays in order to to conserve memory. The code
191 * each length, which for a canonical code are stepped through in order.
192 * symbol[] are the symbol values in canonical order, where the number of
212 * build the code value reversed from what is in the stream in order to
299 * sorted by length, retaining their original order within each length. The
324 * - Within a given code length, the symbols are kept in ascending order for
356 * put symbols in table sorted by length, by symbol order within each
572 * - The code lengths are stored in order for the symbols, so lengths are
621 * code. The code length code lengths are received in a permuted order (see
622 * the order[] array below) to make a short code length code length list mor
654 static const short order[19] = \/* permutation of code length codes *\/ local
    [all...]
  /frameworks/base/core/java/android/view/
MenuInflater.java 259 final int order = a.getInt(com.android.internal.R.styleable.MenuItem_orderInCategory, groupOrder); local
260 itemCategoryOrder = (category & Menu.CATEGORY_MASK) | (order & Menu.USER_MASK);
  /frameworks/base/core/java/android/widget/
DatePicker.java 169 // re-order the number pickers to match the current date format
187 String order; local
192 * the date format order setting. Otherwise, use the order
203 order = ((SimpleDateFormat) format).toPattern();
206 order = new String(DateFormat.getDateFormatOrder(getContext()));
210 * required order.
218 for (int i = 0; i < order.length(); i++) {
219 char c = order.charAt(i);
  /libcore/luni/src/main/java/org/apache/xalan/processor/
XSLTElementDef.java 139 * @param order the order this element should appear according to the XSLT specification.
145 boolean has_required, boolean required, int order,
151 this.m_order = order;
168 * @param order the order this element should appear according to the XSLT specification.
174 boolean has_required, boolean required, boolean has_order, int order,
180 this.m_order = order;
196 * @param order the order this element should appear according to the XSLT specification.
471 int order = -1; local
    [all...]
  /libcore/luni/src/test/java/org/apache/harmony/nio/tests/java/nio/
ByteBufferTest.java 211 assertEquals(buf.order(), readonly.order());
346 assertEquals(buf.order(), duplicate.order());
635 method = "order",
639 // BIG_ENDIAN is the default byte order
640 assertEquals(ByteOrder.BIG_ENDIAN, buf.order());
642 buf.order(ByteOrder.LITTLE_ENDIAN);
643 assertEquals(ByteOrder.LITTLE_ENDIAN, buf.order());
645 buf.order(ByteOrder.BIG_ENDIAN)
    [all...]
CharBufferTest.java 163 assertEquals(buf.order(), readonly.order());
188 assertEquals(buf.order(), readonly.order());
312 assertEquals(buf.order(), duplicate.order());
339 assertEquals(buf.order(), duplicate.order());
797 assertEquals(buf.order(), slice.order());
    [all...]
  /dalvik/dx/src/com/android/dx/dex/code/
RopTranslator.java 73 /** {@code null-ok;} block output order; becomes non-null in {@link #pickOrder} */
74 private int[] order; field in class:RopTranslator
80 * true if the parameters to this method happen to be in proper order
122 this.order = null;
147 * If params are not in order, we will need register space
165 * method happen to slot the params in an order at the top of the
209 new StdCatchBuilder(method, order, addresses);
220 int[] order = this.order; local
221 int len = order.length
316 int[] order = new int[sz]; local
    [all...]
  /external/bison/src/
tables.c 104 /* FROMS and TOS are reordered to be compressed. ORDER[VECTOR] is the
107 static vector_number *order; variable
131 but in order to keep small tables, renumbered as TABLE_ERROR, which
260 look-ahead (in reverse order to give precedence to the first
577 | Compute ORDER, a reordering of vectors, in order to decide how to |
596 while (j >= 0 && (width[order[j]] < w))
599 while (j >= 0 && (width[order[j]] == w) && (tally[order[j]] < t))
603 order[k + 1] = order[k]
    [all...]
  /external/chromium/third_party/icu/source/i18n/
bmsearch.cpp 44 uint32_t order; member in struct:CEI
177 uint32_t order; local
190 order = ucol_next(elements, &status);
193 if (order == (uint32_t)UCOL_NULLORDER) {
198 cont = isContinuation(order);
199 order &= strengthMask;
201 if (toShift && variableTop > order && (order & UCOL_PRIMARYORDERMASK) != 0) {
203 order &= UCOL_PRIMARYORDERMASK;
205 order = UCOL_IGNORABLE
227 uint32_t order; local
    [all...]
dtitvfmt.cpp 872 * in order to get interval patterns for 'y' differ,
1006 UBool order = fInfo->getDefaultOrder(); local
1016 UBool order = laterDateFirst; local
    [all...]
ucol_bld.cpp 620 uint32_t order = 0; local
630 order = ucol_getNextCE(UCA, &s, status);
631 if(isContinuation(order)) {
635 if((order&UCOL_CASE_BIT_MASK)== UCOL_UPPER_CASE) {
880 uint32_t order = 0; local
884 order = ucol_getNextCE(src->UCA, &s, status);
885 if(order == UCOL_NO_MORE_CES) {
888 tok->expCEs[tok->noOfExpCEs++] = order;
    [all...]
  /external/dropbear/libtomcrypt/src/headers/
tomcrypt_pk.h 169 /** The order of the curve (hex) */
170 char *order; member in struct:__anon3300
306 /** The order of the sub-group used in octets */
  /external/ipsec-tools/src/racoon/
oakley.h 163 vchar_t *order; member in struct:dhgroup

Completed in 913 milliseconds

1 2 34 5 6 7