Lines Matching refs:events

12     events = (SweepEvent *) g_malloc(maxEvt * sizeof(SweepEvent));
18 g_free(events);
29 events[n].MakeNew (iLeft, iRight, px, itl, itr);
39 events[n].ind = n;
46 if (px[1] < events[no].posx[1]
47 || (px[1] == events[no].posx[1] && px[0] < events[no].posx[0]))
49 events[n].ind = half;
50 events[no].ind = curInd;
60 return events + n;
71 SweepEvent const &e = events[inds[0]];
88 SweepEvent &e = events[inds[0]];
112 relocate(&events[--nbEvt], to);
121 events[to].ind = n;
125 Geom::Point const px = events[to].posx;
130 if (px[1] < events[no].posx[1]
131 || (px[1] == events[no].posx[1] && px[0] < events[no].posx[0]))
133 events[to].ind = half;
134 events[no].ind = curInd;
154 if (px[1] > events[no1].posx[1]
155 || (px[1] == events[no1].posx[1]
156 && px[0] > events[no1].posx[0]))
158 if (events[no2].posx[1] > events[no1].posx[1]
159 || (events[no2].posx[1] == events[no1].posx[1]
160 && events[no2].posx[0] > events[no1].posx[0]))
162 events[to].ind = child1;
163 events[no1].ind = curInd;
168 events[to].ind = child2;
169 events[no2].ind = curInd;
175 if (px[1] > events[no2].posx[1]
176 || (px[1] == events[no2].posx[1]
177 && px[0] > events[no2].posx[0]))
179 events[to].ind = child2;
180 events[no2].ind = curInd;
189 if (px[1] > events[no1].posx[1]
190 || (px[1] == events[no1].posx[1]
191 && px[0] > events[no1].posx[0]))
193 events[to].ind = child1;
194 events[no1].ind = curInd;
213 events[to] = *e;
215 e->sweep[LEFT]->evt[RIGHT] = events + to;
216 e->sweep[RIGHT]->evt[LEFT] = events + to;
223 * it only contains intersection events