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
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
|
/*
simple-spacer.cc -- implement Simple_spacer
source file of the GNU LilyPond music typesetter
(c) 1999--2006 Han-Wen Nienhuys <hanwen@xs4all.nl>
TODO:
- add support for different stretch/shrink constants?
*/
#include <cstdio>
#include "column-x-positions.hh"
#include "dimensions.hh"
#include "international.hh"
#include "libc-extension.hh" // isinf
#include "paper-column.hh"
#include "simple-spacer.hh"
#include "spaceable-grob.hh"
#include "spring.hh"
#include "warn.hh"
/*
A simple spacing constraint solver. The approach:
Stretch the line uniformly until none of the constraints (rods)
block. It then is very wide.
Compress until the next constraint blocks,
Mark the springs over the constrained part to be non-active.
Repeat with the smaller set of non-active constraints, until all
constraints blocked, or until the line is as short as desired.
This is much simpler, and much much faster than full scale
Constrained QP. On the other hand, a situation like this will not
be typeset as dense as possible, because
c4 c4 c4 c4
veryveryverylongsyllable2 veryveryverylongsyllable2
" "4 veryveryverylongsyllable2 syllable4
can be further compressed to
c4 c4 c4 c4
veryveryverylongsyllable2 veryveryverylongsyllable2
" "4 veryveryverylongsyllable2 syllable4
Perhaps this is not a bad thing, because the 1st looks better anyway. */
/*
positive force = expanding, negative force = compressing.
*/
Simple_spacer::Simple_spacer ()
{
line_len_ = 0.0;
force_ = 0.0;
fits_ = true;
ragged_ = true;
}
Real
Simple_spacer::force () const
{
return force_;
}
bool
Simple_spacer::fits () const
{
return fits_;
}
Real
Simple_spacer::rod_force (int l, int r, Real dist)
{
Real c = range_stiffness (l, r);
Real d = range_ideal_len (l, r);
Real block_stretch = dist - d;
return c * block_stretch;
}
void
Simple_spacer::add_rod (int l, int r, Real dist)
{
if (isinf (dist) || isnan (dist))
{
programming_error ("ignoring weird minimum distance");
return;
}
Real block_force = rod_force (l, r, dist);
if (isinf (block_force))
{
Real spring_dist = range_ideal_len (l, r);
if (spring_dist < dist)
for (int i = l; i < r; i++)
springs_[i].ideal_ *= dist / spring_dist;
return;
}
force_ = max (force_, block_force);
for (int i = l; i < r; i++)
springs_[i].block_force_ = max (block_force, springs_[i].block_force_);
}
Real
Simple_spacer::range_ideal_len (int l, int r) const
{
Real d = 0.;
for (int i = l; i < r; i++)
d += springs_[i].ideal_;
return d;
}
Real
Simple_spacer::range_stiffness (int l, int r) const
{
Real den = 0.0;
for (int i = l; i < r; i++)
den += springs_[i].inverse_hooke_;
return 1 / den;
}
Real
Simple_spacer::configuration_length (Real force) const
{
Real l = 0.;
for (vsize i = 0; i < springs_.size (); i++)
l += springs_[i].length (force);
return l;
}
void
Simple_spacer::solve (Real line_len, bool ragged)
{
Real conf = configuration_length (force_);
ragged_ = ragged;
line_len_ = line_len;
if (ragged)
{
force_ = 0;
fits_ = configuration_length (force_) <= line_len_;
/* we need to calculate a force here to prevent a bunch of short lines */
if (fits_)
force_ = expand_line ();
}
else if (conf < line_len_)
force_ = expand_line ();
else if (conf > line_len_)
force_ = compress_line ();
}
Real
Simple_spacer::expand_line ()
{
double inv_hooke = 0;
double cur_len = configuration_length (force_);
fits_ = true;
for (vsize i=0; i < springs_.size (); i++)
inv_hooke += springs_[i].inverse_hooke_;
assert (cur_len <= line_len_);
return (line_len_ - cur_len) / inv_hooke + force_;
}
Real
Simple_spacer::compress_line ()
{
double inv_hooke = 0;
double cur_len = configuration_length (force_);
double cur_force = force_;
fits_ = true;
for (vsize i=0; i < springs_.size (); i++)
inv_hooke += springs_[i].inverse_hooke_;
assert (line_len_ <= cur_len);
vector<Spring_description> sorted_springs = springs_;
sort (sorted_springs.begin (), sorted_springs.end (), greater<Spring_description> ());
for (vsize i = 0; i < sorted_springs.size (); i++)
{
Spring_description sp = sorted_springs[i];
assert (sp.block_force_ <= cur_force);
if (isinf (sp.block_force_))
break;
double block_dist = (cur_force - sp.block_force_) * inv_hooke;
if (cur_len - block_dist < line_len_)
{
cur_force += (line_len_ - cur_len) / inv_hooke;
cur_len = line_len_;
/*
Paranoia check.
*/
assert (fabs (configuration_length (cur_force) - cur_len) < 1e-6);
return cur_force;
}
cur_len -= block_dist;
inv_hooke -= sp.inverse_hooke_;
cur_force = sp.block_force_;
}
fits_ = false;
return cur_force;
}
void
Simple_spacer::add_spring (Real ideal, Real inverse_hooke)
{
Spring_description description;
description.ideal_ = ideal;
description.inverse_hooke_ = inverse_hooke;
if (!description.is_sane ())
{
programming_error ("insane spring found, setting to unit");
description.inverse_hooke_ = 1.0;
description.ideal_ = 1.0;
}
description.block_force_ = -description.ideal_ / description.inverse_hooke_;
// block at distance 0
springs_.push_back (description);
}
vector<Real>
Simple_spacer::spring_positions () const
{
vector<Real> ret;
ret.push_back (0.);
for (vsize i = 0; i < springs_.size (); i++)
ret.push_back (ret.back () + springs_[i].length (ragged_ ? 0.0 : force_));
return ret;
}
/****************************************************************/
Spring_description::Spring_description ()
{
ideal_ = 0.0;
inverse_hooke_ = 0.0;
block_force_ = 0.0;
}
bool
Spring_description::is_sane () const
{
return (inverse_hooke_ >= 0)
&& ideal_ > 0
&& !isinf (ideal_) && !isnan (ideal_)
&& (inverse_hooke_ == 0.0 || fabs (inverse_hooke_) > 1e-8)
;
}
Real
Spring_description::length (Real f) const
{
return ideal_ + max (f, block_force_) * inverse_hooke_;
}
/****************************************************************/
/*
TODO: should a add penalty for widely varying spring forces (caused
by constraints, eg.
. =====
. | |
.o|o|x ##x
.
The ## forces the notes apart; we shouldn't allow the O's to touch
this closely.
*/
struct Rod_description
{
vsize r_;
Real dist_;
bool operator< (const Rod_description r)
{
return r_ < r.r_;
}
Rod_description ()
{
r_ = 0;
dist_ = 0;
}
Rod_description (vsize r, Real d)
{
r_ = r;
dist_ = d;
}
};
struct Column_description
{
vector<Rod_description> rods_;
vector<Rod_description> end_rods_; /* use these if they end at the last column of the line */
Real ideal_;
Real inverse_hooke_;
Real end_ideal_;
Real end_inverse_hooke_;
SCM break_permission_;
Interval keep_inside_line_;
Column_description ()
{
ideal_ = 0;
inverse_hooke_ = 0;
end_ideal_ = 0;
end_inverse_hooke_ = 0;
break_permission_ = SCM_EOL;
}
};
static int compare_paper_column_rank (Grob *const &a, Grob *const &b);
static bool
is_loose (Grob *g)
{
return (scm_is_pair (g->get_object ("between-cols")));
}
static Grob*
maybe_find_prebroken_piece (Grob *g, Direction d)
{
Grob *ret = dynamic_cast<Item*> (g)->find_prebroken_piece (d);
if (ret)
return ret;
return g;
}
static Grob*
next_spaceable_column (vector<Grob*> const &list, vsize starting)
{
for (vsize i = starting+1; i < list.size (); i++)
if (!is_loose (list[i]))
return list[i];
return 0;
}
/* this only returns non-NULL if the line-ending column is the next
spaceable-or-breakable column */
static Grob*
next_line_ending_column (vector<Grob*> const &list, vsize starting)
{
vsize i = starting + 1;
for (; i < list.size ()
&& is_loose (list[i])
&& !Paper_column::is_breakable (list[i]);
i++)
;
return dynamic_cast<Item*> (list[i])->find_prebroken_piece (LEFT);
}
static void
get_column_spring (Grob *this_col, Grob *next_col, Real *ideal, Real *inv_hooke)
{
Spring_smob *spring = 0;
for (SCM s = this_col->get_object ("ideal-distances");
!spring && scm_is_pair (s);
s = scm_cdr (s))
{
Spring_smob *sp = unsmob_spring (scm_car (s));
if (sp->other_ == next_col)
spring = sp;
}
if (!spring)
programming_error (_f ("No spring between column %d and next one",
Paper_column::get_rank (this_col)));
*ideal = (spring) ? spring->distance_ : 5.0;
*inv_hooke = (spring) ? spring->inverse_strength_ : 1.0;
}
static Column_description
get_column_description (vector<Grob*> const &cols, vsize col_index, bool line_starter)
{
Grob *col = cols[col_index];
if (line_starter)
col = maybe_find_prebroken_piece (col, RIGHT);
Column_description description;
Grob *next_col = next_spaceable_column (cols, col_index);
if (next_col)
get_column_spring (col, next_col, &description.ideal_, &description.inverse_hooke_);
Grob *end_col = next_line_ending_column (cols, col_index);
if (end_col)
get_column_spring (col, end_col, &description.end_ideal_, &description.end_inverse_hooke_);
for (SCM s = Spaceable_grob::get_minimum_distances (col);
scm_is_pair (s); s = scm_cdr (s))
{
Grob *other = unsmob_grob (scm_caar (s));
vsize j = binary_search (cols, other, &compare_paper_column_rank, col_index);
if (j != VPOS)
{
if (cols[j] == other)
description.rods_.push_back (Rod_description (j, scm_to_double (scm_cdar (s))));
else /* it must end at the LEFT prebroken_piece */
description.end_rods_.push_back (Rod_description (j, scm_to_double (scm_cdar (s))));
}
}
if (!line_starter && to_boolean (col->get_property ("keep-inside-line")))
description.keep_inside_line_ = col->extent (col, X_AXIS);
description.break_permission_ = col->get_property ("line-break-permission");
return description;
}
vector<Real>
get_line_forces (vector<Grob*> const &icols, vector<vsize> breaks,
Real line_len, Real indent, bool ragged)
{
vector<Real> force;
force.resize (breaks.size () * breaks.size (), infinity_f);
vector<Column_description> cols;
vsize b = 1;
SCM force_break = ly_symbol2scm ("force");
cols.push_back (Column_description ());
for (vsize i = 1; i < icols.size () - 1; i++)
{
if (b < breaks.size () && breaks[b] == i)
{
breaks[b] = cols.size ();
b++;
}
if (!is_loose (icols[i]))
cols.push_back (get_column_description (icols, i, false));
}
breaks.back () = cols.size () - 1;
for (vsize b = 0; b < breaks.size () - 1; b++)
{
cols[breaks[b]] = get_column_description (icols, breaks[b], true);
vsize st = breaks[b];
for (vsize c = b+1; c < breaks.size (); c++)
{
vsize end = breaks[c];
Simple_spacer spacer;
for (vsize i = breaks[b]; i < end - 1; i++)
spacer.add_spring (cols[i].ideal_, cols[i].inverse_hooke_);
spacer.add_spring (cols[end-1].end_ideal_, cols[end-1].inverse_hooke_);
for (vsize i = breaks[b]; i < end; i++)
{
for (vsize r = 0; r < cols[i].rods_.size (); r++)
if (cols[i].rods_[r].r_ < end)
spacer.add_rod (i - st, cols[i].rods_[r].r_ - st, cols[i].rods_[r].dist_);
for (vsize r = 0; r < cols[i].end_rods_.size (); r++)
if (cols[i].end_rods_[r].r_ == end)
spacer.add_rod (i - st, end - st, cols[i].end_rods_[r].dist_);
if (!cols[i].keep_inside_line_.is_empty ())
{
spacer.add_rod (i - st, end - st, cols[i].keep_inside_line_[RIGHT]);
spacer.add_rod (0, i - st, cols[i].keep_inside_line_[LEFT]);
}
}
spacer.solve ((b == 0) ? line_len - indent : line_len, ragged);
force[b * breaks.size () + c] = spacer.force ();
if (cols[end].break_permission_ == force_break)
break;
if (!spacer.fits ())
{
force[b * breaks.size () + c] = infinity_f;
break;
}
}
}
return force;
}
Column_x_positions
get_line_configuration (vector<Grob*> const &columns,
Real line_len,
Real indent,
bool ragged)
{
vector<Column_description> cols;
Simple_spacer spacer;
Column_x_positions ret;
ret.cols_.push_back (dynamic_cast<Item*> (columns[0])->find_prebroken_piece (RIGHT));
for (vsize i = 1; i < columns.size () - 1; i++)
{
if (is_loose (columns[i]))
ret.loose_cols_.push_back (columns[i]);
else
ret.cols_.push_back (columns[i]);
}
ret.cols_.push_back (dynamic_cast<Item*> (columns.back ())->find_prebroken_piece (LEFT));
/* since we've already put our line-ending column in the column list, we can ignore
the end_XXX_ fields of our column_description */
for (vsize i = 0; i < ret.cols_.size () - 1; i++)
{
cols.push_back (get_column_description (ret.cols_, i, i == 0));
spacer.add_spring (cols[i].ideal_, cols[i].inverse_hooke_);
}
for (vsize i = 0; i < cols.size (); i++)
{
for (vsize r = 0; r < cols[i].rods_.size (); r++)
spacer.add_rod (i, cols[i].rods_[r].r_, cols[i].rods_[r].dist_);
if (!cols[i].keep_inside_line_.is_empty ())
{
spacer.add_rod (i, cols.size (), cols[i].keep_inside_line_[RIGHT]);
spacer.add_rod (0, i, cols[i].keep_inside_line_[LEFT]);
}
}
spacer.solve (line_len, ragged);
ret.force_ = spacer.force ();
/*
We used to have a penalty for compression, no matter what, but that
fucked up wtk1-fugue2 (taking 3 full pages.)
*/
ret.config_ = spacer.spring_positions ();
for (vsize i = 0; i < ret.config_.size (); i++)
ret.config_[i] += indent;
ret.satisfies_constraints_ = spacer.fits ();
/*
Check if breaking constraints are met.
*/
for (vsize i = 1; i < ret.cols_.size () - 1; i++)
{
SCM p = ret.cols_[i]->get_property ("line-break-permission");
if (p == ly_symbol2scm ("force"))
ret.satisfies_constraints_ = false;
}
return ret;
}
static int
compare_paper_column_rank (Grob *const &a,
Grob *const &b)
{
return Paper_column::get_rank (a) - Paper_column::get_rank (b);
}
|