         (let [idx         (bitmap-indexed-node-index bitmap bit)
               key-or-nil  (aget arr (* 2 idx))
               val-or-node (aget arr (inc (* 2 idx)))]
-          (cond (coercive-= nil key-or-nil) (.inode-find val-or-node (+ shift 5) hash key not-found)
+          (cond (nil? key-or-nil) (.inode-find val-or-node (+ shift 5) hash key not-found)
                 (= key key-or-nil)          [key-or-nil val-or-node]
                 :else not-found)))))
 

    (-lookup node k not-found)))

(defn- tree-map-add [comp tree k v found]
  (if (coercive-= tree nil)
    (RedNode. k v nil nil nil)
    (let [c (comp k (.-key tree))]
      (cond

                         (if-not (nil? nr)
                           nr
                           (VectorNode. (.-edit root) (make-array 32))))]
          (if (and (< 5 shift) (nil? (pv-aget new-root 1)))
            (let [new-root (tv-ensure-editable (.-edit root) (pv-aget new-root 0))]
              (set! root  new-root)
              (set! shift (- shift 5))
