loganlinn

(defn- debounce-future
  "Returns future that invokes f once wait-until derefs to a timestamp in the past."
  [f wait wait-until]
  (future
    (loop [wait wait]
      (Thread/sleep wait)
      (let [new-wait (- @wait-until (System/currentTimeMillis))]
        (if (pos? new-wait)
          (recur new-wait)
          (f))))))

favila

(defn zip-partition
  "Return a sequence of length n of sequences of every nth item, each offset
  by one. Suitable for building the rows of a table with n columns where the
  sequence items flow down columns then rows. Example:
  
      (zip-partition [0 1 2 3 4] 2) -> ((0 4)
                                        (1 nil)
                                        (2 nil)
                                        (3 nil))"
  [s n]

brandonbloom

(in-ns 'eclj.core)

(defprotocol Fn
  :on-interface clojure.lang.Fn
  "Marker interface indicating invokeables that are explictly functions")

(defprotocol IFn
  :on-interface clojure.lang.IFn
  (^{:on :invoke} -invoke
    [this]

ptaoussanis

(comment ; Fun with transducers, v2

  ;; Still haven't found a brief + approachable overview of Clojure 1.7's new
  ;; transducers in the particular way I would have preferred myself - so here goes:

  ;;;; Definitions
  ;; Looking at the `reduce` docstring, we can define a 'reducing-fn' as:
  (fn reducing-fn ([]) ([accumulation next-input])) -> new-accumulation
  ;; (The `[]` arity is actually optional; it's only used when calling
  ;; `reduce` w/o an init-accumulator).

favila

(ns favila.async-util
  "Some missing pieces of core.async.

   as-transducer: Make a transducer function easily without Clojure 1.7.
   go-pipe: async/pipe, but returns the go-loop.
   fast-pipeline-blocking: faster than async/pipeline-blocking, but unordered results.
   blocking-consumer: consume a channel with multiple worker threads."
  (:require [clojure.core.async :as async
             :refer [go go-loop <! >! <!! >!! close! take! put! chan]]))

rauhs

(ns x.y
  (:use [plumbing.core]) ;; Just for the map-vals
  (:require [clojure.walk :refer [postwalk prewalk prewalk-demo postwalk-demo]]
            [clojure.core.match :refer [match]]
            [schema.utils :refer [named-error-explain validation-error-explain]]
            [schema.core :as s])
  (:import (schema.utils NamedError ValidationError)))

;; Partially FROM:
;; https://github.com/puppetlabs/clj-schema-tools

vvvvalvalval

(ns bs.utils.mock-connection
  "Utilities for using Datomic"
  (:require [datomic.api :as d])
  (:use clojure.repl clojure.pprint)
  (:import (java.util.concurrent BlockingQueue LinkedBlockingDeque)
           (datomic Connection)))

(defrecord MockConnection
  [dbAtom, ^BlockingQueue txQueue]

favila

(require '[datomic.api :as d])

(defn entity-changes
  "Return transaction history for an entity and its components.
  Returns a sequence of maps, each is the transaction map (tx metadata) plus a
  key `:entity-changes`, which is a nested map of keys: entity id, attribute
  ident, `:db/add` or `:db/retract`, and the value added or retracted, e.g.:
      {12345678910 {:long-card-1-attr          {:db/retract 1
                                                :db/add     0}
                    :long-card-many-attr       {:db/add     #{0}}

ghadishayban

;;
;; Example usages at the bottom of the file
;;

(defn productions
  "Returns a sequence of values by repeatedly calling `produce!` until it
   returns `fin`. The sequence can be used lazily/caching or reducible/non-caching.

   The arity-2 variant's `produce!` takes no arguments and returns a value
     or the terminator.

Jaretbinford

The Datomic Pro peer can create the following CloudWatch metrics:


-----------------------------------PEER METRICS


|-------------------------------+------------+---------------+-----------------------------------------------------------------------------+
| Metric                        | Units      | Statistic     | Description                                                                 |
|-------------------------------+------------+---------------+-----------------------------------------------------------------------------+
| AvailableMB                   | MB         | minimum       | unused RAM on peer   *                                                       |