|
|
||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
public interface SplitCharacter
Interface for customizing the split character.
| Method Summary | |
|---|---|
boolean |
isSplitCharacter(int start,
int current,
int end,
char[] cc,
PdfChunk[] ck)
Returns true if the character can split a line. |
| Method Detail |
|---|
boolean isSplitCharacter(int start,
int current,
int end,
char[] cc,
PdfChunk[] ck)
true if the character can split a line. The splitting implementation
is free to look ahead or look behind characters to make a decision.
The default implementation is:
public boolean isSplitCharacter(int start, int current, int end, char[] cc, PdfChunk[] ck) {
char c;
if (ck == null)
c = cc[current];
else
c = ck[Math.min(current, ck.length - 1)].getUnicodeEquivalent(cc[current]);
if (c <= ' ' || c == '-') {
return true;
}
if (c < 0x2e80)
return false;
return ((c >= 0x2e80 && c < 0xd7a0)
|| (c >= 0xf900 && c < 0xfb00)
|| (c >= 0xfe30 && c < 0xfe50)
|| (c >= 0xff61 && c < 0xffa0));
}
start - the lower limit of cc inclusivecurrent - the pointer to the character in ccend - the upper limit of cc exclusivecc - an array of characters at least end sizedck - an array of PdfChunk. The main use is to be able to call
PdfChunk.getUnicodeEquivalent(char). It may be null
or shorter than end. If null no convertion takes place.
If shorter than end the last element is used
true if the character(s) can split a line
|
|
||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||