Safe Haskell | Safe-Inferred |
---|
- bytesPerWord :: Int
- bitsPerWord :: Int
- bytesToWords :: Int -> Int
- data Size = Size {}
- mksize :: Int -> Size
- dataSize :: Size -> Int
- singletonSize :: Size
- newtype SizeTable = ST (Map String Size)
- data SizeStatistics = SST {}
- class Monoid a => Scale a where
- class Typeable a => Sizeable a where
- nameof' :: Typeable a => a -> String
- insertSizeTable :: String -> Size -> SizeTable -> SizeTable
- setName :: String -> SizeStatistics -> SizeStatistics
- addSize :: Size -> SizeStatistics -> SizeStatistics
- addPart :: String -> Size -> SizeStatistics -> SizeStatistics
- mkstats :: Sizeable a => a -> String -> Int -> SizeStatistics
- showstats :: SizeStatistics -> String
- module Data.Monoid
Documentation
bytesToWords :: Int -> IntSource
Make a counter for one object with n fields
constructors count 1 word If # words for the data is 0, it's a singleton, so the # of objects are not accumulated
The size value of a singleton
Singletons are only counted once
data SizeStatistics Source
class Typeable a => Sizeable a whereSource
Sizeable Bool | |
Sizeable Char | |
Sizeable Double | |
Sizeable Int | |
Sizeable ByteString | |
Sizeable ByteString | |
Sizeable IntSet | |
Sizeable a => Sizeable [a] | |
Sizeable v => Sizeable (IntMap v) | |
(Sizeable t1, Sizeable t2) => Sizeable (t1, t2) | |
(Sizeable k, Sizeable v) => Sizeable (Map k v) | |
(Sizeable t1, Sizeable t2, Sizeable t3) => Sizeable (t1, t2, t3) | |
(Sizeable t1, Sizeable t2, Sizeable t3, Sizeable t4) => Sizeable (t1, t2, t3, t4) |
setName :: String -> SizeStatistics -> SizeStatisticsSource
addSize :: Size -> SizeStatistics -> SizeStatisticsSource
addPart :: String -> Size -> SizeStatistics -> SizeStatisticsSource
module Data.Monoid