Resque.info
Resque.queues
Resque.redis
Resque.size(queue_name)
# check out what's coming next in the queue
# Resque.peek(archive_queue)
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 'openssl' | |
require 'base64' | |
# Read the dummy file | |
data = File.read("test.txt") | |
# Create an encrypter | |
cipher = OpenSSL::Cipher::AES.new(256, :CBC) | |
cipher.encrypt | |
key = cipher.random_key |
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
BEGIN { | |
require 'net/http' | |
Net::HTTP.module_eval do | |
alias_method '__initialize__', 'initialize' | |
def initialize(*args,&block) | |
__initialize__(*args, &block) |
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
# C implementation of Levenshtein text distance algorithm, uses RubyInline to call from within Ruby | |
# Wildly faster than the Text gem's Text::Levenshtein | |
# Example: | |
# l = Levenshtein.new | |
# l.distance 'hello', ' hello' | |
# => 1 | |
# Taken from http://www.benallfree.com/2008/10/05/finding-duplicate-text-with-ruby/ |