| Modifier and Type | Class and Description |
|---|---|
| public static class | ParagraphSplitter.
A fake paragraqph only supports manual BIDI classification. |
| public static class | ParagraphSplitter.
A paragraph object collects the text of one paragraph. |
| Modifier and Type | Field and Description |
|---|---|
| private List | |
| private Map | |
| private Map |
| Access | Constructor and Description |
|---|---|
| public |
| Modifier and Type | Method and Description |
|---|---|
| public static byte | |
| public ParagraphSplitter. | |
| public ParagraphSplitter. | |
| public void | |
| private void | splitParagraphs(LayoutContext c, Node parent, ParagraphSplitter.
Here we recursively split everything into paragraphs. |
| public void | splitRoot(LayoutContext c, Document doc)
This starts everything by recursively dividing the document into paragraphs. |
| allParagraphs | back to summary |
|---|---|
| private List<ParagraphSplitter. | |
| blocks | back to summary |
|---|---|
| private Map<Element, ParagraphSplitter. | |
| paragraphs | back to summary |
|---|---|
| private Map<Text, ParagraphSplitter. | |
| ParagraphSplitter | back to summary |
|---|---|
| public ParagraphSplitter() | |
| convertDirectionIdent | back to summary |
|---|---|
| public static byte convertDirectionIdent(IdentValue ident) | |
| lookupBlockElement | back to summary |
|---|---|
| public ParagraphSplitter. | |
| lookupParagraph | back to summary |
|---|---|
| public ParagraphSplitter. Get the paragraph object that a Text node is associated with. Should never return null. | |
| runBidiOnParagraphs | back to summary |
|---|---|
| public void runBidiOnParagraphs(LayoutContext c) Run bidi splitting on the document's paragraphs. | |
| splitParagraphs | back to summary |
|---|---|
| private void splitParagraphs(LayoutContext c, Node parent, ParagraphSplitter. Here we recursively split everything into paragraphs. | |
| splitRoot | back to summary |
|---|---|
| public void splitRoot(LayoutContext c, Document doc) This starts everything by recursively dividing the document into paragraphs. | |
| Access | Constructor and Description |
|---|---|
| private |
| Modifier and Type | Method and Description |
|---|---|
| protected void | add(String text, Text textNode)
Overrides com. Here we add a textnode and its postion to a list. |
| public byte | |
| public BidiTextRun | nextSplit(int startIndexInParagraph)
Overrides com.
|
| public BidiTextRun | prevSplit(int startIndexInParagraph)
Overrides com.
|
| protected void | runBidiSplitter(BidiSplitter splitter, LayoutContext c)
Overrides com. Here we call out to the actual BIDI algorithm. |
| FakeParagraph | back to summary |
|---|---|
| private FakeParagraph(IdentValue direction) | |
| add | back to summary |
|---|---|
| protected void add(String text, Text textNode) Overrides com. Doc from com. Here we add a textnode and its postion to a list. We also build the paragraph string.
| |
| getActualDirection | back to summary |
|---|---|
| public byte getActualDirection() Overrides com.
| |
| nextSplit | back to summary |
|---|---|
| public BidiTextRun nextSplit(int startIndexInParagraph) Overrides com.
| |
| prevSplit | back to summary |
|---|---|
| public BidiTextRun prevSplit(int startIndexInParagraph) Overrides com.
| |
| runBidiSplitter | back to summary |
|---|---|
| protected void runBidiSplitter(BidiSplitter splitter, LayoutContext c) Overrides com. Doc from com. Here we call out to the actual BIDI algorithm.
| |
| Modifier and Type | Field and Description |
|---|---|
| private byte | |
| private final StringBuilder | |
| protected final IdentValue | |
| private final TreeMap | |
| protected final Map |
| Access | Constructor and Description |
|---|---|
| private | |
| private |
| Modifier and Type | Method and Description |
|---|---|
| protected void | |
| private void | copySplitPointsFromBidiSplitter(BidiSplitter splitter)
Here we copy the split points from the BIDI processor to our tree map for easy access. |
| public byte | |
| public IdentValue | |
| public int | Returns: the first char index into this paragraph from a Text node or -1 if not available.
|
| public BidiTextRun | Returns: the BidiTextRun that starts at or above startIndexInPararagraph.
|
| public BidiTextRun | Returns: the BidiTextRun that starts at or before startIndexInParagraph.
|
| protected void | runBidiSplitter(BidiSplitter splitter, LayoutContext c)
Here we call out to the actual BIDI algorithm. |
| actualDirection | back to summary |
|---|---|
| private byte actualDirection | |
| builder | back to summary |
|---|---|
| private final StringBuilder builder | |
| cssDirection | back to summary |
|---|---|
| protected final IdentValue cssDirection | |
| splitPoints | back to summary |
|---|---|
| private final TreeMap<Integer, BidiTextRun> splitPoints | |
| textRuns | back to summary |
|---|---|
| protected final Map<Text, Integer> textRuns | |
| Paragraph | back to summary |
|---|---|
| private Paragraph(IdentValue direction) | |
| Paragraph | back to summary |
|---|---|
| private Paragraph(IdentValue direction, boolean isLiveImplementation) | |
| add | back to summary |
|---|---|
| protected void add(String text, Text textNode) Here we add a textnode and its postion to a list. We also build the paragraph string. | |
| copySplitPointsFromBidiSplitter | back to summary |
|---|---|
| private void copySplitPointsFromBidiSplitter(BidiSplitter splitter) Here we copy the split points from the BIDI processor to our tree map for easy access. | |
| getActualDirection | back to summary |
|---|---|
| public byte getActualDirection() | |
| getCSSDirection | back to summary |
|---|---|
| public IdentValue getCSSDirection() | |
| getFirstCharIndexInParagraph | back to summary |
|---|---|
public int getFirstCharIndexInParagraph(Text text)
| |
| nextSplit | back to summary |
|---|---|
public BidiTextRun nextSplit(int startIndexInParagraph)
| |
| prevSplit | back to summary |
|---|---|
public BidiTextRun prevSplit(int startIndexInParagraph)
| |
| runBidiSplitter | back to summary |
|---|---|
| protected void runBidiSplitter(BidiSplitter splitter, LayoutContext c) Here we call out to the actual BIDI algorithm. | |