unordered-containers-0.2.20: Efficient hashing-based container types
Safe HaskellSafe-Inferred
LanguageHaskell2010

Data.HashMap.Internal.Debug

Description

WARNING

This module is considered internal.

The Package Versioning Policy does not apply.

The contents of this module may change in any way whatsoever and without any warning between minor versions of this package.

Authors importing this module are expected to track development closely.

Description

Debugging utilities for HashMaps.

Synopsis

Documentation

data Validity k Source #

Constructors

Invalid (Error k) SubHashPath 
Valid 

Instances

Instances details
Monoid (Validity k) Source # 
Instance details

Defined in Data.HashMap.Internal.Debug

Semigroup (Validity k) Source # 
Instance details

Defined in Data.HashMap.Internal.Debug

Show k => Show (Validity k) Source # 
Instance details

Defined in Data.HashMap.Internal.Debug

Eq k => Eq (Validity k) Source # 
Instance details

Defined in Data.HashMap.Internal.Debug

Methods

(==) :: Validity k -> Validity k -> Bool Source #

(/=) :: Validity k -> Validity k -> Bool Source #

data Error k Source #

An error corresponding to a broken invariant.

See HashMap for the documentation of the invariants.

Instances

Instances details
Show k => Show (Error k) Source # 
Instance details

Defined in Data.HashMap.Internal.Debug

Eq k => Eq (Error k) Source # 
Instance details

Defined in Data.HashMap.Internal.Debug

Methods

(==) :: Error k -> Error k -> Bool Source #

(/=) :: Error k -> Error k -> Bool Source #

type SubHash = Word Source #

A part of a Hash with bitsPerSubkey bits.