HomeSort by relevance Sort by last modified time
    Searched refs:maxDepth (Results 1 - 23 of 23) sorted by null

  /libcore/dalvik/src/main/java/dalvik/system/
VMStack.java 65 * @param maxDepth
71 native public static Class<?>[] getClasses(int maxDepth,
  /external/webkit/SunSpider/tests/sunspider-0.9/
access-binary-trees.js 33 var maxDepth = Math.max(minDepth + 2, n);
34 var stretchDepth = maxDepth + 1;
38 var longLivedTree = bottomUpTree(0,maxDepth);
39 for (var depth=minDepth; depth<=maxDepth; depth+=2){
40 var iterations = 1 << (maxDepth - depth + minDepth);
  /external/webkit/SunSpider/tests/sunspider-0.9.1/
access-binary-trees.js 33 var maxDepth = Math.max(minDepth + 2, n);
34 var stretchDepth = maxDepth + 1;
38 var longLivedTree = bottomUpTree(0,maxDepth);
39 for (var depth=minDepth; depth<=maxDepth; depth+=2){
40 var iterations = 1 << (maxDepth - depth + minDepth);
  /external/webkit/JavaScriptCore/wtf/
AVLTree.h 55 // // Must return a valid value for index when 0 <= index < maxDepth
65 template<unsigned maxDepth>
68 bool& operator[](unsigned i) { ASSERT(i < maxDepth); return m_data[i]; }
69 void set() { for (unsigned i = 0; i < maxDepth; ++i) m_data[i] = true; }
70 void reset() { for (unsigned i = 0; i < maxDepth; ++i) m_data[i] = false; }
73 bool m_data[maxDepth];
76 // How to determine maxDepth:
126 template <class Abstractor, unsigned maxDepth = 32, class BSet = AVLTreeDefaultBSet<maxDepth> >
334 handle path_h[maxDepth - 1]
    [all...]
  /dalvik/dx/src/com/android/dx/dex/file/
ClassDefsSection.java 154 * @param maxDepth maximum recursion depth; if negative, this will
158 private int orderItems0(Type type, int idx, int maxDepth) {
165 if (maxDepth < 0) {
169 maxDepth--;
174 idx = orderItems0(superclass, idx, maxDepth);
180 idx = orderItems0(interfaces.getType(i), idx, maxDepth);
  /hardware/ril/mock-ril/src/js/
mock_ril.js 99 function printProperties(obj, maxDepth, depth) {
100 if (typeof maxDepth == 'undefined') {
101 maxDepth = 1;
112 && (depth < maxDepth)) {
113 printProperties(obj[property], maxDepth, depth+1);
  /frameworks/base/include/utils/
CallStack.h 53 void update(int32_t ignoreDepth=0, int32_t maxDepth=MAX_DEPTH);
  /sdk/layoutopt/libs/uix/src/com/android/layoutopt/uix/groovy/
LayoutAnalysisCategory.java 175 int maxDepth = 0;
180 maxDepth = Math.max(maxDepth, depth(list.item(i)));
183 return maxDepth + 1;
  /development/samples/ApiDemos/src/com/example/android/apis/graphics/spritetext/
MatrixStack.java 32 public MatrixStack(int maxDepth) {
33 commonInit(maxDepth);
36 private void commonInit(int maxDepth) {
37 mMatrix = new float[maxDepth * MATRIX_SIZE];
  /frameworks/base/libs/utils/
CallStack.cpp 278 void CallStack::update(int32_t ignoreDepth, int32_t maxDepth)
280 if (maxDepth > MAX_DEPTH)
281 maxDepth = MAX_DEPTH;
282 mCount = backtrace(mStack, ignoreDepth, maxDepth);
  /packages/apps/Gallery3D/src/com/cooliris/media/
MatrixStack.java 32 public MatrixStack(int maxDepth) {
33 commonInit(maxDepth);
36 private void commonInit(int maxDepth) {
37 mMatrix = new float[maxDepth * MATRIX_SIZE];
  /frameworks/base/core/java/com/android/internal/util/
HierarchicalStateMachine.java 646 int maxDepth = 0;
652 if (maxDepth < depth) {
653 maxDepth = depth;
656 if (mDbg) Log.d(TAG, "completeConstruction: maxDepth=" + maxDepth);
658 mStateStack = new StateInfo[maxDepth];
659 mTempStateStack = new StateInfo[maxDepth];
    [all...]
  /packages/inputmethods/LatinIME/native/src/
dictionary.h 72 void getWordsRec(int pos, int depth, int maxDepth, bool completion, int frequency,
dictionary.cpp 283 Dictionary::getWordsRec(int pos, int depth, int maxDepth, bool completion, int snr, int inputIndex,
287 if (depth > maxDepth) {
323 getWordsRec(childrenAddress, depth + 1, maxDepth,
330 getWordsRec(childrenAddress, depth + 1, maxDepth, false, snr, inputIndex, diffs);
349 maxDepth, true, snr * addedWeight, inputIndex + 1,
353 getWordsRec(childrenAddress, depth + 1, maxDepth,
  /external/srec/tools/grxmlcompile/
sub_min.cpp 122 int ii, jj, dd, maxDepth, count, itCnt;
124 maxDepth= 0;
126 if (maxDepth < depthMap[ii])
127 maxDepth= depthMap[ii];
133 for (dd= 0; dd <= maxDepth; dd++)
  /external/webkit/WebCore/inspector/front-end/
treeoutline.js 711 TreeElement.prototype.expandRecursively = function(maxDepth)
720 if (typeof maxDepth === "undefined" || typeof maxDepth === "null")
721 maxDepth = 3;
724 if (depth < maxDepth)
726 item = item.traverseNextTreeElement(false, this, (depth >= maxDepth), info);
  /external/webkit/WebCore/bindings/v8/
SerializedScriptValue.cpp 85 static const int maxDepth = 20000;
451 if (m_depth > maxDepth)
  /libcore/luni/src/main/java/java/lang/
Class.java     [all...]
  /external/webkit/WebKit/chromium/src/js/
HeapProfilerPanel.js 267 var maxDepth = 2;
272 current = current.traverseNextNode(false, null, (depth >= maxDepth), info);
    [all...]
  /frameworks/base/include/private/opengles/
gl_context.h 449 uint8_t maxDepth;
  /external/webkit/WebCore/bindings/scripts/
CodeGeneratorJS.pm     [all...]
  /frameworks/base/opengl/libagl/
matrix.cpp 389 maxDepth = depth;
460 if (depth >= (maxDepth-1)) {
  /prebuilt/sdk/tools/lib/
dx.jar 

Completed in 623 milliseconds