ghc-datasize alternatives and similar packages
Based on the "ghc" category.
Alternatively, view ghc-datasize alternatives based on common mentions on social networks and blogs.
-
-
ghc-source-gen
Library for generating Haskell source files and code fragments. -
-
-
ghc-typelits-natnormalise
Normalise GHC.TypeLits.Nat equations -
ghc-typelits-extra
Extra type-level operations on GHC.TypeLits.Nat and a custom solver -
ghc-typelits-knownnat
Derive KnownNat constraints from other KnownNat constraints -
ghc-make
An alternative to ghc --make which supports parallel compilation of modules and runs faster when nothing needs compiling. -
ghc-tags-plugin
Generate tags file for haskell modules (GHC) -
ghc-core-html
Read ghc-core with style. javascript and CSS style. -
ghc-imported-from
For a given Haskell source file, determine where a symbol is imported from -
ghc-time-alloc-prof
Library for parsing GHC time and allocation profiling reports -
ghc-prof
Library for parsing GHC time and allocation profiling reports -
ghc-trace-events
ByteString/Text variants of Debug.Trace.traceEvent/traceMarker and binary event logging -
ghc-pkg-autofix
Simple utility to fix BROKEN package dependencies for cabal-install. -
ghc-srcspan-plugin
Generic GHC Plugin for annotating Haskell code with source location data.
Clean code begins in your IDE with SonarLint
Do you think we are missing an alternative of ghc-datasize or a related project?
|
Updating dependencies is time-consuming.
sponsored
blog.mergify.com
|
Popular Comparisons
-
ghc-datasizevsghc-parmake
-
ghc-datasizevsghc-pkg-autofix
-
ghc-datasizevsghc-syb-utils
-
ghc-modvscheckmate
-
ghc-typelits-knownnatvsghc-typelits-natnormalise
|
Collect and Analyze Billions of Data Points in Real Time
sponsored
www.influxdata.com
|
README
ghc-datasize
Ghc-datasize provides functions to determine the size of Haskell data structures in memory at run time. Determining the size of circular data structures is supported. All sizes are reported in bytes.
Determining the size of simple data structures is relatively quick, but large and complex data structures can be slow. For large and complex structures the user may want to find a way to calculate the size of a small subset of the data and estimate the size of the full data structure from that.