/external/antlr/antlr-3.4/lib/ |
H A D | antlr-3.4-complete.jar | META-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ... |
/external/antlr/antlr-3.4/runtime/ActionScript/project/lib/ |
H A D | FlexAntTasks.jar | META-INF/ META-INF/MANIFEST.MF com/ com/adobe/ com/adobe/ac/ com/adobe/ac/ant/ ... |
/external/antlr/antlr-3.4/runtime/C/src/ |
H A D | antlr3collections.c | 1763 /* INT TRIE Implementation of depth 64 bits, being the number of bits 1768 antlr3IntTrieNew(ANTLR3_UINT32 depth) argument 1798 * keys in the trie. This is the trie 'depth'. The limit for 1801 trie->root->bitNum = depth; 1918 ANTLR3_UINT32 depth; local 1923 /* Cache the bit depth of this trie, which is always the highest index, 1926 depth = trie->root->bitNum; 2028 depth = 56 + bitIndex[((xorKey & 0xFF00000000000000)>>56)]; 2032 depth = 48 + bitIndex[((xorKey & 0x00FF000000000000)>>48)]; 2039 depth [all...] |
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Misc/ |
H A D | ListStack`1.cs | 45 public T Peek(int depth) argument 48 if (!TryPeek(depth, out item)) 59 public bool TryPeek(int depth, out T item) argument 61 if (depth >= Count) 67 item = this[Count - depth - 1];
|
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
H A D | tree.rb | 83 For more in-depth coverage of the topic, check out the ANTLR documentation 258 def depth method in class:ANTLR3.AST.for 259 root? ? 0 : parent.depth + 1
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
H A D | DFA.java | 112 /** While building the DFA, track max lookahead depth if not cyclic */ 659 * To force an acyclic, fixed maximum depth DFA, just always 785 int _getMaxLookaheadDepth(DFAState d, int depth) { argument 788 int max = depth; 795 int m = _getMaxLookaheadDepth(edgeTarget, depth+1);
|
/external/apache-harmony/jdwp/src/test/java/org/apache/harmony/jpda/tests/framework/jdwp/ |
H A D | EventMod.java | 93 public int depth; field in class:EventMod 121 depth = -1;
|
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/dom2dtm/ |
H A D | DOM2DTM.java | 329 // Non-recursive one-fetch-at-a-time depth-first traversal with 1657 int depth) 1670 dispatchNodeData(child, ch, depth+1); 1676 if(0 != depth) 1655 dispatchNodeData(Node node, org.xml.sax.ContentHandler ch, int depth) argument
|
/external/apache-xml/src/main/java/org/apache/xml/serializer/ |
H A D | NamespaceMappings.java | 31 * prefix/uri/depth triplets are pushed on a stack pushed on a stack. The depth 32 * indicates the nesting depth of the element for which the mapping was made. 47 * "def" is pushed on the stack with depth 1. 49 * depth 2. 50 * When the <sentance> is encountered "p3" and "jkl" are pushed with depth 3. 52 * stack. Of course popNamespaces(2) would pop anything with depth 2 or 86 * when leaving the current element depth 88 * depth can be popped of the top and the same node 91 * All prefixes pushed at the current depth ca 362 MappingRecord(String prefix, String uri, int depth) argument [all...] |
H A D | ToStream.java | 780 * of the given depth. 782 * @param depth the indentation depth (element nesting depth) 786 protected void indent(int depth) throws IOException argument 796 printSpace(depth * m_indentAmount); 801 * Indent at the current element nesting depth. 2210 // namespaces declared at the current depth are no longer valid 2330 /* Remember the mapping, and at what depth it was declared 2331 * This is one greater than the current depth becaus [all...] |
/external/bison/lib/glthread/ |
H A D | lock.h | 336 unsigned long depth; member in struct:__anon325 569 unsigned long depth; member in struct:__anon326 720 unsigned long depth; member in struct:__anon332
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/ |
H A D | PKIXPolicyNode.java | 14 protected int depth; field in class:PKIXPolicyNode 37 depth = _depth; 59 return depth; 151 depth,
|
/external/checkpolicy/ |
H A D | policy_define.c | 2747 int depth; local 2758 depth = -1; 2762 if (depth < 0) { 2769 if (depth < 1) { 2773 depth--; 2781 if (depth == (CEXPR_MAXDEPTH - 1)) { 2785 depth++; 2792 if (depth != 0) { 2895 int depth; local 2904 depth 3137 int depth; local [all...] |
/external/chromium_org/base/debug/ |
H A D | trace_event_impl.cc | 2069 size_t depth = 0; local 2072 depth = thread_event_start_times_[thread_id].size(); 2074 for (size_t i = 0; i < depth; ++i)
|
H A D | trace_event_memory_unittest.cc | 102 void TestDeepScopeNesting(int current, int depth) { argument 105 if (current < depth) 106 TestDeepScopeNesting(current + 1, depth);
|
H A D | trace_event_win.cc | 83 DWORD depth; local 88 depth = CaptureStackBackTrace(0, 92 event.SetField(3, sizeof(depth), &depth); 93 event.SetField(4, sizeof(backtrace[0]) * depth, backtrace);
|
/external/chromium_org/base/json/ |
H A D | json_parser.cc | 167 explicit StackMarker(int* depth) : depth_(depth) { argument
|
H A D | json_writer.cc | 53 bool JSONWriter::BuildJSONString(const Value* const node, size_t depth) { argument 137 if (!BuildJSONString(value, depth)) 172 IndentLine(depth + 1U); 179 if (!BuildJSONString(&itr.value(), depth + 1U)) 187 IndentLine(depth); 203 void JSONWriter::IndentLine(size_t depth) { argument 204 json_string_->append(depth * 3U, ' ');
|
/external/chromium_org/base/ |
H A D | logging_win.cc | 66 DWORD depth = 0; local 71 depth = CaptureStackBackTrace(2, kMaxBacktraceDepth, backtrace, NULL); 78 event.SetField(0, sizeof(depth), &depth); 79 event.SetField(1, sizeof(backtrace[0]) * depth, &backtrace);
|
/external/chromium_org/base/message_loop/ |
H A D | message_loop_test.cc | 352 void NestingFunc(int* depth) { 353 if (*depth > 0) { 354 *depth -= 1; 356 Bind(&NestingFunc, depth)); 368 int depth = 100; local 370 Bind(&NestingFunc, &depth)); 372 EXPECT_EQ(depth, 0); 454 void RecursiveFunc(TaskList* order, int cookie, int depth, argument 457 if (depth > 0) { 462 Bind(&RecursiveFunc, order, cookie, depth 508 RecursiveSlowFunc(TaskList* order, int cookie, int depth, bool is_reentrant) argument [all...] |
H A D | message_loop_unittest.cc | 251 void RecursiveFunc(TaskList* order, int cookie, int depth, argument 254 if (depth > 0) { 259 Bind(&RecursiveFunc, order, cookie, depth - 1, is_reentrant));
|
/external/chromium_org/base/strings/ |
H A D | string_util.cc | 768 int depth, 771 if (depth > kMaxDepth) 794 depth + 1, next)) 799 depth + 1, next)) 812 depth + 1, next)) 766 MatchPatternT(const CHAR* eval, const CHAR* eval_end, const CHAR* pattern, const CHAR* pattern_end, int depth, NEXT next) argument
|
/external/chromium_org/cc/animation/ |
H A D | transform_operations.cc | 218 void TransformOperations::AppendPerspective(SkMScalar depth) { argument 220 to_add.matrix.ApplyPerspectiveDepth(depth); 222 to_add.perspective_depth = depth;
|
H A D | transform_operations_unittest.cc | 198 SkMScalar depth = 800; local 200 operations.AppendPerspective(depth); 202 expected.ApplyPerspectiveDepth(depth); 1004 EXPECT_NEAR(lhs.depth(), rhs.depth(), tolerance);
|
/external/chromium_org/cc/blink/ |
H A D | web_transform_operations_impl.cc | 47 void WebTransformOperationsImpl::appendPerspective(double depth) { argument 48 transform_operations_.AppendPerspective(depth);
|