jbro885

-- show running queries (pre 9.2)
SELECT procpid, age(clock_timestamp(), query_start), usename, current_query 
FROM pg_stat_activity 
WHERE current_query != '<IDLE>' AND current_query NOT ILIKE '%pg_stat_activity%' 
ORDER BY query_start desc;

-- show running queries (9.2)
SELECT pid, age(clock_timestamp(), query_start), usename, query 
FROM pg_stat_activity 
WHERE query != '<IDLE>' AND query NOT ILIKE '%pg_stat_activity%' 

jbro885

% Calculate Compound or simple interest
%
%                         _____________________
% input data and  --->   | calculate interest  | -----> output interst
% type of interest       |_____________________|
%
%
clear
clc
%simple interest

jbro885

Install Ruby and Rails

Ruby now come preinstalled on many Linux distributions, and Mac OS X includes Ruby). Try typing ruby -v at a command prompt--you may be pleasantly surprised.

If you don't already have Ruby on your system or if you'd like to upgrade to a newer version (remembering that this couse describes Ruby 1.9), you can install it pretty simply. What you do next depends on your operating system.

Install Ruby on Windows

1. Download http://railsinstaller.org/ from Apple Application Store :

jbro885

"use strict";

var inquirer = require('inquirer');

var game = require('./game.source');

// play(node: Node) -> Promise<Node>
function play(node) {
  if (!node.connections.length) {
    console.log(node.text);

jbro885

#include <stdio.h>
#include <stdlib.h>
#include <strings.h>

/*
 * Pearson hashing (from Wikipedia)
 *
 * Pearson hashing is a hash function designed for fast execution on processors with 8-bit registers.
 * Given an input consisting of any number of bytes, it produces as output a single byte that is strongly
 * dependent on every byte of the input. Its implementation requires only a few instructions, plus a

jbro885

'use strict'

// Ideally, this table would be shuffled...
// 256 will be the highest value provided by this hashing function
let table = [...new Array(256)].map((_, i) => i)

const hash8 = (message, table) => {
  return message.split('').reduce((hash, c) => {
    return table[(hash + c.charCodeAt(0)) % (table.length - 1)]
  }, message.length % (table.length - 1))

jbro885

(function () {
    var alphabet = '0123456789abcdefghjkmnpqrtuvwxyz';
    var alias = {
            o: 0,
            i: 1,
            l: 1,
            s: 5
        };
    var lookup = function () {
        var table = {};

jbro885

Objective:

This JavaScript program takes a text file as input and returns count of each word in sorted order.

How to Run:

~$ npm install ~$ node index.js [path-to-file]

Sample Input:

~$ ~$ npm install

jbro885

const countLines = function(filePath, callback) {
    // function copied from http://stackoverflow.com/questions/12453057/node-js-count-the-number-of-lines-in-a-file
    // with very few modifications
    let i;
    let count = 0;
    fs.createReadStream(filePath)
        .on('error', e => callback(e))
        .on('data', chunk => {
            for (i=0; i < chunk.length; ++i) if (chunk[i] == 10) count++;
        })

jbro885

/**
 * WordCounter.js
 *   a command-line tool by eloytoro
 * 
 * How to use:
 * 
 *   $ node word-counter.js <dir>
 *   - Count the word occurrences among all the files within the given directory directory.
 *   - It will split the task between 3 workers, each of which could run completely standalone
 *     by communicating to the main server using TCP sockets if it exposes its address publicly