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
// ==UserScript== | |
// @name Shorpy large images at Feedly | |
// @namespace q.alexander.feedly.shorpy | |
// @version 0.4 | |
// @description Replace small Shorpy.com previews with large images in Feedly | |
// @match http://feedly.com/* | |
// @match https://feedly.com/* | |
// @copyright 2014+, Alexaner Q | |
// @grant none | |
// ==/UserScript== |
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
// ==UserScript== | |
// @name Lepra | |
// @namespace q.alexander.feedly.shorpy | |
// @version 0.2 | |
// @description Miscellaneous improvements | |
// @match http://leprosorium.ru/* | |
// @match http://*.leprosorium.ru/* | |
// @match https://leprosorium.ru/* | |
// @match https://*.leprosorium.ru/* | |
// @copyright 2014+, Alexaner Q |
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
integralWith' | |
:: (W.HasTime t s, Fractional a) | |
=> (a -> a) -- ^ Correction function. | |
-> a -- ^ Integration constant (aka start value). | |
-> W.Wire s e m a a | |
integralWith' correct = loop | |
where | |
loop x' = | |
W.mkPure $ \ds dx -> | |
let dt = realToFrac (W.dtime ds) |
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
-- This is even slower than triangleNumsAlt, but this is exactly | |
-- THE function where I grocked lazy lists | |
triangleNums = map fst triangleNums' | |
where | |
triangleNums' = (1, 2) : map (\(n, i) -> (n+i, i+1)) triangleNums' | |
triangleNumsAlt = map (\i -> i * (i+1) `div` 2) [1..] |
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
// ==UserScript== | |
// @name Builder packet names | |
// @namespace q.alexander.mailru.builder | |
// @version 0.3 | |
// @description enter something useful | |
// @author Alexander Q <qalexx@gmail.com> | |
// @match http://buildmail.dev.mail.ru/* | |
// @grant none | |
// ==/UserScript== |
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
module Tree where | |
import Prelude | |
import Data.Either | |
import Data.Foreign | |
import Data.Foreign.Class | |
data Tree a = Leaf a | Branch (Tree a) (Tree a) | |
newtype STree = STree |
OlderNewer