Safe Haskell	Safe-Inferred
Language	Haskell2010

Distribution.Fields.Field

Contents

Cabal file
Name
Conversions to String

Description

Cabal-like file AST types: Field, Section etc

These types are parametrized by an annotation.

Synopsis

data Field ann
- = Field !(Name ann) [FieldLine ann]
- | Section !(Name ann) [SectionArg ann] [Field ann]
fieldName :: Field ann -> Name ann
fieldAnn :: Field ann -> ann
fieldUniverse :: Field ann -> [Field ann]
data FieldLine ann = FieldLine !ann !ByteString
fieldLineAnn :: FieldLine ann -> ann
fieldLineBS :: FieldLine ann -> ByteString
data SectionArg ann
- = SecArgName !ann !ByteString
- | SecArgStr !ann !ByteString
- | SecArgOther !ann !ByteString
sectionArgAnn :: SectionArg ann -> ann
type FieldName = ByteString
data Name ann = Name !ann !FieldName
mkName :: ann -> FieldName -> Name ann
getName :: Name ann -> FieldName
nameAnn :: Name ann -> ann
sectionArgsToString :: [SectionArg ann] -> String
fieldLinesToString :: [FieldLine ann] -> String

Cabal file

data Field ann Source #

A Cabal-like file consists of a series of fields (foo: bar) and sections (library ...).

Constructors

Field !(Name ann) [FieldLine ann]
Section !(Name ann) [SectionArg ann] [Field ann]

Instances

Instances details

Foldable Field Source #
Instance details Defined in Distribution.Fields.Field Methods fold :: Monoid m => Field m -> m # foldMap :: Monoid m => (a -> m) -> Field a -> m # foldMap' :: Monoid m => (a -> m) -> Field a -> m # foldr :: (a -> b -> b) -> b -> Field a -> b # foldr' :: (a -> b -> b) -> b -> Field a -> b # foldl :: (b -> a -> b) -> b -> Field a -> b # foldl' :: (b -> a -> b) -> b -> Field a -> b # foldr1 :: (a -> a -> a) -> Field a -> a # foldl1 :: (a -> a -> a) -> Field a -> a # toList :: Field a -> [a] # null :: Field a -> Bool # length :: Field a -> Int # elem :: Eq a => a -> Field a -> Bool # maximum :: Ord a => Field a -> a # minimum :: Ord a => Field a -> a # sum :: Num a => Field a -> a # product :: Num a => Field a -> a #
Foldable1 Field Source #	Since: 3.12.0.0
Instance details Defined in Distribution.Fields.Field Methods fold1 :: Semigroup m => Field m -> m # foldMap1 :: Semigroup m => (a -> m) -> Field a -> m # foldMap1' :: Semigroup m => (a -> m) -> Field a -> m # toNonEmpty :: Field a -> NonEmpty a # maximum :: Ord a => Field a -> a # minimum :: Ord a => Field a -> a # head :: Field a -> a # last :: Field a -> a # foldrMap1 :: (a -> b) -> (a -> b -> b) -> Field a -> b # foldlMap1' :: (a -> b) -> (b -> a -> b) -> Field a -> b # foldlMap1 :: (a -> b) -> (b -> a -> b) -> Field a -> b # foldrMap1' :: (a -> b) -> (a -> b -> b) -> Field a -> b #
Traversable Field Source #
Instance details Defined in Distribution.Fields.Field Methods traverse :: Applicative f => (a -> f b) -> Field a -> f (Field b) # sequenceA :: Applicative f => Field (f a) -> f (Field a) # mapM :: Monad m => (a -> m b) -> Field a -> m (Field b) # sequence :: Monad m => Field (m a) -> m (Field a) #
Functor Field Source #
Instance details Defined in Distribution.Fields.Field Methods fmap :: (a -> b) -> Field a -> Field b # (<$) :: a -> Field b -> Field a #
Show ann => Show (Field ann) Source #
Instance details Defined in Distribution.Fields.Field Methods showsPrec :: Int -> Field ann -> ShowS # show :: Field ann -> String # showList :: [Field ann] -> ShowS #
Eq ann => Eq (Field ann) Source #
Instance details Defined in Distribution.Fields.Field Methods (==) :: Field ann -> Field ann -> Bool # (/=) :: Field ann -> Field ann -> Bool #
Ord ann => Ord (Field ann) Source #	Since: 3.12.0.0
Instance details Defined in Distribution.Fields.Field Methods compare :: Field ann -> Field ann -> Ordering # (<) :: Field ann -> Field ann -> Bool # (<=) :: Field ann -> Field ann -> Bool # (>) :: Field ann -> Field ann -> Bool # (>=) :: Field ann -> Field ann -> Bool # max :: Field ann -> Field ann -> Field ann # min :: Field ann -> Field ann -> Field ann #

fieldName :: Field ann -> Name ann Source #

Section of field name

fieldAnn :: Field ann -> ann Source #

fieldUniverse :: Field ann -> [Field ann] Source #

All transitive descendants of Field, including itself.

Note: the resulting list is never empty.

data FieldLine ann Source #

A line of text representing the value of a field from a Cabal file. A field may contain multiple lines.

Invariant: ByteString has no newlines.

Constructors

FieldLine !ann !ByteString

Instances

Instances details

Foldable FieldLine Source #
Instance details Defined in Distribution.Fields.Field Methods fold :: Monoid m => FieldLine m -> m # foldMap :: Monoid m => (a -> m) -> FieldLine a -> m # foldMap' :: Monoid m => (a -> m) -> FieldLine a -> m # foldr :: (a -> b -> b) -> b -> FieldLine a -> b # foldr' :: (a -> b -> b) -> b -> FieldLine a -> b # foldl :: (b -> a -> b) -> b -> FieldLine a -> b # foldl' :: (b -> a -> b) -> b -> FieldLine a -> b # foldr1 :: (a -> a -> a) -> FieldLine a -> a # foldl1 :: (a -> a -> a) -> FieldLine a -> a # toList :: FieldLine a -> [a] # null :: FieldLine a -> Bool # length :: FieldLine a -> Int # elem :: Eq a => a -> FieldLine a -> Bool # maximum :: Ord a => FieldLine a -> a # minimum :: Ord a => FieldLine a -> a # sum :: Num a => FieldLine a -> a # product :: Num a => FieldLine a -> a #
Foldable1 FieldLine Source #	Since: 3.12.0.0
Instance details Defined in Distribution.Fields.Field Methods fold1 :: Semigroup m => FieldLine m -> m # foldMap1 :: Semigroup m => (a -> m) -> FieldLine a -> m # foldMap1' :: Semigroup m => (a -> m) -> FieldLine a -> m # toNonEmpty :: FieldLine a -> NonEmpty a # maximum :: Ord a => FieldLine a -> a # minimum :: Ord a => FieldLine a -> a # head :: FieldLine a -> a # last :: FieldLine a -> a # foldrMap1 :: (a -> b) -> (a -> b -> b) -> FieldLine a -> b # foldlMap1' :: (a -> b) -> (b -> a -> b) -> FieldLine a -> b # foldlMap1 :: (a -> b) -> (b -> a -> b) -> FieldLine a -> b # foldrMap1' :: (a -> b) -> (a -> b -> b) -> FieldLine a -> b #
Traversable FieldLine Source #
Instance details Defined in Distribution.Fields.Field Methods traverse :: Applicative f => (a -> f b) -> FieldLine a -> f (FieldLine b) # sequenceA :: Applicative f => FieldLine (f a) -> f (FieldLine a) # mapM :: Monad m => (a -> m b) -> FieldLine a -> m (FieldLine b) # sequence :: Monad m => FieldLine (m a) -> m (FieldLine a) #
Functor FieldLine Source #
Instance details Defined in Distribution.Fields.Field Methods fmap :: (a -> b) -> FieldLine a -> FieldLine b # (<$) :: a -> FieldLine b -> FieldLine a #
Show ann => Show (FieldLine ann) Source #
Instance details Defined in Distribution.Fields.Field Methods showsPrec :: Int -> FieldLine ann -> ShowS # show :: FieldLine ann -> String # showList :: [FieldLine ann] -> ShowS #
Eq ann => Eq (FieldLine ann) Source #
Instance details Defined in Distribution.Fields.Field Methods (==) :: FieldLine ann -> FieldLine ann -> Bool # (/=) :: FieldLine ann -> FieldLine ann -> Bool #
Ord ann => Ord (FieldLine ann) Source #	Since: 3.12.0.0
Instance details Defined in Distribution.Fields.Field Methods compare :: FieldLine ann -> FieldLine ann -> Ordering # (<) :: FieldLine ann -> FieldLine ann -> Bool # (<=) :: FieldLine ann -> FieldLine ann -> Bool # (>) :: FieldLine ann -> FieldLine ann -> Bool # (>=) :: FieldLine ann -> FieldLine ann -> Bool # max :: FieldLine ann -> FieldLine ann -> FieldLine ann # min :: FieldLine ann -> FieldLine ann -> FieldLine ann #

fieldLineAnn :: FieldLine ann -> ann Source #

Since: 3.0.0.0

fieldLineBS :: FieldLine ann -> ByteString Source #

Since: 3.0.0.0

data SectionArg ann Source #

Section arguments, e.g. name of the library

Constructors

SecArgName !ann !ByteString	identifier, or something which looks like number. Also many dot numbers, i.e. "7.6.3"
SecArgStr !ann !ByteString	quoted string
SecArgOther !ann !ByteString	everything else, mm. operators (e.g. in if-section conditionals)

Instances

Instances details

Foldable SectionArg Source #
Instance details Defined in Distribution.Fields.Field Methods fold :: Monoid m => SectionArg m -> m # foldMap :: Monoid m => (a -> m) -> SectionArg a -> m # foldMap' :: Monoid m => (a -> m) -> SectionArg a -> m # foldr :: (a -> b -> b) -> b -> SectionArg a -> b # foldr' :: (a -> b -> b) -> b -> SectionArg a -> b # foldl :: (b -> a -> b) -> b -> SectionArg a -> b # foldl' :: (b -> a -> b) -> b -> SectionArg a -> b # foldr1 :: (a -> a -> a) -> SectionArg a -> a # foldl1 :: (a -> a -> a) -> SectionArg a -> a # toList :: SectionArg a -> [a] # null :: SectionArg a -> Bool # length :: SectionArg a -> Int # elem :: Eq a => a -> SectionArg a -> Bool # maximum :: Ord a => SectionArg a -> a # minimum :: Ord a => SectionArg a -> a # sum :: Num a => SectionArg a -> a # product :: Num a => SectionArg a -> a #
Foldable1 SectionArg Source #	Since: 3.12.0.0
Instance details Defined in Distribution.Fields.Field Methods fold1 :: Semigroup m => SectionArg m -> m # foldMap1 :: Semigroup m => (a -> m) -> SectionArg a -> m # foldMap1' :: Semigroup m => (a -> m) -> SectionArg a -> m # toNonEmpty :: SectionArg a -> NonEmpty a # maximum :: Ord a => SectionArg a -> a # minimum :: Ord a => SectionArg a -> a # head :: SectionArg a -> a # last :: SectionArg a -> a # foldrMap1 :: (a -> b) -> (a -> b -> b) -> SectionArg a -> b # foldlMap1' :: (a -> b) -> (b -> a -> b) -> SectionArg a -> b # foldlMap1 :: (a -> b) -> (b -> a -> b) -> SectionArg a -> b # foldrMap1' :: (a -> b) -> (a -> b -> b) -> SectionArg a -> b #
Traversable SectionArg Source #
Instance details Defined in Distribution.Fields.Field Methods traverse :: Applicative f => (a -> f b) -> SectionArg a -> f (SectionArg b) # sequenceA :: Applicative f => SectionArg (f a) -> f (SectionArg a) # mapM :: Monad m => (a -> m b) -> SectionArg a -> m (SectionArg b) # sequence :: Monad m => SectionArg (m a) -> m (SectionArg a) #
Functor SectionArg Source #
Instance details Defined in Distribution.Fields.Field Methods fmap :: (a -> b) -> SectionArg a -> SectionArg b # (<$) :: a -> SectionArg b -> SectionArg a #
Show ann => Show (SectionArg ann) Source #
Instance details Defined in Distribution.Fields.Field Methods showsPrec :: Int -> SectionArg ann -> ShowS # show :: SectionArg ann -> String # showList :: [SectionArg ann] -> ShowS #
Eq ann => Eq (SectionArg ann) Source #
Instance details Defined in Distribution.Fields.Field Methods (==) :: SectionArg ann -> SectionArg ann -> Bool # (/=) :: SectionArg ann -> SectionArg ann -> Bool #
Ord ann => Ord (SectionArg ann) Source #	Since: 3.12.0.0
Instance details Defined in Distribution.Fields.Field Methods compare :: SectionArg ann -> SectionArg ann -> Ordering # (<) :: SectionArg ann -> SectionArg ann -> Bool # (<=) :: SectionArg ann -> SectionArg ann -> Bool # (>) :: SectionArg ann -> SectionArg ann -> Bool # (>=) :: SectionArg ann -> SectionArg ann -> Bool # max :: SectionArg ann -> SectionArg ann -> SectionArg ann # min :: SectionArg ann -> SectionArg ann -> SectionArg ann #

sectionArgAnn :: SectionArg ann -> ann Source #

Extract annotation from SectionArg.

Name

type FieldName = ByteString Source #

data Name ann Source #

A field name.

Invariant: ByteString is lower-case ASCII.

Constructors

Name !ann !FieldName

Instances

Instances details

Foldable Name Source #
Instance details Defined in Distribution.Fields.Field Methods fold :: Monoid m => Name m -> m # foldMap :: Monoid m => (a -> m) -> Name a -> m # foldMap' :: Monoid m => (a -> m) -> Name a -> m # foldr :: (a -> b -> b) -> b -> Name a -> b # foldr' :: (a -> b -> b) -> b -> Name a -> b # foldl :: (b -> a -> b) -> b -> Name a -> b # foldl' :: (b -> a -> b) -> b -> Name a -> b # foldr1 :: (a -> a -> a) -> Name a -> a # foldl1 :: (a -> a -> a) -> Name a -> a # toList :: Name a -> [a] # null :: Name a -> Bool # length :: Name a -> Int # elem :: Eq a => a -> Name a -> Bool # maximum :: Ord a => Name a -> a # minimum :: Ord a => Name a -> a # sum :: Num a => Name a -> a # product :: Num a => Name a -> a #
Foldable1 Name Source #	Since: 3.12.0.0
Instance details Defined in Distribution.Fields.Field Methods fold1 :: Semigroup m => Name m -> m # foldMap1 :: Semigroup m => (a -> m) -> Name a -> m # foldMap1' :: Semigroup m => (a -> m) -> Name a -> m # toNonEmpty :: Name a -> NonEmpty a # maximum :: Ord a => Name a -> a # minimum :: Ord a => Name a -> a # head :: Name a -> a # last :: Name a -> a # foldrMap1 :: (a -> b) -> (a -> b -> b) -> Name a -> b # foldlMap1' :: (a -> b) -> (b -> a -> b) -> Name a -> b # foldlMap1 :: (a -> b) -> (b -> a -> b) -> Name a -> b # foldrMap1' :: (a -> b) -> (a -> b -> b) -> Name a -> b #
Traversable Name Source #
Instance details Defined in Distribution.Fields.Field Methods traverse :: Applicative f => (a -> f b) -> Name a -> f (Name b) # sequenceA :: Applicative f => Name (f a) -> f (Name a) # mapM :: Monad m => (a -> m b) -> Name a -> m (Name b) # sequence :: Monad m => Name (m a) -> m (Name a) #
Functor Name Source #
Instance details Defined in Distribution.Fields.Field Methods fmap :: (a -> b) -> Name a -> Name b # (<$) :: a -> Name b -> Name a #
Show ann => Show (Name ann) Source #
Instance details Defined in Distribution.Fields.Field Methods showsPrec :: Int -> Name ann -> ShowS # show :: Name ann -> String # showList :: [Name ann] -> ShowS #
Eq ann => Eq (Name ann) Source #
Instance details Defined in Distribution.Fields.Field Methods (==) :: Name ann -> Name ann -> Bool # (/=) :: Name ann -> Name ann -> Bool #
Ord ann => Ord (Name ann) Source #	Since: 3.12.0.0
Instance details Defined in Distribution.Fields.Field Methods compare :: Name ann -> Name ann -> Ordering # (<) :: Name ann -> Name ann -> Bool # (<=) :: Name ann -> Name ann -> Bool # (>) :: Name ann -> Name ann -> Bool # (>=) :: Name ann -> Name ann -> Bool # max :: Name ann -> Name ann -> Name ann # min :: Name ann -> Name ann -> Name ann #

mkName :: ann -> FieldName -> Name ann Source #

getName :: Name ann -> FieldName Source #

nameAnn :: Name ann -> ann Source #

Conversions to String

sectionArgsToString :: [SectionArg ann] -> String Source #

Since: 3.6.0.0

fieldLinesToString :: [FieldLine ann] -> String Source #

Convert [FieldLine] into String.

Note: this doesn't preserve indentation or empty lines, as the annotations (e.g. positions) are ignored.

Since: 3.6.0.0