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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
|
-- This file is part of SmartEiffel The GNU Eiffel Compiler Tools and Libraries
--
-- SmartEiffel is free software; you can redistribute it and/or modify it
-- under the terms of the GNU General Public License, as published by the
-- Free Software Foundation; either version 2, or (at your option) any later
-- version.
-- SmartEiffel 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 General Public License for
-- more details. You should have received a copy of the GNU General Public
-- License along with SmartEiffel; see the file COPYING. If not, write to
-- the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
-- MA 02111-1307, USA.
--
-- 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 FORMAL_GENERIC_LIST
--
-- To store the list of formal generic arguments of a generic
-- class :
-- [X,Y->Z]
--
inherit
GLOBALS
VISITABLE
creation make
feature
start_position: POSITION
-- Of the opening square bracket.
count: INTEGER is
do
Result := list.count
end
item(i: INTEGER): FORMAL_GENERIC_ARG is
require
i.in_range(1,count)
do
Result := list.item(i)
ensure
Result /= Void
end
pretty_print is
local
i: INTEGER
do
pretty_printer.put_character('[')
pretty_printer.indent_level_increment
from
i := list.lower
until
i > list.upper
loop
list.item(i).pretty_print
i := i + 1
if i <= list.upper then
pretty_printer.put_string(once ",")
end
end
pretty_printer.put_character(']')
pretty_printer.indent_level_decrement
ensure
pretty_printer.indent_level = old pretty_printer.indent_level
end
short is
local
i: INTEGER
do
short_print.hook_or("open_sb","[")
from
i := list.lower
until
i > list.upper
loop
list.item(i).short
i := i + 1
if i <= list.upper then
short_print.hook_or("fgl_sep",",")
end
end
short_print.hook_or("close_sb","]")
end
feature {BASE_CLASS}
check_generic_formal_arguments is
local
i: INTEGER
do
from
i := list.upper
until
i < list.lower
loop
list.item(i).check_generic_formal_arguments
i := i - 1
end
end
feature {EIFFEL_PARSER}
add_last(fga: FORMAL_GENERIC_ARG) is
require
fga /= Void
local
fga2: FORMAL_GENERIC_ARG; i: INTEGER; n1, n2: STRING
do
from
i := list.upper
fga.set_rank(i + 1)
n1 := fga.name.to_string
until
i < list.lower
loop
fga2 := list.item(i)
n2 := fga2.name.to_string
if n1 = n2 then
error_handler.add_position(fga.start_position)
error_handler.add_position(fga2.start_position)
error_handler.append("Formal generic name appears twice in %
%formal generic list (VCFG.2).")
error_handler.print_as_fatal_error
end
fga2.constraint_substitution(fga, list.upper + 1)
i := i - 1
end
list.add_last(fga)
end
feature {FORMAL_GENERIC_LIST_VISITOR}
accept(visitor: FORMAL_GENERIC_LIST_VISITOR) is
do
visitor.visit_formal_generic_list(Current)
end
feature {NONE}
list: ARRAY[FORMAL_GENERIC_ARG]
make(sp: like start_position) is
require
not sp.is_unknown
do
!!list.with_capacity(4,1)
start_position := sp
ensure
start_position = sp
end
end -- FORMAL_GENERIC_LIST
|
