Newer
Older
12001
12002
12003
12004
12005
12006
12007
12008
12009
12010
12011
12012
12013
12014
12015
12016
12017
12018
12019
12020
12021
12022
12023
12024
12025
12026
12027
12028
12029
12030
12031
12032
12033
12034
12035
12036
12037
12038
12039
12040
12041
12042
12043
12044
12045
12046
12047
12048
12049
12050
12051
12052
12053
12054
12055
12056
12057
12058
12059
12060
12061
12062
12063
12064
12065
12066
12067
12068
12069
12070
12071
12072
12073
12074
12075
12076
12077
12078
12079
12080
12081
12082
12083
12084
12085
12086
12087
12088
12089
12090
12091
12092
12093
12094
12095
12096
12097
12098
12099
12100
12101
12102
12103
12104
12105
12106
12107
12108
12109
12110
12111
12112
12113
12114
12115
12116
12117
12118
12119
12120
12121
12122
12123
12124
12125
12126
12127
12128
12129
12130
12131
12132
12133
12134
12135
12136
12137
12138
12139
12140
12141
12142
12143
12144
12145
12146
12147
12148
12149
12150
12151
12152
12153
12154
12155
12156
12157
12158
12159
12160
12161
12162
12163
12164
12165
12166
12167
12168
12169
12170
12171
12172
12173
12174
12175
12176
12177
12178
12179
12180
12181
12182
12183
12184
12185
12186
12187
12188
12189
12190
12191
12192
12193
12194
12195
12196
12197
12198
12199
12200
12201
12202
12203
12204
12205
12206
12207
12208
12209
12210
12211
12212
12213
12214
12215
12216
12217
12218
12219
12220
12221
12222
12223
12224
12225
12226
12227
12228
12229
12230
12231
12232
12233
12234
12235
12236
12237
12238
12239
12240
12241
12242
12243
12244
12245
12246
12247
12248
12249
12250
12251
12252
12253
12254
12255
12256
12257
12258
12259
12260
12261
12262
12263
12264
12265
12266
12267
12268
12269
12270
12271
12272
12273
12274
12275
12276
12277
12278
12279
12280
12281
12282
12283
12284
12285
12286
12287
12288
12289
12290
12291
12292
12293
12294
12295
12296
12297
12298
12299
12300
12301
12302
12303
12304
12305
12306
12307
12308
12309
12310
12311
12312
12313
12314
12315
12316
12317
12318
12319
12320
12321
12322
12323
12324
12325
12326
12327
12328
12329
12330
12331
12332
12333
12334
12335
12336
12337
12338
12339
12340
12341
12342
12343
12344
12345
12346
12347
12348
12349
12350
12351
12352
12353
12354
12355
12356
12357
12358
12359
12360
12361
12362
12363
12364
12365
12366
12367
12368
12369
12370
12371
12372
12373
12374
12375
12376
12377
12378
12379
12380
12381
12382
12383
12384
12385
12386
12387
12388
12389
12390
12391
12392
12393
12394
12395
12396
12397
12398
12399
12400
12401
12402
12403
12404
12405
12406
12407
12408
12409
12410
12411
12412
12413
12414
12415
12416
12417
12418
12419
12420
12421
12422
12423
12424
12425
12426
12427
12428
12429
12430
12431
12432
12433
12434
12435
12436
12437
12438
12439
12440
12441
12442
12443
12444
12445
12446
12447
12448
12449
12450
12451
12452
12453
12454
12455
12456
12457
12458
12459
12460
12461
12462
12463
12464
12465
12466
12467
12468
12469
12470
12471
12472
12473
12474
12475
12476
12477
12478
12479
12480
12481
12482
12483
12484
12485
12486
12487
12488
12489
12490
12491
12492
12493
12494
12495
12496
12497
12498
12499
12500
12501
12502
12503
12504
12505
12506
12507
12508
12509
12510
12511
12512
12513
12514
12515
12516
12517
12518
12519
12520
12521
12522
12523
12524
12525
12526
12527
12528
12529
12530
12531
12532
12533
12534
12535
12536
12537
12538
12539
12540
12541
12542
12543
12544
12545
12546
12547
12548
12549
12550
12551
12552
12553
12554
12555
12556
12557
12558
12559
12560
12561
12562
12563
12564
12565
12566
12567
12568
12569
12570
12571
12572
12573
12574
12575
12576
12577
12578
12579
12580
12581
12582
12583
12584
12585
12586
12587
12588
12589
12590
12591
12592
12593
12594
12595
12596
12597
12598
12599
12600
12601
12602
12603
12604
12605
12606
12607
12608
12609
12610
12611
12612
12613
12614
12615
12616
12617
12618
12619
12620
12621
12622
12623
12624
12625
12626
12627
12628
12629
12630
12631
12632
12633
12634
12635
12636
12637
12638
12639
12640
12641
12642
12643
12644
12645
12646
12647
12648
12649
12650
12651
12652
12653
12654
12655
12656
12657
12658
12659
12660
12661
12662
12663
12664
12665
12666
12667
12668
12669
12670
12671
12672
writeSTRef :: forall s a. STRef s a -> a -> GHC.ST.ST s ()
module GHC.Show where
-- Safety: Trustworthy
type Show :: * -> Constraint
class Show a where
showsPrec :: GHC.Types.Int -> a -> ShowS
show :: a -> GHC.Base.String
showList :: [a] -> ShowS
{-# MINIMAL showsPrec | show #-}
type ShowS :: *
type ShowS = GHC.Base.String -> GHC.Base.String
appPrec :: GHC.Types.Int
appPrec1 :: GHC.Types.Int
asciiTab :: [GHC.Base.String]
intToDigit :: GHC.Types.Int -> GHC.Types.Char
protectEsc :: (GHC.Types.Char -> GHC.Types.Bool) -> ShowS -> ShowS
showChar :: GHC.Types.Char -> ShowS
showCommaSpace :: ShowS
showList__ :: forall a. (a -> ShowS) -> [a] -> ShowS
showLitChar :: GHC.Types.Char -> ShowS
showLitString :: GHC.Base.String -> ShowS
showMultiLineString :: GHC.Base.String -> [GHC.Base.String]
showParen :: GHC.Types.Bool -> ShowS -> ShowS
showSignedInt :: GHC.Types.Int -> GHC.Types.Int -> ShowS
showSpace :: ShowS
showString :: GHC.Base.String -> ShowS
shows :: forall a. Show a => a -> ShowS
module GHC.Stable where
-- Safety: Unsafe
type StablePtr :: * -> *
data StablePtr a = StablePtr (GHC.Prim.StablePtr# a)
castPtrToStablePtr :: forall a. GHC.Ptr.Ptr () -> StablePtr a
castStablePtrToPtr :: forall a. StablePtr a -> GHC.Ptr.Ptr ()
deRefStablePtr :: forall a. StablePtr a -> GHC.Types.IO a
freeStablePtr :: forall a. StablePtr a -> GHC.Types.IO ()
newStablePtr :: forall a. a -> GHC.Types.IO (StablePtr a)
module GHC.StableName where
-- Safety: Trustworthy
type role StableName phantom
type StableName :: * -> *
data StableName a = StableName (GHC.Prim.StableName# a)
eqStableName :: forall a b. StableName a -> StableName b -> GHC.Types.Bool
hashStableName :: forall a. StableName a -> GHC.Types.Int
makeStableName :: forall a. a -> GHC.Types.IO (StableName a)
module GHC.Stack where
-- Safety: Trustworthy
type CallStack :: *
data CallStack = ...
type CostCentre :: *
data CostCentre
type CostCentreStack :: *
data CostCentreStack
type HasCallStack :: Constraint
type HasCallStack = ?callStack::CallStack :: Constraint
type SrcLoc :: *
data SrcLoc = SrcLoc {srcLocPackage :: [GHC.Types.Char], srcLocModule :: [GHC.Types.Char], srcLocFile :: [GHC.Types.Char], srcLocStartLine :: GHC.Types.Int, srcLocStartCol :: GHC.Types.Int, srcLocEndLine :: GHC.Types.Int, srcLocEndCol :: GHC.Types.Int}
callStack :: HasCallStack => CallStack
ccLabel :: GHC.Ptr.Ptr CostCentre -> GHC.Types.IO base-4.18.0.0:GHC.Foreign.Internal.CString
ccModule :: GHC.Ptr.Ptr CostCentre -> GHC.Types.IO base-4.18.0.0:GHC.Foreign.Internal.CString
ccSrcSpan :: GHC.Ptr.Ptr CostCentre -> GHC.Types.IO base-4.18.0.0:GHC.Foreign.Internal.CString
ccsCC :: GHC.Ptr.Ptr CostCentreStack -> GHC.Types.IO (GHC.Ptr.Ptr CostCentre)
ccsParent :: GHC.Ptr.Ptr CostCentreStack -> GHC.Types.IO (GHC.Ptr.Ptr CostCentreStack)
ccsToStrings :: GHC.Ptr.Ptr CostCentreStack -> GHC.Types.IO [GHC.Base.String]
clearCCS :: forall a. GHC.Types.IO a -> GHC.Types.IO a
currentCallStack :: GHC.Types.IO [GHC.Base.String]
emptyCallStack :: CallStack
errorWithStackTrace :: forall a. GHC.Base.String -> a
freezeCallStack :: CallStack -> CallStack
fromCallSiteList :: [([GHC.Types.Char], SrcLoc)] -> CallStack
getCCSOf :: forall a. a -> GHC.Types.IO (GHC.Ptr.Ptr CostCentreStack)
getCallStack :: CallStack -> [([GHC.Types.Char], SrcLoc)]
getCurrentCCS :: forall dummy. dummy -> GHC.Types.IO (GHC.Ptr.Ptr CostCentreStack)
popCallStack :: CallStack -> CallStack
prettyCallStack :: CallStack -> GHC.Base.String
prettySrcLoc :: SrcLoc -> GHC.Base.String
pushCallStack :: ([GHC.Types.Char], SrcLoc) -> CallStack -> CallStack
renderStack :: [GHC.Base.String] -> GHC.Base.String
whoCreated :: forall a. a -> GHC.Types.IO [GHC.Base.String]
withFrozenCallStack :: forall a. HasCallStack => (HasCallStack => a) -> a
module GHC.Stack.CCS where
-- Safety: Trustworthy
type CostCentre :: *
data CostCentre
type CostCentreStack :: *
data CostCentreStack
ccLabel :: GHC.Ptr.Ptr CostCentre -> GHC.Types.IO base-4.18.0.0:GHC.Foreign.Internal.CString
ccModule :: GHC.Ptr.Ptr CostCentre -> GHC.Types.IO base-4.18.0.0:GHC.Foreign.Internal.CString
ccSrcSpan :: GHC.Ptr.Ptr CostCentre -> GHC.Types.IO base-4.18.0.0:GHC.Foreign.Internal.CString
ccsCC :: GHC.Ptr.Ptr CostCentreStack -> GHC.Types.IO (GHC.Ptr.Ptr CostCentre)
ccsParent :: GHC.Ptr.Ptr CostCentreStack -> GHC.Types.IO (GHC.Ptr.Ptr CostCentreStack)
ccsToStrings :: GHC.Ptr.Ptr CostCentreStack -> GHC.Types.IO [GHC.Base.String]
clearCCS :: forall a. GHC.Types.IO a -> GHC.Types.IO a
currentCallStack :: GHC.Types.IO [GHC.Base.String]
getCCSOf :: forall a. a -> GHC.Types.IO (GHC.Ptr.Ptr CostCentreStack)
getCurrentCCS :: forall dummy. dummy -> GHC.Types.IO (GHC.Ptr.Ptr CostCentreStack)
renderStack :: [GHC.Base.String] -> GHC.Base.String
whoCreated :: forall a. a -> GHC.Types.IO [GHC.Base.String]
module GHC.Stack.CloneStack where
-- Safety: None
type StackEntry :: *
data StackEntry = StackEntry {functionName :: GHC.Base.String, moduleName :: GHC.Base.String, srcLoc :: GHC.Base.String, closureType :: GHC.Types.Word}
type StackSnapshot :: *
data StackSnapshot = StackSnapshot GHC.Prim.StackSnapshot#
cloneMyStack :: GHC.Types.IO StackSnapshot
cloneThreadStack :: GHC.Conc.Sync.ThreadId -> GHC.Types.IO StackSnapshot
decode :: StackSnapshot -> GHC.Types.IO [StackEntry]
module GHC.Stack.Types where
-- Safety: Trustworthy
type CallStack :: *
data CallStack = EmptyCallStack | PushCallStack [GHC.Types.Char] SrcLoc CallStack | FreezeCallStack CallStack
type HasCallStack :: Constraint
type HasCallStack = ?callStack::CallStack :: Constraint
type SrcLoc :: *
data SrcLoc = SrcLoc {srcLocPackage :: [GHC.Types.Char], srcLocModule :: [GHC.Types.Char], srcLocFile :: [GHC.Types.Char], srcLocStartLine :: GHC.Types.Int, srcLocStartCol :: GHC.Types.Int, srcLocEndLine :: GHC.Types.Int, srcLocEndCol :: GHC.Types.Int}
emptyCallStack :: CallStack
freezeCallStack :: CallStack -> CallStack
fromCallSiteList :: [([GHC.Types.Char], SrcLoc)] -> CallStack
getCallStack :: CallStack -> [([GHC.Types.Char], SrcLoc)]
pushCallStack :: ([GHC.Types.Char], SrcLoc) -> CallStack -> CallStack
module GHC.StaticPtr where
-- Safety: None
type IsStatic :: (* -> *) -> Constraint
class IsStatic p where
fromStaticPtr :: forall a. base-4.18.0.0:Data.Typeable.Internal.Typeable a => StaticPtr a -> p a
{-# MINIMAL fromStaticPtr #-}
type StaticKey :: *
type StaticKey = GHC.Fingerprint.Type.Fingerprint
type StaticPtr :: * -> *
data StaticPtr a = ...
type StaticPtrInfo :: *
data StaticPtrInfo = StaticPtrInfo {spInfoUnitId :: GHC.Base.String, spInfoModuleName :: GHC.Base.String, spInfoSrcLoc :: (GHC.Types.Int, GHC.Types.Int)}
deRefStaticPtr :: forall a. StaticPtr a -> a
staticKey :: forall a. StaticPtr a -> StaticKey
staticPtrInfo :: forall a. StaticPtr a -> StaticPtrInfo
staticPtrKeys :: GHC.Types.IO [StaticKey]
unsafeLookupStaticPtr :: forall a. StaticKey -> GHC.Types.IO (GHC.Maybe.Maybe (StaticPtr a))
module GHC.Stats where
-- Safety: Trustworthy
type GCDetails :: *
data GCDetails
= GCDetails {gcdetails_gen :: GHC.Word.Word32,
gcdetails_threads :: GHC.Word.Word32,
gcdetails_allocated_bytes :: GHC.Word.Word64,
gcdetails_live_bytes :: GHC.Word.Word64,
gcdetails_large_objects_bytes :: GHC.Word.Word64,
gcdetails_compact_bytes :: GHC.Word.Word64,
gcdetails_slop_bytes :: GHC.Word.Word64,
gcdetails_mem_in_use_bytes :: GHC.Word.Word64,
gcdetails_copied_bytes :: GHC.Word.Word64,
gcdetails_par_max_copied_bytes :: GHC.Word.Word64,
gcdetails_par_balanced_copied_bytes :: GHC.Word.Word64,
gcdetails_block_fragmentation_bytes :: GHC.Word.Word64,
gcdetails_sync_elapsed_ns :: RtsTime,
gcdetails_cpu_ns :: RtsTime,
gcdetails_elapsed_ns :: RtsTime,
gcdetails_nonmoving_gc_sync_cpu_ns :: RtsTime,
gcdetails_nonmoving_gc_sync_elapsed_ns :: RtsTime}
type RTSStats :: *
data RTSStats
= RTSStats {gcs :: GHC.Word.Word32,
major_gcs :: GHC.Word.Word32,
allocated_bytes :: GHC.Word.Word64,
max_live_bytes :: GHC.Word.Word64,
max_large_objects_bytes :: GHC.Word.Word64,
max_compact_bytes :: GHC.Word.Word64,
max_slop_bytes :: GHC.Word.Word64,
max_mem_in_use_bytes :: GHC.Word.Word64,
cumulative_live_bytes :: GHC.Word.Word64,
copied_bytes :: GHC.Word.Word64,
par_copied_bytes :: GHC.Word.Word64,
cumulative_par_max_copied_bytes :: GHC.Word.Word64,
cumulative_par_balanced_copied_bytes :: GHC.Word.Word64,
init_cpu_ns :: RtsTime,
init_elapsed_ns :: RtsTime,
mutator_cpu_ns :: RtsTime,
mutator_elapsed_ns :: RtsTime,
gc_cpu_ns :: RtsTime,
gc_elapsed_ns :: RtsTime,
cpu_ns :: RtsTime,
elapsed_ns :: RtsTime,
nonmoving_gc_sync_cpu_ns :: RtsTime,
nonmoving_gc_sync_elapsed_ns :: RtsTime,
nonmoving_gc_sync_max_elapsed_ns :: RtsTime,
nonmoving_gc_cpu_ns :: RtsTime,
nonmoving_gc_elapsed_ns :: RtsTime,
nonmoving_gc_max_elapsed_ns :: RtsTime,
gc :: GCDetails}
type RtsTime :: *
type RtsTime = GHC.Int.Int64
getRTSStats :: GHC.Types.IO RTSStats
getRTSStatsEnabled :: GHC.Types.IO GHC.Types.Bool
module GHC.Storable where
-- Safety: Trustworthy
readDoubleOffPtr :: GHC.Ptr.Ptr GHC.Types.Double -> GHC.Types.Int -> GHC.Types.IO GHC.Types.Double
readFloatOffPtr :: GHC.Ptr.Ptr GHC.Types.Float -> GHC.Types.Int -> GHC.Types.IO GHC.Types.Float
readFunPtrOffPtr :: forall a. GHC.Ptr.Ptr (GHC.Ptr.FunPtr a) -> GHC.Types.Int -> GHC.Types.IO (GHC.Ptr.FunPtr a)
readInt16OffPtr :: GHC.Ptr.Ptr GHC.Int.Int16 -> GHC.Types.Int -> GHC.Types.IO GHC.Int.Int16
readInt32OffPtr :: GHC.Ptr.Ptr GHC.Int.Int32 -> GHC.Types.Int -> GHC.Types.IO GHC.Int.Int32
readInt64OffPtr :: GHC.Ptr.Ptr GHC.Int.Int64 -> GHC.Types.Int -> GHC.Types.IO GHC.Int.Int64
readInt8OffPtr :: GHC.Ptr.Ptr GHC.Int.Int8 -> GHC.Types.Int -> GHC.Types.IO GHC.Int.Int8
readIntOffPtr :: GHC.Ptr.Ptr GHC.Types.Int -> GHC.Types.Int -> GHC.Types.IO GHC.Types.Int
readPtrOffPtr :: forall a. GHC.Ptr.Ptr (GHC.Ptr.Ptr a) -> GHC.Types.Int -> GHC.Types.IO (GHC.Ptr.Ptr a)
readStablePtrOffPtr :: forall a. GHC.Ptr.Ptr (GHC.Stable.StablePtr a) -> GHC.Types.Int -> GHC.Types.IO (GHC.Stable.StablePtr a)
readWideCharOffPtr :: GHC.Ptr.Ptr GHC.Types.Char -> GHC.Types.Int -> GHC.Types.IO GHC.Types.Char
readWord16OffPtr :: GHC.Ptr.Ptr GHC.Word.Word16 -> GHC.Types.Int -> GHC.Types.IO GHC.Word.Word16
readWord32OffPtr :: GHC.Ptr.Ptr GHC.Word.Word32 -> GHC.Types.Int -> GHC.Types.IO GHC.Word.Word32
readWord64OffPtr :: GHC.Ptr.Ptr GHC.Word.Word64 -> GHC.Types.Int -> GHC.Types.IO GHC.Word.Word64
readWord8OffPtr :: GHC.Ptr.Ptr GHC.Word.Word8 -> GHC.Types.Int -> GHC.Types.IO GHC.Word.Word8
readWordOffPtr :: GHC.Ptr.Ptr GHC.Types.Word -> GHC.Types.Int -> GHC.Types.IO GHC.Types.Word
writeDoubleOffPtr :: GHC.Ptr.Ptr GHC.Types.Double -> GHC.Types.Int -> GHC.Types.Double -> GHC.Types.IO ()
writeFloatOffPtr :: GHC.Ptr.Ptr GHC.Types.Float -> GHC.Types.Int -> GHC.Types.Float -> GHC.Types.IO ()
writeFunPtrOffPtr :: forall a. GHC.Ptr.Ptr (GHC.Ptr.FunPtr a) -> GHC.Types.Int -> GHC.Ptr.FunPtr a -> GHC.Types.IO ()
writeInt16OffPtr :: GHC.Ptr.Ptr GHC.Int.Int16 -> GHC.Types.Int -> GHC.Int.Int16 -> GHC.Types.IO ()
writeInt32OffPtr :: GHC.Ptr.Ptr GHC.Int.Int32 -> GHC.Types.Int -> GHC.Int.Int32 -> GHC.Types.IO ()
writeInt64OffPtr :: GHC.Ptr.Ptr GHC.Int.Int64 -> GHC.Types.Int -> GHC.Int.Int64 -> GHC.Types.IO ()
writeInt8OffPtr :: GHC.Ptr.Ptr GHC.Int.Int8 -> GHC.Types.Int -> GHC.Int.Int8 -> GHC.Types.IO ()
writeIntOffPtr :: GHC.Ptr.Ptr GHC.Types.Int -> GHC.Types.Int -> GHC.Types.Int -> GHC.Types.IO ()
writePtrOffPtr :: forall a. GHC.Ptr.Ptr (GHC.Ptr.Ptr a) -> GHC.Types.Int -> GHC.Ptr.Ptr a -> GHC.Types.IO ()
writeStablePtrOffPtr :: forall a. GHC.Ptr.Ptr (GHC.Stable.StablePtr a) -> GHC.Types.Int -> GHC.Stable.StablePtr a -> GHC.Types.IO ()
writeWideCharOffPtr :: GHC.Ptr.Ptr GHC.Types.Char -> GHC.Types.Int -> GHC.Types.Char -> GHC.Types.IO ()
writeWord16OffPtr :: GHC.Ptr.Ptr GHC.Word.Word16 -> GHC.Types.Int -> GHC.Word.Word16 -> GHC.Types.IO ()
writeWord32OffPtr :: GHC.Ptr.Ptr GHC.Word.Word32 -> GHC.Types.Int -> GHC.Word.Word32 -> GHC.Types.IO ()
writeWord64OffPtr :: GHC.Ptr.Ptr GHC.Word.Word64 -> GHC.Types.Int -> GHC.Word.Word64 -> GHC.Types.IO ()
writeWord8OffPtr :: GHC.Ptr.Ptr GHC.Word.Word8 -> GHC.Types.Int -> GHC.Word.Word8 -> GHC.Types.IO ()
writeWordOffPtr :: GHC.Ptr.Ptr GHC.Types.Word -> GHC.Types.Int -> GHC.Types.Word -> GHC.Types.IO ()
module GHC.TopHandler where
-- Safety: Trustworthy
flushStdHandles :: GHC.Types.IO ()
reportError :: GHC.Exception.Type.SomeException -> GHC.Types.IO ()
reportStackOverflow :: GHC.Types.IO ()
runIO :: forall a. GHC.Types.IO a -> GHC.Types.IO a
runIOFastExit :: forall a. GHC.Types.IO a -> GHC.Types.IO a
runMainIO :: forall a. GHC.Types.IO a -> GHC.Types.IO a
runNonIO :: forall a. a -> GHC.Types.IO a
topHandler :: forall a. GHC.Exception.Type.SomeException -> GHC.Types.IO a
topHandlerFastExit :: forall a. GHC.Exception.Type.SomeException -> GHC.Types.IO a
module GHC.TypeError where
-- Safety: Trustworthy
type Assert :: GHC.Types.Bool -> Constraint -> Constraint
type family Assert check errMsg where
forall (_1 :: Constraint). Assert GHC.Types.True _1 = () :: Constraint
forall (_1 :: GHC.Types.Bool) (errMsg :: Constraint). Assert _1 errMsg = errMsg
type ErrorMessage :: *
data ErrorMessage = Text GHC.Types.Symbol | forall t. ShowType t | ErrorMessage :<>: ErrorMessage | ErrorMessage :$$: ErrorMessage
type TypeError :: forall b. ErrorMessage -> b
type family TypeError a where
type Unsatisfiable :: ErrorMessage -> Constraint
class Unsatisfiable msg where
...
{-# MINIMAL GHC.TypeError.unsatisfiableLifted #-}
unsatisfiable :: forall {rep :: GHC.Types.RuntimeRep} (msg :: ErrorMessage) (a :: TYPE rep). Unsatisfiable msg => a
module GHC.TypeLits where
-- Safety: Trustworthy
type (*) :: Natural -> Natural -> Natural
type family (*) a b
type (+) :: Natural -> Natural -> Natural
type family (+) a b
type (-) :: Natural -> Natural -> Natural
type family (-) a b
type (<=) :: forall {t}. t -> t -> Constraint
type (<=) x y = GHC.TypeError.Assert (x <=? y) (Data.Type.Ord.LeErrMsg x y) :: Constraint
type (<=?) :: forall k. k -> k -> GHC.Types.Bool
type (<=?) m n = Data.Type.Ord.OrdCond (Data.Type.Ord.Compare m n) GHC.Types.True GHC.Types.True GHC.Types.False :: GHC.Types.Bool
type AppendSymbol :: Symbol -> Symbol -> Symbol
type family AppendSymbol a b
type CharToNat :: GHC.Types.Char -> Natural
type family CharToNat a
type CmpChar :: GHC.Types.Char -> GHC.Types.Char -> GHC.Types.Ordering
type family CmpChar a b
type CmpNat :: Natural -> Natural -> GHC.Types.Ordering
type family CmpNat a b
type CmpSymbol :: Symbol -> Symbol -> GHC.Types.Ordering
type family CmpSymbol a b
type ConsSymbol :: GHC.Types.Char -> Symbol -> Symbol
type family ConsSymbol a b
type Div :: Natural -> Natural -> Natural
type family Div a b
type ErrorMessage :: *
data ErrorMessage = Text Symbol | forall t. ShowType t | ErrorMessage :<>: ErrorMessage | ErrorMessage :$$: ErrorMessage
type KnownChar :: GHC.Types.Char -> Constraint
class KnownChar n where
charSing :: SChar n
{-# MINIMAL charSing #-}
type KnownNat :: Nat -> Constraint
class KnownNat n where
natSing :: SNat n
{-# MINIMAL natSing #-}
type KnownSymbol :: Symbol -> Constraint
class KnownSymbol n where
symbolSing :: SSymbol n
{-# MINIMAL symbolSing #-}
type Log2 :: Natural -> Natural
type family Log2 a
type Mod :: Natural -> Natural -> Natural
type family Mod a b
type Nat :: *
type Nat = Natural
type NatToChar :: Natural -> GHC.Types.Char
type family NatToChar a
type Natural :: *
data Natural = ...
type role OrderingI nominal nominal
type OrderingI :: forall {k}. k -> k -> *
data OrderingI a b where
LTI :: forall {k} (a :: k) (b :: k). (Data.Type.Ord.Compare a b ~ GHC.Types.LT) => OrderingI a b
EQI :: forall {k} (a :: k). (Data.Type.Ord.Compare a a ~ GHC.Types.EQ) => OrderingI a a
GTI :: forall {k} (a :: k) (b :: k). (Data.Type.Ord.Compare a b ~ GHC.Types.GT) => OrderingI a b
pattern SChar :: forall (c :: GHC.Types.Char). () => KnownChar c => SChar c
type role SChar nominal
type SChar :: GHC.Types.Char -> *
newtype SChar s = ...
pattern SNat :: forall (n :: Nat). () => KnownNat n => SNat n
type role SNat nominal
type SNat :: Nat -> *
newtype SNat n = ...
pattern SSymbol :: forall (s :: Symbol). () => KnownSymbol s => SSymbol s
type role SSymbol nominal
type SSymbol :: Symbol -> *
newtype SSymbol s = ...
type SomeChar :: *
data SomeChar = forall (n :: GHC.Types.Char). KnownChar n => SomeChar (Data.Proxy.Proxy n)
type SomeNat :: *
data SomeNat = forall (n :: Nat). KnownNat n => SomeNat (Data.Proxy.Proxy n)
type SomeSymbol :: *
data SomeSymbol = forall (n :: Symbol). KnownSymbol n => SomeSymbol (Data.Proxy.Proxy n)
type Symbol :: *
data Symbol
type TypeError :: forall b. ErrorMessage -> b
type family TypeError a where
type UnconsSymbol :: Symbol -> GHC.Maybe.Maybe (GHC.Types.Char, Symbol)
type family UnconsSymbol a
type (^) :: Natural -> Natural -> Natural
type family (^) a b
charVal :: forall (n :: GHC.Types.Char) (proxy :: GHC.Types.Char -> *). KnownChar n => proxy n -> GHC.Types.Char
charVal' :: forall (n :: GHC.Types.Char). KnownChar n => GHC.Prim.Proxy# n -> GHC.Types.Char
cmpChar :: forall (a :: GHC.Types.Char) (b :: GHC.Types.Char) (proxy1 :: GHC.Types.Char -> *) (proxy2 :: GHC.Types.Char -> *). (KnownChar a, KnownChar b) => proxy1 a -> proxy2 b -> OrderingI a b
cmpNat :: forall (a :: Nat) (b :: Nat) (proxy1 :: Nat -> *) (proxy2 :: Nat -> *). (KnownNat a, KnownNat b) => proxy1 a -> proxy2 b -> OrderingI a b
cmpSymbol :: forall (a :: Symbol) (b :: Symbol) (proxy1 :: Symbol -> *) (proxy2 :: Symbol -> *). (KnownSymbol a, KnownSymbol b) => proxy1 a -> proxy2 b -> OrderingI a b
decideChar :: forall (a :: GHC.Types.Char) (b :: GHC.Types.Char) (proxy1 :: GHC.Types.Char -> *) (proxy2 :: GHC.Types.Char -> *). (KnownChar a, KnownChar b) => proxy1 a -> proxy2 b -> Data.Either.Either ((a Data.Type.Equality.:~: b) -> GHC.Base.Void) (a Data.Type.Equality.:~: b)
decideNat :: forall (a :: Nat) (b :: Nat) (proxy1 :: Nat -> *) (proxy2 :: Nat -> *). (KnownNat a, KnownNat b) => proxy1 a -> proxy2 b -> Data.Either.Either ((a Data.Type.Equality.:~: b) -> GHC.Base.Void) (a Data.Type.Equality.:~: b)
decideSymbol :: forall (a :: Symbol) (b :: Symbol) (proxy1 :: Symbol -> *) (proxy2 :: Symbol -> *). (KnownSymbol a, KnownSymbol b) => proxy1 a -> proxy2 b -> Data.Either.Either ((a Data.Type.Equality.:~: b) -> GHC.Base.Void) (a Data.Type.Equality.:~: b)
fromSChar :: forall (c :: GHC.Types.Char). SChar c -> GHC.Types.Char
fromSNat :: forall (n :: Nat). SNat n -> GHC.Num.Integer.Integer
fromSSymbol :: forall (s :: Symbol). SSymbol s -> GHC.Base.String
natVal :: forall (n :: Nat) (proxy :: Nat -> *). KnownNat n => proxy n -> GHC.Num.Integer.Integer
natVal' :: forall (n :: Nat). KnownNat n => GHC.Prim.Proxy# n -> GHC.Num.Integer.Integer
sameChar :: forall (a :: GHC.Types.Char) (b :: GHC.Types.Char) (proxy1 :: GHC.Types.Char -> *) (proxy2 :: GHC.Types.Char -> *). (KnownChar a, KnownChar b) => proxy1 a -> proxy2 b -> GHC.Maybe.Maybe (a Data.Type.Equality.:~: b)
sameNat :: forall (a :: Nat) (b :: Nat) (proxy1 :: Nat -> *) (proxy2 :: Nat -> *). (KnownNat a, KnownNat b) => proxy1 a -> proxy2 b -> GHC.Maybe.Maybe (a Data.Type.Equality.:~: b)
sameSymbol :: forall (a :: Symbol) (b :: Symbol) (proxy1 :: Symbol -> *) (proxy2 :: Symbol -> *). (KnownSymbol a, KnownSymbol b) => proxy1 a -> proxy2 b -> GHC.Maybe.Maybe (a Data.Type.Equality.:~: b)
someCharVal :: GHC.Types.Char -> SomeChar
someNatVal :: GHC.Num.Integer.Integer -> GHC.Maybe.Maybe SomeNat
someSymbolVal :: GHC.Base.String -> SomeSymbol
symbolVal :: forall (n :: Symbol) (proxy :: Symbol -> *). KnownSymbol n => proxy n -> GHC.Base.String
symbolVal' :: forall (n :: Symbol). KnownSymbol n => GHC.Prim.Proxy# n -> GHC.Base.String
withKnownChar :: forall (c :: GHC.Types.Char) (rep :: GHC.Types.RuntimeRep) (r :: TYPE rep). SChar c -> (KnownChar c => r) -> r
withKnownNat :: forall (n :: Nat) (rep :: GHC.Types.RuntimeRep) (r :: TYPE rep). SNat n -> (KnownNat n => r) -> r
withKnownSymbol :: forall (s :: Symbol) (rep :: GHC.Types.RuntimeRep) (r :: TYPE rep). SSymbol s -> (KnownSymbol s => r) -> r
withSomeSChar :: forall (rep :: GHC.Types.RuntimeRep) (r :: TYPE rep). GHC.Types.Char -> (forall (c :: GHC.Types.Char). SChar c -> r) -> r
withSomeSNat :: forall (rep :: GHC.Types.RuntimeRep) (r :: TYPE rep). GHC.Num.Integer.Integer -> (forall (n :: Nat). GHC.Maybe.Maybe (SNat n) -> r) -> r
withSomeSSymbol :: forall (rep :: GHC.Types.RuntimeRep) (r :: TYPE rep). GHC.Base.String -> (forall (s :: Symbol). SSymbol s -> r) -> r
module GHC.TypeLits.Internal where
-- Safety: Trustworthy
type CmpChar :: GHC.Types.Char -> GHC.Types.Char -> GHC.Types.Ordering
type family CmpChar a b
type CmpSymbol :: Symbol -> Symbol -> GHC.Types.Ordering
type family CmpSymbol a b
type Symbol :: *
data Symbol
module GHC.TypeNats where
-- Safety: Trustworthy
type (*) :: Natural -> Natural -> Natural
type family (*) a b
type (+) :: Natural -> Natural -> Natural
type family (+) a b
type (-) :: Natural -> Natural -> Natural
type family (-) a b
type (<=) :: forall {t}. t -> t -> Constraint
type (<=) x y = GHC.TypeError.Assert (x <=? y) (Data.Type.Ord.LeErrMsg x y) :: Constraint
type (<=?) :: forall k. k -> k -> GHC.Types.Bool
type (<=?) m n = Data.Type.Ord.OrdCond (Data.Type.Ord.Compare m n) GHC.Types.True GHC.Types.True GHC.Types.False :: GHC.Types.Bool
type CmpNat :: Natural -> Natural -> GHC.Types.Ordering
type family CmpNat a b
type Div :: Natural -> Natural -> Natural
type family Div a b
type KnownNat :: Nat -> Constraint
class KnownNat n where
natSing :: SNat n
{-# MINIMAL natSing #-}
type Log2 :: Natural -> Natural
type family Log2 a
type Mod :: Natural -> Natural -> Natural
type family Mod a b
type Nat :: *
type Nat = Natural
type Natural :: *
data Natural = ...
pattern SNat :: forall (n :: Nat). () => KnownNat n => SNat n
type role SNat nominal
type SNat :: Nat -> *
newtype SNat n = ...
type SomeNat :: *
data SomeNat = forall (n :: Nat). KnownNat n => SomeNat (Data.Proxy.Proxy n)
type (^) :: Natural -> Natural -> Natural
type family (^) a b
cmpNat :: forall (a :: Nat) (b :: Nat) (proxy1 :: Nat -> *) (proxy2 :: Nat -> *). (KnownNat a, KnownNat b) => proxy1 a -> proxy2 b -> Data.Type.Ord.OrderingI a b
decideNat :: forall (a :: Nat) (b :: Nat) (proxy1 :: Nat -> *) (proxy2 :: Nat -> *). (KnownNat a, KnownNat b) => proxy1 a -> proxy2 b -> Data.Either.Either ((a Data.Type.Equality.:~: b) -> GHC.Base.Void) (a Data.Type.Equality.:~: b)
fromSNat :: forall (n :: Nat). SNat n -> Natural
natVal :: forall (n :: Nat) (proxy :: Nat -> *). KnownNat n => proxy n -> Natural
natVal' :: forall (n :: Nat). KnownNat n => GHC.Prim.Proxy# n -> Natural
sameNat :: forall (a :: Nat) (b :: Nat) (proxy1 :: Nat -> *) (proxy2 :: Nat -> *). (KnownNat a, KnownNat b) => proxy1 a -> proxy2 b -> GHC.Maybe.Maybe (a Data.Type.Equality.:~: b)
someNatVal :: Natural -> SomeNat
withKnownNat :: forall (n :: Nat) (rep :: GHC.Types.RuntimeRep) (r :: TYPE rep). SNat n -> (KnownNat n => r) -> r
withSomeSNat :: forall (rep :: GHC.Types.RuntimeRep) (r :: TYPE rep). Natural -> (forall (n :: Nat). SNat n -> r) -> r
module GHC.TypeNats.Internal where
-- Safety: Trustworthy
type CmpNat :: Natural -> Natural -> GHC.Types.Ordering
type family CmpNat a b
type Natural :: *
data Natural = ...
module GHC.Unicode where
-- Safety: Trustworthy
type GeneralCategory :: *
data GeneralCategory = UppercaseLetter | LowercaseLetter | TitlecaseLetter | ModifierLetter | OtherLetter | NonSpacingMark | SpacingCombiningMark | EnclosingMark | DecimalNumber | LetterNumber | OtherNumber | ConnectorPunctuation | DashPunctuation | OpenPunctuation | ClosePunctuation | InitialQuote | FinalQuote | OtherPunctuation | MathSymbol | CurrencySymbol | ModifierSymbol | OtherSymbol | Space | LineSeparator | ParagraphSeparator | Control | Format | Surrogate | PrivateUse | NotAssigned
generalCategory :: GHC.Types.Char -> GeneralCategory
isAlpha :: GHC.Types.Char -> GHC.Types.Bool
isAlphaNum :: GHC.Types.Char -> GHC.Types.Bool
isAscii :: GHC.Types.Char -> GHC.Types.Bool
isAsciiLower :: GHC.Types.Char -> GHC.Types.Bool
isAsciiUpper :: GHC.Types.Char -> GHC.Types.Bool
isControl :: GHC.Types.Char -> GHC.Types.Bool
isDigit :: GHC.Types.Char -> GHC.Types.Bool
isHexDigit :: GHC.Types.Char -> GHC.Types.Bool
isLatin1 :: GHC.Types.Char -> GHC.Types.Bool
isLower :: GHC.Types.Char -> GHC.Types.Bool
isLowerCase :: GHC.Types.Char -> GHC.Types.Bool
isOctDigit :: GHC.Types.Char -> GHC.Types.Bool
isPrint :: GHC.Types.Char -> GHC.Types.Bool
isPunctuation :: GHC.Types.Char -> GHC.Types.Bool
isSpace :: GHC.Types.Char -> GHC.Types.Bool
isSymbol :: GHC.Types.Char -> GHC.Types.Bool
isUpper :: GHC.Types.Char -> GHC.Types.Bool
isUpperCase :: GHC.Types.Char -> GHC.Types.Bool
toLower :: GHC.Types.Char -> GHC.Types.Char
toTitle :: GHC.Types.Char -> GHC.Types.Char
toUpper :: GHC.Types.Char -> GHC.Types.Char
unicodeVersion :: Data.Version.Version
module GHC.Weak where
-- Safety: Unsafe
type Weak :: * -> *
data Weak v = Weak (GHC.Prim.Weak# v)
deRefWeak :: forall v. Weak v -> GHC.Types.IO (GHC.Maybe.Maybe v)
finalize :: forall v. Weak v -> GHC.Types.IO ()
getFinalizerExceptionHandler :: GHC.Types.IO (GHC.Exception.Type.SomeException -> GHC.Types.IO ())
mkWeak :: forall k v. k -> v -> GHC.Maybe.Maybe (GHC.Types.IO ()) -> GHC.Types.IO (Weak v)
printToHandleFinalizerExceptionHandler :: GHC.IO.Handle.Types.Handle -> GHC.Exception.Type.SomeException -> GHC.Types.IO ()
setFinalizerExceptionHandler :: (GHC.Exception.Type.SomeException -> GHC.Types.IO ()) -> GHC.Types.IO ()
module GHC.Weak.Finalize where
-- Safety: Unsafe
getFinalizerExceptionHandler :: GHC.Types.IO (GHC.Exception.Type.SomeException -> GHC.Types.IO ())
printToHandleFinalizerExceptionHandler :: GHC.IO.Handle.Types.Handle -> GHC.Exception.Type.SomeException -> GHC.Types.IO ()
runFinalizerBatch :: GHC.Types.Int -> GHC.Prim.Array# (GHC.Prim.State# GHC.Prim.RealWorld -> GHC.Prim.State# GHC.Prim.RealWorld) -> GHC.Types.IO ()
setFinalizerExceptionHandler :: (GHC.Exception.Type.SomeException -> GHC.Types.IO ()) -> GHC.Types.IO ()
module GHC.Word where
-- Safety: Trustworthy
type Word :: *
data Word = W# GHC.Prim.Word#
type Word16 :: *
data Word16 = W16# GHC.Prim.Word16#
type Word32 :: *
data Word32 = W32# GHC.Prim.Word32#
type Word64 :: *
data Word64 = W64# GHC.Prim.Word64#
type Word8 :: *
data Word8 = W8# GHC.Prim.Word8#
bitReverse16 :: Word16 -> Word16
bitReverse32 :: Word32 -> Word32
bitReverse64 :: Word64 -> Word64
bitReverse8 :: Word8 -> Word8
byteSwap16 :: Word16 -> Word16
byteSwap32 :: Word32 -> Word32
byteSwap64 :: Word64 -> Word64
eqWord :: Word -> Word -> GHC.Types.Bool
eqWord16 :: Word16 -> Word16 -> GHC.Types.Bool
eqWord32 :: Word32 -> Word32 -> GHC.Types.Bool
eqWord64 :: Word64 -> Word64 -> GHC.Types.Bool
eqWord8 :: Word8 -> Word8 -> GHC.Types.Bool
geWord :: Word -> Word -> GHC.Types.Bool
geWord16 :: Word16 -> Word16 -> GHC.Types.Bool
geWord32 :: Word32 -> Word32 -> GHC.Types.Bool
geWord64 :: Word64 -> Word64 -> GHC.Types.Bool
geWord8 :: Word8 -> Word8 -> GHC.Types.Bool
gtWord :: Word -> Word -> GHC.Types.Bool
gtWord16 :: Word16 -> Word16 -> GHC.Types.Bool
gtWord32 :: Word32 -> Word32 -> GHC.Types.Bool
gtWord64 :: Word64 -> Word64 -> GHC.Types.Bool
gtWord8 :: Word8 -> Word8 -> GHC.Types.Bool
leWord :: Word -> Word -> GHC.Types.Bool
leWord16 :: Word16 -> Word16 -> GHC.Types.Bool
leWord32 :: Word32 -> Word32 -> GHC.Types.Bool
leWord64 :: Word64 -> Word64 -> GHC.Types.Bool
leWord8 :: Word8 -> Word8 -> GHC.Types.Bool
ltWord :: Word -> Word -> GHC.Types.Bool
ltWord16 :: Word16 -> Word16 -> GHC.Types.Bool
ltWord32 :: Word32 -> Word32 -> GHC.Types.Bool
ltWord64 :: Word64 -> Word64 -> GHC.Types.Bool
ltWord8 :: Word8 -> Word8 -> GHC.Types.Bool
neWord :: Word -> Word -> GHC.Types.Bool
neWord16 :: Word16 -> Word16 -> GHC.Types.Bool
neWord32 :: Word32 -> Word32 -> GHC.Types.Bool
neWord64 :: Word64 -> Word64 -> GHC.Types.Bool
neWord8 :: Word8 -> Word8 -> GHC.Types.Bool
uncheckedShiftL64# :: GHC.Prim.Word64# -> GHC.Prim.Int# -> GHC.Prim.Word64#
uncheckedShiftRL64# :: GHC.Prim.Word64# -> GHC.Prim.Int# -> GHC.Prim.Word64#
module Numeric where
-- Safety: Trustworthy
type Floating :: * -> Constraint
class GHC.Real.Fractional a => Floating a where
pi :: a
exp :: a -> a
log :: a -> a
sqrt :: a -> a
(**) :: a -> a -> a
logBase :: a -> a -> a
sin :: a -> a
cos :: a -> a
tan :: a -> a
asin :: a -> a
acos :: a -> a
atan :: a -> a
sinh :: a -> a
cosh :: a -> a
tanh :: a -> a
asinh :: a -> a
acosh :: a -> a
atanh :: a -> a
log1p :: a -> a
expm1 :: a -> a
log1pexp :: a -> a
log1mexp :: a -> a
{-# MINIMAL pi, exp, log, sin, cos, asin, acos, atan, sinh, cosh, asinh, acosh, atanh #-}
floatToDigits :: forall a. GHC.Float.RealFloat a => GHC.Num.Integer.Integer -> a -> ([GHC.Types.Int], GHC.Types.Int)
fromRat :: forall a. GHC.Float.RealFloat a => GHC.Real.Rational -> a
lexDigits :: Text.ParserCombinators.ReadP.ReadS GHC.Base.String
readBin :: forall a. (GHC.Classes.Eq a, GHC.Num.Num a) => Text.ParserCombinators.ReadP.ReadS a
readDec :: forall a. (GHC.Classes.Eq a, GHC.Num.Num a) => Text.ParserCombinators.ReadP.ReadS a
readFloat :: forall a. GHC.Real.RealFrac a => Text.ParserCombinators.ReadP.ReadS a
readHex :: forall a. (GHC.Classes.Eq a, GHC.Num.Num a) => Text.ParserCombinators.ReadP.ReadS a
readInt :: forall a. GHC.Num.Num a => a -> (GHC.Types.Char -> GHC.Types.Bool) -> (GHC.Types.Char -> GHC.Types.Int) -> Text.ParserCombinators.ReadP.ReadS a
readOct :: forall a. (GHC.Classes.Eq a, GHC.Num.Num a) => Text.ParserCombinators.ReadP.ReadS a
readSigned :: forall a. GHC.Real.Real a => Text.ParserCombinators.ReadP.ReadS a -> Text.ParserCombinators.ReadP.ReadS a
showBin :: forall a. GHC.Real.Integral a => a -> GHC.Show.ShowS
showEFloat :: forall a. GHC.Float.RealFloat a => GHC.Maybe.Maybe GHC.Types.Int -> a -> GHC.Show.ShowS
showFFloat :: forall a. GHC.Float.RealFloat a => GHC.Maybe.Maybe GHC.Types.Int -> a -> GHC.Show.ShowS
showFFloatAlt :: forall a. GHC.Float.RealFloat a => GHC.Maybe.Maybe GHC.Types.Int -> a -> GHC.Show.ShowS
showFloat :: forall a. GHC.Float.RealFloat a => a -> GHC.Show.ShowS
showGFloat :: forall a. GHC.Float.RealFloat a => GHC.Maybe.Maybe GHC.Types.Int -> a -> GHC.Show.ShowS
showGFloatAlt :: forall a. GHC.Float.RealFloat a => GHC.Maybe.Maybe GHC.Types.Int -> a -> GHC.Show.ShowS
showHFloat :: forall a. GHC.Float.RealFloat a => a -> GHC.Show.ShowS
showHex :: forall a. GHC.Real.Integral a => a -> GHC.Show.ShowS
showInt :: forall a. GHC.Real.Integral a => a -> GHC.Show.ShowS
showIntAtBase :: forall a. GHC.Real.Integral a => a -> (GHC.Types.Int -> GHC.Types.Char) -> a -> GHC.Show.ShowS
showOct :: forall a. GHC.Real.Integral a => a -> GHC.Show.ShowS
showSigned :: forall a. GHC.Real.Real a => (a -> GHC.Show.ShowS) -> GHC.Types.Int -> a -> GHC.Show.ShowS
module Numeric.Natural where
-- Safety: Trustworthy
type Natural :: *
data Natural = ...
minusNaturalMaybe :: Natural -> Natural -> GHC.Maybe.Maybe Natural
module Prelude where
-- Safety: Trustworthy
(!!) :: forall a. GHC.Stack.Types.HasCallStack => [a] -> Int -> a
($) :: forall (repa :: GHC.Types.RuntimeRep) (repb :: GHC.Types.RuntimeRep) (a :: TYPE repa) (b :: TYPE repb). (a -> b) -> a -> b
($!) :: forall (r :: GHC.Types.RuntimeRep) a (b :: TYPE r). (a -> b) -> a -> b
(&&) :: Bool -> Bool -> Bool
(++) :: forall a. [a] -> [a] -> [a]
(.) :: forall b c a. (b -> c) -> (a -> b) -> a -> c
(<$>) :: forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
(=<<) :: forall (m :: * -> *) a b. Monad m => (a -> m b) -> m a -> m b
type Applicative :: (* -> *) -> Constraint
class Functor f => Applicative f where
pure :: forall a. a -> f a
(<*>) :: forall a b. f (a -> b) -> f a -> f b
liftA2 :: forall a b c. (a -> b -> c) -> f a -> f b -> f c
(*>) :: forall a b. f a -> f b -> f b
(<*) :: forall a b. f a -> f b -> f a
{-# MINIMAL pure, ((<*>) | liftA2) #-}
type Bool :: *
data Bool = False | True
type Bounded :: * -> Constraint
class Bounded a where
minBound :: a
maxBound :: a
{-# MINIMAL minBound, maxBound #-}
type Char :: *
data Char = ...
type Double :: *
data Double = ...
type Either :: * -> * -> *
data Either a b = Left a | Right b
type Enum :: * -> Constraint
class Enum a where
succ :: a -> a
pred :: a -> a
toEnum :: Int -> a
fromEnum :: a -> Int
enumFrom :: a -> [a]
enumFromThen :: a -> a -> [a]
enumFromTo :: a -> a -> [a]
enumFromThenTo :: a -> a -> a -> [a]
{-# MINIMAL toEnum, fromEnum #-}
type Eq :: * -> Constraint
class Eq a where
(==) :: a -> a -> Bool
(/=) :: a -> a -> Bool
{-# MINIMAL (==) | (/=) #-}
type FilePath :: *
type FilePath = String
type Float :: *
data Float = ...
type Floating :: * -> Constraint
class Fractional a => Floating a where
pi :: a
exp :: a -> a
log :: a -> a
sqrt :: a -> a
(**) :: a -> a -> a
logBase :: a -> a -> a
sin :: a -> a
cos :: a -> a
tan :: a -> a
asin :: a -> a
acos :: a -> a
atan :: a -> a
sinh :: a -> a
cosh :: a -> a
tanh :: a -> a
asinh :: a -> a
acosh :: a -> a
atanh :: a -> a
...
{-# MINIMAL pi, exp, log, sin, cos, asin, acos, atan, sinh, cosh, asinh, acosh, atanh #-}
type Foldable :: (* -> *) -> Constraint
class Foldable t where
...
foldMap :: forall m a. Monoid m => (a -> m) -> t a -> m
...
foldr :: forall a b. (a -> b -> b) -> b -> t a -> b
...
foldl :: forall b a. (b -> a -> b) -> b -> t a -> b
foldl' :: forall b a. (b -> a -> b) -> b -> t a -> b
12674
12675
12676
12677
12678
12679
12680
12681
12682
12683
12684
12685
12686
12687
12688
12689
12690
12691
12692
12693
12694
12695
12696
12697
12698
12699
12700
12701
12702
12703
12704
12705
12706
12707
12708
12709
12710
12711
12712
12713
12714
12715
12716
12717
12718
12719
12720
12721
12722
12723
12724
12725
12726
12727
12728
12729
12730
12731
12732
12733
12734
12735
12736
12737
12738
12739
12740
12741
12742
12743
12744
12745
12746
12747
12748
12749
12750
12751
12752
12753
12754
12755
12756
12757
12758
12759
12760
12761
12762
12763
12764
12765
12766
12767
12768
12769
12770
12771
12772
12773
12774
12775
12776
12777
12778
12779
12780
12781
12782
12783
12784
12785
12786
12787
12788
12789
12790
12791
12792
12793
12794
12795
12796
12797
12798
12799
12800
12801
12802
12803
12804
12805
12806
12807
12808
12809
12810
12811
12812
12813
12814
12815
12816
12817
12818
12819
12820
12821
12822
12823
12824
12825
12826
12827
12828
12829
12830
12831
12832
12833
12834
12835
12836
12837
12838
12839
12840
12841
12842
12843
12844
12845
12846
12847
12848
12849
12850
12851
12852
12853
12854
12855
12856
12857
12858
12859
12860
12861
12862
12863
12864
12865
12866
12867
12868
12869
12870
12871
12872
12873
12874
12875
12876
12877
12878
12879
12880
12881
12882
12883
12884
12885
12886
12887
12888
12889
12890
12891
12892
12893
12894
12895
12896
12897
12898
12899
12900
12901
12902
12903
12904
12905
12906
12907
12908
12909
12910
12911
12912
12913
12914
12915
12916
12917
12918
12919
12920
12921
12922
12923
12924
12925
12926
12927
12928
12929
12930
12931
12932
12933
12934
12935
12936
12937
12938
12939
12940
12941
12942
12943
12944
12945
12946
12947
12948
12949
12950
12951
12952
12953
12954
12955
12956
12957
12958
12959
12960
12961
12962
12963
12964
12965
12966
12967
12968
12969
12970
12971
12972
12973
12974
12975
12976
12977
12978
12979
12980
12981
12982
12983
12984
12985
12986
12987
12988
12989
12990
12991
12992
12993
12994
12995
12996
12997
12998
12999
13000
foldr1 :: forall a. (a -> a -> a) -> t a -> a
foldl1 :: forall a. (a -> a -> a) -> t a -> a
...
null :: forall a. t a -> Bool
length :: forall a. t a -> Int
elem :: forall a. Eq a => a -> t a -> Bool
maximum :: forall a. Ord a => t a -> a
minimum :: forall a. Ord a => t a -> a
sum :: forall a. Num a => t a -> a
product :: forall a. Num a => t a -> a
{-# MINIMAL foldMap | foldr #-}
type Fractional :: * -> Constraint
class Num a => Fractional a where
(/) :: a -> a -> a
recip :: a -> a
fromRational :: Rational -> a
{-# MINIMAL fromRational, (recip | (/)) #-}
type Functor :: (* -> *) -> Constraint
class Functor f where
fmap :: forall a b. (a -> b) -> f a -> f b
(<$) :: forall a b. a -> f b -> f a
{-# MINIMAL fmap #-}
type IO :: * -> *
newtype IO a = ...
type IOError :: *
type IOError = GHC.IO.Exception.IOException
type Int :: *
data Int = ...
type Integer :: *
data Integer = ...
type Integral :: * -> Constraint
class (Real a, Enum a) => Integral a where
quot :: a -> a -> a
rem :: a -> a -> a
div :: a -> a -> a
mod :: a -> a -> a
quotRem :: a -> a -> (a, a)
divMod :: a -> a -> (a, a)
toInteger :: a -> Integer
{-# MINIMAL quotRem, toInteger #-}
type Maybe :: * -> *
data Maybe a = Nothing | Just a
type Monad :: (* -> *) -> Constraint
class Applicative m => Monad m where
(>>=) :: forall a b. m a -> (a -> m b) -> m b
(>>) :: forall a b. m a -> m b -> m b
return :: forall a. a -> m a
{-# MINIMAL (>>=) #-}
type MonadFail :: (* -> *) -> Constraint
class Monad m => MonadFail m where
fail :: forall a. String -> m a
{-# MINIMAL fail #-}
type Monoid :: * -> Constraint
class Semigroup a => Monoid a where
mempty :: a
mappend :: a -> a -> a
mconcat :: [a] -> a
{-# MINIMAL mempty | mconcat #-}
type Num :: * -> Constraint
class Num a where
(+) :: a -> a -> a
(-) :: a -> a -> a
(*) :: a -> a -> a
negate :: a -> a
abs :: a -> a
signum :: a -> a
fromInteger :: Integer -> a
{-# MINIMAL (+), (*), abs, signum, fromInteger, (negate | (-)) #-}
type Ord :: * -> Constraint
class Eq a => Ord a where
compare :: a -> a -> Ordering
(<) :: a -> a -> Bool
(<=) :: a -> a -> Bool
(>) :: a -> a -> Bool
(>=) :: a -> a -> Bool
max :: a -> a -> a
min :: a -> a -> a
{-# MINIMAL compare | (<=) #-}
type Ordering :: *
data Ordering = LT | EQ | GT
type Rational :: *
type Rational = GHC.Real.Ratio Integer
type Read :: * -> Constraint
class Read a where
readsPrec :: Int -> ReadS a
readList :: ReadS [a]
...
{-# MINIMAL readsPrec | GHC.Read.readPrec #-}
type ReadS :: * -> *
type ReadS a = String -> [(a, String)]
type Real :: * -> Constraint
class (Num a, Ord a) => Real a where
toRational :: a -> Rational
{-# MINIMAL toRational #-}
type RealFloat :: * -> Constraint
class (RealFrac a, Floating a) => RealFloat a where
floatRadix :: a -> Integer
floatDigits :: a -> Int
floatRange :: a -> (Int, Int)
decodeFloat :: a -> (Integer, Int)
encodeFloat :: Integer -> Int -> a
exponent :: a -> Int
significand :: a -> a
scaleFloat :: Int -> a -> a
isNaN :: a -> Bool
isInfinite :: a -> Bool
isDenormalized :: a -> Bool
isNegativeZero :: a -> Bool
isIEEE :: a -> Bool
atan2 :: a -> a -> a
{-# MINIMAL floatRadix, floatDigits, floatRange, decodeFloat, encodeFloat, isNaN, isInfinite, isDenormalized, isNegativeZero, isIEEE #-}
type RealFrac :: * -> Constraint
class (Real a, Fractional a) => RealFrac a where
properFraction :: forall b. Integral b => a -> (b, a)
truncate :: forall b. Integral b => a -> b
round :: forall b. Integral b => a -> b
ceiling :: forall b. Integral b => a -> b
floor :: forall b. Integral b => a -> b
{-# MINIMAL properFraction #-}
type Semigroup :: * -> Constraint
class Semigroup a where
(<>) :: a -> a -> a
...
{-# MINIMAL (<>) | GHC.Base.sconcat #-}
type Show :: * -> Constraint
class Show a where
showsPrec :: Int -> a -> ShowS
show :: a -> String
showList :: [a] -> ShowS
{-# MINIMAL showsPrec | show #-}
type ShowS :: *
type ShowS = String -> String
type String :: *
type String = [Char]
type Traversable :: (* -> *) -> Constraint
class (Functor t, Foldable t) => Traversable t where
traverse :: forall (f :: * -> *) a b. Applicative f => (a -> f b) -> t a -> f (t b)
sequenceA :: forall (f :: * -> *) a. Applicative f => t (f a) -> f (t a)
mapM :: forall (m :: * -> *) a b. Monad m => (a -> m b) -> t a -> m (t b)
sequence :: forall (m :: * -> *) a. Monad m => t (m a) -> m (t a)
{-# MINIMAL traverse | sequenceA #-}
type Word :: *
data Word = ...
(^) :: forall a b. (Num a, Integral b) => a -> b -> a
(^^) :: forall a b. (Fractional a, Integral b) => a -> b -> a
all :: forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
and :: forall (t :: * -> *). Foldable t => t Bool -> Bool
any :: forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
appendFile :: FilePath -> String -> IO ()
asTypeOf :: forall a. a -> a -> a
break :: forall a. (a -> Bool) -> [a] -> ([a], [a])
concat :: forall (t :: * -> *) a. Foldable t => t [a] -> [a]
concatMap :: forall (t :: * -> *) a b. Foldable t => (a -> [b]) -> t a -> [b]
const :: forall a b. a -> b -> a
curry :: forall a b c. ((a, b) -> c) -> a -> b -> c
cycle :: forall a. GHC.Stack.Types.HasCallStack => [a] -> [a]
drop :: forall a. Int -> [a] -> [a]
dropWhile :: forall a. (a -> Bool) -> [a] -> [a]
either :: forall a c b. (a -> c) -> (b -> c) -> Either a b -> c
error :: forall (r :: GHC.Types.RuntimeRep) (a :: TYPE r). GHC.Stack.Types.HasCallStack => [Char] -> a
errorWithoutStackTrace :: forall (r :: GHC.Types.RuntimeRep) (a :: TYPE r). [Char] -> a
even :: forall a. Integral a => a -> Bool
filter :: forall a. (a -> Bool) -> [a] -> [a]
flip :: forall a b c. (a -> b -> c) -> b -> a -> c
fromIntegral :: forall a b. (Integral a, Num b) => a -> b
fst :: forall a b. (a, b) -> a
gcd :: forall a. Integral a => a -> a -> a
getChar :: IO Char
getContents :: IO String
getLine :: IO String
head :: forall a. GHC.Stack.Types.HasCallStack => [a] -> a
id :: forall a. a -> a
init :: forall a. GHC.Stack.Types.HasCallStack => [a] -> [a]
interact :: (String -> String) -> IO ()
ioError :: forall a. IOError -> IO a
iterate :: forall a. (a -> a) -> a -> [a]
last :: forall a. GHC.Stack.Types.HasCallStack => [a] -> a
lcm :: forall a. Integral a => a -> a -> a
lex :: ReadS String
lines :: String -> [String]
lookup :: forall a b. Eq a => a -> [(a, b)] -> Maybe b
map :: forall a b. (a -> b) -> [a] -> [b]
mapM_ :: forall (t :: * -> *) (m :: * -> *) a b. (Foldable t, Monad m) => (a -> m b) -> t a -> m ()
maybe :: forall b a. b -> (a -> b) -> Maybe a -> b
not :: Bool -> Bool
notElem :: forall (t :: * -> *) a. (Foldable t, Eq a) => a -> t a -> Bool
odd :: forall a. Integral a => a -> Bool
or :: forall (t :: * -> *). Foldable t => t Bool -> Bool
otherwise :: Bool
print :: forall a. Show a => a -> IO ()
putChar :: Char -> IO ()
putStr :: String -> IO ()
putStrLn :: String -> IO ()
read :: forall a. Read a => String -> a
readFile :: FilePath -> IO String
readIO :: forall a. Read a => String -> IO a
readLn :: forall a. Read a => IO a
readParen :: forall a. Bool -> ReadS a -> ReadS a
reads :: forall a. Read a => ReadS a
realToFrac :: forall a b. (Real a, Fractional b) => a -> b
repeat :: forall a. a -> [a]
replicate :: forall a. Int -> a -> [a]
reverse :: forall a. [a] -> [a]
scanl :: forall b a. (b -> a -> b) -> b -> [a] -> [b]
scanl1 :: forall a. (a -> a -> a) -> [a] -> [a]
scanr :: forall a b. (a -> b -> b) -> b -> [a] -> [b]
scanr1 :: forall a. (a -> a -> a) -> [a] -> [a]
seq :: forall {r :: GHC.Types.RuntimeRep} a (b :: TYPE r). a -> b -> b
sequence_ :: forall (t :: * -> *) (m :: * -> *) a. (Foldable t, Monad m) => t (m a) -> m ()
showChar :: Char -> ShowS
showParen :: Bool -> ShowS -> ShowS
showString :: String -> ShowS
shows :: forall a. Show a => a -> ShowS
snd :: forall a b. (a, b) -> b
span :: forall a. (a -> Bool) -> [a] -> ([a], [a])
splitAt :: forall a. Int -> [a] -> ([a], [a])
subtract :: forall a. Num a => a -> a -> a
tail :: forall a. GHC.Stack.Types.HasCallStack => [a] -> [a]
take :: forall a. Int -> [a] -> [a]
takeWhile :: forall a. (a -> Bool) -> [a] -> [a]
uncurry :: forall a b c. (a -> b -> c) -> (a, b) -> c
undefined :: forall (r :: GHC.Types.RuntimeRep) (a :: TYPE r). GHC.Stack.Types.HasCallStack => a
unlines :: [String] -> String
until :: forall a. (a -> Bool) -> (a -> a) -> a -> a
unwords :: [String] -> String
unzip :: forall a b. [(a, b)] -> ([a], [b])
unzip3 :: forall a b c. [(a, b, c)] -> ([a], [b], [c])
userError :: String -> IOError
words :: String -> [String]
writeFile :: FilePath -> String -> IO ()
zip :: forall a b. [a] -> [b] -> [(a, b)]
zip3 :: forall a b c. [a] -> [b] -> [c] -> [(a, b, c)]
zipWith :: forall a b c. (a -> b -> c) -> [a] -> [b] -> [c]
zipWith3 :: forall a b c d. (a -> b -> c -> d) -> [a] -> [b] -> [c] -> [d]
(||) :: Bool -> Bool -> Bool
type (~) :: forall k. k -> k -> Constraint
class (a ~ b) => (~) a b
{-# MINIMAL #-}
module System.CPUTime where
-- Safety: Trustworthy
cpuTimePrecision :: GHC.Num.Integer.Integer
getCPUTime :: GHC.Types.IO GHC.Num.Integer.Integer
module System.Console.GetOpt where
-- Safety: Safe
type ArgDescr :: * -> *
data ArgDescr a = NoArg a | ReqArg (GHC.Base.String -> a) GHC.Base.String | OptArg (GHC.Maybe.Maybe GHC.Base.String -> a) GHC.Base.String
type ArgOrder :: * -> *
data ArgOrder a = RequireOrder | Permute | ReturnInOrder (GHC.Base.String -> a)
type OptDescr :: * -> *
data OptDescr a = Option [GHC.Types.Char] [GHC.Base.String] (ArgDescr a) GHC.Base.String
getOpt :: forall a. ArgOrder a -> [OptDescr a] -> [GHC.Base.String] -> ([a], [GHC.Base.String], [GHC.Base.String])
getOpt' :: forall a. ArgOrder a -> [OptDescr a] -> [GHC.Base.String] -> ([a], [GHC.Base.String], [GHC.Base.String], [GHC.Base.String])
usageInfo :: forall a. GHC.Base.String -> [OptDescr a] -> GHC.Base.String
module System.Environment where
-- Safety: Safe
executablePath :: GHC.Maybe.Maybe (GHC.Types.IO (GHC.Maybe.Maybe GHC.IO.FilePath))
getArgs :: GHC.Types.IO [GHC.Base.String]
getEnv :: GHC.Base.String -> GHC.Types.IO GHC.Base.String
getEnvironment :: GHC.Types.IO [(GHC.Base.String, GHC.Base.String)]
getExecutablePath :: GHC.Types.IO GHC.IO.FilePath
getProgName :: GHC.Types.IO GHC.Base.String
lookupEnv :: GHC.Base.String -> GHC.Types.IO (GHC.Maybe.Maybe GHC.Base.String)
setEnv :: GHC.Base.String -> GHC.Base.String -> GHC.Types.IO ()
unsetEnv :: GHC.Base.String -> GHC.Types.IO ()
withArgs :: forall a. [GHC.Base.String] -> GHC.Types.IO a -> GHC.Types.IO a
withProgName :: forall a. GHC.Base.String -> GHC.Types.IO a -> GHC.Types.IO a
module System.Environment.Blank where
-- Safety: Safe
getArgs :: GHC.Types.IO [GHC.Base.String]
getEnv :: GHC.Base.String -> GHC.Types.IO (GHC.Maybe.Maybe GHC.Base.String)
getEnvDefault :: GHC.Base.String -> GHC.Base.String -> GHC.Types.IO GHC.Base.String
getEnvironment :: GHC.Types.IO [(GHC.Base.String, GHC.Base.String)]
getExecutablePath :: GHC.Types.IO GHC.IO.FilePath
getProgName :: GHC.Types.IO GHC.Base.String
setEnv :: GHC.Base.String -> GHC.Base.String -> GHC.Types.Bool -> GHC.Types.IO ()
unsetEnv :: GHC.Base.String -> GHC.Types.IO ()
withArgs :: forall a. [GHC.Base.String] -> GHC.Types.IO a -> GHC.Types.IO a
withProgName :: forall a. GHC.Base.String -> GHC.Types.IO a -> GHC.Types.IO a
module System.Exit where
-- Safety: Trustworthy
type ExitCode :: *
data ExitCode = ExitSuccess | ExitFailure GHC.Types.Int
die :: forall a. GHC.Base.String -> GHC.Types.IO a
exitFailure :: forall a. GHC.Types.IO a
exitSuccess :: forall a. GHC.Types.IO a
exitWith :: forall a. ExitCode -> GHC.Types.IO a
module System.IO where
-- Safety: Trustworthy
type BufferMode :: *
data BufferMode = NoBuffering | LineBuffering | BlockBuffering (GHC.Maybe.Maybe GHC.Types.Int)
type FilePath :: *
type FilePath = GHC.Base.String
type Handle :: *
data Handle = ...
type HandlePosn :: *
data HandlePosn = ...
type IO :: * -> *
newtype IO a = ...
type IOMode :: *
data IOMode = ReadMode | WriteMode | AppendMode | ReadWriteMode
type Newline :: *
data Newline = LF | CRLF
type NewlineMode :: *
data NewlineMode = NewlineMode {inputNL :: Newline, outputNL :: Newline}
type SeekMode :: *
data SeekMode = AbsoluteSeek | RelativeSeek | SeekFromEnd
type TextEncoding :: *
data TextEncoding = ...
appendFile :: FilePath -> GHC.Base.String -> IO ()
char8 :: TextEncoding
fixIO :: forall a. (a -> IO a) -> IO a
getChar :: IO GHC.Types.Char
getContents :: IO GHC.Base.String
getContents' :: IO GHC.Base.String
getLine :: IO GHC.Base.String
hClose :: Handle -> IO ()
hFileSize :: Handle -> IO GHC.Num.Integer.Integer
hFlush :: Handle -> IO ()
hGetBuf :: forall a. Handle -> GHC.Ptr.Ptr a -> GHC.Types.Int -> IO GHC.Types.Int
hGetBufNonBlocking :: forall a. Handle -> GHC.Ptr.Ptr a -> GHC.Types.Int -> IO GHC.Types.Int
hGetBufSome :: forall a. Handle -> GHC.Ptr.Ptr a -> GHC.Types.Int -> IO GHC.Types.Int