From ac1301596111487b537a93f49bc171258adf06ae Mon Sep 17 00:00:00 2001
From: Grant Jenks <grant.jenks@gmail.com>
Date: Fri, 18 Sep 2015 10:30:28 -0700
Subject: [PATCH] Use sortedcontainers.SortedSet instead of blist.sortedset

---
 Macademia/scripts/algs/category_tree.py | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/Macademia/scripts/algs/category_tree.py b/Macademia/scripts/algs/category_tree.py
index 49b2068..044ea1c 100644
--- a/Macademia/scripts/algs/category_tree.py
+++ b/Macademia/scripts/algs/category_tree.py
@@ -1,6 +1,6 @@
 #!/usr/bin/python -O
 
-import blist
+import sortedcontainers
 
 import multiprocessing
 import collections
@@ -65,7 +65,7 @@ def compute_neighbors(cat, ancestors, descendants):
     LOGGER.info('computing neighbors for %s', cat.name)
     beg = time.time()
     neighbors = {}
-    sorted_scores = blist.sortedset()
+    sorted_scores = sortedcontainers.SortedSet()
     furthest = 1000000000000000000
     if cat in ancestors:
         for (c1, n1) in ancestors[cat]: