Matus Goljer

Thanks! A couple notes though: 1. Binary search is a nice idea, but with linked lists it's no better than just a linear scan (`nth` is O(n)), and much more...

Right, but isn't your code binary search? Or we're misunderstanding each other.

We already have this except for functions: (funcall (-juxt '1+ (lambda (x) (format "Number %s" x)) (lambda (x) (* 10 x))) 3) is the first example's equivalent. I suppose we...

@cireu That works fine if the keys are symbols, but what to do with strings? `"foo"."bar"` is not correct read syntax, and adding the dot to the string might break...

Generally we don't care much for performance until proven necessary. Elisp isn't a mathematical package so we're not epxecting you to work with lists of 10^5 orders. For anything less...

Oh wait nevermind, it's actually correct. I thought `number-sequence` just generated `(10 10 10 10 10 10 ...)` which would then make the bias towards front element (since e.g rotation...

I think the problem with `-shuffle2` is that it doesn't update the source, i.e. can also shuffle numbers from the front to the "working" position. That shouldn't happen in the...

There's the `-let` macro which allows for desctructuring ```elisp (-let (((front back) (-split-at 3 (list 1 2 3 4 5 6)))) (message "front %s back %s" front back)) ;; expanded...

Why is there a merge commit?

@basil-conto can you start a review with a change request? I'm not sure if people outside of the repo can do that. We could probably add you to collaborators anyway.