| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
| CommonTreeAdaptor.as | 12 * To get your parser to build nodes of a different type, override
14 * dupNode is called to duplicate nodes during rewrite operations.
34 /** Tell me how to create a token for use with imaginary token nodes.
46 /** Tell me how to create a token for use with imaginary token nodes.
65 * Only works with Tree nodes. For rules that match nothing,
|
| /external/dbus/dbus/ |
| dbus-marshal-recursive-util.c | 1080 TestTypeNode **nodes; member in struct:__anon10189
1652 TestTypeNode *nodes[1]; local
1787 TestTypeNode *nodes[N_VALUES]; local
1802 TestTypeNode *nodes[2]; local
2019 TestTypeNode *nodes[3]; local
[all...] |
| /external/freetype/src/base/ |
| ftdbgmem.c | 115 FT_Long nodes; member in struct:FT_MemTableRec_
260 new_size = ft_mem_closest_prime( table->nodes );
318 table->nodes = 0;
393 table->nodes = 0;
590 table->nodes++;
597 if ( table->nodes * 3 < table->size ||
598 table->size * 3 < table->nodes )
653 table->nodes--;
662 if ( table->nodes * 3 < table->size ||
663 table->size * 3 < table->nodes )
[all...] |
| /external/icu/icu4c/source/common/ |
| stringtriebuilder.cpp | 37 StringTrieBuilder::StringTrieBuilder() : nodes(NULL) {}
48 nodes=uhash_openSize(hashStringTrieNode, equalStringTrieNodes, NULL,
51 if(nodes==NULL) {
54 uhash_setKeyDeleter(nodes, uprv_deleteUObject);
61 uhash_close(nodes);
62 nodes=NULL;
163 // Write the sub-nodes in reverse order: The jump lengths are deltas from
193 // Write the split-branch nodes.
307 // Create the split-branch nodes.
326 const UHashElement *old=uhash_find(nodes, newNode)
[all...] |
| /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/base/ |
| ftdbgmem.c | 115 FT_Long nodes; member in struct:FT_MemTableRec_
260 new_size = ft_mem_closest_prime( table->nodes );
318 table->nodes = 0;
393 table->nodes = 0;
590 table->nodes++;
597 if ( table->nodes * 3 < table->size ||
598 table->size * 3 < table->nodes )
653 table->nodes--;
662 if ( table->nodes * 3 < table->size ||
663 table->size * 3 < table->nodes )
[all...] |
| /external/pdfium/third_party/freetype/src/base/ |
| ftdbgmem.c | 115 FT_Long nodes; member in struct:FT_MemTableRec_
260 new_size = ft_mem_closest_prime( table->nodes );
318 table->nodes = 0;
393 table->nodes = 0;
590 table->nodes++;
597 if ( table->nodes * 3 < table->size ||
598 table->size * 3 < table->nodes )
653 table->nodes--;
662 if ( table->nodes * 3 < table->size ||
663 table->size * 3 < table->nodes )
[all...] |
| /system/connectivity/shill/mobile_operator_db/ |
| serviceproviders_converter.py | 74 # Remember nodes that we decide to drop at any point.
128 """ Checks that the stats about nodes found / dumped tally. """
129 # First dump dropped nodes.
131 logging.warning('Following nodes were dropped:')
139 logging.info('Total number of XML CDMA nodes read [xml_cdma_nodes]: %d',
141 logging.info('Total number of XML GSM nodes read [xml_gsm_nodes]: %d',
143 logging.info('Total number of XML nodes read '
153 logging.info('Total number of protobuf nodes dropped '
156 logging.info(' (See above for the exact nodes dropped)')
246 |gsm|/|cdma| nodes. This allows us to directly deal with these node
[all...] |
| /prebuilts/eclipse/maven/apache-maven-3.2.1/lib/ |
| jsoup-1.7.2.jar | |
| /external/antlr/antlr-3.4/runtime/Python/antlr3/ |
| exceptions.py | 105 # imaginary nodes w/o line/col info. We now search backwards looking
136 def extractInformationFromTreeNodeStream(self, nodes):
140 self.node = nodes.LT(1)
141 adaptor = nodes.adaptor
148 priorNode = nodes.LT(i)
159 priorNode = nodes.LT(i)
|
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| dot.rb | 43 Abstract Syntax Tree nodes.
78 | <%= @nodes.join("\n ") %>
109 tree_template = Context.new( tree_template, :nodes => [], :edges => [] )
125 tree_template[ :nodes ] << parent_node_template
134 tree_template[ :nodes ] << node_template
|
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| FuncDocument.java | 103 XNodeSet nodes = new XNodeSet(xctxt.getDTMManager()); local
104 return nodes;
144 XNodeSet nodes = new XNodeSet(xctxt.getDTMManager()); local
145 NodeSetDTM mnl = nodes.mutableNodeset();
196 // nodes.mutableNodeset().addNode(newDoc);
210 return nodes;
|
| /external/testng/src/main/java/org/testng/internal/ |
| Graph.java | 25 // A map of nodes that are not the predecessors of any node
33 // Initially, all the nodes are put in the independent list as well
56 // Remove these two nodes from the independent list
86 * @return All the nodes that don't have any order with each other.
93 * @return All the nodes that have an order with each other, sorted
106 // Clone the list of nodes but only keep those that are
121 // Sort the nodes alphabetically to make sure that methods of the same class
132 // Find all the nodes that don't have any predecessors, add
161 // dependent nodes. Therefore, all the nodes were mostly sorted alphabetically. So we need to kee
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_ra.cpp | 663 inline RIG_Node *getNode(const LValue *v) const { return &nodes[v->id]; }
693 RIG_Node *nodes; member in class:nv50_ir::GCRA
722 if (!nodes[i].colors)
726 nodes[i].f,nodes[i].reg,nodes[i].colors,
727 nodes[i].weight,
728 nodes[i].degree, nodes[i].degreeLimit);
730 for (Graph::EdgeIterator ei = nodes[i].outgoing(); !ei.end(); ei.next()
[all...] |
| /external/opencv3/3rdparty/jinja2/ |
| compiler.py | 6 Compiles nodes into python code.
14 from jinja2 import nodes
15 from jinja2.nodes import EvalContext
58 if not isinstance(node, nodes.Template):
59 raise TypeError('Can\'t compile non template nodes')
88 def find_undeclared(nodes, names):
94 for node in nodes:
192 def inspect(self, nodes):
198 for node in nodes:
294 def inner_visit(nodes)
[all...] |
| /prebuilts/tools/common/m2/repository/org/jsoup/jsoup/1.6.3/ |
| jsoup-1.6.3.jar | |
| /external/libgdx/gdx/src/com/badlogic/gdx/graphics/g3d/ |
| Model.java | 58 /** A model represents a 3D assets. It stores a hierarchy of nodes. A node has a transform and optionally a graphical part in form
60 * Animations can be applied to nodes, to modify their transform (translation, rotation, scale) over time.</p>
63 * model in the world, and allows modification of materials and nodes without destroying the original model. The original model is
71 /** the materials of the model, used by nodes that have a graphical representation FIXME not sure if superfluous, allows
72 * modification of materials without having to traverse the nodes **/
74 /** root nodes of the model **/
75 public final Array<Node> nodes = new Array();
field in class:Model
80 /** parts of meshes, used by nodes that have a graphical representation FIXME not sure if superfluous, stored in Nodes as well,
108 loadNodes(modelData.nodes);
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| SelectionManager.java | 539 public void select(Collection<INode> nodes) {
540 List<CanvasViewInfo> infos = new ArrayList<CanvasViewInfo>(nodes.size());
541 for (INode node : nodes) {
1101 List<INode> nodes = new ArrayList<INode>(); local
[all...] |
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/BroadphaseCollision/ |
| btDbvt.cpp | 26 tConstNodeArray nodes; member in struct:btDbvtNodeEnumerator
27 void Process(const btDbvtNode* n) { nodes.push_back(n); }
567 btDbvtNodeEnumerator nodes; local
568 nodes.nodes.reserve(m_leaves*2);
569 enumNodes(m_root,nodes);
570 iwriter->Prepare(m_root,nodes.nodes.size());
571 for(int i=0;i<nodes.nodes.size();++i
[all...] |
| /external/v8/test/unittests/compiler/ |
| scheduler-unittest.cc | 113 BasicBlock** nodes; member in struct:v8::internal::compiler::SchedulerRPOTest::TestLoop
114 BasicBlock* header() { return nodes[0]; }
115 BasicBlock* last() { return nodes[count - 1]; }
116 ~TestLoop() { delete[] nodes; }
122 loop->nodes = new BasicBlock* [count];
124 loop->nodes[i] = schedule->NewBasicBlock();
126 schedule->AddSuccessorForTesting(loop->nodes[i - 1], loop->nodes[i]);
129 schedule->AddSuccessorForTesting(loop->nodes[count - 1], loop->nodes[0])
[all...] |
| /developers/build/prebuilts/gradle/DataLayer/Wearable/src/main/java/com/example/android/wearable/datalayer/ |
| MainActivity.java | 189 * Find the connected nodes that provide at least one of the given capabilities
211 Set<Node> nodes = new HashSet<>();
214 showDiscoveredNodes(nodes);
220 nodes.addAll(capabilityInfo.getNodes());
223 showDiscoveredNodes(nodes);
226 private void showDiscoveredNodes(Set<Node> nodes) {
228 for (Node node : nodes) {
231 LOGD(TAG, "Connected Nodes: " + (nodesList.isEmpty()
|
| /developers/samples/android/wearable/wear/DataLayer/Wearable/src/main/java/com/example/android/wearable/datalayer/ |
| MainActivity.java | 189 * Find the connected nodes that provide at least one of the given capabilities
211 Set<Node> nodes = new HashSet<>();
214 showDiscoveredNodes(nodes);
220 nodes.addAll(capabilityInfo.getNodes());
223 showDiscoveredNodes(nodes);
226 private void showDiscoveredNodes(Set<Node> nodes) {
228 for (Node node : nodes) {
231 LOGD(TAG, "Connected Nodes: " + (nodesList.isEmpty()
|
| /development/samples/browseable/DataLayer/Wearable/src/com.example.android.wearable.datalayer/ |
| MainActivity.java | 189 * Find the connected nodes that provide at least one of the given capabilities
211 Set<Node> nodes = new HashSet<>();
214 showDiscoveredNodes(nodes);
220 nodes.addAll(capabilityInfo.getNodes());
223 showDiscoveredNodes(nodes);
226 private void showDiscoveredNodes(Set<Node> nodes) {
228 for (Node node : nodes) {
231 LOGD(TAG, "Connected Nodes: " + (nodesList.isEmpty()
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| GrammarAST.java | 50 * class to track variables for many different kinds of nodes. It wastes
51 * space for nodes that don't need the values and OO principles cry out
75 /** This is used for TREE_BEGIN nodes to point into
81 /** Rule ref nodes, token refs, set, and NOT set refs need to track their
402 List<GrammarAST> nodes = new ArrayList<GrammarAST>(); local
403 _findAllType(ttype, nodes);
404 return nodes;
407 public void _findAllType(int ttype, List<GrammarAST> nodes) {
409 if ( this.getType()==ttype ) nodes.add(this);
413 child._findAllType(ttype, nodes);
[all...] |
| /external/wpa_supplicant_8/hs20/server/ca/ |
| setup.sh | 143 $OPENSSL req -config $PWD/openssl.cnf.tmp -batch -new -newkey rsa:2048 -nodes -out ocsp.csr -keyout ocsp.key -extensions v3_OCSP
151 $OPENSSL req -config $PWD/openssl.cnf.tmp -batch -new -newkey rsa:2048 -nodes -out server-revoked.csr -keyout server-revoked.key
161 $OPENSSL req -config $PWD/openssl.cnf.tmp -batch -new -newkey rsa:2048 -nodes -out server-client.csr -keyout server-client.key || fail "Could not create server-client.key"
169 $OPENSSL req -config $PWD/openssl.cnf.tmp -batch -new -newkey rsa:2048 -nodes -out user.csr -keyout user.key || fail "Could not create user.key"
186 echo $OPENSSL req -config $PWD/openssl.cnf.tmp -batch -sha256 -new -newkey rsa:2048 -nodes -out server.csr -keyout server.key -reqexts v3_osu_server
187 $OPENSSL req -config $PWD/openssl.cnf.tmp -batch -sha256 -new -newkey rsa:2048 -nodes -out server.csr -keyout server.key -reqexts v3_osu_server || fail "Failed to generate server request"
|
| /toolchain/binutils/binutils-2.25/libiberty/ |
| fibheap.c | 118 heap->nodes++;
161 /* Merge them to the next nodes on the opposite chain. */
167 heapa->nodes += heapb->nodes;
184 /* If we don't have a min set, it means we have no nodes. */
287 return heap->nodes == 0;
310 heap->nodes--;
312 /* If we are left with no nodes, then the min is NULL. */
313 if (heap->nodes == 0)
|
