Agda.Syntax.Position

Position information for syntax. Crucial for giving good error messages.

Positions

type Position = Position' SrcFile

type PositionWithoutFile = Position' ()

data Position' a

Represents a point in the input.

If two positions have the same srcFile and posPos components, then the final two components should be the same as well, but since this can be hard to enforce the program should not rely too much on the last two components; they are mainly there to improve error messages for the user.

Note the invariant which positions have to satisfy: positionInvariant.

Constructors

Pn

Fields

• srcFile :: !a

  File.

• posPos :: !Int32

  Position, counting from 1.

• posLine :: !Int32

  Line number, counting from 1.

• posCol :: !Int32

  Column number, counting from 1.

Instances

Functor Position'

Methods

fmap :: (a -> b) -> Position' a -> Position' b

(<$) :: a -> Position' b -> Position' a

Show PositionWithoutFile

Methods

showsPrec :: Int -> PositionWithoutFile -> ShowS

show :: PositionWithoutFile -> String

showList :: [PositionWithoutFile] -> ShowS

Foldable Position'

Methods

fold :: Monoid m => Position' m -> m

foldMap :: Monoid m => (a -> m) -> Position' a -> m

foldr :: (a -> b -> b) -> b -> Position' a -> b

foldr' :: (a -> b -> b) -> b -> Position' a -> b

foldl :: (b -> a -> b) -> b -> Position' a -> b

foldl' :: (b -> a -> b) -> b -> Position' a -> b

foldr1 :: (a -> a -> a) -> Position' a -> a

foldl1 :: (a -> a -> a) -> Position' a -> a

toList :: Position' a -> [a]

null :: Position' a -> Bool

length :: Position' a -> Int

elem :: Eq a => a -> Position' a -> Bool

maximum :: Ord a => Position' a -> a

minimum :: Ord a => Position' a -> a

sum :: Num a => Position' a -> a

product :: Num a => Position' a -> a

Traversable Position'

Methods

traverse :: Applicative f => (a -> f b) -> Position' a -> f (Position' b)

sequenceA :: Applicative f => Position' (f a) -> f (Position' a)

mapM :: Monad m => (a -> m b) -> Position' a -> m (Position' b)

sequence :: Monad m => Position' (m a) -> m (Position' a)

Pretty PositionWithoutFile

Methods

pretty :: PositionWithoutFile -> Doc

prettyPrec :: Int -> PositionWithoutFile -> Doc

prettyList :: [PositionWithoutFile] -> Doc

Eq a => Eq (Position' a)

Methods

(==) :: Position' a -> Position' a -> Bool

(/=) :: Position' a -> Position' a -> Bool

Data a => Data (Position' a)

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Position' a -> c (Position' a)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Position' a)

toConstr :: Position' a -> Constr

dataTypeOf :: Position' a -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (Position' a))

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Position' a))

gmapT :: (forall b. Data b => b -> b) -> Position' a -> Position' a

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Position' a -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Position' a -> r

gmapQ :: (forall d. Data d => d -> u) -> Position' a -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Position' a -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Position' a -> m (Position' a)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Position' a -> m (Position' a)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Position' a -> m (Position' a)

Ord a => Ord (Position' a)

Methods

compare :: Position' a -> Position' a -> Ordering

(<) :: Position' a -> Position' a -> Bool

(<=) :: Position' a -> Position' a -> Bool

(>) :: Position' a -> Position' a -> Bool

(>=) :: Position' a -> Position' a -> Bool

max :: Position' a -> Position' a -> Position' a

min :: Position' a -> Position' a -> Position' a

Show a => Show (Position' (Maybe a))

Methods

showsPrec :: Int -> Position' (Maybe a) -> ShowS

show :: Position' (Maybe a) -> String

showList :: [Position' (Maybe a)] -> ShowS

Generic (Position' a)

Associated Types

type Rep (Position' a) :: * -> *

Methods

from :: Position' a -> Rep (Position' a) x

to :: Rep (Position' a) x -> Position' a

Pretty a => Pretty (Position' (Maybe a))

Methods

pretty :: Position' (Maybe a) -> Doc

prettyPrec :: Int -> Position' (Maybe a) -> Doc

prettyList :: [Position' (Maybe a)] -> Doc

type Rep (Position' a)

type Rep (Position' a) = D1 * (MetaData "Position'" "Agda.Syntax.Position" "Agda-2.5.2.20170816-GHenzADqKzt4ualJbaFRMq" False) (C1 * (MetaCons "Pn" PrefixI True) ((:*:) * ((:*:) * (S1 * (MetaSel (Just Symbol "srcFile") NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 * a)) (S1 * (MetaSel (Just Symbol "posPos") NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 * Int32))) ((:*:) * (S1 * (MetaSel (Just Symbol "posLine") NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 * Int32)) (S1 * (MetaSel (Just Symbol "posCol") NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 * Int32)))))

type SrcFile = Maybe AbsolutePath

positionInvariant :: Position' a -> Bool

startPos :: Maybe AbsolutePath -> Position

The first position in a file: position 1, line 1, column 1.

movePos :: Position' a -> Char -> Position' a

Advance the position by one character. A newline character ('\n') moves the position to the first character in the next line. Any other character moves the position to the next column.

movePosByString :: Position' a -> String -> Position' a

Advance the position by a string.

movePosByString = foldl' movePos

backupPos :: Position' a -> Position' a

Backup the position by one character.

Precondition: The character must not be '\n'.

startPos' :: a -> Position' a

The first position in a file: position 1, line 1, column 1.

Intervals

type Interval = Interval' SrcFile

type IntervalWithoutFile = Interval' ()

data Interval' a

An interval. The iEnd position is not included in the interval.

Note the invariant which intervals have to satisfy: intervalInvariant.

Constructors

Interval

Fields

• iStart, iEnd :: !(Position' a)

Instances

Functor Interval'

Methods

fmap :: (a -> b) -> Interval' a -> Interval' b

(<$) :: a -> Interval' b -> Interval' a

Show IntervalWithoutFile

Methods

showsPrec :: Int -> IntervalWithoutFile -> ShowS

show :: IntervalWithoutFile -> String

showList :: [IntervalWithoutFile] -> ShowS

Foldable Interval'

Methods

fold :: Monoid m => Interval' m -> m

foldMap :: Monoid m => (a -> m) -> Interval' a -> m

foldr :: (a -> b -> b) -> b -> Interval' a -> b

foldr' :: (a -> b -> b) -> b -> Interval' a -> b

foldl :: (b -> a -> b) -> b -> Interval' a -> b

foldl' :: (b -> a -> b) -> b -> Interval' a -> b

foldr1 :: (a -> a -> a) -> Interval' a -> a

foldl1 :: (a -> a -> a) -> Interval' a -> a

toList :: Interval' a -> [a]

null :: Interval' a -> Bool

length :: Interval' a -> Int

elem :: Eq a => a -> Interval' a -> Bool

maximum :: Ord a => Interval' a -> a

minimum :: Ord a => Interval' a -> a

sum :: Num a => Interval' a -> a

product :: Num a => Interval' a -> a

Traversable Interval'

Methods

traverse :: Applicative f => (a -> f b) -> Interval' a -> f (Interval' b)

sequenceA :: Applicative f => Interval' (f a) -> f (Interval' a)

mapM :: Monad m => (a -> m b) -> Interval' a -> m (Interval' b)

sequence :: Monad m => Interval' (m a) -> m (Interval' a)

Pretty IntervalWithoutFile

Methods

pretty :: IntervalWithoutFile -> Doc

prettyPrec :: Int -> IntervalWithoutFile -> Doc

prettyList :: [IntervalWithoutFile] -> Doc

HasRange Interval

Methods

getRange :: Interval -> Range

Eq a => Eq (Interval' a)

Methods

(==) :: Interval' a -> Interval' a -> Bool

(/=) :: Interval' a -> Interval' a -> Bool

Data a => Data (Interval' a)

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Interval' a -> c (Interval' a)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Interval' a)

toConstr :: Interval' a -> Constr

dataTypeOf :: Interval' a -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (Interval' a))

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Interval' a))

gmapT :: (forall b. Data b => b -> b) -> Interval' a -> Interval' a

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Interval' a -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Interval' a -> r

gmapQ :: (forall d. Data d => d -> u) -> Interval' a -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Interval' a -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Interval' a -> m (Interval' a)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Interval' a -> m (Interval' a)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Interval' a -> m (Interval' a)

Ord a => Ord (Interval' a)

Methods

compare :: Interval' a -> Interval' a -> Ordering

(<) :: Interval' a -> Interval' a -> Bool

(<=) :: Interval' a -> Interval' a -> Bool

(>) :: Interval' a -> Interval' a -> Bool

(>=) :: Interval' a -> Interval' a -> Bool

max :: Interval' a -> Interval' a -> Interval' a

min :: Interval' a -> Interval' a -> Interval' a

Show a => Show (Interval' (Maybe a))

Methods

showsPrec :: Int -> Interval' (Maybe a) -> ShowS

show :: Interval' (Maybe a) -> String

showList :: [Interval' (Maybe a)] -> ShowS

Generic (Interval' a)

Associated Types

type Rep (Interval' a) :: * -> *

Methods

from :: Interval' a -> Rep (Interval' a) x

to :: Rep (Interval' a) x -> Interval' a

Pretty a => Pretty (Interval' (Maybe a))

Methods

pretty :: Interval' (Maybe a) -> Doc

prettyPrec :: Int -> Interval' (Maybe a) -> Doc

prettyList :: [Interval' (Maybe a)] -> Doc

type Rep (Interval' a)

type Rep (Interval' a) = D1 * (MetaData "Interval'" "Agda.Syntax.Position" "Agda-2.5.2.20170816-GHenzADqKzt4ualJbaFRMq" False) (C1 * (MetaCons "Interval" PrefixI True) ((:*:) * (S1 * (MetaSel (Just Symbol "iStart") NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 * (Position' a))) (S1 * (MetaSel (Just Symbol "iEnd") NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 * (Position' a)))))

intervalInvariant :: Ord a => Interval' a -> Bool

posToInterval :: a -> PositionWithoutFile -> PositionWithoutFile -> Interval' a

Converts a file name and two positions to an interval.

takeI :: String -> Interval' a -> Interval' a

Extracts the interval corresponding to the given string, assuming that the string starts at the beginning of the given interval.

Precondition: The string must not be too long for the interval.

dropI :: String -> Interval' a -> Interval' a

Removes the interval corresponding to the given string from the given interval, assuming that the string starts at the beginning of the interval.

Precondition: The string must not be too long for the interval.

getIntervalFile :: Interval' a -> a

Gets the srcFile component of the interval. Because of the invariant, they are both the same.

iLength :: Interval' a -> Int32

The length of an interval.

fuseIntervals :: Ord a => Interval' a -> Interval' a -> Interval' a

Finds the least interval which covers the arguments.

Precondition: The intervals must point to the same file.

setIntervalFile :: a -> Interval' b -> Interval' a

Sets the srcFile components of the interval.

Ranges

type Range = Range' SrcFile

data Range' a

A range is a file name, plus a sequence of intervals, assumed to point to the given file. The intervals should be consecutive and separated.

Note the invariant which ranges have to satisfy: rangeInvariant.

Constructors

NoRange

Range !a (Seq IntervalWithoutFile)

Instances

Functor Range'

Methods

fmap :: (a -> b) -> Range' a -> Range' b

(<$) :: a -> Range' b -> Range' a

Foldable Range'

Methods

fold :: Monoid m => Range' m -> m

foldMap :: Monoid m => (a -> m) -> Range' a -> m

foldr :: (a -> b -> b) -> b -> Range' a -> b

foldr' :: (a -> b -> b) -> b -> Range' a -> b

foldl :: (b -> a -> b) -> b -> Range' a -> b

foldl' :: (b -> a -> b) -> b -> Range' a -> b

foldr1 :: (a -> a -> a) -> Range' a -> a

foldl1 :: (a -> a -> a) -> Range' a -> a

toList :: Range' a -> [a]

null :: Range' a -> Bool

length :: Range' a -> Int

elem :: Eq a => a -> Range' a -> Bool

maximum :: Ord a => Range' a -> a

minimum :: Ord a => Range' a -> a

sum :: Num a => Range' a -> a

product :: Num a => Range' a -> a

Traversable Range'

Methods

traverse :: Applicative f => (a -> f b) -> Range' a -> f (Range' b)

sequenceA :: Applicative f => Range' (f a) -> f (Range' a)

mapM :: Monad m => (a -> m b) -> Range' a -> m (Range' b)

sequence :: Monad m => Range' (m a) -> m (Range' a)

KillRange Range

Methods

killRange :: KillRangeT Range

SetRange Range

Methods

setRange :: Range -> Range -> Range

HasRange Range

Methods

getRange :: Range -> Range

FreshName Range

Methods

freshName_ :: MonadState TCState m => Range -> m Name

PrettyTCM Range

Methods

prettyTCM :: Range -> TCM Doc

Eq a => Eq (Range' a)

Methods

(==) :: Range' a -> Range' a -> Bool

(/=) :: Range' a -> Range' a -> Bool

Data a => Data (Range' a)

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Range' a -> c (Range' a)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Range' a)

toConstr :: Range' a -> Constr

dataTypeOf :: Range' a -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (Range' a))

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Range' a))

gmapT :: (forall b. Data b => b -> b) -> Range' a -> Range' a

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Range' a -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Range' a -> r

gmapQ :: (forall d. Data d => d -> u) -> Range' a -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Range' a -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Range' a -> m (Range' a)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Range' a -> m (Range' a)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Range' a -> m (Range' a)

Ord a => Ord (Range' a)

Methods

compare :: Range' a -> Range' a -> Ordering

(<) :: Range' a -> Range' a -> Bool

(<=) :: Range' a -> Range' a -> Bool

(>) :: Range' a -> Range' a -> Bool

(>=) :: Range' a -> Range' a -> Bool

max :: Range' a -> Range' a -> Range' a

min :: Range' a -> Range' a -> Range' a

Show a => Show (Range' (Maybe a))

Methods

showsPrec :: Int -> Range' (Maybe a) -> ShowS

show :: Range' (Maybe a) -> String

showList :: [Range' (Maybe a)] -> ShowS

Show a => Show (Range' (Maybe a))

Methods

showsPrec :: Int -> Range' (Maybe a) -> ShowS

show :: Range' (Maybe a) -> String

showList :: [Range' (Maybe a)] -> ShowS

Generic (Range' a)

Associated Types

type Rep (Range' a) :: * -> *

Methods

from :: Range' a -> Rep (Range' a) x

to :: Rep (Range' a) x -> Range' a

Null (Range' a)

Methods

empty :: Range' a

null :: Range' a -> Bool

Pretty a => Pretty (Range' (Maybe a))

Methods

pretty :: Range' (Maybe a) -> Doc

prettyPrec :: Int -> Range' (Maybe a) -> Doc

prettyList :: [Range' (Maybe a)] -> Doc

FreshName (Range, String)

Methods

freshName_ :: MonadState TCState m => (Range, String) -> m Name

type Rep (Range' a)

type Rep (Range' a) = D1 * (MetaData "Range'" "Agda.Syntax.Position" "Agda-2.5.2.20170816-GHenzADqKzt4ualJbaFRMq" False) ((:+:) * (C1 * (MetaCons "NoRange" PrefixI False) (U1 *)) (C1 * (MetaCons "Range" PrefixI False) ((:*:) * (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 * a)) (S1 * (MetaSel (Nothing Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 * (Seq IntervalWithoutFile))))))

rangeInvariant :: Ord a => Range' a -> Bool

Range invariant.

consecutiveAndSeparated :: Ord a => [Interval' a] -> Bool

Are the intervals consecutive and separated, do they all point to the same file, and do they satisfy the interval invariant?

intervalsToRange :: a -> [IntervalWithoutFile] -> Range' a

Turns a file name plus a list of intervals into a range.

Precondition: consecutiveAndSeparated.

intervalToRange :: a -> IntervalWithoutFile -> Range' a

Converts a file name and an interval to a range.

rangeIntervals :: Range' a -> [IntervalWithoutFile]

The intervals that make up the range. The intervals are consecutive and separated (consecutiveAndSeparated).

rangeFile :: Range -> SrcFile

The file the range is pointing to.

rightMargin :: Range -> Range

Conflate a range to its right margin.

noRange :: Range' a

Ranges between two unknown positions

posToRange :: Position' a -> Position' a -> Range' a

Converts two positions to a range.

Precondition: The positions have to point to the same file.

posToRange' :: a -> PositionWithoutFile -> PositionWithoutFile -> Range' a

Converts a file name and two positions to a range.

rStart :: Range' a -> Maybe (Position' a)

The initial position in the range, if any.

rStart' :: Range' a -> Maybe PositionWithoutFile

The initial position in the range, if any.

rEnd :: Range' a -> Maybe (Position' a)

The position after the final position in the range, if any.

rEnd' :: Range' a -> Maybe PositionWithoutFile

The position after the final position in the range, if any.

rangeToInterval :: Range' a -> Maybe IntervalWithoutFile

Converts a range to an interval, if possible. Note that the information about the source file is lost.

rangeToIntervalWithFile :: Range' a -> Maybe (Interval' a)

Converts a range to an interval, if possible.

continuous :: Range' a -> Range' a

Returns the shortest continuous range containing the given one.

continuousPerLine :: Ord a => Range' a -> Range' a

Removes gaps between intervals on the same line.

newtype PrintRange a

Wrapper to indicate that range should be printed.

Constructors

PrintRange a

Instances

Eq a => Eq (PrintRange a)

Methods

(==) :: PrintRange a -> PrintRange a -> Bool

(/=) :: PrintRange a -> PrintRange a -> Bool

Ord a => Ord (PrintRange a)

Methods

compare :: PrintRange a -> PrintRange a -> Ordering

(<) :: PrintRange a -> PrintRange a -> Bool

(<=) :: PrintRange a -> PrintRange a -> Bool

(>) :: PrintRange a -> PrintRange a -> Bool

(>=) :: PrintRange a -> PrintRange a -> Bool

max :: PrintRange a -> PrintRange a -> PrintRange a

min :: PrintRange a -> PrintRange a -> PrintRange a

(Pretty a, HasRange a) => Pretty (PrintRange a)

Methods

pretty :: PrintRange a -> Doc

prettyPrec :: Int -> PrintRange a -> Doc

prettyList :: [PrintRange a] -> Doc

KillRange a => KillRange (PrintRange a)

Methods

killRange :: KillRangeT (PrintRange a)

SetRange a => SetRange (PrintRange a)

Methods

setRange :: Range -> PrintRange a -> PrintRange a

HasRange a => HasRange (PrintRange a)

Methods

getRange :: PrintRange a -> Range

class HasRange t where

Things that have a range are instances of this class.

Minimal complete definition

getRange

Methods

getRange :: t -> Range

Instances

HasRange Bool

Methods

getRange :: Bool -> Range

HasRange Range

Methods

getRange :: Range -> Range

HasRange Interval

Methods

getRange :: Interval -> Range

HasRange ParseWarning

Methods

getRange :: ParseWarning -> Range

HasRange ParseError

Methods

getRange :: ParseError -> Range

HasRange Layer

Methods

getRange :: Layer -> Range

HasRange IsMacro

Methods

getRange :: IsMacro -> Range

HasRange IsInstance

Methods

getRange :: IsInstance -> Range

HasRange Access

Methods

getRange :: Access -> Range

HasRange Induction

Methods

getRange :: Induction -> Range

HasRange TopLevelModuleName

Methods

getRange :: TopLevelModuleName -> Range

HasRange QName

Methods

getRange :: QName -> Range

HasRange Name

Methods

getRange :: Name -> Range

HasRange AmbiguousQName

The range of an AmbiguousQName is the range of any of its disambiguations (they are the same concrete name).

Methods

getRange :: AmbiguousQName -> Range

HasRange ModuleName

Methods

getRange :: ModuleName -> Range

HasRange QName

Methods

getRange :: QName -> Range

HasRange Name

Methods

getRange :: Name -> Range

HasRange Literal

Methods

getRange :: Literal -> Range

HasRange Token

Methods

getRange :: Token -> Range

HasRange Fixity

Methods

getRange :: Fixity -> Range

HasRange Pragma

Methods

getRange :: Pragma -> Range

HasRange ModuleApplication

Methods

getRange :: ModuleApplication -> Range

HasRange Declaration

Methods

getRange :: Declaration -> Range

HasRange AsName

Methods

getRange :: AsName -> Range

HasRange WhereClause

Methods

getRange :: WhereClause -> Range

HasRange RHS

Methods

getRange :: RHS -> Range

HasRange LHSCore

Methods

getRange :: LHSCore -> Range

HasRange LHS

Methods

getRange :: LHS -> Range

HasRange TypedBinding

Methods

getRange :: TypedBinding -> Range

HasRange BoundName

Methods

getRange :: BoundName -> Range

HasRange TypedBindings

Methods

getRange :: TypedBindings -> Range

HasRange LamBinding

Methods

getRange :: LamBinding -> Range

HasRange Pattern

Methods

getRange :: Pattern -> Range

HasRange Expr

Methods

getRange :: Expr -> Range

HasRange ModuleAssignment

Methods

getRange :: ModuleAssignment -> Range

HasRange AbstractName

Methods

getRange :: AbstractName -> Range

HasRange ConPatInfo

Methods

getRange :: ConPatInfo -> Range

HasRange PatInfo

Methods

getRange :: PatInfo -> Range

HasRange LHSInfo

Methods

getRange :: LHSInfo -> Range

HasRange MutualInfo

Methods

getRange :: MutualInfo -> Range

HasRange DeclInfo

Methods

getRange :: DeclInfo -> Range

HasRange DefInfo

Methods

getRange :: DefInfo -> Range

HasRange LetInfo

Methods

getRange :: LetInfo -> Range

HasRange ModuleInfo

Methods

getRange :: ModuleInfo -> Range

HasRange ExprInfo

Methods

getRange :: ExprInfo -> Range

HasRange MetaInfo

Methods

getRange :: MetaInfo -> Range

HasRange Clause

Methods

getRange :: Clause -> Range

HasRange ConHead

Methods

getRange :: ConHead -> Range

HasRange LHS

Methods

getRange :: LHS -> Range

HasRange SpineLHS

Methods

getRange :: SpineLHS -> Range

HasRange RHS

Methods

getRange :: RHS -> Range

HasRange TypedBinding

Methods

getRange :: TypedBinding -> Range

HasRange TypedBindings

Methods

getRange :: TypedBindings -> Range

HasRange LamBinding

Methods

getRange :: LamBinding -> Range

HasRange LetBinding

Methods

getRange :: LetBinding -> Range

HasRange Declaration

Methods

getRange :: Declaration -> Range

HasRange Expr

Methods

getRange :: Expr -> Range

HasRange DeclarationWarning

Methods

getRange :: DeclarationWarning -> Range

HasRange DeclarationException

Methods

getRange :: DeclarationException -> Range

HasRange NiceDeclaration

Methods

getRange :: NiceDeclaration -> Range

HasRange TCErr

Methods

getRange :: TCErr -> Range

HasRange TCWarning

Methods

getRange :: TCWarning -> Range

HasRange Call

Methods

getRange :: Call -> Range

HasRange CompilerPragma

Methods

getRange :: CompilerPragma -> Range

HasRange MetaInfo

Methods

getRange :: MetaInfo -> Range

HasRange MetaVariable

Methods

getRange :: MetaVariable -> Range

HasRange Constraint

Methods

getRange :: Constraint -> Range

HasRange ProblemConstraint

Methods

getRange :: ProblemConstraint -> Range

HasRange Item

Methods

getRange :: Item -> Range

HasRange HaskellPragma

Methods

getRange :: HaskellPragma -> Range

HasRange a => HasRange [a]

Precondition: The ranges of the list elements must point to the same file (or be empty).

Methods

getRange :: [a] -> Range

HasRange a => HasRange (Maybe a)

Methods

getRange :: Maybe a -> Range

HasRange a => HasRange (PrintRange a)

Methods

getRange :: PrintRange a -> Range

HasRange a => HasRange (MaybePlaceholder a)

Methods

getRange :: MaybePlaceholder a -> Range

HasRange (Ranged a)

Methods

getRange :: Ranged a -> Range

HasRange a => HasRange (Dom a)

Methods

getRange :: Dom a -> Range

HasRange a => HasRange (Arg a)

Methods

getRange :: Arg a -> Range

HasRange a => HasRange (WithOrigin a)

Methods

getRange :: WithOrigin a -> Range

HasRange a => HasRange (WithHiding a)

Methods

getRange :: WithHiding a -> Range

HasRange a => HasRange (FieldAssignment' a)

Methods

getRange :: FieldAssignment' a -> Range

HasRange e => HasRange (OpApp e)

Methods

getRange :: OpApp e -> Range

IsExpr e => HasRange (ExprView e)

Methods

getRange :: ExprView e -> Range

HasRange (Pattern' e)

Methods

getRange :: Pattern' e -> Range

HasRange (LHSCore' e)

Methods

getRange :: LHSCore' e -> Range

HasRange a => HasRange (Clause' a)

Methods

getRange :: Clause' a -> Range

HasRange a => HasRange (Closure a)

Methods

getRange :: Closure a -> Range

(HasRange a, HasRange b) => HasRange (Either a b)

Methods

getRange :: Either a b -> Range

(HasRange a, HasRange b) => HasRange (a, b)

Precondition: The ranges of the tuple elements must point to the same file (or be empty).

Methods

getRange :: (a, b) -> Range

(HasRange a, HasRange b) => HasRange (Renaming' a b)

Methods

getRange :: Renaming' a b -> Range

(HasRange a, HasRange b) => HasRange (ImportedName' a b)

Methods

getRange :: ImportedName' a b -> Range

(HasRange a, HasRange b) => HasRange (Using' a b)

Methods

getRange :: Using' a b -> Range

(HasRange a, HasRange b) => HasRange (ImportDirective' a b)

Methods

getRange :: ImportDirective' a b -> Range

HasRange a => HasRange (Named name a)

Methods

getRange :: Named name a -> Range

(HasRange a, HasRange b, HasRange c) => HasRange (a, b, c)

Precondition: The ranges of the tuple elements must point to the same file (or be empty).

Methods

getRange :: (a, b, c) -> Range

(HasRange a, HasRange b, HasRange c, HasRange d) => HasRange (a, b, c, d)

Precondition: The ranges of the tuple elements must point to the same file (or be empty).

Methods

getRange :: (a, b, c, d) -> Range

(HasRange a, HasRange b, HasRange c, HasRange d, HasRange e) => HasRange (a, b, c, d, e)

Precondition: The ranges of the tuple elements must point to the same file (or be empty).

Methods

getRange :: (a, b, c, d, e) -> Range

(HasRange a, HasRange b, HasRange c, HasRange d, HasRange e, HasRange f) => HasRange (a, b, c, d, e, f)

Precondition: The ranges of the tuple elements must point to the same file (or be empty).

Methods

getRange :: (a, b, c, d, e, f) -> Range

(HasRange a, HasRange b, HasRange c, HasRange d, HasRange e, HasRange f, HasRange g) => HasRange (a, b, c, d, e, f, g)

Precondition: The ranges of the tuple elements must point to the same file (or be empty).

Methods

getRange :: (a, b, c, d, e, f, g) -> Range

class HasRange t => SetRange t where

If it is also possible to set the range, this is the class.

Instances should satisfy getRange (setRange r x) == r.

Minimal complete definition

setRange

Methods

setRange :: Range -> t -> t

Instances

SetRange Range

Methods

setRange :: Range -> Range -> Range

SetRange TopLevelModuleName

Methods

setRange :: Range -> TopLevelModuleName -> TopLevelModuleName

SetRange QName

Methods

setRange :: Range -> QName -> QName

SetRange Name

Methods

setRange :: Range -> Name -> Name

SetRange ModuleName

Methods

setRange :: Range -> ModuleName -> ModuleName

SetRange QName

Methods

setRange :: Range -> QName -> QName

SetRange Name

Methods

setRange :: Range -> Name -> Name

SetRange Literal

Methods

setRange :: Range -> Literal -> Literal

SetRange TypedBindings

Methods

setRange :: Range -> TypedBindings -> TypedBindings

SetRange Pattern

Methods

setRange :: Range -> Pattern -> Pattern

SetRange AbstractName

Methods

setRange :: Range -> AbstractName -> AbstractName

SetRange ConPatInfo

Methods

setRange :: Range -> ConPatInfo -> ConPatInfo

SetRange DeclInfo

Methods

setRange :: Range -> DeclInfo -> DeclInfo

SetRange DefInfo

Methods

setRange :: Range -> DefInfo -> DefInfo

SetRange ModuleInfo

Methods

setRange :: Range -> ModuleInfo -> ModuleInfo

SetRange ConHead

Methods

setRange :: Range -> ConHead -> ConHead

SetRange MetaInfo

Methods

setRange :: Range -> MetaInfo -> MetaInfo

SetRange MetaVariable

Methods

setRange :: Range -> MetaVariable -> MetaVariable

SetRange a => SetRange [a]

Methods

setRange :: Range -> [a] -> [a]

SetRange a => SetRange (PrintRange a)

Methods

setRange :: Range -> PrintRange a -> PrintRange a

SetRange a => SetRange (Arg a)

Methods

setRange :: Range -> Arg a -> Arg a

SetRange a => SetRange (WithOrigin a)

Methods

setRange :: Range -> WithOrigin a -> WithOrigin a

SetRange a => SetRange (WithHiding a)

Methods

setRange :: Range -> WithHiding a -> WithHiding a

SetRange (Pattern' a)

Methods

setRange :: Range -> Pattern' a -> Pattern' a

SetRange a => SetRange (Named name a)

Methods

setRange :: Range -> Named name a -> Named name a

class KillRange a where

Killing the range of an object sets all range information to noRange.

Minimal complete definition

killRange

Methods

killRange :: KillRangeT a

Instances

KillRange Bool

Methods

killRange :: KillRangeT Bool

KillRange Int

Methods

killRange :: KillRangeT Int

KillRange Integer

Methods

killRange :: KillRangeT Integer

KillRange ()

Methods

killRange :: KillRangeT ()

KillRange Void

Methods

killRange :: KillRangeT Void

KillRange String

Overlaps with KillRange [a].

Methods

killRange :: KillRangeT String

KillRange Range

Methods

killRange :: KillRangeT Range

KillRange Permutation

Methods

killRange :: KillRangeT Permutation

KillRange Fixity'

Methods

killRange :: KillRangeT Fixity'

KillRange InteractionId

Methods

killRange :: KillRangeT InteractionId

KillRange NameId

Methods

killRange :: KillRangeT NameId

KillRange IsMacro

Methods

killRange :: KillRangeT IsMacro

KillRange IsInstance

Methods

killRange :: KillRangeT IsInstance

KillRange IsAbstract

Methods

killRange :: KillRangeT IsAbstract

KillRange Access

Methods

killRange :: KillRangeT Access

KillRange ProjOrigin

Methods

killRange :: KillRangeT ProjOrigin

KillRange ConOrigin

Methods

killRange :: KillRangeT ConOrigin

KillRange ArgInfo

Methods

killRange :: KillRangeT ArgInfo

KillRange Origin

Methods

killRange :: KillRangeT Origin

KillRange Relevance

Methods

killRange :: KillRangeT Relevance

KillRange Hiding

Methods

killRange :: KillRangeT Hiding

KillRange Induction

Methods

killRange :: KillRangeT Induction

KillRange Delayed

Methods

killRange :: KillRangeT Delayed

KillRange TopLevelModuleName

Methods

killRange :: KillRangeT TopLevelModuleName

KillRange QName

Methods

killRange :: KillRangeT QName

KillRange Name

Methods

killRange :: KillRangeT Name

KillRange GenPart

Methods

killRange :: KillRangeT GenPart

KillRange AmbiguousQName

Methods

killRange :: KillRangeT AmbiguousQName

KillRange ModuleName

Methods

killRange :: KillRangeT ModuleName

KillRange QName

Methods

killRange :: KillRangeT QName

KillRange Name

Methods

killRange :: KillRangeT Name

KillRange Literal

Methods

killRange :: KillRangeT Literal

KillRange Compiled

Methods

killRange :: KillRangeT Compiled

KillRange Fixity

Methods

killRange :: KillRangeT Fixity

KillRange Occurrence

Methods

killRange :: KillRangeT Occurrence

KillRange Pragma

Methods

killRange :: KillRangeT Pragma

KillRange ModuleApplication

Methods

killRange :: KillRangeT ModuleApplication

KillRange Declaration

Methods

killRange :: KillRangeT Declaration

KillRange AsName

Methods

killRange :: KillRangeT AsName

KillRange WhereClause

Methods

killRange :: KillRangeT WhereClause

KillRange RHS

Methods

killRange :: KillRangeT RHS

KillRange LHS

Methods

killRange :: KillRangeT LHS

KillRange TypedBinding

Methods

killRange :: KillRangeT TypedBinding

KillRange BoundName

Methods

killRange :: KillRangeT BoundName

KillRange TypedBindings

Methods

killRange :: KillRangeT TypedBindings

KillRange LamBinding

Methods

killRange :: KillRangeT LamBinding

KillRange Pattern

Methods

killRange :: KillRangeT Pattern

KillRange Expr

Methods

killRange :: KillRangeT Expr

KillRange ModuleAssignment

Methods

killRange :: KillRangeT ModuleAssignment

KillRange ScopeInfo

Methods

killRange :: KillRangeT ScopeInfo

KillRange ConPatInfo

Methods

killRange :: KillRangeT ConPatInfo

KillRange PatInfo

Methods

killRange :: KillRangeT PatInfo

KillRange LHSInfo

Methods

killRange :: KillRangeT LHSInfo

KillRange MutualInfo

Methods

killRange :: KillRangeT MutualInfo

KillRange DeclInfo

Methods

killRange :: KillRangeT DeclInfo

KillRange DefInfo

Methods

killRange :: KillRangeT DefInfo

KillRange LetInfo

Methods

killRange :: KillRangeT LetInfo

KillRange ModuleInfo

Methods

killRange :: KillRangeT ModuleInfo

KillRange ExprInfo

Methods

killRange :: KillRangeT ExprInfo

KillRange MetaInfo

Methods

killRange :: KillRangeT MetaInfo

KillRange Substitution

Methods

killRange :: KillRangeT Substitution

KillRange ConPatternInfo

Methods

killRange :: KillRangeT ConPatternInfo

KillRange DBPatVar

Methods

killRange :: KillRangeT DBPatVar

KillRange Clause

Methods

killRange :: KillRangeT Clause

KillRange LevelAtom

Methods

killRange :: KillRangeT LevelAtom

KillRange PlusLevel

Methods

killRange :: KillRangeT PlusLevel

KillRange Level

Methods

killRange :: KillRangeT Level

KillRange Sort

Methods

killRange :: KillRangeT Sort

KillRange Term

Methods

killRange :: KillRangeT Term

KillRange ConHead

Methods

killRange :: KillRangeT ConHead

KillRange CompiledClauses

Methods

killRange :: KillRangeT CompiledClauses

KillRange LHS

Methods

killRange :: KillRangeT LHS

KillRange SpineLHS

Methods

killRange :: KillRangeT SpineLHS

KillRange RHS

Methods

killRange :: KillRangeT RHS

KillRange NamedDotPattern

Methods

killRange :: KillRangeT NamedDotPattern

KillRange TypedBinding

Methods

killRange :: KillRangeT TypedBinding

KillRange TypedBindings

Methods

killRange :: KillRangeT TypedBindings

KillRange LamBinding

Methods

killRange :: KillRangeT LamBinding

KillRange LetBinding

Methods

killRange :: KillRangeT LetBinding

KillRange ModuleApplication

Methods

killRange :: KillRangeT ModuleApplication

KillRange Declaration

Methods

killRange :: KillRangeT Declaration

KillRange ScopeCopyInfo

Methods

killRange :: KillRangeT ScopeCopyInfo

KillRange Expr

Methods

killRange :: KillRangeT Expr

KillRange CtxId

Methods

killRange :: KillRangeT CtxId

KillRange MutualId

Methods

killRange :: KillRangeT MutualId

KillRange TermHead

Methods

killRange :: KillRangeT TermHead

KillRange Defn

Methods

killRange :: KillRangeT Defn

KillRange FunctionFlag

Methods

killRange :: KillRangeT FunctionFlag

KillRange EtaEquality

Methods

killRange :: KillRangeT EtaEquality

KillRange ProjLams

Methods

killRange :: KillRangeT ProjLams

KillRange Projection

Methods

killRange :: KillRangeT Projection

KillRange ExtLamInfo

Methods

killRange :: KillRangeT ExtLamInfo

KillRange CompiledRepresentation

Methods

killRange :: KillRangeT CompiledRepresentation

KillRange Polarity

Methods

killRange :: KillRangeT Polarity

KillRange Definition

Methods

killRange :: KillRangeT Definition

KillRange RewriteRule

Methods

killRange :: KillRangeT RewriteRule

KillRange NLPType

Methods

killRange :: KillRangeT NLPType

KillRange NLPat

Methods

killRange :: KillRangeT NLPat

KillRange DisplayTerm

Methods

killRange :: KillRangeT DisplayTerm

KillRange DisplayForm

Methods

killRange :: KillRangeT DisplayForm

KillRange Section

Methods

killRange :: KillRangeT Section

KillRange RewriteRuleMap

Methods

killRange :: KillRangeT RewriteRuleMap

KillRange Definitions

Methods

killRange :: KillRangeT Definitions

KillRange Sections

Methods

killRange :: KillRangeT Sections

KillRange Signature

Methods

killRange :: KillRangeT Signature

KillRange a => KillRange [a]

Methods

killRange :: KillRangeT [a]

KillRange a => KillRange (Maybe a)

Methods

killRange :: KillRangeT (Maybe a)

(Ord a, KillRange a) => KillRange (Set a)

Methods

killRange :: KillRangeT (Set a)

KillRange a => KillRange (PrintRange a)

Methods

killRange :: KillRangeT (PrintRange a)

KillRange a => KillRange (Drop a)

Methods

killRange :: KillRangeT (Drop a)

KillRange m => KillRange (TerminationCheck m)

Methods

killRange :: KillRangeT (TerminationCheck m)

KillRange a => KillRange (MaybePlaceholder a)

Methods

killRange :: KillRangeT (MaybePlaceholder a)

KillRange (Ranged a)

Methods

killRange :: KillRangeT (Ranged a)

KillRange a => KillRange (Dom a)

Methods

killRange :: KillRangeT (Dom a)

KillRange a => KillRange (Arg a)

Methods

killRange :: KillRangeT (Arg a)

KillRange a => KillRange (WithOrigin a)

Methods

killRange :: KillRangeT (WithOrigin a)

KillRange a => KillRange (WithHiding a)

Methods

killRange :: KillRangeT (WithHiding a)

KillRange x => KillRange (ThingWithFixity x)

Methods

killRange :: KillRangeT (ThingWithFixity x)

KillRange a => KillRange (FieldAssignment' a)

Methods

killRange :: KillRangeT (FieldAssignment' a)

KillRange e => KillRange (OpApp e)

Methods

killRange :: KillRangeT (OpApp e)

KillRange a => KillRange (Pattern' a)

Methods

killRange :: KillRangeT (Pattern' a)

KillRange a => KillRange (Blocked a)

Methods

killRange :: KillRangeT (Blocked a)

KillRange a => KillRange (Tele a)

Methods

killRange :: KillRangeT (Tele a)

KillRange a => KillRange (Type' a)

Methods

killRange :: KillRangeT (Type' a)

KillRange a => KillRange (Abs a)

Methods

killRange :: KillRangeT (Abs a)

KillRange a => KillRange (Elim' a)

Methods

killRange :: KillRangeT (Elim' a)

KillRange c => KillRange (Case c)

Methods

killRange :: KillRangeT (Case c)

KillRange c => KillRange (WithArity c)

Methods

killRange :: KillRangeT (WithArity c)

KillRange e => KillRange (Pattern' e)

Methods

killRange :: KillRangeT (Pattern' e)

KillRange e => KillRange (LHSCore' e)

Methods

killRange :: KillRangeT (LHSCore' e)

KillRange a => KillRange (Clause' a)

Methods

killRange :: KillRangeT (Clause' a)

KillRange c => KillRange (FunctionInverse' c)

Methods

killRange :: KillRangeT (FunctionInverse' c)

KillRange a => KillRange (Local a)

Methods

killRange :: KillRangeT (Local a)

KillRange a => KillRange (Open a)

Methods

killRange :: KillRangeT (Open a)

(KillRange a, KillRange b) => KillRange (Either a b)

Methods

killRange :: KillRangeT (Either a b)

(KillRange a, KillRange b) => KillRange (a, b)

Methods

killRange :: KillRangeT (a, b)

KillRange a => KillRange (Map k a)

Methods

killRange :: KillRangeT (Map k a)

(KillRange a, KillRange b) => KillRange (Renaming' a b)

Methods

killRange :: KillRangeT (Renaming' a b)

(KillRange a, KillRange b) => KillRange (ImportedName' a b)

Methods

killRange :: KillRangeT (ImportedName' a b)

(KillRange a, KillRange b) => KillRange (Using' a b)

Methods

killRange :: KillRangeT (Using' a b)

(KillRange a, KillRange b) => KillRange (ImportDirective' a b)

Methods

killRange :: KillRangeT (ImportDirective' a b)

(KillRange name, KillRange a) => KillRange (Named name a)

Methods

killRange :: KillRangeT (Named name a)

(KillRange a, KillRange b, KillRange c) => KillRange (a, b, c)

Methods

killRange :: KillRangeT (a, b, c)

(KillRange a, KillRange b, KillRange c, KillRange d) => KillRange (a, b, c, d)

Methods

killRange :: KillRangeT (a, b, c, d)

type KillRangeT a = a -> a

killRangeMap :: (KillRange k, KillRange v) => KillRangeT (Map k v)

Remove ranges in keys and values of a map.

killRange1 :: KillRange a => (a -> b) -> a -> b

killRange2 :: (KillRange a, KillRange b) => (a -> b -> c) -> a -> b -> c

killRange3 :: (KillRange a, KillRange b, KillRange c) => (a -> b -> c -> d) -> a -> b -> c -> d

killRange4 :: (KillRange a, KillRange b, KillRange c, KillRange d) => (a -> b -> c -> d -> e) -> a -> b -> c -> d -> e

killRange5 :: (KillRange a, KillRange b, KillRange c, KillRange d, KillRange e) => (a -> b -> c -> d -> e -> f) -> a -> b -> c -> d -> e -> f

killRange6 :: (KillRange a, KillRange b, KillRange c, KillRange d, KillRange e, KillRange f) => (a -> b -> c -> d -> e -> f -> g) -> a -> b -> c -> d -> e -> f -> g

killRange7 :: (KillRange a, KillRange b, KillRange c, KillRange d, KillRange e, KillRange f, KillRange g) => (a -> b -> c -> d -> e -> f -> g -> h) -> a -> b -> c -> d -> e -> f -> g -> h

killRange8 :: (KillRange a, KillRange b, KillRange c, KillRange d, KillRange e, KillRange f, KillRange g, KillRange h) => (a -> b -> c -> d -> e -> f -> g -> h -> i) -> a -> b -> c -> d -> e -> f -> g -> h -> i

killRange9 :: (KillRange a, KillRange b, KillRange c, KillRange d, KillRange e, KillRange f, KillRange g, KillRange h, KillRange i) => (a -> b -> c -> d -> e -> f -> g -> h -> i -> j) -> a -> b -> c -> d -> e -> f -> g -> h -> i -> j

killRange10 :: (KillRange a, KillRange b, KillRange c, KillRange d, KillRange e, KillRange f, KillRange g, KillRange h, KillRange i, KillRange j) => (a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k) -> a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k

killRange11 :: (KillRange a, KillRange b, KillRange c, KillRange d, KillRange e, KillRange f, KillRange g, KillRange h, KillRange i, KillRange j, KillRange k) => (a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l) -> a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l

killRange12 :: (KillRange a, KillRange b, KillRange c, KillRange d, KillRange e, KillRange f, KillRange g, KillRange h, KillRange i, KillRange j, KillRange k, KillRange l) => (a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m) -> a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m

killRange13 :: (KillRange a, KillRange b, KillRange c, KillRange d, KillRange e, KillRange f, KillRange g, KillRange h, KillRange i, KillRange j, KillRange k, KillRange l, KillRange m) => (a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n) -> a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n

killRange14 :: (KillRange a, KillRange b, KillRange c, KillRange d, KillRange e, KillRange f, KillRange g, KillRange h, KillRange i, KillRange j, KillRange k, KillRange l, KillRange m, KillRange n) => (a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o) -> a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o

killRange15 :: (KillRange a, KillRange b, KillRange c, KillRange d, KillRange e, KillRange f, KillRange g, KillRange h, KillRange i, KillRange j, KillRange k, KillRange l, KillRange m, KillRange n, KillRange o) => (a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p) -> a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p

killRange16 :: (KillRange a, KillRange b, KillRange c, KillRange d, KillRange e, KillRange f, KillRange g, KillRange h, KillRange i, KillRange j, KillRange k, KillRange l, KillRange m, KillRange n, KillRange o, KillRange p) => (a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q) -> a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q

killRange17 :: (KillRange a, KillRange b, KillRange c, KillRange d, KillRange e, KillRange f, KillRange g, KillRange h, KillRange i, KillRange j, KillRange k, KillRange l, KillRange m, KillRange n, KillRange o, KillRange p, KillRange q) => (a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r) -> a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r

killRange18 :: (KillRange a, KillRange b, KillRange c, KillRange d, KillRange e, KillRange f, KillRange g, KillRange h, KillRange i, KillRange j, KillRange k, KillRange l, KillRange m, KillRange n, KillRange o, KillRange p, KillRange q, KillRange r) => (a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s) -> a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s

killRange19 :: (KillRange a, KillRange b, KillRange c, KillRange d, KillRange e, KillRange f, KillRange g, KillRange h, KillRange i, KillRange j, KillRange k, KillRange l, KillRange m, KillRange n, KillRange o, KillRange p, KillRange q, KillRange r, KillRange s) => (a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t) -> a -> b -> c -> d -> e -> f -> g -> h -> i -> j -> k -> l -> m -> n -> o -> p -> q -> r -> s -> t

withRangeOf :: (SetRange t, HasRange u) => t -> u -> t

x `withRangeOf` y sets the range of x to the range of y.

fuseRange :: (HasRange u, HasRange t) => u -> t -> Range

Precondition: The ranges must point to the same file (or be empty).

fuseRanges :: Ord a => Range' a -> Range' a -> Range' a

fuseRanges r r' unions the ranges r and r'.

Meaning it finds the least range r0 that covers r and r'.

Precondition: The ranges must point to the same file (or be empty).

beginningOf :: Range -> Range

beginningOf r is an empty range (a single, empty interval) positioned at the beginning of r. If r does not have a beginning, then noRange is returned.

beginningOfFile :: Range -> Range

beginningOfFile r is an empty range (a single, empty interval) at the beginning of r's starting position's file. If there is no such position, then an empty range is returned.

interleaveRanges :: HasRange a => [a] -> [a] -> ([a], [(a, a)])

Interleaves two streams of ranged elements

It will report the conflicts as a list of conflicting pairs. In case of conflict, the element with the earliest start position is placed first. In case of a tie, the element with the earliest ending position is placed first. If both tie, the element from the first list is placed first.