block.h revision 6af8609f35d86944763dc80141002c548984b2ed
/**
* \brief A block is a group of variables that must be moved together to improve
* the goal function without violating already active constraints.
* The variables in a block are spanned by a tree of active constraints.
*
* Authors:
* Tim Dwyer <tgdwyer@gmail.com>
*
* Copyright (C) 2005 Authors
*
* Released under GNU LGPL. Read the file 'COPYING' for more information.
*/
#ifndef SEEN_REMOVEOVERLAP_BLOCK_H
#define SEEN_REMOVEOVERLAP_BLOCK_H
#include <vector>
#include <iostream>
class Variable;
class Constraint;
template <class T> class PairingHeap;
class StupidPriorityQueue;
class Block
{
friend std::ostream& operator <<(std::ostream &os,const Block &b);
public:
std::vector<Variable*> *vars;
double posn;
double weight;
double wposn;
Block(Variable *v=NULL);
~Block(void);
Constraint* findMinLM();
Constraint* findMinLMBetween(Variable* lv, Variable* rv);
Constraint* findMinInConstraint();
Constraint* findMinOutConstraint();
void deleteMinInConstraint();
void deleteMinOutConstraint();
double desiredWeightedPosition();
void merge(Block *b, Constraint *c, double dist);
void merge(Block *b, Constraint *c);
void mergeIn(Block *b);
void mergeOut(Block *b);
void split(Block *&l, Block *&r, Constraint *c);
Constraint* splitBetween(Variable* vl, Variable* vr, Block* &lb, Block* &rb);
void setUpInConstraints();
void setUpOutConstraints();
double cost();
bool deleted;
long timeStamp;
PairingHeap<Constraint*> *in;
PairingHeap<Constraint*> *out;
private:
typedef enum {NONE, LEFT, RIGHT} Direction;
typedef std::pair<double, Constraint*> Pair;
void reset_active_lm(Variable *v, Variable *u);
double compute_dfdv(Variable *v, Variable *u, Constraint *&min_lm);
Pair compute_dfdv_between(
Variable*, Variable*, Variable*, Direction, bool);
bool canFollowLeft(Constraint *c, Variable *last);
bool canFollowRight(Constraint *c, Variable *last);
void populateSplitBlock(Block *b, Variable *v, Variable *u);
void addVariable(Variable *v);
void setUpConstraintHeap(PairingHeap<Constraint*>* &h,bool in);
};
#endif // SEEN_REMOVEOVERLAP_BLOCK_H