Home
last modified time | relevance | path

Searched refs:i_node (Results 26 – 50 of 282) sorted by relevance

12345678910>>...12

/dports/sysutils/eclat/eclat-2.0/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;
H A Ddhcpd-lex.l186 ino_t i_node;
195 static ino_t i_node;
210 return !(ac->i_node == bc->i_node && ac->i_dev == bc->i_dev);
214 _push_context(const char *name, ino_t i_node, dev_t i_dev, grecs_locus_t *loc)
224 ctx.i_node = i_node;
235 pctx->i_node = i_node;
265 i_node = pctx->i_node;
329 i_node = st.st_ino;
/dports/math/polymake/polymake-4.5/apps/polytope/src/
H A Dflag_vector.cc47 for (const auto i_node : F.nodes_of_rank(i+1)) in assign_facet_through_points()
49 for (const auto btw_node : F.out_adjacent_nodes(i_node)) in assign_facet_through_points()
50 G.out_adjacent_nodes(i_node) += F.out_adjacent_nodes(btw_node); in assign_facet_through_points()
56 for (const auto i_node : F.nodes_of_rank(i+1)) { in assign_facet_through_points()
57 for (const auto down_node : F.in_adjacent_nodes(i_node)) in assign_facet_through_points()
58 G.out_adjacent_nodes(down_node) += G.out_adjacent_nodes(i_node); in assign_facet_through_points()
59 G.out_edges(i_node).clear(); in assign_facet_through_points()
/dports/net/gnu-dico/dico-2.10/grecs/src/
H A Ddhcpd-lex.l186 ino_t i_node;
195 static ino_t i_node;
210 return !(ac->i_node == bc->i_node && ac->i_dev == bc->i_dev);
214 _push_context(const char *name, ino_t i_node, dev_t i_dev, grecs_locus_t *loc)
224 ctx.i_node = i_node;
235 pctx->i_node = i_node;
265 i_node = pctx->i_node;
329 i_node = st.st_ino;
/dports/sysutils/direvent/direvent-5.2/grecs/src/
H A Ddhcpd-lex.l186 ino_t i_node;
195 static ino_t i_node;
210 return !(ac->i_node == bc->i_node && ac->i_dev == bc->i_dev);
214 _push_context(const char *name, ino_t i_node, dev_t i_dev, grecs_locus_t *loc)
224 ctx.i_node = i_node;
235 pctx->i_node = i_node;
265 i_node = pctx->i_node;
329 i_node = st.st_ino;
/dports/sysutils/pies/pies-1.5/grecs/src/
H A Ddhcpd-lex.l186 ino_t i_node;
195 static ino_t i_node;
210 return !(ac->i_node == bc->i_node && ac->i_dev == bc->i_dev);
214 _push_context(const char *name, ino_t i_node, dev_t i_dev, grecs_locus_t *loc)
224 ctx.i_node = i_node;
235 pctx->i_node = i_node;
265 i_node = pctx->i_node;
329 i_node = st.st_ino;
/dports/devel/cdecl/cdecl-cdecl-11.9/src/
H A Dslist.c73 slist_node_t const *i_node = i_list->head, *j_node = j_list->head; in slist_cmp() local
76 for ( ; i_node != NULL && j_node != NULL; in slist_cmp()
77 i_node = i_node->next, j_node = j_node->next ) { in slist_cmp()
79 REINTERPRET_CAST( intptr_t, i_node->data ) - in slist_cmp()
87 for ( ; i_node != NULL && j_node != NULL; in slist_cmp()
88 i_node = i_node->next, j_node = j_node->next ) { in slist_cmp()
89 int const cmp = (*cmp_fn)( i_node->data, j_node->data ); in slist_cmp()
95 return i_node == NULL ? (j_node == NULL ? 0 : -1) : 1; in slist_cmp()
/dports/science/py-mdp/MDP-3.5/bimdp/hinet/
H A Dbilayer.py120 for i_node, node in enumerate(self.nodes):
122 node_x = x[:, node_dim*i_node : node_dim*(i_node+1)]
125 node_msg = node_msgs[i_node]
170 for i_node, node in enumerate(self.nodes):
172 node_x = x[:, node_dim*i_node : node_dim*(i_node+1)]
175 node_msg = node_msgs[i_node]
219 for i_node, node in enumerate(self.nodes):
220 node_msg = node_msgs[i_node]
/dports/science/afni/afni-AFNI_21.3.16/src/pkundu/meica.libs/mdp/parallel/
H A Dparallelhinet.py36 for i_node, node in enumerate(forked_node._flow):
39 self._flow[i_node].join(node)
41 self._flow[i_node].join(node)
62 for i_node, layer_node in enumerate(self.nodes):
64 layer_node.join(forked_node.nodes[i_node])
/dports/science/py-mdp/MDP-3.5/mdp/parallel/
H A Dparallelhinet.py36 for i_node, node in enumerate(forked_node._flow):
39 self._flow[i_node].join(node)
41 self._flow[i_node].join(node)
62 for i_node, layer_node in enumerate(self.nodes):
64 layer_node.join(forked_node.nodes[i_node])
/dports/science/py-mdp/MDP-3.5/bimdp/inspection/
H A Dslideshow.py191 for i_node in range(n_nodes):
192 for i_phase in range(len(index_table[i_node])):
193 end_index = index_table[i_node][i_phase][0]
204 end_index = index_table[i_node][i_phase][1]
213 train_table[i_phase+1][i_node+1] = html_string
/dports/science/mbdyn/mbdyn-1.7.3/libraries/libmbmath/
H A DMLS.cc269 for (unsigned i_node = 0; i_node < k ; i_node++) { in Interpolate_Adj() local
270 idx[i_node*(Nadj+1)] = idx_temp[i_node]*(Nadj+1); in Interpolate_Adj()
271 dist[i_node*(Nadj+1)] = dist_temp[i_node]; in Interpolate_Adj()
278 adj[d] = data_temp[idx_temp[i_node]][d]+it_adj->dGet(d+1); in Interpolate_Adj()
281 idx[i_node*(Nadj+1)+count_a] = idx_temp[i_node]*(Nadj+1)+count_a; in Interpolate_Adj()
282 dist[i_node*(Nadj+1)+count_a] = dist_adj; in Interpolate_Adj()
/dports/lang/yap/yap-6.2.2/library/rltree/
H A Drange_list.c118 buf_ptr[0].i_node.num_subnodes=1; in new_rl()
121 buf_ptr->i_node.num_subnodes=1; in new_rl()
374 …node_ptr->i_node.quadrant_1=node_ptr->i_node.quadrant_2=node_ptr->i_node.quadrant_3=node_ptr->i_no… in new_node()
627 node->i_node.quadrant_1=status; in set_quadrant()
630 node->i_node.quadrant_2=status; in set_quadrant()
633 node->i_node.quadrant_3=status; in set_quadrant()
636 node->i_node.quadrant_4=status; in set_quadrant()
649 return node->i_node.quadrant_1; in quadrant_status()
651 return node->i_node.quadrant_2; in quadrant_status()
653 return node->i_node.quadrant_3; in quadrant_status()
[all …]
/dports/science/py-scikit-learn/scikit-learn-1.0.2/sklearn/neighbors/
H A D_binary_tree.pxi995 i_node=0,
1746 i1 = 2 * i_node + 1
1769 cdef ITYPE_t i, i_node
1783 i_node = nodeheap_item.i1
1807 for i in range(2 * i_node + 1, 2 * i_node + 3):
2135 i_node = nodeheap_item.i1
2181 i1 = 2 * i_node + 1
2182 i2 = 2 * i_node + 2
2317 i1 = 2 * i_node + 1
2318 i2 = 2 * i_node + 2
[all …]
/dports/lang/gcc8/gcc-8.5.0/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Derase_fn_imps.hpp47 if (p_nd == 0 || p_nd->m_type == i_node) in erase()
79 _GLIBCXX_DEBUG_ASSERT(p_parent->m_type == i_node); in erase_fixup()
94 _GLIBCXX_DEBUG_ASSERT(p_parent->m_type == i_node); in erase_fixup()
107 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_parent->m_type == i_node); in erase_fixup()
145 if (p_nd->m_type == i_node) in clear_imp()
147 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == i_node); in clear_imp()
280 _GLIBCXX_DEBUG_ASSERT(p_l->m_p_parent->m_type == i_node); in erase_leaf()
/dports/lang/gcc48/gcc-4.8.5/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Derase_fn_imps.hpp47 if (p_nd == 0 || p_nd->m_type == i_node) in erase()
79 _GLIBCXX_DEBUG_ASSERT(p_parent->m_type == i_node); in erase_fixup()
94 _GLIBCXX_DEBUG_ASSERT(p_parent->m_type == i_node); in erase_fixup()
107 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_parent->m_type == i_node); in erase_fixup()
145 if (p_nd->m_type == i_node) in clear_imp()
147 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == i_node); in clear_imp()
280 _GLIBCXX_DEBUG_ASSERT(p_l->m_p_parent->m_type == i_node); in erase_leaf()
/dports/lang/gcc6-aux/bootstrap/include/c++/5.1.0/ext/pb_ds/detail/pat_trie_/
H A Derase_fn_imps.hpp47 if (p_nd == 0 || p_nd->m_type == i_node) in erase()
79 _GLIBCXX_DEBUG_ASSERT(p_parent->m_type == i_node); in erase_fixup()
94 _GLIBCXX_DEBUG_ASSERT(p_parent->m_type == i_node); in erase_fixup()
107 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_parent->m_type == i_node); in erase_fixup()
145 if (p_nd->m_type == i_node) in clear_imp()
147 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == i_node); in clear_imp()
280 _GLIBCXX_DEBUG_ASSERT(p_l->m_p_parent->m_type == i_node); in erase_leaf()
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Derase_fn_imps.hpp47 if (p_nd == 0 || p_nd->m_type == i_node) in erase()
79 _GLIBCXX_DEBUG_ASSERT(p_parent->m_type == i_node); in erase_fixup()
94 _GLIBCXX_DEBUG_ASSERT(p_parent->m_type == i_node); in erase_fixup()
107 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_parent->m_type == i_node); in erase_fixup()
145 if (p_nd->m_type == i_node) in clear_imp()
147 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == i_node); in clear_imp()
280 _GLIBCXX_DEBUG_ASSERT(p_l->m_p_parent->m_type == i_node); in erase_leaf()
/dports/lang/gcc9-devel/gcc-9-20211007/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Derase_fn_imps.hpp47 if (p_nd == 0 || p_nd->m_type == i_node) in erase()
79 _GLIBCXX_DEBUG_ASSERT(p_parent->m_type == i_node); in erase_fixup()
94 _GLIBCXX_DEBUG_ASSERT(p_parent->m_type == i_node); in erase_fixup()
107 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_parent->m_type == i_node); in erase_fixup()
145 if (p_nd->m_type == i_node) in clear_imp()
147 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == i_node); in clear_imp()
280 _GLIBCXX_DEBUG_ASSERT(p_l->m_p_parent->m_type == i_node); in erase_leaf()
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Derase_fn_imps.hpp47 if (p_nd == 0 || p_nd->m_type == i_node) in erase()
79 _GLIBCXX_DEBUG_ASSERT(p_parent->m_type == i_node); in erase_fixup()
94 _GLIBCXX_DEBUG_ASSERT(p_parent->m_type == i_node); in erase_fixup()
107 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_parent->m_type == i_node); in erase_fixup()
145 if (p_nd->m_type == i_node) in clear_imp()
147 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == i_node); in clear_imp()
280 _GLIBCXX_DEBUG_ASSERT(p_l->m_p_parent->m_type == i_node); in erase_leaf()
/dports/lang/gnat_util/gcc-6-20180516/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Derase_fn_imps.hpp47 if (p_nd == 0 || p_nd->m_type == i_node) in erase()
79 _GLIBCXX_DEBUG_ASSERT(p_parent->m_type == i_node); in erase_fixup()
94 _GLIBCXX_DEBUG_ASSERT(p_parent->m_type == i_node); in erase_fixup()
107 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_parent->m_type == i_node); in erase_fixup()
145 if (p_nd->m_type == i_node) in clear_imp()
147 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == i_node); in clear_imp()
280 _GLIBCXX_DEBUG_ASSERT(p_l->m_p_parent->m_type == i_node); in erase_leaf()
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Derase_fn_imps.hpp47 if (p_nd == 0 || p_nd->m_type == i_node) in erase()
79 _GLIBCXX_DEBUG_ASSERT(p_parent->m_type == i_node); in erase_fixup()
94 _GLIBCXX_DEBUG_ASSERT(p_parent->m_type == i_node); in erase_fixup()
107 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_parent->m_type == i_node); in erase_fixup()
145 if (p_nd->m_type == i_node) in clear_imp()
147 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == i_node); in clear_imp()
280 _GLIBCXX_DEBUG_ASSERT(p_l->m_p_parent->m_type == i_node); in erase_leaf()
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Derase_fn_imps.hpp47 if (p_nd == 0 || p_nd->m_type == i_node) in erase()
79 _GLIBCXX_DEBUG_ASSERT(p_parent->m_type == i_node); in erase_fixup()
94 _GLIBCXX_DEBUG_ASSERT(p_parent->m_type == i_node); in erase_fixup()
107 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_parent->m_type == i_node); in erase_fixup()
145 if (p_nd->m_type == i_node) in clear_imp()
147 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == i_node); in clear_imp()
280 _GLIBCXX_DEBUG_ASSERT(p_l->m_p_parent->m_type == i_node); in erase_leaf()
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Derase_fn_imps.hpp47 if (p_nd == 0 || p_nd->m_type == i_node) in erase()
79 _GLIBCXX_DEBUG_ASSERT(p_parent->m_type == i_node); in erase_fixup()
94 _GLIBCXX_DEBUG_ASSERT(p_parent->m_type == i_node); in erase_fixup()
107 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_parent->m_type == i_node); in erase_fixup()
145 if (p_nd->m_type == i_node) in clear_imp()
147 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == i_node); in clear_imp()
280 _GLIBCXX_DEBUG_ASSERT(p_l->m_p_parent->m_type == i_node); in erase_leaf()
/dports/lang/gcc6-aux/gcc-6-20180516/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Derase_fn_imps.hpp47 if (p_nd == 0 || p_nd->m_type == i_node) in erase()
79 _GLIBCXX_DEBUG_ASSERT(p_parent->m_type == i_node); in erase_fixup()
94 _GLIBCXX_DEBUG_ASSERT(p_parent->m_type == i_node); in erase_fixup()
107 _GLIBCXX_DEBUG_ASSERT(p_nd->m_p_parent->m_type == i_node); in erase_fixup()
145 if (p_nd->m_type == i_node) in clear_imp()
147 _GLIBCXX_DEBUG_ASSERT(p_nd->m_type == i_node); in clear_imp()
280 _GLIBCXX_DEBUG_ASSERT(p_l->m_p_parent->m_type == i_node); in erase_leaf()

12345678910>>...12