nhocki

 #!/usr/bin/env bash

CMD=${1:-false}
URL=${2:-example.com}

if [ $CMD = false ]; then
    echo "usage: " $0 "command [url:example.com]"
    exit 1
fi

nhocki

require 'rubygems'
require 'pry'

$nodes = Hash.new

class Index
  attr_reader :children, :name
  attr_accessor :parent

  def initialize(size, name, children = Array.new)

nhocki

Keybase proof

I hereby claim:

• I am nhocki on github.
• I am nhocki (https://keybase.io/nhocki) on keybase.
• I have a public key ASAapzaRg-je5LhP7oDwNcUwVtbKVeEBCsezA2gZUQL60Ao

To claim this, I am signing this object:

nhocki

# Bit.ly shortener
#
# Configuration:
#   HUBOT_BITLY_ACCESS_TOKEN
module.exports = (robot) ->
  shorten: (url, callback) ->
    robot.http("https://api-ssl.bitly.com/v3/shorten")
      .query
        access_token: process.env.HUBOT_BITLY_ACCESS_TOKEN
        format: "json"

nhocki

# prefork MPM
# StartServers: number of server processes to start
# MinSpareServers: minimum number of server processes which are kept spare
# MaxSpareServers: maximum number of server processes which are kept spare
# MaxRequestWorkers: maximum number of server processes allowed to start
# MaxConnectionsPerChild: maximum number of requests a server process serves

<IfModule mpm_prefork_module>
	StartServers			 5
	MinSpareServers		  5

nhocki

The introduction to Reactive Programming you've been missing

(by @andrestaltz)

---

This tutorial as a series of videos

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.

---

nhocki

// poller.go

package main

import (
	"fmt"
	"os"
	"os/signal"
	"time"

nhocki

PUBNUB_PUBLISH_KEY=YourPublishKey
PUBNUB_SUBSCRIBE_KEY=YourSubscribeKey

nhocki

# app/models/puntos.rb
class Puntos < AR::Base
  PUNTOS_ALL_KEY = "all_puntos".freeze

  after_save :expire_cache
  after_destroy :expire_cache

  # Guarda un arreglo de hashes con el JSON pa mandar.
  def self.all_cached
    Rails.cache.fetch(PUNTOS_ALL_KEY) do

nhocki

///////////////////////////////////////////////////////////////
//         Aho-Corasick's algorithm, as explained in         //
//          http://dx.doi.org/10.1145/360825.360855          //
///////////////////////////////////////////////////////////////

// Max number of states in the matching machine.
// Should be equal to the sum of the length of all keywords.
const int MAXS = 6 * 50 + 10; 

// Number of characters in the alphabet.