Thank you.
Also recently made a use of your https://github.com/sunng87/slacker lib -
really interesting approach.
On Thursday, June 30, 2016 at 6:08:27 PM UTC+3, Sun Ning wrote:
>
> Hi all,
>
> Just to announce the first release of diehard[1], a clojure wrapper over
> the Failsafe[2] library,
Thanks for the pointer to your library, Jason. I hadn't known about it.
In response to the interest and questions I've been getting about
better-cond, I've added a Rationale section to the README, and I've
mentioned your library in that section:
https://github.com/Engelberg/better-cond#rationale
In case you care. Here https://github.com/naleksander/scalduce are Scala
examples, so you can easily compare the overhead.
For me Clojure is more enjoyable, however if I were to share my code (for
example as an library) with others (for example beginner users or with
weaker skills) than statical
Functions are a type of monad, and function composition is a type of
monadic binding. You could certainly say that middleware are a type of
monad, but so many things can be thought of as monads that's not hugely
useful in and of itself.
- James
On 1 July 2016 at 18:14, Scott Klarenbach wrote:
>
Hi,
I am struggling with recursive Spec declarations, more in particular how
two Spec definitions can refer to each other. In the example below, I use a
"forward" declaration, but that does not seem very elegant. Am I missing
something?
The more fundamental question, however, is how to imple
> On Jul 1, 2016, at 10:34 AM, Timothy Baldridge wrote:
>
> You can write a protocol, then extend it: ...
Ah! I completely blanked on protocol dispatch being resolved at compile time if
possible. Thanks!
Does this only work if the type hint is exactly the extended type, or does this
underst
I'm looking for some insight into the relationship between Monads and
Middleware.
It seems to me that middleware (ala Ring, Boot) is really just a subset of
Monads, where bind and lift are globally agreed upon conventions, rather
than explicitly defined. For example, with middleware you need e
You can write a protocol, then extend it:
(defprotocol IBufferLength
(buffer-length [this]))
(extend-protocol IBufferLength
(Class/forName "[B")
(buffer-length [this] ...)
ByteBuffer
(buffer-length [this] ...))
On Fri, Jul 1, 2016 at 9:15 AM, Erik Assum wrote:
> A multimethod which
A multimethod which dispatches on type, or maybe extend the counted(?) protocol
to these two types?
Erik.
--
i farta
> Den 1. jul. 2016 kl. 17.12 skrev lvh <_...@lvh.io>:
>
> Hi,
>
>
> I have some code that wants to know the appropriate length of a byte buffer.
> These can be byte arrays (
Hi,
I have some code that wants to know the appropriate length of a byte buffer.
These can be byte arrays (as in [B) or java.nio.ByteBuffers. For the former, I
can call (alength ^bytes buf), for the latter I call (.remaining ^ByteBuffer
buf). Is there a way to just write a fn or macro that pic
Hi Everyone,
I'd like to announce functional-vaadin, a library for building Clojure
webapps using the Vaadin UI framework. Since Vaadin is Java-based, this can
already be done - but it's clunky: lots of doto and setter calls,
temporaries to hold parts of the UI being constructed, etc. etc. This
You've got me thinking whether there's a more general thing which could be
done for packthread: (https://github.com/maitria/packthread).
Hrmm...
On Fri, Jul 1, 2016 at 5:25 AM, Mark Engelberg
wrote:
> I should add that Dunaj already has this feature, so if you are a user of
> Dunaj you do not n
Glad you like it!
I'm thinking of changing it so that empty collections render in-cell, like
scalars.
On Thu, Jun 30, 2016 at 12:11 PM, > wrote:
> Tried this out to visualize a DFA used for dictionary matching. Very cool.
>
>
> On Monday, June 27, 2016 at 1:57:56 PM UTC-4, Howard M. Lewis Ship
Did you read my whole question? It doesn't work to have the implementation
namespace require the spec namespace either, as I demonstrated in my second
example, where the spec for the factor function uses the prime? predicate.
On Friday, July 1, 2016 at 1:38:23 AM UTC-4, Sean Corfield wrote:
>
>
I should add that Dunaj already has this feature, so if you are a user of
Dunaj you do not need this library.
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to this group, send email to clojure@googlegroups.com
Note that posts from new member
Years ago, Christophe Grand wrote a blog post about how to achieve flatter,
clearer, less-nested code by using a special version of Clojure's cond that
supported :let clauses (just like Clojure's for comprehensions), as well as
:when-let.
I've been using that code on a daily basis ever since, copy
This is brilliant! I was looking for something like this to create images
to use in talk slides. Thank you!
On Thu 30 Jun 2016 at 20:11, wrote:
> Tried this out to visualize a DFA used for dictionary matching. Very cool.
>
>
> On Monday, June 27, 2016 at 1:57:56 PM UTC-4, Howard M. Lewis Ship wro
17 matches
Mail list logo
