OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:leaf
(Results
26 - 50
of
281
) sorted by null
1
2
3
4
5
6
7
8
9
10
11
>>
/dalvik/tools/dmtracedump/tests/filters/
testWaitingDisjointSingleThreadDiffFilterSameKeysExpected
27
div.
leaf
{ margin-left: 10 }
31
span.
leaf
{ padding-right: 10; }
177
<div class="
leaf
"><span class="
leaf
"> </span> 8 8 100.0 100.0 3+0 <a href="#m1">[1]</a> m ()</div>
181
<div class="
leaf
"><span class="
leaf
"> </span> 4 4 100.0 100.0 2+0 <a href="#m2">[2]</a> m ()</div>
185
<div class="
leaf
"><span class="
leaf
"> </span> 4 4 100.0 100.0 2+0 <a href="#m3">[3]</a> m ()</div>
204
<div class="
leaf
"><span class="
leaf
"> </span> 8   (…)
[
all
...]
testWaitingDisjointSingleThreadSameFilterSameKeysExpected
27
div.
leaf
{ margin-left: 10 }
31
span.
leaf
{ padding-right: 10; }
170
<div class="
leaf
"><span class="
leaf
"> </span> 8 8 100.0 100.0 3+0 <a href="#m1">[1]</a> m ()</div>
174
<div class="
leaf
"><span class="
leaf
"> </span> 4 4 100.0 100.0 2+0 <a href="#m2">[2]</a> m ()</div>
178
<div class="
leaf
"><span class="
leaf
"> </span> 4 4 100.0 100.0 2+0 <a href="#m3">[3]</a> m ()</div>
197
<div class="
leaf
"><span class="
leaf
"> </span> 8   (…)
[
all
...]
testWaitingNestedOverlapCrossThreadDiffFilterSameKeysExpected
27
div.
leaf
{ margin-left: 10 }
31
span.
leaf
{ padding-right: 10; }
177
<div class="
leaf
"><span class="
leaf
"> </span> 8 8 100.0 100.0 2+0 <a href="#m1">[1]</a> m ()</div>
181
<div class="
leaf
"><span class="
leaf
"> </span> 4 4 100.0 100.0 2+0 <a href="#m2">[2]</a> m ()</div>
185
<div class="
leaf
"><span class="
leaf
"> </span> 4 4 100.0 100.0 2+0 <a href="#m3">[3]</a> m ()</div>
204
<div class="
leaf
"><span class="
leaf
"> </span> 8   (…)
[
all
...]
testWaitingNestedOverlapCrossThreadSameFilterSameKeysExpected
27
div.
leaf
{ margin-left: 10 }
31
span.
leaf
{ padding-right: 10; }
170
<div class="
leaf
"><span class="
leaf
"> </span> 8 8 100.0 100.0 2+0 <a href="#m1">[1]</a> m ()</div>
174
<div class="
leaf
"><span class="
leaf
"> </span> 4 4 100.0 100.0 2+0 <a href="#m2">[2]</a> m ()</div>
178
<div class="
leaf
"><span class="
leaf
"> </span> 4 4 100.0 100.0 2+0 <a href="#m3">[3]</a> m ()</div>
197
<div class="
leaf
"><span class="
leaf
"> </span> 8   (…)
[
all
...]
testWaitingNestedOverlapSingleThreadDiffFilterSameKeysExpected
27
div.
leaf
{ margin-left: 10 }
31
span.
leaf
{ padding-right: 10; }
177
<div class="
leaf
"><span class="
leaf
"> </span> 4 4 100.0 100.0 2+0 <a href="#m1">[1]</a> m ()</div>
181
<div class="
leaf
"><span class="
leaf
"> </span> 4 4 100.0 100.0 2+0 <a href="#m2">[2]</a> m ()</div>
185
<div class="
leaf
"><span class="
leaf
"> </span> 2 2 100.0 100.0 1+0 <a href="#m3">[3]</a> m ()</div>
204
<div class="
leaf
"><span class="
leaf
"> </span> 4   (…)
[
all
...]
testWaitingNestedOverlapSingleThreadSameFilterSameKeysExpected
27
div.
leaf
{ margin-left: 10 }
31
span.
leaf
{ padding-right: 10; }
170
<div class="
leaf
"><span class="
leaf
"> </span> 4 4 100.0 100.0 2+0 <a href="#m1">[1]</a> m ()</div>
174
<div class="
leaf
"><span class="
leaf
"> </span> 4 4 100.0 100.0 2+0 <a href="#m2">[2]</a> m ()</div>
178
<div class="
leaf
"><span class="
leaf
"> </span> 2 2 100.0 100.0 1+0 <a href="#m3">[3]</a> m ()</div>
197
<div class="
leaf
"><span class="
leaf
"> </span> 4   (…)
[
all
...]
testWaitingPairCrossThreadExpected
27
div.
leaf
{ margin-left: 10 }
31
span.
leaf
{ padding-right: 10; }
170
<div class="
leaf
"><span class="
leaf
"> </span> 4 4 100.0 100.0 2+0 <a href="#m1">[1]</a> m ()</div>
174
<div class="
leaf
"><span class="
leaf
"> </span> 2 2 100.0 100.0 1+0 <a href="#m2">[2]</a> m ()</div>
178
<div class="
leaf
"><span class="
leaf
"> </span> 2 2 100.0 100.0 1+0 <a href="#m3">[3]</a> m ()</div>
197
<div class="
leaf
"><span class="
leaf
"> </span> 4   (…)
[
all
...]
testWaitingPairSingleThreadExpected
27
div.
leaf
{ margin-left: 10 }
31
span.
leaf
{ padding-right: 10; }
170
<div class="
leaf
"><span class="
leaf
"> </span> 4 4 100.0 100.0 2+0 <a href="#m1">[1]</a> m ()</div>
174
<div class="
leaf
"><span class="
leaf
"> </span> 2 2 100.0 100.0 1+0 <a href="#m2">[2]</a> m ()</div>
178
<div class="
leaf
"><span class="
leaf
"> </span> 2 2 100.0 100.0 1+0 <a href="#m3">[3]</a> m ()</div>
197
<div class="
leaf
"><span class="
leaf
"> </span> 4   (…)
[
all
...]
testWaitingPartialOverlapCrossThreadDiffFilterSameKeysExpected
27
div.
leaf
{ margin-left: 10 }
31
span.
leaf
{ padding-right: 10; }
177
<div class="
leaf
"><span class="
leaf
"> </span> 8 8 100.0 100.0 4+0 <a href="#m1">[1]</a> m ()</div>
181
<div class="
leaf
"><span class="
leaf
"> </span> 4 4 100.0 100.0 2+0 <a href="#m2">[2]</a> m ()</div>
185
<div class="
leaf
"><span class="
leaf
"> </span> 4 4 100.0 100.0 2+0 <a href="#m3">[3]</a> m ()</div>
204
<div class="
leaf
"><span class="
leaf
"> </span> 8   (…)
[
all
...]
testWaitingPartialOverlapCrossThreadSameFilterSameKeysExpected
27
div.
leaf
{ margin-left: 10 }
31
span.
leaf
{ padding-right: 10; }
170
<div class="
leaf
"><span class="
leaf
"> </span> 8 8 100.0 100.0 4+0 <a href="#m1">[1]</a> m ()</div>
174
<div class="
leaf
"><span class="
leaf
"> </span> 4 4 100.0 100.0 2+0 <a href="#m2">[2]</a> m ()</div>
178
<div class="
leaf
"><span class="
leaf
"> </span> 4 4 100.0 100.0 2+0 <a href="#m3">[3]</a> m ()</div>
197
<div class="
leaf
"><span class="
leaf
"> </span> 8   (…)
[
all
...]
testWaitingPartialOverlapSingleThreadDiffFilterSameKeysExpected
27
div.
leaf
{ margin-left: 10 }
31
span.
leaf
{ padding-right: 10; }
177
<div class="
leaf
"><span class="
leaf
"> </span> 4 4 100.0 100.0 2+0 <a href="#m1">[1]</a> m ()</div>
181
<div class="
leaf
"><span class="
leaf
"> </span> 4 4 100.0 100.0 2+0 <a href="#m2">[2]</a> m ()</div>
185
<div class="
leaf
"><span class="
leaf
"> </span> 2 2 100.0 100.0 1+0 <a href="#m3">[3]</a> m ()</div>
204
<div class="
leaf
"><span class="
leaf
"> </span> 4   (…)
[
all
...]
testWaitingPartialOverlapSingleThreadSameFilterSameKeysExpected
27
div.
leaf
{ margin-left: 10 }
31
span.
leaf
{ padding-right: 10; }
170
<div class="
leaf
"><span class="
leaf
"> </span> 4 4 100.0 100.0 2+0 <a href="#m1">[1]</a> m ()</div>
174
<div class="
leaf
"><span class="
leaf
"> </span> 4 4 100.0 100.0 2+0 <a href="#m2">[2]</a> m ()</div>
178
<div class="
leaf
"><span class="
leaf
"> </span> 2 2 100.0 100.0 1+0 <a href="#m3">[3]</a> m ()</div>
197
<div class="
leaf
"><span class="
leaf
"> </span> 4   (…)
[
all
...]
testWaitingDisjointSingleThreadSameFilterDiffKeysExpected
27
div.
leaf
{ margin-left: 10 }
31
span.
leaf
{ padding-right: 10; }
178
<div class="
leaf
"><span class="
leaf
"> </span> 8 8 100.0 100.0 3+0 <a href="#m1">[1]</a> m ()</div>
182
<div class="
leaf
"><span class="
leaf
"> </span> 4 6 100.0 100.0 1+0 <a href="#m2">[2]</a> m ()</div>
186
<div class="
leaf
"><span class="
leaf
"> </span> 2 2 100.0 100.0 1+0 <a href="#m3">[3]</a> m ()</div>
190
<div class="
leaf
"><span class="
leaf
"> </span> 2   (…)
[
all
...]
testWaitingNestedOverlapSingleThreadSameFilterDiffKeysExpected
27
div.
leaf
{ margin-left: 10 }
31
span.
leaf
{ padding-right: 10; }
176
<div class="
leaf
"><span class="
leaf
"> </span> 2 2 100.0 100.0 1+0 <a href="#m1">[1]</a> m ()</div>
180
<div class="
leaf
"><span class="
leaf
"> </span> 2 2 100.0 100.0 1+0 <a href="#m2">[2]</a> m ()</div>
184
<div class="
leaf
"><span class="
leaf
"> </span> 2 2 100.0 100.0 1+0 <a href="#m3">[3]</a> m ()</div>
188
<div class="
leaf
"><span class="
leaf
"> </span> 2   (…)
[
all
...]
testWaitingPartialOverlapSingleThreadSameFilterDiffKeysExpected
27
div.
leaf
{ margin-left: 10 }
31
span.
leaf
{ padding-right: 10; }
176
<div class="
leaf
"><span class="
leaf
"> </span> 4 6 100.0 100.0 1+0 <a href="#m1">[1]</a> m ()</div>
180
<div class="
leaf
"><span class="
leaf
"> </span> 2 2 100.0 100.0 1+0 <a href="#m2">[2]</a> m ()</div>
184
<div class="
leaf
"><span class="
leaf
"> </span> 2 2 100.0 100.0 1+0 <a href="#m3">[3]</a> m ()</div>
188
<div class="
leaf
"><span class="
leaf
"> </span> 2   (…)
[
all
...]
testWaitingSoloCrossThreadExpected
27
div.
leaf
{ margin-left: 10 }
31
span.
leaf
{ padding-right: 10; }
164
<div class="
leaf
"><span class="
leaf
"> </span> 4 4 100.0 100.0 1+0 <a href="#m1">[1]</a> m ()</div>
168
<div class="
leaf
"><span class="
leaf
"> </span> 4 4 100.0 100.0 2+0 <a href="#m2">[2]</a> m ()</div>
187
<div class="
leaf
"><span class="
leaf
"> </span> 4 4 50.0 50.0 1+0 <a href="#m1">[1]</a> C.m ()</div>
188
<div class="
leaf
"><span class="
leaf
"> </span> 4   (…)
[
all
...]
testWaitingSoloSingleThreadExpected
27
div.
leaf
{ margin-left: 10 }
31
span.
leaf
{ padding-right: 10; }
166
<div class="
leaf
"><span class="
leaf
"> </span> 4 6 100.0 100.0 1+0 <a href="#m1">[1]</a> m ()</div>
170
<div class="
leaf
"><span class="
leaf
"> </span> 4 4 100.0 100.0 2+0 <a href="#m2">[2]</a> m ()</div>
189
<div class="
leaf
"><span class="
leaf
"> </span> 4 6 50.0 50.0 1+0 <a href="#m1">[1]</a> C.m ()</div>
190
<div class="
leaf
"><span class="
leaf
"> </span> 4   (…)
[
all
...]
/external/srec/seti/sltsEngine/include/
lts_seq_internal.h
102
short *values_or_question1; /*if
leaf
node, this is the value at the node. If not, this
104
short *question2; /*also used to hold backoff_output for
leaf
nodes*/
106
If = MAX_NODES, then this is a
leaf
node*/
/external/qemu/elff/
dwarf_die.cc
113
* Lets iterate through child DIEs to find the
leaf
(last DIE) that contains
117
DIEObject*
leaf
= child->get_leaf_for_address(address);
local
118
if (
leaf
!= NULL) {
119
return
leaf
;
123
/* No child DIE contains this address. This DIE is the
leaf
. */
/external/iproute2/man/man8/
tc-cbq-details.8
152
Leaf
nodes, attached to the bottom of the class hierarchy, have a level of 0.
155
Classification is a loop, which terminates when a
leaf
class is found. At any
168
a class which is not a
leaf
class, restart loop from the class returned.
169
If it is a
leaf
, choose it and terminate.
176
than the current class. If so, and the returned class is not a
leaf
node,
177
restart the loop at the found class. If it is a
leaf
node, terminate.
191
leaf
node, restart the loop at this class. If it is a
leaf
, choose it and
217
leaf
node, but in the middle of the hierarchy.
/external/grub/stage2/
fsys_reiserfs.c
178
/* Header of a disk block. More precisely, header of a formatted
leaf
185
struct key blk_right_delim_key; /* Right delimiting key for this block (supported for
leaf
level nodes
189
#define DISK_LEAF_NODE_LEVEL 1 /*
Leaf
node level. */
346
#define
LEAF
CACHE (DISK_LEAF_NODE_LEVEL)
349
#define ITEMHEAD ((struct item_head *) ((int)
LEAF
+ BLKH_SIZE))
661
* which is simultanously
leaf
and root */
662
memcpy (
LEAF
, ROOT, INFO->blocksize);
674
* 1
LEAF
node (if the ROOT is also a
LEAF
it is copied here
743
if (ih == &ITEMHEAD[BLOCKHEAD (
LEAF
)->blk_nr_item]
[
all
...]
/external/junit/src/junit/swingui/
TestSuitePanel.java
56
boolean sel, boolean expanded, boolean
leaf
, int row, boolean hasFocus) {
58
Component c= super.getTreeCellRendererComponent(tree, value, sel, expanded,
leaf
, row, hasFocus);
/external/tinyxml/docs/
classTiXmlBase.html
67
<div class="fragment"><pre class="fragment"> A Document can contain: Element (container or
leaf
)
68
Comment (
leaf
)
69
Unknown (
leaf
)
70
Declaration(
leaf
)
72
An Element can contain: Element (container or
leaf
)
73
Text (
leaf
)
75
Comment (
leaf
)
76
Unknown (
leaf
)
/frameworks/base/include/utils/
String8.h
286
* If
leaf
is a fully qualified path (i.e. starts with '/', it
289
String8& appendPath(const char*
leaf
);
290
String8& appendPath(const String8&
leaf
) { return appendPath(
leaf
.string()); }
295
String8 appendPathCopy(const char*
leaf
) const
296
{ String8 p(*this); p.appendPath(
leaf
); return p; }
297
String8 appendPathCopy(const String8&
leaf
) const { return appendPathCopy(
leaf
.string()); }
/external/quake/quake/src/QW/client/
bspfile.h
84
int visleafs; // not including the solid
leaf
0
198
//
leaf
0 is the generic CONTENTS_SOLID
leaf
, used for all solid areas
Completed in 136 milliseconds
1
2
3
4
5
6
7
8
9
10
11
>>