Ino4137

Weapons

name	skill	dam	crit	range	encum	price	rarity	special
knife	m:light	+1	3	engaged	1	25	1
pistol	r:light	6	3	medium	1	500	4
laser pistol	r:light	4	4	medium	1	400	4	accurate 1, pierce 1

Armor

name	defense	soak	encum	price	rarity	hard	special
technical vest	0	1	3	300	5	3

Ino4137

{-# LANGUAGE DeriveTraversable #-}

import Prelude hiding (iterate)
import Control.Monad ((<=<))

data Fix m = In {out :: m (Fix m)}

data ListF x xs = Nil | Cons x xs 
  deriving (Functor, Foldable, Traversable)

Ino4137

{-# LANGUAGE DeriveTraversable, GADTs #-}

import Data.List (intersperse,intercalate,transpose)
import Text.Printf (printf)

type Graph = GraphF Bool
type Function = Integer -> Integer -> Bool

height, width :: Integer
height = 40

Ino4137

import Control.Monad.Trans.State
import Data.List

frc sequ = fst $ execState (mapM_ check sequ) (Nothing,[])

check :: Eq a => a -> State (Maybe a, [a]) ()
check x = do
    (status,prev) <- get
    case status of
        Just x -> 

Ino4137

sumPairs :: [Integer] -> [Integer]
sumPairs (x:y:s) = (x + y) : sumPairs (y:s)
sumPairs _       = []

pascal :: Integer -> [Integer]
pascal 0 = [1]
pascal n = sumPairs $ 0 : pascal (n - 1) ++ [0]

sierpinski :: Integer -> String
sierpinski n = pascal n >>= (ascii . odd)

Ino4137

import Data.List
import Data.Function
import Control.Monad
import Text.Printf

data Tree a = 
    Leaf | Unary a | Node (Tree a) a (Tree a)
    deriving (Eq, Show)

data From = F | B deriving (Eq, Show)

Ino4137

macro_rules! walker {
        // step
        ($steps:expr; $node:expr; [$($listB:tt),* $prev:expr]; [$next:expr, $($listF:expr),+]) => {
            match $steps {
                $steps if $steps == 0 => {
                    *$node + 1;
                    ($node - 1; $node; [$listB, $prev]; [$next, $listF];)
                },
                $steps if $steps > 0 => {
                    ($steps - 1; $next; [$listB, $prev, $node]; [$listF])