⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 ternarytree.html

📁 IText PDF开发工具说明文档,使用很方便。
💻 HTML
📖 第 1 页 / 共 3 页
字号:
private char <B>insert</B>(char&nbsp;p,                    char[]&nbsp;key,                    int&nbsp;start,                    char&nbsp;val)</PRE><DL><DD>The actual insertion function, recursive version.<P><DD><DL></DL></DD><DD><DL></DL></DD></DL><HR><A NAME="strcmp(char[], int, char[], int)"><!-- --></A><H3>strcmp</H3><PRE>public static int <B>strcmp</B>(char[]&nbsp;a,                         int&nbsp;startA,                         char[]&nbsp;b,                         int&nbsp;startB)</PRE><DL><DD>Compares 2 null terminated char arrays<P><DD><DL></DL></DD><DD><DL></DL></DD></DL><HR><A NAME="strcmp(java.lang.String, char[], int)"><!-- --></A><H3>strcmp</H3><PRE>public static int <B>strcmp</B>(<A HREF="http://java.sun.com/j2se/1.4/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</A>&nbsp;str,                         char[]&nbsp;a,                         int&nbsp;start)</PRE><DL><DD>Compares a string with null terminated char array<P><DD><DL></DL></DD><DD><DL></DL></DD></DL><HR><A NAME="strcpy(char[], int, char[], int)"><!-- --></A><H3>strcpy</H3><PRE>public static void <B>strcpy</B>(char[]&nbsp;dst,                          int&nbsp;di,                          char[]&nbsp;src,                          int&nbsp;si)</PRE><DL><DD><DL></DL></DD><DD><DL></DL></DD></DL><HR><A NAME="strlen(char[], int)"><!-- --></A><H3>strlen</H3><PRE>public static int <B>strlen</B>(char[]&nbsp;a,                         int&nbsp;start)</PRE><DL><DD><DL></DL></DD><DD><DL></DL></DD></DL><HR><A NAME="strlen(char[])"><!-- --></A><H3>strlen</H3><PRE>public static int <B>strlen</B>(char[]&nbsp;a)</PRE><DL><DD><DL></DL></DD><DD><DL></DL></DD></DL><HR><A NAME="find(java.lang.String)"><!-- --></A><H3>find</H3><PRE>public int <B>find</B>(<A HREF="http://java.sun.com/j2se/1.4/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</A>&nbsp;key)</PRE><DL><DD><DL></DL></DD><DD><DL></DL></DD></DL><HR><A NAME="find(char[], int)"><!-- --></A><H3>find</H3><PRE>public int <B>find</B>(char[]&nbsp;key,                int&nbsp;start)</PRE><DL><DD><DL></DL></DD><DD><DL></DL></DD></DL><HR><A NAME="knows(java.lang.String)"><!-- --></A><H3>knows</H3><PRE>public boolean <B>knows</B>(<A HREF="http://java.sun.com/j2se/1.4/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</A>&nbsp;key)</PRE><DL><DD><DL></DL></DD><DD><DL></DL></DD></DL><HR><A NAME="redimNodeArrays(int)"><!-- --></A><H3>redimNodeArrays</H3><PRE>private void <B>redimNodeArrays</B>(int&nbsp;newsize)</PRE><DL><DD><DL></DL></DD><DD><DL></DL></DD></DL><HR><A NAME="size()"><!-- --></A><H3>size</H3><PRE>public int <B>size</B>()</PRE><DL><DD><DL></DL></DD><DD><DL></DL></DD></DL><HR><A NAME="clone()"><!-- --></A><H3>clone</H3><PRE>public <A HREF="http://java.sun.com/j2se/1.4/docs/api/java/lang/Object.html?is-external=true" title="class or interface in java.lang">Object</A> <B>clone</B>()</PRE><DL><DD><DL><DT><B>Overrides:</B><DD><CODE><A HREF="http://java.sun.com/j2se/1.4/docs/api/java/lang/Object.html?is-external=true#clone()" title="class or interface in java.lang">clone</A></CODE> in class <CODE><A HREF="http://java.sun.com/j2se/1.4/docs/api/java/lang/Object.html?is-external=true" title="class or interface in java.lang">Object</A></CODE></DL></DD><DD><DL></DL></DD></DL><HR><A NAME="insertBalanced(java.lang.String[], char[], int, int)"><!-- --></A><H3>insertBalanced</H3><PRE>protected void <B>insertBalanced</B>(<A HREF="http://java.sun.com/j2se/1.4/docs/api/java/lang/String.html?is-external=true" title="class or interface in java.lang">String</A>[]&nbsp;k,                              char[]&nbsp;v,                              int&nbsp;offset,                              int&nbsp;n)</PRE><DL><DD>Recursively insert the median first and then the median of the lower and upper halves, and so on in order to get a balanced tree. The array of keys is assumed to be sorted in ascending order.<P><DD><DL></DL></DD><DD><DL></DL></DD></DL><HR><A NAME="balance()"><!-- --></A><H3>balance</H3><PRE>public void <B>balance</B>()</PRE><DL><DD>Balance the tree for best search performance<P><DD><DL></DL></DD><DD><DL></DL></DD></DL><HR><A NAME="trimToSize()"><!-- --></A><H3>trimToSize</H3><PRE>public void <B>trimToSize</B>()</PRE><DL><DD>Each node stores a character (splitchar) which is part of some key(s). In a compressed branch (one that only contain a single string key) the trailer of the key which is not already in nodes is stored  externally in the kv array. As items are inserted, key substrings decrease. Some substrings may completely  disappear when the whole branch is totally decompressed. The tree is traversed to find the key substrings actually used. In addition, duplicate substrings are removed using a map (implemented with a TernaryTree!).<P><DD><DL></DL></DD><DD><DL></DL></DD></DL><HR><A NAME="compact(com.lowagie.text.pdf.hyphenation.CharVector, com.lowagie.text.pdf.hyphenation.TernaryTree, char)"><!-- --></A><H3>compact</H3><PRE>private void <B>compact</B>(<A HREF="../../../../../com/lowagie/text/pdf/hyphenation/CharVector.html" title="class in com.lowagie.text.pdf.hyphenation">CharVector</A>&nbsp;kx,                     <A HREF="../../../../../com/lowagie/text/pdf/hyphenation/TernaryTree.html" title="class in com.lowagie.text.pdf.hyphenation">TernaryTree</A>&nbsp;map,                     char&nbsp;p)</PRE><DL><DD><DL></DL></DD><DD><DL></DL></DD></DL><HR><A NAME="keys()"><!-- --></A><H3>keys</H3><PRE>public <A HREF="http://java.sun.com/j2se/1.4/docs/api/java/util/Enumeration.html?is-external=true" title="class or interface in java.util">Enumeration</A> <B>keys</B>()</PRE><DL><DD><DL></DL></DD><DD><DL></DL></DD></DL><HR><A NAME="printStats()"><!-- --></A><H3>printStats</H3><PRE>public void <B>printStats</B>()</PRE><DL><DD><DL></DL></DD><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/hyphenation/SimplePatternParser.html" title="class in com.lowagie.text.pdf.hyphenation"><B>PREV CLASS</B></A>&nbsp;&nbsp;<A HREF="../../../../../com/lowagie/text/pdf/hyphenation/TernaryTree.Iterator.html" title="class in com.lowagie.text.pdf.hyphenation"><B>NEXT CLASS</B></A></FONT></TD><TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">  <A HREF="../../../../../index.html?com/lowagie/text/pdf/hyphenation/TernaryTree.html" target="_top"><B>FRAMES</B></A>  &nbsp;&nbsp;<A HREF="TernaryTree.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;<A HREF="#nested_class_summary">NESTED</A>&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>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -