symbolize 1.0.0.1 → 1.0.0.2
raw patch · 2 files changed
+5/−13 lines, 2 filesPVP ok
version bump matches the API change (PVP)
API changes (from Hackage documentation)
Files
- CHANGELOG.md +4/−0
- symbolize.cabal +1/−13
CHANGELOG.md view
@@ -8,6 +8,10 @@ ## Unreleased +## 1.0.0.2++- Minor documentation improvements+ ## 1.0.0.1 - Minor documentation improvements
symbolize.cabal view
@@ -5,7 +5,7 @@ -- see: https://github.com/sol/hpack name: symbolize-version: 1.0.0.1+version: 1.0.0.2 synopsis: Efficient global Symbol table, with Garbage Collection. description: Symbols, also known as Atoms or Interned Strings, are a common technique to reduce memory usage and improve performance when using many small strings:@@ -29,18 +29,6 @@ which means that unused symbols will be garbage collected. As such, you do not need to be concerned about memory leaks (as is the case with many other symbol table implementations).- .- The main advantages of Symbolize over other symbol table implementations are:- .- - Garbage collection: Symbols which are no longer used are automatically cleaned up.- - Support for any `Textual` type, including `String`, (strict and lazy) `Data.Text`, (strict and lazy) `Data.ByteString`, `ShortText`, `ShortByteString`, etc.- - Great memory usage:- - `Symbol`s are simply a (lifted) wrapper around a `ByteArray#`, which is nicely unpacked by GHC.- - The symbol table is an `IntMap` that contains weak pointers to these same `ByteArray#`s and their associated `StableName#`s- - Great performance:- - `unintern` is a simple pointer-dereference- - calls to `lookup` are free of atomic memory barriers (and never have to wait on a concurrent thread running `intern`)- - Thread-safe . Please see the full README below or on GitHub at <https://github.com/Qqwy/haskell-symbolize#readme> category: Data, Data Structures