Alex Bowe alexbowe

## tree_iterators.py
'''
Interview hack: Memorize preorder/inorder/postorder tree ITERATORS (no recursion) and their reverses.
It simplifies a disproportionate number of questions to simple for loops (see below).

I consider the implementations below the simplest way to memorize the iterative tree traversal algorithms,
because they are so similar to each other, and to their respective recursive versions.

Notes:
- We only visit a node after we have expanded its children (i.e. added them to the stack) in the desired order.
- `x is curr` does the expanded flagging for us, because we always expand the current node.

## get_readwise_data.py
import requests

READWISE_API_KEY = ""  # Go to readwise.io/access_token

def get_readwise_data():
  next_page = None
  while True:
    # See https://readwise.io/api_deets for more info
    response = requests.get(
      url="https://readwise.io/api/v2/export/",

## nltk-intro.py
import nltk

text = """The Buddha, the Godhead, resides quite as comfortably in the circuits of a digital
computer or the gears of a cycle transmission as he does at the top of a mountain
or in the petals of a flower. To think otherwise is to demean the Buddha...which is
to demean oneself."""

# Used when tokenizing words
sentence_re = r'''(?x)      # set flag to allow verbose regexps
      ([A-Z])(\.[A-Z])+\.?  # abbreviations, e.g. U.S.A.

## streams.py
null_stream = (None, None)

def map(f, stream):
    if stream is null_stream: return null_stream
    return (f(head(stream)), lambda: map(f, tail(stream)))

def reduce(f, result, stream):
    if stream is null_stream: return result
    return reduce(f, f(result, head(stream)), tail(stream))

## keybase.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                alexbowe
                / keybase.md
            
            
              Created
              March 23, 2021 07:21
            
              
                Keybase Verification
              
          
    Keybase proof

I hereby claim:

I am alexbowe on github.
I am alexbowe (https://keybase.io/alexbowe) on keybase.
I have a public key ASASPBNsdnHoE-uJo2gxeVYU0sQsQnIAEG3CBPQVNtz4zgo

To claim this, I am signing this object:

  
## tweet_finder.py
# To run, from shell type: python tweet_finder.py
# Must be run in the same directory as the downloaded csv file.

import csv

# Modify this number if you want a different nth Tweet
# Should be 1-based (i.e. first tweet is the 1th, not 0th)
num = 40000
# Change the path if you want to run it from a different directory
path = "tweets.csv"

## 750kotoba.html
<!DOCTYPE html>
<html>
  <head>
    <!-- http://chasen.org/~taku/software/TinySegmenter/ -->
    <script type="text/javascript" src="tiny_segmenter.js" charset="UTF-8"></script>
    <script>
    var segmenter = new TinySegmenter();

    function countWords() {
      s = document.getElementById("inputText").value;

## int_mapper_one_liner.py
# here is a tidy way to get a hashable object (such as a word) to map to a unique int in python

from collections import defaultdict
mapper = defaultdict(lambda: len(mapper))

mapper["hello"] # 0
mapper["world"]  # 1
mapper["and"]  # 2
mapper["hello"] # 0
mapper["alex"] # 3

## funky_typedef.c
/*
I have read a bunch of posts about function pointers,
such as http://denniskubes.com/2013/03/22/basics-of-function-pointers-in-c/
but I rarely see this *one weird trick*.

It is C's (admittedly clunky) syntax for typedefing a function pointer of a given signiature.
Hide the clunkiness in the typedef to keep your code tidy and maintainable.
*/

#include <stdio.h>

## composite_rank.py
def gam_to_lam(c, n):
    i, m = 0, 0
    L = [0] * n

    while 1:
        i = i+1
        if c[i-1] > 0:
            for j in range(1, c[i-1] + 1):
                m = m + 1
                L[m-1] = i
	'''
	Interview hack: Memorize preorder/inorder/postorder tree ITERATORS (no recursion) and their reverses.
	It simplifies a disproportionate number of questions to simple for loops (see below).

	I consider the implementations below the simplest way to memorize the iterative tree traversal algorithms,
	because they are so similar to each other, and to their respective recursive versions.

	Notes:
	- We only visit a node after we have expanded its children (i.e. added them to the stack) in the desired order.
	- `x is curr` does the expanded flagging for us, because we always expand the current node.
	import requests

	READWISE_API_KEY = "" # Go to readwise.io/access_token

	def get_readwise_data():
	next_page = None
	while True:
	# See https://readwise.io/api_deets for more info
	response = requests.get(
	url="https://readwise.io/api/v2/export/",
	import nltk

	text = """The Buddha, the Godhead, resides quite as comfortably in the circuits of a digital
	computer or the gears of a cycle transmission as he does at the top of a mountain
	or in the petals of a flower. To think otherwise is to demean the Buddha...which is
	to demean oneself."""

	# Used when tokenizing words
	sentence_re = r'''(?x) # set flag to allow verbose regexps
	([A-Z])(\.[A-Z])+\.? # abbreviations, e.g. U.S.A.
	null_stream = (None, None)

	def map(f, stream):
	if stream is null_stream: return null_stream
	return (f(head(stream)), lambda: map(f, tail(stream)))

	def reduce(f, result, stream):
	if stream is null_stream: return result
	return reduce(f, f(result, head(stream)), tail(stream))
	# To run, from shell type: python tweet_finder.py
	# Must be run in the same directory as the downloaded csv file.

	import csv

	# Modify this number if you want a different nth Tweet
	# Should be 1-based (i.e. first tweet is the 1th, not 0th)
	num = 40000
	# Change the path if you want to run it from a different directory
	path = "tweets.csv"
	<!DOCTYPE html>
	<html>
	<head>
	<!-- http://chasen.org/~taku/software/TinySegmenter/ -->
	<script type="text/javascript" src="tiny_segmenter.js" charset="UTF-8"></script>
	<script>
	var segmenter = new TinySegmenter();

	function countWords() {
	s = document.getElementById("inputText").value;
	# here is a tidy way to get a hashable object (such as a word) to map to a unique int in python

	from collections import defaultdict
	mapper = defaultdict(lambda: len(mapper))

	mapper["hello"] # 0
	mapper["world"] # 1
	mapper["and"] # 2
	mapper["hello"] # 0
	mapper["alex"] # 3
	/*
	I have read a bunch of posts about function pointers,
	such as http://denniskubes.com/2013/03/22/basics-of-function-pointers-in-c/
	but I rarely see this one weird trick.

	It is C's (admittedly clunky) syntax for typedefing a function pointer of a given signiature.
	Hide the clunkiness in the typedef to keep your code tidy and maintainable.
	*/

	#include <stdio.h>
	def gam_to_lam(c, n):
	i, m = 0, 0
	L = [0] * n

	while 1:
	i = i+1
	if c[i-1] > 0:
	for j in range(1, c[i-1] + 1):
	m = m + 1
	L[m-1] = i