tylerneylon

license: mit

tylerneylon

# -*- coding: utf-8 -*-
""" rwlock.py

    A class to implement read-write locks on top of the standard threading
    library.

    This is implemented with two mutexes (threading.Lock instances) as per this
    wikipedia pseudocode:

    https://en.wikipedia.org/wiki/Readers%E2%80%93writer_lock#Using_two_mutexes

tylerneylon

-- Two dashes start a one-line comment.

--[[
     Adding two ['s and ]'s makes it a
     multi-line comment.
--]]

----------------------------------------------------
-- 1. Variables and flow control.
----------------------------------------------------

tylerneylon

--[[ json.lua

A compact pure-Lua JSON library.
The main functions are: json.stringify, json.parse.

## json.stringify:

This expects the following to be true of any tables being encoded:
 * They only have string or number keys. Number keys must be represented as
   strings in json; this is part of the json spec.

tylerneylon

-- copy.lua
--
-- Lua functions of varying complexity to deep copy tables.
--


-- 1. The Problem.
--
-- Here's an example to see why deep copies are useful. Let's
-- say function f receives a table parameter t, and it wants to

tylerneylon

#!/usr/bin/awk -f
#
# call_graph.awk
#
# Usage:
#   ./call_graph.awk my_program.lua | dot -Tpng > call_graph.png
#
# This is a script that generates a visual call graph
# for a Lua file. This script only shows calls made
# to functions defined within the input Lua file; that is,

tylerneylon

all: demo.so

clean:
	rm *.o *.so

demo.so: demo.o printstack.o
	cc -bundle -undefined dynamic_lookup -o demo.so demo.o printstack.o

demo.o: demo.c
	cc -fPIC -o $@ -c $< -Ilua_src

tylerneylon

#!/usr/bin/env python3
# coding: utf-8
""" splits.py

    Usage:
        ./splits .in,cr..

    This will print out all known words that match both patterns with fixed
    letters per dot. In the above example, one answer pair would be:

tylerneylon

// This is a depth-first traversal function with a few nice features.
//
// * Call this function as depthFirstTraverse(root, tree, fn)
//   `tree` is an object whose properties are nodes in a tree; the
//          values are arrays of that node's child nodes.
//   `root` is the starting point for the traversal; a property in `tree`.
//   `fn` is called as in fn(node, depth, childNum) for each node.
//          childNum is the index of node as a child of its parent;
//          as a special case, the childNum of `root` is undefined.
//          `depth` is 0 for the root, and in general indicates how

tylerneylon

/* printTree.js
 *
 * A little function to print out a tree via console.log().
 *
 * The tree is expected to be an object whose keys (aka properties) are
 * treated as nodes; each node mapping to an array of its children.
 * Leaf nodes don't need to be present as keys.
 *
 * Here is an example tree with root element 'a':
 * t = {a: ['b', 'c'], b: ['d'], c: ['e'], d: ['f', 'g'], g: ['h']}