Cross Reference: /inkscape/src/libavoid/vpsc.cpp

Lines Matching refs:out
63         vs[i]->out.clear();
67         c->left->out.push_back(c);
113     set<node*> out;
130         for(vector<Constraint*>::iterator c=vs[i]->out.begin();c!=vs[i]->out.end();++c) {
132             varmap[vs[i]]->out.insert(varmap[r]);
149             for(set<node*>::iterator j=u->out.begin();j!=u->out.end();++j) {
187             bmap[b]->out.insert(bmap[r]);
206             for(set<node*>::iterator j=u->out.begin();j!=u->out.end();++j) {
480     vector<Constraint*>::iterator it=v->out.begin();
481     for(;it!=v->out.end();++it) {
653     , out(NULL)
679     delete out;
685     setUpConstraintHeap(out,false);
692         vector<Constraint*> *cs=in?&(v->in):&(v->out);
779     while (!b->out->empty())
781         out->push(b->out->top());
782         b->out->pop();
816             f<<"    reinserting out of date (reinsert later)"<<endl;
835     if(out->empty()) return NULL;
836     Constraint *v = out->top();
838         out->pop();
839         if(out->empty()) return NULL;
840         v = out->top();
853     out->pop();
863 // of v's out constraints (as the recursive sum of those below.
870     for(Cit it=v->out.begin();it!=v->out.end();++it) {
890     for(Cit it = v->out.begin(); it != v->out.end(); ++it) {
944     for(Cit it(v->out.begin());it!=v->out.end();++it) {
988     for(Cit it(v->out.begin());it!=v->out.end();++it) {
1015     for(Cit it=v->out.begin();it!=v->out.end();++it) {
1031     for(Cit it=v->out.begin();it!=v->out.end();++it) {
1096     for (Cit c=v->out.begin();c!=v->out.end();++c) {
1115     for (Cit_const c=u->out.begin();c!=u->out.end();++c) {
1130     for (Cit_const c=u->out.begin();c!=u->out.end();++c) {
1142     for (Cit_const c=u->out.begin();c!=u->out.end();++c) {
1224     // (by creating variable in/out lists) when needed, rather than in advance
1225     //left->out.push_back(this);
1233     //for(i=left->out.begin(); i!=left->out.end(); i++) {
1236     //left->out.erase(i);