1 # This file is part of NIT ( http://www.nitlanguage.org ).
3 # Copyright 2004-2008 Jean Privat <jean@pryen.org>
5 # This file is free software, which comes along with NIT. This software is
6 # distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
7 # without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
8 # PARTICULAR PURPOSE. You can modify it is you want, provided this header
9 # is kept unaltered, and a notification of the changes is added.
10 # You are allowed to redistribute it and sell it, alone or is a part of
13 # This module handle double linked lists
16 import abstract_collection
18 # Double linked lists.
24 redef fun [](index
) do return get_node
(index
).item
26 redef fun []=(index
, item
) do get_node
(index
).item
= item
29 redef fun first
do return _head
.item
32 redef fun first
=(e
) do _head
.item
= e
35 redef fun last
do return _tail
.item
38 redef fun last
=(e
) do _tail
.item
= e
43 redef fun is_empty
do return _head
== null
49 redef fun has
(e
) do return search_node_after
(e
, _head
) != null
55 if node
.item
!= e
then return false
66 if node
.item
!= e
then nb
+= 1
72 # Return a list of elements between 'from' and 'to'.
73 fun slice
(from
: Int, to
: Int): List[E
] do
74 assert from
>= 0 and from
< length
75 assert to
>= 0 and to
< length
and from
<= to
76 var list
= new List[E
]
89 var node
= new ListNode[E
](e
)
103 var node
= new ListNode[E
](e
)
104 if _head
== null then
115 redef fun insert
(e
, i
)
117 var node
= get_node
(i
)
122 insert_before
(e
, node
)
125 # Append `l` to `self` but clear `l`.
130 if _tail
== null then
132 else if l
._head
!= null then
134 _tail
.next
.prev
= _tail
149 if _tail
== null then
164 if _head
== null then
175 var node
= search_node_after
(e
, _head
)
176 if node
!= null then remove_node
(node
)
179 redef fun remove_at
(i
)
181 var node
= get_node
(i
)
182 if node
!= null then remove_node
(node
)
192 redef fun iterator
: ListIterator[E
] do return new ListIterator[E
](self)
193 redef fun reverse_iterator
: ListIterator[E
] do return new ListReverseIterator[E
](self)
195 # Build an empty list.
198 # Build a list filled with the items of `coll`.
199 init from
(coll
: Collection[E
]) do append
(coll
)
201 # The first node of the list
202 private var head
: nullable ListNode[E
] = null
204 # The last node of the list
205 private var tail
: nullable ListNode[E
] = null
207 # Get the `i`th node. get `null` otherwise.
208 private fun get_node
(i
: Int): nullable ListNode[E
]
214 while n
!= null and i
> 0 do
221 # get the first node that contains `e` after 'after', null otherwise
222 private fun search_node_after
(e
: E
, after
: nullable ListNode[E
]): nullable ListNode[E
]
225 while n
!= null and n
.item
!= e
do n
= n
.next
229 # Remove the node (ie. atach prev and next)
230 private fun remove_node
(node
: ListNode[E
])
233 if node
.prev
== null then
235 if node
.next
== null then
238 node
.next
.prev
= null
240 else if node
.next
== null then
242 node
.prev
.next
= null
244 node
.prev
.next
= node
.next
245 node
.next
.prev
= node
.prev
249 private fun insert_before
(element
: E
, node
: ListNode[E
])
252 var nnode
= new ListNode[E
](element
)
265 # This is the iterator class of List
266 class ListIterator[E
]
267 super IndexedIterator[E
]
268 redef fun item
do return _node
.item
270 # Set item `e` at self `index`.
271 fun item
=(e
: E
) do _node
.item
= e
273 redef fun is_ok
do return not _node
== null
281 # Build a new iterator for `list`.
288 private var list
: List[E
]
290 # The current node of the list
291 private var node
: nullable ListNode[E
] = null
293 # The index of the current node
296 # Remove the current item
299 _list
.remove_node
(_node
.as(not null))
302 # Insert before the current item
303 fun insert_before
(element
: E
)
305 _list
.insert_before
(element
, _node
.as(not null))
309 private class ListReverseIterator[E
]
310 super ListIterator[E
]
326 # Linked nodes that constitute a linked list.
327 private class ListNode[E
]
331 var next
: nullable ListNode[E
] = null
334 var prev
: nullable ListNode[E
] = null