bidiorder.html

IText PDF开发工具说明文档,使用很方便。

<DL>
<DD>Reinsert levels information for explicit codes.
 This is for ease of relating the level information
 to the original input data.  Note that the levels
 assigned to these codes are arbitrary, they're
 chosen so as to avoid breaking level runs.
<P>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>textLength</CODE> - the length of the data after compression
<DT><B>Returns:</B><DD>the length of the data (original length of
 types array supplied to constructor)</DL>
</DD>
</DL>
<HR>

<A NAME="processEmbeddings(byte[], byte)"><!-- --></A><H3>
processEmbeddings</H3>
<PRE>
private static byte[] <B>processEmbeddings</B>(byte[]&nbsp;resultTypes,
                                        byte&nbsp;paragraphEmbeddingLevel)</PRE>
<DL>
<DD>2) determining explicit levels
 Rules X1 - X8

 The interaction of these rules makes handling them a bit complex.
 This examines resultTypes but does not modify it.  It returns embedding and
 override information in the result array.  The low 7 bits are the level, the high
 bit is set if the level is an override, and clear if it is an embedding.
<P>
<DD><DL>
</DL>
</DD>
</DL>
<HR>

<A NAME="resolveWeakTypes(int, int, byte, byte, byte)"><!-- --></A><H3>
resolveWeakTypes</H3>
<PRE>
private void <B>resolveWeakTypes</B>(int&nbsp;start,
                              int&nbsp;limit,
                              byte&nbsp;level,
                              byte&nbsp;sor,
                              byte&nbsp;eor)</PRE>
<DL>
<DD>3) resolving weak types
 Rules W1-W7.

 Note that some weak types (EN, AN) remain after this processing is complete.
<P>
<DD><DL>
</DL>
</DD>
</DL>
<HR>

<A NAME="resolveNeutralTypes(int, int, byte, byte, byte)"><!-- --></A><H3>
resolveNeutralTypes</H3>
<PRE>
private void <B>resolveNeutralTypes</B>(int&nbsp;start,
                                 int&nbsp;limit,
                                 byte&nbsp;level,
                                 byte&nbsp;sor,
                                 byte&nbsp;eor)</PRE>
<DL>
<DD>6) resolving neutral types
 Rules N1-N2.
<P>
<DD><DL>
</DL>
</DD>
</DL>
<HR>

<A NAME="resolveImplicitLevels(int, int, byte, byte, byte)"><!-- --></A><H3>
resolveImplicitLevels</H3>
<PRE>
private void <B>resolveImplicitLevels</B>(int&nbsp;start,
                                   int&nbsp;limit,
                                   byte&nbsp;level,
                                   byte&nbsp;sor,
                                   byte&nbsp;eor)</PRE>
<DL>
<DD>7) resolving implicit embedding levels
 Rules I1, I2.
<P>
<DD><DL>
</DL>
</DD>
</DL>
<HR>

<A NAME="getLevels()"><!-- --></A><H3>
getLevels</H3>
<PRE>
public byte[] <B>getLevels</B>()</PRE>
<DL>
<DD><DL>
</DL>
</DD>
</DL>
<HR>

<A NAME="getLevels(int[])"><!-- --></A><H3>
getLevels</H3>
<PRE>
public byte[] <B>getLevels</B>(int[]&nbsp;linebreaks)</PRE>
<DL>
<DD>Return levels array breaking lines at offsets in linebreaks. <br>
 Rule L1.
 <p>
 The returned levels array contains the resolved level for each
 bidi code passed to the constructor.
 <p>
 The linebreaks array must include at least one value.
 The values must be in strictly increasing order (no duplicates)
 between 1 and the length of the text, inclusive.  The last value
 must be the length of the text.
<P>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>linebreaks</CODE> - the offsets at which to break the paragraph
<DT><B>Returns:</B><DD>the resolved levels of the text</DL>
</DD>
</DL>
<HR>

<A NAME="getReordering(int[])"><!-- --></A><H3>
getReordering</H3>
<PRE>
public int[] <B>getReordering</B>(int[]&nbsp;linebreaks)</PRE>
<DL>
<DD>Return reordering array breaking lines at offsets in linebreaks.
 <p>
 The reordering array maps from a visual index to a logical index.
 Lines are concatenated from left to right.  So for example, the
 fifth character from the left on the third line is
 <pre> getReordering(linebreaks)[linebreaks[1] + 4]</pre>
 (linebreaks[1] is the position after the last character of the
 second line, which is also the index of the first character on the
 third line, and adding four gets the fifth character from the left).
 <p>
 The linebreaks array must include at least one value.
 The values must be in strictly increasing order (no duplicates)
 between 1 and the length of the text, inclusive.  The last value
 must be the length of the text.
<P>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>linebreaks</CODE> - the offsets at which to break the paragraph.</DL>
</DD>
</DL>
<HR>

<A NAME="computeMultilineReordering(byte[], int[])"><!-- --></A><H3>
computeMultilineReordering</H3>
<PRE>
private static int[] <B>computeMultilineReordering</B>(byte[]&nbsp;levels,
                                                int[]&nbsp;linebreaks)</PRE>
<DL>
<DD>Return multiline reordering array for a given level array.
 Reordering does not occur across a line break.
<P>
<DD><DL>
</DL>
</DD>
</DL>
<HR>

<A NAME="computeReordering(byte[])"><!-- --></A><H3>
computeReordering</H3>
<PRE>
private static int[] <B>computeReordering</B>(byte[]&nbsp;levels)</PRE>
<DL>
<DD>Return reordering array for a given level array.  This reorders a single line.
 The reordering is a visual to logical map.  For example,
 the leftmost char is string.charAt(order[0]).
 Rule L2.
<P>
<DD><DL>
</DL>
</DD>
</DL>
<HR>

<A NAME="getBaseLevel()"><!-- --></A><H3>
getBaseLevel</H3>
<PRE>
public byte <B>getBaseLevel</B>()</PRE>
<DL>
<DD>Return the base level of the paragraph.
<P>
<DD><DL>
</DL>
</DD>
</DL>
<HR>

<A NAME="isWhitespace(byte)"><!-- --></A><H3>
isWhitespace</H3>
<PRE>
private static boolean <B>isWhitespace</B>(byte&nbsp;biditype)</PRE>
<DL>
<DD>Return true if the type is considered a whitespace type for the line break rules.
<P>
<DD><DL>
</DL>
</DD>
</DL>
<HR>

<A NAME="typeForLevel(int)"><!-- --></A><H3>
typeForLevel</H3>
<PRE>
private static byte <B>typeForLevel</B>(int&nbsp;level)</PRE>
<DL>
<DD>Return the strong type (L or R) corresponding to the level.
<P>
<DD><DL>
</DL>
</DD>
</DL>
<HR>

<A NAME="findRunLimit(int, int, byte[])"><!-- --></A><H3>
findRunLimit</H3>
<PRE>
private int <B>findRunLimit</B>(int&nbsp;index,
                         int&nbsp;limit,
                         byte[]&nbsp;validSet)</PRE>
<DL>
<DD>Return the limit of the run starting at index that includes only resultTypes in validSet.
 This checks the value at index, and will return index if that value is not in validSet.
<P>
<DD><DL>
</DL>
</DD>
</DL>
<HR>

<A NAME="findRunStart(int, byte[])"><!-- --></A><H3>
findRunStart</H3>
<PRE>
private int <B>findRunStart</B>(int&nbsp;index,
                         byte[]&nbsp;validSet)</PRE>
<DL>
<DD>Return the start of the run including index that includes only resultTypes in validSet.
 This assumes the value at index is valid, and does not check it.
<P>
<DD><DL>
</DL>
</DD>
</DL>
<HR>

<A NAME="setTypes(int, int, byte)"><!-- --></A><H3>
setTypes</H3>
<PRE>
private void <B>setTypes</B>(int&nbsp;start,
                      int&nbsp;limit,
                      byte&nbsp;newType)</PRE>
<DL>
<DD>Set resultTypes from start up to (but not including) limit to newType.
<P>
<DD><DL>
</DL>
</DD>
</DL>
<HR>

<A NAME="setLevels(int, int, byte)"><!-- --></A><H3>
setLevels</H3>
<PRE>
private void <B>setLevels</B>(int&nbsp;start,
                       int&nbsp;limit,
                       byte&nbsp;newLevel)</PRE>
<DL>
<DD>Set resultLevels from start up to (but not including) limit to newLevel.
<P>
<DD><DL>
</DL>
</DD>
</DL>
<HR>

<A NAME="validateTypes(byte[])"><!-- --></A><H3>
validateTypes</H3>
<PRE>
private static void <B>validateTypes</B>(byte[]&nbsp;types)</PRE>
<DL>
<DD>Throw exception if type array is invalid.
<P>
<DD><DL>
</DL>
</DD>
</DL>
<HR>

<A NAME="validateParagraphEmbeddingLevel(byte)"><!-- --></A><H3>
validateParagraphEmbeddingLevel</H3>
<PRE>
private static void <B>validateParagraphEmbeddingLevel</B>(byte&nbsp;paragraphEmbeddingLevel)</PRE>
<DL>
<DD>Throw exception if paragraph embedding level is invalid. Special allowance for -1 so that
 default processing can still be performed when using this API.
<P>
<DD><DL>
</DL>
</DD>
</DL>
<HR>

<A NAME="validateLineBreaks(int[], int)"><!-- --></A><H3>
validateLineBreaks</H3>
<PRE>
private static void <B>validateLineBreaks</B>(int[]&nbsp;linebreaks,
                                       int&nbsp;textLength)</PRE>
<DL>
<DD>Throw exception if line breaks array is invalid.
<P>
<DD><DL>
</DL>
</DD>
</DL>
<!-- ========= END OF CLASS DATA ========= -->
<HR>


<!-- ======= START OF BOTTOM NAVBAR ====== -->
<A NAME="navbar_bottom"><!-- --></A>
<A HREF="#skip-navbar_bottom" title="Skip navigation links"></A>
<TABLE BORDER="0" WIDTH="100%" CELLPADDING="1" CELLSPACING="0" SUMMARY="">
<TR>
<TD COLSPAN=2 BGCOLOR="#EEEEFF" CLASS="NavBarCell1">
<A NAME="navbar_bottom_firstrow"><!-- --></A>
<TABLE BORDER="0" CELLPADDING="0" CELLSPACING="3" SUMMARY="">
  <TR ALIGN="center" VALIGN="top">
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="../../../../overview-summary.html"><FONT CLASS="NavBarFont1"><B>Overview</B></FONT></A>&nbsp;</TD>
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="package-summary.html"><FONT CLASS="NavBarFont1"><B>Package</B></FONT></A>&nbsp;</TD>
  <TD BGCOLOR="#FFFFFF" CLASS="NavBarCell1Rev"> &nbsp;<FONT CLASS="NavBarFont1Rev"><B>Class</B></FONT>&nbsp;</TD>
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="package-tree.html"><FONT CLASS="NavBarFont1"><B>Tree</B></FONT></A>&nbsp;</TD>
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="../../../../deprecated-list.html"><FONT CLASS="NavBarFont1"><B>Deprecated</B></FONT></A>&nbsp;</TD>
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="../../../../index-all.html"><FONT CLASS="NavBarFont1"><B>Index</B></FONT></A>&nbsp;</TD>
  <TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1">    <A HREF="../../../../help-doc.html"><FONT CLASS="NavBarFont1"><B>Help</B></FONT></A>&nbsp;</TD>
  </TR>
</TABLE>
</TD>
<TD ALIGN="right" VALIGN="top" ROWSPAN=3><EM>
Hosted by <a href="http://www.hostbasket.com/">Hostbasket</a></EM>
</TD>
</TR>

<TR>
<TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">
&nbsp;<A HREF="../../../../com/lowagie/text/pdf/BidiLine.html" title="class in com.lowagie.text.pdf"><B>PREV CLASS</B></A>&nbsp;
&nbsp;<A HREF="../../../../com/lowagie/text/pdf/ByteBuffer.html" title="class in com.lowagie.text.pdf"><B>NEXT CLASS</B></A></FONT></TD>
<TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">
  <A HREF="../../../../index.html?com/lowagie/text/pdf/BidiOrder.html" target="_top"><B>FRAMES</B></A>  &nbsp;
&nbsp;<A HREF="BidiOrder.html" target="_top"><B>NO FRAMES</B></A>  &nbsp;
&nbsp;<SCRIPT type="text/javascript">
  <!--
  if(window==top) {
    document.writeln('<A HREF="../../../../allclasses-noframe.html"><B>All Classes</B></A>');
  }
  //-->
</SCRIPT>
<NOSCRIPT>
  <A HREF="../../../../allclasses-noframe.html"><B>All Classes</B></A>
</NOSCRIPT>


</FONT></TD>
</TR>
<TR>
<TD VALIGN="top" CLASS="NavBarCell3"><FONT SIZE="-2">
  SUMMARY:&nbsp;NESTED&nbsp;|&nbsp;<A HREF="#field_summary">FIELD</A>&nbsp;|&nbsp;<A HREF="#constructor_summary">CONSTR</A>&nbsp;|&nbsp;<A HREF="#method_summary">METHOD</A></FONT></TD>
<TD VALIGN="top" CLASS="NavBarCell3"><FONT SIZE="-2">
DETAIL:&nbsp;<A HREF="#field_detail">FIELD</A>&nbsp;|&nbsp;<A HREF="#constructor_detail">CONSTR</A>&nbsp;|&nbsp;<A HREF="#method_detail">METHOD</A></FONT></TD>
</TR>
</TABLE>
<A NAME="skip-navbar_bottom"></A>
<!-- ======== END OF BOTTOM NAVBAR ======= -->

<HR>

</BODY>
</HTML>