View binwrap-npm-test
$ npm test | |
> binwrap@0.2.0 test /home/aaron/github.com/binwrap | |
> (cd test_app && ./build_packages.sh) && mocha && eslint . | |
binwrap | |
1) "before each" hook for "fails when specified URLs don't exist" |
View factory.ex
defmodule Foo.Factory do | |
alias Foo.Blog.{Post, Comment} | |
def params_for(Post) do | |
%{ | |
title: Faker.Lorem.sentence(), | |
body: Faker.Lorem.paragraph() | |
} | |
end |
View raise_volume.sh
#!/usr/bin/env bash | |
max=153 | |
current_volume () { | |
pactl list sinks | grep -o "Volume: 0:[[:space:]]\+[0-9]\+" | sed 's/.*[[:space:]]//' | |
} | |
muted () { | |
pactl list sinks | grep "Mute: yes" > /dev/null |
View database_authenticatable_default_option.diff
diff --git a/lib/devise/schema.rb b/lib/devise/schema.rb | |
index f0ff2a1..94296e4 100644 | |
--- a/lib/devise/schema.rb | |
+++ b/lib/devise/schema.rb | |
@@ -14,7 +14,7 @@ module Devise | |
# encrypter password field in 128 characters. | |
def database_authenticatable(options={}) | |
null = options[:null] || false | |
- default = options[:default] || "" | |
+ default = options[:default] || null ? nil : "" |
View my_sort.rb
class Array | |
def my_sort | |
arr = self.clone | |
sorted = false | |
until sorted | |
arr.each_with_index do |e, i| | |
if i < (arr.length - 1) && e > arr[i+1] | |
arr[i], arr[i+1] = arr[i+1], arr[i] | |
end | |
end |
View euler011.rb
grid = <<EOS | |
08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08 | |
49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00 | |
81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65 | |
52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91 | |
22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80 | |
24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50 | |
32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70 | |
67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21 | |
24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72 |
View euler010.rb
require 'mathn' | |
Prime.new.inject(0) { |sum, n| | |
break(sum) if n >= 2_000_000 | |
sum + n | |
} |
View euler009.rb
def pythagorean_triple(m, n) | |
m, n = n, m if m > n | |
[n**2 - m**2, 2*m*n, n**2 + m**2] | |
end | |
infinity = 1.0/0.0 | |
catch :answer_found do | |
(1..infinity).each do |m| | |
(m+1..infinity).each do |n| |
View euler008.rb
numbers = <<EOS | |
73167176531330624919225119674426574742355349194934 | |
96983520312774506326239578318016984801869478851843 | |
85861560789112949495459501737958331952853208805511 | |
12540698747158523863050715693290963295227443043557 | |
66896648950445244523161731856403098711121722383113 | |
62229893423380308135336276614282806444486645238749 | |
30358907296290491560440772390713810515859307960866 | |
70172427121883998797908792274921901699720888093776 | |
65727333001053367881220235421809751254540594752243 |
View euler007.rb
require 'mathn' | |
prime = Prime.new | |
10_000.times {prime.succ} | |
prime.succ |
NewerOlder