1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
|
/**
* \brief A constraint determines a minimum or exact spacing required between
* two variables.
*
* Authors:
* Tim Dwyer <tgdwyer@gmail.com>
*
* Copyright (C) 2005 Authors
*
* This version is released under the CPL (Common Public License) with
* the Graphviz distribution.
* A version is also available under the LGPL as part of the Adaptagrams
* project: https://github.com/mjwybrow/adaptagrams.
* If you make improvements or bug fixes to this code it would be much
* appreciated if you could also contribute those changes back to the
* Adaptagrams repository.
*/
#pragma once
#include <iostream>
#include <vpsc/variable.h>
struct Constraint
{
friend std::ostream& operator <<(std::ostream &os,const Constraint &c);
public:
Variable *left;
Variable *right;
double gap;
double lm;
Constraint(Variable *left, Variable *right, double gap);
~Constraint();
double slack() const { return right->position() - gap - left->position(); }
long timeStamp;
bool active;
bool visited;
};
#include <float.h>
#include <vpsc/block.h>
static inline bool compareConstraints(const Constraint *const l,
const Constraint *const r) {
double const sl =
l->left->block->timeStamp > l->timeStamp
||l->left->block==l->right->block
?-DBL_MAX:l->slack();
double const sr =
r->left->block->timeStamp > r->timeStamp
||r->left->block==r->right->block
?-DBL_MAX:r->slack();
if(sl==sr) {
// arbitrary choice based on id
if(l->left->id==r->left->id) {
if(l->right->id<r->right->id) return true;
return false;
}
if(l->left->id<r->left->id) return true;
return false;
}
return sl < sr;
}
|
