File: example1.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 (45 lines) | stat: -rw-r--r-- 951 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
 
class EXAMPLE1
   --
   -- Yes it is easy to sort any COLLECTION:
   -- 
   --            compile -o example1 -boost example1
   --

creation make

feature

   make is
      local
         c: COLLECTION[INTEGER]; sorter: COLLECTION_SORTER[INTEGER]
      do
         c := <<10, 3, 5, 11, 1>>
         io.put_string("My collection not sorted : ")
         print_collection(c)
         io.put_string("My sorted collection     : ")
         sorter.sort(c)
         print_collection(c)
         io.put_string("To know more about sorting, have a look %
		       %at example #2.%N")
      end

feature {NONE}

   print_collection(c: COLLECTION[INTEGER]) is
      local
         i: INTEGER
      do
         from
            i := c.lower
         until
            i > c.upper
         loop
            io.put_integer(c.item(i))
            io.put_character(' ')
            i := i + 1
         end
         io.put_character('%N')
      end

end -- EXAMPLE1