This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
;; ummels's solution to Palindromic Numbers | |
;; https://4clojure.com/problem/150 | |
(fn [n] | |
(letfn [(decode [n] (if (< n 10) [n] (conj (decode (quot n 10)) (rem n 10)))) | |
(encode [x] (reduce #(+ (* % 10) %2) 0 x)) | |
(next-pal [n] | |
(let [N (decode n) | |
l (count N) | |
d (quot l 2) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
;; ummels's solution to Squares Squared | |
;; https://4clojure.com/problem/138 | |
(fn [start end] | |
(letfn | |
[(squares [start end] | |
(take-while #(<= % end) (iterate #(* % %) start))) | |
(arrange [x] | |
(let [n (count x) | |
dim (int (Math/ceil (Math/sqrt n))) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
(fn [s e] | |
(let [squares (apply str (take-while #(<= % e) (iterate #(* % %) s))) | |
filler (drop (count squares) (repeat (#(* % %) (Math/ceil (Math/sqrt (count squares)))) \*)) | |
elements (concat squares filler) | |
dimension (int (Math/sqrt (count elements))) | |
cardinal (- (* 2 dimension) 1) | |
canvas (vec (repeat cardinal "")) | |
start-pos (* 2 (quot (dec dimension) 2)) | |
path (take (count elements) (mapcat #(repeat (+ 2 (* 2 %)) (if (odd? %) dec inc)) (range))) | |
balance (fn [c] (#(apply str `(~@% ~@(interpose \ c) ~@%)) (repeat (/ (- cardinal (- (* 2 (count c)) 1)) 2) \ )))] |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
(fn [l u] | |
(let [s (apply str (take-while #(<= % u) (iterate #(* % %) l))) | |
d (int (Math/ceil (Math/sqrt (count s)))) | |
n (concat (seq s) (repeat (- (* d d) (count s)) \*)) | |
m (loop [m {} sx n | |
r (if (even? d) (- d 2) (dec d)) c (- d 1) | |
dr (mapcat #(repeat (* % 2) (if (even? %) -1 1)) (range)) | |
dc (mapcat #(repeat (inc (* % 2)) (if (even? %) 1 -1)) (range))] | |
(if (empty? sx) m | |
(recur (assoc m [r c] (first sx)) (rest sx) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
;; ummels's solution to Love Triangle | |
;; https://4clojure.com/problem/127 | |
(fn [mine] | |
(let [n (count mine) | |
ln #(loop [r 1 v %] (if (< v 2) r (recur (inc r) (quot v 2)))) | |
m (apply max (map ln mine)) | |
lmax (fn [xs] ; treats nil as -infinity | |
(let [a (first xs) r1 (rest xs) b (first r1) r2 (rest r1)] | |
(cond (empty? r1) a |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/usr/bin/env sh | |
## | |
# This is script with usefull tips taken from: | |
# https://github.com/mathiasbynens/dotfiles/blob/master/.osx | |
# | |
# install it: | |
# curl -sL https://raw.github.com/gist/2108403/hack.sh | sh | |
# |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
diff --git a/fontforge/macbinary.c b/fontforge/macbinary.c | |
index a452d5b..d90f567 100644 | |
--- a/fontforge/macbinary.c | |
+++ b/fontforge/macbinary.c | |
@@ -37,7 +37,7 @@ | |
#include "psfont.h" | |
#if __Mac | |
# include <ctype.h> | |
-# include </Developer/Headers/FlatCarbon/Files.h> | |
+# include <CoreServices/CoreServices.h> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
% Copyright (c) 2010 Michael Ummels <michael@ummels.de> | |
% | |
% Permission to use, copy, modify, and/or distribute this software for any | |
% purpose with or without fee is hereby granted, provided that the above | |
% copyright notice and this permission notice appear in all copies. | |
% | |
% THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES | |
% WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF | |
% MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR | |
% ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
(require '[clojure.data.priority-map :refer [priority-map]]) | |
(defn map-vals [m f] | |
(into {} (for [[k v] m] [k (f v)]))) | |
(defn remove-keys [m pred] | |
(select-keys m (filter (complement pred) (keys m)))) | |
(defn dijkstra | |
"Computes single-source shortest path distances in a directed graph. |
OlderNewer