Hello.
I noticed a post about this from 2013, so doing a bump.
The bit-wise operators appear to be supported for 'bigint' in
ClojureScript, but not in Clojure. Is support for these operations on
'bigint' in Clojure a future enhancement?
Thanks :)
-- Harmon
--
You received this message becau
Thanks very much for your responses. :) 'subseq' looks like it will do
what's needed.
-- Harmon
On Monday, May 25, 2020 at 4:47:58 PM UTC-5, Harmon Nine wrote:
>
> Is there an optimization for sorted-maps that, when you have a given key
> in the map, you can get the n
Is there an optimization for sorted-maps that, when you have a given key in
the map, you can get the next key in O(log n) time?
Given "compare" is the boolean function on which the sorted-map is based,
the following code will get the next-key given a current-key:
(defn get-next-key [my-map curr