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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
|
/*
* y coordinates
*/
#include <dag.h>
#ifdef DMALLOC
#include "dmalloc.h"
#endif
int dd_map_coord_to_rank(ddview_t *view, double y)
{
int r, minr, maxr, rv;
double baseline, bestrank, bestdist, d, rankht, ranksep;
rank_t *rd;
maxr = view->config->high;
minr = view->config->low;
ranksep = dd_ranksep(view);
if (minr > maxr) { /* no config exists yet */
bestrank = y / ranksep;
rv = ROUND(bestrank);
rd = dd_extendrank(view,rv); /* make this the first rank */
rd->y_base = y;
view->prev_low_rank = rv;
return rv;
}
rd = dd_rankd(view,minr);
if (y < rd->y_base - rd->delta_above - ranksep) {
/* above min rank */
rankht = ranksep + rd->delta_above + rd->delta_below;
bestrank = minr - (rd->y_base - y) / rankht;
rv = ROUND(bestrank);
return rv;
}
rd = dd_rankd(view,maxr);
if (y > rd->y_base + rd->delta_below + ranksep) {
/* below max rank */
rankht = ranksep + rd->delta_above + rd->delta_below;
bestrank = maxr + (y - rd->y_base) / rankht;
rv = ROUND(bestrank);
return rv;
}
/* somewhere in between */
bestrank = minr;
bestdist = MAXDOUBLE;
for (r = minr; r <= maxr; r++) {
baseline = dd_rankd(view,r)->y_base;
if ((d = fabs(y - baseline)) < bestdist) {bestdist = d; bestrank = r;}
}
rv = ROUND(bestrank);
return rv;
}
static void reset_rank_box(ddview_t *view, int r)
{
int i;
rank_t *rd;
Agnode_t *n,**list;
double nht, max_node_ht;
max_node_ht = BASE(view)->client->separation.y / 10.0;
rd = dd_rankd(view,r);
list = rd->v;
for (i = 0; i < rd->n; i++) {
n = list[i];
if (dd_is_a_vnode(n)) continue;
nht = dd_nodesize(view,n).y;
if (max_node_ht < nht) max_node_ht = nht;
}
rd->delta_above = rd->delta_below = max_node_ht/2.0;
rd->space_below = dd_ranksep(view);
}
static void reset_baselines(ddview_t *view)
{
int r,base;
rank_t *rd,*rd_prev,*rd_base;
base = view->prev_low_rank;
if (base == MAXINT)
base = view->config->low;
rd_base = dd_rankd(view,base);
/* work upward from base rank */
rd_prev = rd_base;
for (r = base - 1; r >= view->config->low; r--) {
rd = dd_rankd(view,r);
rd->y_base = rd_prev->y_base - rd_prev->delta_above
- rd->space_below - rd->delta_above;
rd_prev = rd;
}
rd_prev = rd_base;
for (r = base + 1; r <= view->config->high; r++) {
rd = dd_rankd(view,r);
rd->y_base = rd_prev->y_base + rd_prev->delta_below
+ rd_prev->space_below + rd->delta_above;
rd_prev = rd;
}
view->prev_low_rank = view->config->low;
}
void dd_update_Y(ddview_t *view)
{
int i,r;
rank_t *rd;
double baseline,old_pos;
Agnode_t *n,**list;
for (r = view->config->low; r <= view->config->high; r++)
reset_rank_box(view, r);
reset_baselines(view);
for (r = view->config->low; r <= view->config->high; r++)
{
rd = dd_rankd(view,r);
if (rd->n <= 0) continue;
baseline = rd->y_base;
list = rd->v;
for (i = 0; i < rd->n; i++) {
n = list[i];
old_pos = dd_pos(n).y;
dd_set_y(n,baseline);
if ((old_pos != baseline) && NOT(dd_is_a_vnode(n))) {
il_register_node_callback(BASE(view),dd_nspec(n),IL_MOD);
}
}
}
}
|
