Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
This module is not part of public API and may change even between patch versions.
Synopsis
- data DomainLabel = DomainLabel {}
- newtype Domain = Domain [DomainLabel]
- newtype DList a = DList ([a] -> [a])
- toDList :: [a] -> DList a
- fromDList :: DList a -> [a]
- singleton :: a -> DList a
- sbsMap :: (Word8 -> Word8) -> ShortByteString -> ShortByteString
- sbsSingleton :: Word8 -> ShortByteString
Documentation
data DomainLabel Source #
Instances
Eq DomainLabel Source # | |
Defined in Network.DNS.Internal (==) :: DomainLabel -> DomainLabel -> Bool # (/=) :: DomainLabel -> DomainLabel -> Bool # | |
Ord DomainLabel Source # | |
Defined in Network.DNS.Internal compare :: DomainLabel -> DomainLabel -> Ordering # (<) :: DomainLabel -> DomainLabel -> Bool # (<=) :: DomainLabel -> DomainLabel -> Bool # (>) :: DomainLabel -> DomainLabel -> Bool # (>=) :: DomainLabel -> DomainLabel -> Bool # max :: DomainLabel -> DomainLabel -> DomainLabel # min :: DomainLabel -> DomainLabel -> DomainLabel # |
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.
Difference list à la Huhges
DList ([a] -> [a]) |
sbsMap :: (Word8 -> Word8) -> ShortByteString -> ShortByteString Source #
sbsSingleton :: Word8 -> ShortByteString Source #