blob: 8ab3de6f70115b5bc03f2f9edb73e5a112ac319e (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
|
/**
* Copyright © 2014 Mattias Andrée (m@maandree.se)
*
* 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;
import java.lang.reflect.Array;
/**
* Tailless 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. It also
* stores one refence nodes, the first node in the
* list. 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
*/
£>export name=TaillessSinglyLinkedList array=0 with_sentinel=0 with_head=1 with_tail=0 with_prev=0 with_xor=0
£>$GPP -s £ < src/datastructures/linkedlists/template | sed -e '/^[/ ]\*/d' -e '/^$/d'
|
