File: SeparateRowModel.java

package info (click to toggle)
liblayout 0.2.10-5
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, forky, sid, trixie
  • size: 5,332 kB
  • sloc: java: 51,125; xml: 138; makefile: 17
file content (191 lines) | stat: -rw-r--r-- 5,377 bytes parent folder | download | duplicates (4)
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
/**
 * ===========================================
 * LibLayout : a free Java layouting library
 * ===========================================
 *
 * Project Info:  http://reporting.pentaho.org/liblayout/
 *
 * (C) Copyright 2006-2007, by Pentaho Corporation and Contributors.
 *
 * This library is free software; you can redistribute it and/or modify it under the terms
 * of the GNU Lesser General Public License as published by the Free Software Foundation;
 * either version 2.1 of the License, or (at your option) any later version.
 *
 * This library 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 Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public License along with this
 * library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330,
 * Boston, MA 02111-1307, USA.
 *
 * [Java is a trademark or registered trademark of Sun Microsystems, Inc.
 * in the United States and other countries.]
 *
 * ------------
 * $Id: SeparateRowModel.java 3524 2007-10-16 11:26:31Z tmorgner $
 * ------------
 * (C) Copyright 2006-2007, by Pentaho Corporation.
 */
package org.jfree.layouting.renderer.model.table.rows;

import org.jfree.layouting.renderer.model.table.TableRenderBox;
import org.jfree.layouting.renderer.model.table.TableSectionRenderBox;

/**
 * Creation-Date: 22.07.2006, 15:23:00
 *
 * @author Thomas Morgner
 */
public class SeparateRowModel extends AbstractRowModel
{
  private long preferredSize;
  private boolean validatedSize;
  private long rowSpacing;

  public SeparateRowModel(final TableSectionRenderBox tableSection)
  {
    super(tableSection);
  }

  public long getPreferredSize()
  {
    validateSizes();
    return preferredSize;
  }

  public long getRowSpacing()
  {
    return rowSpacing;
  }

  public void validateSizes()
  {
    if (validatedSize)
    {
      return;
    }

    int maxRowSpan = 0;
    final TableRow[] rows = getRows();
    final int rowCount = rows.length;
    for (int i = 0; i < rowCount; i++)
    {
      final TableRow row = rows[i];
      final int cs = row.getMaximumRowSpan();
      if (cs > maxRowSpan)
      {
        maxRowSpan = cs;
      }
    }

    final TableRenderBox table = getTableSection().getTable();
    rowSpacing = table.getRowSpacing().resolve(0);

    preferredSize = (rowCount - 1) * rowSpacing;

    // first, find out how much space is already used.
    final long[] preferredSizes = new long[rowCount];
    // For each rowspan ...
    for (int rowspan = 1; rowspan <= maxRowSpan; rowspan += 1)
    {
      for (int rowIdx = 0; rowIdx < rowCount; rowIdx++)
      {
        final TableRow row = rows[rowIdx];
        final long preferredSize = row.getPreferredSize(rowspan);

        distribute(preferredSize, preferredSizes, rowIdx, rowspan);
      }
    }

    for (int i = 0; i < rowCount; i++)
    {
      preferredSize += preferredSizes[i];

      final TableRow row = rows[i];
      row.setPreferredSize(preferredSizes[i]);
    }

    validatedSize = true;
  }


  public void validateActualSizes()
  {
    validateSizes();

    int maxRowSpan = 0;
    final TableRow[] rows = getRows();
    final int rowCount = rows.length;
    for (int i = 0; i < rowCount; i++)
    {
      final TableRow row = rows[i];
      final int cs = row.getMaxValidatedRowSpan();
      if (cs > maxRowSpan)
      {
        maxRowSpan = cs;
      }
    }

    // first, find out how much space is already used.
    // This follows the classical model.

    final long[] trailingSizes = new long[rowCount];
    // For each rowspan ...
    for (int rowspan = 1; rowspan <= maxRowSpan; rowspan += 1)
    {
      for (int rowIdx = 0; rowIdx < trailingSizes.length; rowIdx++)
      {
        final TableRow row = rows[rowIdx];
        final long size = row.getValidatedTrailingSize(rowspan);

        distribute(size, trailingSizes, rowIdx, rowspan);
      }
    }

    for (int i = 0; i < trailingSizes.length; i++)
    {
      final TableRow row = rows[i];
      final long validateSize = trailingSizes[i] + row.getValidatedLeadingSize();
      row.setValidateSize(Math.max (row.getPreferredSize(), validateSize));
    }
  }

  private void distribute (final long usedSpace, final long[] allSpaces,
                           final int colIdx, final int colspanX)
  {
    final int maxColspan = Math.min (colIdx + colspanX, allSpaces.length) - colIdx;
    long usedPrev = 0;
    final int maxSize = Math.min(allSpaces.length, colIdx + maxColspan);
    for (int i = colIdx; i < maxSize; i++)
    {
      usedPrev += allSpaces[i];
    }

    if (usedSpace <= usedPrev)
    {
      // no need to expand the cells.
      return;
    }

    final long distSpace = (usedSpace - usedPrev);
    final long delta = distSpace / maxColspan;
    for (int i = 0; i < maxColspan - 1; i++)
    {
      allSpaces[colIdx + i] = delta;
    }
    // any uneven remainder gets added to the last column
    allSpaces[colIdx + maxColspan - 1] = distSpace - ((maxColspan - 1) * delta);
  }

  public void clear()
  {
    final TableRow[] rows = getRows();
    final int rowCount = rows.length;
    for (int i = 0; i < rowCount; i++)
    {
      final TableRow row = rows[i];
      row.clear();
    }
  }
}