def foo
end
This file contains hidden or 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 "tmpdir" | |
| require "securerandom" | |
| require "set" | |
| REPO = ARGV[0] || raise("need repo") | |
| EMAILS = ARGV[1...] | |
| EMAIL_MAP = { | |
| "[email protected]" => "[email protected]" | |
| } |
This is an implementation of in-process pub/sub in Ruby with type checking at runtime.
It only allows subscribing to events with jobs to ensure that the subscriber blocks are fully asynchronous and cannot cause runtime exceptions.
This is the approach we use in production at rwx
I hereby claim:
- I am dan-manges on github.
- I am danmanges (https://keybase.io/danmanges) on keybase.
- I have a public key whose fingerprint is 4224 49E1 A87C D6BD 22D2 29AF 6317 7701 6B90 2E19
To claim this, I am signing this object:
This file contains hidden or 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_relative "helper" | |
| available = {} | |
| 0.upto(15).each do |i| | |
| available[i] = {} | |
| i.upto(15).each do |j| | |
| available[i][j] = true | |
| if i / 4 == j / 4 | |
| available[i][j] = false | |
| end |
This file contains hidden or 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
| http = require 'http' | |
| m2node = require 'm2node' | |
| server = http.createServer((req, res) -> | |
| console.log("#{req.method} #{req.url}") | |
| sendResponse = -> | |
| res.writeHead(200, {'Content-Type': 'text/plain'}) | |
| res.end('Hello World\n') | |
| match = req.url.match(/sleep.(\d+)/) | |
| if match |
This file contains hidden or 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
| def fib(n) | |
| if n <= 2 | |
| 1 | |
| else | |
| fib(n-1) + fib(n-2) | |
| end | |
| end | |
| def fibsum(n) | |
| sum = 0 |
This file contains hidden or 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
| def mask(x)x[0,6]+'*'*(x.size-10)+x[-4..-1]end |
This file contains hidden or 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
| def luhn?(number) | |
| digits = number.scan(/\d/).map { |d| d.to_i }.reverse | |
| digits.each_with_index do |digit, index| | |
| if index % 2 == 1 | |
| digits[index] = (digit >= 5 ? digit * 2 - 9 : digit * 2) | |
| end | |
| end | |
| digits.inject(0) { |a,b| a + b } % 10 == 0 | |
| end |
This file contains hidden or 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
| def self.luhn_valid?(number) | |
| return false unless number.to_s =~ /\A\d+\z/ | |
| digits = number.scan(/\d/).map(&:to_i).reverse | |
| digits.each_with_index do |digit, index| | |
| if index.odd? | |
| digits[index] = (digit >= 5 ? digit * 2 - 9 : digit * 2) | |
| end | |
| end | |
| digits.sum % 10 == 0 | |
| end |
NewerOlder