This gist is part of a blog post. Check it out at:
http://jasonrudolph.com/blog/2011/08/09/programming-achievements-how-to-level-up-as-a-developer
| # Recursive backtracking algorithm for maze generation. Requires that | |
| # the entire maze be stored in memory, but is quite fast, easy to | |
| # learn and implement, and (with a few tweaks) gives fairly good mazes. | |
| # Can also be customized in a variety of ways. | |
| DIRS = (N, S, E, W = 1, 2, 4, 8) | |
| DX = { E => 1, W => -1, N => 0, S => 0 } | |
| DY = { E => 0, W => 0, N => -1, S => 1 } | |
| OPPOSITE = { E => W, W => E, N => S, S => N } |
This gist is part of a blog post. Check it out at:
http://jasonrudolph.com/blog/2011/08/09/programming-achievements-how-to-level-up-as-a-developer
I spent a lot of time trying to find a pretty optimal (for me) setup for Clojure… at the same time I was trying to dive in and learn it. This is never optimal; you shouldn't be fighting the environment while trying to learn something.
I feel like I went through a lot of pain searching Google, StackOverflow, blogs, and other sites for random tidbits of information and instructions.
This is a comprehensive "what I learned and what I ended up doing" that will hopefully be of use to others and act as a journal for myself if I ever have to do it again. I want to be very step-by-step and explain what's happening (and why) at each step.
Hi there!
The docker cheat sheet has moved to a Github project under https://github.com/wsargent/docker-cheat-sheet.
Please click on the link above to go to the cheat sheet.
| module UtilitiesCost | |
| ( electricityCost | |
| , gasCost | |
| , waterCost | |
| , utilitiesCost | |
| ) where | |
| import Debug.Trace | |
| data Reading = Reading Double Double deriving (Eq, Show, Read) |
Find it here: https://github.com/bitemyapp/learnhaskell
I have moved this over to the Tech Interview Cheat Sheet Repo and has been expanded and even has code challenges you can run and practice against!
\
(by @andrestaltz)
If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.
| class Regex { | |
| let pattern: String | |
| let options: NSRegularExpressionOptions! | |
| private var matcher: NSRegularExpression { | |
| return NSRegularExpression(pattern: self.pattern, options: nil, error: nil) | |
| } | |
| required init(pattern: String, options: NSRegularExpressionOptions = nil) { | |
| self.pattern = pattern |
| enum ComparisonOrdering: Int { | |
| case Ascending = 1 | |
| case Descending = -1 | |
| case Same = 0 | |
| } | |
| infix operator <=> { precedence 130 } | |
| protocol CombinedComparable: Comparable, Equatable { | |
| func <=>(lhs: Self, rhs: Self) -> ComparisonOrdering | |
| } |