msullivan

from types import MethodType

class strict_staticmethod:
    def __init__(self, f):
        self.f = f

    def __get__(self, obj, type=None):
        if obj is not None:
            raise AttributeError("strict_staticmethod can't be accessed through obj")
        return self.f

msullivan

from typing import cast
class Tree:
    def accept(self, v: 'TreeVisitor') -> object:
        pass
class Leaf(Tree):
    def accept(self, v: 'TreeVisitor') -> object:
        return v.visit_leaf(self)
class Node(Tree):
    def __init__(self, value: int, left: Tree, right: Tree) -> None:
        self.value = value

msullivan

#ifndef LIST_H
#define LIST_H

#include <stddef.h>

/**
 * @brief A list traversal field that can be embedded in objects.
 */
typedef struct list_node {
	struct list_node *next;

msullivan

#ifndef LIST_H
#define LIST_H

#include <stddef.h>

/**
 * @brief A list traversal field that can be embedded in objects.
 */
typedef struct list_node {
	///////

msullivan

/**
 * @file variable_queue.h
 *
 * @brief Generalized queue module for data collection
 *
 * @author Michael Sullivan (sully@msully.net)
 **/

#include <stddef.h>
#include <stdlib.h>

msullivan

(* A modification of binary-set-fn.sml to be able to handle set elements
 * that contain sets. *)

(* binary-set-fn.sml
 *
 * COPYRIGHT (c) 1993 by AT&T Bell Laboratories.  See COPYRIGHT file for details.
 *
 * This code was adapted from Stephen Adams' binary tree implementation
 * of applicative integer sets.
 *

msullivan

{-# LANGUAGE GeneralizedNewtypeDeriving, DeriveFoldable #-}

import Data.Foldable
import qualified Data.Set as Set
import qualified Data.Map as Map

class Memo a where
  memo :: (a -> b) -> (a -> b)

  memoFix :: ((a -> b) -> (a -> b)) -> (a -> b)

msullivan

#!/usr/bin/env python3

def build_rgraph(graph):
    rgraph = {k: set() for k in graph.keys()}
    for u in graph.keys():
        for v in graph[u]:
            rgraph[v].add(u)
    return rgraph

def dfs(graph, seen, val, start):

msullivan

(* uses some data structures from
 * https://github.com/standardml/cmlib/ *)

(* also the pretty printer uses some hacked up versions of some stuff
 * from tom7 that I don't actually include but will if anybody wants to
 * actually run this *)


signature VARIABLE =
sig

msullivan

Alaska,1
Delaware,1
Montana,1
NorthDakota,1
SouthDakota,1
Vermont,1
Wyoming,1
Hawaii,2
Idaho,2
Maine,2