ktbarrett

// Library code

#include <stdexcept>
#include <type_traits>
#include <utility>

namespace library {

    template <typename T>
    struct to_positive {

ktbarrett

struct no_delete {
    template <typename T>
    void operator() (T*) {}
};

template <typename T>
using unique_handle = std::unique_ptr<T, no_delete>;

template <typename T>
auto get_handle_to(T& a) {

ktbarrett

from monad import Monad


class Computation(Monad):
    __category = True
    
    @staticmethod
    def pure(value):
        return Continue(value)
        

ktbarrett

import itertools

def load_pyconf_file(filename, env=None):
    f = '\t'.join(itertools.chain(("def __func():\n",), open(filename).readlines()))
    if env:
        exec(f, env)
        return env['__func']()
    else:
        exec(f)
        return __func()

ktbarrett

def Parameterize(cls, *mixins, **attributes):
    mixin_prefix = ''.join((mixin.__name__ for mixin in mixins))
    parameterize = (f"{k}={v}" for k,v in attributes.items())
    parameter_suffix = f"({', '.join(parameterize)})"
    bases = tuple((*mixins, cls))
    base_types = tuple(frozenset(type(t) for t in bases))
    base_typename = ''.join((t.__name__ for t in base_types))
    base_type = type(base_typename, base_types, {})
    return base_type(f"{mixin_prefix}{cls.__name__}{parameter_suffix}", bases, attributes)

ktbarrett

from collections import Counter as Multiset


def multiset_combinations(ms, n):
    assert sum(ms.values()) >= n
    def f(ms_res, curr_val, ms_rem):
        nonlocal n
        if sum(ms_res.values()) == n:  #ideally len would return the number of total elements
            yield ms_res
        else:

ktbarrett

`timescale 1ns / 1ps
`default_nettype none


module fifo #(
    parameter WIDTH = 32,
    parameter DEPTH = 1024,
    parameter SKID = 0,
    parameter GEN_EXCEPTIONS = 1,
    parameter GEN_CONSENTS = 1