   (dc/quick-check 1000 (anti-symmetric-prop 2))
   (dc/quick-check 1000 (total-prop 1))
   (dc/quick-check 1000 (total-prop 2))
-  (dc/quick-check 1000 (building-prop gen-assoc))
+  (dc/quick-check 1000 (building-prop gen-assoc 1))
   (dc/quick-check 10000 (building-prop gen-action))
   ;; cljs.core.pr_str(cemerick.double_check.quick_check(1000, aurora.btree.building_prop(aurora.btree.gen_action)))
   (dc/quick-check 10000 (lookup-prop gen-action))

(defn key= [as bs]
  (== 0 (key-compare as bs)))

(defn key-lt [as bs]
  (== -1 (key-compare as bs)))


(defn run-intersection-prop [min-keys key-len actionss movements]
  (let [trees (map #(apply-to-tree (tree min-keys key-len) %) actionss)
        elems (apply clojure.set/intersection (map #(set (map vec %)) trees))
        sorted-map (into (sorted-map-by key-compare) elems)
        iterator-results (apply-to-iterator (intersection (into-array (map iterator trees))) movements)
        elems-results (apply-to-elems (seq sorted-map) movements)]
    (= iterator-results elems-results)))
