Searched refs:events (Results 1 - 7 of 7) sorted by relevance

/inkscape/src/livarot/
H A Dsweep-event.cpp12 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
[all...]
H A Dsweep-event-queue.h4 * A container of intersection events.
13 * The structure to hold the intersections events encountered during the sweep. It's an array of
15 * indices because it's a binary heap: inds[i] tell that events[inds[i]] has position i in the
37 int nbEvt; ///< Number of events currently in the heap.
40 SweepEvent *events; ///< Sweep events. member in class:SweepEventQueue
/inkscape/src/2geom/
H A Dsweep-bounds.cpp36 std::vector<Event> events; events.reserve(rs.size()*2); local
40 events.push_back(Event(rs[i][d].min(), i, false));
41 events.push_back(Event(rs[i][d].max(), i, true));
43 std::sort(events.begin(), events.end());
46 for(unsigned i = 0; i < events.size(); i++) {
47 unsigned ix = events[i].ix;
48 if(events[i].closing) {
78 std::vector<Event> events[
[all...]
/inkscape/src/libcola/
H A Dstraightener.cpp111 Event **events; member in namespace:straightener
201 events=new Event*[nevents];
208 events[ctr++]=new Event(Open,v,v->ymin+0.01);
209 events[ctr++]=new Event(Close,v,v->ymax-0.01);
213 events[ctr++]=new Event(Open,e,e->ymin-1);
214 events[ctr++]=new Event(Close,e,e->ymax+1);
221 events[ctr++]=new Event(Open,v,v->xmin+0.01);
222 events[ctr++]=new Event(Close,v,v->xmax-0.01);
226 events[ctr++]=new Event(Open,e,e->xmin-1);
227 events[ct
[all...]
/inkscape/src/libvpsc/
H A Dgenerate-constraints.cpp146 Event **events; member in namespace:vpsc
174 events=new Event*[2*n];
179 events[ctr++]=new Event(Open,v,rs[i]->getMinY());
180 events[ctr++]=new Event(Close,v,rs[i]->getMaxY());
182 qsort((Event*)events, (size_t)2*n, sizeof(Event*), compare_events );
187 Event *e=events[i];
248 delete [] events;
258 events=new Event*[2*n];
263 events[ctr++]=new Event(Open,v,rs[i]->getMinX());
264 events[ct
[all...]
/inkscape/src/libavoid/
H A Dorthogonal.cpp481 Event **events; member in namespace:Avoid
1446 // Set up the events for the vertical sweep.
1448 events = new Event*[totalEvents];
1458 events[ctr++] = new Event(Open, v, minY);
1459 events[ctr++] = new Event(Close, v, maxY);
1470 events[ctr++] = new Event(ConnPoint, v, point.y);
1472 qsort((Event*)events, (size_t) totalEvents, sizeof(Event*), compare_events);
1479 double thisPos = (totalEvents > 0) ? events[0]->pos : 0;
1484 // If we have finished the current scanline or all events, then we
1485 // process the events o
[all...]
/inkscape/src/ui/widget/
H A Dlayer-selector.cpp486 Inkscape::XML::NodeEventVector events = { local
494 vector = new Inkscape::XML::NodeEventVector(events);
496 Inkscape::XML::NodeEventVector events = { local
504 vector = new Inkscape::XML::NodeEventVector(events);

Completed in 47 milliseconds