-
Notifications
You must be signed in to change notification settings - Fork 40
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Implement cljs version of ordered-map
- Loading branch information
Showing
1 changed file
with
191 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,191 @@ | ||
(ns flatland.ordered.map) | ||
|
||
(declare equiv-impl) | ||
|
||
(defn print-ordered-map [writer kvs ks opts] | ||
(pr-sequential-writer | ||
writer | ||
(fn [k w opts] | ||
(-write w (pr-str k)) | ||
(-write w \space) | ||
(-write w (pr-str (get kvs k)))) | ||
;; Printing with square brackets so that we can define a data_reader that | ||
;; preserves order. | ||
"[" ", " "]" | ||
opts | ||
ks)) | ||
|
||
(deftype OrderedMap [kvs ks] | ||
Object | ||
(toString [this] (pr-str* this)) | ||
(equiv [this that] (equiv-impl kvs that)) | ||
|
||
;; js/map interface | ||
(keys [this] (es6-iterator ks)) | ||
(entries [this] (es6-entries-iterator (seq kvs))) | ||
(values [this] (es6-iterator (vals kvs))) | ||
(has [this k] (not (nil? (.get kvs k)))) | ||
(get [this k] (.get kvs k)) | ||
(forEach [this f] | ||
(doseq [k ks] | ||
(f k (get kvs k) this))) | ||
(forEach [this f use-as-this] | ||
(doseq [k ks] | ||
(.call f use-as-this k (get kvs k) this))) | ||
|
||
;; js fallbacks | ||
(key_set [this] (to-array (keys kvs))) | ||
(entry_set [this] (to-array (map to-array kvs))) | ||
(value_set [this] (to-array (map val kvs))) | ||
|
||
ICloneable | ||
(-clone [_] (OrderedMap. kvs ks)) | ||
|
||
;; IIterable | ||
;; (-iterator [_] ) | ||
|
||
IWithMeta | ||
(-with-meta [this new-meta] | ||
(if (identical? (meta kvs) new-meta) | ||
this | ||
(OrderedMap. (with-meta kvs new-meta) ks))) | ||
|
||
IMeta | ||
(-meta [this] (meta kvs)) | ||
|
||
ICollection | ||
(-conj [coll entry] | ||
(if (vector? entry) | ||
(OrderedMap. (conj kvs entry) (if (contains? kvs (-nth entry 0)) | ||
ks | ||
(conj ks (-nth entry 0)))) | ||
(OrderedMap. (conj kvs entry) (into ks | ||
(comp (map #(-nth % 0)) | ||
(remove #(contains? kvs %))) | ||
entry)))) | ||
|
||
IEmptyableCollection | ||
(-empty [this] | ||
(if (seq ks) | ||
(OrderedMap. (-empty kvs) []) | ||
this)) | ||
|
||
IEquiv | ||
(-equiv [this that] (equiv-impl kvs that)) | ||
|
||
IHash | ||
(-hash [_] (hash kvs)) | ||
|
||
ISeqable | ||
(-seq [this] | ||
(when (seq ks) | ||
(map #(-find kvs %) ks))) | ||
|
||
ICounted | ||
(-count [this] (count kvs)) | ||
|
||
ILookup | ||
(-lookup [this attr] (-lookup kvs attr)) | ||
(-lookup [this attr not-found] (-lookup kvs attr not-found)) | ||
|
||
IAssociative | ||
(-assoc [coll k v] | ||
(OrderedMap. (assoc kvs k v) (if (contains? kvs k) | ||
ks | ||
(conj ks k)))) | ||
(-contains-key? [this k] | ||
(contains? kvs k)) | ||
|
||
IFind | ||
(-find [this k] | ||
(-find kvs k)) | ||
|
||
IMap | ||
(-dissoc [this k] | ||
(if (contains? kvs k) | ||
(OrderedMap. (dissoc kvs k) (into [] (remove #{k}) ks)) | ||
this)) | ||
|
||
IKVReduce | ||
(-kv-reduce [coll f init] | ||
(reduce | ||
(fn [acc k] | ||
(f acc k (get kvs k))) | ||
init | ||
ks)) | ||
|
||
IFn | ||
(-invoke [this k] (kvs k)) | ||
(-invoke [this k not-found] (kvs k not-found)) | ||
|
||
IPrintWithWriter | ||
(-pr-writer [_ writer opts] | ||
(-write writer "#ordered/map ") | ||
(print-ordered-map writer kvs ks opts))) | ||
|
||
(defn equiv-impl [kvs that] | ||
(= kvs (if (instance? OrderedMap that) | ||
(.-kvs that) | ||
that))) | ||
|
||
(defn ordered-map [& kvs] | ||
(OrderedMap. (apply hash-map kvs) | ||
(mapv first (partition 2 kvs)))) | ||
|
||
(comment | ||
(ordered-map :foo 123 :bar 456) | ||
;; => #ordered/map [:foo 123, :bar 456] | ||
|
||
(conj (ordered-map :foo 123 :bar 456) [:baz 123]) | ||
;; => #ordered/map [:foo 123, :bar 456, :baz 123] | ||
|
||
(assoc (ordered-map :foo 123 :bar 456) | ||
:baz 123 | ||
:baq 999) | ||
;; => #ordered/map [:foo 123, :bar 456, :baz 123, :baq 999] | ||
|
||
(merge (ordered-map :foo 123 :bar 456) | ||
{:baz 123 | ||
:baq 999}) | ||
;; => #ordered/map [:foo 123, :bar 456, :baz 123, :baq 999] | ||
|
||
(= (ordered-map :foo 123 :bar 456 :baz 123) | ||
{:foo 123 :bar 456 :baz 123}) | ||
;; => true | ||
|
||
(= {:foo 123 :bar 456 :baz 123} | ||
(ordered-map :foo 123 :bar 456 :baz 123)) | ||
;; => true | ||
|
||
(map? (ordered-map :foo 123 :bar 456 :baz 123)) | ||
;; => true | ||
|
||
(empty (ordered-map :foo 123 :bar 456 :baz 123)) | ||
;; => #ordered/map [] | ||
|
||
(ordered-map) | ||
;; => #ordered/map [] | ||
|
||
(seq (ordered-map)) | ||
;; => nil | ||
|
||
(reduce conj [] (ordered-map :foo 123 :bar 456 :baz 123)) | ||
;; => [[:foo 123] [:bar 456] [:baz 123]] | ||
|
||
(keys (ordered-map :foo 123 :bar 456 :baz 123)) | ||
;; => (:foo :bar :baz) | ||
|
||
(vals (ordered-map :foo 123 :bar 456 :baz 789)) | ||
;; => (123 456 789) | ||
|
||
(meta (with-meta (ordered-map) {:foo :bar})) | ||
;; => {:foo :bar} | ||
|
||
(-> (ordered-map) | ||
(assoc-in [:foo :bar] 1) | ||
(assoc-in [:foo :baz] 2)) | ||
|
||
(into (ordered-map) [[:foo 1] [:bar 2] [:foo 3]]) | ||
;; #ordered/map [:foo 3, :bar 2] | ||
|
||
) |