blob: 49ddd834c5793b29f2c55bf066a462a828a2e9ef (
plain) (
tree)
|
|
/**
* Copyright © 2014 Mattias Andrée (maandree@member.fsf.org)
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
package datastructures.linkedlists;
/**
* Circular singly linked list class. A linked list
* is a list constructed from nodes, which hold stored
* values, with references to each other, this is
* usally an ineffective data structure, especially
* on high-level object orientated languages. A
* singly linked list only stores nodes with references
* to the following node. Additionally, a circularly
* linked list, has stores no references nodes, you
* must keep track of at least one node yourself;
* instead the nodes form a circular chain, there is
* no beginning and no end. This implemention only
* implements methods that do not require iterating
* over all nodes for find a specific; all other
* methods' — those that are implemented — time
* complexity is Θ(1).
*
* @param <T> The value stored in the structure
*/
public class CircularSinglyLinkedList<T>
£>export with_head=0 with_tail=0 with_prev=0
£>$GPP -s £ < src/datastructures/linkedlists/template | sed -e '/^[/ ]\*/d'
|
