File: class_name_list.e

package info (click to toggle)
smarteiffel 1.1-11
  • links: PTS
  • area: main
  • in suites: etch, etch-m68k
  • size: 12,288 kB
  • ctags: 40,785
  • sloc: ansic: 35,791; lisp: 4,036; sh: 1,783; java: 895; ruby: 613; python: 209; makefile: 115; csh: 78; cpp: 50
file content (229 lines) | stat: -rw-r--r-- 5,406 bytes parent folder | download | duplicates (2)
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
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
-- 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 CLASS_NAME_LIST

inherit
   GLOBALS
   VISITABLE

creation make_1, merge

feature {CLASS_NAME_LIST_VISITOR}

   accept(visitor: CLASS_NAME_LIST_VISITOR) is
      do
         visitor.visit_class_name_list(Current)
      end

feature

   count: INTEGER is
      do
         if remainder = Void then
            Result := 1
         else
            Result := 2 + remainder.upper
         end
      end

   item(i: INTEGER): CLASS_NAME is
      require
         i.in_range(1,count)
      do
         if i = 1 then
            Result := first
         else
            Result := remainder.item(i - 2)
         end
      ensure
         Result /= Void
      end

   locate_in_error_handler is
	 -- Add one or more related positions in the `error_handler'.
      local
         i: INTEGER; cn: CLASS_NAME
      do
         from
            i := count
         until
            i = 0
         loop
            cn := item(i)
	    error_handler.add_position(cn.start_position)
            i := i - 1
         end
      end
      
feature {EIFFEL_PARSER}

   add_last(cn: CLASS_NAME) is
      require
         cn /= Void
      local
         i: INTEGER
      do
         i := index_of(cn)
         if i > 0 then
            error_handler.add_position(item(i).start_position)
            warning(cn.start_position,"Same Class Name appears twice.")
         end
         if remainder = Void then
            create remainder.with_capacity(4)
         end
         remainder.add_last(cn)
      ensure
         count = 1 + old count
         item(count) = cn
      end

feature {CLIENT_LIST}

   pretty_print is
      local
         i: INTEGER
      do
         from
            i := 1
         until
            i > count
         loop
            item(i).pretty_print
            if i < count then
               pretty_printer.put_string(once ", ")
            end
            i := i + 1
         end
      end

   gives_permission_to(cn: CLASS_NAME): BOOLEAN is
      local
         i: INTEGER
      do
         if index_of(cn) > 0 then
            Result := true
         else
            from
               i := count
            until
               Result or else i = 0
            loop
               Result := cn.is_subclass_of(item(i))
               i := i - 1
            end
         end
      end

   gives_permission_to_any: BOOLEAN is
      local
         i: INTEGER; cn: CLASS_NAME
      do
         from
            i := count
         until
            Result or else i = 0
         loop
            cn := item(i)
            Result := cn.to_string = as_any
            i := i - 1
         end
      end

feature {NONE}

   first: CLASS_NAME

   remainder: FIXED_ARRAY[CLASS_NAME]

   make_1(cn: CLASS_NAME) is
      require
         cn /= Void
      do
         first := cn
      ensure
         count = 1
         item(1) = cn
      end

   merge(l1, l2: like Current) is
      require
         l1 /= Void
         l2 /= Void
      local
         i: INTEGER
         cn: CLASS_NAME
      do
         first := l1.item(1)
         !!remainder.with_capacity(l1.count + l2.count - 1)
         from
            i := l1.count
         until
            i = 1
         loop
            remainder.add_last(l1.item(i))
            i := i - 1
         end
         from
            i := l2.count
         until
            i = 0
         loop
            cn := l2.item(i)
            if index_of(cn) = 0 then
               remainder.add_last(cn)
            end
            i := i - 1
         end
      end

   index_of(cn: CLASS_NAME): INTEGER is
	 -- Is `cn' a member of `Current' class name list?
	 -- Gives 0 when `cn' is not in the `list'.
      require
         cn /= Void
      local
         cn_to_string: STRING
      do
         from
            cn_to_string := cn.to_string
            Result := count
         until
            Result = 0 or else cn_to_string = item(Result).to_string
         loop
            Result := Result - 1
         end
      ensure
         Result.in_range(0,count)
         Result > 0 implies cn.to_string = item(Result).to_string
      end

invariant

   first /= Void

   remainder /= Void implies count = 1 + remainder.count

end -- CLASS_NAME_LIST