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

Lines Matching refs:left
67         c->left->out.push_back(c);
126             Variable *l=(*c)->left;
177             Block *l=c->left->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);
371             Block *b = v->left->block, *l=NULL, *r=NULL;
372             COLA_ASSERT(v->left->block == v->right->block);
495  * neighbouring (left) block until no more violated constraints are found
510         Block *l = c->left->block;
512         double dist = c->right->offset - c->left->offset - c->gap;
545         double dist = c->left->offset + c->gap - c->right->offset;
574  * Splits block b across constraint c into two new blocks, l and r (c's left
581     f<<"Split left: "<<*l<<endl;
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;
708     Block *l=c->left->block;
723  * right merge or a left merge
790         Block *lb=v->left->block;
796         f<<"    timestamps: left="<<lb->timeStamp<<" right="<<rb->timeStamp<<" constraint="<<v->timeStamp<<endl;
837     while (v->left->block == v->right->block) {
856     return c->left->block==this && c->active && last!=c->left;
874             dfdv+=c->lm*c->left->scale;
881             c->lm=-compute_dfdv(c->left,v,min_lm);
894             dfdv += c->lm * c->left->scale;
900             c->lm = - compute_dfdv(c->left,v);
913 // the recursion (checking only constraints traversed left-to-right
929     f<<"  left split path: "<<*c<<endl;
931             if(c->left==r) {
935                 if(split_path(r,c->left,v,m)) {
977             if(c->left==r) {
981             Pair p=compute_dfdv_between(r,c->left,v,
1026             reset_active_lm(c->left,v);
1048             list_active(c->left,v);
1094             populateSplitBlock(b, (*c)->left, v);
1109             if(getActivePathBetween(path, (*c)->left, v, u)) {
1177  * placing the left subtree of constraints (and associated variables) into l
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)
1215 : left(left),
1225     //left->out.push_back(this);
1233     //for(i=left->out.begin(); i!=left->out.end(); i++) {
1236     //left->out.erase(i);
1245          - gap - left->scale * left->position();
1254         if(c.left->scale!=1) {
1255             lscale << c.left->scale << "*";
1260         os<<lscale.str()<<*c.left<<"+"<<c.gap<<type<<rscale.str()<<*c.right;
1261         if(c.left->block&&c.right->block)
1274         l->left->block->timeStamp > l->timeStamp
1275         ||l->left->block==l->right->block
1278         r->left->block->timeStamp > r->timeStamp
1279         ||r->left->block==r->right->block
1283         if(l->left->id==r->left->id) {
1287         if(l->left->id<r->left->id) return true;