Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/*
This file is part of the iText (R) project.
Copyright (c) 1998-2019 iText Group NV
Authors: iText Software.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU Affero General Public License version 3
as published by the Free Software Foundation with the addition of the
following permission added to Section 15 as permitted in Section 7(a):
FOR ANY PART OF THE COVERED WORK IN WHICH THE COPYRIGHT IS OWNED BY
ITEXT GROUP. ITEXT GROUP DISCLAIMS THE WARRANTY OF NON INFRINGEMENT
OF THIRD PARTY RIGHTS
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 Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with this program; if not, see http://www.gnu.org/licenses or write to
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA, 02110-1301 USA, or download the license from the following URL:
http://itextpdf.com/terms-of-use/
The interactive user interfaces in modified source and object code versions
of this program must display Appropriate Legal Notices, as required under
Section 5 of the GNU Affero General Public License.
In accordance with Section 7(b) of the GNU Affero General Public License,
a covered work must retain the producer line in every PDF that is created
or manipulated using iText.
You can be released from the requirements of the license by purchasing
a commercial license. Buying such a license is mandatory as soon as you
develop commercial activities involving the iText software without
disclosing the source code of your own applications.
These activities include: offering paid services to customers as an ASP,
serving PDFs on the fly in a web application, shipping iText with a closed
source product.
For more information, please contact iText Software Corp. at this
address: [email protected]
*/
package com.itextpdf.layout.renderer;
import com.itextpdf.io.LogMessageConstant;
import com.itextpdf.kernel.geom.Rectangle;
import com.itextpdf.kernel.pdf.canvas.PdfCanvas;
import com.itextpdf.layout.borders.Border;
import com.itextpdf.layout.property.Property;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
import java.util.ArrayList;
import java.util.List;
abstract class TableBorders {
protected List> horizontalBorders = new ArrayList<>();
protected List> verticalBorders = new ArrayList<>();
protected final int numberOfColumns;
protected Border[] tableBoundingBorders = new Border[4];
protected List rows;
// Zero-based, inclusive
protected int startRow;
// Zero-based, inclusive. The last border will have index (finishRow+1) because the number of borders is greater
// by one than the number of rows
protected int finishRow;
protected float leftBorderMaxWidth;
protected float rightBorderMaxWidth;
protected int largeTableIndexOffset = 0;
public TableBorders(List rows, int numberOfColumns, Border[] tableBoundingBorders) {
this.rows = rows;
this.numberOfColumns = numberOfColumns;
setTableBoundingBorders(tableBoundingBorders);
}
public TableBorders(List rows, int numberOfColumns, Border[] tableBoundingBorders, int largeTableIndexOffset) {
this(rows, numberOfColumns, tableBoundingBorders);
this.largeTableIndexOffset = largeTableIndexOffset;
}
// region abstract
// region draw
protected abstract TableBorders drawHorizontalBorder(int i, float startX, float y1, PdfCanvas canvas, float[] countedColumnWidth);
protected abstract TableBorders drawVerticalBorder(int i, float startY, float x1, PdfCanvas canvas, List heights);
// endregion
// region area occupation
protected abstract TableBorders applyTopTableBorder(Rectangle occupiedBox, Rectangle layoutBox, boolean isEmpty, boolean force, boolean reverse);
protected abstract TableBorders applyTopTableBorder(Rectangle occupiedBox, Rectangle layoutBox, boolean reverse);
protected abstract TableBorders applyBottomTableBorder(Rectangle occupiedBox, Rectangle layoutBox, boolean isEmpty, boolean force, boolean reverse);
protected abstract TableBorders applyBottomTableBorder(Rectangle occupiedBox, Rectangle layoutBox, boolean reverse);
protected abstract TableBorders applyLeftAndRightTableBorder(Rectangle layoutBox, boolean reverse);
protected abstract TableBorders skipFooter(Border[] borders);
protected abstract TableBorders skipHeader(Border[] borders);
protected abstract TableBorders collapseTableWithFooter(TableBorders footerBordersHandler, boolean hasContent);
protected abstract TableBorders collapseTableWithHeader(TableBorders headerBordersHandler, boolean updateBordersHandler);
protected abstract TableBorders fixHeaderOccupiedArea(Rectangle occupiedBox, Rectangle layoutBox);
protected abstract TableBorders applyCellIndents(Rectangle box, float topIndent, float rightIndent, float bottomIndent, float leftIndent, boolean reverse);
// endregion
// region getters
abstract public List getVerticalBorder(int index);
abstract public List getHorizontalBorder(int index);
protected abstract float getCellVerticalAddition(float[] indents);
// endregion
protected abstract void buildBordersArrays(CellRenderer cell, int row, int col, int[] rowspansToDeduct);
protected abstract TableBorders updateBordersOnNewPage(boolean isOriginalNonSplitRenderer, boolean isFooterOrHeader, TableRenderer currentRenderer, TableRenderer headerRenderer, TableRenderer footerRenderer);
// endregion
protected TableBorders processAllBordersAndEmptyRows() {
CellRenderer[] currentRow;
int[] rowspansToDeduct = new int[numberOfColumns];
int numOfRowsToRemove = 0;
if (!rows.isEmpty()) {
for (int row = startRow - largeTableIndexOffset; row <= finishRow - largeTableIndexOffset; row++) {
currentRow = rows.get(row);
boolean hasCells = false;
for (int col = 0; col < numberOfColumns; col++) {
if (null != currentRow[col]) {
int colspan = (int) currentRow[col].getPropertyAsInteger(Property.COLSPAN);
if (rowspansToDeduct[col] > 0) {
int rowspan = (int) currentRow[col].getPropertyAsInteger(Property.ROWSPAN) - rowspansToDeduct[col];
if (rowspan < 1) {
Logger logger = LoggerFactory.getLogger(TableRenderer.class);
logger.warn(LogMessageConstant.UNEXPECTED_BEHAVIOUR_DURING_TABLE_ROW_COLLAPSING);
rowspan = 1;
}
currentRow[col].setProperty(Property.ROWSPAN, rowspan);
if (0 != numOfRowsToRemove) {
removeRows(row - numOfRowsToRemove, numOfRowsToRemove);
row -= numOfRowsToRemove;
numOfRowsToRemove = 0;
}
}
buildBordersArrays(currentRow[col], row, col, rowspansToDeduct);
hasCells = true;
for (int i = 0; i < colspan; i++) {
rowspansToDeduct[col + i] = 0;
}
col += colspan - 1;
} else {
if (horizontalBorders.get(row).size() <= col) {
horizontalBorders.get(row).add(null);
}
}
}
if (!hasCells) {
if (row == rows.size() - 1) {
removeRows(row - rowspansToDeduct[0], rowspansToDeduct[0]);
// delete current row
rows.remove(row - rowspansToDeduct[0]);
setFinishRow(finishRow - 1);
Logger logger = LoggerFactory.getLogger(TableRenderer.class);
logger.warn(LogMessageConstant.LAST_ROW_IS_NOT_COMPLETE);
} else {
for (int i = 0; i < numberOfColumns; i++) {
rowspansToDeduct[i]++;
}
numOfRowsToRemove++;
}
}
}
}
if (finishRow < startRow) {
setFinishRow(startRow);
}
return this;
}
private void removeRows(int startRow, int numOfRows) {
for (int row = startRow; row < startRow + numOfRows; row++) {
rows.remove(startRow);
horizontalBorders.remove(startRow + 1);
for (int j = 0; j <= numberOfColumns; j++) {
verticalBorders.get(j).remove(startRow + 1);
}
}
setFinishRow(finishRow - numOfRows);
}
// region init
protected TableBorders initializeBorders() {
List tempBorders;
// initialize vertical borders
while (numberOfColumns + 1 > verticalBorders.size()) {
tempBorders = new ArrayList();
while ((int) Math.max(rows.size(), 1) > tempBorders.size()) {
tempBorders.add(null);
}
verticalBorders.add(tempBorders);
}
// initialize horizontal borders
while ((int) Math.max(rows.size(), 1) + 1 > horizontalBorders.size()) {
tempBorders = new ArrayList();
while (numberOfColumns > tempBorders.size()) {
tempBorders.add(null);
}
horizontalBorders.add(tempBorders);
}
return this;
}
// endregion
// region setters
protected TableBorders setTableBoundingBorders(Border[] borders) {
tableBoundingBorders = new Border[4];
if (null != borders) {
for (int i = 0; i < borders.length; i++) {
tableBoundingBorders[i] = borders[i];
}
}
return this;
}
protected TableBorders setRowRange(int startRow, int finishRow) {
this.startRow = startRow;
this.finishRow = finishRow;
return this;
}
protected TableBorders setStartRow(int row) {
this.startRow = row;
return this;
}
protected TableBorders setFinishRow(int row) {
this.finishRow = row;
return this;
}
// endregion
// region getters
public float getLeftBorderMaxWidth() {
return leftBorderMaxWidth;
}
public float getRightBorderMaxWidth() {
return rightBorderMaxWidth;
}
public float getMaxTopWidth() {
float width = 0;
Border widestBorder = getWidestHorizontalBorder(startRow);
if (null != widestBorder && widestBorder.getWidth() >= width) {
width = widestBorder.getWidth();
}
return width;
}
public float getMaxBottomWidth() {
float width = 0;
Border widestBorder = getWidestHorizontalBorder(finishRow + 1);
if (null != widestBorder && widestBorder.getWidth() >= width) {
width = widestBorder.getWidth();
}
return width;
}
public float getMaxRightWidth() {
float width = 0;
Border widestBorder = getWidestVerticalBorder(verticalBorders.size() - 1);
if (null != widestBorder && widestBorder.getWidth() >= width) {
width = widestBorder.getWidth();
}
return width;
}
public float getMaxLeftWidth() {
float width = 0;
Border widestBorder = getWidestVerticalBorder(0);
if (null != widestBorder && widestBorder.getWidth() >= width) {
width = widestBorder.getWidth();
}
return width;
}
public Border getWidestVerticalBorder(int col) {
return TableBorderUtil.getWidestBorder(getVerticalBorder(col));
}
public Border getWidestVerticalBorder(int col, int start, int end) {
return TableBorderUtil.getWidestBorder(getVerticalBorder(col), start, end);
}
public Border getWidestHorizontalBorder(int row) {
return TableBorderUtil.getWidestBorder(getHorizontalBorder(row));
}
public Border getWidestHorizontalBorder(int row, int start, int end) {
return TableBorderUtil.getWidestBorder(getHorizontalBorder(row), start, end);
}
public List getFirstHorizontalBorder() {
return getHorizontalBorder(startRow);
}
public List getLastHorizontalBorder() {
return getHorizontalBorder(finishRow + 1);
}
public List getFirstVerticalBorder() {
return getVerticalBorder(0);
}
public List getLastVerticalBorder() {
return getVerticalBorder(verticalBorders.size() - 1);
}
public int getNumberOfColumns() {
return numberOfColumns;
}
public int getStartRow() {
return startRow;
}
public int getFinishRow() {
return finishRow;
}
public Border[] getTableBoundingBorders() {
return tableBoundingBorders;
}
public float[] getCellBorderIndents(int row, int col, int rowspan, int colspan) {
float[] indents = new float[4];
List borderList;
Border border;
// process top border
borderList = getHorizontalBorder(startRow + row - rowspan + 1);
for (int i = col; i < col + colspan; i++) {
border = borderList.get(i);
if (null != border && border.getWidth() > indents[0]) {
indents[0] = border.getWidth();
}
}
// process right border
borderList = getVerticalBorder(col + colspan);
for (int i = startRow + row - rowspan + 1; i < startRow + row + 1; i++) {
border = borderList.get(i);
if (null != border && border.getWidth() > indents[1]) {
indents[1] = border.getWidth();
}
}
// process bottom border
borderList = getHorizontalBorder(startRow + row + 1);
for (int i = col; i < col + colspan; i++) {
border = borderList.get(i);
if (null != border && border.getWidth() > indents[2]) {
indents[2] = border.getWidth();
}
}
// process left border
borderList = getVerticalBorder(col);
for (int i = startRow + row - rowspan + 1; i < startRow + row + 1; i++) {
border = borderList.get(i);
if (null != border && border.getWidth() > indents[3]) {
indents[3] = border.getWidth();
}
}
return indents;
}
// endregion
}
