A very minimalistic and intentionally incomplete implementation of Erlang proplists (ordered pairs that support random access)
A very minimalistic and intentionally incomplete implementation of Erlang proplists (ordered pairs that support random access)
(contains? plist key)Returns true if the list contains at least one entry for the given key, false otherwise
Returns true if the list contains at least one entry for the given key, false otherwise
An alias for clojure.core/count, which works exactly the same for proplists
An alias for clojure.core/count, which works exactly the same for proplists
(create & xs)Creates a new property list (a vector of pairs)
Creates a new property list (a vector of pairs)
(get plist key)(get plist key not-found)Returns the first value associated with the given key
Returns the first value associated with the given key
An alias for clojure.core/nth, which will return the nth pair as a vector
An alias for clojure.core/nth, which will return the nth pair as a vector
cljdoc builds & hosts documentation for Clojure/Script libraries
| Ctrl+k | Jump to recent docs |
| ← | Move to previous article |
| → | Move to next article |
| Ctrl+/ | Jump to the search field |