/packages/inputmethods/LatinIME/native/jni/src/suggest/core/dictionary/ |
binary_dictionary_shortcut_iterator.h | 41 const int maxDepth, int *const outTarget, int *const outTargetLength, 43 mShortcutStructurePolicy->getNextShortcut(maxDepth, outTarget, outTargetLength,
|
/external/chromium_org/third_party/WebKit/PerformanceTests/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/chromium_org/third_party/WebKit/PerformanceTests/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/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-1.0/ |
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/chromium_org/third_party/angle/src/compiler/translator/ |
DetectCallDepth.cpp | 36 int maxDepth = depth; 55 maxDepth = std::max(callDepth, maxDepth); 64 return maxDepth; 76 maxDepth(limitCallStackDepth ? maxCallStackDepth : FunctionNode::kInfiniteCallDepth) 129 return depth >= maxDepth; 149 if (maxCallDepth >= maxDepth) 157 if (maxDepth != FunctionNode::kInfiniteCallDepth) {
|
DetectCallDepth.h | 72 int maxDepth;
|
/dalvik/dexgen/src/com/android/dexgen/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);
|
/dalvik/dx/src/com/android/dx/dex/file/ |
ClassDefsSection.java | 153 * @param maxDepth maximum recursion depth; if negative, this will 157 private int orderItems0(Type type, int idx, int maxDepth) { 164 if (maxDepth < 0) { 168 maxDepth--; 173 idx = orderItems0(superclass, idx, maxDepth); 179 idx = orderItems0(interfaces.getType(i), idx, maxDepth);
|
/external/dexmaker/src/dx/java/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);
|
/external/clang/bindings/python/examples/cindex/ |
cindex-dump.py | 40 if opts.maxDepth is not None and depth >= opts.maxDepth: 68 parser.add_option("", "--max-depth", dest="maxDepth",
|
/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];
|
/external/chromium_org/third_party/WebKit/Source/bindings/core/v8/ |
ScriptValue.cpp | 81 return v8ToJSONValue(scriptState->isolate(), v8Value(), JSONValue::maxDepth);
|
V8Binding.cpp | 884 PassRefPtr<JSONValue> v8ToJSONValue(v8::Isolate* isolate, v8::Handle<v8::Value> value, int maxDepth) 891 if (!maxDepth) 893 maxDepth--; 909 RefPtr<JSONValue> element = v8ToJSONValue(isolate, value, maxDepth); 926 RefPtr<JSONValue> propertyValue = v8ToJSONValue(isolate, object->Get(name), maxDepth); [all...] |
/external/skia/src/core/ |
SkQuadTree.cpp | 147 int maxDepth = 0; 150 maxDepth = SkMax32(maxDepth, getDepth(node->fChildren[index])); 153 return maxDepth + 1;
|
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/sdk/ |
CPUProfileDataModel.js | 69 this.maxDepth = 0; 74 if (depth > this.maxDepth) 75 this.maxDepth = depth; 214 this._stackStartTimes = new Float64Array(this.maxDepth + 2); 217 this._stackChildrenDuration = new Float64Array(this.maxDepth + 2);
|
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/profiler/ |
CPUProfileFlameChart.js | 157 var maxDepth = 5; 170 maxDepth = Math.max(maxDepth, depth); 191 this._maxStackDepth = maxDepth;
|
/external/chromium_org/third_party/mesa/src/src/mesa/main/ |
matrix.c | 251 if (stack->Depth + 1 >= stack->MaxDepth) { 658 * \param maxDepth maximum stack depth. 661 * Allocates an array of \p maxDepth elements for the matrix stack and calls 666 GLuint maxDepth, GLuint dirtyFlag ) 671 stack->MaxDepth = maxDepth; 674 stack->Stack = (GLmatrix *) CALLOC(maxDepth * sizeof(GLmatrix)); 675 for (i = 0; i < maxDepth; i++) { 693 for (i = 0; i < stack->MaxDepth; i++) {
|
/external/deqp/framework/randomshaders/ |
rsgUtils.cpp | 249 int maxDepth = 0; 271 maxDepth = de::max(maxDepth, depth); 273 return maxDepth + 1;
|
/external/mesa3d/src/mesa/main/ |
matrix.c | 251 if (stack->Depth + 1 >= stack->MaxDepth) { 658 * \param maxDepth maximum stack depth. 661 * Allocates an array of \p maxDepth elements for the matrix stack and calls 666 GLuint maxDepth, GLuint dirtyFlag ) 671 stack->MaxDepth = maxDepth; 674 stack->Stack = (GLmatrix *) CALLOC(maxDepth * sizeof(GLmatrix)); 675 for (i = 0; i < maxDepth; i++) { 693 for (i = 0; i < stack->MaxDepth; i++) {
|
/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++)
|
/frameworks/base/core/java/com/android/internal/util/ |
StateMachine.java | 930 int maxDepth = 0; 936 if (maxDepth < depth) { 937 maxDepth = depth; 940 if (mDbg) mSm.log("completeConstruction: maxDepth=" + maxDepth); 942 mStateStack = new StateInfo[maxDepth] [all...] |
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/ui/ |
treeoutline.js | 775 TreeElement.prototype.expandRecursively = function(maxDepth) 784 if (isNaN(maxDepth)) 785 maxDepth = 3; 788 if (depth < maxDepth) 790 item = item.traverseNextTreeElement(false, this, (depth >= maxDepth), info);
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/ |
pyassem.py | 659 maxDepth = 0 679 if depth > maxDepth: 680 maxDepth = depth 682 print depth, maxDepth 683 return maxDepth
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/ |
pyassem.py | 659 maxDepth = 0 679 if depth > maxDepth: 680 maxDepth = depth 682 print depth, maxDepth 683 return maxDepth
|
/external/chromium_org/third_party/WebKit/Source/core/inspector/ |
AsyncCallStackTracker.cpp | 442 void AsyncCallStackTracker::ensureMaxAsyncCallChainDepth(AsyncCallChain* chain, unsigned maxDepth) 444 while (chain->m_callStacks.size() > maxDepth)
|