relude-1.2.0.0: Safe, performant, user-friendly and lightweight Haskell Standard Library

Index - D

D#Relude.Numeric, Relude
decimalData.Text.Read
decodeFloatRelude.Numeric, Relude
decodeUtf8Relude.String.Conversion, Relude.String, Relude
decodeUtf8'Relude.String.Reexport, Relude.String, Relude
decodeUtf8StrictRelude.String.Conversion, Relude.String, Relude
decodeUtf8WithRelude.String.Reexport, Relude.String, Relude
deepseqRelude.DeepSeq, Relude
defaultComparisonRelude.Functor.Reexport, Relude.Functor, Relude
defaultEquivalenceRelude.Functor.Reexport, Relude.Functor, Relude
delete 
1 (Function)Data.IntMap.Lazy, Data.IntMap.Strict
2 (Function)Data.IntSet
3 (Function)Data.Map.Lazy, Data.Map.Strict
4 (Function)Data.Set
5 (Function)Data.HashSet
6 (Function)Data.HashMap.Lazy, Data.HashMap.Strict
7 (Function)Relude.Extra.Map, Relude.Extra
deleteAt 
1 (Function)Data.Map.Lazy, Data.Map.Strict
2 (Function)Data.Sequence
3 (Function)Data.Set
deleteFindMax 
1 (Function)Data.IntMap.Lazy, Data.IntMap.Strict
2 (Function)Data.IntSet
3 (Function)Data.Map.Lazy, Data.Map.Strict
4 (Function)Data.Set
deleteFindMin 
1 (Function)Data.IntMap.Lazy, Data.IntMap.Strict
2 (Function)Data.IntSet
3 (Function)Data.Map.Lazy, Data.Map.Strict
4 (Function)Data.Set
deleteMax 
1 (Function)Data.IntMap.Lazy, Data.IntMap.Strict
2 (Function)Data.IntSet
3 (Function)Data.Map.Lazy, Data.Map.Strict
4 (Function)Data.Set
deleteMin 
1 (Function)Data.IntMap.Lazy, Data.IntMap.Strict
2 (Function)Data.IntSet
3 (Function)Data.Map.Lazy, Data.Map.Strict
4 (Function)Data.Set
denominatorRelude.Numeric, Relude
dieRelude.Lifted.Exit, Relude.Lifted, Relude
difference 
1 (Function)Data.IntMap.Lazy, Data.IntMap.Strict
2 (Function)Data.IntSet
3 (Function)Data.Map.Lazy, Data.Map.Strict
4 (Function)Data.Set
5 (Function)Data.HashSet
6 (Function)Data.HashMap.Lazy, Data.HashMap.Strict
differenceWith 
1 (Function)Data.IntMap.Strict
2 (Function)Data.Map.Strict
3 (Function)Data.IntMap.Lazy
4 (Function)Data.Map.Lazy
5 (Function)Data.HashMap.Strict
6 (Function)Data.HashMap.Lazy
differenceWithKey 
1 (Function)Data.IntMap.Strict
2 (Function)Data.Map.Strict
3 (Function)Data.IntMap.Lazy
4 (Function)Data.Map.Lazy
disjoint 
1 (Function)Data.IntMap.Lazy, Data.IntMap.Strict
2 (Function)Data.IntSet
3 (Function)Data.Map.Lazy, Data.Map.Strict
4 (Function)Data.Set
disjointUnionData.Set
displayExceptionRelude.Exception, Relude
divRelude.Numeric, Relude
divModRelude.Numeric, Relude
DoubleRelude.Numeric, Relude
doubleData.Text.Read
doubleBEData.ByteString.Builder
doubleDecData.ByteString.Builder
doubleHexFixedData.ByteString.Builder
doubleLEData.ByteString.Builder
Down 
1 (Data Constructor)Relude.Base, Relude
2 (Type/Class)Relude.Base, Relude
drawForestData.Tree
drawTreeData.Tree
drop 
1 (Function)Relude.List.Reexport, Relude.List, Relude
2 (Function)Data.ByteString.Lazy
3 (Function)Data.ByteString
4 (Function)Data.ByteString.Short
5 (Function)Data.Map.Lazy, Data.Map.Strict
6 (Function)Data.Sequence
7 (Function)Data.Set
8 (Function)Data.Text.Lazy
9 (Function)Data.Text
dropAround 
1 (Function)Data.Text.Lazy
2 (Function)Data.Text
dropEnd 
1 (Function)Data.ByteString.Lazy
2 (Function)Data.ByteString
3 (Function)Data.ByteString.Short
4 (Function)Data.Text.Lazy
5 (Function)Data.Text
dropWhile 
1 (Function)Relude.List.Reexport, Relude.List, Relude
2 (Function)Data.ByteString.Lazy
3 (Function)Data.ByteString
4 (Function)Data.ByteString.Short
5 (Function)Data.Text.Lazy
6 (Function)Data.Text
dropWhileAntitone 
1 (Function)Data.Map.Lazy, Data.Map.Strict
2 (Function)Data.Set
dropWhileEnd 
1 (Function)Data.ByteString.Lazy
2 (Function)Data.ByteString
3 (Function)Data.ByteString.Short
4 (Function)Data.Text.Lazy
5 (Function)Data.Text
dropWhileLData.Sequence
dropWhileRData.Sequence
Dual 
1 (Data Constructor)Relude.Monoid, Relude
2 (Type/Class)Relude.Monoid, Relude
dupRelude.Extra.Tuple, Relude.Extra
DynamicMapRelude.Extra.Map, Relude.Extra