change static field syntax to new cljs format

Author: micha

README.md

@@ -13,7 +13,7 @@ produces the entries sorted by value.
 ### Dependency
 
 ```clojure
-[tailrecursion/cljs-priority-map "1.0.2"]
+[tailrecursion/cljs-priority-map "1.0.3"]
 ```
 
 ### Example

project.clj

@@ -1,4 +1,4 @@
-(defproject tailrecursion/cljs-priority-map "1.0.2"
+(defproject tailrecursion/cljs-priority-map "1.0.3"
   :description "ClojureScript priority map implementation based on clojure.data.priority-map"
   :url "https://github.com/tailrecursion/cljs-priority-map"
   :license {:name "Eclipse Public License"
@@ -7,6 +7,7 @@
   :plugins [[lein-cljsbuild "0.3.0"]]
   :cljsbuild {:builds {:test
                        {:source-paths ["test"]
+                        :dependencies [[org.clojure/clojurescript "0.0-1934"]]
                         :compiler {:output-to "public/test.js"
                                    :optimizations :advanced}
                         :jar false}}})

src/cljs/tailrecursion/priority_map.cljs

@@ -25,7 +25,7 @@
 
   IEmptyableCollection
   (-empty [this] (with-meta
-                   tailrecursion.priority-map.PersistentPriorityMap/EMPTY
+                   tailrecursion.priority-map.PersistentPriorityMap.EMPTY
                    meta))
 
   IEquiv
@@ -147,15 +147,15 @@
   (-invoke [this item not-found]
     (-lookup this item not-found)))
 
-(set! tailrecursion.priority-map.PersistentPriorityMap/EMPTY
+(set! tailrecursion.priority-map.PersistentPriorityMap.EMPTY
       (PersistentPriorityMap. (sorted-map) {} {} nil))
 
 (defn- pm-empty-by [comparator]
   (PersistentPriorityMap. (sorted-map-by comparator) {} {} nil))
 
 (defn- read-priority-map [elems]
   (if (map? elems)
-    (into tailrecursion.priority-map.PersistentPriorityMap/EMPTY elems)
+    (into tailrecursion.priority-map.PersistentPriorityMap.EMPTY elems)
     (reader-error nil "Priority map literal expects a map for its elements.")))
 
 (register-tag-parser! "tailrecursion.priority-map" read-priority-map)
@@ -164,7 +164,7 @@
   "keyval => key val
   Returns a new priority map with supplied mappings."
   ([& keyvals]
-     (loop [in (seq keyvals) out tailrecursion.priority-map.PersistentPriorityMap/EMPTY]
+     (loop [in (seq keyvals) out tailrecursion.priority-map.PersistentPriorityMap.EMPTY]
        (if in
          (recur (nnext in) (assoc out (first in) (second in)))
          out))))