1 # This file is part of NIT ( http://www.nitlanguage.org ).
3 # This file is free software, which comes along with NIT. This software is
4 # distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
5 # without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
6 # PARTICULAR PURPOSE. You can modify it is you want, provided this header
7 # is kept unaltered, and a notification of the changes is added.
8 # You are allowed to redistribute it and sell it, alone or is a part of
11 # Service management trough the `for` control structure.
13 # The module is a proof-of-concept to investigate the abuse of
14 # the `for` structure to implement various services.
16 # The idea is that, with a `for`, the service-provider can:
17 # * control the end of the service (thus can finalize things
18 # like releasing ressources)
19 # * communicate data with the user on each iteration; the used can
20 # also communicate results to the provider.
23 # Encapsulation of service in a `for`-compatible interface.
25 # The service is not effectively started until the iterate method
26 # is called. Then, each step of the iteration is a step in the service.
28 # While, for a typing point of view, abusers are just collections,
29 # the point of this class is to tag services that return a ForAbuser
31 # Note that using abuser as genuine collection should work but is not
32 # recommended since it may cause mental health issues.
33 interface ForAbuser[E
]
37 # Abuser to read a file, see `file_open`
38 private class ReadFileForAbuser
39 super ForAbuser[IFStream]
41 redef fun iterator
do return new ReadFileForAbuserIterator(path
)
44 # Abuser iterator to read a file, see `file_open`
45 private class ReadFileForAbuserIterator
46 super Iterator[IFStream]
47 redef var item
: IFStream
48 redef var is_ok
= true
51 # start of service is to open the file, and return in
52 item
= new IFStream.open
(path
)
56 # end of service is to close the file
57 # there is only one iteration
66 # The user is asked to compare `a` with `b` then set `res` accordingly.
68 # * if `a < b` then the user sets `res` to -1
69 # * if `a > b` then the user sets `res` to 1
70 # * if `a == b` then the user sets `res` to 0
72 # It is the responsibility of the user to implement a total order.
73 # ie. the implemented comparison must be asymmetric, transitive and total.
75 # The first element to compare
77 # The second element to compare
79 # The result of the comparison (according to the user)
83 # Abuser for sorting array, see `sort_fa`
84 private class SortAbuser[E
]
85 super ForAbuser[CompareQuery[E
]]
87 redef fun iterator
do return new SortAbuserIterator[E
](array
)
90 # Abuser iterator for sorting array, see `sort_fa`
91 # Implements a sort by permutation
92 private class SortAbuserIterator[E
]
93 super Iterator[CompareQuery[E
]]
94 # The index of the big loop
96 # The index of the small loop
100 # The query used to communicate with the user.
101 # For ecological concerns, a unique CompareQuery is instatiated.
102 var query
: nullable CompareQuery[E
]
103 redef fun item
do return query
.as(not null)
104 init(array
: Array[E
])
107 # Initialize the algorithm, see `next` for the rest
110 if not is_ok
then return
111 query
= new CompareQuery[E
](array
[i
], array
[j
])
113 redef fun is_ok
do return i
< array
.length
- 1
116 # Process the last query
122 # Get the next iteration
124 if j
>= array
.length
then
129 if not is_ok
then return
130 # Prepare the next query
138 # Sort an array trough a `for` abuse.
139 # The user uses the provided query (item) to implements its own comparison
142 # for q in a do q.res = q.a <=> q.b
145 # Implements a sort by permutation.
146 fun sort_fa
: ForAbuser[CompareQuery[E
]]
148 return new SortAbuser[E
](self)
154 # Open and read a file trough a `for` abuse.
155 # The abuse just ensures that the file is closed after the reading.
157 # for f in file_open(path) do
158 # print path.read_line
159 # end # f is automatically closed here
160 fun file_open
(path
: String): ForAbuser[IFStream]
162 return new ReadFileForAbuser(path
)