         ^HashMap remove (nth vars 1),
         ^HashMap pre*   (nth vars 2),
 
-        ^LinkedList non-empty-removes (LinkedList.),
+        ^HashSet non-empty-removes (HashSet.),
 
         base-set-1 (:base-set G-1),
         post-2     (:post G-2),

                    (not (contains? sim-u x)))
              (.put remove [u r*]
                    (conj (.get remove [u r*]) w*))
              (.addLast non-empty-removes [u r*])))))
      (.put remove [v r] #{})
      (.removeFirst non-empty-removes))
    (HashMap->hash-map sim)))



        conexp.contrib.dl.framework.semantics
        conexp.contrib.dl.util.graphs)
  (:use clojure.contrib.pprint)
  (:import [java.util HashMap HashSet]))

(ns-doc
 "Implements description graphs and common operations on them.")
