Implement faster vector comparison.

Author: whilo

src/datahike/db.cljc

@@ -316,6 +316,32 @@
     (cmp-val (.-v d1) (.-v d2))
     (cmp-num (.-tx d1) (.-tx d2))))
 
+(extend-protocol hc/IKeyCompare
+  clojure.lang.PersistentVector
+  (compare [key1 key2]
+    (if-not (= (class key2) clojure.lang.PersistentVector)
+      -1 ;; HACK
+      (let [[a b c d] key1
+            [e f g h] key2]
+        (combine-cmp
+         (hc/compare a e)
+         (hc/compare b f)
+         (hc/compare c g)
+         (hc/compare d h)))))
+  java.lang.String
+  (compare [key1 key2]
+    (compare key1 key2))
+  clojure.lang.Keyword
+  (compare [key1 key2]
+    (compare key1 key2))
+  nil
+  (compare [key1 key2]
+    (if (nil? key2)
+      0 -1)))
+
+
+
+
 (defrecord EAVTKey [datom]
   hc/IKeyCompare
   (compare [this other]

test/datahike/test/store.cljc

@@ -13,7 +13,7 @@
 
 
 (def db (d/db-with
-         (d/empty-db {:name {:db/index true}})
+         (d/empty-db #_{:name {:db/index true}})
          [{ :db/id 1, :name  "Ivan", :age   15 }
           { :db/id 2, :name  "Petr", :age   37 }
           { :db/id 3, :name  "Ivan", :age   37 }
@@ -63,7 +63,7 @@
     (time
      (d/db-with
       db
-      (for [i (shuffle (range 5 10000))]
+      (for [i (range 5 100000)]
         {:db/id i :name (str "Bot" i) :age i}))))
 
   ;; TODO why is logarithmic query scaling so bad?
@@ -74,10 +74,11 @@
   (time
    (doseq [i (range 100)]
      (d/q '[:find ?e
-            :where [?e :name "Bot42"]] new-db)))
+            :where [?e :name "Bot4200"]] new-db)))
+  
 
   (time (d/q '[:find ?e
-               :where [?e :name "Ivan"]] db))
+               :where [?e :name "Ivan"]] new-db))
 
   )