ghc-9.6.1: The GHC API
Safe HaskellSafe-Inferred
LanguageHaskell2010

GHC.Data.FastString

Description

There are two principal string types used internally by GHC:

FastString
  • A compact, hash-consed, representation of character strings.
  • Generated by fsLit.
  • You can get a Unique from them.
  • Equality test is O(1) (it uses the Unique).
  • Comparison is O(1) or O(n):
  • O(n) but deterministic with lexical comparison (lexicalCompareFS)
  • O(1) but non-deterministic with Unique comparison (uniqCompareFS)
  • Turn into SDoc with ftext.
PtrString
  • Pointer and size of a Latin-1 encoded string.
  • Practically no operations.
  • Outputting them is fast.
  • Generated by mkPtrString#.
  • Length of string literals (mkPtrString# "abc"#) is computed statically
  • Turn into SDoc with ptext
  • Requires manual memory management. Improper use may lead to memory leaks or dangling pointers.
  • It assumes Latin-1 as the encoding, therefore it cannot represent arbitrary Unicode strings.

Use PtrString unless you want the facilities of FastString.

Synopsis

ByteString

bytesFS :: FastString -> ByteString Source #

Gives the Modified UTF-8 encoded bytes corresponding to a FastString

fastStringToByteString :: FastString -> ByteString Source #

Deprecated: Use bytesFS instead

Gives the Modified UTF-8 encoded bytes corresponding to a FastString

ShortByteString

FastZString

data FastZString Source #

Instances

Instances details
NFData FastZString Source # 
Instance details

Defined in GHC.Data.FastString

Methods

rnf :: FastZString -> () Source #

zStringTakeN :: Int -> FastZString -> String Source #

zStringTakeN n = take n . zString but is performed in \(O(\min(n,l))\) rather than \(O(l)\), where \(l\) is the length of the FastZString.

FastStrings

data FastString Source #

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.

Constructors

FastString 

Fields

Instances

Instances details
Data FastString Source # 
Instance details

Defined in GHC.Data.FastString

Methods

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

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

toConstr :: FastString -> Constr Source #

dataTypeOf :: FastString -> DataType Source #

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

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

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

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

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

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

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

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

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

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

IsString FastString Source # 
Instance details

Defined in GHC.Data.FastString

Monoid FastString Source # 
Instance details

Defined in GHC.Data.FastString

Semigroup FastString Source # 
Instance details

Defined in GHC.Data.FastString

Show FastString Source # 
Instance details

Defined in GHC.Data.FastString

NFData FastString Source # 
Instance details

Defined in GHC.Data.FastString

Methods

rnf :: FastString -> () Source #

ToJExpr FastString Source # 
Instance details

Defined in GHC.JS.Make

Uniquable FastString Source # 
Instance details

Defined in GHC.Types.Unique

Binary FastString Source # 
Instance details

Defined in GHC.Utils.Binary

Outputable FastString Source # 
Instance details

Defined in GHC.Utils.Outputable

Methods

ppr :: FastString -> SDoc Source #

Eq FastString Source # 
Instance details

Defined in GHC.Data.FastString

ToJExpr a => ToJExpr (UniqMap FastString a) Source # 
Instance details

Defined in GHC.JS.Make

type Anno FastString Source # 
Instance details

Defined in GHC.Hs.Expr

type Anno (SourceText, RuleName) Source # 
Instance details

Defined in GHC.Hs.Decls

newtype NonDetFastString Source #

Non-deterministic FastString

This is a simple FastString wrapper with an Ord instance using uniqCompareFS (i.e. which compares FastStrings on their Uniques). Hence it is not deterministic from one run to the other.

Instances

Instances details
Data NonDetFastString Source # 
Instance details

Defined in GHC.Data.FastString

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NonDetFastString -> c NonDetFastString Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c NonDetFastString Source #

toConstr :: NonDetFastString -> Constr Source #

dataTypeOf :: NonDetFastString -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c NonDetFastString) Source #

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

gmapT :: (forall b. Data b => b -> b) -> NonDetFastString -> NonDetFastString Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NonDetFastString -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NonDetFastString -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> NonDetFastString -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> NonDetFastString -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> NonDetFastString -> m NonDetFastString Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NonDetFastString -> m NonDetFastString Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NonDetFastString -> m NonDetFastString Source #

Show NonDetFastString Source # 
Instance details

Defined in GHC.Data.FastString

Binary NonDetFastString Source # 
Instance details

Defined in GHC.Utils.Binary

Outputable NonDetFastString Source # 
Instance details

Defined in GHC.Utils.Outputable

Eq NonDetFastString Source # 
Instance details

Defined in GHC.Data.FastString

Ord NonDetFastString Source # 
Instance details

Defined in GHC.Data.FastString

newtype LexicalFastString Source #

Lexical FastString

This is a simple FastString wrapper with an Ord instance using lexicalCompareFS (i.e. which compares FastStrings on their String representation). Hence it is deterministic from one run to the other.

Instances

Instances details
Data LexicalFastString Source # 
Instance details

Defined in GHC.Data.FastString

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> LexicalFastString -> c LexicalFastString Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c LexicalFastString Source #

toConstr :: LexicalFastString -> Constr Source #

dataTypeOf :: LexicalFastString -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c LexicalFastString) Source #

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

gmapT :: (forall b. Data b => b -> b) -> LexicalFastString -> LexicalFastString Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> LexicalFastString -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> LexicalFastString -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> LexicalFastString -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> LexicalFastString -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> LexicalFastString -> m LexicalFastString Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> LexicalFastString -> m LexicalFastString Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> LexicalFastString -> m LexicalFastString Source #

Show LexicalFastString Source # 
Instance details

Defined in GHC.Data.FastString

Binary LexicalFastString Source # 
Instance details

Defined in GHC.Utils.Binary

Outputable LexicalFastString Source # 
Instance details

Defined in GHC.Utils.Outputable

Eq LexicalFastString Source # 
Instance details

Defined in GHC.Data.FastString

Ord LexicalFastString Source # 
Instance details

Defined in GHC.Data.FastString

Construction

mkFastString :: String -> FastString Source #

Creates a UTF-8 encoded FastString from a String

mkFastStringByteList :: [Word8] -> FastString Source #

Creates a FastString from a UTF-8 encoded [Word8]

Deconstruction

unpackFS :: FastString -> String Source #

Lazily unpacks and decodes the FastString

Encoding

zEncodeFS :: FastString -> FastZString Source #

Returns a Z-encoded version of a FastString. This might be the original, if it was already Z-encoded. The first time this function is applied to a particular FastString, the results are memoized.

Operations

lengthFS :: FastString -> Int Source #

Returns the length of the FastString in characters

nullFS :: FastString -> Bool Source #

Returns True if the FastString is empty

lexicalCompareFS :: FastString -> FastString -> Ordering Source #

Compare FastString lexically

If you don't care about the lexical ordering, use uniqCompareFS instead.

uniqCompareFS :: FastString -> FastString -> Ordering Source #

Compare FastString by their Unique (not lexically).

Much cheaper than lexicalCompareFS but non-deterministic!

Outputting

hPutFS :: Handle -> FastString -> IO () Source #

Outputs a FastString with no decoding at all, that is, you get the actual bytes in the FastString written to the Handle.

Internal

PtrStrings

data PtrString Source #

A PtrString is a pointer to some array of Latin-1 encoded chars.

Constructors

PtrString !(Ptr Word8) !Int 

Construction

mkPtrString# :: Addr# -> PtrString Source #

Wrap an unboxed address into a PtrString.

Deconstruction

unpackPtrString :: PtrString -> String Source #

Decode a PtrString back into a String using Latin-1 encoding. This does not free the memory associated with PtrString.

unpackPtrStringTakeN :: Int -> PtrString -> String Source #

unpackPtrStringTakeN n = take n . unpackPtrString but is performed in \(O(\min(n,l))\) rather than \(O(l)\), where \(l\) is the length of the PtrString.

Operations

lengthPS :: PtrString -> Int Source #

Return the length of a PtrString