Lines Matching defs:ret
33 CrossingGraph ret;
41 ret.push_back(CrossingNode());
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));
50 for(unsigned i = 0; i < ret.size(); i++) {
51 for(unsigned j = 0; j < ret[i].edges.size(); j++) {
52 unsigned pth = ret[i].edges[j].path;
53 double t = ret[i].edges[j].time;
54 bool rev = ret[i].edges[j].reverse;
57 unsigned bix = ret.size();
58 for(unsigned k = 0; k < ret.size(); k++) {
59 for(unsigned l = 0; l < ret[k].edges.size(); l++) {
60 if(ret[i].edges[j].path == ret[k].edges[l].path && (k != i || l != j)) {
61 double d = wrap_dist(t, ret[i].edges[j].time, size, rev);
69 if(bix == ret.size()) {
73 ret[i].edges[j].node = bix;
77 return ret;
81 CrossingGraph ret;
144 Crossings ret;
147 ret.push_back(Crossing(i->ta > mx+0.01 ? (1 - (i->ta - mx) + mx) : mx - i->ta,
150 return ret;
154 Crossings ret;
157 ret.push_back(Crossing(i->ta, i->tb > mx+0.01 ? (1 - (i->tb - mx) + mx) : mx - i->tb,
160 return ret;
164 CrossingSet ret;
168 ret.push_back(res);
170 return ret;
174 CrossingSet ret;
178 ret.push_back(res);
180 return ret;