Package | Description |
---|---|
com.itextpdf.text | |
com.itextpdf.text.pdf |
Modifier and Type | Method | Description |
---|---|---|
boolean |
SplitCharacter.isSplitCharacter(int start,
int current,
int end,
char[] cc,
PdfChunk[] ck) |
Returns
true if the character can split a line. |
boolean |
TabSplitCharacter.isSplitCharacter(int start,
int current,
int end,
char[] cc,
PdfChunk[] ck) |
Modifier and Type | Field | Description |
---|---|---|
protected PdfChunk |
VerticalText.currentStandbyChunk |
The chunk created by the splitting.
|
protected PdfChunk[] |
BidiLine.detailChunks |
|
protected PdfChunk[] |
BidiLine.storedDetailChunks |
Modifier and Type | Field | Description |
---|---|---|
protected ArrayList<PdfChunk> |
BidiLine.chunks |
|
protected ArrayList<PdfChunk> |
VerticalText.chunks |
The chunks that form the text.
|
protected ArrayList<PdfChunk> |
PdfLine.line |
The arraylist containing the chunks.
|
Modifier and Type | Method | Description |
---|---|---|
PdfChunk |
PdfLine.getChunk(int idx) |
Gets a
PdfChunk by index. |
Modifier and Type | Method | Description |
---|---|---|
ArrayList<PdfChunk> |
BidiLine.createArrayOfPdfChunks(int startIdx,
int endIdx) |
|
ArrayList<PdfChunk> |
BidiLine.createArrayOfPdfChunks(int startIdx,
int endIdx,
PdfChunk extraPdfChunk) |
|
Iterator<PdfChunk> |
PdfLine.iterator() |
Returns an iterator of
PdfChunk s. |
Modifier and Type | Method | Description |
---|---|---|
void |
BidiLine.addChunk(PdfChunk chunk) |
|
void |
BidiLine.addPiece(char c,
PdfChunk chunk) |
|
ArrayList<PdfChunk> |
BidiLine.createArrayOfPdfChunks(int startIdx,
int endIdx,
PdfChunk extraPdfChunk) |
|
protected char |
DefaultSplitCharacter.getCurrentCharacter(int current,
char[] cc,
PdfChunk[] ck) |
Returns the current character
|
boolean |
DefaultSplitCharacter.isSplitCharacter(int start,
int current,
int end,
char[] cc,
PdfChunk[] ck) |
Checks if a character can be used to split a
PdfString . |
Modifier and Type | Method | Description |
---|---|---|
void |
BidiLine.addChunks(ArrayList<PdfChunk> chunks) |
Copyright © 2018. All rights reserved.