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

Lines Matching defs:right
68         c->right->in.push_back(c);
131             Variable *r=(*c)->right;
186             Block *r=c->right->block;
263         Block *lb = v->left->block, *rb = v->right->block;
267             if(lb->isActiveDirectedPathBetween(v->right,v->left)) {
272                 //lb->getActiveDirectedPathBetween(e.path,v->right,v->left);
282                     =lb->splitBetween(v->left,v->right,lb,rb);
372             COLA_ASSERT(v->left->block == v->right->block);
483         if(!c->right->visited) {
484             dfsVisit(c->right, order);
512         double dist = c->right->offset - c->left->offset - c->gap;
543         Block *r = c->right->block;
545         double dist = c->left->offset + c->gap - c->right->offset;
575  * and right sides respectively)
582     f<<"Split right: "<<*r<<endl;
589     r = c->right->block;
696             if (((c->left->block != this) && in) || ((c->right->block != this) && !in)) {
705     f<<"  merging on: "<<*c<<",c->left->offset="<<c->left->offset<<",c->right->offset="<<c->right->offset<<endl;
707     double dist = c->right->offset - c->left->offset - c->gap;
709     Block *r=c->right->block;
723  * right merge or a left merge
791         Block *rb=v->right->block;
796         f<<"    timestamps: left="<<lb->timeStamp<<" right="<<rb->timeStamp<<" constraint="<<v->timeStamp<<endl;
837     while (v->left->block == v->right->block) {
859     return c->right->block==this && c->active && last!=c->right;
873             c->lm=compute_dfdv(c->right,v,min_lm);
882             dfdv-=c->lm*c->right->scale;
893             c->lm =   compute_dfdv(c->right,v);
901             dfdv -= c->lm * c->right->scale;
913 // the recursion (checking only constraints traversed left-to-right
949     f<<"  right split path: "<<*c<<endl;
951             if(c->right==r) {
955                 if(split_path(r,c->right,v,m)) {
994             if(c->right==r) {
998             Pair p=compute_dfdv_between(r,c->right,v,
1019             reset_active_lm(c->right,v);
1038             list_active(c->right,v);
1098             populateSplitBlock(b, (*c)->right, v);
1117             if(getActivePathBetween(path, (*c)->right, v, u)) {
1132             if(isActiveDirectedPathBetween((*c)->right,v)) {
1144             if(getActiveDirectedPathBetween(path,(*c)->right,v)) {
1178  * and the right into r.
1183     populateSplitBlock(l,c->left,c->right);
1186     populateSplitBlock(r,c->right,c->left);
1214 Constraint::Constraint(Variable *left, Variable *right, double gap, bool equality)
1216   right(right),
1226     //right->in.push_back(this);
1237     //for(i=right->in.begin(); i!=right->in.end(); i++) {
1240     //right->in.erase(i);
1244            : right->scale * right->position()
1257         if(c.right->scale!=1) {
1258             rscale << c.right->scale << "*";
1260         os<<lscale.str()<<*c.left<<"+"<<c.gap<<type<<rscale.str()<<*c.right;
1261         if(c.left->block&&c.right->block)
1275         ||l->left->block==l->right->block
1279         ||r->left->block==r->right->block
1284             if(l->right->id<r->right->id) return true;