OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:maxDepth
(Results
1 - 25
of
212
) sorted by null
1
2
3
4
5
6
7
8
9
/prebuilts/go/darwin-x86/test/bench/shootout/
binary-tree.go
70
maxDepth
:= *n
72
maxDepth
= minDepth + 2
74
stretchDepth :=
maxDepth
+ 1
79
longLivedTree := bottomUpTree(0,
maxDepth
)
81
for depth := minDepth; depth <=
maxDepth
; depth += 2 {
82
iterations := 1 << uint(
maxDepth
-depth+minDepth)
91
fmt.Printf("long lived tree of depth %d\t check: %d\n",
maxDepth
, longLivedTree.itemCheck())
binary-tree.c
102
unsigned N, depth, minDepth,
maxDepth
, stretchDepth;
110
maxDepth
= minDepth + 2;
112
maxDepth
= N;
114
stretchDepth =
maxDepth
+ 1;
126
longLivedTree = BottomUpTree(0,
maxDepth
);
128
for (depth = minDepth; depth <=
maxDepth
; depth += 2)
132
iterations = pow(2,
maxDepth
- depth + minDepth);
159
maxDepth
,
binary-tree-freelist.go
103
maxDepth
:= *n
105
maxDepth
= minDepth + 2
107
stretchDepth :=
maxDepth
+ 1
112
longLivedTree := bottomUpTree(0,
maxDepth
)
114
for depth := minDepth; depth <=
maxDepth
; depth += 2 {
115
iterations := 1 << uint(
maxDepth
-depth+minDepth)
128
fmt.Printf("long lived tree of depth %d\t check: %d\n",
maxDepth
, longLivedTree.itemCheck())
/prebuilts/go/linux-x86/test/bench/shootout/
binary-tree.go
70
maxDepth
:= *n
72
maxDepth
= minDepth + 2
74
stretchDepth :=
maxDepth
+ 1
79
longLivedTree := bottomUpTree(0,
maxDepth
)
81
for depth := minDepth; depth <=
maxDepth
; depth += 2 {
82
iterations := 1 << uint(
maxDepth
-depth+minDepth)
91
fmt.Printf("long lived tree of depth %d\t check: %d\n",
maxDepth
, longLivedTree.itemCheck())
binary-tree.c
102
unsigned N, depth, minDepth,
maxDepth
, stretchDepth;
110
maxDepth
= minDepth + 2;
112
maxDepth
= N;
114
stretchDepth =
maxDepth
+ 1;
126
longLivedTree = BottomUpTree(0,
maxDepth
);
128
for (depth = minDepth; depth <=
maxDepth
; depth += 2)
132
iterations = pow(2,
maxDepth
- depth + minDepth);
159
maxDepth
,
binary-tree-freelist.go
103
maxDepth
:= *n
105
maxDepth
= minDepth + 2
107
stretchDepth :=
maxDepth
+ 1
112
longLivedTree := bottomUpTree(0,
maxDepth
)
114
for depth := minDepth; depth <=
maxDepth
; depth += 2 {
115
iterations := 1 << uint(
maxDepth
-depth+minDepth)
128
fmt.Printf("long lived tree of depth %d\t check: %d\n",
maxDepth
, longLivedTree.itemCheck())
/prebuilts/go/darwin-x86/test/bench/garbage/
tree.go
73
maxDepth
:= *n
75
maxDepth
= minDepth + 2
77
stretchDepth :=
maxDepth
+ 1
82
longLivedTree := bottomUpTree(0,
maxDepth
)
84
for depth := minDepth; depth <=
maxDepth
; depth += 2 {
85
iterations := 1 << uint(
maxDepth
-depth+minDepth)
94
fmt.Printf("long lived tree of depth %d\t check: %d\n",
maxDepth
, longLivedTree.itemCheck())
/prebuilts/go/linux-x86/test/bench/garbage/
tree.go
73
maxDepth
:= *n
75
maxDepth
= minDepth + 2
77
stretchDepth :=
maxDepth
+ 1
82
longLivedTree := bottomUpTree(0,
maxDepth
)
84
for depth := minDepth; depth <=
maxDepth
; depth += 2 {
85
iterations := 1 << uint(
maxDepth
-depth+minDepth)
94
fmt.Printf("long lived tree of depth %d\t check: %d\n",
maxDepth
, longLivedTree.itemCheck())
/packages/inputmethods/LatinIME/native/jni/src/dictionary/utils/
binary_dictionary_shortcut_iterator.h
46
const int
maxDepth
, int *const outTarget, int *const outTargetLength,
48
mShortcutStructurePolicy->getNextShortcut(
maxDepth
, outTarget, outTargetLength,
/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/opencv3/modules/ml/src/
kdtree.hpp
90
CV_PROP int
maxDepth
; //!< maximum depth of the search tree. Do not modify it
precomp.hpp
126
TreeParams( int
maxDepth
, int minSampleCount,
142
maxDepth
= std::min( val, 25 );
166
inline int getMaxDepth() const { return
maxDepth
; }
184
int
maxDepth
;
280
CV_WRAP_SAME_PROPERTY(int,
MaxDepth
, params)
kdtree.cpp
64
maxDepth
= -1;
70
maxDepth
= -1;
77
maxDepth
= -1;
261
maxDepth
= _maxDepth;
/external/slf4j/log4j-over-slf4j/src/main/java/org/apache/log4j/
NDC.java
99
static public void setMaxDepth(int
maxDepth
) {
/external/testng/src/test/java/test/
GraphTest.java
156
final int
maxDepth
= 7;
159
// Add
maxDepth
groups of new nodes, where each group contains nodesPerDepth
163
for (int depth = 1; depth <=
maxDepth
; depth++) {
177
// Finally, make all of the nodes in the group at depth
maxDepth
181
String node = String.valueOf(i + (100 *
maxDepth
));
185
// Now we're done building the graph, which has (
maxDepth
* nodesPerDepth) + 2
194
Assert.assertTrue(predecessors.size() == (
maxDepth
* nodesPerDepth));
/external/opencv3/modules/ml/
precomp.hpp
126
TreeParams( int
maxDepth
, int minSampleCount,
142
maxDepth
= std::min( val, 25 );
166
inline int getMaxDepth() const { return
maxDepth
; }
184
int
maxDepth
;
280
CV_WRAP_SAME_PROPERTY(int,
MaxDepth
, params)
/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/libgdx/tests/gdx-tests/src/com/badlogic/gdx/tests/bullet/
OcclusionBuffer.java
321
float
maxDepth
= Float.NEGATIVE_INFINITY;
326
maxDepth
= Math.max(depth,
maxDepth
);
328
float extent = 1 / (
maxDepth
- minDepth);
/external/deqp/external/vulkancts/framework/vulkan/
vkTypeUtil.inl
161
inline VkViewport makeViewport (float x, float y, float width, float height, float minDepth, float
maxDepth
)
169
res.
maxDepth
=
maxDepth
;
/frameworks/base/core/java/com/android/internal/util/
StateMachine.java
[
all
...]
Completed in 3230 milliseconds
1
2
3
4
5
6
7
8
9