mirror of
https://github.com/justinethier/cyclone.git
synced 2025-05-19 05:39:17 +02:00
Added TODO's
This commit is contained in:
parent
d07f3fe285
commit
299478b3d9
1 changed files with 3 additions and 1 deletions
|
@ -6,6 +6,8 @@ Bags are like sets, but can contain the same object more than once. However, if
|
|||
|
||||
The procedures for creating and manipulating bags are the same as those for sets, except that set is replaced by bag in their names, and that adjoining an element to a bag is effective even if the bag already contains the element. If two elements in a bag are the same in the sense of the bag's comparator, the implementation may in fact store just one of them.
|
||||
|
||||
TODO: above is not good enough, should at the very least add function signatures for the bag functions, and either copy the corresponding set description or link to this section and/or the corresponding set function.
|
||||
|
||||
See the [SRFI document](http://srfi.schemers.org/srfi-113/srfi-113.html) for more information.
|
||||
|
||||
- Constructors:
|
||||
|
@ -514,7 +516,7 @@ Symmetric difference is not extended beyond two sets. Elements in the result set
|
|||
|
||||
# bag-union
|
||||
|
||||
TODO:
|
||||
TODO: need to integrate content below with the 4 (8?) applicable bag procedures
|
||||
The bag-union, bag-intersection, bag-difference, and bag-xor procedures (and their linear update analogues) behave as follows when both bags contain elements that are equal in the sense of the bags' comparator:
|
||||
|
||||
For bag-union, the number of equal elements in the result is the largest number of equal elements in any of the original bags.
|
||||
|
|
Loading…
Add table
Reference in a new issue