Given that the TensorFlow website invites people to build interfaces from
other languages using SWIG, I guess they feel that access to the C++
component is the major thing. So while I agree with Christian about
reinventing the wheel, it may be that to interface at that level would
involve
Best of luck with your proposal!
The main part of my proposal is porting Overtone, that is type checking it
using core.typed, which is a great optional type system with stuff like
dependent types built in
This caught my eye. Does core.typed support dependent types? I might
start looking
Pedestal https://github.com/pedestal/pedestal is a continuation of
ClojureScript One.
https://groups.google.com/d/msg/clojure/XQ4wuUc0bCk/JuUmUj6cSwUJ
On Tuesday, 18 November 2014 06:39:40 UTC, Kevin Banjo wrote:
Really excited to use clojurescript one but got shot down right out of the
As I understand it, Session https://github.com/kovasb/session and codeq
https://github.com/Datomic/codeq are tools that somehow keep your code in
a database instead of plain text.
On Friday, 14 November 2014 12:42:57 UTC, Thomas Huber wrote:
Hi, here is an idea that has been in my mind for a
I haven't tried it, but for parallelisation it's sometimes worth starting
from more array-oriented code, e.g.
(defn max-diff [check-until]
(let [val (map #(Math/sqrt %) (range 1 check-until))]
(reduce max (map #(Math/abs (- %1 %2)) (map #(Math/pow % 2) val) (map
#(* % %) val)
On
Hi! I'm an interested spectator but understand very little :) I wonder if
anyone would take a moment to explain?
E.g. I can't see why reading from a data structure should ever lead to a
change in the refcounts.
A
On Thursday, 30 May 2013 15:56:42 UTC+1, tbc++ wrote:
There are two things I
Wait... maybe I do :) Perhaps I was thinking that you needn't increment
the refcount of a node when you're just looking at it, but only if you're
going to return it or attach it to something else... Sorry to know so
little...
On Thursday, 30 May 2013 21:00:59 UTC+1, atucker wrote:
Hi
are defined on top of
something like this.
So, in order to actually read from a memory value and guarantee that the
object still exists, you have to allocate a wrapper that manages these
reference counts. HTH.
On Thu, May 30, 2013 at 4:00 PM, atucker agjf@gmail.com javascript:
wrote
K guys,
I honestly don't want to piss on Clojure, I know how hard a lot of people
have worked for a long time in order to make this a viable language. I
respect and am grateful for your dedication.
But you should know this: every time I come back to use Clojure I find
that it's become
, 2012 10:37:22 PM UTC, atucker wrote:
K guys,
I honestly don't want to piss on Clojure, I know how hard a lot of
people have worked for a long time in order to make this a viable language.
I respect and am grateful for your dedication.
But you should know this: every time I come back to use
to
give us anything to go on in terms of 1) helping you with your problem or
even 2) improving Clojure.
Happy Thanksgiving!
On Thu, Nov 22, 2012 at 5:47 PM, atucker agjf@gmail.com javascript:
wrote:
Sorry, I'm in a bad mood. For context, after hours of struggling with
Aquamacs
linkapps). M-x
package-list-packages, select nrepl and clojure-mode, hit x, setup
finished. Leiningen2 is the perfect companion for this setup.
On Fri, Nov 23, 2012 at 12:24 AM, atucker agjf@gmail.comjavascript:
wrote:
On the Mac, I got it kinda working, but can't work out how to break
Spectral Graph Theory?
http://cs-www.cs.yale.edu/homes/spielman/TALKS/haifa1.pdf
On Thursday, 31 May 2012 14:37:21 UTC+1, Sean Devlin wrote:
Hey folks,
I'm looking for help demonstrating Clojure's superiority to Scala :)
I have a contest going with a colleague, where we each have to render a
Yet another approach that might work for you, depending on your
requirements, is to use a lazy sequence to access your data. I did that
for a load of Twitter data that would have been too large to hold in memory
at any one time.
Here's the relevant bit (I think), copied and pasted:
(defn
, but yes, that line did stop the script.
http://closure-library.googlecode.com/svn/docs/class_goog_fx_Dragger
On Mon, Aug 29, 2011 at 6:50 PM, atucker agjf.tuc...@googlemail.com wrote:
Hi! I wonder if someone might tell me what I'm doing wrong here.
(ns hello (:require [goog.fx :as fx
On Aug 30, 11:05 am, atucker agjf.tuc...@googlemail.com wrote:
/ I thought perhaps the problem was related to this
onehttp://groups.google.com/group/clojure/browse_thread/thread/2ad1db6d4...,
/ but Dragger.js hasn't been updated since January.
Sorry! That's not true at all. But even
Thank you that works! But I see what you mean about rough edges, it's
not for the faint-hearted.
So for example I have no idea how to find out why fading works with
this JavaScript:
goog.require('goog.dom');
goog.require('goog.fx.dom');
function fade() {
var kurdt =
in the 'Host Interop' section.
An example is
athttps://github.com/clojure/clojurescript/blob/master/samples/twitterb...
On Aug 30, 8:52 pm, atucker agjf.tuc...@googlemail.com wrote:
Thank you that works! But I see what you mean about rough edges, it's
not for the faint-hearted
Hi! I wonder if someone might tell me what I'm doing wrong here.
(ns hello (:require [goog.fx :as fx] [goog.dom :as dom]))
(defn ^:export main []
(let [kurdt (dom/getElement kurdt)]
(dom/appendChild (.body (dom/getDocument)) (dom/createDom h1 0
(dom/getOuterHtml kurdt)))
(fx/Dragger.
Aughh! This is great (and a smart move). But I'd assumed CHouser's
original Clojurescript was dead, and spent the last two months
learning Javascript itself! Why so secretive?? A
On Jul 21, 1:40 am, Christopher Redinger redin...@gmail.com wrote:
In case you missed the announcement streamed
)
(str/split (slurp (first fs)) #\nStatusJSONImpl))
(rest fs))]
(cat '() (out-files dir-name
Alistair
On Jul 26, 2:53 pm, atucker agjf.tuc...@googlemail.com wrote:
Hi all! I have been trying to use Clojure on a student project, but
it's
Thanks! This is still driving me mad 'though.
On Jul 27, 5:11 pm, Peter Schuller peter.schul...@infidyne.com
wrote:
The observations that the data structures are non-lazy still apply,
even if you could postpone the problem by increasing the heap size.
Yes I can see that the sequence returned
is useful.
Re OutOfMemoryException: if all the allocated heap memory is really
not freeable, then there's nothing the JVM can do -- it's being asked
to allocate memory for a new object, and there's none available.
On Jul 26, 9:53 am, atucker agjf.tuc...@googlemail.com wrote:
Hi all! I have been
the (repeatedly... ) is being
evaluated lazily?
Alistair
On Jul 27, 12:43 pm, Mark Nutter manutte...@gmail.com wrote:
On Mon, Jul 26, 2010 at 9:53 AM, atucker agjf.tuc...@googlemail.com wrote:
Here is my function:
(defn json-seq []
(apply concat
(map #(do (print f) (str/split (slurp
be in the final version.
Spit the processed json-seq into a file when you're done instead.
This way you can process one input file at a time, and simply append
your results to the output file.
My $.02
Sean
On Jul 26, 9:53 am, atucker agjf.tuc...@googlemail.com wrote:
Hi all! I have been
Hi all! I have been trying to use Clojure on a student project, but
it's becoming a bit of a nightmare. I wonder whether anyone can
help? I'm not studying computer science, and I really need to be
getting on with the work I'm actually supposed to be doing :)
I am trying to work from a lot of
Is this it?
http://www.assembla.com/spaces/clojure/tickets/259
On Mar 23, 8:26 pm, Mark J. Reed markjr...@gmail.com wrote:
As far as I can tell, you're doing nothing wrong and just hitting a
bug in Clojure. Which is still in 1.2.0-master...
On Tue, Mar 23, 2010 at 11:43 AM, Konstantin
From his todo list (1), it looks as if ztellman (2) might have
concrete plans to include it in the (currently OpenGL) wrapper project
penumbra (3).
1. http://wiki.github.com/ztellman/penumbra/todo
2. http://ideolalia.com/
3. http://github.com/ztellman/penumbra
On Feb 9, 9:48 pm, ka
a simple reference-counting
mechanism (much like the one you mention, boost::shared_ptr).
Thanks
Alistair
On Dec 25, 5:38 pm, mac markus.gustavs...@gmail.com wrote:
On Dec 24, 6:14 pm, atucker agjf.tuc...@googlemail.com wrote:
I am also curious about this. Apologies, possibly naive question
I am also curious about this. Apologies, possibly naive question
ahead :)
My background is in C++. By choosing to work with immutable values
(i.e. with a lot of consts), I found that I was able to avoid most of
explicit memory management, pointers etc. Exceptions were:
(a) when interfacing
Yes Rich Hickey advises against it here...
http://groups.google.com/group/clojure/browse_frm/thread/9eaf7be6a65e70df#
On Sep 17, 9:26 pm, David Nolen dnolen.li...@gmail.com wrote:
I believe maps containing functions are generally looked down upon.
Multimethods are probably the way to go. Can't
I wonder if any of the Clojurians on here might like to describe how
one might write the factorial function as a parallel one? Taking
advantage of the associativity of multiplication, along the lines of
16! = (((1*2)*(3*4)) * ((5*6)*(7*8))) * (((9*10)*(11*12)) * ((13*14)*
(15*16)))
On Jul 24,
Hi! I would expect the implementation of any neural network to be
dictated by the particular mathematical/algorithmic description. I am
not at all sure what description might have given rise to your code.
Do you have any particular type of neural network in mind? Or any
particular task to
33 matches
Mail list logo
