From 3486f04846ed8ccf05de2865795fd9fae0fd8256 Mon Sep 17 00:00:00 2001 From: An Ionescu Date: Wed, 24 Apr 2019 00:43:51 +0000 Subject: [PATCH] Update README.md --- README.md | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/README.md b/README.md index f5a52b0..2439673 100644 --- a/README.md +++ b/README.md @@ -32,11 +32,11 @@ So far the only implementation is the composite "family". Named thusly because t - ``CompositeMultiBiMap``. Uses three dictionaries. One that maps keys to value hashsets, a second that maps value hashsets to keys, and a third dictionary that maps unique values to key hashsets. ## Features & Complexity -| Implementation | Fwd Lookup | Rev Lookup | Add | Remove | ContainsKey | ContainsValue | Space | +| Implementation | Forward Lookup | Reverse Lookup | Add | Remove | ContainsKey | ContainsValue | Space | | ------------------- | -------------- | -------------- | ----------- | ----------- | ----------- | ------------- | ---------------- | -| CompositeBiMap | O(1)/O(n) | O(1)/O(n) | O(1)/O(n) | O(1)/O(n) | O(1)/O(n) | O(1)/O(n) | O(2\*k + vu) | -| CompositeMultiMap | O(1)/O(n) | N/A | O(1)/O(n) | O(1)/O(n) | O(1)/O(n) | O(k)/O(k^2) | O(k + v) | -| CompositeMultiBiMap | O(1)/O(n) | O(1)/O(n) | O(1)/O(n) | O(1)/O(n) | O(1)/O(n) | O(1)/O(n) | O(3\*k + v + vu) | +| CompositeBiMap | O(1)/O(n) | O(1)/O(n) | O(1)/O(n) | O(1)/O(n) | O(1)/O(n) | O(1)/O(n) | O(2\*k+vu) | +| CompositeMultiMap | O(1)/O(n) | N/A | O(1)/O(n) | O(1)/O(n) | O(1)/O(n) | O(k)/O(k^2) | O(k+v) | +| CompositeMultiBiMap | O(1)/O(n) | O(1)/O(n) | O(1)/O(n) | O(1)/O(n) | O(1)/O(n) | O(1)/O(n) | O(3\*k+v+vu) | Note: values to the left of the slash indicate the "average" case, generally signifying the absence of hash collisions. The value to the right indicates the actual worst case time complexity. - n => generic item count. -- GitLab