Add DisjointMap.keys and values properties

Author: Virtlink

disjointmap/src/main/kotlin/net/pelsmaeker/collections/DiffingMutableUnionFindMap.kt

@@ -6,7 +6,11 @@ package net.pelsmaeker.collections
  * Given an underlying union-find map U, and this map M:
  * A key can be added to M, which is not found in U.
  */
-class DiffingMutableUnionFindMap<K, V>: MutableDisjointMap<K, V> {
+class DiffingMutableUnionFindMap<K, V> : MutableDisjointMap<K, V> {
+
+    override val keys: Set<K> get() = TODO()
+    override val values: Collection<V> get() = TODO()
+
     override val size: Int
         get() = TODO("Not yet implemented")
 

disjointmap/src/main/kotlin/net/pelsmaeker/collections/DisjointMap.kt

@@ -17,6 +17,12 @@ interface DisjointMap<K, out V> {
     /** Determines whether the collection is not empty. */
     fun isNotEmpty(): Boolean = !isEmpty()
 
+    /** The keys in the disjoint map. */
+    val keys: Set<K>
+
+    /** The values in the disjoint map. */
+    val values: Collection<V>
+
     /**
      * Gets the value associated with the set that contains the specified key;
      * or `null` when the key is not in the map.

disjointmap/src/main/kotlin/net/pelsmaeker/collections/MutableUnionFindMap.kt

@@ -22,6 +22,12 @@ class MutableUnionFindMap<K, V> internal constructor(
 
     override val size: Int get() = _roots.size + _parents.size
 
+    override val keys: Set<K>
+        get() = _roots.keys + _parents.keys
+
+    override val values: Collection<V>
+        get() = _roots.values
+
     override operator fun get(key: K): V? {
         val rep = find(key) ?: return null
         return this._roots[rep]

disjointmap/src/main/kotlin/net/pelsmaeker/collections/PersistentUnionFindMap.kt

@@ -1,6 +1,7 @@
 package net.pelsmaeker.collections
 
 import kotlinx.collections.immutable.*
+import kotlin.collections.plus
 
 /**
  * A persistent union-find map.
@@ -32,6 +33,12 @@ class PersistentUnionFindMap<K, V> internal constructor(
 
     override val size: Int get() = _roots.size + _parents.size
 
+    override val keys: Set<K>
+        get() = _roots.keys + _parents.keys
+
+    override val values: Collection<V>
+        get() = _roots.values
+
     override operator fun get(key: K): V? {
         val rep = find(key) ?: return null
         return this._roots[rep]
@@ -169,6 +176,12 @@ class PersistentUnionFindMap<K, V> internal constructor(
         override val size: Int
             get() = currentMap.size
 
+        override val keys: Set<K>
+            get() = currentMap.keys
+
+        override val values: Collection<V>
+            get() = currentMap.values
+
         override fun isEmpty() = currentMap.isEmpty()
 
         override fun get(key: K): V? = currentMap.get(key)