perfect-hash-generator 0.2.0.2 → 0.2.0.3

raw patch · 3 files changed

+4/−4 lines, 3 files

Files

demo/Ints/Main.hs +1/−1
demo/Strings/Main.hs +1/−1
perfect-hash-generator.cabal +2/−2

demo/Ints/Main.hs view

@@ -1,4 +1,4 @@-module Main where+module Ints.Main where  import           System.Random                 (RandomGen, mkStdGen, random)

demo/Strings/Main.hs view

@@ -1,4 +1,4 @@-module Main where+module Strings.Main where  import           Control.Monad                 (when)

perfect-hash-generator.cabal view

@@ -2,10 +2,10 @@ -- -- see: https://github.com/sol/hpack ----- hash: defbbf1d1718cc4bcb4ed6c112f56dfcdb9f82a67a2dcc70b6e55f67a3015865+-- hash: 1698f1d36979cbf05571994d0eceb9f922608eac19a6c04d98a86117dc5f37cf  name:           perfect-hash-generator-version:        0.2.0.2+version:        0.2.0.3 synopsis:       Perfect minimal hashing implementation in native Haskell description:     A <https://en.wikipedia.org/wiki/Perfect_hash_function perfect hash function> for a set @S@ is a hash function that maps distinct elements in @S@ to a set of integers, with __no collisions__. A <https://en.wikipedia.org/wiki/Perfect_hash_function#Minimal_perfect_hash_function minimal perfect hash function> is a perfect hash function that maps @n@ keys to @n@ __consecutive__ integers, e.g. the numbers from @0@ to @n-1@.                 .