Skip to content

Instantly share code, notes, and snippets.

View adilakhter's full-sized avatar

Adil Akhter adilakhter

View GitHub Profile
import socket
import json
import sys
HOST = 'logging.developmentci.rebb.baseless.nl'
#HOST = '127.0.0.1'
PORT = 1514
try:
sock = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
@adilakhter
adilakhter / send_to_logstash.py
Created August 27, 2015 12:46
send to logstash
import socket
import json
import sys
HOST = 'logging.developmentci.rebb.baseless.nl'
PORT = 1514
try:
sock = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
except socket.error, msg:
@adilakhter
adilakhter / nbe-redis.js
Last active August 29, 2015 14:28
nbe-redis
// Redis Client
var redis = require("redis");
const DEFAULT_PORT = 6379;
const DEFAULT_HOST = '127.0.0.1';
var redis_host, redis_port;
global.reportKeys = [];
global.reports = {};
@adilakhter
adilakhter / nbe-processor.ruby
Last active August 29, 2015 14:27
A ruby script to process NBE files and store the result in REDIS.
#!/usr/bin/env ruby
%w{rubygems time redis csv json}.each{|r| require r}
# Key name for primary index.
# Using this key, the list of available reports are stored as set in REDIS
NBE_REPORTS_KEY = "reports"
# REDIS Host
REDIS_HOST = "127.0.0.1"
@adilakhter
adilakhter / gist:f57aac9939d42eb510e9
Last active August 29, 2015 14:26 — forked from runarorama/gist:a8fab38e473fafa0921d
Compositional application architecture with reasonably priced monads
sealed trait Interact[A]
case class Ask(prompt: String)
extends Interact[String]
case class Tell(msg: String)
extends Interact[Unit]
trait Monad[M[_]] {
def pure[A](a: A): M[A]
@adilakhter
adilakhter / BinaryTree.scala
Last active August 29, 2015 14:23
InvertTree scala repl output
scala> invertTree(t1)
res12: Tree[Int] =
Node(4,
Node(7,
Node(9,EmptyTree,EmptyTree),
Node(6,EmptyTree,EmptyTree)),
Node(2,
Node(3,EmptyTree,EmptyTree),
Node(1,EmptyTree,EmptyTree)))
@adilakhter
adilakhter / BinaryTree.scala
Created June 24, 2015 10:47
Inverse Tree function
def invertTree[A](tree: Tree[A]): Tree[A] =
fold (tree, Tree.empty[A]){(leftT, value, rightT) => Node(value, rightT, leftT)}
@adilakhter
adilakhter / BinaryTree.scala
Last active August 29, 2015 14:23
`map` using fold
import Tree._
def map[A,B](tree: Tree[A])(f: A => B): Tree[B] =
fold(tree, Tree.empty[B]){(l, x, r) => Node(f(x), l,r)}
scala> map (t1) ( x => x * 10)
res11: Tree[Int] =
Node(40,
@adilakhter
adilakhter / BinaryTree.scala
Last active August 29, 2015 14:23
size of the tree
def size[T] (tree: Tree[T]) =
fold(tree, 0: Int){(l,x,r) => l + r + 1}
scala> size(t1)
res11: Int = 7
@adilakhter
adilakhter / fold.scala
Created June 24, 2015 10:29
Fold on Binary Tree
def fold[A, B](t:Tree[A] , z:B)(f:(B,A,B) => B): B = t match {
case EmptyTree => z
case Node(x,l,r) => f ( fold( l , z )(f) , x , fold( r , z )(f) )
}