Skip to content

Instantly share code, notes, and snippets.

View cpjk's full-sized avatar
๐ŸŒฎ
๐ŸŒฎ ๐ŸŒฎ ๐ŸŒฎ ๐ŸŒฎ ๐ŸŒฎ ๐ŸŒฎ ๐ŸŒฎ ๐ŸŒฎ ๐ŸŒฎ

Chris Kelly cpjk

๐ŸŒฎ
๐ŸŒฎ ๐ŸŒฎ ๐ŸŒฎ ๐ŸŒฎ ๐ŸŒฎ ๐ŸŒฎ ๐ŸŒฎ ๐ŸŒฎ ๐ŸŒฎ
View GitHub Profile
app.use(function(req, res, next) {
Choral.createNew({
user: res.locals.userModel,
type: 'device',
name: 'asdf'
}, (err, choral) => { // HERE IS THE CALLBACK WE PASS
if (err) {
console.log(err);
return next(err);
}
#define PAIN (volatile unsigned char *) 0xFFFFFFF0
#define PAOUT (volatile unsigned char *) 0xFFFFFFF1
#define PADIR (volatile unsigned char *) 0xFFFFFFF2
#define PBIN (volatile unsigned char *) 0xFFFFFFF3
#define PBOUT (volatile unsigned char *) 0xFFFFFFF4
#define PBDIR (volatile unsigned char *) 0xFFFFFFF5
#define CNTM (volatile unsigned int *) 0xFFFFFFD0
#define CTCON (volatile unsigned char *) 0xFFFFFFD8
#define CTSTAT (volatile unsigned char *) 0xFFFFFFD9
#define PCONT (volatile unsigned char *) 0xFFFFFFF7
#define PBIN (volatile unsigned char *) 0xFFFFFFF3
#define PBOUT (volatile unsigned char *) 0xFFFFFFF4
#define PBDIR (volatile unsigned char *) 0xFFFFFFF5
#define CNTM (volatile unsigned int *) 0xFFFFFFD0
#define CTCON (volatile unsigned char *) 0xFFFFFFD8
#define CTSTAT (volatile unsigned char *) 0xFFFFFFD9
#define PCONT (volatile unsigned char *) 0xFFFFFFF7
#define IVECT (volatile unsigned int *) (0x20)
interrupt void intserv();

Keybase proof

I hereby claim:

  • I am cpjk on github.
  • I am cpjk (https://keybase.io/cpjk) on keybase.
  • I have a public key ASAVFPUWjzJwx6UXrSLXn8JelxjXHl_RIZs5GlvM6RvyPAo

To claim this, I am signing this object:

def lexical_uniques(str)
letter_positions = {}
list = str.split("")
list.each_index do |index|
letter = list[index]
letter_positions[letter] = letter_positions[letter] ? letter_positions[letter] + [index] : [index]
end
# iterate through the keys in alphabetical order,
def wiggle_sort(ary)
return ary if ary.length < 2
ary = ary.sort
lo_index = 0
hi_index = ary.length.even? ? (ary.length / 2) : (ary.length / 2) + 1
new_ary = []
def find_itinerary(pairs=[])
nodes = {} # hash with name as key and node as val
start_node = nil
pairs.each do |pair|
source_node = nodes[pair[0]] || Node.new(pair[0])
dest_node = nodes[pair[1]] || Node.new(pair[1])
source_node.add_dest(dest_node)
nodes[pair[0]] = source_node
nodes[pair[1]] = dest_node
start_node = source_node if source_node.val == "JFK"
def find_itinerary(pairs=[])
nodes = {} # hash with name as key and node as val
start_node = nil
pairs.each do |pair|
source_node = nodes[pair[0]] || Node.new(pair[0])
dest_node = nodes[pair[1]] || Node.new(pair[1])
source_node.add_dest(dest_node)
nodes[pair[0]] = source_node
nodes[pair[1]] = dest_node
start_node = source_node if source_node.val == "JFK"
def find_itinerary(pairs=[])
nodes = {} # hash with name as key and node as val
start_node = nil
pairs.each do |pair|
source_node = nodes[pair[0]] || Node.new(pair[0])
dest_node = nodes[pair[1]] || Node.new(pair[1])
source_node.add_dest(dest_node)
nodes[pair[0]] = source_node
nodes[pair[1]] = dest_node
start_node = source_node if source_node.val == "JFK"
def find_itinerary(pairs=[])
nodes = {} # hash with name as key and node as val
start_node = nil
pairs.each do |pair|
source_node = nodes[pair[0]] || Node.new(pair[0])
dest_node = nodes[pair[1]] || Node.new(pair[1])
source_node.add_dest(dest_node)
nodes[pair[0]] = source_node
nodes[pair[1]] = dest_node
start_node = source_node if source_node.val == "JFK"