| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/compiler/ |
| transformer.py | 179 def file_input(self, nodelist):
180 doc = self.get_docstring(nodelist, symbol.file_input)
186 for node in nodelist[i:]:
191 def eval_input(self, nodelist):
194 return Expression(self.com_node(nodelist[0]))
196 def decorator_name(self, nodelist):
197 listlen = len(nodelist)
200 item = self.atom_name(nodelist)
203 assert nodelist[i][0] == token.DOT
204 assert nodelist[i + 1][0] == token.NAM
[all...] |
| ast.py | 77 nodelist = []
78 nodelist.extend(flatten_nodes(self.nodes))
79 return tuple(nodelist)
109 nodelist = []
110 nodelist.extend(flatten_nodes(self.nodes))
111 return tuple(nodelist)
140 nodelist = []
141 nodelist.extend(flatten_nodes(self.nodes))
142 return tuple(nodelist)
160 nodelist = [
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/compiler/ |
| transformer.py | 179 def file_input(self, nodelist):
180 doc = self.get_docstring(nodelist, symbol.file_input)
186 for node in nodelist[i:]:
191 def eval_input(self, nodelist):
194 return Expression(self.com_node(nodelist[0]))
196 def decorator_name(self, nodelist):
197 listlen = len(nodelist)
200 item = self.atom_name(nodelist)
203 assert nodelist[i][0] == token.DOT
204 assert nodelist[i + 1][0] == token.NAM
[all...] |
| ast.py | 77 nodelist = []
78 nodelist.extend(flatten_nodes(self.nodes))
79 return tuple(nodelist)
109 nodelist = []
110 nodelist.extend(flatten_nodes(self.nodes))
111 return tuple(nodelist)
140 nodelist = []
141 nodelist.extend(flatten_nodes(self.nodes))
142 return tuple(nodelist)
160 nodelist = [
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/linalg/ |
| graphmatrix.py | 20 def incidence_matrix(G, nodelist=None, edgelist=None,
36 nodelist : list, optional (default= all nodes in G)
37 The rows are ordered according to the nodes in nodelist.
38 If nodelist is None, then the ordering is produced by G.nodes().
76 if nodelist is None:
77 nodelist = G.nodes()
83 A = np.zeros((len(nodelist),len(edgelist)))
84 node_index = dict( (node,i) for i,node in enumerate(nodelist) )
93 'but not in nodelist"%(u,v)')
110 def adjacency_matrix(G, nodelist=None, weight='weight')
[all...] |
| laplacianmatrix.py | 24 def laplacian_matrix(G, nodelist=None, weight='weight'):
35 nodelist : list, optional
36 The rows and columns are ordered according to the nodes in nodelist.
37 If nodelist is None, then the ordering is produced by G.nodes().
59 if nodelist is None:
60 nodelist = G.nodes()
63 A = np.asarray(nx.to_numpy_matrix(G,nodelist=nodelist,weight=weight))
69 n = len(nodelist)
70 index = dict( (n,i) for i,n in enumerate(nodelist) )
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/centrality/ |
| communicability_alg.py | 81 nodelist = G.nodes() # ordering of nodes in matrix
82 A = nx.to_numpy_matrix(G,nodelist)
87 sc = dict(zip(nodelist,map(float,expA.diagonal())))
153 nodelist = G.nodes() # ordering of nodes in matrix
154 A = nx.to_numpy_matrix(G,nodelist)
162 sc = dict(zip(nodelist,map(float,xg)))
242 nodelist = G.nodes() # ordering of nodes in matrix
243 n = len(nodelist)
244 A = nx.to_numpy_matrix(G,nodelist)
248 mapping = dict(zip(nodelist,range(n))
[all...] |
| katz.py | 266 nodelist = beta.keys()
267 if set(nodelist) != set(G):
272 nodelist = G.nodes()
274 b = np.ones((len(nodelist),1))*float(beta)
278 A=nx.adj_matrix(G, nodelist=nodelist)
285 centrality=dict(zip(nodelist, map(float,centrality/norm)))
|
| flow_matrix.py | 14 L = laplacian_sparse_matrix(G, nodelist=range(n), weight=weight,
130 def laplacian_sparse_matrix(G, nodelist=None, weight='weight', dtype=None,
134 A = nx.to_scipy_sparse_matrix(G, nodelist=nodelist, weight=weight,
|
| current_flow_closeness.py | 102 L = laplacian_sparse_matrix(H, nodelist=range(n), weight=weight,
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/bipartite/ |
| spectral.py | 61 nodelist = G.nodes() # ordering of nodes in matrix
62 A = nx.to_numpy_matrix(G, nodelist, weight=weight)
71 index = dict(zip(nodelist, range(len(nodelist))))
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/ |
| convert.py | 194 def to_dict_of_lists(G,nodelist=None):
202 nodelist : list
203 Use only nodes specified in nodelist
210 if nodelist is None:
211 nodelist=G
214 for n in nodelist:
215 d[n]=[nbr for nbr in G.neighbors(n) if nbr in nodelist]
256 def to_dict_of_dicts(G,nodelist=None,edge_data=None):
264 nodelist : list
265 Use only nodes specified in nodelist
[all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.build.tools/src_rss/org/eclipse/releng/generators/rss/ |
| RSSFeedUpdateEntryTask.java | 38 import org.w3c.dom.NodeList;
215 NodeList nodelist = getNodeList(document, xpath); local
216 // Process the elements in the nodelist
217 if (nodelist != null && nodelist.getLength()>0) {
218 for (int i=0; i<nodelist.getLength(); i++) {
219 Node node = (Node)nodelist.item(i);
223 aNode = (Attr)nodelist.item(i);
228 aNode = (Element)nodelist.item(i)
278 NodeList nodelist = getNodeList(document, xpath.substring(0, xpath.lastIndexOf("\/"))); local
297 NodeList nodelist = null; local
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/link_analysis/ |
| pagerank_alg.py | 149 nodelist=None, weight='weight'):
164 nodelist : list, optional
165 The rows and columns are ordered according to the nodes in nodelist.
166 If nodelist is None, then the ordering is produced by G.nodes().
187 nodelist=G.nodes()
189 nodelist=personalization.keys()
190 if set(nodelist)!=set(G):
193 M=nx.to_numpy_matrix(G,nodelist=nodelist,weight=weight)
275 nodelist=G.nodes(
[all...] |
| hits_alg.py | 122 def authority_matrix(G,nodelist=None):
124 M=nx.to_numpy_matrix(G,nodelist=nodelist)
127 def hub_matrix(G,nodelist=None):
129 M=nx.to_numpy_matrix(G,nodelist=nodelist)
269 M=nx.to_scipy_sparse_matrix(G,nodelist=G.nodes())
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/shortest_paths/ |
| dense.py | 16 def floyd_warshall_numpy(G, nodelist=None, weight='weight'):
23 nodelist : list, optional
24 The rows and columns are ordered by the nodes in nodelist.
25 If nodelist is None then the ordering is produced by G.nodes().
49 A = nx.to_numpy_matrix(G, nodelist=nodelist, multigraph_weight=min,
|
| /external/apache-xml/src/main/java/org/apache/xpath/objects/ |
| XNodeSetForDOM.java | 28 import org.w3c.dom.NodeList;
33 * Node object, NodeList object, or NodeIterator.
61 public XNodeSetForDOM(NodeList nodeList, XPathContext xctxt)
64 m_origObj = nodeList;
69 // m_obj=new org.apache.xpath.NodeSetDTM(nodeList, xctxt);
70 org.apache.xpath.NodeSetDTM nsdtm=new org.apache.xpath.NodeSetDTM(nodeList, xctxt);
101 * Cast result object to a nodelist. Always issues an error.
114 * Cast result object to a nodelist. Always issues an error.
120 public NodeList nodelist() throws javax.xml.transform.TransformerExceptio method in class:XNodeSetForDOM
[all...] |
| XNodeSet.java | 30 import org.w3c.dom.NodeList;
326 * Cast result object to a nodelist.
338 * Cast result object to a nodelist.
340 * @return a NodeList.
344 public NodeList nodelist() throws javax.xml.transform.TransformerException method in class:XNodeSet
346 org.apache.xml.dtm.ref.DTMNodeList nodelist = new org.apache.xml.dtm.ref.DTMNodeList(this); local
351 XNodeSet clone = (XNodeSet)nodelist.getDTMIterator();
353 return nodelist;
381 * Cast result object to a nodelist
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/tests/ |
| test_convert_scipy.py | 96 """Conversion from graph to sparse matrix to graph with nodelist."""
99 nodelist = P3.nodes()
100 A = nx.to_scipy_sparse_matrix(P4, nodelist=nodelist)
104 # Make nodelist ambiguous by containing duplicates.
105 nodelist += [nodelist[0]]
107 nodelist=nodelist)
178 M = nx.to_scipy_sparse_matrix(G,nodelist=[3,2,1]
[all...] |
| test_convert_numpy.py | 98 """Conversion from graph to matrix to graph with nodelist."""
101 nodelist = P3.nodes()
102 A = nx.to_numpy_matrix(P4, nodelist=nodelist)
106 # Make nodelist ambiguous by containing duplicates.
107 nodelist += [nodelist[0]]
108 assert_raises(nx.NetworkXError, nx.to_numpy_matrix, P3, nodelist=nodelist)
|
| /external/apache-xml/src/main/java/org/apache/xpath/ |
| NodeSet.java | 30 import org.w3c.dom.NodeList;
37 * NodeList, or NodeIterator. However, in order for it to
38 * act as a NodeVector or NodeList, it's required that
52 * <p>Thought: Should NodeSet really implement NodeList and NodeIterator,
60 implements NodeList, NodeIterator, Cloneable, ContextNodeList
64 * Create an empty nodelist.
85 * given nodelist into it.
87 * @param nodelist List of Nodes to be made members of the new set.
89 public NodeSet(NodeList nodelist)
[all...] |
| NodeSetDTM.java | 32 import org.w3c.dom.NodeList;
38 * NodeList, or NodeIterator. However, in order for it to
39 * act as a NodeVector or NodeList, it's required that
53 * <p>Thought: Should NodeSetDTM really implement NodeList and NodeIterator,
61 implements /* NodeList, NodeIterator, */ DTMIterator,
67 * Create an empty nodelist.
90 // * given nodelist into it.
92 // * @param nodelist List of Nodes to be made members of the new set.
94 // public NodeSetDTM(NodeList nodelist)
[all...] |
| CachedXPathAPI.java | 31 import org.w3c.dom.NodeList;
151 * Use an XPath string to select a nodelist.
167 * Use an XPath string to select a nodelist.
190 * Use an XPath string to select a nodelist.
199 public NodeList selectNodeList(Node contextNode, String str)
206 * Use an XPath string to select a nodelist.
216 public NodeList selectNodeList(
224 // Return a NodeList.
225 return list.nodelist();
233 * @return An XObject, which can be used to obtain a string, number, nodelist, etc, should never be null
[all...] |
| XPathAPI.java | 31 import org.w3c.dom.NodeList;
96 * Use an XPath string to select a nodelist.
112 * Use an XPath string to select a nodelist.
135 * Use an XPath string to select a nodelist.
144 public static NodeList selectNodeList(Node contextNode, String str)
151 * Use an XPath string to select a nodelist.
161 public static NodeList selectNodeList(
169 // Return a NodeList.
170 return list.nodelist();
178 * @return An XObject, which can be used to obtain a string, number, nodelist, etc, should never be null
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/drawing/ |
| nx_pylab.py | 159 nodelist : list, optional (default G.nodes())
167 same length as nodelist.
171 or a sequence of colors with the same length as nodelist.
266 nodelist=None,
295 nodelist : list, optional
300 same length as nodelist.
304 or a sequence of colors with the same length as nodelist.
357 if nodelist is None:
358 nodelist=G.nodes()
360 if not nodelist or len(nodelist)==0: # empty nodelist, no drawin
[all...] |
