| /dports/net/mptsd/mptsd-1.1/libtsfuncs/ |
| H A D | eit.c | 19 eit->streams_max = 128; in ts_eit_alloc()
20 eit->streams = calloc(eit->streams_max, sizeof(void *)); in ts_eit_alloc()
21 return eit; in ts_eit_alloc()
35 if (!eit) in ts_eit_clear()
54 if (eit) { in ts_eit_free()
57 FREE(eit->streams); in ts_eit_free()
106 return eit; in ts_eit_push_packet()
109 ts_eit_clear(eit); in ts_eit_push_packet()
110 return eit; in ts_eit_push_packet()
128 if (eit->streams_num == eit->streams_max) { in ts_eit_parse()
[all …]
|
| H A D | eit_desc.c | 26 eit->ts_header.pid = 0x12; in ts_eit_init()
27 eit->ts_header.pusi = 1; in ts_eit_init()
28 eit->ts_header.payload_field = 1; in ts_eit_init()
29 eit->ts_header.payload_offset = 4; in ts_eit_init()
49 eit->streams_num = 0; in ts_eit_init()
51 eit->initialized = 1; in ts_eit_init()
55 return eit; in ts_eit_init()
60 if (!eit) in ts_eit_alloc_init()
76 if (eit->streams_num == eit->streams_max - 1 || desc_size == 0) { in ts_eit_add_stream()
109 eit->streams[eit->streams_num] = sinfo; in ts_eit_add_stream()
[all …]
|
| H A D | tstest.c | 123 ts_eit_test1(eit); in ts_eit_test()
124 ts_eit_dump(eit); in ts_eit_test()
125 ts_eit_free(&eit); in ts_eit_test()
128 ts_eit_test2(eit); in ts_eit_test()
129 ts_eit_dump(eit); in ts_eit_test()
130 ts_eit_free(&eit); in ts_eit_test()
133 ts_eit_test3(eit); in ts_eit_test()
134 ts_eit_dump(eit); in ts_eit_test()
135 ts_eit_free(&eit); in ts_eit_test()
138 ts_eit_test4(eit); in ts_eit_test()
[all …]
|
| /dports/www/osrm-backend/osrm-backend-5.26.0/unit_tests/util/ |
| H A D | dynamic_graph.cpp | 43 eit = simple_graph.FindEdge(1, 0); in BOOST_AUTO_TEST_CASE()
54 eit = simple_graph.FindEdge(3, 1); in BOOST_AUTO_TEST_CASE()
56 eit = simple_graph.FindEdge(0, 4); in BOOST_AUTO_TEST_CASE()
59 eit = simple_graph.FindEdge(3, 4); in BOOST_AUTO_TEST_CASE()
64 eit = simple_graph.FindEdge(3, 0); in BOOST_AUTO_TEST_CASE()
96 BOOST_CHECK(eit != SPECIAL_EDGEID); in BOOST_AUTO_TEST_CASE()
99 eit = simple_graph.FindEdge(3, 1); in BOOST_AUTO_TEST_CASE()
110 eit = simple_graph.FindEdge(0, 3); in BOOST_AUTO_TEST_CASE()
112 eit = simple_graph.FindEdge(1, 2); in BOOST_AUTO_TEST_CASE()
115 eit = simple_graph.FindEdge(0, 2); in BOOST_AUTO_TEST_CASE()
[all …]
|
| H A D | static_graph.cpp | 128 eit = simple_graph.FindEdge(1, 0); in BOOST_AUTO_TEST_CASE()
139 eit = simple_graph.FindEdge(3, 1); in BOOST_AUTO_TEST_CASE()
141 eit = simple_graph.FindEdge(0, 4); in BOOST_AUTO_TEST_CASE()
144 eit = simple_graph.FindEdge(3, 4); in BOOST_AUTO_TEST_CASE()
149 eit = simple_graph.FindEdge(3, 0); in BOOST_AUTO_TEST_CASE()
180 BOOST_CHECK(eit != SPECIAL_EDGEID); in BOOST_AUTO_TEST_CASE()
183 eit = simple_graph.FindEdge(3, 1); in BOOST_AUTO_TEST_CASE()
194 eit = simple_graph.FindEdge(0, 3); in BOOST_AUTO_TEST_CASE()
196 eit = simple_graph.FindEdge(1, 2); in BOOST_AUTO_TEST_CASE()
199 eit = simple_graph.FindEdge(0, 2); in BOOST_AUTO_TEST_CASE()
[all …]
|
| /dports/math/graphthing/graphthing-1.3.2/src/ |
| H A D | graph.cc | 52 for (eit = other.e_begin (); eit != other.e_end (); ++eit) { in Graph()
84 for (eit = g.e_begin (); eit != g.e_end (); ++eit) in operator <<()
244 for (eit = v1->e_begin (); eit != v1->e_end (); ++eit) { in find()
249 for (eit = v1->e_begin (); eit != v1->e_end (); ++eit) { in find()
269 for (eit = e_begin (); eit != e_end (); ++eit) { in remove()
399 for (eit = v1->e_begin (); eit != v1->e_end (); ++eit) { in are_adjacent()
438 for (eit = v1->e_begin (); eit != v1->e_end (); ++eit) { in identify()
473 for (eit = e_begin (); eit != e_end (); ++eit) { in subgraph_marked()
489 for (eit = e_begin (); eit != e_end (); ++eit) { in line_graph()
500 for (eit = v->e_begin (); eit != v->e_end (); ++eit) { in line_graph()
[all …]
|
| H A D | graph2.cc | 38 for (eit = e_begin (); eit != e_end (); ++eit) in is_undirected()
57 for (eit = e_begin (); eit != e_end (); ++eit) in is_connected()
71 for (eit = e_begin (); eit != e_end (); ++eit) { in is_connected()
187 for (eit = curr_red->e_begin (); eit != last; ++eit) { in eulericity()
433 for (eit = v->e_begin (); eit != v->e_end (); ++eit) { in bfs()
491 for (eit = e_begin (); eit != e_end (); ++eit) in minimum_spanning_tree()
548 for (eit = g->e_begin (); eit != g->e_end (); ++eit) { in ford_fulkerson()
566 for (eit = g->e_begin (); eit != g->e_end (); ++eit) { in ford_fulkerson()
649 for (eit = e_begin (); eit != e_end (); ++eit) { in ford_fulkerson()
862 for (eit = e_begin (); eit != e_end (); ++eit) { in chromatic_poly()
[all …]
|
| H A D | exporter.cc | 78 for (eit = g->e_begin (); eit != g->e_end (); ++eit) { in output()
79 Edge *e = *eit; in output()
101 for (eit = g->e_begin (); eit != g->e_end (); ++eit) { in output()
126 for (eit = g->e_begin (); eit != g->e_end (); ++eit) { in output()
127 Edge *e = *eit; in output()
159 for (eit = g->e_begin (); eit != g->e_end (); ++eit) { in output()
160 Edge *e = *eit; in output()
170 for (eit = g->e_begin (); eit != g->e_end (); ++eit) { in output()
320 for (eit = g->e_begin (); eit != g->e_end (); ++eit) { in output()
325 fs << (*eit)->v->x << ' ' << (*eit)->v->y << ' ' << in output()
[all …]
|
| H A D | vertex.cc | 36 e_const_iterator eit; in indegree() local
39 for (eit = e_begin (); eit != e_end (); ++eit) in indegree()
40 if ((*eit)->directed && ((*eit)->w == this)) in indegree()
47 e_const_iterator eit; in outdegree() local
50 for (eit = e_begin (); eit != e_end (); ++eit) in outdegree()
51 if ((*eit)->directed && ((*eit)->v == this)) in outdegree()
88 e_iterator eit; in unhook() local
90 for (eit = e_begin (); eit != e_end (); ++eit) in unhook()
91 if (*eit == e) in unhook()
93 if (eit == e_end ()) in unhook()
[all …]
|
| /dports/math/igraph/igraph-0.9.5/src/graph/ |
| H A D | iterators.c | 1647 eit->pos = 0; in igraph_i_eit_create_allfromto()
1648 eit->start = 0; in igraph_i_eit_create_allfromto()
1649 eit->vec = vec; in igraph_i_eit_create_allfromto()
1650 eit->end = igraph_vector_size(eit->vec); in igraph_i_eit_create_allfromto()
1671 eit->pos = 0; in igraph_i_eit_pairs()
1672 eit->start = 0; in igraph_i_eit_pairs()
1709 eit->pos = 0; in igraph_i_eit_multipairs()
1710 eit->start = 0; in igraph_i_eit_multipairs()
1744 eit->pos = 0; in igraph_i_eit_path()
1822 eit->end = igraph_vector_size(eit->vec); in igraph_eit_create()
[all …]
|
| /dports/math/igraph/igraph-0.9.5/tests/unit/ |
| H A D | edge_selectors.c | 23 igraph_eit_t eit; in check() local
25 IGRAPH_ASSERT(igraph_eit_create(graph, *es, &eit) == IGRAPH_SUCCESS); in check()
26 for (; !IGRAPH_EIT_END(eit); IGRAPH_EIT_NEXT(eit)) { in check()
27 edge = IGRAPH_EIT_GET(eit); in check()
30 igraph_eit_destroy(&eit); in check()
37 igraph_eit_t eit; in main() local
56 IGRAPH_ASSERT(igraph_eit_create(&g, es, &eit) == IGRAPH_EINVAL); in main()
69 IGRAPH_ASSERT(igraph_eit_create(&g, es, &eit) == IGRAPH_SUCCESS); in main()
71 igraph_eit_as_vector(&eit, &check_as_vector); in main()
90 IGRAPH_ASSERT(igraph_eit_create(&g, es, &eit) == IGRAPH_EINVAL); in main()
[all …]
|
| H A D | igraph_es_path.c | 33 igraph_eit_t eit; in main() local
40 igraph_eit_create(&g, es, &eit); in main()
42 while (!IGRAPH_EIT_END(eit)) { in main()
43 long int edge = IGRAPH_EIT_GET(eit); in main()
46 IGRAPH_EIT_NEXT(eit); in main()
51 igraph_eit_destroy(&eit); in main()
60 igraph_eit_create(&g, es, &eit); in main()
61 while (!IGRAPH_EIT_END(eit)) { in main()
62 long int edge = IGRAPH_EIT_GET(eit); in main()
65 IGRAPH_EIT_NEXT(eit); in main()
[all …]
|
| /dports/math/R-cran-igraph/igraph/src/ |
| H A D | iterators.c | 1640 eit->pos = 0; in igraph_i_eit_create_allfromto()
1641 eit->start = 0; in igraph_i_eit_create_allfromto()
1642 eit->vec = vec; in igraph_i_eit_create_allfromto()
1643 eit->end = igraph_vector_size(eit->vec); in igraph_i_eit_create_allfromto()
1664 eit->pos = 0; in igraph_i_eit_pairs()
1665 eit->start = 0; in igraph_i_eit_pairs()
1702 eit->pos = 0; in igraph_i_eit_multipairs()
1703 eit->start = 0; in igraph_i_eit_multipairs()
1737 eit->pos = 0; in igraph_i_eit_path()
1815 eit->end = igraph_vector_size(eit->vec); in igraph_eit_create()
[all …]
|
| /dports/games/0ad/0ad-0.0.23b-alpha/source/simulation2/system/ |
| H A D | ComponentManagerSerialization.cpp | 65 for (; eit != ctit->second.end(); ++eit) in DumpDebugState()
67 components[eit->first][ctit->first] = eit->second; in DumpDebugState()
121 …:map<entity_id_t, IComponent*>::const_iterator eit = cit->second.begin(); eit != cit->second.end()… in ComputeStateHash() local
136 …:map<entity_id_t, IComponent*>::const_iterator eit = cit->second.begin(); eit != cit->second.end()… in ComputeStateHash() local
202 …:map<entity_id_t, IComponent*>::const_iterator eit = cit->second.begin(); eit != cit->second.end()… in SerializeState() local
205 if (ENTITY_IS_LOCAL(eit->first) || eit->first == SYSTEM_ENTITY) in SerializeState()
242 if (eit == cit->second.end()) in SerializeState()
268 …:map<entity_id_t, IComponent*>::const_iterator eit = cit->second.begin(); eit != cit->second.end()… in SerializeState() local
271 if (ENTITY_IS_LOCAL(eit->first) || eit->first == SYSTEM_ENTITY) in SerializeState()
281 …:map<entity_id_t, IComponent*>::const_iterator eit = cit->second.begin(); eit != cit->second.end()… in SerializeState() local
[all …]
|
| /dports/math/igraph/igraph-0.9.5/src/properties/ |
| H A D | multiplicity.c | 171 igraph_eit_t eit; in igraph_is_multiple() local
183 for (i = 0; !IGRAPH_EIT_END(eit); i++, IGRAPH_EIT_NEXT(eit)) { in igraph_is_multiple()
184 long int e = IGRAPH_EIT_GET(eit); in igraph_is_multiple()
208 igraph_eit_destroy(&eit); in igraph_is_multiple()
239 igraph_eit_t eit; in igraph_count_multiple() local
250 for (i = 0; !IGRAPH_EIT_END(eit); i++, IGRAPH_EIT_NEXT(eit)) { in igraph_count_multiple()
275 igraph_eit_destroy(&eit); in igraph_count_multiple()
313 igraph_eit_t eit; in igraph_is_mutual() local
326 igraph_eit_destroy(&eit); in igraph_is_mutual()
334 for (i = 0; ! IGRAPH_EIT_END(eit); i++, IGRAPH_EIT_NEXT(eit)) { in igraph_is_mutual()
[all …]
|
| /dports/math/dune-grid/dune-grid-de36e4b4e99da4cd7a120a39779345e701821115/dune/grid/utility/test/ |
| H A D | persistentcontainertest.cc | 50 for(EIterator eit = view.template begin<0>(); eit != eend; ++eit) in test() local
52 auto geometry = eit->geometry(); in test()
53 ccontainer0[*eit] = container0[*eit] = geometry.center(); in test()
55 for (unsigned int i=0; i<eit->subEntities(1); ++i) in test()
56 ccontainer1(*eit,i) = container1(*eit,i) = geometry.global( refElement.position(i,1) ); in test()
57 for (unsigned int i=0; i<eit->subEntities(2); ++i) in test()
80 for(EIterator eit = view.template begin<0>(); eit != eend; ++eit) in test() local
82 if (container0[*eit].used == true) in test()
88 if (ccontainer0[*eit].used == true) in test()
112 for (unsigned int i=0; i<eit->subEntities(1); ++i) in test()
[all …]
|
| /dports/math/dune-grid/dune-grid-de36e4b4e99da4cd7a120a39779345e701821115/dune/grid/io/file/vtk/ |
| H A D | boundaryiterators.hh | 57 ElementIterator eit; member in Dune::VTK::BoundaryIterator
62 if(eit == gv->template end<0>()) return true; in valid()
71 if(*iit == gv->iend(*eit)) { in basic_increment()
73 ++eit; in basic_increment()
74 if(eit != gv->template end<0>()) in basic_increment()
84 if(eit != other.eit) return false; in equals()
88 bool mePassedTheEnd = eit == gv->template end<0>(); in equals()
124 : gv(&gv_), eit(eit_) in BoundaryIterator()
126 if(eit != gv->template end<0>()) in BoundaryIterator()
127 iit.reset(new IntersectionIterator(gv->ibegin(*eit))); in BoundaryIterator()
[all …]
|
| /dports/games/spring/spring_98.0/rts/lib/assimp/code/ |
| H A D | MD5Parser.cpp | 219 (*eit).iLineNumber); \
243 …for (ElementList::const_iterator eit = (*iter).mElements.begin(), eitEnd = (*iter).mElements.end()… in MD5MeshParser() local
247 const char* sz = (*eit).szStart; in MD5MeshParser()
262 …for (ElementList::const_iterator eit = (*iter).mElements.begin(), eitEnd = (*iter).mElements.end()… in MD5MeshParser() local
263 const char* sz = (*eit).szStart; in MD5MeshParser()
356 …for (ElementList::const_iterator eit = (*iter).mElements.begin(), eitEnd = (*iter).mElements.end()… in MD5AnimParser() local
360 const char* sz = (*eit).szStart; in MD5AnimParser()
380 …for (ElementList::const_iterator eit = (*iter).mElements.begin(), eitEnd = (*iter).mElements.end()… in MD5AnimParser() local
406 …for (ElementList::const_iterator eit = (*iter).mElements.begin(), eitEnd = (*iter).mElements.end()… in MD5AnimParser() local
454 …for (ElementList::const_iterator eit = (*iter).mElements.begin(), eitEnd = (*iter).mElements.end()… in MD5CameraParser() local
[all …]
|
| /dports/graphics/urho3d/Urho3D-1.7.1/Source/ThirdParty/Assimp/code/ |
| H A D | MD5Parser.cpp | 223 (*eit).iLineNumber); \
247 …for (ElementList::const_iterator eit = (*iter).mElements.begin(), eitEnd = (*iter).mElements.end()… in MD5MeshParser() local
251 const char* sz = (*eit).szStart; in MD5MeshParser()
266 …for (ElementList::const_iterator eit = (*iter).mElements.begin(), eitEnd = (*iter).mElements.end()… in MD5MeshParser() local
267 const char* sz = (*eit).szStart; in MD5MeshParser()
360 …for (ElementList::const_iterator eit = (*iter).mElements.begin(), eitEnd = (*iter).mElements.end()… in MD5AnimParser() local
364 const char* sz = (*eit).szStart; in MD5AnimParser()
384 …for (ElementList::const_iterator eit = (*iter).mElements.begin(), eitEnd = (*iter).mElements.end()… in MD5AnimParser() local
410 …for (ElementList::const_iterator eit = (*iter).mElements.begin(), eitEnd = (*iter).mElements.end()… in MD5AnimParser() local
458 …for (ElementList::const_iterator eit = (*iter).mElements.begin(), eitEnd = (*iter).mElements.end()… in MD5CameraParser() local
[all …]
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/Nef_2/ |
| H A D | PM_const_decorator.h | 450 for (eit = phds->halfedges_begin() ; eit != eend; ++eit) { in check_integrity_and_topological_planarity()
451 CGAL_assertion( twin(twin(eit)) == eit ); in check_integrity_and_topological_planarity()
454 CGAL_assertion( previous(next(eit)) == eit ); in check_integrity_and_topological_planarity()
455 CGAL_assertion( target(eit) == source(next(eit)) ); in check_integrity_and_topological_planarity()
457 CGAL_assertion( next(previous(eit)) == eit ); in check_integrity_and_topological_planarity()
458 CGAL_assertion( target(previous(eit)) == source(eit) ); in check_integrity_and_topological_planarity()
461 CGAL_assertion( face(next(eit)) == face(eit) ); in check_integrity_and_topological_planarity()
462 CGAL_assertion( face(previous(eit)) == face(eit) ); in check_integrity_and_topological_planarity()
512 for ( ; eit != eend; ++eit) { in number_of_face_cycles()
585 for (eit = D.halfedges_begin(); eit != D.halfedges_end(); ++eit) { in print_as_leda_graph()
[all …]
|
| /dports/misc/vxl/vxl-3.3.2/contrib/brl/bseg/brec/ |
| H A D | brec_part_hierarchy_detector.cxx | 272 eit++; // skip the central part in exists()
275 for ( ; eit != upper_p->out_edges_end(); eit++) { in exists()
339 for ( ; eit != upper_p->out_edges_end(); eit++) { in exists()
390 for (auto eit = hp->in_edges_begin(); eit != hp->in_edges_end(); eit++) { in extract_upper_layer() local
427 for ( ; eit != upper_p->out_edges_end(); eit++) { in exists_for_training()
495 for ( ; eit != upper_p->out_edges_end(); eit++) { in exists_using_hierarchies()
522 best_edge = (*eit); in exists_using_hierarchies()
536 eit = pi->out_edges_begin(); in exists_using_hierarchies()
538 for ( ; eit != pi->out_edges_end(); eit++) { in exists_using_hierarchies()
596 for (auto eit = hp->in_edges_begin(); eit != hp->in_edges_end(); eit++) { in extract_upper_layer() local
[all …]
|
| /dports/lang/erlang-runtime23/otp-OTP-23.3.4.10/lib/asn1/test/asn1_SUITE_data/rfcs/ |
| H A D | MTSObjectIdentifiers.asn1 | 25 id-eit ID ::= {id-mts 4} -- encoded information types
69 id-eit-unknown ID ::= {id-eit 0}
71 -- Value { id-eit 1 } is no longer defined
72 id-eit-ia5-text ID ::= {id-eit 2}
74 id-eit-g3-facsimile ID ::= {id-eit 3}
76 id-eit-g4-class-1 ID ::= {id-eit 4}
78 id-eit-teletex ID ::= {id-eit 5}
80 id-eit-videotex ID ::= {id-eit 6}
82 id-eit-voice ID ::= {id-eit 7}
84 id-eit-sfd ID ::= {id-eit 8}
[all …]
|
| /dports/lang/erlang-runtime24/otp-OTP-24.1.7/lib/asn1/test/asn1_SUITE_data/rfcs/ |
| H A D | MTSObjectIdentifiers.asn1 | 25 id-eit ID ::= {id-mts 4} -- encoded information types
69 id-eit-unknown ID ::= {id-eit 0}
71 -- Value { id-eit 1 } is no longer defined
72 id-eit-ia5-text ID ::= {id-eit 2}
74 id-eit-g3-facsimile ID ::= {id-eit 3}
76 id-eit-g4-class-1 ID ::= {id-eit 4}
78 id-eit-teletex ID ::= {id-eit 5}
80 id-eit-videotex ID ::= {id-eit 6}
82 id-eit-voice ID ::= {id-eit 7}
84 id-eit-sfd ID ::= {id-eit 8}
[all …]
|
| /dports/lang/erlang-runtime22/otp-OTP-22.3.4.24/lib/asn1/test/asn1_SUITE_data/rfcs/ |
| H A D | MTSObjectIdentifiers.asn1 | 25 id-eit ID ::= {id-mts 4} -- encoded information types
69 id-eit-unknown ID ::= {id-eit 0}
71 -- Value { id-eit 1 } is no longer defined
72 id-eit-ia5-text ID ::= {id-eit 2}
74 id-eit-g3-facsimile ID ::= {id-eit 3}
76 id-eit-g4-class-1 ID ::= {id-eit 4}
78 id-eit-teletex ID ::= {id-eit 5}
80 id-eit-videotex ID ::= {id-eit 6}
82 id-eit-voice ID ::= {id-eit 7}
84 id-eit-sfd ID ::= {id-eit 8}
[all …]
|
| /dports/lang/erlang-wx/otp-OTP-24.1.7/lib/asn1/test/asn1_SUITE_data/rfcs/ |
| H A D | MTSObjectIdentifiers.asn1 | 25 id-eit ID ::= {id-mts 4} -- encoded information types
69 id-eit-unknown ID ::= {id-eit 0}
71 -- Value { id-eit 1 } is no longer defined
72 id-eit-ia5-text ID ::= {id-eit 2}
74 id-eit-g3-facsimile ID ::= {id-eit 3}
76 id-eit-g4-class-1 ID ::= {id-eit 4}
78 id-eit-teletex ID ::= {id-eit 5}
80 id-eit-videotex ID ::= {id-eit 6}
82 id-eit-voice ID ::= {id-eit 7}
84 id-eit-sfd ID ::= {id-eit 8}
[all …]
|