/usr/lib/hugs/packages/base/Data/Unique.hs is in libhugs-base-bundled 98.200609.21-5.3ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 | -----------------------------------------------------------------------------
-- |
-- Module : Data.Unique
-- Copyright : (c) The University of Glasgow 2001
-- License : BSD-style (see the file libraries/base/LICENSE)
--
-- Maintainer : libraries@haskell.org
-- Stability : experimental
-- Portability : non-portable
--
-- An abstract interface to a unique symbol generator.
--
-----------------------------------------------------------------------------
module Data.Unique (
-- * Unique objects
Unique, -- instance (Eq, Ord)
newUnique, -- :: IO Unique
hashUnique -- :: Unique -> Int
) where
import Prelude
import Control.Concurrent.MVar
import System.IO.Unsafe (unsafePerformIO)
-- | An abstract unique object. Objects of type 'Unique' may be
-- compared for equality and ordering and hashed into 'Int'.
newtype Unique = Unique Integer deriving (Eq,Ord)
uniqSource :: MVar Integer
uniqSource = unsafePerformIO (newMVar 0)
{-# NOINLINE uniqSource #-}
-- | Creates a new object of type 'Unique'. The value returned will
-- not compare equal to any other value of type 'Unique' returned by
-- previous calls to 'newUnique'. There is no limit on the number of
-- times 'newUnique' may be called.
newUnique :: IO Unique
newUnique = do
val <- takeMVar uniqSource
let next = val+1
putMVar uniqSource next
return (Unique next)
-- | Hashes a 'Unique' into an 'Int'. Two 'Unique's may hash to the
-- same value, although in practice this is unlikely. The 'Int'
-- returned makes a good hash key.
hashUnique :: Unique -> Int
hashUnique (Unique u) = fromInteger (u `mod` (toInteger (maxBound :: Int) + 1))
|