brenns10

"""
Open a file via sudo and unix socket

If you only need root privileges to open one file, then you can spawn a helper
program with sudo to open the file, then pass the file descriptor back to your
original process via a Unix socket. This module imports a drop-in replacement
for os.open (except for the dir_fd argument) based on this idea:

    stephen at wrath in ~/repos/opener
    $ ls -l secret.txt

brenns10

/*
 * Sample multi-threaded application for core dump.
 * gcc -pthread -g -O0 -o coredump coredump.c
 */
#define _GNU_SOURCE
#include <stdlib.h>
#include <stdio.h>
#include <pthread.h>
#include <sys/types.h>
#include <unistd.h>

brenns10

Keybase proof

I hereby claim:

• I am brenns10 on github.
• I am brenns10 (https://keybase.io/brenns10) on keybase.
• I have a public key ASCtEwHfvPC-c34CBjy90aiuZ7pxk9h_LRgo4cZD5MTdygo

To claim this, I am signing this object:

brenns10

From 38c48252f528b00ba0b4fd2d1a364b91c694a4ac Mon Sep 17 00:00:00 2001
From: Stephen Brennan <[email protected]>
Date: Thu, 28 Dec 2017 15:14:59 -0800
Subject: [PATCH] fs: when reading mp3 files, only play Shake It Off

---
 fs/open.c | 31 ++++++++++++++++++++++++++++++-
 1 file changed, 30 insertions(+), 1 deletion(-)

diff --git a/fs/open.c b/fs/open.c

brenns10

# $Id: PKGBUILD 286731 2017-01-16 12:41:55Z svenstaro $
# Maintainer: Angel Velasquez <[email protected]>
# Maintainer: Felix Yan <[email protected]>
# Contributor: Stéphane Gaudreault <[email protected]>
# Contributor: Allan McRae <[email protected]>
# Contributor: Jason Chu <[email protected]>

pkgname=python
pkgver=3.6.0
pkgrel=3

brenns10

obj-m += chardev.o
all:
	make -C /lib/modules/$(shell uname -r)/build M=$(PWD) modules
clean:
	make -C /lib/modules/$(shell uname -r)/build M=$(PWD) clean

brenns10

Keybase proof

I hereby claim:

• I am brenns10 on github.
• I am brenns10 (https://keybase.io/brenns10) on keybase.### Keybase proof

I hereby claim:

• I am brenns10 on github.

brenns10

brenns10

"""
Code to return the alphabet in which a list of words is sorted.

Imagine that you are given a list of words (eg: best friends forever), along
with the claim that these words are lexicographically sorted for *some*
alphabet.  Your job is to determine whether this is true, and if it is, return
an example of such an alphabet.

This module implements an algorithm to solve this problem.  It creates a graph
of dependencies between letters, performs a topological sort, and then returns

brenns10

#!/usr/bin/env python3
"""
Run a list of commands in tmux.
"""

from subprocess import call
from os.path import realpath, isfile
from uuid import uuid4
from datetime import datetime
import os, sys