diff --git a/pyqtree.py b/pyqtree.py
index <HASH>..<HASH> 100644
--- a/pyqtree.py
+++ b/pyqtree.py
@@ -343,4 +343,9 @@ class Index(_QuadTree):
         Returns:
         - A list of inserted items whose bounding boxes intersect with the input bbox.
         """
-        return list(set(self._intersect(bbox)))
+        uniq = []
+        for item in self._intersect(bbox):
+            if item not in uniq:
+                uniq.append(item)
+            
+        return uniq
diff --git a/pyqtree_test.py b/pyqtree_test.py
index <HASH>..<HASH> 100644
--- a/pyqtree_test.py
+++ b/pyqtree_test.py
@@ -5,7 +5,7 @@ INDEX_BBOX = (0, 0, 10, 10)
 ITEM1 = 'Item 1'
 BBOX1 = (0, 0, 0, 0)
 
-ITEM2 = 'Item 2'
+ITEM2 = {'name': 'Item 2'} # non-hashable
 BBOX2 = (1, 1, 1, 1)
Add support for non-hashable items