Lines Matching defs:crs
31 CrossingGraph create_crossing_graph(PathVector const &p, Crossings const &crs) {
34 for(unsigned i = 0; i < crs.size(); i++) {
35 Point pnt = p[crs[i].a].pointAt(crs[i].ta);
44 ret[j].add_edge(Edge(crs[i].a, crs[i].ta, false));
45 ret[j].add_edge(Edge(crs[i].a, crs[i].ta, true));
46 ret[j].add_edge(Edge(crs[i].b, crs[i].tb, false));
47 ret[j].add_edge(Edge(crs[i].b, crs[i].tb, true));
82 std::vector<Edge> edges(crs.size());
100 for(unsigned j = 0; j < crs[i].size(); j++) {
102 edges.push_back(Edge(i, crs[i][j].getOtherTime(i), false));
103 edges.push_back(Edge(i, crs[i][j].getOtherTime(i), true));
188 void delete_duplicates(Crossings &crs) {
189 Crossings::reverse_iterator rit = crs.rbegin();
191 for (rit = crs.rbegin(); rit!= crs.rend(); ++rit) {
193 while (++rit2 != crs.rend()) {
195 crs.erase((rit + 1).base()); // This +1 and .base() construction is needed to convert to a regular iterator