Safe Haskell	Safe-Inferred
Language	Haskell2010

Network.DNS.Internal

Description

This module is not part of public API and may change even between patch versions.

Synopsis

data DomainLabel = DomainLabel {
- getDomainLabel_ :: !ShortByteString
- getDomainLabelCF_ :: !ShortByteString
}
newtype Domain = Domain [DomainLabel]
newtype DList a = DList ([a] -> [a])
toDList :: [a] -> DList a
fromDList :: DList a -> [a]
singleton :: a -> DList a

Documentation

data DomainLabel Source #

Domain label with case-insensitive Eq and Ord as per RFC4343.

Constructors

DomainLabel
Fields getDomainLabel_ :: !ShortByteString getDomainLabelCF_ :: !ShortByteString

Instances

Instances details

Eq DomainLabel Source #
Instance details Defined in Network.DNS.Internal Methods (==) :: DomainLabel -> DomainLabel -> Bool # (/=) :: DomainLabel -> DomainLabel -> Bool #
Ord DomainLabel Source #
Instance details Defined in Network.DNS.Internal Methods compare :: DomainLabel -> DomainLabel -> Ordering # (<) :: DomainLabel -> DomainLabel -> Bool # (<=) :: DomainLabel -> DomainLabel -> Bool # (>) :: DomainLabel -> DomainLabel -> Bool # (>=) :: DomainLabel -> DomainLabel -> Bool # max :: DomainLabel -> DomainLabel -> DomainLabel # min :: DomainLabel -> DomainLabel -> DomainLabel #

newtype Domain Source #

A domain parsed into labels. Each label is a ShortByteString rather than Text or String because a label can contain arbitrary bytes. However, the Ord and Eq instances do limited case-folding according to RFC4343.

Constructors

Domain [DomainLabel]

Instances

Instances details

Eq Domain Source #
Instance details Defined in Network.DNS.Internal Methods (==) :: Domain -> Domain -> Bool # (/=) :: Domain -> Domain -> Bool #
Ord Domain Source #
Instance details Defined in Network.DNS.Internal Methods compare :: Domain -> Domain -> Ordering # (<) :: Domain -> Domain -> Bool # (<=) :: Domain -> Domain -> Bool # (>) :: Domain -> Domain -> Bool # (>=) :: Domain -> Domain -> Bool # max :: Domain -> Domain -> Domain # min :: Domain -> Domain -> Domain #

newtype DList a Source #

Difference list à la Huhges

Constructors

DList ([a] -> [a])

Instances

Instances details

Monoid (DList a) Source #
Instance details Defined in Network.DNS.Internal Methods mempty :: DList a # mappend :: DList a -> DList a -> DList a # mconcat :: [DList a] -> DList a #
Semigroup (DList a) Source #
Instance details Defined in Network.DNS.Internal Methods (<>) :: DList a -> DList a -> DList a # sconcat :: NonEmpty (DList a) -> DList a # stimes :: Integral b => b -> DList a -> DList a #

toDList :: [a] -> DList a Source #

Turn a list into DList

fromDList :: DList a -> [a] Source #

Turn DList back into a list.

singleton :: a -> DList a Source #

Create a DList containing just the specified element