/prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/ |
fixer_util.py | 384 nodes = [node] 385 while nodes: 386 node = nodes.pop() 388 nodes.extend(node.children)
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/sepolgen/ |
output.py | 174 for node in module.nodes():
|
/sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
MoveGesture.java | 385 // Make sure we aren't removing the same nodes that are being added 417 final List<INode> nodes = new ArrayList<INode>(); local 423 nodes.add(node); 428 // Select the newly dropped nodes: 429 // Find out which nodes were added, and look up their corresponding 432 // Don't use the indices to search for corresponding nodes yet, since a 435 if (!selectionManager.selectDropped(nodes, null /* indices */)) { 444 selectionManager.selectDropped(nodes, indices); 638 // We can't switch views/nodes when the mouse is captured [all...] |
/external/apache-xml/src/main/java/org/apache/xpath/ |
NodeSetDTM.java | 41 * nextNode() is called, in order that nodes can be added 92 // * @param nodelist List of Nodes to be made members of the new set. 106 * @param nodelist Set of Nodes to be made members of the new set. 122 * @param ni Iterator which yields Nodes to be made members of the new set. 138 * @param iterator Iterator which yields Nodes to be made members of the new set. 172 // Do not reorder or strip duplicate nodes from the given DOM nodelist 292 * hardcoded to show all nodes except EntityReference nodes, which have 306 * The filter object used to screen nodes. Filters are applied to 316 * not going to return all nodes selected by whatToShow [all...] |
/external/jacoco/org.jacoco.core.test/src/org/jacoco/core/analysis/ |
CoverageBuilderTest.java | 229 private Set<String> getNames(Collection<? extends ICoverageNode> nodes) { 231 for (ICoverageNode n : nodes) {
|
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/BroadphaseCollision/ |
btMultiSapBroadphase.cpp | 92 QuantizedNodeArray& nodes = m_optimizedAabbTree->getLeafNodeArray(); local 102 nodes.push_back(node);
|
/external/opencv3/modules/ml/ |
precomp.hpp | 343 virtual const std::vector<Node>& getNodes() const { return nodes; } 355 vector<Node> nodes; member in class:cv::ml::DTreesImpl
|
/external/opencv3/modules/ml/src/ |
precomp.hpp | 343 virtual const std::vector<Node>& getNodes() const { return nodes; } 355 vector<Node> nodes; member in class:cv::ml::DTreesImpl
|
/external/selinux/libsepol/ |
Android.mk | 28 src/nodes.c \
|
/external/v8/test/webkit/ |
dfg-dead-unreachable-code-with-chain-of-dead-unchecked-nodes.js | 25 "Tests that code that is dead, unreachable, and contains a chain of nodes that use each other in an untyped way doesn't result in the IR getting corrupted."
|
/prebuilts/go/darwin-x86/src/cmd/pprof/internal/profile/ |
prune.go | 14 // Prune removes all nodes beneath a node matching dropRx, and not
|
/prebuilts/go/darwin-x86/src/runtime/race/testdata/ |
regression_test.go | 191 // interface conversion causes nodes to be put on init list
|
/prebuilts/go/linux-x86/src/cmd/pprof/internal/profile/ |
prune.go | 14 // Prune removes all nodes beneath a node matching dropRx, and not
|
/prebuilts/go/linux-x86/src/runtime/race/testdata/ |
regression_test.go | 191 // interface conversion causes nodes to be put on init list
|
/prebuilts/tools/common/m2/repository/org/gebish/geb-ast/0.9.3/ |
geb-ast-0.9.3.jar | |
/build/kati/ |
evalcmd.go | 345 func evalCommands(nodes []*DepNode, vars Vars) error { 348 for i, n := range nodes { 367 logStats("%d/%d rules have IO", ioCnt, len(nodes))
|
/external/llvm/utils/TableGen/ |
DAGISelMatcher.h | 40 /// nodes. 85 MarkGlueResults, // Indicate which interior nodes have glue results. 158 /// we can move this matcher past all of the nodes in-between Other and this 170 // we always match a node against nodes with kinds that are greater or equal 721 /// MatchNumber - This is the recorded nodes slot that contains the node we [all...] |
/external/pdfium/xfa/src/fxfa/src/parser/ |
xfa_script_hostpseudomodel.cpp | 329 if (iRet < 1 || !resoveNodeRS.nodes[0]->IsNode()) {
333 pNode = (CXFA_Node*)resoveNodeRS.nodes[0];
463 if (iRet < 1 || !resoveNodeRS.nodes[0]->IsNode()) {
466 pNode = (CXFA_Node*)resoveNodeRS.nodes[0];
532 if (iRet < 1 || !resoveNodeRS.nodes[0]->IsNode()) {
536 pNode = (CXFA_Node*)resoveNodeRS.nodes[0];
|
/prebuilts/tools/common/m2/repository/org/abego/treelayout/org.abego.treelayout.core/1.0.1/ |
org.abego.treelayout.core-1.0.1.jar | |
/prebuilts/tools/common/m2/repository/org/apache/maven/shared/maven-dependency-tree/1.2/ |
maven-dependency-tree-1.2.jar | |
/prebuilts/tools/common/offline-m2/org/abego/treelayout/org.abego.treelayout.core/1.0.1/ |
org.abego.treelayout.core-1.0.1.jar | |
/external/v8/benchmarks/ |
splay.js | 31 // JavaScript engine is at allocating nodes and reclaiming the memory 32 // used for old nodes. Because of the way splay trees work, the engine 113 // Replace a few nodes in the splay tree. 272 * @return {Array<*>} An array containing all the keys of tree's nodes. 301 // and right will always be nodes and we avoid special cases.
|
/prebuilts/gdb/darwin-x86/lib/python2.7/compiler/ |
transformer.py | 18 # Some fixes to try to have correct line number on almost all nodes 58 def asList(nodes): 60 for item in nodes: 84 if kind in nodes: 86 return nodes[kind](*args[1:]) 88 print nodes[kind], len(args), args 275 assert isinstance(code.nodes[0], Discard) 276 del code.nodes[0] 311 assert isinstance(code.nodes[0], Discard) 312 del code.nodes[0 [all...] |
/prebuilts/gdb/linux-x86/lib/python2.7/compiler/ |
transformer.py | 18 # Some fixes to try to have correct line number on almost all nodes 58 def asList(nodes): 60 for item in nodes: 84 if kind in nodes: 86 return nodes[kind](*args[1:]) 88 print nodes[kind], len(args), args 275 assert isinstance(code.nodes[0], Discard) 276 del code.nodes[0] 311 assert isinstance(code.nodes[0], Discard) 312 del code.nodes[0 [all...] |
/prebuilts/go/darwin-x86/pkg/bootstrap/src/bootstrap/compile/internal/gc/ |
racewalk.go | 22 // The rewriting is not yet complete. Certain nodes are not rewritten 109 // instrumentation code to top-level (statement) nodes' init 160 // Scan past OAS nodes copying results off stack. 375 // impossible nodes: only appear in backend. 419 OINDREG, // at this stage, only n(SP) nodes from nodarg
|