Changes between Version 2 and Version 3 of DataStructures

Timestamp:

07/03/14 07:41:44 (12 years ago)

Author:

siegel

Comment:

--

DataStructures

@@ -60 +60 @@
 == Sets ==
 
+Should we make it an ordered set, `$oset`?
+
+New type: `$set`.  Functions:
+
+{{{
+/* Returns the empty set whose elements (if it had any)
+ * would have the given type.  The type becomes associated
+ * with the set.  */
+$set $set_empty($type type);
+
+/* Returns the type of an element that goes in this set */
+$type $set_element_type($set v);
+
+/* Returns the set that is like the given one but with one more
+ * element added.  A runtime exception is generated if the thing pointed
+ * to by eltptr doesn't have the right type for s. */
+$set $set_add($set v, void * eltptr);
+
+/* Returns the set that is like the given one but with the specified element
+ * removed.  If the set does not contain the element the set returned
+ * will equal the given one. */
+$set $set_remove($set s, void * eltptr);
+
+/* Does the set contain the specified element? */
+_Bool $set_contains($set s, void * eltptr);
+
+$set $set_union($set s1, $set s2);
+
+$set $set_intersection($set s1, $set s2);
+
+$set $set_difference($set s1, $set s2);
+
+/* Returns the singleton set consisting of the single element
+ * specified by the pointer and the type */
+$set $set_single($type type, void * eltptr);
+
+// need a way to iterate over elements of a set.
+
+}}}
 
 
 == Maps ==
 
+`$map`
+
+{{{
+$map $map_empty($type keyType, $type valType);
+
+$map $map_put($map map, void * keyPtr, void * valPtr);
+
+void $map_get($map map, void * keyPtr, void * resultPtr);
+
+$map $map_removeKey($map map, void * keyPtr);
+}}}
+
+