1 # This file is part of NIT ( http://www.nitlanguage.org ).
3 # Copyright 2004-2008 Jean Privat <jean@pryen.org>
5 # This file is free software, which comes along with NIT. This software is
6 # distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
7 # without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
8 # PARTICULAR PURPOSE. You can modify it is you want, provided this header
9 # is kept unaltered, and a notification of the changes is added.
10 # You are allowed to redistribute it and sell it, alone or is a part of
13 # This module define several abstract collection classes.
14 module abstract_collection
18 # The root of the collection hierarchy.
20 # Collections modelize finite groups of objects, called elements.
22 # The specific behavior and representation of collections is determined
23 # by the subclasses of the hierarchy.
25 # The main service of Collection is to provide a stable `iterator`
26 # method usable to retrieve all the elements of the collection.
28 # Additional services are provided.
29 # For an implementation point of view, Collection provide a basic
30 # implementation of these services using the `iterator` method.
31 # Subclasses often provide a more efficient implementation.
33 # Because of the `iterator` method, Collections instances can use
34 # the `for` control structure:
36 # var x: Collection[U]
43 # that is equivalent with
45 # var x: Collection[U]
49 # var u = i.item # u is a U
53 interface Collection[E
]
54 # Get a new iterator on the collection.
55 fun iterator
: Iterator[E
] is abstract
57 # Is there no item in the collection?
59 # assert [1,2,3].is_empty == false
60 # assert [1..1[.is_empty == true
61 fun is_empty
: Bool do return length
== 0
63 # Number of items in the collection.
65 # assert [10,20,30].length == 3
66 # assert [20..30[.length == 10
70 for i
in self do nb
+= 1
75 # Is `item` in the collection ?
76 # Comparisons are done with ==
78 # assert [1,2,3].has(2) == true
79 # assert [1,2,3].has(9) == false
80 # assert [1..5[.has(2) == true
81 # assert [1..5[.has(9) == false
82 fun has
(item
: E
): Bool
84 for i
in self do if i
== item
then return true
88 # Is the collection contain only `item`?
89 # Comparisons are done with ==
90 # Return true if the collection is empty.
92 # assert [1,1,1].has_only(1) == true
93 # assert [1,2,3].has_only(1) == false
94 # assert [1..1].has_only(1) == true
95 # assert [1..3].has_only(1) == false
96 # assert [3..3[.has_only(1) == true # empty collection
98 # ENSURE `is_empty implies result == true`
99 fun has_only
(item
: E
): Bool
101 for i
in self do if i
!= item
then return false
105 # How many occurrences of `item` are in the collection?
106 # Comparisons are done with ==
108 # assert [10,20,10].count(10) == 2
109 fun count
(item
: E
): Int
112 for i
in self do if i
== item
then nb
+= 1
116 # Return one the item of the collection
118 # assert [1,2,3].first == 1
125 # Is the collection contains all the elements of `other`?
127 # assert [1,1,1].has_all([1]) == true
128 # assert [1,1,1].has_all([1,2]) == false
129 # assert [1,3,4,2].has_all([1..2]) == true
130 # assert [1,3,4,2].has_all([1..5]) == false
131 fun has_all
(other
: Collection[E
]): Bool
133 for x
in other
do if not has
(x
) then return false
138 # Instances of the Iterator class generates a series of elements, one at a time.
139 # They are mainly used with collections.
140 interface Iterator[E
]
143 fun item
: E
is abstract
145 # Jump to the next item.
149 # Is there a current item ?
150 fun is_ok
: Bool is abstract
153 # A collection that contains only one item.
157 redef fun first
do return _item
159 redef fun is_empty
do return false
161 redef fun length
do return 1
163 redef fun has
(an_item
) do return _item
== an_item
165 redef fun has_only
(an_item
) do return _item
== an_item
167 redef fun count
(an_item
)
169 if _item
== an_item
then
176 redef fun iterator
do return new ContainerIterator[E
](self)
178 # Create a new instance with a given initial value.
179 init(e
: E
) do _item
= e
182 readable writable var _item
: E
185 # This iterator is quite stupid since it is used for only one item.
186 class ContainerIterator[E
]
188 redef fun item
do return _container
.item
190 redef fun next
do _is_ok
= false
192 init(c
: Container[E
]) do _container
= c
194 redef readable var _is_ok
: Bool = true
196 var _container
: Container[E
]
199 # Items can be removed from this collection
200 interface RemovableCollection[E
]
203 fun clear
is abstract
205 # Remove an occucence of `item`
206 fun remove
(item
: E
) is abstract
208 # Remove all occurences of `item`
209 fun remove_all
(item
: E
) do while has
(item
) do remove
(item
)
212 # Items can be added to these collections.
213 interface SimpleCollection[E
]
214 super RemovableCollection[E
]
215 # Add an item in a collection.
216 # Ensure col.has(item)
217 fun add
(item
: E
) is abstract
219 # Add each item of `coll`.
220 fun add_all
(coll
: Collection[E
]) do for i
in coll
do add
(i
)
225 # Set contains contains only one element with the same value (according to ==).
226 # var s: Set[String] = new ArraySet[String]
228 # var b = "Hel" + "lo"
231 # assert s.has(b) == true
232 interface Set[E
: Object]
233 super SimpleCollection[E
]
235 redef fun has_only
(item
)
248 redef fun count
(item
)
257 # Synonym of remove since there is only one item
258 redef fun remove_all
(item
) do remove
(item
)
260 # Equality is defined on set and means that each set contains the same elements
263 if not other
isa Set[Object] then return false
264 if other
.length
!= length
then return false
265 return has_all
(other
)
268 # because of the law between `==` and `hash`, hash is redefined to be the sum of the hash of the elements
272 for e
in self do res
+= res
.hash
276 # Returns the union of this set with the `other` set
277 fun union
(other
: Set[E
]): Set[E
]
285 # Returns the intersection of this set with the `other` set
286 fun intersection
(other
: Set[E
]): Set[E
]
289 for v
in self do if other
.has
(v
) then nhs
.add
(v
)
293 protected fun new_set
: Set[E
] is abstract
296 # MapRead are abstract associative collections: `key` -> `item`.
297 interface MapRead[K
: Object, E
]
298 # Get the item at `key`.
299 fun [](key
: K
): E
is abstract
301 # Get the item at `key` or return `default` if not in map
302 fun get_or_default
(key
: K
, default
: E
): E
304 if has_key
(key
) then return self[key
]
308 # Depreciated alias for `keys.has`
309 fun has_key
(key
: K
): Bool do return self.keys
.has
(key
)
311 # Get a new iterator on the map.
312 fun iterator
: MapIterator[K
, E
] is abstract
314 # Return the point of view of self on the values only.
315 # Note that `self` and `values` are views on the same data;
316 # therefore any modification of one is visible on the other.
317 fun values
: Collection[E
] is abstract
319 # Return the point of view of self on the keys only.
320 # Note that `self` and `keys` are views on the same data;
321 # therefore any modification of one is visible on the other.
322 fun keys
: Collection[K
] is abstract
324 # Is there no item in the collection?
325 fun is_empty
: Bool is abstract
327 # Number of items in the collection.
328 fun length
: Int is abstract
331 # Maps are associative collections: `key` -> `item`.
333 # The main operator over maps is [].
335 # var map: Map[String, Int] = new ArrayMap[String, Int]
337 # map["one"] = 1 # Associate 'one' to '1'
338 # map["two"] = 2 # Associate 'two' to '2'
339 # assert map["one"] == 1
340 # assert map["two"] == 2
342 # Instances of maps can be used with the for structure
344 # for key, value in map do
345 # assert (key == "one" and value == 1) or (key == "two" and value == 2)
348 # The keys and values in the map can also be manipulated directly with the `keys` and `values` methods.
350 # assert map.keys.has("one") == true
351 # assert map.keys.has("tree") == false
352 # assert map.values.has(1) == true
353 # assert map.values.has(3) == false
355 interface Map[K
: Object, E
]
357 # Set the`item` at `key`.
358 fun []=(key
: K
, item
: E
) is abstract
360 # Add each (key,value) of `map` into `self`.
361 # If a same key exists in `map` and `self`, then the value in self is discarded.
362 fun recover_with
(map
: Map[K
, E
])
372 fun clear
is abstract
374 redef fun values
: RemovableCollection[E
] is abstract
376 redef fun keys
: RemovableCollection[K
] is abstract
380 interface MapIterator[K
: Object, E
]
383 fun item
: E
is abstract
385 # The key of the current item.
387 fun key
: K
is abstract
389 # Jump to the next item.
393 # Is there a current item ?
394 fun is_ok
: Bool is abstract
396 # Set a new `item` at `key`.
397 #fun item=(item: E) is abstract
400 # Iterator on a 'keys' point of view of a map
401 class MapKeysIterator[K
: Object, V
]
403 # The original iterator
404 var iterator
: MapIterator[K
, V
]
406 redef fun is_ok
do return self.iterator
.is_ok
407 redef fun next
do self.iterator
.next
408 redef fun item
do return self.iterator
.key
411 # Iterator on a 'values' point of view of a map
412 class MapValuesIterator[K
: Object, V
]
414 # The original iterator
415 var iterator
: MapIterator[K
, V
]
417 redef fun is_ok
do return self.iterator
.is_ok
418 redef fun next
do self.iterator
.next
419 redef fun item
do return self.iterator
.item
422 # Sequences are indexed collections.
423 # The first item is 0. The last is `length-1`.
424 interface SequenceRead[E
]
426 # Get the first item.
427 # Is equivalent with `self[0]`.
430 assert not_empty
: not is_empty
434 # Return the index=th element of the sequence.
435 # The first element is 0 and the last if `length-1`
436 # If index is invalid, the program aborts
437 fun [](index
: Int): E
is abstract
440 # Is equivalent with `self[length-1]`.
443 assert not_empty
: not is_empty
444 return self[length-1
]
447 # Return the index of the first occurrence of `item`.
448 # Return -1 if `item` is not found
449 # Comparison is done with ==
450 fun index_of
(item
: E
): Int
454 if i
.item
== item
then return i
.index
460 redef fun iterator
: IndexedIterator[E
] is abstract
462 # Two sequences are equals if they have the same items in the same order.
465 if not o
isa SequenceRead[nullable Object] then return false
467 if o
.length
!= l
then return false
470 if self[i
] != o
[i
] then return false
476 # because of the law between `==` and `hash`, hash is redefined to be the sum of the hash of the elements
480 for e
in self do res
+= res
.hash
485 # Sequence are indexed collection.
486 # The first item is 0. The last is `length-1`.
487 interface Sequence[E
]
488 super SequenceRead[E
]
489 super SimpleCollection[E
]
491 # Set the first item.
492 # Is equivalent with `self[0] = item`.
494 do self[0] = item
end
497 # Is equivalent with `self[length-1] = item`.
508 # A synonym of `push`
509 redef fun add
(e
) do push
(e
)
511 # Add an item after the last.
512 fun push
(e
: E
) is abstract
514 # Add each item of `coll` after the last.
515 fun append
(coll
: Collection[E
]) do for i
in coll
do push
(i
)
517 # Remove the last item.
518 fun pop
: E
is abstract
520 # Add an item before the last.
521 fun unshift
(e
: E
) is abstract
523 # Remove the first item.
524 # The second item become the first.
525 fun shift
: E
is abstract
527 # Set the `item` at `index`.
528 fun []=(index
: Int, item
: E
) is abstract
530 # Remove the item at `index` and shift all following elements
531 fun remove_at
(index
: Int) is abstract
534 # Iterators on indexed collections.
535 interface IndexedIterator[E
]
537 # The index of the current item.
538 fun index
: Int is abstract
541 # Associative arrays that internally uses couples to represent each (key, value) pairs.
542 interface CoupleMap[K
: Object, E
]
544 # Return the couple of the corresponding key
545 # Return null if the key is no associated element
546 protected fun couple_at
(key
: K
): nullable Couple[K
, E
] is abstract
550 var c
= couple_at
(key
)
559 # Iterator on CoupleMap
561 # Actually is is a wrapper around an iterator of the internal array of the map.
562 class CoupleMapIterator[K
: Object, E
]
563 super MapIterator[K
, E
]
564 redef fun item
do return _iter
.item
.second
566 #redef fun item=(e) do _iter.item.second = e
568 redef fun key
do return _iter
.item
.first
570 redef fun is_ok
do return _iter
.is_ok
577 var _iter
: Iterator[Couple[K
,E
]]
579 init(i
: Iterator[Couple[K
,E
]]) do _iter
= i
582 # Some tools ###################################################################
584 # Two objects in a simple structure.
587 # The first element of the couple.
588 readable writable var _first
: F
590 # The second element of the couple.
591 readable writable var _second
: S
593 # Create a new instance with a first and a second object.