CPU utilization.
https://github.com/gixxi/lambdaroyal-dispatch
--
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
Hi all, I hereby announce the availability of the lambdaroyal-memory. A
STM-based in-memory database flushing to a persistent backend.
https://github.com/gixxi/lambdaroyal-memory
Just imaging working just with STM refs holding your domain data and ease
your daily job with
- indexes
Hi Josh,
I would opt for using Tomcat 7 Pool API -
http://tomcat.apache.org/tomcat-7.0-doc/jdbc-pool.html
The following code wraps the pool api and provides reading a config file
(ns foo
(:require [clojure.java.io :as io])
(:import [java.io PushbackReader])
(:gen-class))
(defn conf [file
Hi,
i got a question on reference type instances with attached watches.
Consider a reference type instance R with a watch W attached by (add-watch
R :watcher #(...)) and
a n parallel activities committing a transition to R in some monotonic
order 0..n-1.
Does Clojure ensure that the function
Hi there,
I wanne dive a bit more deep into the clojure compiler and I wonder whether
it follows the std procedure for compiled languages
Character Stream -> Scanner (lexical analysis) -> Token Stream
Token Stream -> Parser (syntax analysis) -> Parse Tree
Parse Tree -> Semantic Analysis -> Abstr
Hi all,
I am working on graph search algorithms using a priority queue which is
implemented by a sorted-set and a custom comparator.
Elements maintained by the set consist of :node (nodename) :dist (current
distance) as well as :visited (still to process). Only one element with
node x is allow
Hi all,
Consider the following record definition, a respective record instance as
well as a sorted tree set with a custom comparator sorting first the
:visited property and the by the :dist property of the record.
(defrecord RDistance
[node dist visited])
(def d (RDistance. "foo" 1 0))
(def
Hi all,
please consider the following record definition
(defrecord RDistance
[node dist visited])
as well as an instance and a tree set with a custom comparator ordering
content first by :visited and after that by :dist
(def d (RDistance. "foo" 1 0))
(def tree (sorted-set-by (comparator (jux