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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
|
-- This file is free software, which comes along with SmartEiffel. This
-- software 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. You can modify it as you want, provided
-- this header is kept unaltered, and a notification of the changes is added.
-- You are allowed to redistribute it and sell it, alone or as a part of
-- another product.
--
-- Copyright(C) 1994-2002: INRIA - LORIA (INRIA Lorraine) - ESIAL U.H.P.
-- - University of Nancy 1 - FRANCE
-- Copyright(C) 2003: INRIA - LORIA (INRIA Lorraine) - I.U.T. Charlemagne
-- - University of Nancy 2 - FRANCE
--
-- Dominique COLNET, Suzanne COLLIN, Olivier ZENDRA,
-- Philippe RIBET, Cyril ADRIAN
--
-- http://SmartEiffel.loria.fr - SmartEiffel@loria.fr
--
class LINK[E]
--
-- To implement LINKED_LIST[E].
--
creation {LINKED_LIST} make
feature {LINK,ITERATOR_ON_LINKED_LIST,LINKED_LIST}
item: E
next: like Current
feature {LINKED_LIST}
make(i: like item; n: like next) is
do
item := i
next := n
ensure
item = i
next = n
end
feature {LINK,LINKED_LIST}
set_item(i: like item) is
do
item := i
ensure
item = i
end
set_next(n: like next) is
do
next := n
ensure
next = n
end
set_all_with(v: like item) is
local
lnk: like Current
do
from
lnk := Current
until
lnk = Void
loop
lnk.set_item(v)
lnk := lnk.next
end
end
end -- LINK[E]
|
