GHC.Data.Graph.Inductive.PatriciaTree

An efficient implementation of Data.Graph.Inductive.Graph.Graph using big-endian patricia tree (i.e. Data.IntMap).

This module provides the following specialised functions to gain more performance, using GHC's RULES pragma:

Code is from Hackage fgl package version 5.7.0.3

2 types

newtypenewtype Gr a b

Instances9Bifunctor, Graph, DynGraph, Functor, Eq, Read, …

Bifunctor GrDefined in ghc-9.14.1 · GHC.Data.Graph.Inductive.PatriciaTree
Graph GrDefined in ghc-9.14.1 · GHC.Data.Graph.Inductive.PatriciaTree
DynGraph GrDefined in ghc-9.14.1 · GHC.Data.Graph.Inductive.PatriciaTree
Functor (Gr a)Defined in ghc-9.14.1 · GHC.Data.Graph.Inductive.PatriciaTree
(Eq a, Ord b) => Eq (Gr a b)Defined in ghc-9.14.1 · GHC.Data.Graph.Inductive.PatriciaTree
(Read a, Read b) => Read (Gr a b)Defined in ghc-9.14.1 · GHC.Data.Graph.Inductive.PatriciaTree
(Show a, Show b) => Show (Gr a b)Defined in ghc-9.14.1 · GHC.Data.Graph.Inductive.PatriciaTree
Generic (Gr a b)Defined in ghc-9.14.1 · GHC.Data.Graph.Inductive.PatriciaTree
type Rep (Gr a b) = D1 ('MetaData "Gr" "GHC.Data.Graph.Inductive.PatriciaTree" "ghc-9.14.1-05a0" 'True) (C1 ('MetaCons "Gr" 'PrefixI 'False) (S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (GraphRep a b))))Defined in ghc-9.14.1 · GHC.Data.Graph.Inductive.PatriciaTree