Geometry.SetOperations.BSP

Documentation

data BinaryTree l n

Binary Tree parametrized by leafs and nodes

Constructors

Node (BinaryTree l n) !n (BinaryTree l n)

Leaf !l

Instances

Bifunctor BinaryTree

Methods

bimap :: (a -> b) -> (c -> d) -> BinaryTree a c -> BinaryTree b d

first :: (a -> b) -> BinaryTree a c -> BinaryTree b c

second :: (b -> c) -> BinaryTree a b -> BinaryTree a c

Functor (BinaryTree l)

Methods

fmap :: (a -> b) -> BinaryTree l a -> BinaryTree l b

(<$) :: a -> BinaryTree l b -> BinaryTree l a

(Eq l, Eq n) => Eq (BinaryTree l n)

Methods

(==) :: BinaryTree l n -> BinaryTree l n -> Bool

(/=) :: BinaryTree l n -> BinaryTree l n -> Bool

(Show l, Show n) => Show (BinaryTree l n)

Methods

showsPrec :: Int -> BinaryTree l n -> ShowS

show :: BinaryTree l n -> String

showList :: [BinaryTree l n] -> ShowS

data LeafColor

Constructors

Green

Red

Instances

Eq LeafColor

Methods

(==) :: LeafColor -> LeafColor -> Bool

(/=) :: LeafColor -> LeafColor -> Bool

Show LeafColor

Methods

showsPrec :: Int -> LeafColor -> ShowS

show :: LeafColor -> String

showList :: [LeafColor] -> ShowS

swapColor :: LeafColor -> LeafColor

type BSP = BinaryTree LeafColor

cmp :: BSP a -> BSP a

Complementary set

pattern In :: forall a. BSP a

pattern Out :: forall a. BSP a

constructBSP :: Clip b v n => (Facet b v n -> c) -> [Facet b v n] -> BSP c

splitWith :: (a -> (Maybe a, Maybe a)) -> [a] -> ([a], [a])

destructBinaryTree :: BinaryTree l n -> [n]

prettyBSP :: Ord f => BSP f -> IO ()

Pretty print BSP tree to stdout.

renderH :: (Doc -> Doc) -> Context k -> BSP k -> Doc

Render BSP into a horizontal tree with a given context.

denormalizeBSP :: Ord n => BSP n -> (BSP Int, IntMap n)

Denormalize BSP with integers at nodes and IntMap of values.