I hereby claim:
- I am darklajid on github.
- I am darklajid (https://keybase.io/darklajid) on keybase.
- I have a public key whose fingerprint is EC4B DA7E F157 BEDA 8DFF E144 20CE B7FA 52AD 1180
To claim this, I am signing this object:
> git rebase --whitespace=nowarn master | |
First, rewinding head to replay your work on top of it... | |
Applying: Neue Log Methoden mit Parameter messageId, Methoden ohne diesen Parameter sind nun obsolete um anhand der Warn | |
ings die naechsten Aenderungen durchzufuehren | |
Using index info to reconstruct a base tree... | |
<stdin>:19: trailing whitespace. | |
None = 0, | |
<stdin>:23: trailing whitespace. | |
Info = 2, | |
<stdin>:24: trailing whitespace. |
(defn primes [] | |
"Generates an (infinite, lazy) sequence of primes" | |
(let [reinsert (fn [table x prime] | |
(let [key (+ prime x)] | |
(assoc table key (conj (get table key) prime))))] | |
(letfn [(primes-step [table d] | |
(if-let [factors (get table d)] | |
(let [newTable (dissoc table d)] | |
(recur (reduce #(reinsert %1 d %2) newTable factors) (inc d))) | |
(lazy-seq (cons d (primes-step (assoc table (* d d) (list d)) (inc d))))))] |
// SymSpell: 1000x faster through Symmetric Delete spelling correction algorithm | |
// | |
// The Symmetric Delete spelling correction algorithm reduces the complexity of edit candidate generation and dictionary lookup | |
// for a given Damerau-Levenshtein distance. It is three orders of magnitude faster and language independent. | |
// Opposite to other algorithms only deletes are required, no transposes + replaces + inserts. | |
// Transposes + replaces + inserts of the input term are transformed into deletes of the dictionary term. | |
// Replaces and inserts are expensive and language dependent: e.g. Chinese has 70,000 Unicode Han characters! | |
// | |
// Copyright (C) 2012 Wolf Garbe, FAROO Limited | |
// Version: 1.6 |
I hereby claim:
To claim this, I am signing this object:
I am +darklajid on OneName #verifymyonename