/inkscape/src/libvpsc/ |
H A D | block.h | 17 class Variable; 27 typedef std::vector<Variable*> Variables; 29 typedef std::vector<Variable*>::iterator Vit; 37 Block(Variable* const v=NULL); 46 Constraint* findMinLMBetween(Variable* const lv, Variable* const rv); 79 Constraint* splitBetween(Variable* vl, Variable* vr, Block* &lb, Block* &rb); 94 bool isActiveDirectedPathBetween(Variable* u, Variable * [all...] |
H A D | blocks.h | 23 class Variable; 36 Blocks(const int n, Variable* const vs[]); 62 std::list<Variable*> *totalOrder(); 73 void dfsVisit(Variable *v, std::list<Variable*> *order); 77 Variable* const *vs;
|
H A D | variable.cpp | 12 std::ostream& operator <<(std::ostream &os, const Variable &v) {
|
H A D | variable.h | 20 class Variable class in namespace:vpsc 22 friend std::ostream& operator <<(std::ostream &os, const Variable &v); 33 inline Variable(const int id, const double desiredPos, const double weight) function in class:vpsc::Variable 46 virtual ~Variable(void){
|
H A D | solve_VPSC.h | 3 * Solve an instance of the "Variable Placement with Separation 28 class Variable; 33 * Variable Placement with Separation Constraints problem instance 58 Solver(const unsigned n, Variable* const vs[], const unsigned m, Constraint *cs[]); 61 const Variable* const * getVariables(unsigned &n) { n=this->n; return vs; } 67 const Variable* const *vs; 71 bool constraintGraphIsCyclic(const unsigned n, Variable* const vs[]); 100 IncSolver(const unsigned n, Variable* const vs[], const unsigned m, Constraint *cs[]);
|
H A D | constraint.h | 26 Variable *left; 27 Variable *right; 30 Constraint(Variable *left, Variable *right, double gap, bool equality=false);
|
H A D | generate-constraints.h | 75 class Variable; 79 int generateXConstraints(const int n, Rectangle** rs, Variable** vars, Constraint** &cs, const bool useNeighbourLists); 80 int generateYConstraints(const int n, Rectangle** rs, Variable** vars, Constraint** &cs);
|
H A D | block.cpp | 23 void Block::addVariable(Variable* const v) { 30 Block::Block(Variable* const v) { 36 vars=new vector<Variable*>; 66 Variable *v=*i; 105 Variable *v=*i; 201 inline bool Block::canFollowLeft(Constraint *c, const Variable* const last) { 204 inline bool Block::canFollowRight(Constraint *c, const Variable* const last) { 213 double Block::compute_dfdv(Variable* const v, Variable* const u, 248 Variable* [all...] |
H A D | constraint.cpp | 13 Constraint::Constraint(Variable *left, Variable *right, double gap, bool equality)
|
H A D | remove_rectangle_overlap.cpp | 38 Variable **vs=new Variable*[n]; 40 vs[i]=new Variable(i,0,1);
|
H A D | blocks.cpp | 31 Blocks::Blocks(const int n, Variable* const vs[]) : vs(vs),nvs(n) { 46 list<Variable*> *Blocks::totalOrder() { 47 list<Variable*> *order = new list<Variable*>; 60 void Blocks::dfsVisit(Variable *v, list<Variable*> *order) {
|
H A D | solve_VPSC.cpp | 2 * Solve an instance of the "Variable Placement with Separation 31 IncSolver::IncSolver(const unsigned n, Variable* const vs[], const unsigned m, Constraint *cs[]) 38 Solver::Solver(const unsigned n, Variable* const vs[], const unsigned m, Constraint *cs[]) : m(m), cs(cs), n(n), vs(vs) { 64 list<Variable*> *vs=bs->totalOrder(); 65 for(list<Variable*>::iterator i=vs->begin();i!=vs->end();++i) { 66 Variable *v=*i; 285 bool Solver::constraintGraphIsCyclic(const unsigned n, Variable* const vs[]) { 286 map<Variable*, node*> varmap; 295 Variable *l=(*c)->left; 300 Variable * [all...] |
H A D | generate-constraints.cpp | 45 Variable *v; 50 Node(Variable *v, Rectangle *r, double p) : v(v),r(r),pos(p) { 173 int generateXConstraints(const int n, Rectangle** rs, Variable** vars, Constraint** &cs, const bool useNeighbourLists) { 257 int generateYConstraints(const int n, Rectangle** rs, Variable** vars, Constraint** &cs) {
|
/inkscape/src/libavoid/ |
H A D | vpsc.h | 27 * A solver for the problem of Variable Placement with Separation Constraints. 47 class Variable; 49 typedef std::vector<Variable*> Variables; 57 void addVariable(Variable* const v); 80 Block(Variable* const v=NULL); 83 Constraint* findMinLMBetween(Variable* const lv, Variable* const rv); 94 Constraint* splitBetween(Variable* vl, Variable* vr, Block* &lb, Block* &rb); 102 bool getActivePathBetween(Constraints& path, Variable cons 126 class Variable class in namespace:Avoid 146 inline Variable(const int id, const double desiredPos=-1.0, function in class:Avoid::Variable [all...] |
H A D | vpsc.cpp | 27 * A solver for the problem of Variable Placement with Separation Constraints. 55 IncSolver::IncSolver(vector<Variable*> const &vs, vector<Constraint *> const &cs) 105 Variable* v=*i; 116 bool IncSolver::constraintGraphIsCyclic(const unsigned n, Variable* const vs[]) { 117 map<Variable*, node*> varmap; 126 Variable *l=(*c)->left; 131 Variable *r=(*c)->right; 445 Blocks::Blocks(vector<Variable*> const &vs) : vs(vs),nvs(vs.size()) { 464 list<Variable*> *Blocks::totalOrder() { 465 list<Variable*> *orde [all...] |
H A D | orthogonal.cpp | 179 Variable *variable; 2223 currSegment->variable = new Variable(varID, idealPos, weight); 2236 Variable *prevVar = prevSeg->variable; 2262 vs.push_back(new Variable(fixedID, 2272 vs.push_back(new Variable(fixedID,
|
/inkscape/src/libcola/ |
H A D | gradient_projection.h | 13 typedef std::vector<vpsc::Variable*> Variables; 41 vpsc::Variable* variable; 50 vpsc::Variable* vl, * vr; 52 vs.push_back(vl=new vpsc::Variable(vs.size(), leftMargin, weight)); 53 vs.push_back(vr=new vpsc::Variable(vs.size(), rightMargin, weight)); 119 left = new vpsc::Variable(vars.size(),place_l,weight); 121 right = new vpsc::Variable(vars.size(),place_r,weight); 125 vpsc::Variable* v = vars[(*cit).first]; 130 vpsc::Variable* v = vars[(*cit).first]; 183 vpsc::Variable* lef [all...] |
H A D | gradient_projection.cpp | 38 * the Variable Placement with Separation Constraints problem. 165 // Setup an instance of the Variable Placement with Separation Constraints 179 Variable** vs = new Variable*[vars.size()]; 221 const Variable* const* vs = vpsc->getVariables(n);
|