Data.Atlas

skyline packing using stb_rect_pack.h

Documentation

data Atlas s

Instances

Eq (Atlas s)

Defined in Data.Atlas.Internal

Methods

(==) :: Atlas s -> Atlas s -> Bool

(/=) :: Atlas s -> Atlas s -> Bool

Ord (Atlas s)

Defined in Data.Atlas.Internal

Methods

compare :: Atlas s -> Atlas s -> Ordering

(<) :: Atlas s -> Atlas s -> Bool

(<=) :: Atlas s -> Atlas s -> Bool

(>) :: Atlas s -> Atlas s -> Bool

(>=) :: Atlas s -> Atlas s -> Bool

max :: Atlas s -> Atlas s -> Atlas s

min :: Atlas s -> Atlas s -> Atlas s

Show (Atlas s)

Defined in Data.Atlas.Internal

Methods

showsPrec :: Int -> Atlas s -> ShowS

show :: Atlas s -> String

showList :: [Atlas s] -> ShowS

create :: (HasCallStack, PrimMonad m) => Int -> Int -> m (Atlas (PrimState m))

Create a packing context.

createExplicit :: HasCallStack => PrimMonad m => Int -> Int -> Maybe Int -> m (Atlas (PrimState m))

Initialization with an optional node count, when node count < width is used this results in quantization unless setAllowOutOfMem is enabled. When no value is supplied, it defaults to the width of the Atlas.

reset :: PrimMonad m => Atlas (PrimState m) -> m ()

Reinitialize an atlas with the same parameters

Setup

data Heuristic

Constructors

BottomLeft

bottom-left sort-height

BestFirst

best first sort-height

Instances

Bounded Heuristic

Defined in Data.Atlas.Internal

Methods

minBound :: Heuristic

maxBound :: Heuristic

Enum Heuristic

Defined in Data.Atlas.Internal

Methods

succ :: Heuristic -> Heuristic

pred :: Heuristic -> Heuristic

toEnum :: Int -> Heuristic

fromEnum :: Heuristic -> Int

enumFrom :: Heuristic -> [Heuristic]

enumFromThen :: Heuristic -> Heuristic -> [Heuristic]

enumFromTo :: Heuristic -> Heuristic -> [Heuristic]

enumFromThenTo :: Heuristic -> Heuristic -> Heuristic -> [Heuristic]

Eq Heuristic

Defined in Data.Atlas.Internal

Methods

(==) :: Heuristic -> Heuristic -> Bool

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

Ord Heuristic

Defined in Data.Atlas.Internal

Methods

compare :: Heuristic -> Heuristic -> Ordering

(<) :: Heuristic -> Heuristic -> Bool

(<=) :: Heuristic -> Heuristic -> Bool

(>) :: Heuristic -> Heuristic -> Bool

(>=) :: Heuristic -> Heuristic -> Bool

max :: Heuristic -> Heuristic -> Heuristic

min :: Heuristic -> Heuristic -> Heuristic

Read Heuristic

Defined in Data.Atlas.Internal

Methods

readsPrec :: Int -> ReadS Heuristic

readList :: ReadS [Heuristic]

readPrec :: ReadPrec Heuristic

readListPrec :: ReadPrec [Heuristic]

Show Heuristic

Defined in Data.Atlas.Internal

Methods

showsPrec :: Int -> Heuristic -> ShowS

show :: Heuristic -> String

showList :: [Heuristic] -> ShowS

Ix Heuristic

Defined in Data.Atlas.Internal

Methods

range :: (Heuristic, Heuristic) -> [Heuristic]

index :: (Heuristic, Heuristic) -> Heuristic -> Int

unsafeIndex :: (Heuristic, Heuristic) -> Heuristic -> Int

inRange :: (Heuristic, Heuristic) -> Heuristic -> Bool

rangeSize :: (Heuristic, Heuristic) -> Int

unsafeRangeSize :: (Heuristic, Heuristic) -> Int

Lift Heuristic

Defined in Data.Atlas.Internal

Methods

lift :: Heuristic -> Q Exp

Default Heuristic

Defined in Data.Atlas.Internal

Methods

def :: Heuristic

setHeuristic :: PrimMonad m => Atlas (PrimState m) -> Heuristic -> m ()

setAllowOutOfMem :: PrimMonad m => Atlas (PrimState m) -> Bool -> m ()

Using a context

data Pt

Use and cast back and forth to ints instead for more natural API?

Constructors

Pt Int Int

Instances

Eq Pt

Defined in Data.Atlas.Internal

Methods

(==) :: Pt -> Pt -> Bool

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

Num Pt

Defined in Data.Atlas.Internal

Methods

(+) :: Pt -> Pt -> Pt

(-) :: Pt -> Pt -> Pt

(*) :: Pt -> Pt -> Pt

negate :: Pt -> Pt

abs :: Pt -> Pt

signum :: Pt -> Pt

fromInteger :: Integer -> Pt

Ord Pt

Defined in Data.Atlas.Internal

Methods

compare :: Pt -> Pt -> Ordering

(<) :: Pt -> Pt -> Bool

(<=) :: Pt -> Pt -> Bool

(>) :: Pt -> Pt -> Bool

(>=) :: Pt -> Pt -> Bool

max :: Pt -> Pt -> Pt

min :: Pt -> Pt -> Pt

Read Pt

Defined in Data.Atlas.Internal

Methods

readsPrec :: Int -> ReadS Pt

readList :: ReadS [Pt]

readPrec :: ReadPrec Pt

readListPrec :: ReadPrec [Pt]

Show Pt

Defined in Data.Atlas.Internal

Methods

showsPrec :: Int -> Pt -> ShowS

show :: Pt -> String

showList :: [Pt] -> ShowS

Lift Pt

Defined in Data.Atlas.Internal

Methods

lift :: Pt -> Q Exp

pack

Arguments

:: (PrimMonad m, Traversable f)

=> Atlas (PrimState m)

The atlas you want to pack these rectangles into.

-> (a -> Pt)

for each item you want to pack, extract the size.

-> (Maybe Pt -> a -> b)

when some fail to pack this will be called, with Just a position for each that succeeded, and Nothing for any that it failed on. The successes and failures may well be out of order.

-> (Pt -> a -> c)

when all succeed this will be called with each position.

-> f a

A container full of things that you'd like to pack into the atlas.

-> m (Either (f b) (f c))

Either a mixture of successes and failures, or a successful pack.

pack1 :: PrimMonad m => Atlas (PrimState m) -> Pt -> m (Maybe Pt)

Add one rectangle to the Atlas. Using pack can yield significantly better packing than calling this one rectangle at a time.

packM

Arguments

:: (PrimBase m, Traversable f)

=> Atlas (PrimState m)

The Atlas you want to pack these rectangles into.

-> (a -> m Pt)

for each item you want to pack, extract the size, with effects in m

-> (Maybe Pt -> a -> b)

when some fail to pack this will be called, with Just a position for each that succeeded, and Nothing for any that it failed on. The successes and failures may well be out of order.

-> (Pt -> a -> c)

when all succeed, this will be called with each position.

-> f a

A container full of things that you'd like to pack into the atlas.

-> m (Either (f b) (f c))

Either a mixture of successes and failures, or a successful pack.