-
```
I would love to replace our implementation of a synchronous event bus with the
one from Guava. They do pretty much the same thing except for one notable
difference: Ours propagates exceptions th…
-
I'm trying to process the airline data, only the start 30000 lines of the 1987.csv, without header.
from.dfs(
mapreduce(
input = '/temp30000',
input.format = make.input.format("csv", sep = …
Feifo updated
10 years ago
-
I hate to meddle in other people's business, but I am really concerned about Cinnamon future and about its leadership.
Cinnamon development looks sadly neglected, and sometimes I even wonder if it w…
-
I've started working on super-classes, they're a little different to Haskell's - here's what I want:
``` haskell
class Functor f where
() :: forall a b. (a -> b) -> f a -> f b
class Bind f -> (Fun…
-
A constraint satisfaction problem consists of three components X, D, and C
X is a set of variables, {X1, ..., Xn}
D is a set of domain, {D1,...,Dn}
C is a set of constraints that specify allowable co…
-
_From [josiah.oberholtzer](https://code.google.com/u/josiah.oberholtzer/) on May 18, 2012 15:14:58_
Both constraint solvers in constrainttools use (one of) the least optimized constraint-solving-algo…
-
1. Start a cluster of two rethinkdb nodes:
```
rdb1$ rethinkdb
rdb2$ rethinkdb --port-offset 1 -j localhost:29015
```
1. Go to data explorer, create a table, and insert a bunch of documents (I magica…
-
How about a chapter about practical use cases for core.logic?
-
(Constraint satisfaction problems)
-
In general, a problem can have more than one solution where the objective is optimal. Currently the library only finds the first. Is it possible to add functionality to find all the optimal solutions?…