Apply shims to sortedcollection for benchmarking

Author: grantjenks

README.rst

@@ -4,6 +4,7 @@ Python Sorted Containers
 .. todo::
 
    * Add __delitem__ to sorted dict views?
+   * SortedKeyList uses identity function (shows overhead)
    * Document migrating bintrees insert to soco
    * Rename github repo
    * Update coverage

tests/benchmark_sortedlist.py

@@ -119,33 +119,6 @@ def fill_values(obj, size):
 
 try:
     from .sortedcollection import SortedCollection
-    from bisect import bisect_left
-
-    SortedCollection.add = SortedCollection.insert
-
-    def update(self, iterable):
-        for value in iterable:
-            self.insert(value)
-    SortedCollection.update = update
-
-    def bisect(self, item):
-        key = self._key(item)
-        pos = bisect_left(self._keys, key)
-        return pos
-    SortedCollection.bisect = bisect
-
-    def pop(self):
-        self._keys.pop()
-        return self._items.pop()
-    SortedCollection.pop = pop
-
-    def discard(self, item):
-        try:
-            self.remove(item)
-        except ValueError:
-            pass
-    SortedCollection.discard = discard
-
     kinds['List'] = SortedCollection
 except ImportError:
     warnings.warn('No module named sortedcollection', ImportWarning)
@@ -204,7 +177,7 @@ def discard(self, item):
         'func': '__delitem__',
         'limit': 1000000
     }
-del impls['delitem']['List']
+limit('delitem', 'List', 10000)
 
 for name, kind in kinds.items():
     impls['bisect'][name] = {
@@ -431,7 +404,7 @@ def run(self, value):
         'func': 'run',
         'limit': 1000000
     }
-del impls['intervals']['List']
+limit('intervals', 'List', 10000)
 
 for name, kind in kinds.items():
     impls['init'][name] = {

tests/sortedcollection.py

@@ -199,6 +199,33 @@ def find_gt(self, k):
             return self._items[i]
         raise ValueError('No item found with key above: %r' % (k,))
 
+    # GrantJ 05/16/18 -- Additions for benchmarking.
+
+    add = insert
+
+    def update(self, iterable):
+        for value in iterable:
+            self.insert(value)
+
+    def bisect(self, item):
+        key = self._key(item)
+        pos = bisect_left(self._keys, key)
+        return pos
+
+    def pop(self):
+        self._keys.pop()
+        return self._items.pop()
+
+    def discard(self, item):
+        try:
+            self.remove(item)
+        except ValueError:
+            pass
+
+    def __delitem__(self, index):
+        del self._keys[index]
+        del self._items[index]
+
 
 # ---------------------------  Simple demo and tests  -------------------------
 if __name__ == '__main__':