Lines Matching defs:Node
207 struct Node;
208 struct CmpNodePos { bool operator()(const Node* u, const Node* v) const; };
210 typedef std::set<Node*,CmpNodePos> NodeSet;
211 struct Node
218 Node *firstAbove, *firstBelow;
221 Node(ShapeRef *v, const double p)
232 Node(VertInf *c, const double p)
243 Node(ShiftSegment *ss, const double p)
254 ~Node()
257 // Find the first Node above in the scanline that is a shape edge,
262 Node *curr = firstAbove;
274 // Find the first Node below in the scanline that is a shape edge,
279 Node *curr = firstBelow;
295 Node *curr = firstAbove;
310 Node *curr = firstBelow;
335 Node *curr = firstAbove;
394 Node *curr = firstAbove;
408 Node *curr = firstBelow;
424 for (Node *curr = firstBelow; curr; curr = curr->firstBelow)
431 for (Node *curr = firstAbove; curr; curr = curr->firstAbove)
443 bool CmpNodePos::operator() (const Node* u, const Node* v) const
471 Event(EventType t, Node *v, double p)
477 Node *v;
1160 Node *v = e->v;
1173 Node *u = *(--it);
1180 Node *u = *it;
1292 Node *l = v->firstAbove, *r = v->firstBelow;
1326 Node *v = e->v;
1339 Node *u = *(--it);
1346 Node *u = *it;
1416 Node *l = v->firstAbove, *r = v->firstBelow;
1457 Node *v = new Node(shRef, midX);
1469 Node *v = new Node(curr, point.x);
1531 Node *v = new Node(shRef, midY);
1543 Node *v = new Node(curr, point.y);
1634 Node *v = e->v;
1647 Node *u = *(--it);
1654 Node *u = *it;
1687 Node *l = v->firstAbove, *r = v->firstBelow;
1822 Node *v = new Node(shRef, mid);
1836 Node *v = new Node(&(*curr), lowPt[dim]);