The task seems to be a Google Code Jam problem (which must satisfy
strict time requirements). I think Michael feels concerned that
Clojure programs in general would run ten times slower than equivalent
Java programs.
--
Peteris Erins
--
You received this message because you are subscribed to
--
Peteris Erins
--
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 members are moderated - please be patient with your
first post.
To unsubscribe from this group,
ms like something we would need to be
able to feed into the macro at compile-time.
On Dec 23, 11:29 pm, David Nolen wrote:
> On Fri, Dec 23, 2011 at 4:10 PM, Peteris wrote:
> > Hi,
>
> > I wrote a simple SAT solver macro on top of core.logic today (code at
> >http://pet
ols in the expression, nor
the exact symbols used, nor the boolean expression itself.
On Dec 24, 12:15 am, David Nolen wrote:
> Do something like this not work for you?
>
> (defn foo [p q]
> (sat [p q] (and p q)))
>
> David
>
>
>
>
>
>
>
> On Fri, Dec 23, 2011
> David
>
>
>
>
>
>
>
> On Fri, Dec 23, 2011 at 5:39 PM, Peteris wrote:
> > I don't understand, the value of foo should be independent of the
> > values of its arguments, right?
>
> > To motivate the application better, I want to be able to do sy
arguments where in
Haskell, one would resort to lists. Addition is an example where any
non-negative number of arguments is fine. If (+ 3) was a function,
then you would not be able to (apply + u) to get the sum of the list u
when u is of length one.
--
Peteris Erins
On Dec 29, 1:40 am, ron wrote:
>
