I hereby claim:
- I am maxdeliso on github.
- I am maxdeliso (https://keybase.io/maxdeliso) on keybase.
- I have a public key whose fingerprint is 9902 15ED E2C3 E1B6 22FA 9D85 F8C0 C98A 48FD 423A
To claim this, I am signing this object:
/* | |
* A DFS/BFS implementation for simple unweighted connected graphs. | |
* Max DeLiso <[email protected]> | |
* 10/31/15 | |
*/ | |
#include <iostream> | |
#include <cassert> | |
#include <stack> |
CC=gcc | |
LD=ld | |
CFLAGS=-Wall -Wextra -pedantic -std=c11 -g | |
LDFLAGS=-entry run | |
uch: uch.o | |
$(LD) $(LDFLAGS) $< -o $@ | |
uch.o: uch.c |
.PHONY: clean | |
RM=rm | |
CC=clang | |
CFLAGS=-Wall | |
OUT=tree_test | |
MODULES=tree tree_test | |
OBJ=$(addsuffix .o, $(MODULES)) |
import scala.io.StdIn | |
object Bits{ | |
def main(args: Array[String]): Unit = { | |
while(true) { | |
println( | |
prettyBits( | |
Option[String](StdIn.readLine) match { | |
case Some(str) => for { | |
by <- str.map(_.toByte) |
module Main where | |
import System.Environment | |
import System.Exit | |
import Sierpinski | |
main = do args <- getArgs | |
if length args /= 2 then | |
error "two integer args required: width and iteration count" | |
else |
I hereby claim:
To claim this, I am signing this object:
/* | |
* perms.c | |
* | |
* [email protected] | |
* | |
* read strings from stdin and print the permutations in lex order. | |
* | |
* permutations are computed using constant space. | |
* | |
* algorithm transliterated to C from TAOCP, Vol 4A, Part 1 |
module AStack(Stack, push, pop, top, size, stackTo) where | |
data Stack a = Empty | |
| MkStack a (Stack a) | |
push :: a -> Stack a -> Stack a | |
push x s = MkStack x s | |
size :: Stack a -> Int | |
size s = length (stkToLst s) where | |
stkToLst Empty = [] |
I hereby claim:
To claim this, I am signing this object:
CC=clang | |
CFLAGS=-Weverything -D_XOPEN_SOURCE -std=c99 -g -O2 | |
OUT=sread | |
.PHONY: clean | |
$(OUT): $(OUT).c | |
$(CC) $(CFLAGS) $< -o $@ |