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

📄 datastructures.linkedlist.html

📁 Data StructuresAnd Algorithm Analysis In Java Source Code
💻 HTML
字号:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
<!--NewPage-->
<html>
<head>
<!-- Generated by javadoc on Sun Sep 27 09:53:38 EDT 1998
-->
<title>
Class DataStructures.LinkedList
</title>
</head>
<body>
<a name="_top_"></a>
<pre>
<a href="packages.html">All Packages</a>  <a href="tree.html">Class Hierarchy</a>  <a href="Package-DataStructures.html">This Package</a>  <a href="DataStructures.LeftistHeap.html">Previous</a>  <a href="DataStructures.LinkedListItr.html">Next</a>  <a href="Index.html">Index</a>  </pre>
<hr>
<h1>
Class DataStructures.LinkedList
</h1>
<pre>
java.lang.Object
    |
    +----DataStructures.LinkedList
</pre>
<hr>
<dl>
<dt>public class <b>LinkedList</b>
<dt>extends Object</dl>
Linked list implementation of the listusing a header node.Access to the list is via LinkedListItr.
<p>
<dl>
<dt><b>See Also:</b>
<dd><a href="DataStructures.LinkedListItr.html">LinkedListItr</a></dl>
<hr>
<a name="index"></a><h2>
<img src="images/constructor-index.gif" width=275 height=38 alt="Constructor Index">
</h2>
<dl>
<dt><img src="images/yellow-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#LinkedList()"><b>LinkedList</b></a>()
<dd>Construct the list
</dl>
<h2>
<img src="images/method-index.gif" width=207 height=38 alt="Method Index">
</h2>
<dl>
<dt><img src="images/red-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#find(java.lang.Object)"><b>find</b></a>(Object)
<dd>Return iterator corresponding to the first node containing an item.
<dt><img src="images/red-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#findPrevious(java.lang.Object)"><b>findPrevious</b></a>(Object)
<dd>Return iterator prior to the first node containing an item.
<dt><img src="images/red-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#first()"><b>first</b></a>()
<dd>Return an iterator representing the first node in the list.
<dt><img src="images/red-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#insert(java.lang.Object, DataStructures.LinkedListItr)"><b>insert</b></a>(Object, LinkedListItr)
<dd>Insert after p.
<dt><img src="images/red-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#isEmpty()"><b>isEmpty</b></a>()
<dd>Test if the list is logically empty.
<dt><img src="images/green-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#main(java.lang.String[])"><b>main</b></a>(String[])
<dd>
<dt><img src="images/red-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#makeEmpty()"><b>makeEmpty</b></a>()
<dd>Make the list logically empty.
<dt><img src="images/green-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#printList(DataStructures.LinkedList)"><b>printList</b></a>(LinkedList)
<dd>
<dt><img src="images/red-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#remove(java.lang.Object)"><b>remove</b></a>(Object)
<dd>Remove the first occurrence of an item.
<dt><img src="images/red-ball-small.gif" width=6 height=6 alt=" o ">
<a href="#zeroth()"><b>zeroth</b></a>()
<dd>Return an iterator representing the header node.
</dl>
<a name="constructors"></a><h2>
<img src="images/constructors.gif" width=231 height=38 alt="Constructors">
</h2>
<a name="LinkedList"></a><a name="LinkedList"></a><a name="LinkedList()"><img src="images/yellow-ball.gif" width=12 height=12 alt=" o ">
</a><b>LinkedList</b>
<pre>
public LinkedList()</pre>
<dl>
<dd>Construct the list
<p>
</dl>
<a name="methods"></a><h2>
<img src="images/methods.gif" width=151 height=38 alt="Methods">
</h2>
<a name="isEmpty"></a><a name="isEmpty()"><img src="images/red-ball.gif" width=12 height=12 alt=" o ">
</a><b>isEmpty</b>
<pre>
public boolean isEmpty()</pre>
<dl>
<dd>Test if the list is logically empty.
<p>
<dd><dl>
<dt><b>Returns:</b>
<dd>true if empty, false otherwise.</dl>
</dd>
</dl>
<a name="makeEmpty"></a><a name="makeEmpty()"><img src="images/red-ball.gif" width=12 height=12 alt=" o ">
</a><b>makeEmpty</b>
<pre>
public void makeEmpty()</pre>
<dl>
<dd>Make the list logically empty.
<p>
</dl>
<a name="zeroth"></a><a name="zeroth()"><img src="images/red-ball.gif" width=12 height=12 alt=" o ">
</a><b>zeroth</b>
<pre>
public <a href="DataStructures.LinkedListItr.html">LinkedListItr</a> zeroth()</pre>
<dl>
<dd>Return an iterator representing the header node.
<p>
</dl>
<a name="first"></a><a name="first()"><img src="images/red-ball.gif" width=12 height=12 alt=" o ">
</a><b>first</b>
<pre>
public <a href="DataStructures.LinkedListItr.html">LinkedListItr</a> first()</pre>
<dl>
<dd>Return an iterator representing the first node in the list.This operation is valid for empty lists.
<p>
</dl>
<a name="insert"></a><a name="insert(java.lang.Object, DataStructures.LinkedListItr)"><img src="images/red-ball.gif" width=12 height=12 alt=" o ">
</a><b>insert</b>
<pre>
public void insert(Object x,                   <a href="DataStructures.LinkedListItr.html">LinkedListItr</a> p)</pre>
<dl>
<dd>Insert after p.
<p>
<dd><dl>
<dt><b>Parameters:</b>
<dd>x - the item to insert.
<dd>p - the position prior to the newly inserted item.
</dl>
</dd>
</dl>
<a name="find"></a><a name="find(java.lang.Object)"><img src="images/red-ball.gif" width=12 height=12 alt=" o ">
</a><b>find</b>
<pre>
public <a href="DataStructures.LinkedListItr.html">LinkedListItr</a> find(Object x)</pre>
<dl>
<dd>Return iterator corresponding to the first node containing an item.
<p>
<dd><dl>
<dt><b>Parameters:</b>
<dd>x - the item to search for.
<dt><b>Returns:</b>
<dd>an iterator; iterator isPastEnd if item is not found.</dl>
</dd>
</dl>
<a name="findPrevious"></a><a name="findPrevious(java.lang.Object)"><img src="images/red-ball.gif" width=12 height=12 alt=" o ">
</a><b>findPrevious</b>
<pre>
public <a href="DataStructures.LinkedListItr.html">LinkedListItr</a> findPrevious(Object x)</pre>
<dl>
<dd>Return iterator prior to the first node containing an item.
<p>
<dd><dl>
<dt><b>Parameters:</b>
<dd>x - the item to search for.
<dt><b>Returns:</b>
<dd>appropriate iterator if the item is found. Otherwise, theiterator corresponding to the last element in the list is returned.</dl>
</dd>
</dl>
<a name="remove"></a><a name="remove(java.lang.Object)"><img src="images/red-ball.gif" width=12 height=12 alt=" o ">
</a><b>remove</b>
<pre>
public void remove(Object x)</pre>
<dl>
<dd>Remove the first occurrence of an item.
<p>
<dd><dl>
<dt><b>Parameters:</b>
<dd>x - the item to remove.
</dl>
</dd>
</dl>
<a name="printList"></a><a name="printList(DataStructures.LinkedList)"><img src="images/green-ball.gif" width=12 height=12 alt=" o ">
</a><b>printList</b>
<pre>
public static void printList(<a href="#_top_">LinkedList</a> theList)</pre>
<dl>
</dl>
<a name="main"></a><a name="main(java.lang.String[])"><img src="images/green-ball.gif" width=12 height=12 alt=" o ">
</a><b>main</b>
<pre>
public static void main(String[] args)</pre>
<dl>
</dl>
<hr>
<pre>
<a href="packages.html">All Packages</a>  <a href="tree.html">Class Hierarchy</a>  <a href="Package-DataStructures.html">This Package</a>  <a href="DataStructures.LeftistHeap.html">Previous</a>  <a href="DataStructures.LinkedListItr.html">Next</a>  <a href="Index.html">Index</a>  </pre>
</body>
</html>

⌨️ 快捷键说明

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