pithyless

(ns front.utilities.i18n-impl
  (:require [front.i18n]))

(defn build-domain-index [text-vec]
  (let [by-msgid (atom (transient {}))
        by-msg   (atom (transient {}))]
    (doseq [{:keys [s_message s_message_id] :as text} text-vec]
      (when-not (clojure.string/blank? s_message_id)
        (swap! by-msgid assoc! s_message_id text))
      (when-not (clojure.string/blank? s_message)

pithyless

-- Optimized MYSQL schema for datomic
-- Unfortunately the bin/sql/mysql-*.sql bootstrapping files for datomic are not
-- very good, and can actually cause failures if not adjusted.
-- One symptom of this is the following error:

-- SQL Error (1071): Specified key was too long; max key length is 767 bytes.

-- Reported here: https://support.cognitect.com/entries/28462168-MySQL-Caveats

-- This is caused by the default collation for the `id` column possibly being

pithyless

(ns background
  (:require [clojure.tools.logging :as log])
  (:import [java.util.concurrent]))

(defonce !executor (delay (java.util.concurrent.Executors/newCachedThreadPool)))

(defn background
  "Calls the fn passed in a thread from a thread pool, returning immediately.
  Unlike future, background does not swallow exceptions."
  [f]

pithyless

Latency numbers every programmer should know

L1 cache reference ......................... 0.5 ns
Branch mispredict ............................ 5 ns
L2 cache reference ........................... 7 ns
Mutex lock/unlock ........................... 25 ns
Main memory reference ...................... 100 ns             
Compress 1K bytes with Zippy ............. 3,000 ns  =   3 µs
Send 2K bytes over 1 Gbps network ....... 20,000 ns  =  20 µs
SSD random read ........................ 150,000 ns  = 150 µs

Read 1 MB sequentially from memory ..... 250,000 ns = 250 µs

pithyless

(ns freactive-datascript.core
  (:require [datascript :as d]
            [datascript.core :as dc]
            [clojure.data :as data]
            [freactive.core :as f :refer [IReactive
                                          *invalidate-rx*
                                          *trace-capture*]]))

;;; Playground ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;

pithyless

;;; Use experimental fork of DataScript from https://github.com/allgress/datascript to handle undo and per-query subscriptions
(ns reagent-test.core
  (:require [reagent.core :as reagent :refer [atom]]
            [datascript :as d]
            [cljs-uuid-utils :as uuid]))

(enable-console-print!)

(defn bind
  ([conn q]

pithyless

0123    0123    0123    0123    0123    0123    0123    0123     0123    0123
1       1 _     1 _     1       1 _     1 _     1 _     1 _      1 _     1 _
2  |    2 _|    2 _|    2|_|    2|_     2|_     2  |    2|_|     2|_|    2| |
3  |    3|_     3 _|    3  |    3 _|    3|_|    3  |    3|_|     3 _|    3|_|



000101100
+4 +7 -5 +6
0 -  2 4 6789

pithyless

/**
 * See: http://www.css-101.org/articles/ken-burns_effect/css-transition.php
 */

/**
 * Styling the container (the wrapper)
 * 
 * position is used to make this box a containing block (it becomes a reference for its absolutely positioned children). overflow will hide part of the images moving outside of the box.
 */

pithyless

class GroupOfThingies
  attr_accessor :thingies

  # Use like this:
  #
  #   group_of_thingies = GroupOfThingies.new
  #   group_of_thingies.each do |thing|
  #     puts "Check out this awesome thing: #{thing}!"
  #   end
  #

pithyless

# Do you ever define #method_missing and forget #respond_to? I sure
# do.  It would be nice if we could do them both at the same time.

module MatchMethodMacros
  def match_method(matcher, &method_body) 
    mod = Module.new do
      define_method(:method_missing) do |method_name, *args|
        if matcher === method_name.to_s
          instance_exec(method_name, *args, &method_body)
        else