Home
last modified time | relevance | path

Searched refs:i_node (Results 1 – 25 of 282) sorted by relevance

12345678910>>...12

/dports/science/py-mdp/MDP-3.5/bimdp/hinet/
H A Dbiflownode.py95 for i_node, node in enumerate(self._flow):
125 result = self._flow._execute_seq(x, msg, i_node=i_node,
160 i_node = i_node + target
162 if i_node == len(self._flow):
167 elif i_node == -1:
170 i_node = self._flow._target_to_index(target, i_node)
209 i_node = nodenr + target
211 if i_node == len(self._flow):
213 elif i_node == -1:
217 if not isinstance(i_node, int):
[all …]
/dports/science/py-mdp/MDP-3.5/bimdp/
H A Dbiflow.py139 (i_node, str(self.flow[i_node])))
140 self._train_node(data_iterables[i_node], i_node,
141 msg_iterables[i_node], stop_messages[i_node])
180 i_node = 0
182 result = self._execute_seq(x, msg, i_node=i_node,
276 result = self._execute_seq(x, msg, i_node=i_node)
318 result = self._execute_seq(x=x, msg=msg, i_node=i_node)
552 i_node = i_node + target
562 i_node = self._target_to_index(target, i_node)
605 (i_node, str(self.flow[i_node])))
[all …]
/dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/
H A Dminimum_degree_ordering.hpp413 vertex_t i_node = *i; in eliminate() local
414 if (!marker.is_tagged(i_node) && !numbering.is_numbered(i_node)) { in eliminate()
415 marker.mark_tagged(i_node); in eliminate()
416 add_edge(node, i_node, G); in eliminate()
460 vertex_t i_node = *i; in update() local
463 deg0 += supernode_size[i_node]; in update()
495 const vertex_t i_node = *i; in update() local
496 if (i_node == u_node || supernode_size[i_node] == 0) in update()
540 vertex_t i_node = *i; in update() local
541 if (marker.is_tagged(i_node)) in update()
[all …]
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/
H A Dminimum_degree_ordering.hpp413 vertex_t i_node = *i; in eliminate() local
414 if (!marker.is_tagged(i_node) && !numbering.is_numbered(i_node)) { in eliminate()
415 marker.mark_tagged(i_node); in eliminate()
416 add_edge(node, i_node, G); in eliminate()
460 vertex_t i_node = *i; in update() local
463 deg0 += supernode_size[i_node]; in update()
495 const vertex_t i_node = *i; in update() local
496 if (i_node == u_node || supernode_size[i_node] == 0) in update()
540 vertex_t i_node = *i; in update() local
541 if (marker.is_tagged(i_node)) in update()
[all …]
/dports/databases/xtrabackup/boost_1_59_0/boost/graph/
H A Dminimum_degree_ordering.hpp413 vertex_t i_node = *i; in eliminate() local
414 if (!marker.is_tagged(i_node) && !numbering.is_numbered(i_node)) { in eliminate()
415 marker.mark_tagged(i_node); in eliminate()
416 add_edge(node, i_node, G); in eliminate()
460 vertex_t i_node = *i; in update() local
463 deg0 += supernode_size[i_node]; in update()
495 const vertex_t i_node = *i; in update() local
496 if (i_node == u_node || supernode_size[i_node] == 0) in update()
540 vertex_t i_node = *i; in update() local
541 if (marker.is_tagged(i_node)) in update()
[all …]
/dports/databases/percona57-server/boost_1_59_0/boost/graph/
H A Dminimum_degree_ordering.hpp413 vertex_t i_node = *i; in eliminate() local
414 if (!marker.is_tagged(i_node) && !numbering.is_numbered(i_node)) { in eliminate()
415 marker.mark_tagged(i_node); in eliminate()
416 add_edge(node, i_node, G); in eliminate()
460 vertex_t i_node = *i; in update() local
463 deg0 += supernode_size[i_node]; in update()
495 const vertex_t i_node = *i; in update() local
496 if (i_node == u_node || supernode_size[i_node] == 0) in update()
540 vertex_t i_node = *i; in update() local
541 if (marker.is_tagged(i_node)) in update()
[all …]
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/
H A Dminimum_degree_ordering.hpp413 vertex_t i_node = *i; in eliminate() local
414 if (!marker.is_tagged(i_node) && !numbering.is_numbered(i_node)) { in eliminate()
415 marker.mark_tagged(i_node); in eliminate()
416 add_edge(node, i_node, G); in eliminate()
460 vertex_t i_node = *i; in update() local
463 deg0 += supernode_size[i_node]; in update()
495 const vertex_t i_node = *i; in update() local
496 if (i_node == u_node || supernode_size[i_node] == 0) in update()
540 vertex_t i_node = *i; in update() local
541 if (marker.is_tagged(i_node)) in update()
[all …]
/dports/databases/percona57-client/boost_1_59_0/boost/graph/
H A Dminimum_degree_ordering.hpp413 vertex_t i_node = *i; in eliminate() local
414 if (!marker.is_tagged(i_node) && !numbering.is_numbered(i_node)) { in eliminate()
415 marker.mark_tagged(i_node); in eliminate()
416 add_edge(node, i_node, G); in eliminate()
460 vertex_t i_node = *i; in update() local
463 deg0 += supernode_size[i_node]; in update()
495 const vertex_t i_node = *i; in update() local
496 if (i_node == u_node || supernode_size[i_node] == 0) in update()
540 vertex_t i_node = *i; in update() local
541 if (marker.is_tagged(i_node)) in update()
[all …]
/dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/graph/
H A Dminimum_degree_ordering.hpp413 vertex_t i_node = *i; in eliminate() local
414 if (!marker.is_tagged(i_node) && !numbering.is_numbered(i_node)) { in eliminate()
415 marker.mark_tagged(i_node); in eliminate()
416 add_edge(node, i_node, G); in eliminate()
460 vertex_t i_node = *i; in update() local
463 deg0 += supernode_size[i_node]; in update()
495 const vertex_t i_node = *i; in update() local
496 if (i_node == u_node || supernode_size[i_node] == 0) in update()
540 vertex_t i_node = *i; in update() local
541 if (marker.is_tagged(i_node)) in update()
[all …]
/dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/graph/
H A Dminimum_degree_ordering.hpp413 vertex_t i_node = *i; in eliminate() local
414 if (!marker.is_tagged(i_node) && !numbering.is_numbered(i_node)) { in eliminate()
415 marker.mark_tagged(i_node); in eliminate()
416 add_edge(node, i_node, G); in eliminate()
460 vertex_t i_node = *i; in update() local
463 deg0 += supernode_size[i_node]; in update()
495 const vertex_t i_node = *i; in update() local
496 if (i_node == u_node || supernode_size[i_node] == 0) in update()
540 vertex_t i_node = *i; in update() local
541 if (marker.is_tagged(i_node)) in update()
[all …]
/dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/graph/
H A Dminimum_degree_ordering.hpp413 vertex_t i_node = *i; in parent()
414 if (!marker.is_tagged(i_node) && !numbering.is_numbered(i_node)) { in parent()
415 marker.mark_tagged(i_node); in parent()
416 add_edge(node, i_node, G); in parent()
460 vertex_t i_node = *i;
463 deg0 += supernode_size[i_node];
495 const vertex_t i_node = *i;
496 if (i_node == u_node || supernode_size[i_node] == 0)
540 vertex_t i_node = *i;
541 if (marker.is_tagged(i_node))
[all …]
/dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/graph/
H A Dminimum_degree_ordering.hpp413 vertex_t i_node = *i; in eliminate() local
414 if (!marker.is_tagged(i_node) && !numbering.is_numbered(i_node)) { in eliminate()
415 marker.mark_tagged(i_node); in eliminate()
416 add_edge(node, i_node, G); in eliminate()
460 vertex_t i_node = *i; in update() local
463 deg0 += supernode_size[i_node]; in update()
495 const vertex_t i_node = *i; in update() local
496 if (i_node == u_node || supernode_size[i_node] == 0) in update()
540 vertex_t i_node = *i; in update() local
541 if (marker.is_tagged(i_node)) in update()
[all …]
/dports/biology/lamarc/lamarc-2.1.8/boost/graph/
H A Dminimum_degree_ordering.hpp413 vertex_t i_node = *i; in eliminate() local
414 if (!marker.is_tagged(i_node) && !numbering.is_numbered(i_node)) { in eliminate()
415 marker.mark_tagged(i_node); in eliminate()
416 add_edge(node, i_node, G); in eliminate()
460 vertex_t i_node = *i; in update() local
463 deg0 += supernode_size[i_node]; in update()
495 const vertex_t i_node = *i; in update() local
496 if (i_node == u_node || supernode_size[i_node] == 0) in update()
540 vertex_t i_node = *i; in update() local
541 if (marker.is_tagged(i_node)) in update()
[all …]
/dports/science/py-scikit-learn/scikit-learn-1.0.2/sklearn/neighbors/
H A D_kd_tree.pyx75 node_data[i_node].idx_start = idx_start
76 node_data[i_node].idx_end = idx_end
85 cdef DTYPE_t min_rdist(BinaryTree tree, ITYPE_t i_node, argument
94 d_lo = tree.node_bounds[0, i_node, j] - pt[j]
95 d_hi = pt[j] - tree.node_bounds[1, i_node, j]
101 d_lo = tree.node_bounds[0, i_node, j] - pt[j]
102 d_hi = pt[j] - tree.node_bounds[1, i_node, j]
112 return min_rdist(tree, i_node, pt)
141 return max_rdist(tree, i_node, pt)
159 d_lo = tree.node_bounds[0, i_node, j] - pt[j]
[all …]
H A D_ball_tree.pyx58 cdef DTYPE_t* centroid = &tree.node_bounds[0, i_node, 0]
98 node_data[i_node].idx_start = idx_start
99 node_data[i_node].idx_end = idx_end
103 cdef inline DTYPE_t min_dist(BinaryTree tree, ITYPE_t i_node, argument
108 return fmax(0, dist_pt - tree.node_data[i_node].radius)
111 cdef inline DTYPE_t max_dist(BinaryTree tree, ITYPE_t i_node, argument
116 return dist_pt + tree.node_data[i_node].radius
124 cdef DTYPE_t rad = tree.node_data[i_node].radius
130 cdef inline DTYPE_t min_rdist(BinaryTree tree, ITYPE_t i_node, argument
134 return euclidean_dist_to_rdist(min_dist(tree, i_node, pt))
[all …]
/dports/devel/boost-docs/boost_1_72_0/boost/graph/
H A Dminimum_degree_ordering.hpp422 vertex_t i_node = *i; in eliminate() local
423 if (!marker.is_tagged(i_node) && !numbering.is_numbered(i_node)) { in eliminate()
424 marker.mark_tagged(i_node); in eliminate()
425 add_edge(node, i_node, G); in eliminate()
469 vertex_t i_node = *i; in update() local
472 deg0 += supernode_size[i_node]; in update()
504 const vertex_t i_node = *i; in update() local
505 if (i_node == u_node || supernode_size[i_node] == 0) in update()
549 vertex_t i_node = *i; in update() local
550 if (marker.is_tagged(i_node)) in update()
[all …]
/dports/devel/R-cran-BH/BH/inst/include/boost/graph/
H A Dminimum_degree_ordering.hpp487 vertex_t i_node = *i; in eliminate() local
488 if (!marker.is_tagged(i_node) in eliminate()
491 marker.mark_tagged(i_node); in eliminate()
492 add_edge(node, i_node, G); in eliminate()
542 vertex_t i_node = *i; in update() local
544 if (supernode_size[i_node] != 0) in update()
546 deg0 += supernode_size[i_node]; in update()
585 if (i_node == u_node || supernode_size[i_node] == 0) in update()
642 vertex_t i_node = *i; in update() local
643 if (marker.is_tagged(i_node)) in update()
[all …]
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/
H A Dminimum_degree_ordering.hpp487 vertex_t i_node = *i; in eliminate() local
488 if (!marker.is_tagged(i_node) in eliminate()
491 marker.mark_tagged(i_node); in eliminate()
492 add_edge(node, i_node, G); in eliminate()
542 vertex_t i_node = *i; in update() local
544 if (supernode_size[i_node] != 0) in update()
546 deg0 += supernode_size[i_node]; in update()
585 if (i_node == u_node || supernode_size[i_node] == 0) in update()
642 vertex_t i_node = *i; in update() local
643 if (marker.is_tagged(i_node)) in update()
[all …]
/dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/
H A Dminimum_degree_ordering.hpp487 vertex_t i_node = *i; in eliminate() local
488 if (!marker.is_tagged(i_node) in eliminate()
491 marker.mark_tagged(i_node); in eliminate()
492 add_edge(node, i_node, G); in eliminate()
542 vertex_t i_node = *i; in update() local
544 if (supernode_size[i_node] != 0) in update()
546 deg0 += supernode_size[i_node]; in update()
585 if (i_node == u_node || supernode_size[i_node] == 0) in update()
642 vertex_t i_node = *i; in update() local
643 if (marker.is_tagged(i_node)) in update()
[all …]
/dports/devel/boost-libs/boost_1_72_0/boost/graph/
H A Dminimum_degree_ordering.hpp422 vertex_t i_node = *i; in eliminate() local
423 if (!marker.is_tagged(i_node) && !numbering.is_numbered(i_node)) { in eliminate()
424 marker.mark_tagged(i_node); in eliminate()
425 add_edge(node, i_node, G); in eliminate()
469 vertex_t i_node = *i; in update() local
472 deg0 += supernode_size[i_node]; in update()
504 const vertex_t i_node = *i; in update() local
505 if (i_node == u_node || supernode_size[i_node] == 0) in update()
549 vertex_t i_node = *i; in update() local
550 if (marker.is_tagged(i_node)) in update()
[all …]
/dports/devel/boost-python-libs/boost_1_72_0/boost/graph/
H A Dminimum_degree_ordering.hpp422 vertex_t i_node = *i; in eliminate() local
423 if (!marker.is_tagged(i_node) && !numbering.is_numbered(i_node)) { in eliminate()
424 marker.mark_tagged(i_node); in eliminate()
425 add_edge(node, i_node, G); in eliminate()
469 vertex_t i_node = *i; in update() local
472 deg0 += supernode_size[i_node]; in update()
504 const vertex_t i_node = *i; in update() local
505 if (i_node == u_node || supernode_size[i_node] == 0) in update()
549 vertex_t i_node = *i; in update() local
550 if (marker.is_tagged(i_node)) in update()
[all …]
/dports/devel/hyperscan/boost_1_75_0/boost/graph/
H A Dminimum_degree_ordering.hpp487 vertex_t i_node = *i; in eliminate() local
488 if (!marker.is_tagged(i_node) in eliminate()
491 marker.mark_tagged(i_node); in eliminate()
492 add_edge(node, i_node, G); in eliminate()
542 vertex_t i_node = *i; in update() local
544 if (supernode_size[i_node] != 0) in update()
546 deg0 += supernode_size[i_node]; in update()
585 if (i_node == u_node || supernode_size[i_node] == 0) in update()
642 vertex_t i_node = *i; in update() local
643 if (marker.is_tagged(i_node)) in update()
[all …]
/dports/net/gnu-dico/dico-2.10/grecs/src/
H A Dbind-lex.l124 ino_t i_node;
133 static ino_t i_node;
148 return !(ac->i_node == bc->i_node && ac->i_dev == bc->i_dev);
152 _push_context(const char *name, ino_t i_node, dev_t i_dev, grecs_locus_t *loc)
162 ctx.i_node = i_node;
173 pctx->i_node = i_node;
203 i_node = pctx->i_node;
267 i_node = st.st_ino;
/dports/sysutils/direvent/direvent-5.2/grecs/src/
H A Dbind-lex.l124 ino_t i_node;
133 static ino_t i_node;
148 return !(ac->i_node == bc->i_node && ac->i_dev == bc->i_dev);
152 _push_context(const char *name, ino_t i_node, dev_t i_dev, grecs_locus_t *loc)
162 ctx.i_node = i_node;
173 pctx->i_node = i_node;
203 i_node = pctx->i_node;
267 i_node = st.st_ino;
/dports/sysutils/pies/pies-1.5/grecs/src/
H A Dbind-lex.l124 ino_t i_node;
133 static ino_t i_node;
148 return !(ac->i_node == bc->i_node && ac->i_dev == bc->i_dev);
152 _push_context(const char *name, ino_t i_node, dev_t i_dev, grecs_locus_t *loc)
162 ctx.i_node = i_node;
173 pctx->i_node = i_node;
203 i_node = pctx->i_node;
267 i_node = st.st_ino;

12345678910>>...12