/external/v8/test/mjsunit/ |
debug-stepout-scope-part4.js | 56 var prefixes = [ variable 74 for (var i = 0; i < prefixes.length; ++i) { 75 var pre = prefixes[i];
|
debug-stepout-scope-part5.js | 56 var prefixes = [ "debugger; ", variable 70 for (var i = 0; i < prefixes.length; ++i) { 71 var pre = prefixes[i];
|
debug-stepout-scope-part6.js | 56 var prefixes = [ "debugger; ", variable 73 for (var i = 0; i < prefixes.length; ++i) { 74 var pre = prefixes[i];
|
debug-stepout-scope-part7.js | 56 var prefixes = [ "debugger; ", variable 73 for (var i = 0; i < prefixes.length; ++i) { 74 var pre = prefixes[i];
|
debug-stepout-scope-part2.js | 56 var prefixes = [ "debugger; ", variable 74 for (var i = 0; i < prefixes.length; ++i) { 75 var pre = prefixes[i];
|
debug-stepout-scope-part3.js | 56 var prefixes = [ variable 72 for (var i = 0; i < prefixes.length; ++i) { 73 var pre = prefixes[i];
|
debug-stepout-scope-part1.js | 156 var prefixes = [ variable 163 for (var i = 0; i < prefixes.length; ++i) { 164 var pre = prefixes[i];
|
/packages/apps/UnifiedEmail/src/org/apache/commons/io/filefilter/ |
PrefixFileFilter.java | 49 /** The filename prefixes to search for */ 50 private final String[] prefixes; field in class:PrefixFileFilter 78 this.prefixes = new String[] {prefix}; 83 * Constructs a new Prefix file filter for any of an array of prefixes. 88 * @param prefixes the prefixes to allow, must not be null 91 public PrefixFileFilter(String[] prefixes) { 92 this(prefixes, IOCase.SENSITIVE); 96 * Constructs a new Prefix file filter for any of an array of prefixes 102 * @param prefixes the prefixes to allow, must not be nul [all...] |
/system/core/toolbox/upstream-netbsd/lib/libc/gen/ |
humanize_number.c | 50 const char *prefixes, *sep; local 63 prefixes = "B\0k\0M\0G\0T\0P\0E"; 65 prefixes = "\0\0k\0M\0G\0T\0P\0E"; 73 prefixes = "B\0K\0M\0G\0T\0P\0E"; 75 prefixes = "\0\0K\0M\0G\0T\0P\0E"; 78 #define SCALE2PREFIX(scale) (&prefixes[(scale) << 1])
|
/external/ksoap2/ksoap2-base/src/main/java/org/ksoap2/kdom/ |
Element.java | 39 protected Vector prefixes; field in class:Element 155 return (prefixes == null ? 0 : prefixes.size()); 159 return ((String[]) prefixes.elementAt(i))[0]; 163 return ((String[]) prefixes.elementAt(i))[1]; 260 if (prefixes == null) 261 prefixes = new Vector(); 262 prefixes.addElement(new String[] { 302 if (prefixes != null) { 303 for (int i = 0; i < prefixes.size(); i++) [all...] |
/external/apache-xml/src/main/java/org/apache/xml/serializer/dom3/ |
NamespaceSupport.java | 156 // ignore "xml" and "xmlns" prefixes
252 String[] prefixes = new String[fNamespaceSize];
local 253 fPrefixes = prefixes;
270 return new Prefixes(fPrefixes, count);
273 protected final class Prefixes implements Enumeration {
274 private String[] prefixes;
field in class:NamespaceSupport.Prefixes 279 * Constructor for Prefixes.
281 public Prefixes(String [] prefixes, int size) {
282 this.prefixes = prefixes; [all...] |
/external/google-breakpad/src/third_party/libdisasm/ |
ia32_insn.c | 216 static void ia32_handle_prefix( x86_insn_t *insn, unsigned int prefixes ) { 218 insn->prefix = (enum x86_insn_prefix) prefixes & PREFIX_MASK; // >> 20; 220 /* no printable prefixes */ 263 unsigned int prefixes ) { 273 insn->op_size = ( prefixes & PREFIX_OP_SIZE ) ? 4 : 2; 274 insn->addr_size = ( prefixes & PREFIX_ADDR_SIZE ) ? 4 : 2; 276 insn->op_size = ( prefixes & PREFIX_OP_SIZE ) ? 2 : 4; 277 insn->addr_size = ( prefixes & PREFIX_ADDR_SIZE ) ? 2 : 4; 288 ia32_handle_prefix( insn, prefixes ); 307 raw_insn->dest_flag, prefixes, modrm ) 543 unsigned int prefixes = 0; local 576 unsigned int prefixes = 0; local [all...] |
ia32_invariant.c | 13 unsigned int *prefixes ); 142 unsigned int prefixes, x86_invariant_t *inv) { 150 op_size = ( prefixes & PREFIX_OP_SIZE ) ? 4 : 2; 151 addr_size = ( prefixes & PREFIX_ADDR_SIZE ) ? 4 : 2; 152 mode_16 = ( prefixes & PREFIX_ADDR_SIZE ) ? 0 : 1; 154 op_size = ( prefixes & PREFIX_OP_SIZE ) ? 2 : 4; 155 addr_size = ( prefixes & PREFIX_ADDR_SIZE ) ? 2 : 4; 156 mode_16 = ( prefixes & PREFIX_ADDR_SIZE ) ? 1 : 0; 282 unsigned int prefixes; local 287 size = ia32_table_lookup( buf, buf_len, 0, &raw_insn, &prefixes ); [all...] |
/external/tcpdump/ |
print-ospf6.c | 215 register u_int prefixes; local 399 prefixes = EXTRACT_32BITS(&llsap->llsa_nprefix); 400 printf("\n\t Priority %d, Link-local address %s, Prefixes %d:", 403 prefixes); 406 while (prefixes > 0) { 410 prefixes--; 430 prefixes = EXTRACT_16BITS(&lsap->lsa_un.un_intra_ap.intra_ap_nprefix); 431 printf("\n\t Prefixes %d:", prefixes); 434 while (prefixes > 0) [all...] |
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/org/xml/sax/helpers/ |
NamespaceSupportTest.java | 56 Enumeration<String> prefixes = ns.getDeclaredPrefixes(); local 58 while (prefixes.hasMoreElements()) { 59 prefix = prefixes.nextElement(); 126 // Part 1: Check that xml and xmlns are not accepted as prefixes. 134 // prefixes. 161 ArrayList<String> prefixes; local 163 prefixes = Collections.list(ns.getPrefixes(marketUri)); 164 assertTrue("Test 1: Incorrect set of prefixes returned.", 165 expected.containsAll(prefixes) && prefixes.containsAll(expected)) 182 ArrayList<String> prefixes; local 193 ArrayList<String> prefixes; local 315 ArrayList<String> prefixes = Collections.list(ns.getPrefixes()); local [all...] |
/external/e2fsprogs/intl/ |
vasnprintf.c | 268 int prefixes[2]; local 571 prefixes[prefix_count++] = a.arg[dp->width_arg_index].a.a_int; 577 prefixes[prefix_count++] = a.arg[dp->precision_arg_index].a.a_int; 607 prefixes[0], arg, &count); \ 611 prefixes[0], prefixes[1], arg, \ 625 count = sprintf (tmp, buf, prefixes[0], arg); \ 628 count = sprintf (tmp, buf, prefixes[0], prefixes[1],\
|
/external/gptfdisk/ |
support.cc | 229 string units, prefixes = " KMGTPEZ"; local 233 while ((sizeInIeee > 1024) && (index < (prefixes.length() - 1))) { 238 if (prefixes[index] == ' ') { 242 units[1] = prefixes[index];
|
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
TailoredSet.java | 231 // Parallel iteration over prefixes of both tables. 232 CharsTrie.Iterator prefixes = new CharsTrie(p, pidx).iterator(); local 237 // U+FFFF is untailorable and will not occur in prefixes. 242 if (prefixes.hasNext()) { 243 te = prefixes.next(); 341 CharsTrie.Iterator prefixes = new CharsTrie(p, pidx).iterator(); local 342 while (prefixes.hasNext()) { 343 Entry e = prefixes.next(); 384 // Prefixes are reversed in the data structure.
|
ContractionsAndExpansions.java | 40 public ContractionsAndExpansions(UnicodeSet con, UnicodeSet exp, CESink s, boolean prefixes) { 44 addPrefixes = prefixes; 232 CharsTrie.Iterator prefixes = new CharsTrie(data.contexts, index + 2).iterator(); local 233 while (prefixes.hasNext()) { 234 Entry e = prefixes.next(); 295 // Prefixes are reversed in the data structure.
|
/frameworks/data-binding/compiler/src/main/java/android/databinding/annotationprocessor/ |
ProcessBindable.java | 188 private static boolean prefixes(CharSequence sequence, String prefix) { method in class:ProcessBindable 189 boolean prefixes = false; 192 prefixes = true; 195 prefixes = false; 200 return prefixes; 205 return prefixes(name, "get") && 213 return prefixes(name, "set") && 221 return prefixes(name, "is") &&
|
/libcore/luni/src/main/java/org/xml/sax/helpers/ |
NamespaceSupport.java | 235 * prefixes after popping a context, unless you push another 259 * Declare a Namespace prefix. All prefixes must be declared 264 * interpret prefixes against (potentially redefined) prefixes. 283 * This asymmetry exists to make it easier to look up prefixes 314 * the prefixes currently declared. The return value will be the 381 * Return an enumeration of all prefixes whose declarations are 390 * @return An enumeration of prefixes (never empty). 401 * Return one of the prefixes mapped to a Namespace URI. 405 * want all of the prefixes, use the {@link #getPrefixes 445 ArrayList<String> prefixes = new ArrayList<String>(); local [all...] |
ParserAdapter.java | 158 private static final String NAMESPACE_PREFIXES = FEATURES + "namespace-prefixes"; 166 * namespace-prefixes.</p> 182 if (!namespaces && !prefixes) { 183 prefixes = true; 187 prefixes = value; 188 if (!prefixes && !namespaces) { 204 * namespace-prefixes.</p> 220 return prefixes; 555 if (prefixes) { 624 Enumeration prefixes = nsSupport.getDeclaredPrefixes() 622 Enumeration prefixes = nsSupport.getDeclaredPrefixes(); local 825 private boolean prefixes = false; field in class:ParserAdapter [all...] |
/external/apache-xml/src/main/java/org/apache/xml/serializer/ |
NamespaceMappings.java | 56 * processed. At any given moment of processing the currently visible prefixes 67 * This member is continually incremented when new prefixes need to be 91 * All prefixes pushed at the current depth can be 168 Enumeration prefixes = m_namespaces.keys(); local 169 while (prefixes.hasMoreElements()) 171 String prefix = (String) prefixes.nextElement(); 185 Enumeration prefixes = m_namespaces.keys(); local 186 while (prefixes.hasMoreElements()) 188 String prefix = (String) prefixes.nextElement(); 204 // Prefixes "xml" and "xmlns" cannot be redefine 486 Enumeration prefixes = m_namespaces.keys(); local [all...] |
/system/core/adb/ |
sockets.cpp | 646 } prefixes[] = { variable in typeref:struct:prefix_struct 652 static const int num_prefixes = (sizeof(prefixes) / sizeof(prefixes[0])); 663 if (!strncmp(service, prefixes[i].str, prefixes[i].len)) 664 return strchr(service + prefixes[i].len, ':');
|
/external/elfutils/src/libcpu/ |
i386_data.h | 41 /* The rep/repe prefixes. */ 91 if (*d->prefixes & has_cs) 94 *d->prefixes &= ~has_cs; 96 else if (*d->prefixes & has_ds) 99 *d->prefixes &= ~has_ds; 101 else if (*d->prefixes & has_es) 104 *d->prefixes &= ~has_es; 106 else if (*d->prefixes & has_fs) 109 *d->prefixes &= ~has_fs; 111 else if (*d->prefixes & has_gs 163 int prefixes = *d->prefixes; local 939 int prefixes = *d->prefixes; local 1019 int prefixes = *d->prefixes; local [all...] |