Development.IDE.GHC.Compat.Util

GHC Utils and Datastructures re-exports.

Mainly handles module hierarchy re-organisation of GHC from version to= 9.0.

Some Functions, such as toList shadow other function-names. This way this module can be imported qualified more naturally.

Exception handling

type MonadCatch = ExceptionMonad

data GhcException

GHC's own exception type error messages all take the form:

     location: error
 

If the location is on the command line, or in GHC itself, then location="ghc". All of the error types below correspond to a location of "ghc", except for ProgramError (where the string is assumed to contain a location already, so we don't print one).

Instances

Show GhcException

Defined in Panic

Methods

showsPrec :: Int -> GhcException -> ShowS

show :: GhcException -> String

showList :: [GhcException] -> ShowS

Exception GhcException

Defined in Panic

Methods

toException :: GhcException -> SomeException

fromException :: SomeException -> Maybe GhcException

displayException :: GhcException -> String

handleGhcException :: ExceptionMonad m => (GhcException -> m a) -> m a -> m a

catch :: (ExceptionMonad m, Exception e) => m a -> (e -> m a) -> m a

try :: (ExceptionMonad m, Exception e) => m a -> m (Either e a)

Bags

data Bag a

Instances

Functor Bag

Defined in Bag

Methods

fmap :: (a -> b) -> Bag a -> Bag b

(<$) :: a -> Bag b -> Bag a

Foldable Bag

Defined in Bag

Methods

fold :: Monoid m => Bag m -> m

foldMap :: Monoid m => (a -> m) -> Bag a -> m

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

foldr :: (a -> b -> b) -> b -> Bag a -> b

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

foldl :: (b -> a -> b) -> b -> Bag a -> b

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

foldr1 :: (a -> a -> a) -> Bag a -> a

foldl1 :: (a -> a -> a) -> Bag a -> a

toList :: Bag a -> [a]

null :: Bag a -> Bool

length :: Bag a -> Int

elem :: Eq a => a -> Bag a -> Bool

maximum :: Ord a => Bag a -> a

minimum :: Ord a => Bag a -> a

sum :: Num a => Bag a -> a

product :: Num a => Bag a -> a

Traversable Bag

Defined in Bag

Methods

traverse :: Applicative f => (a -> f b) -> Bag a -> f (Bag b)

sequenceA :: Applicative f => Bag (f a) -> f (Bag a)

mapM :: Monad m => (a -> m b) -> Bag a -> m (Bag b)

sequence :: Monad m => Bag (m a) -> m (Bag a)

Data a => Data (Bag a)

Defined in Bag

Methods

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

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

toConstr :: Bag a -> Constr

dataTypeOf :: Bag a -> DataType

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

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

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

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

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

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

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

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

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

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

Show a => Show (Bag a)

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> Bag a -> ShowS

show :: Bag a -> String

showList :: [Bag a] -> ShowS

Outputable a => Outputable (Bag a)

Defined in Bag

Methods

ppr :: Bag a -> SDoc

pprPrec :: Rational -> Bag a -> SDoc

ToHie a => ToHie (Bag a)

Defined in Compat.HieAst

Methods

toHie :: Bag a -> HieM [HieAST Type]

bagToList :: Bag a -> [a]

listToBag :: [a] -> Bag a

unionBags :: Bag a -> Bag a -> Bag a

isEmptyBag :: Bag a -> Bool

Boolean Formula

type LBooleanFormula a = Located (BooleanFormula a)

data BooleanFormula a

Constructors

Var a

And [LBooleanFormula a]

Or [LBooleanFormula a]

Parens (LBooleanFormula a)

Instances

Functor BooleanFormula

Defined in BooleanFormula

Methods

fmap :: (a -> b) -> BooleanFormula a -> BooleanFormula b

(<$) :: a -> BooleanFormula b -> BooleanFormula a

Foldable BooleanFormula

Defined in BooleanFormula

Methods

fold :: Monoid m => BooleanFormula m -> m

foldMap :: Monoid m => (a -> m) -> BooleanFormula a -> m

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

foldr :: (a -> b -> b) -> b -> BooleanFormula a -> b

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

foldl :: (b -> a -> b) -> b -> BooleanFormula a -> b

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

foldr1 :: (a -> a -> a) -> BooleanFormula a -> a

foldl1 :: (a -> a -> a) -> BooleanFormula a -> a

toList :: BooleanFormula a -> [a]

null :: BooleanFormula a -> Bool

length :: BooleanFormula a -> Int

elem :: Eq a => a -> BooleanFormula a -> Bool

maximum :: Ord a => BooleanFormula a -> a

minimum :: Ord a => BooleanFormula a -> a

sum :: Num a => BooleanFormula a -> a

product :: Num a => BooleanFormula a -> a

Traversable BooleanFormula

Defined in BooleanFormula

Methods

traverse :: Applicative f => (a -> f b) -> BooleanFormula a -> f (BooleanFormula b)

sequenceA :: Applicative f => BooleanFormula (f a) -> f (BooleanFormula a)

mapM :: Monad m => (a -> m b) -> BooleanFormula a -> m (BooleanFormula b)

sequence :: Monad m => BooleanFormula (m a) -> m (BooleanFormula a)

Eq a => Eq (BooleanFormula a)

Defined in BooleanFormula

Methods

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

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

Data a => Data (BooleanFormula a)

Defined in BooleanFormula

Methods

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

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

toConstr :: BooleanFormula a -> Constr

dataTypeOf :: BooleanFormula a -> DataType

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

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

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

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

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

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

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

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

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

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

Binary a => Binary (BooleanFormula a)

Defined in BooleanFormula

Methods

put_ :: BinHandle -> BooleanFormula a -> IO ()

put :: BinHandle -> BooleanFormula a -> IO (Bin (BooleanFormula a))

get :: BinHandle -> IO (BooleanFormula a)

OutputableBndr a => Outputable (BooleanFormula a)

Defined in BooleanFormula

Methods

ppr :: BooleanFormula a -> SDoc

pprPrec :: Rational -> BooleanFormula a -> SDoc

Annotate name => Annotate (BooleanFormula (Located name))

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> BooleanFormula (Located name) -> Annotated ()

ToHie (LBooleanFormula (Located Name))

Defined in Compat.HieAst

Methods

toHie :: LBooleanFormula (Located Name) -> HieM [HieAST Type]

OverridingBool

data OverridingBool

Constructors

Auto

Always

Never

Instances

Show OverridingBool

Defined in Util

Methods

showsPrec :: Int -> OverridingBool -> ShowS

show :: OverridingBool -> String

showList :: [OverridingBool] -> ShowS

Maybes

data MaybeErr err val

Constructors

Succeeded val

Failed err

Instances

Monad (MaybeErr err)

Defined in Maybes

Methods

(>>=) :: MaybeErr err a -> (a -> MaybeErr err b) -> MaybeErr err b

(>>) :: MaybeErr err a -> MaybeErr err b -> MaybeErr err b

return :: a -> MaybeErr err a

Functor (MaybeErr err)

Defined in Maybes

Methods

fmap :: (a -> b) -> MaybeErr err a -> MaybeErr err b

(<$) :: a -> MaybeErr err b -> MaybeErr err a

Applicative (MaybeErr err)

Defined in Maybes

Methods

pure :: a -> MaybeErr err a

(<*>) :: MaybeErr err (a -> b) -> MaybeErr err a -> MaybeErr err b

liftA2 :: (a -> b -> c) -> MaybeErr err a -> MaybeErr err b -> MaybeErr err c

(*>) :: MaybeErr err a -> MaybeErr err b -> MaybeErr err b

(<*) :: MaybeErr err a -> MaybeErr err b -> MaybeErr err a

orElse :: Maybe a -> a -> a infixr 4

Flipped version of fromMaybe, useful for chaining.

Pair

data Pair a

Constructors

Pair

Fields

• pFst :: a
• pSnd :: a

Instances

Functor Pair

Defined in Pair

Methods

fmap :: (a -> b) -> Pair a -> Pair b

(<$) :: a -> Pair b -> Pair a

Applicative Pair

Defined in Pair

Methods

pure :: a -> Pair a

(<*>) :: Pair (a -> b) -> Pair a -> Pair b

liftA2 :: (a -> b -> c) -> Pair a -> Pair b -> Pair c

(*>) :: Pair a -> Pair b -> Pair b

(<*) :: Pair a -> Pair b -> Pair a

Foldable Pair

Defined in Pair

Methods

fold :: Monoid m => Pair m -> m

foldMap :: Monoid m => (a -> m) -> Pair a -> m

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

foldr :: (a -> b -> b) -> b -> Pair a -> b

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

foldl :: (b -> a -> b) -> b -> Pair a -> b

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

foldr1 :: (a -> a -> a) -> Pair a -> a

foldl1 :: (a -> a -> a) -> Pair a -> a

toList :: Pair a -> [a]

null :: Pair a -> Bool

length :: Pair a -> Int

elem :: Eq a => a -> Pair a -> Bool

maximum :: Ord a => Pair a -> a

minimum :: Ord a => Pair a -> a

sum :: Num a => Pair a -> a

product :: Num a => Pair a -> a

Traversable Pair

Defined in Pair

Methods

traverse :: Applicative f => (a -> f b) -> Pair a -> f (Pair b)

sequenceA :: Applicative f => Pair (f a) -> f (Pair a)

mapM :: Monad m => (a -> m b) -> Pair a -> m (Pair b)

sequence :: Monad m => Pair (m a) -> m (Pair a)

Semigroup a => Semigroup (Pair a)

Defined in Pair

Methods

(<>) :: Pair a -> Pair a -> Pair a

sconcat :: NonEmpty (Pair a) -> Pair a

stimes :: Integral b => b -> Pair a -> Pair a

(Semigroup a, Monoid a) => Monoid (Pair a)

Defined in Pair

Methods

mempty :: Pair a

mappend :: Pair a -> Pair a -> Pair a

mconcat :: [Pair a] -> Pair a

Outputable a => Outputable (Pair a)

Defined in Pair

Methods

ppr :: Pair a -> SDoc

pprPrec :: Rational -> Pair a -> SDoc

EnumSet

data EnumSet a

toList :: Enum a => EnumSet a -> [a]

FastString exports

data FastString

A FastString is a UTF-8 encoded string together with a unique ID. All FastStrings are stored in a global hashtable to support fast O(1) comparison.

It is also associated with a lazy reference to the Z-encoding of this string which is used by the compiler internally.

Instances

Eq FastString

Defined in FastString

Methods

(==) :: FastString -> FastString -> Bool

(/=) :: FastString -> FastString -> Bool

Data FastString

Defined in FastString

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> FastString -> c FastString

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c FastString

toConstr :: FastString -> Constr

dataTypeOf :: FastString -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c FastString)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c FastString)

gmapT :: (forall b. Data b => b -> b) -> FastString -> FastString

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

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

gmapQ :: (forall d. Data d => d -> u) -> FastString -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> FastString -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> FastString -> m FastString

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FastString -> m FastString

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FastString -> m FastString

Ord FastString

Defined in FastString

Methods

compare :: FastString -> FastString -> Ordering

(<) :: FastString -> FastString -> Bool

(<=) :: FastString -> FastString -> Bool

(>) :: FastString -> FastString -> Bool

(>=) :: FastString -> FastString -> Bool

max :: FastString -> FastString -> FastString

min :: FastString -> FastString -> FastString

Show FastString

Defined in FastString

Methods

showsPrec :: Int -> FastString -> ShowS

show :: FastString -> String

showList :: [FastString] -> ShowS

IsString FastString

Defined in FastString

Methods

fromString :: String -> FastString

Semigroup FastString

Defined in FastString

Methods

(<>) :: FastString -> FastString -> FastString

sconcat :: NonEmpty FastString -> FastString

stimes :: Integral b => b -> FastString -> FastString

Monoid FastString

Defined in FastString

Methods

mempty :: FastString

mappend :: FastString -> FastString -> FastString

mconcat :: [FastString] -> FastString

NFData FastString

Defined in FastString

Methods

rnf :: FastString -> ()

Uniquable FastString

Defined in Unique

Methods

getUnique :: FastString -> Unique

Outputable FastString

Defined in Outputable

Methods

ppr :: FastString -> SDoc

pprPrec :: Rational -> FastString -> SDoc

Annotate FastString

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> FastString -> Annotated ()

Annotate (SourceText, FastString)

Defined in Language.Haskell.GHC.ExactPrint.Annotater

Methods

markAST :: SrcSpan -> (SourceText, FastString) -> Annotated ()

uniq :: FastString -> Int

unpackFS :: FastString -> String

Unpacks and decodes the FastString

mkFastString :: String -> FastString

Creates a UTF-8 encoded FastString from a String

fsLit :: String -> FastString

pprHsString :: FastString -> SDoc

Special combinator for showing string literals.

Fingerprint

data Fingerprint

Constructors

Fingerprint !Word64 !Word64

Instances

Eq Fingerprint

Since: base-4.4.0.0

Defined in GHC.Fingerprint.Type

Methods

(==) :: Fingerprint -> Fingerprint -> Bool

(/=) :: Fingerprint -> Fingerprint -> Bool

Ord Fingerprint

Since: base-4.4.0.0

Defined in GHC.Fingerprint.Type

Methods

compare :: Fingerprint -> Fingerprint -> Ordering

(<) :: Fingerprint -> Fingerprint -> Bool

(<=) :: Fingerprint -> Fingerprint -> Bool

(>) :: Fingerprint -> Fingerprint -> Bool

(>=) :: Fingerprint -> Fingerprint -> Bool

max :: Fingerprint -> Fingerprint -> Fingerprint

min :: Fingerprint -> Fingerprint -> Fingerprint

Show Fingerprint

Since: base-4.7.0.0

Defined in GHC.Fingerprint.Type

Methods

showsPrec :: Int -> Fingerprint -> ShowS

show :: Fingerprint -> String

showList :: [Fingerprint] -> ShowS

Hashable Fingerprint

Since: hashable-1.3.0.0

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Fingerprint -> Int

hash :: Fingerprint -> Int

Storable Fingerprint

Since: base-4.4.0.0

Defined in Foreign.Storable

Methods

sizeOf :: Fingerprint -> Int

alignment :: Fingerprint -> Int

peekElemOff :: Ptr Fingerprint -> Int -> IO Fingerprint

pokeElemOff :: Ptr Fingerprint -> Int -> Fingerprint -> IO ()

peekByteOff :: Ptr b -> Int -> IO Fingerprint

pokeByteOff :: Ptr b -> Int -> Fingerprint -> IO ()

peek :: Ptr Fingerprint -> IO Fingerprint

poke :: Ptr Fingerprint -> Fingerprint -> IO ()

Binary Fingerprint

Since: binary-0.7.6.0

Defined in Data.Binary.Class

Methods

put :: Fingerprint -> Put

get :: Get Fingerprint

putList :: [Fingerprint] -> Put

NFData Fingerprint

Since: deepseq-1.4.0.0

Defined in Control.DeepSeq

Methods

rnf :: Fingerprint -> ()

Outputable Fingerprint

Defined in Outputable

Methods

ppr :: Fingerprint -> SDoc

pprPrec :: Rational -> Fingerprint -> SDoc

getFileHash :: FilePath -> IO Fingerprint

Computes the hash of a given file. This function loops over the handle, running in constant memory.

Since: base-4.7.0.0

fingerprintData :: Ptr Word8 -> Int -> IO Fingerprint

fingerprintString :: String -> Fingerprint

fingerprintFingerprints :: [Fingerprint] -> Fingerprint

Unique

class Uniquable a

Class of things that we can obtain a Unique from

Minimal complete definition

getUnique

Instances

Uniquable Int

Defined in Unique

Methods

getUnique :: Int -> Unique

Uniquable EvBindsVar

Defined in TcEvidence

Methods

getUnique :: EvBindsVar -> Unique

Uniquable LocalReg

Defined in CmmExpr

Methods

getUnique :: LocalReg -> Unique

Uniquable Label

Defined in Hoopl.Label

Methods

getUnique :: Label -> Unique

Uniquable Class

Defined in Class

Methods

getUnique :: Class -> Unique

Uniquable CoAxiomRule

Defined in CoAxiom

Methods

getUnique :: CoAxiomRule -> Unique

Uniquable ConLike

Defined in ConLike

Methods

getUnique :: ConLike -> Unique

Uniquable DataCon

Defined in DataCon

Methods

getUnique :: DataCon -> Unique

Uniquable PatSyn

Defined in PatSyn

Methods

getUnique :: PatSyn -> Unique

Uniquable Var

Defined in Var

Methods

getUnique :: Var -> Unique

Uniquable SourcePackageId

Defined in PackageConfig

Methods

getUnique :: SourcePackageId -> Unique

Uniquable PackageName

Defined in PackageConfig

Methods

getUnique :: PackageName -> Unique

Uniquable Unique

Defined in Unique

Methods

getUnique :: Unique -> Unique

Uniquable Module

Defined in Module

Methods

getUnique :: Module -> Unique

Uniquable ModuleName

Defined in Module

Methods

getUnique :: ModuleName -> Unique

Uniquable UnitId

Defined in Module

Methods

getUnique :: UnitId -> Unique

Uniquable InstalledUnitId

Defined in Module

Methods

getUnique :: InstalledUnitId -> Unique

Uniquable ComponentId

Defined in Module

Methods

getUnique :: ComponentId -> Unique

Uniquable FastString

Defined in Unique

Methods

getUnique :: FastString -> Unique

Uniquable TyCon

Defined in TyCon

Methods

getUnique :: TyCon -> Unique

Uniquable OccName

Defined in OccName

Methods

getUnique :: OccName -> Unique

Uniquable Name

Defined in Name

Methods

getUnique :: Name -> Unique

Uniquable (CoAxiom br)

Defined in CoAxiom

Methods

getUnique :: CoAxiom br -> Unique

Uniquable name => Uniquable (AnnTarget name)

Defined in Annotations

Methods

getUnique :: AnnTarget name -> Unique

nonDetCmpUnique :: Unique -> Unique -> Ordering

getUnique :: Uniquable a => a -> Unique

data Unique

Unique identifier.

The type of unique identifiers that are used in many places in GHC for fast ordering and equality tests. You should generate these with the functions from the UniqSupply module

These are sometimes also referred to as "keys" in comments in GHC.

Instances

Eq Unique

Defined in Unique

Methods

(==) :: Unique -> Unique -> Bool

(/=) :: Unique -> Unique -> Bool

Show Unique

Defined in Unique

Methods

showsPrec :: Int -> Unique -> ShowS

show :: Unique -> String

showList :: [Unique] -> ShowS

Uniquable Unique

Defined in Unique

Methods

getUnique :: Unique -> Unique

Outputable Unique

Defined in Unique

Methods

ppr :: Unique -> SDoc

pprPrec :: Rational -> Unique -> SDoc

mkUnique :: Char -> Int -> Unique

newTagUnique :: Unique -> Char -> Unique

UniqDFM

emptyUDFM :: UniqDFM elt

plusUDFM :: UniqDFM elt -> UniqDFM elt -> UniqDFM elt

plusUDFM_C :: (elt -> elt -> elt) -> UniqDFM elt -> UniqDFM elt -> UniqDFM elt

String Buffer

data StringBuffer

A StringBuffer is an internal pointer to a sized chunk of bytes. The bytes are intended to be *immutable*. There are pure operations to read the contents of a StringBuffer.

A StringBuffer may have a finalizer, depending on how it was obtained.

Constructors

StringBuffer

Fields

• buf :: !(ForeignPtr Word8)
• len :: !Int
• cur :: !Int

Instances

Show StringBuffer

Defined in StringBuffer

Methods

showsPrec :: Int -> StringBuffer -> ShowS

show :: StringBuffer -> String

showList :: [StringBuffer] -> ShowS

NFData StringBuffer

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: StringBuffer -> ()

hGetStringBuffer :: FilePath -> IO StringBuffer

Read a file into a StringBuffer. The resulting buffer is automatically managed by the garbage collector.

stringToStringBuffer :: String -> StringBuffer

Encode a String into a StringBuffer as UTF-8. The resulting buffer is automatically managed by the garbage collector.

nextChar :: StringBuffer -> (Char, StringBuffer)

Return the first UTF-8 character of a nonempty StringBuffer and as well the remaining portion (analogous to uncons). Warning: The behavior is undefined if the StringBuffer is empty. The result shares the same buffer as the original. Similar to utf8DecodeChar, if the character cannot be decoded as UTF-8, '\0' is returned.

atEnd :: StringBuffer -> Bool

Check whether a StringBuffer is empty (analogous to null).

Char

is_ident :: Char -> Bool