python3 -m timeit -s 'import re; r = re.compile(r"<img [^>]*>")' \
'r.findall("<img src alt name etc> <img even more stuff forever dot com forward slash junk.html and stuff>")'1000000 loops, best of 3: 0.72 usec per loop
| import qualified Data.Maybe as Maybe | |
| import qualified Control.Monad.Reader as Reader | |
| type Environment = [(String, String)] | |
| get :: String -> Environment -> String | |
| get k env = Maybe.fromJust $ lookup k env |
| dedup [] = [] | |
| dedup (x:xs) = dedup' x xs | |
| where | |
| dedup' x [] = [x] | |
| dedup' x (x:xs) = dedup' x xs | |
| dedup' y (x:xs) = y : dedup' x xs |
| for (var v = 0; v < 2*N; v++) { | |
| for (var u = -N; u < N; u++) { | |
| var w = getCube(u, v); | |
| if (w > 0 && w < tick) { // there's a cube and it's not one we just created | |
| setCube(u, v, 0); // remove it | |
| if (u < N && v > 0) { | |
| if (Math.random() < 0.5) // 50% of the time | |
| setCube(u + 1, v - 1, tick); // directly above | |
| if (Math.random() < 0.25) // 25% of the time | |
| setCube(u + 1, v - 2, tick); // above-left |
| <head> | |
| <title>Leaderboard</title> | |
| </head> | |
| <body> | |
| <div id="outer"> | |
| {{> leaderboard}} | |
| </div> | |
| </body> |
| * * * * * osascript -e 'if application "Evernote" is running then tell application "Evernote" to synchronize' |
| Haskell is cool! | |
| Here are some reasons why. | |
| (This is a Literate Haskell file, so you can load it and then follow | |
| along with the examples by running `ghci whyhaskelliscool.lhs`) | |
| "Pattern matching" syntax for defining functions is cool, letting you | |
| avoid 'if' statements and simply write out the different behaviors of | |
| a function: |
Using Python's built-in defaultdict we can easily define a tree data structure:
def tree(): return defaultdict(tree)That's it!