yeukhon

// Usage:
//   node pub.js
// then starts typing message (ENTER per message)
// A publisher could be invokved by a background job
// processor or a user triggered action received by
// web app.
var redis = require("redis");
var pub = redis.createClient();

process.stdin.resume();

yeukhon

Environment: I think we will try the coding on Linux. I use Mac but I can just work from a vagrant machine or from an EC2 instance.

robots-txt-scanner takes in a robots.txt file and outputs a list of (token, lexeme) tuple.

print scanner.scan("User-agent: Google\nDisallow: *")
(('\\USER_AGENT_VALUE/', 'User-agent: Google'), ('\\DISALLOW_VALUE/', 'Disallow: *'))

Features:

yeukhon

var Foo = function () {
    alert("Hello! You've just called Foo()");
}

module.exports = Foo

yeukhon

#
# Wide-open CORS config for nginx
#
location / {

     if ($request_method = 'OPTIONS') {

        add_header 'Access-Control-Allow-Origin' '*';
        
        #

yeukhon

// api.js
var Job = function(settings, jq) {

    var createJob = function(args) {
        return $.ajax({
            url: "https://yeukhon.me/api/job",
            type: "POST",
            crossDomain: true,
            data: {
                job_name: args.job_name,

yeukhon

import re
text1 = "alphanumeric@example.org"
text2 = "alphanumeric@long.subdomain.more.subdomain.domain.org"

r1 = re.compile(r'[a-zA-Z0-9]+@[a-zA-Z]+\.[a-zA-Z]+(\.[a-zA-Z]+)*')

print(r1.match(text1).group())
print(r1.match(text2).group())

print("part 2 - compare with and without (?:")

yeukhon

stuff = set([ '%s.%s' % (prefix, type) for type in types(suffix) if prefix in get_types(given_type) ])
# how do I know where I can split this onto multiple lines?

and my answer is at the expression.

>>> [x
... for

yeukhon

"""
>>> a = [[1,2], [3,3], [4]]
>>> o = []
>>> for x in a:
...     o.extend(x)
...
>>> o
[1, 2, 3, 3, 4]

yeukhon

import pqdict

def dijkstra(graph, source, target=None):
    """
    Computes the shortests paths from a source vertex to every other vertex in
    a graph

    """
    # The entire main loop is O( (m+n) log n ), where n is the number of
    # vertices and m is the number of edges. If the graph is connected

yeukhon

import random
def q_select(numbers, ith):
    if len(numbers) < 2:
        return numbers[0]
    # Chooses a pivot uniformly from random
    p_index = random.randint(0, len(numbers)-1)
    pivot = numbers[p_index]

    # Before the partition, swap the pivot with the last element
    numbers[p_index], numbers[-1] = (