| /dports/net-mgmt/p5-SNMP-Info/SNMP-Info-3.81/lib/SNMP/Info/Layer3/ |
| H A D | Tasman.pm | 177 sub e_index { subroutine
184 my %e_index;
194 return \%e_index;
200 my $e_index = $tasman->e_index() || {};
203 foreach my $iid ( keys %$e_index ) {
205 my $index = $e_index->{$iid};
220 my $e_index = $tasman->e_index() || {};
244 my $e_index = $tasman->e_index() || {};
257 my $e_index = $tasman->e_index() || {};
269 my $e_index = $tasman->e_index() || {};
[all …]
|
| H A D | Juniper.pm | 408 sub e_index { subroutine
417 my %e_index;
420 $e_index{$key} = $virtuals->{$key};
432 return \%e_index;
438 my $e_index = $juniper->e_index() || {};
444 foreach my $iid ( keys %$e_index ) {
478 my $e_index = $juniper->e_index() || {};
512 my $e_index = $juniper->e_index() || {};
540 my $e_index = $juniper->e_index() || {};
559 my $e_index = $juniper->e_index() || {};
[all …]
|
| /dports/science/mpqc/mpqc-2.3.1/src/lib/math/isosurf/ |
| H A D | surfor.cc | 54 int e_index = _edge_to_index[e]; in fix_orientation() local
55 if (edge_to_triangle0[e_index].null()) { in fix_orientation()
56 edge_to_triangle0[e_index] = tri; in fix_orientation()
58 else if (edge_to_triangle1[e_index].null()) { in fix_orientation()
59 edge_to_triangle1[e_index] = tri; in fix_orientation()
85 int e_index = _edge_to_index[e]; in fix_orientation() local
87 if (edge_to_triangle0[e_index] == tri) { in fix_orientation()
88 othertri = edge_to_triangle1[e_index]; in fix_orientation()
91 othertri = edge_to_triangle0[e_index]; in fix_orientation()
|
| /dports/net-mgmt/netdisco/App-Netdisco-2.047002/lib/App/Netdisco/Worker/Plugin/Discover/ |
| H A D | Entities.pm | 50 my $e_index = $snmp->e_index;
52 if (!defined $e_index) {
74 foreach my $entry (keys %$e_index) {
75 next unless defined $e_index->{$entry};
76 next if $seen_idx{ $e_index->{$entry} }++;
78 if ($e_index->{$entry} !~ m/^[0-9]+$/) {
80 $device->ip, $e_index->{$entry};
85 index => $e_index->{$entry},
|
| /dports/math/ogdf/OGDF/src/ogdf/energybased/fast_multipole_embedder/ |
| H A D | EdgeChain.cpp | 40 int e_index) in pushBackEdge() argument
48 if (index == a_e.a) { a_e.a_next = e_index; } in pushBackEdge()
49 else { a_e.b_next = e_index; } in pushBackEdge()
52 info.firstEntry = e_index; in pushBackEdge()
55 info.lastEntry = e_index; in pushBackEdge()
64 EdgeAdjInfo& e = edgeInform(e_index); in pushBackEdge()
|
| /dports/science/ghmm/ghmm-0.9-rc3/ghmm/ |
| H A D | reestimate.c | 433 int e_index; in reestimate_one_step() local
485 if (e_index != -1) { in reestimate_one_step()
498 if (e_index != -1) in reestimate_one_step()
508 if (e_index != -1) { in reestimate_one_step()
558 int i, t, k, e_index, len; in reestimate_one_step_lean() local
611 if (e_index != -1){ in reestimate_one_step_lean()
652 * mo->s[j_id].b[e_index]; in reestimate_one_step_lean()
905 int e_index, T_k, valid=0; in reestimate_one_step_label() local
959 if (e_index != -1) { in reestimate_one_step_label()
974 if (e_index != -1) in reestimate_one_step_label()
[all …]
|
| H A D | foba.c | 142 int e_index; in ghmm_dmodel_forward() local
172 if (e_index != -1) { in ghmm_dmodel_forward()
282 int e_index; in ghmm_dmodel_backward() local
333 if (e_index != -1) { in ghmm_dmodel_backward()
363 if (e_index != -1) in ghmm_dmodel_backward()
553 int i, t, id, e_index; in ghmm_dmodel_forward_lean() local
588 if (e_index != -1) { in ghmm_dmodel_forward_lean()
711 int e_index; in ghmm_dmodel_label_forward() local
842 int e_index; in ghmm_dmodel_label_backward() local
891 if (e_index != -1) in ghmm_dmodel_label_backward()
[all …]
|
| /dports/textproc/rasqal/rasqal-0.9.33/src/ |
| H A D | rasqal_xsd_datatypes.c | 414 unsigned int e_index = 0; in rasqal_xsd_format_double() local
431 for( ; buf[e_index]; ++e_index) { in rasqal_xsd_format_double()
432 if(e_index > 0 && buf[e_index] == '0' && buf[e_index - 1] != '0') { in rasqal_xsd_format_double()
433 trailing_zero_start = e_index; in rasqal_xsd_format_double()
437 else if(buf[e_index] == 'E') in rasqal_xsd_format_double()
447 if(buf[e_index + 1] == '-') { in rasqal_xsd_format_double()
452 buf[e_index] = 'E'; in rasqal_xsd_format_double()
453 trailing_zero_start = e_index + 1; in rasqal_xsd_format_double()
457 exponent_start = e_index + 2; in rasqal_xsd_format_double()
|
| /dports/devel/boost-docs/boost_1_72_0/libs/graph/example/ |
| H A D | grid_graph_example.cpp | 44 for (Traits::edges_size_type e_index = 0; in main() local
45 e_index < num_edges(graph); ++e_index) { in main()
48 std::cout << "Index of edge " << e_index << " is " << in main()
49 get(boost::edge_index, graph, edge_at(e_index, graph)) << std::endl; in main()
|
| H A D | make_maximal_planar.cpp | 74 property_map<graph, edge_index_t>::type e_index = get(edge_index, g); in main() local
78 put(e_index, *ei, edge_count++); in main()
98 put(e_index, *ei, edge_count++); in main()
120 put(e_index, *ei, edge_count++); in main()
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/graph/example/ |
| H A D | grid_graph_example.cpp | 44 for (Traits::edges_size_type e_index = 0; in main() local
45 e_index < num_edges(graph); ++e_index) { in main()
48 std::cout << "Index of edge " << e_index << " is " << in main()
49 get(boost::edge_index, graph, edge_at(e_index, graph)) << std::endl; in main()
|
| H A D | make_maximal_planar.cpp | 74 property_map<graph, edge_index_t>::type e_index = get(edge_index, g); in main() local
78 put(e_index, *ei, edge_count++); in main()
98 put(e_index, *ei, edge_count++); in main()
120 put(e_index, *ei, edge_count++); in main()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/example/ |
| H A D | grid_graph_example.cpp | 44 for (Traits::edges_size_type e_index = 0; in main() local
45 e_index < num_edges(graph); ++e_index) { in main()
48 std::cout << "Index of edge " << e_index << " is " << in main()
49 get(boost::edge_index, graph, edge_at(e_index, graph)) << std::endl; in main()
|
| H A D | make_maximal_planar.cpp | 74 property_map<graph, edge_index_t>::type e_index = get(edge_index, g); in main() local
78 put(e_index, *ei, edge_count++); in main()
98 put(e_index, *ei, edge_count++); in main()
120 put(e_index, *ei, edge_count++); in main()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/example/ |
| H A D | grid_graph_example.cpp | 44 for (Traits::edges_size_type e_index = 0; in main() local
45 e_index < num_edges(graph); ++e_index) { in main()
48 std::cout << "Index of edge " << e_index << " is " << in main()
49 get(boost::edge_index, graph, edge_at(e_index, graph)) << std::endl; in main()
|
| H A D | make_maximal_planar.cpp | 74 property_map<graph, edge_index_t>::type e_index = get(edge_index, g); in main() local
78 put(e_index, *ei, edge_count++); in main()
98 put(e_index, *ei, edge_count++); in main()
120 put(e_index, *ei, edge_count++); in main()
|
| /dports/databases/percona57-server/boost_1_59_0/libs/graph/example/ |
| H A D | grid_graph_example.cpp | 44 for (Traits::edges_size_type e_index = 0; in main() local
45 e_index < num_edges(graph); ++e_index) { in main()
48 std::cout << "Index of edge " << e_index << " is " << in main()
49 get(boost::edge_index, graph, edge_at(e_index, graph)) << std::endl; in main()
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/graph/example/ |
| H A D | grid_graph_example.cpp | 44 for (Traits::edges_size_type e_index = 0; in main() local
45 e_index < num_edges(graph); ++e_index) { in main()
48 std::cout << "Index of edge " << e_index << " is " << in main()
49 get(boost::edge_index, graph, edge_at(e_index, graph)) << std::endl; in main()
|
| /dports/databases/percona57-client/boost_1_59_0/libs/graph/example/ |
| H A D | grid_graph_example.cpp | 44 for (Traits::edges_size_type e_index = 0; in main() local
45 e_index < num_edges(graph); ++e_index) { in main()
48 std::cout << "Index of edge " << e_index << " is " << in main()
49 get(boost::edge_index, graph, edge_at(e_index, graph)) << std::endl; in main()
|
| /dports/devel/boost-libs/boost_1_72_0/libs/graph/example/ |
| H A D | grid_graph_example.cpp | 44 for (Traits::edges_size_type e_index = 0; in main() local
45 e_index < num_edges(graph); ++e_index) { in main()
48 std::cout << "Index of edge " << e_index << " is " << in main()
49 get(boost::edge_index, graph, edge_at(e_index, graph)) << std::endl; in main()
|
| /dports/devel/hyperscan/boost_1_75_0/libs/graph/example/ |
| H A D | grid_graph_example.cpp | 47 for (Traits::edges_size_type e_index = 0; e_index < num_edges(graph); in main() local
48 ++e_index) in main()
52 std::cout << "Index of edge " << e_index << " is " in main()
53 << get(boost::edge_index, graph, edge_at(e_index, graph)) in main()
|
| /dports/math/boolector/boolector-3.2.2/src/ |
| H A D | btordbg.c | 381 const BtorNode *e_index) in btor_dbg_precond_read_exp() argument
385 assert (e_index); in btor_dbg_precond_read_exp()
389 assert (!btor_node_is_simplified (e_index)); in btor_dbg_precond_read_exp()
390 assert (!btor_node_is_fun (e_index)); in btor_dbg_precond_read_exp()
392 == btor_node_get_sort_id (e_index)); in btor_dbg_precond_read_exp()
394 assert (btor_node_real_addr (e_index)->btor == btor); in btor_dbg_precond_read_exp()
402 const BtorNode *e_index, in btor_dbg_precond_write_exp() argument
407 assert (e_index); in btor_dbg_precond_write_exp()
412 assert (!btor_node_is_simplified (e_index)); in btor_dbg_precond_write_exp()
414 assert (!btor_node_is_fun (e_index)); in btor_dbg_precond_write_exp()
[all …]
|
| /dports/security/cardpeek/cardpeek-0.8.4/ |
| H A D | lua_bytes.c | 254 int e_index; in subr_bytes_get() local
267 e_index = b_index; in subr_bytes_get()
270 e_index=luaL_checkint(L,2); in subr_bytes_get()
271 if (e_index>=(int)bytestring_get_size(bs)) e_index = bytestring_get_size(bs)-1; in subr_bytes_get()
274 if (e_index<b_index) in subr_bytes_get()
280 for (i=b_index;i<=e_index;i++) in subr_bytes_get()
285 return e_index-b_index+1; in subr_bytes_get()
292 unsigned e_index; in subr_bytes_set() local
298 e_index = b_index + lua_gettop(L)-3; in subr_bytes_set()
300 for (i=b_index;i<=e_index;i++) in subr_bytes_set()
|
| /dports/net-mgmt/p5-SNMP-Info/SNMP-Info-3.81/lib/SNMP/Info/ |
| H A D | Entity.pm | 74 sub e_index { subroutine
83 my %e_index;
86 $e_index{$iid} = $iid;
88 return \%e_index;
|
| /dports/net-p2p/vuze/vuze-5.7.4.0_2/com/aelitis/azureus/core/util/ |
| H A D | LinkFileMap.java | 80 int e_index = entry.getIndex(); in get() local
82 if ( e_index >= 0 && e_index != index ){ in get()
119 int e_index = entry.getIndex(); in getEntry() local
121 if ( e_index >= 0 && e_index != index ){ in getEntry()
|