Home
last modified time | relevance | path

Searched refs:node_in (Results 1 – 23 of 23) sorted by relevance

/dports/devel/glade/glade-3.22.1/gladeui/
H A Dglade-xml-utils.c101 xmlNodePtr node = (xmlNodePtr) node_in; in glade_xml_set_value()
124 xmlNodePtr node = (xmlNodePtr) node_in; in glade_xml_get_content()
140 xmlNodePtr node = (xmlNodePtr) node_in; in glade_xml_set_content()
182 xmlNodePtr node = (xmlNodePtr) node_in; in glade_xml_node_verify_silent()
204 xmlNodePtr node = (xmlNodePtr) node_in; in glade_xml_node_verify()
230 xmlNodePtr node = (xmlNodePtr) node_in; in glade_xml_get_value_int()
285 xmlNodePtr node = (xmlNodePtr) node_in; in glade_xml_get_value_string()
320 xmlNodePtr node = (xmlNodePtr) node_in; in glade_xml_get_boolean()
344 xmlNodePtr node = (xmlNodePtr) node_in; in glade_xml_get_property_boolean()
364 xmlNodePtr node = (xmlNodePtr) node_in; in glade_xml_get_property_double()
[all …]
H A Dglade-xml-utils.h196 void glade_xml_set_content (GladeXmlNode *node_in, const gchar *content);
212 gchar * glade_xml_get_property_string (GladeXmlNode *node_in, const gchar *name);
229 GladeXmlNode * glade_xml_node_get_parent (GladeXmlNode *node_in);
230 GladeXmlNode * glade_xml_node_next (GladeXmlNode *node_in);
231 gboolean glade_xml_node_verify (GladeXmlNode * node_in, const gchar *name);
233 const gchar * glade_xml_node_get_name (GladeXmlNode *node_in);
235 void glade_xml_node_remove (GladeXmlNode *node_in);
236 gboolean glade_xml_node_is_comment (GladeXmlNode *node_in);
237 GladeXmlNode * glade_xml_node_next_with_comments (GladeXmlNode *node_in);
238 GladeXmlNode * glade_xml_node_prev_with_comments (GladeXmlNode * node_in);
[all …]
/dports/audio/alsa-lib/alsa-lib-1.2.2/test/
H A Drawmidi.c38 char *node_in = NULL; in main() local
67 node_in = argv[++i]; in main()
86 }else if (node_in){ in main()
87 fprintf(stderr,"%s\n",node_in); in main()
107 if (node_in && (!node_out || strcmp(node_out,node_in))) { in main()
108 fd_in = open(node_in,O_RDONLY); in main()
110 fprintf(stderr,"open %s for input failed\n",node_in); in main()
122 if (node_out && (!node_in || strcmp(node_out,node_in))) { in main()
129 if (node_in && node_out && strcmp(node_out,node_in)==0) { in main()
/dports/biology/diamond/diamond-2.0.13/src/chaining/
H A Dchaining.h91 node_in() in Edge()
94 …Edge(int prefix_score, int path_max, int j, unsigned node_in, unsigned node_out, int path_min, int… in Edge()
100 node_in(node_in), in Edge()
113 unsigned node_in, node_out; member
136 for (vector<Diagonal_node>::iterator j = nodes.begin() + edge.node_in + 1; j < nodes.end(); ++j) in add_edge()
141 assert(nodes[edge.node_in].link_idx >= 0 && nodes[edge.node_in].link_idx <= (int)edges.size()); in add_edge()
142 Diagonal_node &d = nodes[edge.node_in]; in add_edge()
160 for (ptrdiff_t i = d.link_idx - 1; i >= 0 && edges[i].node_in == node; --i) in get_edge()
/dports/math/libmesh/libmesh-1.6.2/src/geom/
H A Dedge.C115 unsigned int Edge::opposite_node(const unsigned int node_in, in opposite_node() argument
118 libmesh_assert_less (node_in, 2); in opposite_node()
120 libmesh_assert(this->is_node_on_side(node_in, side_in)); in opposite_node()
122 return 1 - node_in; in opposite_node()
H A Dface_quad.C139 unsigned int Quad::opposite_node(const unsigned int node_in, in opposite_node() argument
142 libmesh_assert_less (node_in, 8); in opposite_node()
143 libmesh_assert_less (node_in, this->n_nodes()); in opposite_node()
145 libmesh_assert(this->is_node_on_side(node_in, side_in)); in opposite_node()
156 return side02_nodes_map[node_in]; in opposite_node()
159 return side13_nodes_map[node_in]; in opposite_node()
H A Dcell_hex.C181 unsigned int Hex::opposite_node(const unsigned int node_in, in opposite_node() argument
184 libmesh_assert_less (node_in, 26); in opposite_node()
185 libmesh_assert_less (node_in, this->n_nodes()); in opposite_node()
187 libmesh_assert(this->is_node_on_side(node_in, side_in)); in opposite_node()
200 return side05_nodes_map[node_in]; in opposite_node()
203 return side13_nodes_map[node_in]; in opposite_node()
206 return side24_nodes_map[node_in]; in opposite_node()
/dports/devel/pytype/pytype-2021.9.9/pytype/typegraph/
H A Dcfg_test.py870 node_in = p.NewCFGNode("node_in")
872 bx = v1.AddBinding("x", [], node_in)
873 by = v1.AddBinding("y", [], node_in)
874 bz = v1.AddBinding("z", [], node_in)
877 condition_false.AddOrigin(node_in, [bz])
880 node_if = node_in.ConnectNew("node_if", b_if)
894 node_in = p.NewCFGNode("node_in")
896 bx = v1.AddBinding("x", [], node_in)
897 by = v1.AddBinding("y", [], node_in)
898 bz = v1.AddBinding("z", [], node_in)
[all …]
/dports/math/libmesh/libmesh-1.6.2/examples/subdomains/subdomains_ex1/
H A Dsubdomains_ex1.C216 bool node_in = false; in main() local
222 node_in = true; in main()
226 if (node_in && node_out) in main()
/dports/math/libmesh/libmesh-1.6.2/src/mesh/
H A Dtetgen_io.C102 this->node_in (node_stream); in read_nodes_and_elem()
113 void TetGenIO::node_in (std::istream & node_stream) in node_in() function
/dports/textproc/py-python-augeas/python-augeas-1.0.3/augeas/
H A D__init__.py218 def text_retrieve(self, lens, node_in, path, node_out): argument
226 if not isinstance(node_in, string_types):
237 self.__handle, enc(lens), enc(node_in), enc(path), enc(node_out))
/dports/math/libmesh/libmesh-1.6.2/include/mesh/
H A Dtetgen_io.h104 void node_in (std::istream & node_stream);
/dports/math/py-pymc3/pymc-3.11.4/pymc3/variational/
H A Dopvi.py133 def try_to_set_test_value(node_in, node_out, s):
138 if not isinstance(node_in, (list, tuple)):
139 node_in = [node_in]
142 for i, o in zip(node_in, node_out):
1560 node_in = node
1567 try_to_set_test_value(node_in, node_out, size)
/dports/textproc/augeas/augeas-1.12.0/src/
H A Daugeas.h371 const char *node_in, const char *path,
H A Daugeas.c1746 const char *node_in, const char *path, in aug_text_retrieve() argument
1759 r = aug_get(aug, node_in, &src); in aug_text_retrieve()
1762 "Source node %s does not exist", node_in); in aug_text_retrieve()
1764 "Source node %s has a NULL value", node_in); in aug_text_retrieve()
H A Daugrun.c1324 const char *node_in = arg_value(cmd, "node_in"); in cmd_retrieve() local
1328 aug_text_retrieve(cmd->aug, lens, node_in, path, node_out); in cmd_retrieve()
/dports/graphics/swftools/swftools-0.9.2/lib/as3/
H A Dexpr.h79 extern nodetype_t node_in; //in
H A Dexpr.c1480 nodetype_t node_in = //in variable
H A Dparser.tab.c6324 {(yyval.node) = mknode2(&node_in, (yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node));}
/dports/math/reduce/Reduce-svn5758-src/packages/redlog/qqe/
H A Dqqeqemisc.red1210 %% procedure qqe_cpg!-make!-excl(node_in, node);
1211 %% cadr node := node_in;
1217 %% procedure qqe_cpg!-insert!-supernode(node_in,snode);
1220 %% cadr snode := node_in;
1223 %% %% cadr snode := append(cadr snode,{node_in});
1224 %% %% car snode := node_in;
1290 %% procedure qqe_cpg!-insert!-excl(node_in,node,max_border);
1293 %% prin2t {"entering qqe_cpg!-insert!-excl with node_in =",
1294 %% qqe_cpg!-var node_in, "and
1297 %% minlength_in := qqe_cpg!-minlength!-node node_in;
[all …]
/dports/math/py-networkx/networkx-2.6.3/networkx/classes/
H A Dreportviews.py280 node_in = n in self._nodes
284 if node_in is True:
285 return node_in
/dports/math/py-theano/Theano-1.0.5/theano/gof/
H A Dopt.py703 inputs_match = all(node_in is cand_in
704 for node_in, cand_in
868 inputs_match = all(node_in is cand_in
869 for node_in, cand_in in
/dports/graphics/gmt/gmt-6.3.0/src/
H A Dgmt_grdio.c2830 uint64_t node_in, node_out; in gmt_duplicate_grid() local
2834 node_in = gmt_M_ijp (G->header, row, 0); in gmt_duplicate_grid()
2836 gmt_M_memcpy (&Gnew->data[node_out], &G->data[node_in], G->header->n_columns, gmt_grdfloat); in gmt_duplicate_grid()
3470 uint64_t node_in, node_out, k, off_in = 0, off_out = 0; in gmtlib_duplicate_cube() local
3475 node_in = gmt_M_ijp (U->header, row, 0) + off_in; in gmtlib_duplicate_cube()
3477 gmt_M_memcpy (&Unew->data[node_out], &U->data[node_in], U->header->n_columns, gmt_grdfloat); in gmtlib_duplicate_cube()