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
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
/* $Id$ */
package org.apache.fop.util;
import java.util.LinkedList;
import org.apache.fop.layoutmgr.ElementListUtils;
import org.apache.fop.layoutmgr.KnuthBox;
import org.apache.fop.layoutmgr.KnuthElement;
import org.apache.fop.layoutmgr.KnuthGlue;
import org.apache.fop.layoutmgr.KnuthPenalty;
import junit.framework.TestCase;
/**
* Test class for ElementListUtils.
*/
public class ElementListUtilsTestCase extends TestCase {
/**
* Tests ElementListUtils.removeLegalBreaks().
* @throws Exception if the test fails
*/
public void testRemoveElementPenalty1() throws Exception {
LinkedList lst = new LinkedList();
lst.add(new KnuthBox(4000, null, false));
lst.add(new KnuthPenalty(0, 0, false, null, false));
lst.add(new KnuthBox(4000, null, false));
lst.add(new KnuthPenalty(0, 200, false, null, false));
lst.add(new KnuthBox(4000, null, false));
lst.add(new KnuthPenalty(0, 0, false, null, false));
lst.add(new KnuthBox(4000, null, false));
lst.add(new KnuthPenalty(0, KnuthElement.INFINITE, false, null, false));
lst.add(new KnuthGlue(0, Integer.MAX_VALUE, 0, null, false));
lst.add(new KnuthPenalty(0, -KnuthElement.INFINITE, false, null, false));
boolean res = ElementListUtils.removeLegalBreaks(lst, 9000);
assertFalse(res);
assertEquals(KnuthElement.INFINITE, ((KnuthPenalty)lst.get(1)).getP());
assertEquals(KnuthElement.INFINITE, ((KnuthPenalty)lst.get(3)).getP());
assertEquals(0, ((KnuthPenalty)lst.get(5)).getP());
}
/**
* Tests ElementListUtils.removeLegalBreaks().
* @throws Exception if the test fails
*/
public void testRemoveElementPenalty2() throws Exception {
LinkedList lst = new LinkedList();
lst.add(new KnuthBox(4000, null, false));
lst.add(new KnuthGlue(0, 0, 0, null, false));
lst.add(new KnuthBox(4000, null, false));
lst.add(new KnuthGlue(0, 0, 0, null, false));
lst.add(new KnuthBox(4000, null, false));
lst.add(new KnuthGlue(0, 0, 0, null, false));
lst.add(new KnuthBox(4000, null, false));
lst.add(new KnuthPenalty(0, KnuthElement.INFINITE, false, null, false));
lst.add(new KnuthGlue(0, Integer.MAX_VALUE, 0, null, false));
lst.add(new KnuthPenalty(0, -KnuthElement.INFINITE, false, null, false));
boolean res = ElementListUtils.removeLegalBreaks(lst, 9000);
assertFalse(res);
//Must insert an INFINITE penalty
assertEquals(KnuthElement.INFINITE, ((KnuthPenalty)lst.get(1)).getP());
assertEquals(0, ((KnuthGlue)lst.get(2)).getW());
assertEquals(KnuthElement.INFINITE, ((KnuthPenalty)lst.get(4)).getP());
assertEquals(0, ((KnuthGlue)lst.get(5)).getW());
assertEquals(0, ((KnuthGlue)lst.get(7)).getW());
}
/**
* Tests ElementListUtils.removeLegalBreaksFromEnd().
* @throws Exception if the test fails
*/
public void testRemoveElementFromEndPenalty1() throws Exception {
LinkedList lst = new LinkedList();
lst.add(new KnuthBox(4000, null, false));
lst.add(new KnuthPenalty(0, 0, false, null, false));
lst.add(new KnuthBox(4000, null, false));
lst.add(new KnuthPenalty(0, 200, false, null, false));
lst.add(new KnuthBox(4000, null, false));
lst.add(new KnuthPenalty(0, 0, false, null, false));
lst.add(new KnuthBox(4000, null, false));
lst.add(new KnuthPenalty(0, KnuthElement.INFINITE, false, null, false));
lst.add(new KnuthGlue(0, Integer.MAX_VALUE, 0, null, false));
lst.add(new KnuthPenalty(0, -KnuthElement.INFINITE, false, null, false));
boolean res = ElementListUtils.removeLegalBreaksFromEnd(lst, 9000);
assertFalse(res);
assertEquals(0, ((KnuthPenalty)lst.get(1)).getP());
assertEquals(KnuthElement.INFINITE, ((KnuthPenalty)lst.get(3)).getP());
assertEquals(KnuthElement.INFINITE, ((KnuthPenalty)lst.get(5)).getP());
}
/**
* Tests ElementListUtils.removeLegalBreaksFromEnd().
* @throws Exception if the test fails
*/
public void testRemoveElementFromEndPenalty2() throws Exception {
LinkedList lst = new LinkedList();
lst.add(new KnuthBox(4000, null, false));
lst.add(new KnuthPenalty(0, 0, false, null, false));
lst.add(new KnuthBox(4000, null, false));
lst.add(new KnuthPenalty(0, 200, false, null, false));
lst.add(new KnuthBox(4000, null, false));
lst.add(new KnuthGlue(0, 0, 0, null, false));
lst.add(new KnuthBox(4000, null, false));
lst.add(new KnuthPenalty(0, KnuthElement.INFINITE, false, null, false));
lst.add(new KnuthGlue(0, Integer.MAX_VALUE, 0, null, false));
lst.add(new KnuthPenalty(0, -KnuthElement.INFINITE, false, null, false));
boolean res = ElementListUtils.removeLegalBreaksFromEnd(lst, 9000);
assertFalse(res);
//Must insert an INFINITE penalty
assertEquals(0, ((KnuthPenalty)lst.get(1)).getP());
assertEquals(KnuthElement.INFINITE, ((KnuthPenalty)lst.get(3)).getP());
assertEquals(KnuthElement.INFINITE, ((KnuthPenalty)lst.get(5)).getP());
assertEquals(0, ((KnuthGlue)lst.get(6)).getW());
}
}
|
