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
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
|
/*
* Dillo Widget
*
* Copyright 2005-2007, 2012-2013 Sebastian Geerken <sgeerken@dillo.org>
*
* (Parts of this file were originally part of textblock.cc.)
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "textblock.hh"
#include "hyphenator.hh"
#include "../lout/msg.h"
#include "../lout/misc.hh"
#include <stdio.h>
#include <math.h>
using namespace lout;
namespace dw {
int Textblock::BadnessAndPenalty::badnessValue (int infLevel)
{
switch (badnessState) {
case NOT_STRETCHABLE:
return infLevel == INF_NOT_STRETCHABLE ? 1 : 0;
case QUITE_LOOSE:
return infLevel == INF_LARGE ? 1 : 0;
case BADNESS_VALUE:
return infLevel == INF_VALUE ? badness : 0;
case TOO_TIGHT:
return infLevel == INF_TOO_TIGHT ? 1 : 0;
}
// compiler happiness
lout::misc::assertNotReached ();
return 0;
}
int Textblock::BadnessAndPenalty::penaltyValue (int index, int infLevel)
{
if (penalty[index] == INT_MIN)
return infLevel == INF_PENALTIES ? -1 : 0;
else if (penalty[index] == INT_MAX)
return infLevel == INF_PENALTIES ? 1 : 0;
else
return infLevel == INF_VALUE ? penalty[index] : 0;
}
void Textblock::BadnessAndPenalty::calcBadness (int totalWidth, int idealWidth,
int totalStretchability,
int totalShrinkability)
{
#ifdef DEBUG
this->totalWidth = totalWidth;
this->idealWidth = idealWidth;
this->totalStretchability = totalStretchability;
this->totalShrinkability = totalShrinkability;
#endif
ratio = 0; // because this is used in print()
if (totalWidth == idealWidth) {
badnessState = BADNESS_VALUE;
badness = 0;
} else if (totalWidth < idealWidth) {
if (totalStretchability == 0)
badnessState = NOT_STRETCHABLE;
else {
ratio = 100 * (idealWidth - totalWidth) / totalStretchability;
if (ratio > 1024)
badnessState = QUITE_LOOSE;
else {
badnessState = BADNESS_VALUE;
badness = ratio * ratio * ratio;
}
}
} else { // if (totalWidth > availWidth)
if (totalShrinkability == 0)
badnessState = TOO_TIGHT;
else {
// ratio is negative here
ratio = 100 * (idealWidth - totalWidth) / totalShrinkability;
if (ratio <= - 100)
badnessState = TOO_TIGHT;
else {
badnessState = BADNESS_VALUE;
badness = - ratio * ratio * ratio;
}
}
}
}
/**
* Sets the penalty, multiplied by 100. Multiplication is necessary
* to deal with fractional numbers, without having to use floating
* point numbers. So, to set a penalty to 0.5, pass 50.
*
* INT_MAX and INT_MIN (representing inf and -inf, respectively) are
* also allowed.
*
* The definition of penalties depends on the definition of badness,
* which adheres to the description in \ref dw-line-breaking, section
* "Criteria for Line-Breaking". The exact calculation may vary, but
* this definition of should be rather stable: (i) A perfectly
* fitting line has a badness of 0. (ii) A line, where all spaces
* are extended by exactly the stretchability, as well as a line, where
* all spaces are reduced by the shrinkability, have a badness of 1.
*
* (TODO plural: penalties, not penalty. Correct above comment)
*/
void Textblock::BadnessAndPenalty::setPenalties (int penalty1, int penalty2)
{
// TODO Check here some cases, e.g. both or no penalty INT_MIN.
setSinglePenalty(0, penalty1);
setSinglePenalty(1, penalty2);
}
void Textblock::BadnessAndPenalty::setSinglePenalty (int index, int penalty)
{
if (penalty == INT_MAX || penalty == INT_MIN)
this->penalty[index] = penalty;
else
// This factor consists of: (i) 100^3, since in calcBadness(), the
// ratio is multiplied with 100 (again, to use integer numbers for
// fractional numbers), and the badness (which has to be compared
// to the penalty!) is the third power or it; (ii) the denominator
// 100, of course, since 100 times the penalty is passed to this
// method.
this->penalty[index] = penalty * (100 * 100 * 100 / 100);
}
bool Textblock::BadnessAndPenalty::lineLoose ()
{
return
badnessState == NOT_STRETCHABLE || badnessState == QUITE_LOOSE ||
(badnessState == BADNESS_VALUE && ratio > 0);
}
bool Textblock::BadnessAndPenalty::lineTight ()
{
return
badnessState == TOO_TIGHT || (badnessState == BADNESS_VALUE && ratio < 0);
}
bool Textblock::BadnessAndPenalty::lineTooTight ()
{
return badnessState == TOO_TIGHT;
}
bool Textblock::BadnessAndPenalty::lineMustBeBroken (int penaltyIndex)
{
return penalty[penaltyIndex] == PENALTY_FORCE_BREAK;
}
bool Textblock::BadnessAndPenalty::lineCanBeBroken (int penaltyIndex)
{
return penalty[penaltyIndex] != PENALTY_PROHIBIT_BREAK;
}
int Textblock::BadnessAndPenalty::compareTo (int penaltyIndex,
BadnessAndPenalty *other)
{
for (int l = INF_MAX; l >= 0; l--) {
int thisValue = badnessValue (l) + penaltyValue (penaltyIndex, l);
int otherValue =
other->badnessValue (l) + other->penaltyValue (penaltyIndex, l);
if (thisValue != otherValue)
return thisValue - otherValue;
}
return 0;
}
void Textblock::BadnessAndPenalty::print ()
{
switch (badnessState) {
case NOT_STRETCHABLE:
printf ("not stretchable");
break;
case TOO_TIGHT:
printf ("too tight");
break;
case QUITE_LOOSE:
printf ("quite loose (ratio = %d)", ratio);
break;
case BADNESS_VALUE:
printf ("%d", badness);
break;
}
#ifdef DEBUG
printf (" [%d + %d - %d vs. %d]",
totalWidth, totalStretchability, totalShrinkability, idealWidth);
#endif
printf (" + (");
for (int i = 0; i < 2; i++) {
if (penalty[i] == INT_MIN)
printf ("-inf");
else if (penalty[i] == INT_MAX)
printf ("inf");
else
printf ("%d", penalty[i]);
if (i == 0)
printf (", ");
}
printf (")");
}
void Textblock::printWordShort (Word *word)
{
switch(word->content.type) {
case core::Content::TEXT:
printf ("\"%s\"", word->content.text);
break;
case core::Content::WIDGET:
printf ("<widget: %p (%s)>",
word->content.widget, word->content.widget->getClassName());
break;
case core::Content::BREAK:
printf ("<break>");
break;
default:
printf ("<?>");
break;
}
}
void Textblock::printWordFlags (short flags)
{
printf ("%s:%s:%s:%s:%s:%s:%s",
(flags & Word::CAN_BE_HYPHENATED) ? "h?" : "--",
(flags & Word::DIV_CHAR_AT_EOL) ? "de" : "--",
(flags & Word::PERM_DIV_CHAR) ? "dp" : "--",
(flags & Word::DRAW_AS_ONE_TEXT) ? "t1" : "--",
(flags & Word::UNBREAKABLE_FOR_MIN_WIDTH) ? "um" : "--",
(flags & Word::WORD_START) ? "st" : "--",
(flags & Word::WORD_END) ? "en" : "--");
}
void Textblock::printWordWithFlags (Word *word)
{
printWordShort (word);
printf (" (flags = ");
printWordFlags (word->flags);
printf (")");
}
void Textblock::printWord (Word *word)
{
printWordWithFlags (word);
printf (" [%d / %d + %d - %d => %d + %d - %d] => ",
word->size.width, word->origSpace, getSpaceStretchability(word),
getSpaceShrinkability(word), word->totalWidth,
word->totalSpaceStretchability, word->totalSpaceShrinkability);
word->badnessAndPenalty.print ();
}
/*
* ...
*
* diff ...
*/
void Textblock::justifyLine (Line *line, int diff)
{
/* To avoid rounding errors, the calculation is based on accumulated
* values. */
if (diff > 0) {
int spaceStretchabilitySum = 0;
for (int i = line->firstWord; i < line->lastWord; i++)
spaceStretchabilitySum += getSpaceStretchability(words->getRef(i));
if (spaceStretchabilitySum > 0) {
int spaceStretchabilityCum = 0;
int spaceDiffCum = 0;
for (int i = line->firstWord; i < line->lastWord; i++) {
Word *word = words->getRef (i);
spaceStretchabilityCum += getSpaceStretchability(word);
int spaceDiff =
spaceStretchabilityCum * diff / spaceStretchabilitySum
- spaceDiffCum;
spaceDiffCum += spaceDiff;
PRINTF (" %d (of %d): diff = %d\n", i, words->size (),
spaceDiff);
word->effSpace = word->origSpace + spaceDiff;
}
}
} else if (diff < 0) {
int spaceShrinkabilitySum = 0;
for (int i = line->firstWord; i < line->lastWord; i++)
spaceShrinkabilitySum += getSpaceShrinkability(words->getRef(i));
if (spaceShrinkabilitySum > 0) {
int spaceShrinkabilityCum = 0;
int spaceDiffCum = 0;
for (int i = line->firstWord; i < line->lastWord; i++) {
Word *word = words->getRef (i);
spaceShrinkabilityCum += getSpaceShrinkability(word);
int spaceDiff =
spaceShrinkabilityCum * diff / spaceShrinkabilitySum
- spaceDiffCum;
spaceDiffCum += spaceDiff;
word->effSpace = word->origSpace + spaceDiff;
}
}
}
}
Textblock::Line *Textblock::addLine (int firstWord, int lastWord,
bool temporary)
{
PRINTF ("[%p] ADD_LINE (%d, %d) => %d\n",
this, firstWord, lastWord, lines->size ());
Word *lastWordOfLine = words->getRef(lastWord);
// Word::totalWidth includes the hyphen (which is what we want here).
int lineWidth = lastWordOfLine->totalWidth;
// "lineWidth" is relative to leftOffset, so we may have to add
// "line1OffsetEff" (remember: this is, for list items, negative).
if (lines->size () == 0)
lineWidth += line1OffsetEff;
int maxOfMinWidth, sumOfMaxWidth;
accumulateWordExtremes (firstWord, lastWord, &maxOfMinWidth,
&sumOfMaxWidth);
PRINTF (" words[%d]->totalWidth = %d\n", lastWord,
lastWordOfLine->totalWidth);
PRINTF ("[%p] ##### LINE ADDED: %d, from %d to %d #####\n",
this, lines->size (), firstWord, lastWord);
lines->increase ();
if(!temporary) {
// If the last line was temporary, this will be temporary, too, even
// if not requested.
if (lines->size () == 1 || nonTemporaryLines == lines->size () -1)
nonTemporaryLines = lines->size ();
}
PRINTF ("nonTemporaryLines = %d\n", nonTemporaryLines);
int lineIndex = lines->size () - 1;
Line *line = lines->getRef (lineIndex);
line->firstWord = firstWord;
line->lastWord = lastWord;
line->boxAscent = line->contentAscent = 0;
line->boxDescent = line->contentDescent = 0;
line->marginDescent = 0;
line->breakSpace = 0;
line->leftOffset = 0;
alignLine (lineIndex);
for (int i = line->firstWord; i < line->lastWord; i++) {
Word *word = words->getRef (i);
lineWidth += (word->effSpace - word->origSpace);
}
if (lines->size () == 1) {
// first line
line->top = 0;
line->maxLineWidth = lineWidth;
} else {
Line *prevLine = lines->getRef (lines->size () - 2);
line->top = prevLine->top + prevLine->boxAscent +
prevLine->boxDescent + prevLine->breakSpace;
line->maxLineWidth = misc::max (lineWidth, prevLine->maxLineWidth);
}
for(int i = line->firstWord; i <= line->lastWord; i++)
accumulateWordForLine (lineIndex, i);
PRINTF (" line[%d].top = %d\n", lines->size () - 1, line->top);
PRINTF (" line[%d].boxAscent = %d\n", lines->size () - 1, line->boxAscent);
PRINTF (" line[%d].boxDescent = %d\n",
lines->size () - 1, line->boxDescent);
PRINTF (" line[%d].contentAscent = %d\n", lines->size () - 1,
line->contentAscent);
PRINTF (" line[%d].contentDescent = %d\n",
lines->size () - 1, line->contentDescent);
PRINTF (" line[%d].maxLineWidth = %d\n",
lines->size () - 1, line->maxLineWidth);
mustQueueResize = true;
//printWordShort (words->getRef (line->firstWord));
//printf (" ... ");
//printWordShort (words->getRef (line->lastWord));
//printf (": ");
//words->getRef(line->lastWord)->badnessAndPenalty.print ();
//printf ("\n");
int xWidget = lineXOffsetWidget(line);
for (int i = firstWord; i <= lastWord; i++) {
Word *word = words->getRef (i);
if (word->wordImgRenderer)
word->wordImgRenderer->setData (xWidget, lines->size () - 1);
if (word->spaceImgRenderer)
word->spaceImgRenderer->setData (xWidget, lines->size () - 1);
xWidget += word->size.width + word->effSpace;
}
return line;
}
void Textblock::accumulateWordExtremes (int firstWord, int lastWord,
int *maxOfMinWidth, int *sumOfMaxWidth)
{
int parMin = 0;
*maxOfMinWidth = *sumOfMaxWidth = 0;
for (int i = firstWord; i <= lastWord; i++) {
Word *word = words->getRef (i);
bool atLastWord = i == lastWord;
core::Extremes extremes;
getWordExtremes (word, &extremes);
// Minimum: between two *possible* breaks (or at the end).
// TODO This is redundant to getExtremesImpl().
// TODO: Again, index 1 is used for lineCanBeBroken(). See getExtremes().
if (word->badnessAndPenalty.lineCanBeBroken (1) || atLastWord) {
parMin += extremes.minWidth + word->hyphenWidth;
*maxOfMinWidth = misc::max (*maxOfMinWidth, parMin);
parMin = 0;
} else
// Shrinkability could be considered, but really does not play a
// role.
parMin += extremes.minWidth + word->origSpace;
//printf ("[%p] after word: ", this);
//printWord (word);
//printf ("\n");
//printf ("[%p] (%d / %d) => parMin = %d, maxOfMinWidth = %d\n",
// this, extremes.minWidth, extremes.maxWidth, parMin,
// *maxOfMinWidth);
*sumOfMaxWidth += (extremes.maxWidth + word->origSpace);
// Notice that the last space is added. See also: Line::parMax.
}
}
void Textblock::processWord (int wordIndex)
{
bool wordListChanged = wordWrap (wordIndex, false);
if (wordListChanged) {
// If wordWrap has called hyphenateWord here, this has an effect
// on the call of handleWordExtremes. To avoid adding values
// more than one time (original un-hyphenated word, plus all
// parts of the hyphenated word, except the first one), the
// whole paragraph is recalculated again.
int firstWord;
if (paragraphs->size() > 0) {
firstWord = paragraphs->getLastRef()->firstWord;
paragraphs->setSize (paragraphs->size() - 1);
} else
firstWord = 0;
for (int i = firstWord; i <= wordIndex - 1; i++)
handleWordExtremes (i);
}
handleWordExtremes (wordIndex);
}
/*
* This method is called in two cases: (i) when a word is added
* (ii) when a page has to be (partially) rewrapped. It does word wrap,
* and adds new lines if necessary.
*
* Returns whether the words list has changed at, or before, the word
* index.
*/
bool Textblock::wordWrap (int wordIndex, bool wrapAll)
{
PRINTF ("[%p] WORD_WRAP (%d, %s)\n",
this, wordIndex, wrapAll ? "true" : "false");
Word *word;
bool wordListChanged = false;
if (!wrapAll)
removeTemporaryLines ();
initLine1Offset (wordIndex);
word = words->getRef (wordIndex);
word->effSpace = word->origSpace;
accumulateWordData (wordIndex);
//printf (" ");
//printWord (word);
//printf ("\n");
int penaltyIndex = calcPenaltyIndexForNewLine ();
bool newLine;
do {
bool tempNewLine = false;
int firstIndex =
lines->size() == 0 ? 0 : lines->getLastRef()->lastWord + 1;
int searchUntil;
if (wrapAll && wordIndex >= firstIndex && wordIndex == words->size() -1) {
newLine = true;
searchUntil = wordIndex;
tempNewLine = true;
PRINTF (" NEW LINE: last word\n");
} else if (wordIndex >= firstIndex &&
// TODO: lineMustBeBroken should be independent of
// the penalty index?
word->badnessAndPenalty.lineMustBeBroken (penaltyIndex)) {
newLine = true;
searchUntil = wordIndex;
PRINTF (" NEW LINE: forced break\n");
} else {
// Break the line when too tight, but only when there is a
// possible break point so far. (TODO: I've forgotten the
// original bug which is fixed by this.)
bool possibleLineBreak = false;
for (int i = firstIndex; !possibleLineBreak && i <= wordIndex - 1; i++)
if (words->getRef(i)->badnessAndPenalty
.lineCanBeBroken (penaltyIndex))
possibleLineBreak = true;
if (possibleLineBreak && word->badnessAndPenalty.lineTooTight ()) {
newLine = true;
searchUntil = wordIndex - 1;
PRINTF (" NEW LINE: line too tight\n");
} else
newLine = false;
}
if(!newLine && !wrapAll)
// No new line is added. "mustQueueResize" must,
// nevertheless, be set, so that flush() will call
// queueResize(), and later sizeRequestImpl() is called,
// which then calls showMissingLines(), which eventually
// calls this method again, with wrapAll == true, so that
// newLine is calculated as "true".
mustQueueResize = true;
if(newLine) {
accumulateWordData (wordIndex);
int wordIndexEnd = wordIndex;
bool lineAdded;
do {
int breakPos =
searchMinBap (firstIndex, searchUntil, penaltyIndex, wrapAll);
int hyphenatedWord = considerHyphenation (firstIndex, breakPos);
//printf ("[%p] breakPos = %d (", this, breakPos);
//printWordShort (words->getRef (breakPos));
//printf ("), hyphenatedWord = %d", hyphenatedWord);
//if (hyphenatedWord != -1) {
// printf (" (");
// printWordShort (words->getRef (hyphenatedWord));
// printf (")");
//}
//printf ("\n");
if(hyphenatedWord == -1) {
addLine (firstIndex, breakPos, tempNewLine);
PRINTF ("[%p] new line %d (%s), from %d to %d\n",
this, lines->size() - 1,
tempNewLine ? "temporally" : "permanently",
firstIndex, breakPos);
lineAdded = true;
penaltyIndex = calcPenaltyIndexForNewLine ();
} else {
// TODO hyphenateWord() should return whether something has
// changed at all. So that a second run, with
// !word->canBeHyphenated, is unnecessary.
// TODO Update: for this, searchUntil == 0 should be checked.
PRINTF ("[%p] old searchUntil = %d ...\n", this, searchUntil);
int n = hyphenateWord (hyphenatedWord);
searchUntil += n;
if (hyphenatedWord <= wordIndex)
wordIndexEnd += n;
PRINTF ("[%p] -> new searchUntil = %d ...\n", this, searchUntil);
lineAdded = false;
// update word pointer as hyphenateWord() can trigger a
// reorganization of the words structure
word = words->getRef (wordIndex);
if (n > 0 && hyphenatedWord <= wordIndex)
wordListChanged = true;
}
PRINTF ("[%p] accumulating again from %d to %d\n",
this, breakPos + 1, wordIndexEnd);
for(int i = breakPos + 1; i <= wordIndexEnd; i++)
accumulateWordData (i);
} while(!lineAdded);
}
} while (newLine);
if(word->content.type == core::Content::WIDGET) {
// Set parentRef for the child, when necessary.
//
// parentRef is set for the child already, when a line is
// added. There are a couple of different situations to
// consider, e.g. when called from showMissingLines(), this word
// may already have been added in a previous call. To make
// things simple, we just check whether this word is contained
// within any line, or still "missing".
int firstWordWithoutLine;
if (lines->size() == 0)
firstWordWithoutLine = 0;
else
firstWordWithoutLine = lines->getLastRef()->lastWord + 1;
if (wordIndex >= firstWordWithoutLine) {
word->content.widget->parentRef = lines->size ();
PRINTF ("The %s %p is assigned parentRef = %d.\n",
word->content.widget->getClassName(), word->content.widget,
word->content.widget->parentRef);
}
}
return wordListChanged;
}
int Textblock::searchMinBap (int firstWord, int lastWord, int penaltyIndex,
bool correctAtEnd)
{
PRINTF (" searching from %d to %d\n", firstWord, lastWord);
int pos = -1;
for (int i = firstWord; i <= lastWord; i++) {
Word *w = words->getRef(i);
//printf (" %d (of %d): ", i, words->size ());
//printWord (w);
//printf ("\n");
if (pos == -1 ||
w->badnessAndPenalty.compareTo (penaltyIndex,
&words->getRef(pos)
->badnessAndPenalty) <= 0)
// "<=" instead of "<" in the next lines tends to result in
// more words per line -- theoretically. Practically, the
// case "==" will never occur.
pos = i;
}
PRINTF (" found at %d\n", pos);
if (correctAtEnd && lastWord == words->size () - 1) {
// Since no break and no space is added, the last word will have
// a penalty of inf. Actually, it should be less, since it is
// the last word. However, since more words may follow, the
// penalty is not changed, but here, the search is corrected
// (maybe only temporary).
// (Notice that it was once (temporally) set to -inf, not 0, but
// this will make e.g. test/table-1.html not work.)
Word *w = words->getRef (lastWord);
BadnessAndPenalty correctedBap = w->badnessAndPenalty;
correctedBap.setPenalty (0);
//printf (" corrected bap: ");
//correctedBap.print ();
//printf ("\n");
if (correctedBap.compareTo(penaltyIndex,
&words->getRef(pos)->badnessAndPenalty) <= 0) {
pos = lastWord;
PRINTF (" corrected => %d\n", pos);
}
}
return pos;
}
/**
* Suggest a word to hyphenate, when breaking at breakPos is
* planned. Return a word index or -1, when hyphenation makes no
* sense.
*/
int Textblock::considerHyphenation (int firstIndex, int breakPos)
{
int hyphenatedWord = -1;
Word *wordBreak = words->getRef(breakPos);
//printf ("[%p] line (broken at word %d): ", this, breakPos);
//printWord (wordBreak);
//printf ("\n");
// A tight line: maybe, after hyphenation, some parts of the last
// word of this line can be put into the next line.
if (wordBreak->badnessAndPenalty.lineTight ()) {
// Sometimes, it is not the last word, which must be hyphenated,
// but some word before. Here, we search for the first word
// which can be hyphenated, *and* makes the line too tight.
for (int i = breakPos; i >= firstIndex; i--) {
Word *word1 = words->getRef (i);
if (word1->badnessAndPenalty.lineTight () &&
isHyphenationCandidate (word1))
hyphenatedWord = i;
}
}
// A loose line: maybe, after hyphenation, some parts of the first
// word of the next line can be put into this line.
if (wordBreak->badnessAndPenalty.lineLoose () &&
breakPos + 1 < words->size ()) {
Word *word2 = words->getRef(breakPos + 1);
if (isHyphenationCandidate (word2))
hyphenatedWord = breakPos + 1;
}
return hyphenatedWord;
}
bool Textblock::isHyphenationCandidate (Word *word)
{
return (word->flags & Word::CAN_BE_HYPHENATED) &&
word->style->x_lang[0] &&
isBreakAllowed(word) &&
word->content.type == core::Content::TEXT &&
Hyphenator::isHyphenationCandidate (word->content.text);
}
/**
* Counter part to wordWrap(), but for extremes, not size calculation.
*/
void Textblock::handleWordExtremes (int wordIndex)
{
// TODO Overall, clarify penalty index.
Word *word = words->getRef (wordIndex);
core::Extremes wordExtremes;
getWordExtremes (word, &wordExtremes);
//printf ("[%p] HANDLE_WORD_EXTREMES (%d): ", this, wordIndex);
//printWordWithFlags (word);
//printf (" => %d / %d\n", wordExtremes.minWidth, wordExtremes.maxWidth);
if (wordIndex == 0) {
wordExtremes.minWidth += line1Offset;
wordExtremes.maxWidth += line1Offset;
}
if (paragraphs->size() == 0 ||
words->getRef(paragraphs->getLastRef()->lastWord)
->badnessAndPenalty.lineMustBeBroken (1)) {
// Add a new paragraph.
paragraphs->increase ();
Paragraph *prevPar = paragraphs->size() == 1 ?
NULL : paragraphs->getRef(paragraphs->size() - 2);
Paragraph *par = paragraphs->getLastRef();
par->firstWord = par->lastWord = wordIndex;
par->parMin = par->parMax = 0;
if (prevPar) {
par->maxParMin = prevPar->maxParMin;
par->maxParMax = prevPar->maxParMax;
} else
par->maxParMin = par->maxParMax = 0;
PRINTF (" new par: %d\n", paragraphs->size() - 1);
}
PRINTF (" last par: %d\n", paragraphs->size() - 1);
Paragraph *lastPar = paragraphs->getLastRef();
int corrDiffMin, corrDiffMax;
if (wordIndex - 1 >= lastPar->firstWord) {
Word *lastWord = words->getRef (wordIndex - 1);
if (lastWord->badnessAndPenalty.lineCanBeBroken (1) &&
(lastWord->flags & Word::UNBREAKABLE_FOR_MIN_WIDTH) == 0)
corrDiffMin = 0;
else
corrDiffMin = lastWord->origSpace - lastWord->hyphenWidth;
corrDiffMax = lastWord->origSpace - lastWord->hyphenWidth;
} else
corrDiffMin = corrDiffMax = 0;
PRINTF (" (lastPar from %d to %d; corrDiffMin = %d, corDiffMax = %d)\n",
lastPar->firstWord, lastPar->lastWord, corrDiffMin, corrDiffMax);
// Minimum: between two *possible* breaks.
// Shrinkability could be considered, but really does not play a role.
lastPar->parMin += wordExtremes.minWidth + word->hyphenWidth + corrDiffMin;
lastPar->maxParMin = misc::max (lastPar->maxParMin, lastPar->parMin);
if (word->badnessAndPenalty.lineCanBeBroken (1) &&
(word->flags & Word::UNBREAKABLE_FOR_MIN_WIDTH) == 0)
lastPar->parMin = 0;
// Maximum: between two *necessary* breaks.
lastPar->parMax += wordExtremes.maxWidth + word->hyphenWidth + corrDiffMax;
lastPar->maxParMax = misc::max (lastPar->maxParMax, lastPar->parMax);
PRINTF (" => parMin = %d (max = %d), parMax = %d (max = %d)\n",
lastPar->parMin, lastPar->maxParMin, lastPar->parMax,
lastPar->maxParMax);
lastPar->lastWord = wordIndex;
}
/**
* Called when something changed for the last word (space, hyphens etc.).
*/
void Textblock::correctLastWordExtremes ()
{
if (paragraphs->size() > 0) {
Word *word = words->getLastRef ();
if (word->badnessAndPenalty.lineCanBeBroken (1) &&
(word->flags & Word::UNBREAKABLE_FOR_MIN_WIDTH) == 0) {
paragraphs->getLastRef()->parMin = 0;
PRINTF (" => corrected; parMin = %d\n",
paragraphs->getLastRef()->parMin);
}
}
}
int Textblock::hyphenateWord (int wordIndex)
{
Word *hyphenatedWord = words->getRef(wordIndex);
char lang[3] = { hyphenatedWord->style->x_lang[0],
hyphenatedWord->style->x_lang[1], 0 };
Hyphenator *hyphenator = Hyphenator::getHyphenator (lang);
PRINTF ("[%p] considering to hyphenate word %d, '%s', in language '%s'\n",
this, wordIndex, words->getRef(wordIndex)->content.text, lang);
int numBreaks;
int *breakPos =
hyphenator->hyphenateWord (layout->getPlatform (),
hyphenatedWord->content.text, &numBreaks);
if (numBreaks > 0) {
Word origWord = *hyphenatedWord;
core::Requisition wordSize[numBreaks + 1];
calcTextSizes (origWord.content.text, strlen (origWord.content.text),
origWord.style, numBreaks, breakPos, wordSize);
PRINTF ("[%p] %d words ...\n", this, words->size ());
words->insert (wordIndex, numBreaks);
for (int i = 0; i < numBreaks; i++)
initWord (wordIndex + i);
PRINTF ("[%p] ... => %d words\n", this, words->size ());
// Adjust anchor indexes.
for (int i = 0; i < anchors->size (); i++) {
Anchor *anchor = anchors->getRef (i);
if (anchor->wordIndex > wordIndex)
anchor->wordIndex += numBreaks;
}
for (int i = 0; i < numBreaks + 1; i++) {
Word *w = words->getRef (wordIndex + i);
fillWord (wordIndex + i, wordSize[i].width, wordSize[i].ascent,
wordSize[i].descent, false, origWord.style);
// TODO There should be a method fillText0.
w->content.type = core::Content::TEXT;
int start = (i == 0 ? 0 : breakPos[i - 1]);
int end = (i == numBreaks ?
strlen (origWord.content.text) : breakPos[i]);
w->content.text =
layout->textZone->strndup (origWord.content.text + start,
end - start);
PRINTF (" [%d] -> '%s'\n", wordIndex + i, w->content.text);
// Note: there are numBreaks + 1 word parts.
if (i == 0)
w->flags |= Word::WORD_START;
else
w->flags &= ~Word::WORD_START;
if (i == numBreaks)
w->flags |= Word::WORD_END;
else
w->flags &= ~Word::WORD_END;
if (i < numBreaks) {
// TODO There should be a method fillHyphen.
w->badnessAndPenalty.setPenalties (penalties[PENALTY_HYPHEN][0],
penalties[PENALTY_HYPHEN][1]);
// "\xe2\x80\x90" is an unconditional hyphen.
w->hyphenWidth =
layout->textWidth (w->style->font, hyphenDrawChar,
strlen (hyphenDrawChar));
w->flags |= (Word::DRAW_AS_ONE_TEXT | Word::DIV_CHAR_AT_EOL |
Word::UNBREAKABLE_FOR_MIN_WIDTH);
PRINTF (" [%d] + hyphen\n", wordIndex + i);
} else {
if (origWord.content.space) {
fillSpace (wordIndex + i, origWord.spaceStyle);
PRINTF (" [%d] + space\n", wordIndex + i);
} else {
PRINTF (" [%d] + nothing\n", wordIndex + i);
}
}
accumulateWordData (wordIndex + i);
//printf ("[%p] %d: hyphenated word part: ", this, wordIndex + i);
//printWordWithFlags (w);
//printf ("\n");
}
PRINTF (" finished\n");
//delete origword->content.text; TODO: Via textZone?
origWord.style->unref ();
origWord.spaceStyle->unref ();
free (breakPos);
} else
words->getRef(wordIndex)->flags &= ~Word::CAN_BE_HYPHENATED;
return numBreaks;
}
void Textblock::accumulateWordForLine (int lineIndex, int wordIndex)
{
Line *line = lines->getRef (lineIndex);
Word *word = words->getRef (wordIndex);
PRINTF (" %d + %d / %d + %d\n", line->boxAscent, line->boxDescent,
word->size.ascent, word->size.descent);
line->boxAscent = misc::max (line->boxAscent, word->size.ascent);
line->boxDescent = misc::max (line->boxDescent, word->size.descent);
int len = word->style->font->ascent;
if (word->style->valign == core::style::VALIGN_SUPER)
len += len / 2;
line->contentAscent = misc::max (line->contentAscent, len);
len = word->style->font->descent;
if (word->style->valign == core::style::VALIGN_SUB)
len += word->style->font->ascent / 3;
line->contentDescent = misc::max (line->contentDescent, len);
if (word->content.type == core::Content::WIDGET) {
int collapseMarginTop = 0;
line->marginDescent =
misc::max (line->marginDescent,
word->size.descent +
word->content.widget->getStyle()->margin.bottom);
if (lines->size () == 1 &&
word->content.widget->blockLevel () &&
getStyle ()->borderWidth.top == 0 &&
getStyle ()->padding.top == 0) {
// collapse top margins of parent element and its first child
// see: http://www.w3.org/TR/CSS21/box.html#collapsing-margins
collapseMarginTop = getStyle ()->margin.top;
}
line->boxAscent =
misc::max (line->boxAscent,
word->size.ascent,
word->size.ascent
+ word->content.widget->getStyle()->margin.top
- collapseMarginTop);
word->content.widget->parentRef = lineIndex;
} else {
line->marginDescent =
misc::max (line->marginDescent, line->boxDescent);
if (word->content.type == core::Content::BREAK)
line->breakSpace =
misc::max (word->content.breakSpace,
line->marginDescent - line->boxDescent,
line->breakSpace);
}
}
void Textblock::accumulateWordData (int wordIndex)
{
// Typically, the word in question is in the last line; in any case
// quite at the end of the text, so that linear search is actually
// the fastest option.
int lineIndex = lines->size ();
while (lineIndex > 0 && wordIndex <= lines->getRef(lineIndex - 1)->lastWord)
lineIndex--;
int firstWordOfLine;
if (lineIndex == 0)
firstWordOfLine = 0;
else
firstWordOfLine = lines->getRef(lineIndex - 1)->lastWord + 1;
Word *word = words->getRef (wordIndex);
PRINTF ("[%p] ACCUMULATE_WORD_DATA (%d); lineIndex = %d: ...\n",
this, wordIndex, lineIndex);
int availWidth = calcAvailWidth (lineIndex);
PRINTF (" (%s existing line %d starts with word %d)\n",
lineIndex < lines->size () ? "already" : "not yet",
lineIndex, firstWordOfLine);
if (wordIndex == firstWordOfLine) {
// first word of the (not neccessarily yet existing) line
word->totalWidth = word->size.width + word->hyphenWidth;
word->maxAscent = word->size.ascent;
word->maxDescent = word->size.descent;
word->totalSpaceStretchability = 0;
word->totalSpaceShrinkability = 0;
} else {
Word *prevWord = words->getRef (wordIndex - 1);
word->totalWidth = prevWord->totalWidth
+ prevWord->origSpace - prevWord->hyphenWidth
+ word->size.width + word->hyphenWidth;
word->maxAscent = misc::max (prevWord->size.ascent, word->size.ascent);
word->maxDescent = misc::max (prevWord->size.descent, word->size.descent);
word->totalSpaceStretchability =
prevWord->totalSpaceStretchability + getSpaceStretchability(prevWord);
word->totalSpaceShrinkability =
prevWord->totalSpaceShrinkability + getSpaceShrinkability(prevWord);
}
int totalStretchability =
word->totalSpaceStretchability + getLineStretchability (word);
int totalShrinkability =
word->totalSpaceShrinkability + getLineShrinkability (word);
word->badnessAndPenalty.calcBadness (word->totalWidth, availWidth,
totalStretchability,
totalShrinkability);
//printf (" => ");
//printWord (word);
//printf ("\n");
}
int Textblock::calcAvailWidth (int lineIndex)
{
int availWidth =
this->availWidth - getStyle()->boxDiffWidth() - innerPadding;
if (limitTextWidth &&
layout->getUsesViewport () &&
availWidth > layout->getWidthViewport () - 10)
availWidth = layout->getWidthViewport () - 10;
if (lineIndex == 0)
availWidth -= line1OffsetEff;
//PRINTF("[%p] CALC_AVAIL_WIDTH => %d - %d - %d = %d\n",
// this, this->availWidth, getStyle()->boxDiffWidth(), innerPadding,
// availWidth);
return availWidth;
}
void Textblock::initLine1Offset (int wordIndex)
{
Word *word = words->getRef (wordIndex);
/* Test whether line1Offset can be used. */
if (wordIndex == 0) {
if (ignoreLine1OffsetSometimes &&
line1Offset + word->size.width > availWidth) {
line1OffsetEff = 0;
} else {
int indent = 0;
if (word->content.type == core::Content::WIDGET &&
word->content.widget->blockLevel() == true) {
/* don't use text-indent when nesting blocks */
} else {
if (core::style::isPerLength(getStyle()->textIndent)) {
indent = core::style::multiplyWithPerLengthRounded
(this->availWidth, getStyle()->textIndent);
} else {
indent = core::style::absLengthVal (getStyle()->textIndent);
}
}
line1OffsetEff = line1Offset + indent;
}
}
}
/**
* Align the line.
*
* \todo Use block's style instead once paragraphs become proper blocks.
*/
void Textblock::alignLine (int lineIndex)
{
Line *line = lines->getRef (lineIndex);
int availWidth = calcAvailWidth (lineIndex);
Word *firstWord = words->getRef (line->firstWord);
Word *lastWord = words->getRef (line->lastWord);
for (int i = line->firstWord; i < line->lastWord; i++)
words->getRef(i)->origSpace = words->getRef(i)->effSpace;
if (firstWord->content.type != core::Content::BREAK) {
switch (firstWord->style->textAlign) {
case core::style::TEXT_ALIGN_LEFT:
case core::style::TEXT_ALIGN_STRING: /* handled elsewhere (in the
* future)? */
line->leftOffset = 0;
break;
case core::style::TEXT_ALIGN_JUSTIFY: /* see some lines above */
line->leftOffset = 0;
// Do not justify the last line of a paragraph (which ends on a
// BREAK or with the last word of the page).
if(!(lastWord->content.type == core::Content::BREAK ||
line->lastWord == words->size () - 1) ||
// In some cases, however, an unjustified line would be too wide:
// when the line would be shrunken otherwise. (This solution is
// far from perfect, but a better solution would make changes in
// the line breaking algorithm necessary.)
availWidth < lastWord->totalWidth)
justifyLine (line, availWidth - lastWord->totalWidth);
break;
case core::style::TEXT_ALIGN_RIGHT:
line->leftOffset = availWidth - lastWord->totalWidth;
break;
case core::style::TEXT_ALIGN_CENTER:
line->leftOffset = (availWidth - lastWord->totalWidth) / 2;
break;
default:
/* compiler happiness */
line->leftOffset = 0;
}
/* For large lines (images etc), which do not fit into the viewport: */
if (line->leftOffset < 0)
line->leftOffset = 0;
}
}
/**
* Rewrap the page from the line from which this is necessary.
* There are basically two times we'll want to do this:
* either when the viewport is resized, or when the size changes on one
* of the child widgets.
*/
void Textblock::rewrap ()
{
PRINTF ("[%p] REWRAP: wrapRef = %d\n", this, wrapRef);
if (wrapRefLines == -1)
/* page does not have to be rewrapped */
return;
/* All lines up from wrapRef will be rebuild from the word list,
* the line list up from this position is rebuild. */
lines->setSize (wrapRefLines);
nonTemporaryLines = misc::min (nonTemporaryLines, wrapRefLines);
int firstWord;
if (lines->size () > 0)
firstWord = lines->getLastRef()->lastWord + 1;
else
firstWord = 0;
for (int i = firstWord; i < words->size (); i++) {
Word *word = words->getRef (i);
if (word->content.type == core::Content::WIDGET)
calcWidgetSize (word->content.widget, &word->size);
wordWrap (i, false);
// Somewhat historical, but still important, note:
//
// For the case that something else is done with this word, it
// is important that wordWrap() may insert some new words; since
// NotSoSimpleVector is used for the words list, the internal
// structure may have changed, so getRef() must be called again.
//
// So this is necessary: word = words->getRef (i);
}
/* Next time, the page will not have to be rewrapped. */
wrapRefLines = -1;
}
/**
* Counter part to rewrap(), but for extremes, not size calculation.
*/
void Textblock::fillParagraphs ()
{
if (wrapRefParagraphs == -1)
return;
// Notice that wrapRefParagraphs refers to the lines, not to the paragraphs.
int firstWordOfLine;
if (lines->size () > 0 && wrapRefParagraphs > 0)
firstWordOfLine = lines->getRef(wrapRefParagraphs - 1)->lastWord + 1;
else
firstWordOfLine = 0;
int parNo;
if (paragraphs->size() > 0 &&
firstWordOfLine > paragraphs->getLastRef()->firstWord)
// A special case: the paragraphs list has been partly built, but
// not yet the paragraph containing the word in question. In
// this case, only the rest of the paragraphs list must be
// constructed. (Without this check, findParagraphOfWord would
// return -1 in this case, so that all paragraphs would be
// rebuilt.)
parNo = paragraphs->size ();
else
// If there are no paragraphs yet, findParagraphOfWord will return
// -1: use 0 then instead.
parNo = misc::max (0, findParagraphOfWord (firstWordOfLine));
paragraphs->setSize (parNo);
int firstWord;
if (paragraphs->size () > 0)
firstWord = paragraphs->getLastRef()->lastWord + 1;
else
firstWord = 0;
PRINTF ("[%p] FILL_PARAGRAPHS: now %d paragraphs; starting from word %d\n",
this, parNo, firstWord);
for (int i = firstWord; i < words->size (); i++)
handleWordExtremes (i);
wrapRefParagraphs = -1;
}
void Textblock::showMissingLines ()
{
int firstWordToWrap = lines->size () > 0 ?
lines->getRef(lines->size () - 1)->lastWord + 1 : 0;
PRINTF ("[%p] SHOW_MISSING_LINES: wrap from %d to %d\n",
this, firstWordToWrap, words->size () - 1);
for (int i = firstWordToWrap; i < words->size (); i++)
wordWrap (i, true);
}
void Textblock::removeTemporaryLines ()
{
lines->setSize (nonTemporaryLines);
}
int Textblock::getSpaceShrinkability(struct Word *word)
{
if (word->spaceStyle->textAlign == core::style::TEXT_ALIGN_JUSTIFY)
return word->origSpace / 3;
else
return 0;
}
int Textblock::getSpaceStretchability(struct Word *word)
{
if (word->spaceStyle->textAlign == core::style::TEXT_ALIGN_JUSTIFY)
return word->origSpace / 2;
else
return 0;
// Alternative: return word->origSpace / 2;
}
int Textblock::getLineShrinkability(Word *lastWord)
{
return 0;
}
int Textblock::getLineStretchability(Word *lastWord)
{
if (lastWord->spaceStyle->textAlign == core::style::TEXT_ALIGN_JUSTIFY)
return 0;
else
return stretchabilityFactor * (lastWord->maxAscent
+ lastWord->maxDescent) / 100;
// Alternative: return 0;
}
} // namespace dw
|