Copyright	(c) 2019 Edward Kmett
License	BSD-2-Clause OR Apache-2.0
Maintainer	Edward Kmett <ekmett@gmail.com>
Stability	experimental
Portability	non-portable
Safe Haskell	None
Language	Haskell2010

Data.Atlas.Internal

Description

Details of the implementation.

The contents of this module do not fall under the PVP. Use at your own risk.

Synopsis

newtype Atlas s = Atlas (ForeignPtr AtlasContext)
data AtlasContext
type Coord = Word16
data Rect
data Node
heuristicId :: Heuristic -> CInt
data Heuristic
- = BottomLeft
- | BestFirst
sizeOfAtlas :: Int
sizeOfNode :: Int
sizeOfRect :: Int
data Pt = Pt Int Int
peekWH :: Ptr Rect -> IO Pt
peekXY :: Ptr Rect -> IO Pt
pokeWH :: Ptr Rect -> Pt -> IO ()
peekMaybeXY :: Ptr Rect -> IO (Maybe Pt)
atlasCtx :: Context
die :: (MonadIO m, HasCallStack) => String -> m a

Documentation

newtype Atlas s Source #

Constructors

Atlas (ForeignPtr AtlasContext)

Instances

Eq (Atlas s) Source #
Instance details Defined in Data.Atlas.Internal Methods (==) :: Atlas s -> Atlas s -> Bool # (/=) :: Atlas s -> Atlas s -> Bool #
Ord (Atlas s) Source #
Instance details 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) Source #
Instance details Defined in Data.Atlas.Internal Methods showsPrec :: Int -> Atlas s -> ShowS # show :: Atlas s -> String # showList :: [Atlas s] -> ShowS #

data AtlasContext Source #

type Coord = Word16 Source #

data Rect Source #

data Node Source #

heuristicId :: Heuristic -> CInt Source #

data Heuristic Source #

Constructors

BottomLeft	bottom-left sort-height
BestFirst	best first sort-height

Instances

Bounded Heuristic Source #
Instance details Defined in Data.Atlas.Internal Methods minBound :: Heuristic # maxBound :: Heuristic #
Enum Heuristic Source #
Instance details 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 Source #
Instance details Defined in Data.Atlas.Internal Methods (==) :: Heuristic -> Heuristic -> Bool # (/=) :: Heuristic -> Heuristic -> Bool #
Ord Heuristic Source #
Instance details 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 Source #
Instance details Defined in Data.Atlas.Internal Methods readsPrec :: Int -> ReadS Heuristic # readList :: ReadS [Heuristic] # readPrec :: ReadPrec Heuristic # readListPrec :: ReadPrec [Heuristic] #
Show Heuristic Source #
Instance details Defined in Data.Atlas.Internal Methods showsPrec :: Int -> Heuristic -> ShowS # show :: Heuristic -> String # showList :: [Heuristic] -> ShowS #
Ix Heuristic Source #
Instance details 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 Source #
Instance details Defined in Data.Atlas.Internal Methods lift :: Heuristic -> Q Exp #
Default Heuristic Source #
Instance details Defined in Data.Atlas.Internal Methods def :: Heuristic

sizeOfAtlas :: Int Source #

sizeOfNode :: Int Source #

sizeOfRect :: Int Source #

data Pt Source #

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

Constructors

Pt Int Int

Instances

Eq Pt Source #
Instance details Defined in Data.Atlas.Internal Methods (==) :: Pt -> Pt -> Bool # (/=) :: Pt -> Pt -> Bool #
Num Pt Source #
Instance details 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 Source #
Instance details 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 Source #
Instance details Defined in Data.Atlas.Internal Methods readsPrec :: Int -> ReadS Pt # readList :: ReadS [Pt] # readPrec :: ReadPrec Pt # readListPrec :: ReadPrec [Pt] #
Show Pt Source #
Instance details Defined in Data.Atlas.Internal Methods showsPrec :: Int -> Pt -> ShowS # show :: Pt -> String # showList :: [Pt] -> ShowS #
Lift Pt Source #
Instance details Defined in Data.Atlas.Internal Methods lift :: Pt -> Q Exp #

peekWH :: Ptr Rect -> IO Pt Source #

peekXY :: Ptr Rect -> IO Pt Source #

pokeWH :: Ptr Rect -> Pt -> IO () Source #

peekMaybeXY :: Ptr Rect -> IO (Maybe Pt) Source #

atlasCtx :: Context Source #

die :: (MonadIO m, HasCallStack) => String -> m a Source #