 
 (defn apply-to-tree [tree actions]
   (doseq [action actions]
-    (prn action)
     (case (nth action 0)
       :assoc! (.assoc! tree (nth action 1) (nth action 2))
       :dissoc! (.dissoc! tree (nth action 1)))
-    (.pretty-print tree)
-    (prn tree)
-    (.valid! tree))
+    (do
+      (prn action)
+      (.pretty-print tree)
+      (prn tree)
+      (.valid! tree)))
   tree)
 
 (defn apply-to-sorted-map [map actions]

                (run-denotational-prop min-keys actions)))

;; TODO iterator tests

(comment
  (do

                #_(assert (= lower (aget keys 0)) (pr-str lower keys))
                #_(assert (= upper (aget keys (- (alength keys) 1))) (pr-str upper keys)))
              (do
                (dotimes [ix (count children)]
                  (assert (= ix (.-parent-ix (aget children ix)))))
                (assert (= (count keys) (count vals) (dec (count children))) (pr-str keys vals children))
                #_(assert (= lower (.-lower (aget children 0))) (pr-str lower (.-lower (aget children 0))))
                #_(assert (= upper (.-upper (aget children (- (alength children) 1)))) (pr-str upper (.-upper (aget children (- (alength children) 1)))))
