OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:nodes
(Results
701 - 725
of
4338
) sorted by null
<<
21
22
23
24
25
26
27
28
29
30
>>
/external/v8/src/compiler/
js-generic-lowering.h
38
// Helpers to replace existing
nodes
with a generic call.
node-marker.h
47
// to
nodes
. Only one NodeMarker per graph is valid at a given time.
/external/valgrind/nightly/conf/
cellbuzz-native.conf
2
# Specifics for the Georgia Tech Cellbuzz cluster. The
nodes
in the cellq30
/frameworks/base/libs/hwui/tests/common/scenes/
HwLayerAnimation.cpp
23
"A nested pair of
nodes
with LAYER_TYPE_HARDWARE set on each. "
/frameworks/base/media/mca/filterfw/java/android/filterfw/core/
Scheduler.java
44
// TODO: Check that the state of all
nodes
is FINISHED.
/hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/third_party/nestegg/
TODO
19
parser should return a generic tree of
nodes
that a second pass uses to
/libcore/luni/src/main/java/org/w3c/dom/
Entity.java
22
* <code>EntityReference</code>
nodes
in the document tree.
31
* <p>DOM Level 3 does not support editing <code>Entity</code>
nodes
; if a
36
* <code>Entity</code>
nodes
and all their descendants are readonly.
41
* for <code>EntityReference</code>
nodes
that refer to this entity, when
/packages/inputmethods/LatinIME/native/jni/src/dictionary/structure/v4/
ver4_patricia_trie_node_reader.h
31
* This class is used for helping to read
nodes
of ver4 patricia trie. This class handles moved
/packages/services/Car/car_product/sepolicy/
qcom-usb-sh.te
19
# Allow write access to USB related sysfs
nodes
.
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/linux/
jffs2.h
37
/* How small can we sensibly write
nodes
? */
111
jint32_t totlen; /* So we can skip over
nodes
we don't grok */
200
jint32_t padded; /* sum of the size of padding
nodes
*/
216
/* Data payload for device
nodes
. */
pci.h
34
/* Ioctls for /proc/bus/pci/X/Y
nodes
. */
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/linux/
jffs2.h
38
/* How small can we sensibly write
nodes
? */
112
jint32_t totlen; /* So we can skip over
nodes
we don't grok */
201
jint32_t padded; /* sum of the size of padding
nodes
*/
217
/* Data payload for device
nodes
. */
pci.h
34
/* Ioctls for /proc/bus/pci/X/Y
nodes
. */
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/
ipa-utils.h
29
/* This field will have the samy value for any two
nodes
in the same strongly
/prebuilts/gdb/darwin-x86/lib/python2.7/compiler/
syntax.py
42
## for target in node.
nodes
:
/prebuilts/gdb/darwin-x86/lib/python2.7/lib2to3/fixes/
fix_urllib.py
161
nodes
= []
163
nodes
.extend([new_node, Newline()])
164
nodes
.append(new_nodes[-1])
165
node.replace(
nodes
)
/prebuilts/gdb/linux-x86/lib/python2.7/compiler/
syntax.py
42
## for target in node.
nodes
:
/prebuilts/gdb/linux-x86/lib/python2.7/lib2to3/fixes/
fix_urllib.py
161
nodes
= []
163
nodes
.extend([new_node, Newline()])
164
nodes
.append(new_nodes[-1])
165
node.replace(
nodes
)
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/
syntax.py
42
## for target in node.
nodes
:
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/fixes/
fix_urllib.py
161
nodes
= []
163
nodes
.extend([new_node, Newline()])
164
nodes
.append(new_nodes[-1])
165
node.replace(
nodes
)
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/
syntax.py
42
## for target in node.
nodes
:
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/fixes/
fix_urllib.py
161
nodes
= []
163
nodes
.extend([new_node, Newline()])
164
nodes
.append(new_nodes[-1])
165
node.replace(
nodes
)
/system/update_engine/payload_generator/
topological_sort.h
27
// the
nodes
, in order visited, in 'out'.
/toolchain/binutils/binutils-2.25/include/vms/
dcx.h
46
unsigned char
nodes
[2];
member in struct:vms_dcxsbm
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/
DTMNamedNodeMap.java
53
/** The number of
nodes
in this map. */
71
* @return The number of
nodes
in this map.
114
* is greater than or equal to the number of
nodes
in this map, this
142
* which the node must be stored under, multiple
nodes
of certain types
144
* names would clash. This is seen as preferable to allowing
nodes
to be
159
* <code>Attr</code>
nodes
to re-use them in other elements.
237
* <code>Attr</code>
nodes
to re-use them in other elements.
Completed in 1944 milliseconds
<<
21
22
23
24
25
26
27
28
29
30
>>