abstract class $RO_BAG{ETP} < $CONTAINER{ETP} |
---|
**** | An unordered container in which the elements need not be unique
_ Definition: A bag is an arbitrary unordered collection, with extra accessing functionality _ This is a read-only abstraction in which no modifying operations are permitted. For documentation see: ____The_overall_organization_of_container_classes ____The_organization_and_usage_of_bags_and_related_classes _ |
$CONTAINER{_} | $STR | $ELT{_} | $ELT |
$RO_SET{_} | $VSET{_} | VSET{_} | $VBAG{_} | $VMULTIMAP{_,_} | $VMAP{_,_} | VMAP{_,_} | VMULTIMAP{_,_} | VBAG{_} | $RO_MULTIMAP{_,_} | $RO_MAP{_,_} | $MAP{_,_} | MAP{_,_} | $BAG{_} | BAG{_} |
add(e:ETP):$RO_BAG{ETP}; |
---|
**** | Result is a new bag containing all the elements of self and 'e' |
as_array:ARRAY{ETP}; |
---|
**** | Return the elements of the container in an array |
concat(arg:$ELT{ETP}): $RO_BAG{ETP}; |
---|
**** | Returns a bag containing all the elements of self and 'arg'. For elements that occur multiple times, the result contains the sum of the number of occurences in self and 'arg'
_ result=bag of all e s.t. result.count(e)=self.count(e)+arg.count(e) > 0 |
copy: SAME; |
---|
**** | Return a copy of the current container |
count(e:ETP):INT; |
---|
**** | Return the number of occurences of 'e' in self |
delete(e:ETP):$RO_BAG{ETP}; |
---|
**** | Result is a new bag containing all the elements of self except for an element equal to 'e', if one exists. If more than one element is equal to 'e', delete only one of them |
delete_all(e:ETP):$RO_BAG{ETP}; |
---|
**** | Result is a new bag containing all the elements of self except for any elements equal to 'e' |
elt!:ETP; |
---|
**** | Yield all the elements of self. The order is not defined. |
equals(c:$RO_BAG{ETP}):BOOL; |
---|
**** | Return true if both containers contain the same elements with the same number of repetitions, irrespective of the order of the elements |
has(e: ETP): BOOL; |
---|
**** | True if the container contains the element "e" |
intersection(arg:$RO_BAG{ETP}):$RO_BAG{ETP}; |
---|
**** | Returns a bag containing the elements common to self and 'arg' For elements that occur multiple times, the result contains the minimum number of occurrences in either self or 'arg'
_ result=bag of all e s.t. ______________result.count(e)=min(self.count(e),arg.count(e))_>_0_ |
is_empty:BOOL; |
---|
**** | Returns true if the size of the container = 0 |
is_subset_of(arg: $RO_BAG{ETP}): BOOL; |
---|
**** | Returns true if 'self' is a subset of 'arg'. For elements that occur multiple times, the number of occurences of the element in 'arg' must be greater than or equal to the number of occurences in self
_ result=true iff for all e in self: count(e) <= arg.count(e) |
n_unique: INT; |
---|
**** | Returns the number of unique elements in the bag
_ result = number of unique elements |
size: INT; |
---|
**** | Number of elements contained |
str:STR; |
---|
**** | Yield a string version of self |
union(arg:$RO_BAG{ETP}): $RO_BAG{ETP}; |
---|
**** | Returns a bag containing the elements of 'self' and 'arg'. For elements that occur multiple times, the result contains the maximum number of occurences in either self or 'arg' This definition permits the union of sets to be consistent with the union of bags.
_ result=bag of all e s.t. _____________result.count(e)=_max(self.count(e),arg.count(e))_>_0 |
unique!:ETP; |
---|
**** | Yield the unique elements of self. Equivalent to self.as_set.elt! |