Searched defs:depth (Results 1 - 25 of 958) sorted by path

1234567891011>>

/external/antlr/antlr-3.4/lib/
H A Dantlr-3.4-complete.jarMETA-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 DFlexAntTasks.jarMETA-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 Dantlr3collections.c1763 /* 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 DListStack`1.cs45 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 Dtree.rb83 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 DDFA.java112 /** 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 DEventMod.java93 public int depth; field in class:EventMod
121 depth = -1;
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/dom2dtm/
H A DDOM2DTM.java329 // 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 DNamespaceMappings.java31 * 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 DToStream.java780 * 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 Dlock.h336 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 DPKIXPolicyNode.java14 protected int depth; field in class:PKIXPolicyNode
37 depth = _depth;
59 return depth;
151 depth,
/external/checkpolicy/
H A Dpolicy_define.c2747 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 Dtrace_event_impl.cc2069 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 Dtrace_event_memory_unittest.cc102 void TestDeepScopeNesting(int current, int depth) { argument
105 if (current < depth)
106 TestDeepScopeNesting(current + 1, depth);
H A Dtrace_event_win.cc83 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 Djson_parser.cc167 explicit StackMarker(int* depth) : depth_(depth) { argument
H A Djson_writer.cc53 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 Dlogging_win.cc66 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 Dmessage_loop_test.cc352 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 Dmessage_loop_unittest.cc251 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 Dstring_util.cc768 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 Dtransform_operations.cc218 void TransformOperations::AppendPerspective(SkMScalar depth) { argument
220 to_add.matrix.ApplyPerspectiveDepth(depth);
222 to_add.perspective_depth = depth;
H A Dtransform_operations_unittest.cc198 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 Dweb_transform_operations_impl.cc47 void WebTransformOperationsImpl::appendPerspective(double depth) { argument
48 transform_operations_.AppendPerspective(depth);

Completed in 713 milliseconds

1234567891011>>