View skip_list.rb
INFINITY = 1.0 / 0 | |
NEG_INFINITY = -1.0 / 0 | |
class Node | |
MAX_LEVEL = 7 | |
# node has value and levels | |
attr_accessor :val, :levels | |
def initialize(val) | |
self.val = val | |
self.levels = [] |
View aggrobot.rb
=begin | |
{ | |
"region1": {month1: {avg_target: xxx, avg_actual: xxx} | |
month2: ......... | |
} | |
=end |
View logstash-cert.sh
# Create Key | |
openssl genrsa -des3 -out logstash.key 1024 | |
sudo openssl genrsa -des3 -out logstash.key 1024 | |
# Create CSR | |
openssl req -new -key logstash.key -out logstash.csr | |
sudo openssl req -new -key logstash.key -out logstash.csr | |
# Remove password from key | |
sudo openssl rsa -in logstash.key.org -out logstash.key | |
# Create certificate | |
sudo openssl x509 -req -days 365 -in logstash.csr -signkey server.key -out logstash.crt |
View logstash-suse
#! /bin/sh | |
### BEGIN INIT INFO | |
# Provides: logstash | |
# Required-Start: $remote_fs $syslog | |
# Required-Stop: $remote_fs $syslog | |
# Default-Start: 2 3 4 5 | |
# Default-Stop: 0 1 6 | |
# Short-Description: Start daemon at boot time | |
# Description: Enable service provided by daemon. | |
### END INIT INFO |
View skyline_tree.rb
class SkylineTree | |
attr_reader :root | |
def initialize(node_class = Node, start = nil, value = nil) | |
@node_class = node_class | |
@root = start && tree_type.new(start, value) | |
end | |
def add(range, value = nil) | |
if root |
View index.html
<section> | |
<table class="grid"> | |
<tbody> | |
<tr> <td> <td> <td> <td> <td> <td> <td> <td> <td> | |
<tr> <td> <td> <td> <td> <td> <td> <td> <td> <td> | |
<tr> <td> <td> <td> <td> <td> <td> <td> <td> <td> | |
<tr> <td> <td> <td> <td> <td> <td> <td> <td> <td> | |
<tr> <td> <td> <td> <td> <td> <td> <td> <td> <td> | |
<tr> <td> <td> <td> <td> <td> <td> <td> <td> <td> | |
<tr> <td> <td> <td> <td> <td> <td> <td> <td> <td> |
View index.html
<section> | |
<table class="grid"> | |
<colgroup><col><col><col> | |
<colgroup><col><col><col> | |
<colgroup><col><col><col> | |
<tbody> | |
<tr> <td> <td> <td> <td> <td> <td> <td> <td> <td> | |
<tr> <td> <td> <td> <td> <td> <td> <td> <td> <td> | |
<tr> <td> <td> <td> <td> <td> <td> <td> <td> <td> | |
<tr> <td> <td> <td> <td> <td> <td> <td> <td> <td> |
View parens_permute.rb
require 'graphviz' | |
class LeveledBinaryTree | |
Node = Struct.new(:weight, :str, :left, :right) | |
attr_accessor :levels, :root | |
def initialize(clear_last_level = true) | |
@root = Node.new(1, '(') | |
@levels = {0 => [@root]} |
View index.html
<div class="rumor"> | |
<div class="dropdown"> | |
<label>Algorithm:</label> | |
<select id="algo"> | |
</select> | |
| |
<label>Number of People:</label> | |
<input id="count" type="text" value="60" name="count"/> | |
<label>Speed:</label> | |
<select name="speed" id="speed"> |
View range_count_tree.rb
# RangeCountTree | |
# A bst variant for fast retrieval of count of ranges which are intersecting given n ranges | |
# | |
# Creator : Shadab Ahmed | |
# | |
# Each node stores a range and the count of intervals which intersect with the range. | |
# | |
# We just follow these rules: | |
# 1. Any range which is greater than the current range is stored in the right subtree | |
# 2. Any range which is smaller than the current range is stored in the left subtree |
NewerOlder