Hi Colin, no worries, responses below-
On Thu, Mar 5, 2015 at 2:31 PM, Colin Yates colin.ya...@gmail.com wrote:
Hi Jonah,
Coffee consumed, post read - thoughts emerging:
- so the 'context' is essentially a service registry as well as
run-time state?
More the latter- about transient,
I'm happy to announce a project called Dunaj [1], which provides an
alternative core API for Clojure. Its main aim is to experimentally test
major additions to the language.
Dunaj /ˈdunaɪ/ is a set of core language experiments aimed to improve
Clojure language and its core API. It deals with
Hi Jonah,
Coffee consumed, post read - thoughts emerging:
- so the 'context' is essentially a service registry as well as
run-time state?
- if 'renew-session' and 'return-renewed-token' both needed to
execute in a single transaction that was separate to
'some-thing-else', how would that be
On 6 March 2015 at 00:45:47, adrian.med...@mail.yu.edu
(adrian.med...@mail.yu.edu) wrote:
it strikes me as odd that this project would not come out of
direct collaboration with Clojure's core contributors.
I should point out that there's enough people in the community who
do not find
Not sure exactly how to properly express my impression here, but it strikes
me as odd that this project would not come out of direct collaboration with
Clojure's core contributors. Proposed features should probably go through
the official channels if you are serious about getting them included
Le mercredi 4 mars 2015 22:08:13 UTC+1, Fluid Dynamics a écrit :
For examining adjacent items in a sequence, there are a few functional
(i.e., no mutable state) approaches.
When the output is a sequence with an element for each adjacent pair:
(map (fn [a b] ...) s (next s))
When the
bean?
--
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, send email to
Hello
Working with native libraries on the JVM has always been difficult because
you need to deploy dynamic libraries alongside your JAR and tweak the
dreaded java.library.path.
When I was looking for a better solution I discovered a nice hack in
gaverhae/naughtmq, by Gary Verhaegen : keep the
Why? One of the purposes of PyPy, for instance, was to make it easier to
experiment with new features in possible Python interpreters, and that's a
separate project not undertaken in direct collaboration with CPython's
authors.
On Thu, Mar 5, 2015 at 1:45 PM, adrian.med...@mail.yu.edu wrote:
Yeah, I'm excited to see some of the 10 write-ups. What's the ETA on the
first one?
On Thu, Mar 5, 2015 at 6:02 PM, Alex Miller a...@puredanger.com wrote:
I'm happy to see experiments if we can learn something useful. Can't
really judge more till the posts are out. Seems perfectly possible
Just a quick glance at the example project shows integrated type
definitions. I'm curious for sure.
--
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
Where is this example project?
On Thu, Mar 5, 2015 at 7:40 PM, Ivan L ivan.laza...@gmail.com wrote:
Just a quick glance at the example project shows integrated type
definitions. I'm curious for sure.
--
You received this message because you are subscribed to the Google
Groups Clojure
I'm happy to see experiments if we can learn something useful. Can't really
judge more till the posts are out. Seems perfectly possible that something
promising could get a design page and move towards inclusion in some way.
Alex
--
You received this message because you are subscribed to the
On Thu, Mar 5, 2015 at 2:42 AM, Xiangtao Zhou tao...@gmail.com wrote:
hi all,
is there some library or simple way to do it like the function
map-to-pojo in the following code ?
java code
class A{
public int a;
public String b;
}
clojure code
(def a {:a 1 :b 2})
(def b
Hello everyone,
I am an undergraduate student looking to participate in the GSOC this
summer. I've been looking through the project ideas
http://dev.clojure.org/display/community/Project+Ideas on the Clojure
Development site, and the one that looks most interesting to me is
implementing
The question of using may have different meanings depending on your
definition - if you include using libraries or frameworks built with
Clojure (partly or in whole) you could include all the companies who
deploy, for example, Apache Storm or use some of Puppet Labs' tools.
The consultancy
For the particular use case of removing duplicates there is a new dedupe in
Clojure 1.7:
http://crossclj.info/fun/clojure.core/dedupe.html
Alex
--
You received this message because you are subscribed to the Google
Groups Clojure group.
To post to this group, send email to
The email they use to correspond on this group are:
David - dnolen.li...@gmail.com
Nicola - brobro...@gmail.com
Daniel (GSoC organizer for Clojure), would there be any objection to
including email addresses of mentors on the Clojure GSOC 2015 projects
page? The question of what to do if someone
Looks interesting, thanks!
On Thu, Mar 5, 2015 at 4:43 PM, Leon Grapenthin
grapenthinl...@gmail.com wrote:
(defn rect2 [x y width height]
(let [lr [(+ width x) (+ width y)]]
(reify Rect
(upper-left [_] [x y])
(lower-right [_] lr)
(area [_] (* width height)
Just
Disclaimer: I’ve never done *any* Clojure programming, but I’m curious.
Here’s how I may model an on-screen rectangle in JavaScript, a classless
object oriented language:
let createRectangle = function (x, y, width, height) {
return {
get upperLeft() {
You could use Clojure protocols.
(defprotocol Rect
(upper-left [this])
(lower-right [this])
(area [this]))
(defn rect1 [x y width height]
(reify Rect
(upper-left [_] [x y])
(lower-right [_] [ (+ width x) (+ width y)])
(area [_] (* width height
(defn rect2 [x y width
Hi Colin- a simple example that uses a flow operator would be
(- context
do-something
do-some-io
do-a-last-thing )
with
(defn do-something [context]
(let [some-data (get-in context [:path :to :data :element])
result (pure-edge-function some-data)]
(assoc-in context [:path
Thanks Jonah - I will digest this over coffee...
On 5 March 2015 at 16:45, Jonah Benton jo...@jonah.com wrote:
Hi Colin- a simple example that uses a flow operator would be
(- context
do-something
do-some-io
do-a-last-thing )
with
(defn do-something [context]
(let [some-data
For the transducer version, I don’t think you need to keep track of the
previous value (fval). The decision to start a new partition group depends only
on the current item. Here’s my version. (Warning: virtually untested.) I
assume that the first item goes into the first partition no matter
thanks, i test with defrecord.
On Thursday, March 5, 2015 at 4:39:03 PM UTC+8, Colin Yates wrote:
Isn't this exactly what defrecord does?
On 5 March 2015 at 07:42, Xiangtao Zhou tao...@gmail.com javascript:
wrote:
hi all,
is there some library or simple way to do it like the
Isn't this exactly what defrecord does?
On 5 March 2015 at 07:42, Xiangtao Zhou tao...@gmail.com wrote:
hi all,
is there some library or simple way to do it like the function map-to-pojo
in the following code ?
java code
class A{
public int a;
public String b;
}
clojure code
(def
Tried myself and my first transducer for fun:
(defn partition-when
[f]
(fn [rf]
(let [a (java.util.ArrayList.)
fval (volatile! false)]
(fn
([] (rf))
([result]
(let [result (if (.isEmpty a)
result
Hi Stephen
Just seconding John Kane's post below - there are a few of us (including
John and Dan Stone) who met up at the Exeter Web session last week. I'd
definitely be interested in meeting up if something in Exeter works for you.
Martin
--
You received this message because you are
Hi Jonah,
This sounds very much like the model layer in DDD, which ironically is
exactly what I am building.
However, in the middle of a data flow a function needs to reach out to
a repository to make a decision - how does that fit in with the data
flow approach?
On 5 March 2015 at 13:39,
There are also a few of us in the Southampton/Winchester area
Get in touch if you are interested.
Thomas
On Tuesday, 3 March 2015 21:53:57 UTC, Stephen Wakely wrote:
Hi,
Are there any other Lispers in South Devon who would be interested in
meeting up and talking code? Clojure, Common
Yes, exactly.
That's fine, a node in the middle of the data flow can be responsible for
reaching out to the edge to synchronously get some data to feed into a
decision performed by the data flow. It would just do that through the edge
functions.
A request for data could also be asynchronously
I'm about to start training 4 devs on my team at Oracle in Clojure. My
manager is very nervous about putting Clojure into the product. I'm
forging on regardless :) I rewrote some components of our product in
Clojure in my spare time, mainly as a proof of concept that we could do
some of our
Hi Frank,
I use a similar function that combines partition-by and partition-all:
(defn partition-when
[f coll]
(map (partial apply concat) (partition-all 2 (partition-by f coll
Martin.
On Wed, Mar 4, 2015 at 10:19 PM, Ivan L ivan.laza...@gmail.com wrote:
I went though almost the
Sounds interesting - are there are instances that I can look at?
On 5 March 2015 at 14:15, Jonah Benton jo...@jonah.com wrote:
Yes, exactly.
That's fine, a node in the middle of the data flow can be responsible for
reaching out to the edge to synchronously get some data to feed into a
On 5 March 2015 at 14:08, Thomas th.vanderv...@gmail.com wrote:
There are also a few of us in the Southampton/Winchester area
Get in touch if you are interested.
I am in Southampton and would be interested in meeting some Clojurians.
Alan
--
You received this message because you are
This was fantastic. Really looking forward to the RRB Tree.
On Wednesday, March 4, 2015 at 12:31:54 PM UTC-5, Jean Niklas L'orange
wrote:
Hi Frank,
On Wednesday, March 4, 2015 at 12:24:42 PM UTC+1, Frank Castellucci wrote:
Will you be doing this for other data types?
I will have a
Hi Colin,
Another option, other than HOFs or dynamic binding, is what might be called
a data flow approach.
At the edge of the application are the functions that explicitly take
parameterized resources to perform edge state IO. These might be bare
functions, or they might be protocol
One workable possibility:
* init a core.async channel in the container
* pass the channel from the container into each child component at build
time using :opts or :state
* send the discovered size of each child component, with identifying data,
as a channel message during IDidMount
I don't
Ivan was probably talking about dunaj-starter repo on github:
https://github.com/dunaj-project/dunaj-starter/blob/master/src/dunaj_starter/core.clj
пятница, 6 марта 2015 г., 9:42:00 UTC+3 пользователь Alex Baranosky написал:
Where is this example project?
On Thu, Mar 5, 2015 at 7:40 PM, Ivan
I've been writing an application using Om, and I've come across a problem I
haven't been able to find a good solution for. I'd be grateful for any
ideas people might have on how to proceed.
In a nutshell, I have a bunch of elements that need to be arranged
according to a specific algorithm. They
(cc'ing clojurescr...@googlegroups.com)
Hi James,
Let me make sure I understand what you're asking: you have a parent
enclosing component that has to do calculations to position a set of
child component element, but you can only properly calculate positioning
for those child elements (in the
41 matches
Mail list logo
