Newer
Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
module Control.Applicative where
-- Safety: Trustworthy
(<$) :: forall (f :: * -> *) a b. GHC.Base.Functor f => a -> f b -> f a
(<$>) :: forall (f :: * -> *) a b. GHC.Base.Functor f => (a -> b) -> f a -> f b
(<**>) :: forall (f :: * -> *) a b. Applicative f => f a -> f (a -> b) -> f b
type Alternative :: (* -> *) -> Constraint
class Applicative f => Alternative f where
empty :: forall a. f a
(<|>) :: forall a. f a -> f a -> f a
some :: forall a. f a -> f [a]
many :: forall a. f a -> f [a]
{-# MINIMAL empty, (<|>) #-}
type Applicative :: (* -> *) -> Constraint
class GHC.Base.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 role Const representational phantom
type Const :: forall {k}. * -> k -> *
newtype Const a b = Const {getConst :: a}
type role WrappedArrow representational nominal nominal
type WrappedArrow :: (* -> * -> *) -> * -> * -> *
newtype WrappedArrow a b c = WrapArrow {unwrapArrow :: a b c}
type role WrappedMonad representational nominal
type WrappedMonad :: (* -> *) -> * -> *
newtype WrappedMonad m a = WrapMonad {unwrapMonad :: m a}
type ZipList :: * -> *
newtype ZipList a = ZipList {getZipList :: [a]}
asum :: forall (t :: * -> *) (f :: * -> *) a. (Data.Foldable.Foldable t, Alternative f) => t (f a) -> f a
liftA :: forall (f :: * -> *) a b. Applicative f => (a -> b) -> f a -> f b
liftA3 :: forall (f :: * -> *) a b c d. Applicative f => (a -> b -> c -> d) -> f a -> f b -> f c -> f d
optional :: forall (f :: * -> *) a. Alternative f => f a -> f (GHC.Maybe.Maybe a)
module Control.Arrow where
-- Safety: Trustworthy
(<<<) :: forall {k} (cat :: k -> k -> *) (b :: k) (c :: k) (a :: k). Control.Category.Category cat => cat b c -> cat a b -> cat a c
(<<^) :: forall (a :: * -> * -> *) c d b. Arrow a => a c d -> (b -> c) -> a b d
(>>>) :: forall {k} (cat :: k -> k -> *) (a :: k) (b :: k) (c :: k). Control.Category.Category cat => cat a b -> cat b c -> cat a c
(>>^) :: forall (a :: * -> * -> *) b c d. Arrow a => a b c -> (c -> d) -> a b d
type Arrow :: (* -> * -> *) -> Constraint
class Control.Category.Category a => Arrow a where
arr :: forall b c. (b -> c) -> a b c
first :: forall b c d. a b c -> a (b, d) (c, d)
second :: forall b c d. a b c -> a (d, b) (d, c)
(***) :: forall b c b' c'. a b c -> a b' c' -> a (b, b') (c, c')
(&&&) :: forall b c c'. a b c -> a b c' -> a b (c, c')
{-# MINIMAL arr, (first | (***)) #-}
type ArrowApply :: (* -> * -> *) -> Constraint
class Arrow a => ArrowApply a where
app :: forall b c. a (a b c, b) c
{-# MINIMAL app #-}
type ArrowChoice :: (* -> * -> *) -> Constraint
class Arrow a => ArrowChoice a where
left :: forall b c d. a b c -> a (Data.Either.Either b d) (Data.Either.Either c d)
right :: forall b c d. a b c -> a (Data.Either.Either d b) (Data.Either.Either d c)
(+++) :: forall b c b' c'. a b c -> a b' c' -> a (Data.Either.Either b b') (Data.Either.Either c c')
(|||) :: forall b d c. a b d -> a c d -> a (Data.Either.Either b c) d
{-# MINIMAL (left | (+++)) #-}
type ArrowLoop :: (* -> * -> *) -> Constraint
class Arrow a => ArrowLoop a where
loop :: forall b d c. a (b, d) (c, d) -> a b c
{-# MINIMAL loop #-}
type role ArrowMonad representational nominal
type ArrowMonad :: (* -> * -> *) -> * -> *
newtype ArrowMonad a b = ArrowMonad (a () b)
type ArrowPlus :: (* -> * -> *) -> Constraint
class ArrowZero a => ArrowPlus a where
(<+>) :: forall b c. a b c -> a b c -> a b c
{-# MINIMAL (<+>) #-}
type ArrowZero :: (* -> * -> *) -> Constraint
class Arrow a => ArrowZero a where
zeroArrow :: forall b c. a b c
{-# MINIMAL zeroArrow #-}
type role Kleisli representational representational nominal
type Kleisli :: (* -> *) -> * -> * -> *
newtype Kleisli m a b = Kleisli {runKleisli :: a -> m b}
(^<<) :: forall (a :: * -> * -> *) c d b. Arrow a => (c -> d) -> a b c -> a b d
(^>>) :: forall (a :: * -> * -> *) b c d. Arrow a => (b -> c) -> a c d -> a b d
leftApp :: forall (a :: * -> * -> *) b c d. ArrowApply a => a b c -> a (Data.Either.Either b d) (Data.Either.Either c d)
returnA :: forall (a :: * -> * -> *) b. Arrow a => a b b
module Control.Category where
-- Safety: Trustworthy
(<<<) :: forall {k} (cat :: k -> k -> *) (b :: k) (c :: k) (a :: k). Category cat => cat b c -> cat a b -> cat a c
(>>>) :: forall {k} (cat :: k -> k -> *) (a :: k) (b :: k) (c :: k). Category cat => cat a b -> cat b c -> cat a c
type Category :: forall {k}. (k -> k -> *) -> Constraint
class Category cat where
id :: forall (a :: k). cat a a
(.) :: forall (b :: k) (c :: k) (a :: k). cat b c -> cat a b -> cat a c
{-# MINIMAL id, (.) #-}
module Control.Concurrent where
-- Safety: Trustworthy
type Chan :: * -> *
data Chan a = ...
type MVar :: * -> *
data MVar a = ...
type QSem :: *
newtype QSem = ...
type QSemN :: *
data QSemN = ...
type ThreadId :: *
data ThreadId = ...
addMVarFinalizer :: forall a. MVar a -> GHC.Types.IO () -> GHC.Types.IO ()
dupChan :: forall a. Chan a -> GHC.Types.IO (Chan a)
forkFinally :: forall a. GHC.Types.IO a -> (Data.Either.Either GHC.Exception.Type.SomeException a -> GHC.Types.IO ()) -> GHC.Types.IO ThreadId
forkIO :: GHC.Types.IO () -> GHC.Types.IO ThreadId
forkIOWithUnmask :: ((forall a. GHC.Types.IO a -> GHC.Types.IO a) -> GHC.Types.IO ()) -> GHC.Types.IO ThreadId
forkOS :: GHC.Types.IO () -> GHC.Types.IO ThreadId
forkOSWithUnmask :: ((forall a. GHC.Types.IO a -> GHC.Types.IO a) -> GHC.Types.IO ()) -> GHC.Types.IO ThreadId
forkOn :: GHC.Types.Int -> GHC.Types.IO () -> GHC.Types.IO ThreadId
forkOnWithUnmask :: GHC.Types.Int -> ((forall a. GHC.Types.IO a -> GHC.Types.IO a) -> GHC.Types.IO ()) -> GHC.Types.IO ThreadId
getChanContents :: forall a. Chan a -> GHC.Types.IO [a]
getNumCapabilities :: GHC.Types.IO GHC.Types.Int
isCurrentThreadBound :: GHC.Types.IO GHC.Types.Bool
isEmptyMVar :: forall a. MVar a -> GHC.Types.IO GHC.Types.Bool
killThread :: ThreadId -> GHC.Types.IO ()
mkWeakMVar :: forall a. MVar a -> GHC.Types.IO () -> GHC.Types.IO (GHC.Weak.Weak (MVar a))
mkWeakThreadId :: ThreadId -> GHC.Types.IO (GHC.Weak.Weak ThreadId)
modifyMVar :: forall a b. MVar a -> (a -> GHC.Types.IO (a, b)) -> GHC.Types.IO b
modifyMVarMasked :: forall a b. MVar a -> (a -> GHC.Types.IO (a, b)) -> GHC.Types.IO b
modifyMVarMasked_ :: forall a. MVar a -> (a -> GHC.Types.IO a) -> GHC.Types.IO ()
modifyMVar_ :: forall a. MVar a -> (a -> GHC.Types.IO a) -> GHC.Types.IO ()
myThreadId :: GHC.Types.IO ThreadId
newChan :: forall a. GHC.Types.IO (Chan a)
newEmptyMVar :: forall a. GHC.Types.IO (MVar a)
newMVar :: forall a. a -> GHC.Types.IO (MVar a)
newQSem :: GHC.Types.Int -> GHC.Types.IO QSem
newQSemN :: GHC.Types.Int -> GHC.Types.IO QSemN
putMVar :: forall a. MVar a -> a -> GHC.Types.IO ()
readChan :: forall a. Chan a -> GHC.Types.IO a
readMVar :: forall a. MVar a -> GHC.Types.IO a
rtsSupportsBoundThreads :: GHC.Types.Bool
runInBoundThread :: forall a. GHC.Types.IO a -> GHC.Types.IO a
runInUnboundThread :: forall a. GHC.Types.IO a -> GHC.Types.IO a
setNumCapabilities :: GHC.Types.Int -> GHC.Types.IO ()
signalQSem :: QSem -> GHC.Types.IO ()
signalQSemN :: QSemN -> GHC.Types.Int -> GHC.Types.IO ()
swapMVar :: forall a. MVar a -> a -> GHC.Types.IO a
takeMVar :: forall a. MVar a -> GHC.Types.IO a
threadCapability :: ThreadId -> GHC.Types.IO (GHC.Types.Int, GHC.Types.Bool)
threadDelay :: GHC.Types.Int -> GHC.Types.IO ()
threadWaitRead :: System.Posix.Types.Fd -> GHC.Types.IO ()
threadWaitReadSTM :: System.Posix.Types.Fd -> GHC.Types.IO (GHC.Conc.Sync.STM (), GHC.Types.IO ())
threadWaitWrite :: System.Posix.Types.Fd -> GHC.Types.IO ()
threadWaitWriteSTM :: System.Posix.Types.Fd -> GHC.Types.IO (GHC.Conc.Sync.STM (), GHC.Types.IO ())
throwTo :: forall e. GHC.Exception.Type.Exception e => ThreadId -> e -> GHC.Types.IO ()
tryPutMVar :: forall a. MVar a -> a -> GHC.Types.IO GHC.Types.Bool
tryReadMVar :: forall a. MVar a -> GHC.Types.IO (GHC.Maybe.Maybe a)
tryTakeMVar :: forall a. MVar a -> GHC.Types.IO (GHC.Maybe.Maybe a)
waitQSem :: QSem -> GHC.Types.IO ()
waitQSemN :: QSemN -> GHC.Types.Int -> GHC.Types.IO ()
withMVar :: forall a b. MVar a -> (a -> GHC.Types.IO b) -> GHC.Types.IO b
withMVarMasked :: forall a b. MVar a -> (a -> GHC.Types.IO b) -> GHC.Types.IO b
writeChan :: forall a. Chan a -> a -> GHC.Types.IO ()
writeList2Chan :: forall a. Chan a -> [a] -> GHC.Types.IO ()
yield :: GHC.Types.IO ()
module Control.Concurrent.Chan where
-- Safety: Trustworthy
type Chan :: * -> *
data Chan a = ...
dupChan :: forall a. Chan a -> GHC.Types.IO (Chan a)
getChanContents :: forall a. Chan a -> GHC.Types.IO [a]
newChan :: forall a. GHC.Types.IO (Chan a)
readChan :: forall a. Chan a -> GHC.Types.IO a
writeChan :: forall a. Chan a -> a -> GHC.Types.IO ()
writeList2Chan :: forall a. Chan a -> [a] -> GHC.Types.IO ()
module Control.Concurrent.MVar where
-- Safety: Trustworthy
type MVar :: * -> *
data MVar a = ...
addMVarFinalizer :: forall a. MVar a -> GHC.Types.IO () -> GHC.Types.IO ()
isEmptyMVar :: forall a. MVar a -> GHC.Types.IO GHC.Types.Bool
mkWeakMVar :: forall a. MVar a -> GHC.Types.IO () -> GHC.Types.IO (GHC.Weak.Weak (MVar a))
modifyMVar :: forall a b. MVar a -> (a -> GHC.Types.IO (a, b)) -> GHC.Types.IO b
modifyMVarMasked :: forall a b. MVar a -> (a -> GHC.Types.IO (a, b)) -> GHC.Types.IO b
modifyMVarMasked_ :: forall a. MVar a -> (a -> GHC.Types.IO a) -> GHC.Types.IO ()
modifyMVar_ :: forall a. MVar a -> (a -> GHC.Types.IO a) -> GHC.Types.IO ()
newEmptyMVar :: forall a. GHC.Types.IO (MVar a)
newMVar :: forall a. a -> GHC.Types.IO (MVar a)
putMVar :: forall a. MVar a -> a -> GHC.Types.IO ()
readMVar :: forall a. MVar a -> GHC.Types.IO a
swapMVar :: forall a. MVar a -> a -> GHC.Types.IO a
takeMVar :: forall a. MVar a -> GHC.Types.IO a
tryPutMVar :: forall a. MVar a -> a -> GHC.Types.IO GHC.Types.Bool
tryReadMVar :: forall a. MVar a -> GHC.Types.IO (GHC.Maybe.Maybe a)
tryTakeMVar :: forall a. MVar a -> GHC.Types.IO (GHC.Maybe.Maybe a)
withMVar :: forall a b. MVar a -> (a -> GHC.Types.IO b) -> GHC.Types.IO b
withMVarMasked :: forall a b. MVar a -> (a -> GHC.Types.IO b) -> GHC.Types.IO b
module Control.Concurrent.QSem where
-- Safety: Safe
type QSem :: *
newtype QSem = ...
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
newQSem :: GHC.Types.Int -> GHC.Types.IO QSem
signalQSem :: QSem -> GHC.Types.IO ()
waitQSem :: QSem -> GHC.Types.IO ()
module Control.Concurrent.QSemN where
-- Safety: Trustworthy
type QSemN :: *
data QSemN = ...
newQSemN :: GHC.Types.Int -> GHC.Types.IO QSemN
signalQSemN :: QSemN -> GHC.Types.Int -> GHC.Types.IO ()
waitQSemN :: QSemN -> GHC.Types.Int -> GHC.Types.IO ()
module Control.Exception where
-- Safety: Trustworthy
type AllocationLimitExceeded :: *
data AllocationLimitExceeded = AllocationLimitExceeded
type ArithException :: *
data ArithException = Overflow | Underflow | LossOfPrecision | DivideByZero | Denormal | RatioZeroDenominator
type ArrayException :: *
data ArrayException = IndexOutOfBounds GHC.Base.String | UndefinedElement GHC.Base.String
type AssertionFailed :: *
newtype AssertionFailed = AssertionFailed GHC.Base.String
type AsyncException :: *
data AsyncException = StackOverflow | HeapOverflow | ThreadKilled | UserInterrupt
type BlockedIndefinitelyOnMVar :: *
data BlockedIndefinitelyOnMVar = BlockedIndefinitelyOnMVar
type BlockedIndefinitelyOnSTM :: *
data BlockedIndefinitelyOnSTM = BlockedIndefinitelyOnSTM
type CompactionFailed :: *
newtype CompactionFailed = CompactionFailed GHC.Base.String
type Deadlock :: *
data Deadlock = Deadlock
pattern ErrorCall :: GHC.Base.String -> ErrorCall
type ErrorCall :: *
data ErrorCall = ErrorCallWithLocation GHC.Base.String GHC.Base.String
type Exception :: * -> Constraint
class (ghc-internal-0.1.0.0:Data.Typeable.Internal.Typeable e, GHC.Show.Show e) => Exception e where
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
toException :: e -> SomeException
fromException :: SomeException -> GHC.Maybe.Maybe e
displayException :: e -> GHC.Base.String
{-# MINIMAL #-}
type Handler :: * -> *
data Handler a = forall e. Exception e => Handler (e -> GHC.Types.IO a)
type IOException :: *
data IOException = ...
type MaskingState :: *
data MaskingState = Unmasked | MaskedInterruptible | MaskedUninterruptible
type NestedAtomically :: *
data NestedAtomically = NestedAtomically
type NoMethodError :: *
newtype NoMethodError = NoMethodError GHC.Base.String
type NonTermination :: *
data NonTermination = NonTermination
type PatternMatchFail :: *
newtype PatternMatchFail = PatternMatchFail GHC.Base.String
type RecConError :: *
newtype RecConError = RecConError GHC.Base.String
type RecSelError :: *
newtype RecSelError = RecSelError GHC.Base.String
type RecUpdError :: *
newtype RecUpdError = RecUpdError GHC.Base.String
type SomeAsyncException :: *
data SomeAsyncException = forall e. Exception e => SomeAsyncException e
type SomeException :: *
data SomeException = forall e. Exception e => SomeException e
type TypeError :: *
newtype TypeError = TypeError GHC.Base.String
allowInterrupt :: GHC.Types.IO ()
assert :: forall a. GHC.Types.Bool -> a -> a
asyncExceptionFromException :: forall e. Exception e => SomeException -> GHC.Maybe.Maybe e
asyncExceptionToException :: forall e. Exception e => e -> SomeException
bracket :: forall a b c. GHC.Types.IO a -> (a -> GHC.Types.IO b) -> (a -> GHC.Types.IO c) -> GHC.Types.IO c
bracketOnError :: forall a b c. GHC.Types.IO a -> (a -> GHC.Types.IO b) -> (a -> GHC.Types.IO c) -> GHC.Types.IO c
bracket_ :: forall a b c. GHC.Types.IO a -> GHC.Types.IO b -> GHC.Types.IO c -> GHC.Types.IO c
catch :: forall e a. Exception e => GHC.Types.IO a -> (e -> GHC.Types.IO a) -> GHC.Types.IO a
catchJust :: forall e b a. Exception e => (e -> GHC.Maybe.Maybe b) -> GHC.Types.IO a -> (b -> GHC.Types.IO a) -> GHC.Types.IO a
catches :: forall a. GHC.Types.IO a -> [Handler a] -> GHC.Types.IO a
evaluate :: forall a. a -> GHC.Types.IO a
finally :: forall a b. GHC.Types.IO a -> GHC.Types.IO b -> GHC.Types.IO a
getMaskingState :: GHC.Types.IO MaskingState
handle :: forall e a. Exception e => (e -> GHC.Types.IO a) -> GHC.Types.IO a -> GHC.Types.IO a
handleJust :: forall e b a. Exception e => (e -> GHC.Maybe.Maybe b) -> (b -> GHC.Types.IO a) -> GHC.Types.IO a -> GHC.Types.IO a
interruptible :: forall a. GHC.Types.IO a -> GHC.Types.IO a
ioError :: forall a. GHC.IO.Exception.IOError -> GHC.Types.IO a
mapException :: forall e1 e2 a. (Exception e1, Exception e2) => (e1 -> e2) -> a -> a
mask :: forall b. ((forall a. GHC.Types.IO a -> GHC.Types.IO a) -> GHC.Types.IO b) -> GHC.Types.IO b
mask_ :: forall a. GHC.Types.IO a -> GHC.Types.IO a
onException :: forall a b. GHC.Types.IO a -> GHC.Types.IO b -> GHC.Types.IO a
throw :: forall (r :: GHC.Types.RuntimeRep) (a :: TYPE r) e. Exception e => e -> a
throwIO :: forall e a. Exception e => e -> GHC.Types.IO a
throwTo :: forall e. Exception e => GHC.Conc.Sync.ThreadId -> e -> GHC.Types.IO ()
try :: forall e a. Exception e => GHC.Types.IO a -> GHC.Types.IO (Data.Either.Either e a)
tryJust :: forall e b a. Exception e => (e -> GHC.Maybe.Maybe b) -> GHC.Types.IO a -> GHC.Types.IO (Data.Either.Either b a)
uninterruptibleMask :: forall b. ((forall a. GHC.Types.IO a -> GHC.Types.IO a) -> GHC.Types.IO b) -> GHC.Types.IO b
uninterruptibleMask_ :: forall a. GHC.Types.IO a -> GHC.Types.IO a
module Control.Exception.Base where
-- Safety: Trustworthy
type AllocationLimitExceeded :: *
data AllocationLimitExceeded = AllocationLimitExceeded
type ArithException :: *
data ArithException = Overflow | Underflow | LossOfPrecision | DivideByZero | Denormal | RatioZeroDenominator
type ArrayException :: *
data ArrayException = IndexOutOfBounds GHC.Base.String | UndefinedElement GHC.Base.String
type AssertionFailed :: *
newtype AssertionFailed = AssertionFailed GHC.Base.String
type AsyncException :: *
data AsyncException = StackOverflow | HeapOverflow | ThreadKilled | UserInterrupt
type BlockedIndefinitelyOnMVar :: *
data BlockedIndefinitelyOnMVar = BlockedIndefinitelyOnMVar
type BlockedIndefinitelyOnSTM :: *
data BlockedIndefinitelyOnSTM = BlockedIndefinitelyOnSTM
type CompactionFailed :: *
newtype CompactionFailed = CompactionFailed GHC.Base.String
type Deadlock :: *
data Deadlock = Deadlock
pattern ErrorCall :: GHC.Base.String -> ErrorCall
type ErrorCall :: *
data ErrorCall = ErrorCallWithLocation GHC.Base.String GHC.Base.String
type Exception :: * -> Constraint
class (ghc-internal-0.1.0.0:Data.Typeable.Internal.Typeable e, GHC.Show.Show e) => Exception e where
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
toException :: e -> SomeException
fromException :: SomeException -> GHC.Maybe.Maybe e
displayException :: e -> GHC.Base.String
{-# MINIMAL #-}
type FixIOException :: *
data FixIOException = FixIOException
type IOException :: *
data IOException = ...
type MaskingState :: *
data MaskingState = Unmasked | MaskedInterruptible | MaskedUninterruptible
type NestedAtomically :: *
data NestedAtomically = NestedAtomically
type NoMatchingContinuationPrompt :: *
data NoMatchingContinuationPrompt = NoMatchingContinuationPrompt
type NoMethodError :: *
newtype NoMethodError = NoMethodError GHC.Base.String
type NonTermination :: *
data NonTermination = NonTermination
type PatternMatchFail :: *
newtype PatternMatchFail = PatternMatchFail GHC.Base.String
type RecConError :: *
newtype RecConError = RecConError GHC.Base.String
type RecSelError :: *
newtype RecSelError = RecSelError GHC.Base.String
type RecUpdError :: *
newtype RecUpdError = RecUpdError GHC.Base.String
type SomeAsyncException :: *
data SomeAsyncException = forall e. Exception e => SomeAsyncException e
type SomeException :: *
data SomeException = forall e. Exception e => SomeException e
type TypeError :: *
newtype TypeError = TypeError GHC.Base.String
assert :: forall a. GHC.Types.Bool -> a -> a
asyncExceptionFromException :: forall e. Exception e => SomeException -> GHC.Maybe.Maybe e
asyncExceptionToException :: forall e. Exception e => e -> SomeException
bracket :: forall a b c. GHC.Types.IO a -> (a -> GHC.Types.IO b) -> (a -> GHC.Types.IO c) -> GHC.Types.IO c
bracketOnError :: forall a b c. GHC.Types.IO a -> (a -> GHC.Types.IO b) -> (a -> GHC.Types.IO c) -> GHC.Types.IO c
bracket_ :: forall a b c. GHC.Types.IO a -> GHC.Types.IO b -> GHC.Types.IO c -> GHC.Types.IO c
catch :: forall e a. Exception e => GHC.Types.IO a -> (e -> GHC.Types.IO a) -> GHC.Types.IO a
catchJust :: forall e b a. Exception e => (e -> GHC.Maybe.Maybe b) -> GHC.Types.IO a -> (b -> GHC.Types.IO a) -> GHC.Types.IO a
evaluate :: forall a. a -> GHC.Types.IO a
finally :: forall a b. GHC.Types.IO a -> GHC.Types.IO b -> GHC.Types.IO a
getMaskingState :: GHC.Types.IO MaskingState
handle :: forall e a. Exception e => (e -> GHC.Types.IO a) -> GHC.Types.IO a -> GHC.Types.IO a
handleJust :: forall e b a. Exception e => (e -> GHC.Maybe.Maybe b) -> (b -> GHC.Types.IO a) -> GHC.Types.IO a -> GHC.Types.IO a
impossibleConstraintError :: forall (q :: GHC.Types.RuntimeRep) (a :: GHC.Prim.CONSTRAINT q). GHC.Prim.Addr# -=> a
impossibleError :: forall (q :: GHC.Types.RuntimeRep) (a :: TYPE q). GHC.Prim.Addr# -> a
ioError :: forall a. GHC.IO.Exception.IOError -> GHC.Types.IO a
mapException :: forall e1 e2 a. (Exception e1, Exception e2) => (e1 -> e2) -> a -> a
mask :: forall b. ((forall a. GHC.Types.IO a -> GHC.Types.IO a) -> GHC.Types.IO b) -> GHC.Types.IO b
mask_ :: forall a. GHC.Types.IO a -> GHC.Types.IO a
nestedAtomically :: SomeException
noMatchingContinuationPrompt :: SomeException
noMethodBindingError :: forall (q :: GHC.Types.RuntimeRep) (a :: TYPE q). GHC.Prim.Addr# -> a
nonExhaustiveGuardsError :: forall (q :: GHC.Types.RuntimeRep) (a :: TYPE q). GHC.Prim.Addr# -> a
nonTermination :: SomeException
onException :: forall a b. GHC.Types.IO a -> GHC.Types.IO b -> GHC.Types.IO a
patError :: forall (q :: GHC.Types.RuntimeRep) (a :: TYPE q). GHC.Prim.Addr# -> a
recConError :: forall (q :: GHC.Types.RuntimeRep) (a :: TYPE q). GHC.Prim.Addr# -> a
recSelError :: forall (q :: GHC.Types.RuntimeRep) (a :: TYPE q). GHC.Prim.Addr# -> a
throw :: forall (r :: GHC.Types.RuntimeRep) (a :: TYPE r) e. Exception e => e -> a
throwIO :: forall e a. Exception e => e -> GHC.Types.IO a
throwTo :: forall e. Exception e => GHC.Conc.Sync.ThreadId -> e -> GHC.Types.IO ()
try :: forall e a. Exception e => GHC.Types.IO a -> GHC.Types.IO (Data.Either.Either e a)
tryJust :: forall e b a. Exception e => (e -> GHC.Maybe.Maybe b) -> GHC.Types.IO a -> GHC.Types.IO (Data.Either.Either b a)
typeError :: forall (q :: GHC.Types.RuntimeRep) (a :: TYPE q). GHC.Prim.Addr# -> a
uninterruptibleMask :: forall b. ((forall a. GHC.Types.IO a -> GHC.Types.IO a) -> GHC.Types.IO b) -> GHC.Types.IO b
uninterruptibleMask_ :: forall a. GHC.Types.IO a -> GHC.Types.IO a
module Control.Monad where
-- Safety: Trustworthy
(<$!>) :: forall (m :: * -> *) a b. Monad m => (a -> b) -> m a -> m b
(<=<) :: forall (m :: * -> *) b c a. Monad m => (b -> m c) -> (a -> m b) -> a -> m c
(=<<) :: forall (m :: * -> *) a b. Monad m => (a -> m b) -> m a -> m b
(>=>) :: forall (m :: * -> *) a b c. Monad m => (a -> m b) -> (b -> m c) -> a -> m c
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 Monad :: (* -> *) -> Constraint
class GHC.Base.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. GHC.Base.String -> m a
{-# MINIMAL fail #-}
type MonadPlus :: (* -> *) -> Constraint
class (GHC.Base.Alternative m, Monad m) => MonadPlus m where
mzero :: forall a. m a
mplus :: forall a. m a -> m a -> m a
{-# MINIMAL #-}
ap :: forall (m :: * -> *) a b. Monad m => m (a -> b) -> m a -> m b
filterM :: forall (m :: * -> *) a. GHC.Base.Applicative m => (a -> m GHC.Types.Bool) -> [a] -> m [a]
foldM :: forall (t :: * -> *) (m :: * -> *) b a. (Data.Foldable.Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m b
foldM_ :: forall (t :: * -> *) (m :: * -> *) b a. (Data.Foldable.Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m ()
forM :: forall (t :: * -> *) (m :: * -> *) a b. (Data.Traversable.Traversable t, Monad m) => t a -> (a -> m b) -> m (t b)
forM_ :: forall (t :: * -> *) (m :: * -> *) a b. (Data.Foldable.Foldable t, Monad m) => t a -> (a -> m b) -> m ()
forever :: forall (f :: * -> *) a b. GHC.Base.Applicative f => f a -> f b
guard :: forall (f :: * -> *). GHC.Base.Alternative f => GHC.Types.Bool -> f ()
join :: forall (m :: * -> *) a. Monad m => m (m a) -> m a
liftM :: forall (m :: * -> *) a1 r. Monad m => (a1 -> r) -> m a1 -> m r
liftM2 :: forall (m :: * -> *) a1 a2 r. Monad m => (a1 -> a2 -> r) -> m a1 -> m a2 -> m r
liftM3 :: forall (m :: * -> *) a1 a2 a3 r. Monad m => (a1 -> a2 -> a3 -> r) -> m a1 -> m a2 -> m a3 -> m r
liftM4 :: forall (m :: * -> *) a1 a2 a3 a4 r. Monad m => (a1 -> a2 -> a3 -> a4 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m r
liftM5 :: forall (m :: * -> *) a1 a2 a3 a4 a5 r. Monad m => (a1 -> a2 -> a3 -> a4 -> a5 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m a5 -> m r
mapAndUnzipM :: forall (m :: * -> *) a b c. GHC.Base.Applicative m => (a -> m (b, c)) -> [a] -> m ([b], [c])
mapM :: forall (t :: * -> *) (m :: * -> *) a b. (Data.Traversable.Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)
mapM_ :: forall (t :: * -> *) (m :: * -> *) a b. (Data.Foldable.Foldable t, Monad m) => (a -> m b) -> t a -> m ()
mfilter :: forall (m :: * -> *) a. MonadPlus m => (a -> GHC.Types.Bool) -> m a -> m a
msum :: forall (t :: * -> *) (m :: * -> *) a. (Data.Foldable.Foldable t, MonadPlus m) => t (m a) -> m a
replicateM :: forall (m :: * -> *) a. GHC.Base.Applicative m => GHC.Types.Int -> m a -> m [a]
replicateM_ :: forall (m :: * -> *) a. GHC.Base.Applicative m => GHC.Types.Int -> m a -> m ()
sequence :: forall (t :: * -> *) (m :: * -> *) a. (Data.Traversable.Traversable t, Monad m) => t (m a) -> m (t a)
sequence_ :: forall (t :: * -> *) (m :: * -> *) a. (Data.Foldable.Foldable t, Monad m) => t (m a) -> m ()
unless :: forall (f :: * -> *). GHC.Base.Applicative f => GHC.Types.Bool -> f () -> f ()
void :: forall (f :: * -> *) a. Functor f => f a -> f ()
when :: forall (f :: * -> *). GHC.Base.Applicative f => GHC.Types.Bool -> f () -> f ()
zipWithM :: forall (m :: * -> *) a b c. GHC.Base.Applicative m => (a -> b -> m c) -> [a] -> [b] -> m [c]
zipWithM_ :: forall (m :: * -> *) a b c. GHC.Base.Applicative m => (a -> b -> m c) -> [a] -> [b] -> m ()
module Control.Monad.Fail where
-- Safety: Trustworthy
type MonadFail :: (* -> *) -> Constraint
class GHC.Base.Monad m => MonadFail m where
fail :: forall a. GHC.Base.String -> m a
{-# MINIMAL fail #-}
module Control.Monad.Fix where
-- Safety: Trustworthy
type MonadFix :: (* -> *) -> Constraint
class GHC.Base.Monad m => MonadFix m where
mfix :: forall a. (a -> m a) -> m a
{-# MINIMAL mfix #-}
fix :: forall a. (a -> a) -> a
module Control.Monad.IO.Class where
-- Safety: Safe
type MonadIO :: (* -> *) -> Constraint
class GHC.Base.Monad m => MonadIO m where
liftIO :: forall a. GHC.Types.IO a -> m a
{-# MINIMAL liftIO #-}
module Control.Monad.Instances where
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
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 Monad :: (* -> *) -> Constraint
class GHC.Base.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 (>>=) #-}
module Control.Monad.ST where
-- Safety: Trustworthy
type RealWorld :: *
data RealWorld
type role ST nominal representational
type ST :: * -> * -> *
newtype ST s a = ...
fixST :: forall a s. (a -> ST s a) -> ST s a
runST :: forall a. (forall s. ST s a) -> a
stToIO :: forall a. ST RealWorld a -> GHC.Types.IO a
module Control.Monad.ST.Lazy where
-- Safety: Trustworthy
type RealWorld :: *
data RealWorld
type role ST nominal representational
type ST :: * -> * -> *
newtype ST s a = ...
fixST :: forall a s. (a -> ST s a) -> ST s a
lazyToStrictST :: forall s a. ST s a -> GHC.ST.ST s a
runST :: forall a. (forall s. ST s a) -> a
stToIO :: forall a. ST RealWorld a -> GHC.Types.IO a
strictToLazyST :: forall s a. GHC.ST.ST s a -> ST s a
module Control.Monad.ST.Lazy.Safe where
-- Safety: Trustworthy
type RealWorld :: *
data RealWorld
type role ST nominal representational
type ST :: * -> * -> *
newtype ST s a = ...
fixST :: forall a s. (a -> ST s a) -> ST s a
lazyToStrictST :: forall s a. ST s a -> GHC.ST.ST s a
runST :: forall a. (forall s. ST s a) -> a
stToIO :: forall a. ST RealWorld a -> GHC.Types.IO a
strictToLazyST :: forall s a. GHC.ST.ST s a -> ST s a
module Control.Monad.ST.Lazy.Unsafe where
-- Safety: Unsafe
unsafeIOToST :: forall a s. GHC.Types.IO a -> ghc-internal-0.1.0.0:Control.Monad.ST.Lazy.Imp.ST s a
unsafeInterleaveST :: forall s a. ghc-internal-0.1.0.0:Control.Monad.ST.Lazy.Imp.ST s a -> ghc-internal-0.1.0.0:Control.Monad.ST.Lazy.Imp.ST s a
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
module Control.Monad.ST.Safe where
-- Safety: Trustworthy
type RealWorld :: *
data RealWorld
type role ST nominal representational
type ST :: * -> * -> *
newtype ST s a = ...
fixST :: forall a s. (a -> ST s a) -> ST s a
runST :: forall a. (forall s. ST s a) -> a
stToIO :: forall a. ST RealWorld a -> GHC.Types.IO a
module Control.Monad.ST.Strict where
-- Safety: Safe
type RealWorld :: *
data RealWorld
type role ST nominal representational
type ST :: * -> * -> *
newtype ST s a = ...
fixST :: forall a s. (a -> ST s a) -> ST s a
runST :: forall a. (forall s. ST s a) -> a
stToIO :: forall a. ST RealWorld a -> GHC.Types.IO a
module Control.Monad.ST.Unsafe where
-- Safety: Unsafe
unsafeDupableInterleaveST :: forall s a. GHC.ST.ST s a -> GHC.ST.ST s a
unsafeIOToST :: forall a s. GHC.Types.IO a -> GHC.ST.ST s a
unsafeInterleaveST :: forall s a. GHC.ST.ST s a -> GHC.ST.ST s a
unsafeSTToIO :: forall s a. GHC.ST.ST s a -> GHC.Types.IO a
module Control.Monad.Zip where
-- Safety: Safe
type MonadZip :: (* -> *) -> Constraint
class GHC.Base.Monad m => MonadZip m where
mzip :: forall a b. m a -> m b -> m (a, b)
mzipWith :: forall a b c. (a -> b -> c) -> m a -> m b -> m c
munzip :: forall a b. m (a, b) -> (m a, m b)
{-# MINIMAL mzip | mzipWith #-}
module Data.Array.Byte where
-- Safety: Trustworthy
type ByteArray :: *
data ByteArray = ByteArray GHC.Prim.ByteArray#
type role MutableByteArray nominal
type MutableByteArray :: * -> *
data MutableByteArray s = MutableByteArray (GHC.Prim.MutableByteArray# s)
module Data.Bifoldable where
-- Safety: Safe
type Bifoldable :: (* -> * -> *) -> Constraint
class Bifoldable p where
bifold :: forall m. GHC.Base.Monoid m => p m m -> m
bifoldMap :: forall m a b. GHC.Base.Monoid m => (a -> m) -> (b -> m) -> p a b -> m
bifoldr :: forall a c b. (a -> c -> c) -> (b -> c -> c) -> c -> p a b -> c
bifoldl :: forall c a b. (c -> a -> c) -> (c -> b -> c) -> c -> p a b -> c
{-# MINIMAL bifoldr | bifoldMap #-}
biList :: forall (t :: * -> * -> *) a. Bifoldable t => t a a -> [a]
biall :: forall (t :: * -> * -> *) a b. Bifoldable t => (a -> GHC.Types.Bool) -> (b -> GHC.Types.Bool) -> t a b -> GHC.Types.Bool
biand :: forall (t :: * -> * -> *). Bifoldable t => t GHC.Types.Bool GHC.Types.Bool -> GHC.Types.Bool
biany :: forall (t :: * -> * -> *) a b. Bifoldable t => (a -> GHC.Types.Bool) -> (b -> GHC.Types.Bool) -> t a b -> GHC.Types.Bool
biasum :: forall (t :: * -> * -> *) (f :: * -> *) a. (Bifoldable t, GHC.Base.Alternative f) => t (f a) (f a) -> f a
biconcat :: forall (t :: * -> * -> *) a. Bifoldable t => t [a] [a] -> [a]
biconcatMap :: forall (t :: * -> * -> *) a c b. Bifoldable t => (a -> [c]) -> (b -> [c]) -> t a b -> [c]
bielem :: forall (t :: * -> * -> *) a. (Bifoldable t, GHC.Classes.Eq a) => a -> t a a -> GHC.Types.Bool
bifind :: forall (t :: * -> * -> *) a. Bifoldable t => (a -> GHC.Types.Bool) -> t a a -> GHC.Maybe.Maybe a
bifoldl' :: forall (t :: * -> * -> *) a b c. Bifoldable t => (a -> b -> a) -> (a -> c -> a) -> a -> t b c -> a
bifoldl1 :: forall (t :: * -> * -> *) a. Bifoldable t => (a -> a -> a) -> t a a -> a
bifoldlM :: forall (t :: * -> * -> *) (m :: * -> *) a b c. (Bifoldable t, GHC.Base.Monad m) => (a -> b -> m a) -> (a -> c -> m a) -> a -> t b c -> m a
bifoldr' :: forall (t :: * -> * -> *) a c b. Bifoldable t => (a -> c -> c) -> (b -> c -> c) -> c -> t a b -> c
bifoldr1 :: forall (t :: * -> * -> *) a. Bifoldable t => (a -> a -> a) -> t a a -> a
bifoldrM :: forall (t :: * -> * -> *) (m :: * -> *) a c b. (Bifoldable t, GHC.Base.Monad m) => (a -> c -> m c) -> (b -> c -> m c) -> c -> t a b -> m c
biforM_ :: forall (t :: * -> * -> *) (f :: * -> *) a b c d. (Bifoldable t, GHC.Base.Applicative f) => t a b -> (a -> f c) -> (b -> f d) -> f ()
bifor_ :: forall (t :: * -> * -> *) (f :: * -> *) a b c d. (Bifoldable t, GHC.Base.Applicative f) => t a b -> (a -> f c) -> (b -> f d) -> f ()
bilength :: forall (t :: * -> * -> *) a b. Bifoldable t => t a b -> GHC.Types.Int
bimapM_ :: forall (t :: * -> * -> *) (f :: * -> *) a c b d. (Bifoldable t, GHC.Base.Applicative f) => (a -> f c) -> (b -> f d) -> t a b -> f ()
bimaximum :: forall (t :: * -> * -> *) a. (Bifoldable t, GHC.Classes.Ord a) => t a a -> a
bimaximumBy :: forall (t :: * -> * -> *) a. Bifoldable t => (a -> a -> GHC.Types.Ordering) -> t a a -> a
biminimum :: forall (t :: * -> * -> *) a. (Bifoldable t, GHC.Classes.Ord a) => t a a -> a
biminimumBy :: forall (t :: * -> * -> *) a. Bifoldable t => (a -> a -> GHC.Types.Ordering) -> t a a -> a
bimsum :: forall (t :: * -> * -> *) (f :: * -> *) a. (Bifoldable t, GHC.Base.Alternative f) => t (f a) (f a) -> f a
binotElem :: forall (t :: * -> * -> *) a. (Bifoldable t, GHC.Classes.Eq a) => a -> t a a -> GHC.Types.Bool
binull :: forall (t :: * -> * -> *) a b. Bifoldable t => t a b -> GHC.Types.Bool
bior :: forall (t :: * -> * -> *). Bifoldable t => t GHC.Types.Bool GHC.Types.Bool -> GHC.Types.Bool
biproduct :: forall (t :: * -> * -> *) a. (Bifoldable t, GHC.Num.Num a) => t a a -> a
bisequenceA_ :: forall (t :: * -> * -> *) (f :: * -> *) a b. (Bifoldable t, GHC.Base.Applicative f) => t (f a) (f b) -> f ()
bisequence_ :: forall (t :: * -> * -> *) (f :: * -> *) a b. (Bifoldable t, GHC.Base.Applicative f) => t (f a) (f b) -> f ()
bisum :: forall (t :: * -> * -> *) a. (Bifoldable t, GHC.Num.Num a) => t a a -> a
bitraverse_ :: forall (t :: * -> * -> *) (f :: * -> *) a c b d. (Bifoldable t, GHC.Base.Applicative f) => (a -> f c) -> (b -> f d) -> t a b -> f ()
module Data.Bifoldable1 where
-- Safety: Safe
type Bifoldable1 :: (* -> * -> *) -> Constraint
class Data.Bifoldable.Bifoldable t => Bifoldable1 t where
bifold1 :: forall m. GHC.Base.Semigroup m => t m m -> m
bifoldMap1 :: forall m a b. GHC.Base.Semigroup m => (a -> m) -> (b -> m) -> t a b -> m
{-# MINIMAL bifoldMap1 #-}
module Data.Bifunctor where
-- Safety: Safe
type Bifunctor :: (* -> * -> *) -> Constraint
class (forall a. GHC.Base.Functor (p a)) => Bifunctor p where
bimap :: forall a b c d. (a -> b) -> (c -> d) -> p a c -> p b d
first :: forall a b c. (a -> b) -> p a c -> p b c
second :: forall b c a. (b -> c) -> p a b -> p a c
{-# MINIMAL bimap | first, second #-}
module Data.Bitraversable where
-- Safety: Trustworthy
type Bitraversable :: (* -> * -> *) -> Constraint
class (Data.Bifunctor.Bifunctor t, Data.Bifoldable.Bifoldable t) => Bitraversable t where
bitraverse :: forall (f :: * -> *) a c b d. GHC.Base.Applicative f => (a -> f c) -> (b -> f d) -> t a b -> f (t c d)
{-# MINIMAL bitraverse #-}
bifoldMapDefault :: forall (t :: * -> * -> *) m a b. (Bitraversable t, GHC.Base.Monoid m) => (a -> m) -> (b -> m) -> t a b -> m
bifor :: forall (t :: * -> * -> *) (f :: * -> *) a b c d. (Bitraversable t, GHC.Base.Applicative f) => t a b -> (a -> f c) -> (b -> f d) -> f (t c d)
biforM :: forall (t :: * -> * -> *) (f :: * -> *) a b c d. (Bitraversable t, GHC.Base.Applicative f) => t a b -> (a -> f c) -> (b -> f d) -> f (t c d)
bimapAccumL :: forall (t :: * -> * -> *) a b c d e. Bitraversable t => (a -> b -> (a, c)) -> (a -> d -> (a, e)) -> a -> t b d -> (a, t c e)
bimapAccumR :: forall (t :: * -> * -> *) a b c d e. Bitraversable t => (a -> b -> (a, c)) -> (a -> d -> (a, e)) -> a -> t b d -> (a, t c e)
bimapDefault :: forall (t :: * -> * -> *) a b c d. Bitraversable t => (a -> b) -> (c -> d) -> t a c -> t b d
bimapM :: forall (t :: * -> * -> *) (f :: * -> *) a c b d. (Bitraversable t, GHC.Base.Applicative f) => (a -> f c) -> (b -> f d) -> t a b -> f (t c d)
bisequence :: forall (t :: * -> * -> *) (f :: * -> *) a b. (Bitraversable t, GHC.Base.Applicative f) => t (f a) (f b) -> f (t a b)
bisequenceA :: forall (t :: * -> * -> *) (f :: * -> *) a b. (Bitraversable t, GHC.Base.Applicative f) => t (f a) (f b) -> f (t a b)
module Data.Bits where
-- Safety: Trustworthy
(!<<.) :: forall a. Bits a => a -> GHC.Types.Int -> a
(!>>.) :: forall a. Bits a => a -> GHC.Types.Int -> a
(.<<.) :: forall a. Bits a => a -> GHC.Types.Int -> a
(.>>.) :: forall a. Bits a => a -> GHC.Types.Int -> a
(.^.) :: forall a. Bits a => a -> a -> a
type And :: * -> *
newtype And a = And {getAnd :: a}
type Bits :: * -> Constraint
class GHC.Classes.Eq a => Bits a where
(.&.) :: a -> a -> a
(.|.) :: a -> a -> a
xor :: a -> a -> a
complement :: a -> a
shift :: a -> GHC.Types.Int -> a
rotate :: a -> GHC.Types.Int -> a
zeroBits :: a
bit :: GHC.Types.Int -> a
setBit :: a -> GHC.Types.Int -> a
clearBit :: a -> GHC.Types.Int -> a
complementBit :: a -> GHC.Types.Int -> a
testBit :: a -> GHC.Types.Int -> GHC.Types.Bool
bitSizeMaybe :: a -> GHC.Maybe.Maybe GHC.Types.Int
bitSize :: a -> GHC.Types.Int
isSigned :: a -> GHC.Types.Bool
shiftL :: a -> GHC.Types.Int -> a
unsafeShiftL :: a -> GHC.Types.Int -> a
shiftR :: a -> GHC.Types.Int -> a
unsafeShiftR :: a -> GHC.Types.Int -> a
rotateL :: a -> GHC.Types.Int -> a
rotateR :: a -> GHC.Types.Int -> a
popCount :: a -> GHC.Types.Int
{-# MINIMAL (.&.), (.|.), xor, complement, (shift | (shiftL, shiftR)), (rotate | (rotateL, rotateR)), bitSize, bitSizeMaybe, isSigned, testBit, bit, popCount #-}
type FiniteBits :: * -> Constraint
class Bits b => FiniteBits b where
finiteBitSize :: b -> GHC.Types.Int
countLeadingZeros :: b -> GHC.Types.Int
countTrailingZeros :: b -> GHC.Types.Int
{-# MINIMAL finiteBitSize #-}
type Iff :: * -> *
newtype Iff a = Iff {getIff :: a}
type Ior :: * -> *
newtype Ior a = Ior {getIor :: a}
type Xor :: * -> *
newtype Xor a = Xor {getXor :: a}
bitDefault :: forall a. (Bits a, GHC.Num.Num a) => GHC.Types.Int -> a
oneBits :: forall a. FiniteBits a => a
popCountDefault :: forall a. (Bits a, GHC.Num.Num a) => a -> GHC.Types.Int
testBitDefault :: forall a. (Bits a, GHC.Num.Num a) => a -> GHC.Types.Int -> GHC.Types.Bool
toIntegralSized :: forall a b. (GHC.Real.Integral a, GHC.Real.Integral b, Bits a, Bits b) => a -> GHC.Maybe.Maybe b
module Data.Bool where
-- Safety: Trustworthy
(&&) :: Bool -> Bool -> Bool
type Bool :: *
data Bool = False | True
bool :: forall a. a -> a -> Bool -> a
not :: Bool -> Bool
otherwise :: Bool
(||) :: Bool -> Bool -> Bool
module Data.Char where
-- Safety: Trustworthy
type Char :: *
data Char = ...
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
chr :: GHC.Types.Int -> Char
digitToInt :: Char -> GHC.Types.Int
generalCategory :: Char -> GeneralCategory
intToDigit :: GHC.Types.Int -> Char
isAlpha :: Char -> GHC.Types.Bool
isAlphaNum :: Char -> GHC.Types.Bool
isAscii :: Char -> GHC.Types.Bool
isAsciiLower :: Char -> GHC.Types.Bool
isAsciiUpper :: Char -> GHC.Types.Bool
isControl :: Char -> GHC.Types.Bool
isDigit :: Char -> GHC.Types.Bool
isHexDigit :: Char -> GHC.Types.Bool
isLatin1 :: Char -> GHC.Types.Bool
isLetter :: Char -> GHC.Types.Bool
isLower :: Char -> GHC.Types.Bool
isLowerCase :: Char -> GHC.Types.Bool
isMark :: Char -> GHC.Types.Bool
isNumber :: Char -> GHC.Types.Bool
isOctDigit :: Char -> GHC.Types.Bool
isPrint :: Char -> GHC.Types.Bool
isPunctuation :: Char -> GHC.Types.Bool
isSeparator :: Char -> GHC.Types.Bool
isSpace :: Char -> GHC.Types.Bool
isSymbol :: Char -> GHC.Types.Bool
isUpper :: Char -> GHC.Types.Bool
isUpperCase :: Char -> GHC.Types.Bool
lexLitChar :: Text.ParserCombinators.ReadP.ReadS GHC.Base.String
ord :: Char -> GHC.Types.Int
readLitChar :: Text.ParserCombinators.ReadP.ReadS Char
showLitChar :: Char -> GHC.Show.ShowS
toLower :: Char -> Char
toTitle :: Char -> Char
toUpper :: Char -> Char
module Data.Coerce where
-- Safety: Unsafe
type role Coercible representational representational
type Coercible :: forall k. k -> k -> Constraint
class Coercible a b => Coercible a b
{-# MINIMAL #-}
coerce :: forall {k :: GHC.Types.RuntimeRep} (a :: TYPE k) (b :: TYPE k). Coercible a b => a -> b
module Data.Complex where
-- Safety: Trustworthy
type Complex :: * -> *
data Complex a = !a :+ !a
cis :: forall a. GHC.Float.Floating a => a -> Complex a
conjugate :: forall a. GHC.Num.Num a => Complex a -> Complex a
imagPart :: forall a. Complex a -> a
magnitude :: forall a. GHC.Float.RealFloat a => Complex a -> a
mkPolar :: forall a. GHC.Float.Floating a => a -> a -> Complex a
phase :: forall a. GHC.Float.RealFloat a => Complex a -> a
polar :: forall a. GHC.Float.RealFloat a => Complex a -> (a, a)
realPart :: forall a. Complex a -> a
module Data.Data where
-- Safety: Trustworthy
type role (:~:) nominal nominal
type (:~:) :: forall {k}. k -> k -> *
data (:~:) a b where
Refl :: forall {k} (a :: k). (:~:) a a
type role (:~~:) nominal nominal
type (:~~:) :: forall k1 k2. k1 -> k2 -> *
data (:~~:) a b where
HRefl :: forall {k1} (a :: k1). (:~~:) a a
type ConIndex :: *
type ConIndex = GHC.Types.Int
type Constr :: *
data Constr = ...
type ConstrRep :: *
data ConstrRep = AlgConstr ConIndex | IntConstr GHC.Num.Integer.Integer | FloatConstr GHC.Real.Rational | CharConstr GHC.Types.Char
type Data :: * -> Constraint
class Typeable a => Data a where
gfoldl :: forall (c :: * -> *). (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> a -> c a
gunfold :: forall (c :: * -> *). (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c a
toConstr :: a -> Constr
dataTypeOf :: a -> DataType
dataCast1 :: forall (t :: * -> *) (c :: * -> *). Typeable t => (forall d. Data d => c (t d)) -> GHC.Maybe.Maybe (c a)
dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *). Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> GHC.Maybe.Maybe (c a)
gmapT :: (forall b. Data b => b -> b) -> a -> a
gmapQl :: forall r r'. (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r
gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r
gmapQ :: forall u. (forall d. Data d => d -> u) -> a -> [u]
gmapQi :: forall u. GHC.Types.Int -> (forall d. Data d => d -> u) -> a -> u
gmapM :: forall (m :: * -> *). GHC.Base.Monad m => (forall d. Data d => d -> m d) -> a -> m a
gmapMp :: forall (m :: * -> *). GHC.Base.MonadPlus m => (forall d. Data d => d -> m d) -> a -> m a
gmapMo :: forall (m :: * -> *). GHC.Base.MonadPlus m => (forall d. Data d => d -> m d) -> a -> m a
{-# MINIMAL gunfold, toConstr, dataTypeOf #-}
type DataRep :: *
data DataRep = AlgRep [Constr] | IntRep | FloatRep | CharRep | NoRep
type DataType :: *
data DataType = ...
type Fixity :: *
data Fixity = Prefix | Infix
type role Proxy phantom
type Proxy :: forall {k}. k -> *
data Proxy t = Proxy
type TyCon :: *
data TyCon = ...
type TypeRep :: *
type TypeRep = ghc-internal-0.1.0.0:Data.Typeable.Internal.SomeTypeRep
type Typeable :: forall k. k -> Constraint
class Typeable a where
...
{-# MINIMAL ghc-internal-0.1.0.0:Data.Typeable.Internal.typeRep# #-}
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
cast :: forall a b. (Typeable a, Typeable b) => a -> GHC.Maybe.Maybe b
constrFields :: Constr -> [GHC.Base.String]
constrFixity :: Constr -> Fixity
constrIndex :: Constr -> ConIndex
constrRep :: Constr -> ConstrRep
constrType :: Constr -> DataType
dataTypeConstrs :: DataType -> [Constr]
dataTypeName :: DataType -> GHC.Base.String
dataTypeRep :: DataType -> DataRep
decT :: forall {k} (a :: k) (b :: k). (Typeable a, Typeable b) => Data.Either.Either ((a :~: b) -> GHC.Base.Void) (a :~: b)
eqT :: forall {k} (a :: k) (b :: k). (Typeable a, Typeable b) => GHC.Maybe.Maybe (a :~: b)
fromConstr :: forall a. Data a => Constr -> a
fromConstrB :: forall a. Data a => (forall d. Data d => d) -> Constr -> a
fromConstrM :: forall (m :: * -> *) a. (GHC.Base.Monad m, Data a) => (forall d. Data d => m d) -> Constr -> m a
funResultTy :: TypeRep -> TypeRep -> GHC.Maybe.Maybe TypeRep
gcast :: forall {k} (a :: k) (b :: k) (c :: k -> *). (Typeable a, Typeable b) => c a -> GHC.Maybe.Maybe (c b)
gcast1 :: forall {k1} {k2} (c :: k1 -> *) (t :: k2 -> k1) (t' :: k2 -> k1) (a :: k2). (Typeable t, Typeable t') => c (t a) -> GHC.Maybe.Maybe (c (t' a))
gcast2 :: forall {k1} {k2} {k3} (c :: k1 -> *) (t :: k2 -> k3 -> k1) (t' :: k2 -> k3 -> k1) (a :: k2) (b :: k3). (Typeable t, Typeable t') => c (t a b) -> GHC.Maybe.Maybe (c (t' a b))
hdecT :: forall {k1} {k2} (a :: k1) (b :: k2). (Typeable a, Typeable b) => Data.Either.Either ((a :~~: b) -> GHC.Base.Void) (a :~~: b)
heqT :: forall {k1} {k2} (a :: k1) (b :: k2). (Typeable a, Typeable b) => GHC.Maybe.Maybe (a :~~: b)
indexConstr :: DataType -> ConIndex -> Constr
isAlgType :: DataType -> GHC.Types.Bool
isNorepType :: DataType -> GHC.Types.Bool
maxConstrIndex :: DataType -> ConIndex
mkCharConstr :: DataType -> GHC.Types.Char -> Constr
mkCharType :: GHC.Base.String -> DataType
mkConstr :: DataType -> GHC.Base.String -> [GHC.Base.String] -> Fixity -> Constr
mkConstrTag :: DataType -> GHC.Base.String -> GHC.Types.Int -> [GHC.Base.String] -> Fixity -> Constr
mkDataType :: GHC.Base.String -> [Constr] -> DataType
mkFloatType :: GHC.Base.String -> DataType
mkFunTy :: TypeRep -> TypeRep -> TypeRep
mkIntType :: GHC.Base.String -> DataType
mkIntegralConstr :: forall a. (GHC.Real.Integral a, GHC.Show.Show a) => DataType -> a -> Constr
mkNoRepType :: GHC.Base.String -> DataType
mkRealConstr :: forall a. (GHC.Real.Real a, GHC.Show.Show a) => DataType -> a -> Constr
readConstr :: DataType -> GHC.Base.String -> GHC.Maybe.Maybe Constr
repConstr :: DataType -> ConstrRep -> Constr
rnfTyCon :: TyCon -> ()
rnfTypeRep :: TypeRep -> ()
showConstr :: Constr -> GHC.Base.String
showsTypeRep :: TypeRep -> GHC.Show.ShowS
splitTyConApp :: TypeRep -> (TyCon, [TypeRep])
trLiftedRep :: ghc-internal-0.1.0.0:Data.Typeable.Internal.TypeRep GHC.Types.LiftedRep
tyConFingerprint :: TyCon -> GHC.Fingerprint.Type.Fingerprint
tyConModule :: TyCon -> GHC.Base.String
tyConName :: TyCon -> GHC.Base.String
tyConPackage :: TyCon -> GHC.Base.String
tyconModule :: GHC.Base.String -> GHC.Base.String
tyconUQname :: GHC.Base.String -> GHC.Base.String
typeOf :: forall a. Typeable a => a -> TypeRep
typeOf1 :: forall (t :: * -> *) a. Typeable t => t a -> TypeRep
typeOf2 :: forall (t :: * -> * -> *) a b. Typeable t => t a b -> TypeRep
typeOf3 :: forall (t :: * -> * -> * -> *) a b c. Typeable t => t a b c -> TypeRep
typeOf4 :: forall (t :: * -> * -> * -> * -> *) a b c d. Typeable t => t a b c d -> TypeRep
typeOf5 :: forall (t :: * -> * -> * -> * -> * -> *) a b c d e. Typeable t => t a b c d e -> TypeRep
typeOf6 :: forall (t :: * -> * -> * -> * -> * -> * -> *) a b c d e f. Typeable t => t a b c d e f -> TypeRep
typeOf7 :: forall (t :: * -> * -> * -> * -> * -> * -> * -> *) a b c d e f g. Typeable t => t a b c d e f g -> TypeRep
typeRep :: forall {k} (proxy :: k -> *) (a :: k). Typeable a => proxy a -> TypeRep
typeRepArgs :: TypeRep -> [TypeRep]
typeRepFingerprint :: TypeRep -> GHC.Fingerprint.Type.Fingerprint
typeRepTyCon :: TypeRep -> TyCon
module Data.Dynamic where
-- Safety: Trustworthy
type Dynamic :: *
data Dynamic where
Dynamic :: forall a. ghc-internal-0.1.0.0:Data.Typeable.Internal.TypeRep a -> a -> Dynamic
type Typeable :: forall k. k -> Constraint
class Typeable a where
...
{-# MINIMAL ghc-internal-0.1.0.0:Data.Typeable.Internal.typeRep# #-}
dynApp :: Dynamic -> Dynamic -> Dynamic
dynApply :: Dynamic -> Dynamic -> GHC.Maybe.Maybe Dynamic
dynTypeRep :: Dynamic -> ghc-internal-0.1.0.0:Data.Typeable.Internal.SomeTypeRep
fromDyn :: forall a. Typeable a => Dynamic -> a -> a
fromDynamic :: forall a. Typeable a => Dynamic -> GHC.Maybe.Maybe a
toDyn :: forall a. Typeable a => a -> Dynamic
module Data.Either where
-- Safety: Trustworthy
type Either :: * -> * -> *
data Either a b = Left a | Right b
either :: forall a c b. (a -> c) -> (b -> c) -> Either a b -> c
fromLeft :: forall a b. a -> Either a b -> a
fromRight :: forall b a. b -> Either a b -> b
isLeft :: forall a b. Either a b -> GHC.Types.Bool
isRight :: forall a b. Either a b -> GHC.Types.Bool
lefts :: forall a b. [Either a b] -> [a]
partitionEithers :: forall a b. [Either a b] -> ([a], [b])
rights :: forall a b. [Either a b] -> [b]
module Data.Enum where
-- Safety: Safe-Inferred
type Bounded :: * -> Constraint
class Bounded a where
minBound :: a
maxBound :: a
{-# MINIMAL minBound, maxBound #-}
type Enum :: * -> Constraint
class Enum a where
succ :: a -> a
pred :: a -> a
toEnum :: GHC.Types.Int -> a
fromEnum :: a -> GHC.Types.Int
enumFrom :: a -> [a]
enumFromThen :: a -> a -> [a]
enumFromTo :: a -> a -> [a]
enumFromThenTo :: a -> a -> a -> [a]
{-# MINIMAL toEnum, fromEnum #-}
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
module Data.Eq where
-- Safety: Trustworthy
type Eq :: * -> Constraint
class Eq a where
(==) :: a -> a -> GHC.Types.Bool
(/=) :: a -> a -> GHC.Types.Bool
{-# MINIMAL (==) | (/=) #-}
module Data.Fixed where
-- Safety: Trustworthy
type Centi :: *
type Centi = Fixed E2
type Deci :: *
type Deci = Fixed E1
type E0 :: *
data E0
type E1 :: *
data E1
type E12 :: *
data E12
type E2 :: *
data E2
type E3 :: *
data E3
type E6 :: *
data E6
type E9 :: *
data E9
type role Fixed phantom
type Fixed :: forall k. k -> *
newtype Fixed a = MkFixed GHC.Num.Integer.Integer
type HasResolution :: forall k. k -> Constraint
class HasResolution a where
resolution :: forall (p :: k -> *). p a -> GHC.Num.Integer.Integer
{-# MINIMAL resolution #-}
type Micro :: *
type Micro = Fixed E6
type Milli :: *
type Milli = Fixed E3
type Nano :: *
type Nano = Fixed E9
type Pico :: *
type Pico = Fixed E12
type Uni :: *
type Uni = Fixed E0
div' :: forall a b. (GHC.Real.Real a, GHC.Real.Integral b) => a -> a -> b
divMod' :: forall a b. (GHC.Real.Real a, GHC.Real.Integral b) => a -> a -> (b, a)
mod' :: forall a. GHC.Real.Real a => a -> a -> a
showFixed :: forall {k} (a :: k). HasResolution a => GHC.Types.Bool -> Fixed a -> GHC.Base.String
module Data.Foldable where
-- Safety: Trustworthy
type Foldable :: (* -> *) -> Constraint
class Foldable t where
fold :: forall m. GHC.Base.Monoid m => t m -> m
foldMap :: forall m a. GHC.Base.Monoid m => (a -> m) -> t a -> m
foldMap' :: forall m a. GHC.Base.Monoid m => (a -> m) -> t a -> m
foldr :: forall a b. (a -> b -> b) -> b -> t a -> b
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
foldr1 :: forall a. (a -> a -> a) -> t a -> a
foldl1 :: forall a. (a -> a -> a) -> t a -> a
toList :: forall a. t a -> [a]
null :: forall a. t a -> GHC.Types.Bool
length :: forall a. t a -> GHC.Types.Int
elem :: forall a. GHC.Classes.Eq a => a -> t a -> GHC.Types.Bool
maximum :: forall a. GHC.Classes.Ord a => t a -> a
minimum :: forall a. GHC.Classes.Ord a => t a -> a
sum :: forall a. GHC.Num.Num a => t a -> a
product :: forall a. GHC.Num.Num a => t a -> a
{-# MINIMAL foldMap | foldr #-}
all :: forall (t :: * -> *) a. Foldable t => (a -> GHC.Types.Bool) -> t a -> GHC.Types.Bool
and :: forall (t :: * -> *). Foldable t => t GHC.Types.Bool -> GHC.Types.Bool
any :: forall (t :: * -> *) a. Foldable t => (a -> GHC.Types.Bool) -> t a -> GHC.Types.Bool
asum :: forall (t :: * -> *) (f :: * -> *) a. (Foldable t, GHC.Base.Alternative f) => t (f a) -> f a
concat :: forall (t :: * -> *) a. Foldable t => t [a] -> [a]
concatMap :: forall (t :: * -> *) a b. Foldable t => (a -> [b]) -> t a -> [b]
find :: forall (t :: * -> *) a. Foldable t => (a -> GHC.Types.Bool) -> t a -> GHC.Maybe.Maybe a
foldlM :: forall (t :: * -> *) (m :: * -> *) b a. (Foldable t, GHC.Base.Monad m) => (b -> a -> m b) -> b -> t a -> m b
foldrM :: forall (t :: * -> *) (m :: * -> *) a b. (Foldable t, GHC.Base.Monad m) => (a -> b -> m b) -> b -> t a -> m b
forM_ :: forall (t :: * -> *) (m :: * -> *) a b. (Foldable t, GHC.Base.Monad m) => t a -> (a -> m b) -> m ()
for_ :: forall (t :: * -> *) (f :: * -> *) a b. (Foldable t, GHC.Base.Applicative f) => t a -> (a -> f b) -> f ()
mapM_ :: forall (t :: * -> *) (m :: * -> *) a b. (Foldable t, GHC.Base.Monad m) => (a -> m b) -> t a -> m ()
maximumBy :: forall (t :: * -> *) a. Foldable t => (a -> a -> GHC.Types.Ordering) -> t a -> a
minimumBy :: forall (t :: * -> *) a. Foldable t => (a -> a -> GHC.Types.Ordering) -> t a -> a
msum :: forall (t :: * -> *) (m :: * -> *) a. (Foldable t, GHC.Base.MonadPlus m) => t (m a) -> m a
notElem :: forall (t :: * -> *) a. (Foldable t, GHC.Classes.Eq a) => a -> t a -> GHC.Types.Bool
or :: forall (t :: * -> *). Foldable t => t GHC.Types.Bool -> GHC.Types.Bool
sequenceA_ :: forall (t :: * -> *) (f :: * -> *) a. (Foldable t, GHC.Base.Applicative f) => t (f a) -> f ()
sequence_ :: forall (t :: * -> *) (m :: * -> *) a. (Foldable t, GHC.Base.Monad m) => t (m a) -> m ()
traverse_ :: forall (t :: * -> *) (f :: * -> *) a b. (Foldable t, GHC.Base.Applicative f) => (a -> f b) -> t a -> f ()
module Data.Foldable1 where
-- Safety: Trustworthy
type Foldable1 :: (* -> *) -> Constraint
class Data.Foldable.Foldable t => Foldable1 t where
fold1 :: forall m. GHC.Base.Semigroup m => t m -> m
foldMap1 :: forall m a. GHC.Base.Semigroup m => (a -> m) -> t a -> m
foldMap1' :: forall m a. GHC.Base.Semigroup m => (a -> m) -> t a -> m
toNonEmpty :: forall a. t a -> GHC.Base.NonEmpty a
maximum :: forall a. GHC.Classes.Ord a => t a -> a
minimum :: forall a. GHC.Classes.Ord a => t a -> a
head :: forall a. t a -> a
last :: forall a. t a -> a
foldrMap1 :: forall a b. (a -> b) -> (a -> b -> b) -> t a -> b
foldlMap1' :: forall a b. (a -> b) -> (b -> a -> b) -> t a -> b
foldlMap1 :: forall a b. (a -> b) -> (b -> a -> b) -> t a -> b
foldrMap1' :: forall a b. (a -> b) -> (a -> b -> b) -> t a -> b
{-# MINIMAL foldMap1 | foldrMap1 #-}
foldl1 :: forall (t :: * -> *) a. Foldable1 t => (a -> a -> a) -> t a -> a
foldl1' :: forall (t :: * -> *) a. Foldable1 t => (a -> a -> a) -> t a -> a
foldlM1 :: forall (t :: * -> *) (m :: * -> *) a. (Foldable1 t, GHC.Base.Monad m) => (a -> a -> m a) -> t a -> m a
foldlMapM1 :: forall (t :: * -> *) (m :: * -> *) a b. (Foldable1 t, GHC.Base.Monad m) => (a -> m b) -> (b -> a -> m b) -> t a -> m b
foldr1 :: forall (t :: * -> *) a. Foldable1 t => (a -> a -> a) -> t a -> a
foldr1' :: forall (t :: * -> *) a. Foldable1 t => (a -> a -> a) -> t a -> a
foldrM1 :: forall (t :: * -> *) (m :: * -> *) a. (Foldable1 t, GHC.Base.Monad m) => (a -> a -> m a) -> t a -> m a
foldrMapM1 :: forall (t :: * -> *) (m :: * -> *) a b. (Foldable1 t, GHC.Base.Monad m) => (a -> m b) -> (a -> b -> m b) -> t a -> m b
intercalate1 :: forall (t :: * -> *) m. (Foldable1 t, GHC.Base.Semigroup m) => m -> t m -> m
maximumBy :: forall (t :: * -> *) a. Foldable1 t => (a -> a -> GHC.Types.Ordering) -> t a -> a
minimumBy :: forall (t :: * -> *) a. Foldable1 t => (a -> a -> GHC.Types.Ordering) -> t a -> a
module Data.Function where
-- Safety: Trustworthy
($) :: 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 -> (a -> b) -> b
(.) :: forall b c a. (b -> c) -> (a -> b) -> a -> c
applyWhen :: forall a. GHC.Types.Bool -> (a -> a) -> a -> a
const :: forall a b. a -> b -> a
fix :: forall a. (a -> a) -> a
flip :: forall a b c. (a -> b -> c) -> b -> a -> c
id :: forall a. a -> a
on :: forall b c a. (b -> b -> c) -> (a -> b) -> a -> a -> c
module Data.Functor where
-- Safety: Trustworthy
($>) :: forall (f :: * -> *) a b. Functor f => f a -> b -> f b
(<$>) :: forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
(<&>) :: forall (f :: * -> *) a b. Functor f => f a -> (a -> b) -> f b
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 #-}
unzip :: forall (f :: * -> *) a b. Functor f => f (a, b) -> (f a, f b)
void :: forall (f :: * -> *) a. Functor f => f a -> f ()
module Data.Functor.Classes where
-- Safety: Safe
type Eq1 :: (* -> *) -> Constraint
class (forall a. GHC.Classes.Eq a => GHC.Classes.Eq (f a)) => Eq1 f where
liftEq :: forall a b. (a -> b -> GHC.Types.Bool) -> f a -> f b -> GHC.Types.Bool
default liftEq :: forall (f' :: * -> * -> *) c a b. (f ~ f' c, Eq2 f', GHC.Classes.Eq c) => (a -> b -> GHC.Types.Bool) -> f a -> f b -> GHC.Types.Bool
{-# MINIMAL #-}
type Eq2 :: (* -> * -> *) -> Constraint
class (forall a. GHC.Classes.Eq a => Eq1 (f a)) => Eq2 f where
liftEq2 :: forall a b c d. (a -> b -> GHC.Types.Bool) -> (c -> d -> GHC.Types.Bool) -> f a c -> f b d -> GHC.Types.Bool
{-# MINIMAL liftEq2 #-}
type Ord1 :: (* -> *) -> Constraint
class (Eq1 f, forall a. GHC.Classes.Ord a => GHC.Classes.Ord (f a)) => Ord1 f where
liftCompare :: forall a b. (a -> b -> GHC.Types.Ordering) -> f a -> f b -> GHC.Types.Ordering
default liftCompare :: forall (f' :: * -> * -> *) c a b. (f ~ f' c, Ord2 f', GHC.Classes.Ord c) => (a -> b -> GHC.Types.Ordering) -> f a -> f b -> GHC.Types.Ordering
{-# MINIMAL #-}
type Ord2 :: (* -> * -> *) -> Constraint
class (Eq2 f, forall a. GHC.Classes.Ord a => Ord1 (f a)) => Ord2 f where
liftCompare2 :: forall a b c d. (a -> b -> GHC.Types.Ordering) -> (c -> d -> GHC.Types.Ordering) -> f a c -> f b d -> GHC.Types.Ordering
{-# MINIMAL liftCompare2 #-}
type Read1 :: (* -> *) -> Constraint
class (forall a. GHC.Read.Read a => GHC.Read.Read (f a)) => Read1 f where
liftReadsPrec :: forall a. (GHC.Types.Int -> Text.ParserCombinators.ReadP.ReadS a) -> Text.ParserCombinators.ReadP.ReadS [a] -> GHC.Types.Int -> Text.ParserCombinators.ReadP.ReadS (f a)
liftReadList :: forall a. (GHC.Types.Int -> Text.ParserCombinators.ReadP.ReadS a) -> Text.ParserCombinators.ReadP.ReadS [a] -> Text.ParserCombinators.ReadP.ReadS [f a]
liftReadPrec :: forall a. Text.ParserCombinators.ReadPrec.ReadPrec a -> Text.ParserCombinators.ReadPrec.ReadPrec [a] -> Text.ParserCombinators.ReadPrec.ReadPrec (f a)
liftReadListPrec :: forall a. Text.ParserCombinators.ReadPrec.ReadPrec a -> Text.ParserCombinators.ReadPrec.ReadPrec [a] -> Text.ParserCombinators.ReadPrec.ReadPrec [f a]
{-# MINIMAL liftReadsPrec | liftReadPrec #-}
type Read2 :: (* -> * -> *) -> Constraint
class (forall a. GHC.Read.Read a => Read1 (f a)) => Read2 f where
liftReadsPrec2 :: forall a b. (GHC.Types.Int -> Text.ParserCombinators.ReadP.ReadS a) -> Text.ParserCombinators.ReadP.ReadS [a] -> (GHC.Types.Int -> Text.ParserCombinators.ReadP.ReadS b) -> Text.ParserCombinators.ReadP.ReadS [b] -> GHC.Types.Int -> Text.ParserCombinators.ReadP.ReadS (f a b)
liftReadList2 :: forall a b. (GHC.Types.Int -> Text.ParserCombinators.ReadP.ReadS a) -> Text.ParserCombinators.ReadP.ReadS [a] -> (GHC.Types.Int -> Text.ParserCombinators.ReadP.ReadS b) -> Text.ParserCombinators.ReadP.ReadS [b] -> Text.ParserCombinators.ReadP.ReadS [f a b]
liftReadPrec2 :: forall a b. Text.ParserCombinators.ReadPrec.ReadPrec a -> Text.ParserCombinators.ReadPrec.ReadPrec [a] -> Text.ParserCombinators.ReadPrec.ReadPrec b -> Text.ParserCombinators.ReadPrec.ReadPrec [b] -> Text.ParserCombinators.ReadPrec.ReadPrec (f a b)
liftReadListPrec2 :: forall a b. Text.ParserCombinators.ReadPrec.ReadPrec a -> Text.ParserCombinators.ReadPrec.ReadPrec [a] -> Text.ParserCombinators.ReadPrec.ReadPrec b -> Text.ParserCombinators.ReadPrec.ReadPrec [b] -> Text.ParserCombinators.ReadPrec.ReadPrec [f a b]
{-# MINIMAL liftReadsPrec2 | liftReadPrec2 #-}
type Show1 :: (* -> *) -> Constraint
class (forall a. GHC.Show.Show a => GHC.Show.Show (f a)) => Show1 f where
liftShowsPrec :: forall a. (GHC.Types.Int -> a -> GHC.Show.ShowS) -> ([a] -> GHC.Show.ShowS) -> GHC.Types.Int -> f a -> GHC.Show.ShowS
default liftShowsPrec :: forall (f' :: * -> * -> *) b a. (f ~ f' b, Show2 f', GHC.Show.Show b) => (GHC.Types.Int -> a -> GHC.Show.ShowS) -> ([a] -> GHC.Show.ShowS) -> GHC.Types.Int -> f a -> GHC.Show.ShowS
liftShowList :: forall a. (GHC.Types.Int -> a -> GHC.Show.ShowS) -> ([a] -> GHC.Show.ShowS) -> [f a] -> GHC.Show.ShowS
{-# MINIMAL #-}
type Show2 :: (* -> * -> *) -> Constraint
class (forall a. GHC.Show.Show a => Show1 (f a)) => Show2 f where
liftShowsPrec2 :: forall a b. (GHC.Types.Int -> a -> GHC.Show.ShowS) -> ([a] -> GHC.Show.ShowS) -> (GHC.Types.Int -> b -> GHC.Show.ShowS) -> ([b] -> GHC.Show.ShowS) -> GHC.Types.Int -> f a b -> GHC.Show.ShowS
liftShowList2 :: forall a b. (GHC.Types.Int -> a -> GHC.Show.ShowS) -> ([a] -> GHC.Show.ShowS) -> (GHC.Types.Int -> b -> GHC.Show.ShowS) -> ([b] -> GHC.Show.ShowS) -> [f a b] -> GHC.Show.ShowS
{-# MINIMAL liftShowsPrec2 #-}
compare1 :: forall (f :: * -> *) a. (Ord1 f, GHC.Classes.Ord a) => f a -> f a -> GHC.Types.Ordering
compare2 :: forall (f :: * -> * -> *) a b. (Ord2 f, GHC.Classes.Ord a, GHC.Classes.Ord b) => f a b -> f a b -> GHC.Types.Ordering
eq1 :: forall (f :: * -> *) a. (Eq1 f, GHC.Classes.Eq a) => f a -> f a -> GHC.Types.Bool
eq2 :: forall (f :: * -> * -> *) a b. (Eq2 f, GHC.Classes.Eq a, GHC.Classes.Eq b) => f a b -> f a b -> GHC.Types.Bool
liftReadList2Default :: forall (f :: * -> * -> *) a b. Read2 f => (GHC.Types.Int -> Text.ParserCombinators.ReadP.ReadS a) -> Text.ParserCombinators.ReadP.ReadS [a] -> (GHC.Types.Int -> Text.ParserCombinators.ReadP.ReadS b) -> Text.ParserCombinators.ReadP.ReadS [b] -> Text.ParserCombinators.ReadP.ReadS [f a b]
liftReadListDefault :: forall (f :: * -> *) a. Read1 f => (GHC.Types.Int -> Text.ParserCombinators.ReadP.ReadS a) -> Text.ParserCombinators.ReadP.ReadS [a] -> Text.ParserCombinators.ReadP.ReadS [f a]
liftReadListPrec2Default :: forall (f :: * -> * -> *) a b. Read2 f => Text.ParserCombinators.ReadPrec.ReadPrec a -> Text.ParserCombinators.ReadPrec.ReadPrec [a] -> Text.ParserCombinators.ReadPrec.ReadPrec b -> Text.ParserCombinators.ReadPrec.ReadPrec [b] -> Text.ParserCombinators.ReadPrec.ReadPrec [f a b]
liftReadListPrecDefault :: forall (f :: * -> *) a. Read1 f => Text.ParserCombinators.ReadPrec.ReadPrec a -> Text.ParserCombinators.ReadPrec.ReadPrec [a] -> Text.ParserCombinators.ReadPrec.ReadPrec [f a]
readBinaryWith :: forall a b t. Text.ParserCombinators.ReadPrec.ReadPrec a -> Text.ParserCombinators.ReadPrec.ReadPrec b -> GHC.Base.String -> (a -> b -> t) -> Text.ParserCombinators.ReadPrec.ReadPrec t
readData :: forall a. Text.ParserCombinators.ReadPrec.ReadPrec a -> Text.ParserCombinators.ReadPrec.ReadPrec a
readPrec1 :: forall (f :: * -> *) a. (Read1 f, GHC.Read.Read a) => Text.ParserCombinators.ReadPrec.ReadPrec (f a)
readPrec2 :: forall (f :: * -> * -> *) a b. (Read2 f, GHC.Read.Read a, GHC.Read.Read b) => Text.ParserCombinators.ReadPrec.ReadPrec (f a b)
readUnaryWith :: forall a t. Text.ParserCombinators.ReadPrec.ReadPrec a -> GHC.Base.String -> (a -> t) -> Text.ParserCombinators.ReadPrec.ReadPrec t
readsBinary1 :: forall (f :: * -> *) (g :: * -> *) a t. (Read1 f, Read1 g, GHC.Read.Read a) => GHC.Base.String -> (f a -> g a -> t) -> GHC.Base.String -> Text.ParserCombinators.ReadP.ReadS t
readsBinaryWith :: forall a b t. (GHC.Types.Int -> Text.ParserCombinators.ReadP.ReadS a) -> (GHC.Types.Int -> Text.ParserCombinators.ReadP.ReadS b) -> GHC.Base.String -> (a -> b -> t) -> GHC.Base.String -> Text.ParserCombinators.ReadP.ReadS t
readsData :: forall a. (GHC.Base.String -> Text.ParserCombinators.ReadP.ReadS a) -> GHC.Types.Int -> Text.ParserCombinators.ReadP.ReadS a
readsPrec1 :: forall (f :: * -> *) a. (Read1 f, GHC.Read.Read a) => GHC.Types.Int -> Text.ParserCombinators.ReadP.ReadS (f a)
readsPrec2 :: forall (f :: * -> * -> *) a b. (Read2 f, GHC.Read.Read a, GHC.Read.Read b) => GHC.Types.Int -> Text.ParserCombinators.ReadP.ReadS (f a b)
readsUnary :: forall a t. GHC.Read.Read a => GHC.Base.String -> (a -> t) -> GHC.Base.String -> Text.ParserCombinators.ReadP.ReadS t
readsUnary1 :: forall (f :: * -> *) a t. (Read1 f, GHC.Read.Read a) => GHC.Base.String -> (f a -> t) -> GHC.Base.String -> Text.ParserCombinators.ReadP.ReadS t
readsUnaryWith :: forall a t. (GHC.Types.Int -> Text.ParserCombinators.ReadP.ReadS a) -> GHC.Base.String -> (a -> t) -> GHC.Base.String -> Text.ParserCombinators.ReadP.ReadS t
showsBinary1 :: forall (f :: * -> *) (g :: * -> *) a. (Show1 f, Show1 g, GHC.Show.Show a) => GHC.Base.String -> GHC.Types.Int -> f a -> g a -> GHC.Show.ShowS
showsBinaryWith :: forall a b. (GHC.Types.Int -> a -> GHC.Show.ShowS) -> (GHC.Types.Int -> b -> GHC.Show.ShowS) -> GHC.Base.String -> GHC.Types.Int -> a -> b -> GHC.Show.ShowS
showsPrec1 :: forall (f :: * -> *) a. (Show1 f, GHC.Show.Show a) => GHC.Types.Int -> f a -> GHC.Show.ShowS
showsPrec2 :: forall (f :: * -> * -> *) a b. (Show2 f, GHC.Show.Show a, GHC.Show.Show b) => GHC.Types.Int -> f a b -> GHC.Show.ShowS
showsUnary :: forall a. GHC.Show.Show a => GHC.Base.String -> GHC.Types.Int -> a -> GHC.Show.ShowS
showsUnary1 :: forall (f :: * -> *) a. (Show1 f, GHC.Show.Show a) => GHC.Base.String -> GHC.Types.Int -> f a -> GHC.Show.ShowS
showsUnaryWith :: forall a. (GHC.Types.Int -> a -> GHC.Show.ShowS) -> GHC.Base.String -> GHC.Types.Int -> a -> GHC.Show.ShowS
module Data.Functor.Compose where
-- Safety: Trustworthy
type role Compose representational nominal nominal
type Compose :: forall {k} {k1}. (k -> *) -> (k1 -> k) -> k1 -> *
newtype Compose f g a = Compose {getCompose :: f (g a)}
module Data.Functor.Const where
-- Safety: Trustworthy
type role Const representational phantom
type Const :: forall {k}. * -> k -> *
newtype Const a b = Const {getConst :: a}
module Data.Functor.Contravariant where
-- Safety: Trustworthy
($<) :: forall (f :: * -> *) b a. Contravariant f => f b -> b -> f a
(>$$<) :: forall (f :: * -> *) b a. Contravariant f => f b -> (a -> b) -> f a
(>$<) :: forall (f :: * -> *) a b. Contravariant f => (a -> b) -> f b -> f a
type Comparison :: * -> *
newtype Comparison a = Comparison {getComparison :: a -> a -> GHC.Types.Ordering}
type Contravariant :: (* -> *) -> Constraint
class Contravariant f where
contramap :: forall a' a. (a' -> a) -> f a -> f a'
(>$) :: forall b a. b -> f b -> f a
{-# MINIMAL contramap #-}
type Equivalence :: * -> *
newtype Equivalence a = Equivalence {getEquivalence :: a -> a -> GHC.Types.Bool}
type Op :: * -> * -> *
newtype Op a b = Op {getOp :: b -> a}
type Predicate :: * -> *
newtype Predicate a = Predicate {getPredicate :: a -> GHC.Types.Bool}
comparisonEquivalence :: forall a. Comparison a -> Equivalence a
defaultComparison :: forall a. GHC.Classes.Ord a => Comparison a
defaultEquivalence :: forall a. GHC.Classes.Eq a => Equivalence a
phantom :: forall (f :: * -> *) a b. (GHC.Base.Functor f, Contravariant f) => f a -> f b
module Data.Functor.Identity where
-- Safety: Trustworthy
type Identity :: * -> *
newtype Identity a = Identity {runIdentity :: a}
module Data.Functor.Product where
-- Safety: Safe
type role Product representational representational nominal
type Product :: forall {k}. (k -> *) -> (k -> *) -> k -> *
data Product f g a = Pair (f a) (g a)
module Data.Functor.Sum where
-- Safety: Safe
type role Sum representational representational nominal
type Sum :: forall {k}. (k -> *) -> (k -> *) -> k -> *
data Sum f g a = InL (f a) | InR (g a)
module Data.IORef where
-- Safety: Trustworthy
type IORef :: * -> *
newtype IORef a = ...
atomicModifyIORef :: forall a b. IORef a -> (a -> (a, b)) -> GHC.Types.IO b
atomicModifyIORef' :: forall a b. IORef a -> (a -> (a, b)) -> GHC.Types.IO b
atomicWriteIORef :: forall a. IORef a -> a -> GHC.Types.IO ()
mkWeakIORef :: forall a. IORef a -> GHC.Types.IO () -> GHC.Types.IO (GHC.Weak.Weak (IORef a))
modifyIORef :: forall a. IORef a -> (a -> a) -> GHC.Types.IO ()
modifyIORef' :: forall a. IORef a -> (a -> a) -> GHC.Types.IO ()
newIORef :: forall a. a -> GHC.Types.IO (IORef a)
readIORef :: forall a. IORef a -> GHC.Types.IO a
writeIORef :: forall a. IORef a -> a -> GHC.Types.IO ()
module Data.Int where
-- Safety: Trustworthy
type Int :: *
data Int = ...
type Int16 :: *
data Int16 = ...
type Int32 :: *
data Int32 = ...
type Int64 :: *
data Int64 = ...
type Int8 :: *
data Int8 = ...
module Data.Ix where
-- Safety: Trustworthy
type Ix :: * -> Constraint
class GHC.Classes.Ord a => Ix a where
range :: (a, a) -> [a]
index :: (a, a) -> a -> GHC.Types.Int
...
inRange :: (a, a) -> a -> GHC.Types.Bool
rangeSize :: (a, a) -> GHC.Types.Int
...
{-# MINIMAL range, (index | GHC.Ix.unsafeIndex), inRange #-}
module Data.Kind where
-- Safety: Trustworthy
type Constraint :: *
type Constraint = GHC.Prim.CONSTRAINT GHC.Types.LiftedRep
type role FUN nominal representational representational
type FUN :: forall (n :: GHC.Types.Multiplicity) -> forall {q :: GHC.Types.RuntimeRep} {r :: GHC.Types.RuntimeRep}. TYPE q -> TYPE r -> *
data FUN n a b
type Type :: *
type Type = TYPE GHC.Types.LiftedRep
module Data.List where
-- Safety: Trustworthy
(!!) :: forall a. GHC.Stack.Types.HasCallStack => [a] -> GHC.Types.Int -> a
(!?) :: forall a. [a] -> GHC.Types.Int -> GHC.Maybe.Maybe a
(++) :: forall a. [a] -> [a] -> [a]
type List :: * -> *
data List a = ...
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
(\\) :: forall a. GHC.Classes.Eq a => [a] -> [a] -> [a]
all :: forall (t :: * -> *) a. Data.Foldable.Foldable t => (a -> GHC.Types.Bool) -> t a -> GHC.Types.Bool
and :: forall (t :: * -> *). Data.Foldable.Foldable t => t GHC.Types.Bool -> GHC.Types.Bool
any :: forall (t :: * -> *) a. Data.Foldable.Foldable t => (a -> GHC.Types.Bool) -> t a -> GHC.Types.Bool
break :: forall a. (a -> GHC.Types.Bool) -> [a] -> ([a], [a])
concat :: forall (t :: * -> *) a. Data.Foldable.Foldable t => t [a] -> [a]
concatMap :: forall (t :: * -> *) a b. Data.Foldable.Foldable t => (a -> [b]) -> t a -> [b]
cycle :: forall a. GHC.Stack.Types.HasCallStack => [a] -> [a]
delete :: forall a. GHC.Classes.Eq a => a -> [a] -> [a]
deleteBy :: forall a. (a -> a -> GHC.Types.Bool) -> a -> [a] -> [a]
deleteFirstsBy :: forall a. (a -> a -> GHC.Types.Bool) -> [a] -> [a] -> [a]
drop :: forall a. GHC.Types.Int -> [a] -> [a]
dropWhile :: forall a. (a -> GHC.Types.Bool) -> [a] -> [a]
dropWhileEnd :: forall a. (a -> GHC.Types.Bool) -> [a] -> [a]
elem :: forall (t :: * -> *) a. (Data.Foldable.Foldable t, GHC.Classes.Eq a) => a -> t a -> GHC.Types.Bool
elemIndex :: forall a. GHC.Classes.Eq a => a -> [a] -> GHC.Maybe.Maybe GHC.Types.Int
elemIndices :: forall a. GHC.Classes.Eq a => a -> [a] -> [GHC.Types.Int]
filter :: forall a. (a -> GHC.Types.Bool) -> [a] -> [a]
find :: forall (t :: * -> *) a. Data.Foldable.Foldable t => (a -> GHC.Types.Bool) -> t a -> GHC.Maybe.Maybe a
findIndex :: forall a. (a -> GHC.Types.Bool) -> [a] -> GHC.Maybe.Maybe GHC.Types.Int
findIndices :: forall a. (a -> GHC.Types.Bool) -> [a] -> [GHC.Types.Int]
foldl :: forall (t :: * -> *) b a. Data.Foldable.Foldable t => (b -> a -> b) -> b -> t a -> b
foldl' :: forall (t :: * -> *) b a. Data.Foldable.Foldable t => (b -> a -> b) -> b -> t a -> b
foldl1 :: forall (t :: * -> *) a. Data.Foldable.Foldable t => (a -> a -> a) -> t a -> a
foldl1' :: forall a. GHC.Stack.Types.HasCallStack => (a -> a -> a) -> [a] -> a
foldr :: forall (t :: * -> *) a b. Data.Foldable.Foldable t => (a -> b -> b) -> b -> t a -> b
foldr1 :: forall (t :: * -> *) a. Data.Foldable.Foldable t => (a -> a -> a) -> t a -> a
genericDrop :: forall i a. GHC.Real.Integral i => i -> [a] -> [a]
genericIndex :: forall i a. GHC.Real.Integral i => [a] -> i -> a
genericLength :: forall i a. GHC.Num.Num i => [a] -> i
genericReplicate :: forall i a. GHC.Real.Integral i => i -> a -> [a]
genericSplitAt :: forall i a. GHC.Real.Integral i => i -> [a] -> ([a], [a])
genericTake :: forall i a. GHC.Real.Integral i => i -> [a] -> [a]
group :: forall a. GHC.Classes.Eq a => [a] -> [[a]]
groupBy :: forall a. (a -> a -> GHC.Types.Bool) -> [a] -> [[a]]
head :: forall a. GHC.Stack.Types.HasCallStack => [a] -> a
init :: forall a. GHC.Stack.Types.HasCallStack => [a] -> [a]
inits :: forall a. [a] -> [[a]]
insert :: forall a. GHC.Classes.Ord a => a -> [a] -> [a]
insertBy :: forall a. (a -> a -> GHC.Types.Ordering) -> a -> [a] -> [a]
intercalate :: forall a. [a] -> [[a]] -> [a]
intersect :: forall a. GHC.Classes.Eq a => [a] -> [a] -> [a]
intersectBy :: forall a. (a -> a -> GHC.Types.Bool) -> [a] -> [a] -> [a]
intersperse :: forall a. a -> [a] -> [a]
isInfixOf :: forall a. GHC.Classes.Eq a => [a] -> [a] -> GHC.Types.Bool
isPrefixOf :: forall a. GHC.Classes.Eq a => [a] -> [a] -> GHC.Types.Bool
isSubsequenceOf :: forall a. GHC.Classes.Eq a => [a] -> [a] -> GHC.Types.Bool
isSuffixOf :: forall a. GHC.Classes.Eq a => [a] -> [a] -> GHC.Types.Bool
iterate :: forall a. (a -> a) -> a -> [a]
iterate' :: forall a. (a -> a) -> a -> [a]
last :: forall a. GHC.Stack.Types.HasCallStack => [a] -> a
length :: forall (t :: * -> *) a. Data.Foldable.Foldable t => t a -> GHC.Types.Int
lines :: GHC.Base.String -> [GHC.Base.String]
lookup :: forall a b. GHC.Classes.Eq a => a -> [(a, b)] -> GHC.Maybe.Maybe b
map :: forall a b. (a -> b) -> [a] -> [b]
mapAccumL :: forall (t :: * -> *) s a b. Data.Traversable.Traversable t => (s -> a -> (s, b)) -> s -> t a -> (s, t b)
mapAccumR :: forall (t :: * -> *) s a b. Data.Traversable.Traversable t => (s -> a -> (s, b)) -> s -> t a -> (s, t b)
maximum :: forall (t :: * -> *) a. (Data.Foldable.Foldable t, GHC.Classes.Ord a) => t a -> a
maximumBy :: forall (t :: * -> *) a. Data.Foldable.Foldable t => (a -> a -> GHC.Types.Ordering) -> t a -> a
minimum :: forall (t :: * -> *) a. (Data.Foldable.Foldable t, GHC.Classes.Ord a) => t a -> a
minimumBy :: forall (t :: * -> *) a. Data.Foldable.Foldable t => (a -> a -> GHC.Types.Ordering) -> t a -> a
notElem :: forall (t :: * -> *) a. (Data.Foldable.Foldable t, GHC.Classes.Eq a) => a -> t a -> GHC.Types.Bool
nub :: forall a. GHC.Classes.Eq a => [a] -> [a]
nubBy :: forall a. (a -> a -> GHC.Types.Bool) -> [a] -> [a]
null :: forall (t :: * -> *) a. Data.Foldable.Foldable t => t a -> GHC.Types.Bool
or :: forall (t :: * -> *). Data.Foldable.Foldable t => t GHC.Types.Bool -> GHC.Types.Bool
partition :: forall a. (a -> GHC.Types.Bool) -> [a] -> ([a], [a])
permutations :: forall a. [a] -> [[a]]
product :: forall (t :: * -> *) a. (Data.Foldable.Foldable t, GHC.Num.Num a) => t a -> a
repeat :: forall a. a -> [a]
replicate :: forall a. GHC.Types.Int -> a -> [a]
reverse :: forall a. [a] -> [a]
scanl :: forall b a. (b -> a -> b) -> b -> [a] -> [b]
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]
singleton :: forall a. a -> [a]
sort :: forall a. GHC.Classes.Ord a => [a] -> [a]
sortBy :: forall a. (a -> a -> GHC.Types.Ordering) -> [a] -> [a]
sortOn :: forall b a. GHC.Classes.Ord b => (a -> b) -> [a] -> [a]
span :: forall a. (a -> GHC.Types.Bool) -> [a] -> ([a], [a])
splitAt :: forall a. GHC.Types.Int -> [a] -> ([a], [a])
stripPrefix :: forall a. GHC.Classes.Eq a => [a] -> [a] -> GHC.Maybe.Maybe [a]
subsequences :: forall a. [a] -> [[a]]
sum :: forall (t :: * -> *) a. (Data.Foldable.Foldable t, GHC.Num.Num a) => t a -> a
tail :: forall a. GHC.Stack.Types.HasCallStack => [a] -> [a]
tails :: forall a. [a] -> [[a]]
take :: forall a. GHC.Types.Int -> [a] -> [a]
takeWhile :: forall a. (a -> GHC.Types.Bool) -> [a] -> [a]
transpose :: forall a. [[a]] -> [[a]]
uncons :: forall a. [a] -> GHC.Maybe.Maybe (a, [a])
unfoldr :: forall b a. (b -> GHC.Maybe.Maybe (a, b)) -> b -> [a]
union :: forall a. GHC.Classes.Eq a => [a] -> [a] -> [a]
unionBy :: forall a. (a -> a -> GHC.Types.Bool) -> [a] -> [a] -> [a]
unlines :: [GHC.Base.String] -> GHC.Base.String
unsnoc :: forall a. [a] -> GHC.Maybe.Maybe ([a], a)
unwords :: [GHC.Base.String] -> GHC.Base.String
unzip :: forall a b. [(a, b)] -> ([a], [b])
unzip3 :: forall a b c. [(a, b, c)] -> ([a], [b], [c])
unzip4 :: forall a b c d. [(a, b, c, d)] -> ([a], [b], [c], [d])
unzip5 :: forall a b c d e. [(a, b, c, d, e)] -> ([a], [b], [c], [d], [e])
unzip6 :: forall a b c d e f. [(a, b, c, d, e, f)] -> ([a], [b], [c], [d], [e], [f])
unzip7 :: forall a b c d e f g. [(a, b, c, d, e, f, g)] -> ([a], [b], [c], [d], [e], [f], [g])
words :: GHC.Base.String -> [GHC.Base.String]
zip :: forall a b. [a] -> [b] -> [(a, b)]
zip3 :: forall a b c. [a] -> [b] -> [c] -> [(a, b, c)]
zip4 :: forall a b c d. [a] -> [b] -> [c] -> [d] -> [(a, b, c, d)]
zip5 :: forall a b c d e. [a] -> [b] -> [c] -> [d] -> [e] -> [(a, b, c, d, e)]
zip6 :: forall a b c d e f. [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [(a, b, c, d, e, f)]
zip7 :: forall a b c d e f g. [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g] -> [(a, b, c, d, e, f, g)]
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]
zipWith4 :: forall a b c d e. (a -> b -> c -> d -> e) -> [a] -> [b] -> [c] -> [d] -> [e]
zipWith5 :: forall a b c d e f. (a -> b -> c -> d -> e -> f) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f]
zipWith6 :: forall a b c d e f g. (a -> b -> c -> d -> e -> f -> g) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g]
zipWith7 :: forall a b c d e f g h. (a -> b -> c -> d -> e -> f -> g -> h) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g] -> [h]
module Data.List.NonEmpty where
-- Safety: Trustworthy
(!!) :: forall a. GHC.Stack.Types.HasCallStack => NonEmpty a -> GHC.Types.Int -> a
(<|) :: forall a. a -> NonEmpty a -> NonEmpty a
type NonEmpty :: * -> *
data NonEmpty a = a :| [a]
append :: forall a. NonEmpty a -> NonEmpty a -> NonEmpty a
appendList :: forall a. NonEmpty a -> [a] -> NonEmpty a
break :: forall a. (a -> GHC.Types.Bool) -> NonEmpty a -> ([a], [a])
cons :: forall a. a -> NonEmpty a -> NonEmpty a
cycle :: forall a. NonEmpty a -> NonEmpty a
drop :: forall a. GHC.Types.Int -> NonEmpty a -> [a]
dropWhile :: forall a. (a -> GHC.Types.Bool) -> NonEmpty a -> [a]
filter :: forall a. (a -> GHC.Types.Bool) -> NonEmpty a -> [a]
fromList :: forall a. GHC.Stack.Types.HasCallStack => [a] -> NonEmpty a
group :: forall (f :: * -> *) a. (Data.Foldable.Foldable f, GHC.Classes.Eq a) => f a -> [NonEmpty a]
group1 :: forall a. GHC.Classes.Eq a => NonEmpty a -> NonEmpty (NonEmpty a)
groupAllWith :: forall b a. GHC.Classes.Ord b => (a -> b) -> [a] -> [NonEmpty a]
groupAllWith1 :: forall b a. GHC.Classes.Ord b => (a -> b) -> NonEmpty a -> NonEmpty (NonEmpty a)
groupBy :: forall (f :: * -> *) a. Data.Foldable.Foldable f => (a -> a -> GHC.Types.Bool) -> f a -> [NonEmpty a]
groupBy1 :: forall a. (a -> a -> GHC.Types.Bool) -> NonEmpty a -> NonEmpty (NonEmpty a)
groupWith :: forall (f :: * -> *) b a. (Data.Foldable.Foldable f, GHC.Classes.Eq b) => (a -> b) -> f a -> [NonEmpty a]
groupWith1 :: forall b a. GHC.Classes.Eq b => (a -> b) -> NonEmpty a -> NonEmpty (NonEmpty a)
head :: forall a. NonEmpty a -> a
init :: forall a. NonEmpty a -> [a]
inits :: forall (f :: * -> *) a. Data.Foldable.Foldable f => f a -> NonEmpty [a]
inits1 :: forall a. NonEmpty a -> NonEmpty (NonEmpty a)
insert :: forall (f :: * -> *) a. (Data.Foldable.Foldable f, GHC.Classes.Ord a) => a -> f a -> NonEmpty a
intersperse :: forall a. a -> NonEmpty a -> NonEmpty a
isPrefixOf :: forall a. GHC.Classes.Eq a => [a] -> NonEmpty a -> GHC.Types.Bool
iterate :: forall a. (a -> a) -> a -> NonEmpty a
last :: forall a. NonEmpty a -> a
length :: forall a. NonEmpty a -> GHC.Types.Int
map :: forall a b. (a -> b) -> NonEmpty a -> NonEmpty b
nonEmpty :: forall a. [a] -> GHC.Maybe.Maybe (NonEmpty a)
nub :: forall a. GHC.Classes.Eq a => NonEmpty a -> NonEmpty a
nubBy :: forall a. (a -> a -> GHC.Types.Bool) -> NonEmpty a -> NonEmpty a
partition :: forall a. (a -> GHC.Types.Bool) -> NonEmpty a -> ([a], [a])
permutations :: forall a. [a] -> NonEmpty [a]
permutations1 :: forall a. NonEmpty a -> NonEmpty (NonEmpty a)
prependList :: forall a. [a] -> NonEmpty a -> NonEmpty a
repeat :: forall a. a -> NonEmpty a
reverse :: forall a. NonEmpty a -> NonEmpty a
scanl :: forall (f :: * -> *) b a. Data.Foldable.Foldable f => (b -> a -> b) -> b -> f a -> NonEmpty b
scanl1 :: forall a. (a -> a -> a) -> NonEmpty a -> NonEmpty a
scanr :: forall (f :: * -> *) a b. Data.Foldable.Foldable f => (a -> b -> b) -> b -> f a -> NonEmpty b
scanr1 :: forall a. (a -> a -> a) -> NonEmpty a -> NonEmpty a
singleton :: forall a. a -> NonEmpty a
some1 :: forall (f :: * -> *) a. GHC.Base.Alternative f => f a -> f (NonEmpty a)
sort :: forall a. GHC.Classes.Ord a => NonEmpty a -> NonEmpty a
sortBy :: forall a. (a -> a -> GHC.Types.Ordering) -> NonEmpty a -> NonEmpty a
sortOn :: forall b a. GHC.Classes.Ord b => (a -> b) -> NonEmpty a -> NonEmpty a
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
sortWith :: forall o a. GHC.Classes.Ord o => (a -> o) -> NonEmpty a -> NonEmpty a
span :: forall a. (a -> GHC.Types.Bool) -> NonEmpty a -> ([a], [a])
splitAt :: forall a. GHC.Types.Int -> NonEmpty a -> ([a], [a])
tail :: forall a. NonEmpty a -> [a]
tails :: forall (f :: * -> *) a. Data.Foldable.Foldable f => f a -> NonEmpty [a]
tails1 :: forall a. NonEmpty a -> NonEmpty (NonEmpty a)
take :: forall a. GHC.Types.Int -> NonEmpty a -> [a]
takeWhile :: forall a. (a -> GHC.Types.Bool) -> NonEmpty a -> [a]
toList :: forall a. NonEmpty a -> [a]
transpose :: forall a. NonEmpty (NonEmpty a) -> NonEmpty (NonEmpty a)
uncons :: forall a. NonEmpty a -> (a, GHC.Maybe.Maybe (NonEmpty a))
unfold :: forall a b. (a -> (b, GHC.Maybe.Maybe a)) -> a -> NonEmpty b
unfoldr :: forall a b. (a -> (b, GHC.Maybe.Maybe a)) -> a -> NonEmpty b
unzip :: forall (f :: * -> *) a b. GHC.Base.Functor f => f (a, b) -> (f a, f b)
xor :: NonEmpty GHC.Types.Bool -> GHC.Types.Bool
zip :: forall a b. NonEmpty a -> NonEmpty b -> NonEmpty (a, b)
zipWith :: forall a b c. (a -> b -> c) -> NonEmpty a -> NonEmpty b -> NonEmpty c
module Data.Maybe where
-- Safety: Trustworthy
type Maybe :: * -> *
data Maybe a = Nothing | Just a
catMaybes :: forall a. [Maybe a] -> [a]
fromJust :: forall a. GHC.Stack.Types.HasCallStack => Maybe a -> a
fromMaybe :: forall a. a -> Maybe a -> a
isJust :: forall a. Maybe a -> GHC.Types.Bool
isNothing :: forall a. Maybe a -> GHC.Types.Bool
listToMaybe :: forall a. [a] -> Maybe a
mapMaybe :: forall a b. (a -> Maybe b) -> [a] -> [b]
maybe :: forall b a. b -> (a -> b) -> Maybe a -> b
maybeToList :: forall a. Maybe a -> [a]
module Data.Monoid where
-- Safety: Trustworthy
(<>) :: forall a. GHC.Base.Semigroup a => a -> a -> a
type All :: *
newtype All = All {getAll :: GHC.Types.Bool}
type role Alt representational nominal
type Alt :: forall {k}. (k -> *) -> k -> *
newtype Alt f a = Alt {getAlt :: f a}
type Any :: *
newtype Any = Any {getAny :: GHC.Types.Bool}
type role Ap representational nominal
type Ap :: forall {k}. (k -> *) -> k -> *
newtype Ap f a = Ap {getAp :: f a}
type Dual :: * -> *
newtype Dual a = Dual {getDual :: a}
type Endo :: * -> *
newtype Endo a = Endo {appEndo :: a -> a}
type First :: * -> *
newtype First a = First {getFirst :: GHC.Maybe.Maybe a}
type Last :: * -> *
newtype Last a = Last {getLast :: GHC.Maybe.Maybe a}
type Monoid :: * -> Constraint
class GHC.Base.Semigroup a => Monoid a where
mempty :: a
mappend :: a -> a -> a
mconcat :: [a] -> a
{-# MINIMAL mempty | mconcat #-}
type Product :: * -> *
newtype Product a = Product {getProduct :: a}
type Sum :: * -> *
newtype Sum a = Sum {getSum :: a}
module Data.Ord where
-- Safety: Trustworthy
type Down :: * -> *
newtype Down a = Down {getDown :: a}
type Ord :: * -> Constraint
class GHC.Classes.Eq a => Ord a where
compare :: a -> a -> Ordering
(<) :: a -> a -> GHC.Types.Bool
(<=) :: a -> a -> GHC.Types.Bool
(>) :: a -> a -> GHC.Types.Bool
(>=) :: a -> a -> GHC.Types.Bool
max :: a -> a -> a
min :: a -> a -> a
{-# MINIMAL compare | (<=) #-}
type Ordering :: *
data Ordering = LT | EQ | GT
clamp :: forall a. Ord a => (a, a) -> a -> a
comparing :: forall a b. Ord a => (b -> a) -> b -> b -> Ordering
module Data.Proxy where
-- Safety: Trustworthy
type role KProxy phantom
type KProxy :: * -> *
data KProxy t = KProxy
type role Proxy phantom
type Proxy :: forall {k}. k -> *
data Proxy t = Proxy
asProxyTypeOf :: forall a (proxy :: * -> *). a -> proxy a -> a
module Data.Ratio where
-- Safety: Safe
(%) :: forall a. GHC.Real.Integral a => a -> a -> Ratio a
type Ratio :: * -> *
data Ratio a = ...
type Rational :: *
type Rational = Ratio GHC.Num.Integer.Integer
approxRational :: forall a. GHC.Real.RealFrac a => a -> a -> Rational
denominator :: forall a. Ratio a -> a
numerator :: forall a. Ratio a -> a
module Data.STRef where
-- Safety: Trustworthy
type role STRef nominal representational
type STRef :: * -> * -> *
data STRef s a = ...
modifySTRef :: forall s a. STRef s a -> (a -> a) -> GHC.ST.ST s ()
modifySTRef' :: forall s a. STRef s a -> (a -> a) -> GHC.ST.ST s ()
newSTRef :: forall a s. a -> GHC.ST.ST s (STRef s a)
readSTRef :: forall s a. STRef s a -> GHC.ST.ST s a
writeSTRef :: forall s a. STRef s a -> a -> GHC.ST.ST s ()
module Data.STRef.Lazy where
-- Safety: Safe
type role STRef nominal representational
type STRef :: * -> * -> *
data STRef s a = ...
modifySTRef :: forall s a. STRef s a -> (a -> a) -> ghc-internal-0.1.0.0:Control.Monad.ST.Lazy.Imp.ST s ()
newSTRef :: forall a s. a -> ghc-internal-0.1.0.0:Control.Monad.ST.Lazy.Imp.ST s (STRef s a)
readSTRef :: forall s a. STRef s a -> ghc-internal-0.1.0.0:Control.Monad.ST.Lazy.Imp.ST s a
writeSTRef :: forall s a. STRef s a -> a -> ghc-internal-0.1.0.0:Control.Monad.ST.Lazy.Imp.ST s ()
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
module Data.STRef.Strict where
-- Safety: Safe
type role STRef nominal representational
type STRef :: * -> * -> *
data STRef s a = ...
modifySTRef :: forall s a. STRef s a -> (a -> a) -> GHC.ST.ST s ()
modifySTRef' :: forall s a. STRef s a -> (a -> a) -> GHC.ST.ST s ()
newSTRef :: forall a s. a -> GHC.ST.ST s (STRef s a)
readSTRef :: forall s a. STRef s a -> GHC.ST.ST s a
writeSTRef :: forall s a. STRef s a -> a -> GHC.ST.ST s ()
module Data.Semigroup where
-- Safety: Trustworthy
type All :: *
newtype All = All {getAll :: GHC.Types.Bool}
type Any :: *
newtype Any = Any {getAny :: GHC.Types.Bool}
type Arg :: * -> * -> *
data Arg a b = Arg a b
type ArgMax :: * -> * -> *
type ArgMax a b = Max (Arg a b)
type ArgMin :: * -> * -> *
type ArgMin a b = Min (Arg a b)
type Dual :: * -> *
newtype Dual a = Dual {getDual :: a}
type Endo :: * -> *
newtype Endo a = Endo {appEndo :: a -> a}
type First :: * -> *
newtype First a = First {getFirst :: a}
type Last :: * -> *
newtype Last a = Last {getLast :: a}
type Max :: * -> *
newtype Max a = Max {getMax :: a}
type Min :: * -> *
newtype Min a = Min {getMin :: a}
type Product :: * -> *
newtype Product a = Product {getProduct :: a}
type Semigroup :: * -> Constraint
class Semigroup a where
(<>) :: a -> a -> a
sconcat :: GHC.Base.NonEmpty a -> a
stimes :: forall b. GHC.Real.Integral b => b -> a -> a
{-# MINIMAL (<>) | sconcat #-}
type Sum :: * -> *
newtype Sum a = Sum {getSum :: a}
type WrappedMonoid :: * -> *
newtype WrappedMonoid m = WrapMonoid {unwrapMonoid :: m}
cycle1 :: forall m. Semigroup m => m -> m
diff :: forall m. Semigroup m => m -> Endo m
mtimesDefault :: forall b a. (GHC.Real.Integral b, GHC.Base.Monoid a) => b -> a -> a
stimesIdempotent :: forall b a. GHC.Real.Integral b => b -> a -> a
stimesIdempotentMonoid :: forall b a. (GHC.Real.Integral b, GHC.Base.Monoid a) => b -> a -> a
stimesMonoid :: forall b a. (GHC.Real.Integral b, GHC.Base.Monoid a) => b -> a -> a
module Data.String where
-- Safety: Trustworthy
type IsString :: * -> Constraint
class IsString a where
fromString :: String -> a
{-# MINIMAL fromString #-}
type String :: *
type String = [GHC.Types.Char]
lines :: String -> [String]
unlines :: [String] -> String
unwords :: [String] -> String
words :: String -> [String]
module Data.Traversable where
-- Safety: Trustworthy
type Traversable :: (* -> *) -> Constraint
class (GHC.Base.Functor t, Data.Foldable.Foldable t) => Traversable t where
traverse :: forall (f :: * -> *) a b. GHC.Base.Applicative f => (a -> f b) -> t a -> f (t b)
sequenceA :: forall (f :: * -> *) a. GHC.Base.Applicative f => t (f a) -> f (t a)
mapM :: forall (m :: * -> *) a b. GHC.Base.Monad m => (a -> m b) -> t a -> m (t b)
sequence :: forall (m :: * -> *) a. GHC.Base.Monad m => t (m a) -> m (t a)
{-# MINIMAL traverse | sequenceA #-}
fmapDefault :: forall (t :: * -> *) a b. Traversable t => (a -> b) -> t a -> t b
foldMapDefault :: forall (t :: * -> *) m a. (Traversable t, GHC.Base.Monoid m) => (a -> m) -> t a -> m
for :: forall (t :: * -> *) (f :: * -> *) a b. (Traversable t, GHC.Base.Applicative f) => t a -> (a -> f b) -> f (t b)
forAccumM :: forall (m :: * -> *) (t :: * -> *) s a b. (GHC.Base.Monad m, Traversable t) => s -> t a -> (s -> a -> m (s, b)) -> m (s, t b)
forM :: forall (t :: * -> *) (m :: * -> *) a b. (Traversable t, GHC.Base.Monad m) => t a -> (a -> m b) -> m (t b)
mapAccumL :: forall (t :: * -> *) s a b. Traversable t => (s -> a -> (s, b)) -> s -> t a -> (s, t b)
mapAccumM :: forall (m :: * -> *) (t :: * -> *) s a b. (GHC.Base.Monad m, Traversable t) => (s -> a -> m (s, b)) -> s -> t a -> m (s, t b)
mapAccumR :: forall (t :: * -> *) s a b. Traversable t => (s -> a -> (s, b)) -> s -> t a -> (s, t b)
module Data.Tuple where
-- Safety: Trustworthy
pattern Solo :: forall a. a -> Solo a
type Solo :: * -> *
data Solo a = MkSolo a
curry :: forall a b c. ((a, b) -> c) -> a -> b -> c
fst :: forall a b. (a, b) -> a
getSolo :: forall a. Solo a -> a
snd :: forall a b. (a, b) -> b
swap :: forall a b. (a, b) -> (b, a)
uncurry :: forall a b c. (a -> b -> c) -> (a, b) -> c
module Data.Type.Bool where
-- Safety: Safe
type (&&) :: GHC.Types.Bool -> GHC.Types.Bool -> GHC.Types.Bool
type family (&&) a b where
forall (a :: GHC.Types.Bool). (&&) GHC.Types.False a = GHC.Types.False
forall (a :: GHC.Types.Bool). (&&) GHC.Types.True a = a
forall (a :: GHC.Types.Bool). (&&) a GHC.Types.False = GHC.Types.False
forall (a :: GHC.Types.Bool). (&&) a GHC.Types.True = a
forall (a :: GHC.Types.Bool). (&&) a a = a
type If :: forall {k}. GHC.Types.Bool -> k -> k -> k
type family If cond tru fls where
forall k (tru :: k) (fls :: k). If GHC.Types.True tru fls = tru
forall k (tru :: k) (fls :: k). If GHC.Types.False tru fls = fls
type Not :: GHC.Types.Bool -> GHC.Types.Bool
type family Not a = res | res -> a where
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
Not GHC.Types.False = GHC.Types.True
Not GHC.Types.True = GHC.Types.False
type (||) :: GHC.Types.Bool -> GHC.Types.Bool -> GHC.Types.Bool
type family (||) a b where
forall (a :: GHC.Types.Bool). (||) GHC.Types.False a = a
forall (a :: GHC.Types.Bool). (||) GHC.Types.True a = GHC.Types.True
forall (a :: GHC.Types.Bool). (||) a GHC.Types.False = a
forall (a :: GHC.Types.Bool). (||) a GHC.Types.True = GHC.Types.True
forall (a :: GHC.Types.Bool). (||) a a = a
module Data.Type.Coercion where
-- Safety: None
type Coercion :: forall {k}. k -> k -> *
data Coercion a b where
Coercion :: forall {k} (a :: k) (b :: k). Coercible a b => Coercion a b
type TestCoercion :: forall {k}. (k -> *) -> Constraint
class TestCoercion f where
testCoercion :: forall (a :: k) (b :: k). f a -> f b -> GHC.Maybe.Maybe (Coercion a b)
{-# MINIMAL testCoercion #-}
coerceWith :: forall a b. Coercion a b -> a -> b
gcoerceWith :: forall {k} (a :: k) (b :: k) r. Coercion a b -> (Coercible a b => r) -> r
repr :: forall {k} (a :: k) (b :: k). (a Data.Type.Equality.:~: b) -> Coercion a b
sym :: forall {k} (a :: k) (b :: k). Coercion a b -> Coercion b a
trans :: forall {k} (a :: k) (b :: k) (c :: k). Coercion a b -> Coercion b c -> Coercion a c
module Data.Type.Equality where
-- Safety: Trustworthy
type role (:~:) nominal nominal
type (:~:) :: forall {k}. k -> k -> *
data (:~:) a b where
Refl :: forall {k} (a :: k). (:~:) a a
type role (:~~:) nominal nominal
type (:~~:) :: forall k1 k2. k1 -> k2 -> *
data (:~~:) a b where
HRefl :: forall {k1} (a :: k1). (:~~:) a a
type (==) :: forall k. k -> k -> GHC.Types.Bool
type family (==) a b where
forall k1 k2 (f :: k1 -> k2) (a :: k1) (g :: k1 -> k2) (b :: k1). (==) (f a) (g b) = (f == g) Data.Type.Bool.&& (a == b)
forall k (a :: k). (==) a a = GHC.Types.True
forall k (_1 :: k) (_2 :: k). (==) _1 _2 = GHC.Types.False
type TestEquality :: forall {k}. (k -> *) -> Constraint
class TestEquality f where
testEquality :: forall (a :: k) (b :: k). f a -> f b -> GHC.Maybe.Maybe (a :~: b)
{-# MINIMAL testEquality #-}
apply :: forall {k1} {k2} (f :: k1 -> k2) (g :: k1 -> k2) (a :: k1) (b :: k1). (f :~: g) -> (a :~: b) -> f a :~: g b
castWith :: forall a b. (a :~: b) -> a -> b
gcastWith :: forall {k} (a :: k) (b :: k) r. (a :~: b) -> ((a ~ b) => r) -> r
inner :: forall {k1} {k2} (f :: k1 -> k2) (a :: k1) (g :: k1 -> k2) (b :: k1). (f a :~: g b) -> a :~: b
outer :: forall {k1} {k2} (f :: k1 -> k2) (a :: k1) (g :: k1 -> k2) (b :: k1). (f a :~: g b) -> f :~: g
sym :: forall {k} (a :: k) (b :: k). (a :~: b) -> b :~: a
trans :: forall {k} (a :: k) (b :: k) (c :: k). (a :~: b) -> (b :~: c) -> a :~: c
type (~) :: forall k. k -> k -> Constraint
class (a ~ b) => (~) a b
{-# MINIMAL #-}
type (~~) :: forall k0 k1. k0 -> k1 -> Constraint
class (a ~~ b) => (~~) a b
{-# MINIMAL #-}
module Data.Type.Ord where
-- Safety: Trustworthy
type (<) :: forall {t}. t -> t -> Constraint
type (<) x y = GHC.TypeError.Assert (x <? y) (Data.Type.Ord.LtErrMsg x y) :: Constraint
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 = OrdCond (Compare m n) GHC.Types.True GHC.Types.True GHC.Types.False :: GHC.Types.Bool
type (<?) :: forall k. k -> k -> GHC.Types.Bool
type (<?) m n = OrdCond (Compare m n) GHC.Types.True GHC.Types.False GHC.Types.False :: GHC.Types.Bool
type (>) :: forall {t}. t -> t -> Constraint
type (>) x y = GHC.TypeError.Assert (x >? y) (Data.Type.Ord.GtErrMsg x y) :: Constraint
type (>=) :: forall {t}. t -> t -> Constraint
type (>=) x y = GHC.TypeError.Assert (x >=? y) (Data.Type.Ord.GeErrMsg x y) :: Constraint
type (>=?) :: forall k. k -> k -> GHC.Types.Bool
type (>=?) m n = OrdCond (Compare m n) GHC.Types.False GHC.Types.True GHC.Types.True :: GHC.Types.Bool
type (>?) :: forall k. k -> k -> GHC.Types.Bool
type (>?) m n = OrdCond (Compare m n) GHC.Types.False GHC.Types.False GHC.Types.True :: GHC.Types.Bool
type Compare :: forall k. k -> k -> GHC.Types.Ordering
type family Compare a b
type Max :: forall k. k -> k -> k
type Max m n = OrdCond (Compare m n) n n m :: k
type Min :: forall k. k -> k -> k
type Min m n = OrdCond (Compare m n) m m n :: k
type OrdCond :: forall k. GHC.Types.Ordering -> k -> k -> k -> k
type family OrdCond o lt eq gt where
forall k (lt :: k) (eq :: k) (gt :: k). OrdCond GHC.Types.LT lt eq gt = lt
forall k (lt :: k) (eq :: k) (gt :: k). OrdCond GHC.Types.EQ lt eq gt = eq
forall k (lt :: k) (eq :: k) (gt :: k). OrdCond GHC.Types.GT lt eq gt = gt
type role OrderingI nominal nominal
type OrderingI :: forall {k}. k -> k -> *
data OrderingI a b where
LTI :: forall {k} (a :: k) (b :: k). (Compare a b ~ GHC.Types.LT) => OrderingI a b
EQI :: forall {k} (a :: k). (Compare a a ~ GHC.Types.EQ) => OrderingI a a
GTI :: forall {k} (a :: k) (b :: k). (Compare a b ~ GHC.Types.GT) => OrderingI a b
module Data.Typeable where
-- Safety: Trustworthy
type role (:~:) nominal nominal
type (:~:) :: forall {k}. k -> k -> *
data (:~:) a b where
Refl :: forall {k} (a :: k). (:~:) a a
type role (:~~:) nominal nominal
type (:~~:) :: forall k1 k2. k1 -> k2 -> *
data (:~~:) a b where
HRefl :: forall {k1} (a :: k1). (:~~:) a a
type role Proxy phantom
type Proxy :: forall {k}. k -> *
data Proxy t = Proxy
type TyCon :: *
data TyCon = ...
type TypeRep :: *
type TypeRep = ghc-internal-0.1.0.0:Data.Typeable.Internal.SomeTypeRep
type Typeable :: forall k. k -> Constraint
class Typeable a where
...
{-# MINIMAL ghc-internal-0.1.0.0:Data.Typeable.Internal.typeRep# #-}
cast :: forall a b. (Typeable a, Typeable b) => a -> GHC.Maybe.Maybe b
decT :: forall {k} (a :: k) (b :: k). (Typeable a, Typeable b) => Data.Either.Either ((a :~: b) -> GHC.Base.Void) (a :~: b)
eqT :: forall {k} (a :: k) (b :: k). (Typeable a, Typeable b) => GHC.Maybe.Maybe (a :~: b)
funResultTy :: TypeRep -> TypeRep -> GHC.Maybe.Maybe TypeRep
gcast :: forall {k} (a :: k) (b :: k) (c :: k -> *). (Typeable a, Typeable b) => c a -> GHC.Maybe.Maybe (c b)
gcast1 :: forall {k1} {k2} (c :: k1 -> *) (t :: k2 -> k1) (t' :: k2 -> k1) (a :: k2). (Typeable t, Typeable t') => c (t a) -> GHC.Maybe.Maybe (c (t' a))
gcast2 :: forall {k1} {k2} {k3} (c :: k1 -> *) (t :: k2 -> k3 -> k1) (t' :: k2 -> k3 -> k1) (a :: k2) (b :: k3). (Typeable t, Typeable t') => c (t a b) -> GHC.Maybe.Maybe (c (t' a b))
hdecT :: forall {k1} {k2} (a :: k1) (b :: k2). (Typeable a, Typeable b) => Data.Either.Either ((a :~~: b) -> GHC.Base.Void) (a :~~: b)
heqT :: forall {k1} {k2} (a :: k1) (b :: k2). (Typeable a, Typeable b) => GHC.Maybe.Maybe (a :~~: b)
mkFunTy :: TypeRep -> TypeRep -> TypeRep
rnfTyCon :: TyCon -> ()
rnfTypeRep :: TypeRep -> ()
showsTypeRep :: TypeRep -> GHC.Show.ShowS
splitTyConApp :: TypeRep -> (TyCon, [TypeRep])
trLiftedRep :: ghc-internal-0.1.0.0:Data.Typeable.Internal.TypeRep GHC.Types.LiftedRep
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
tyConFingerprint :: TyCon -> GHC.Fingerprint.Type.Fingerprint
tyConModule :: TyCon -> GHC.Base.String
tyConName :: TyCon -> GHC.Base.String
tyConPackage :: TyCon -> GHC.Base.String
typeOf :: forall a. Typeable a => a -> TypeRep
typeOf1 :: forall (t :: * -> *) a. Typeable t => t a -> TypeRep
typeOf2 :: forall (t :: * -> * -> *) a b. Typeable t => t a b -> TypeRep
typeOf3 :: forall (t :: * -> * -> * -> *) a b c. Typeable t => t a b c -> TypeRep
typeOf4 :: forall (t :: * -> * -> * -> * -> *) a b c d. Typeable t => t a b c d -> TypeRep
typeOf5 :: forall (t :: * -> * -> * -> * -> * -> *) a b c d e. Typeable t => t a b c d e -> TypeRep
typeOf6 :: forall (t :: * -> * -> * -> * -> * -> * -> *) a b c d e f. Typeable t => t a b c d e f -> TypeRep
typeOf7 :: forall (t :: * -> * -> * -> * -> * -> * -> * -> *) a b c d e f g. Typeable t => t a b c d e f g -> TypeRep
typeRep :: forall {k} (proxy :: k -> *) (a :: k). Typeable a => proxy a -> TypeRep
typeRepArgs :: TypeRep -> [TypeRep]
typeRepFingerprint :: TypeRep -> GHC.Fingerprint.Type.Fingerprint
typeRepTyCon :: TypeRep -> TyCon
module Data.Unique where
-- Safety: Trustworthy
type Unique :: *
newtype Unique = ...
hashUnique :: Unique -> GHC.Types.Int
newUnique :: GHC.Types.IO Unique
module Data.Version where
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
type Version :: *
data Version = Version {versionBranch :: [GHC.Types.Int], versionTags :: [GHC.Base.String]}
makeVersion :: [GHC.Types.Int] -> Version
parseVersion :: Text.ParserCombinators.ReadP.ReadP Version
showVersion :: Version -> GHC.Base.String
module Data.Void where
-- Safety: Trustworthy
type Void :: *
data Void
absurd :: forall a. Void -> a
vacuous :: forall (f :: * -> *) a. GHC.Base.Functor f => f Void -> f a
module Data.Word where
-- Safety: Safe
type Word :: *
data Word = ...
type Word16 :: *
data Word16 = ...
type Word32 :: *
data Word32 = ...
type Word64 :: *
data Word64 = ...
type Word8 :: *
data Word8 = ...
bitReverse16 :: Word16 -> Word16
bitReverse32 :: Word32 -> Word32
bitReverse64 :: Word64 -> Word64
bitReverse8 :: Word8 -> Word8
byteSwap16 :: Word16 -> Word16
byteSwap32 :: Word32 -> Word32
byteSwap64 :: Word64 -> Word64
module Debug.Trace where
-- Safety: Unsafe
flushEventLog :: GHC.Types.IO ()
putTraceMsg :: GHC.Base.String -> GHC.Types.IO ()
trace :: forall a. GHC.Base.String -> a -> a
traceEvent :: forall a. GHC.Base.String -> a -> a
traceEventIO :: GHC.Base.String -> GHC.Types.IO ()
traceEventWith :: forall a. (a -> GHC.Base.String) -> a -> a
traceIO :: GHC.Base.String -> GHC.Types.IO ()
traceId :: GHC.Base.String -> GHC.Base.String
traceM :: forall (f :: * -> *). GHC.Base.Applicative f => GHC.Base.String -> f ()
traceMarker :: forall a. GHC.Base.String -> a -> a
traceMarkerIO :: GHC.Base.String -> GHC.Types.IO ()
traceShow :: forall a b. GHC.Show.Show a => a -> b -> b
traceShowId :: forall a. GHC.Show.Show a => a -> a
traceShowM :: forall a (f :: * -> *). (GHC.Show.Show a, GHC.Base.Applicative f) => a -> f ()
traceShowWith :: forall b a. GHC.Show.Show b => (a -> b) -> a -> a
traceStack :: forall a. GHC.Base.String -> a -> a
traceWith :: forall a. (a -> GHC.Base.String) -> a -> a
module Foreign where
-- Safety: Safe
(!<<.) :: forall a. Bits a => a -> Int -> a
(!>>.) :: forall a. Bits a => a -> Int -> a
(.<<.) :: forall a. Bits a => a -> Int -> a
(.>>.) :: forall a. Bits a => a -> Int -> a
(.^.) :: forall a. Bits a => a -> a -> a
type And :: * -> *
newtype And a = And {getAnd :: a}
type Bits :: * -> Constraint
class GHC.Classes.Eq a => Bits a where
(.&.) :: a -> a -> a
(.|.) :: a -> a -> a
xor :: a -> a -> a
complement :: a -> a
shift :: a -> Int -> a
rotate :: a -> Int -> a
zeroBits :: a
bit :: Int -> a
setBit :: a -> Int -> a
clearBit :: a -> Int -> a
complementBit :: a -> Int -> a
testBit :: a -> Int -> GHC.Types.Bool
bitSizeMaybe :: a -> GHC.Maybe.Maybe Int
bitSize :: a -> Int
isSigned :: a -> GHC.Types.Bool
shiftL :: a -> Int -> a
unsafeShiftL :: a -> Int -> a
shiftR :: a -> Int -> a
unsafeShiftR :: a -> Int -> a
rotateL :: a -> Int -> a
rotateR :: a -> Int -> a
popCount :: a -> Int
{-# MINIMAL (.&.), (.|.), xor, complement, (shift | (shiftL, shiftR)), (rotate | (rotateL, rotateR)), bitSize, bitSizeMaybe, isSigned, testBit, bit, popCount #-}
type FinalizerEnvPtr :: * -> * -> *
type FinalizerEnvPtr env a = FunPtr (Ptr env -> Ptr a -> GHC.Types.IO ())
type FinalizerPtr :: * -> *
type FinalizerPtr a = FunPtr (Ptr a -> GHC.Types.IO ())
type FiniteBits :: * -> Constraint
class Bits b => FiniteBits b where
finiteBitSize :: b -> Int
countLeadingZeros :: b -> Int
countTrailingZeros :: b -> Int
{-# MINIMAL finiteBitSize #-}
type role ForeignPtr phantom
type ForeignPtr :: * -> *
data ForeignPtr a = ...
type role FunPtr phantom
type FunPtr :: * -> *
data FunPtr a = ...
type Iff :: * -> *
newtype Iff a = Iff {getIff :: a}
type Int :: *
data Int = ...
type Int16 :: *
data Int16 = ...
type Int32 :: *
data Int32 = ...
type Int64 :: *
data Int64 = ...
type Int8 :: *
data Int8 = ...
type IntPtr :: *
newtype IntPtr = IntPtr Int
type Ior :: * -> *
newtype Ior a = Ior {getIor :: a}
type Pool :: *
newtype Pool = ...
type role Ptr phantom
type Ptr :: * -> *
data Ptr a = ...
type StablePtr :: * -> *
data StablePtr a = ...
type Storable :: * -> Constraint
class Storable a where
sizeOf :: a -> Int
alignment :: a -> Int
peekElemOff :: Ptr a -> Int -> GHC.Types.IO a
pokeElemOff :: Ptr a -> Int -> a -> GHC.Types.IO ()
peekByteOff :: forall b. Ptr b -> Int -> GHC.Types.IO a
pokeByteOff :: forall b. Ptr b -> Int -> a -> GHC.Types.IO ()
peek :: Ptr a -> GHC.Types.IO a
poke :: Ptr a -> a -> GHC.Types.IO ()
{-# MINIMAL sizeOf, alignment, (peek | peekElemOff | peekByteOff), (poke | pokeElemOff | pokeByteOff) #-}
type Word :: *
data Word = ...
type Word16 :: *
data Word16 = ...
type Word32 :: *
data Word32 = ...
type Word64 :: *
data Word64 = ...
type Word8 :: *
data Word8 = ...
type WordPtr :: *
newtype WordPtr = WordPtr Word
type Xor :: * -> *
newtype Xor a = Xor {getXor :: a}
addForeignPtrFinalizer :: forall a. FinalizerPtr a -> ForeignPtr a -> GHC.Types.IO ()
addForeignPtrFinalizerEnv :: forall env a. FinalizerEnvPtr env a -> Ptr env -> ForeignPtr a -> GHC.Types.IO ()
advancePtr :: forall a. Storable a => Ptr a -> Int -> Ptr a
alignPtr :: forall a. Ptr a -> Int -> Ptr a
alloca :: forall a b. Storable a => (Ptr a -> GHC.Types.IO b) -> GHC.Types.IO b
allocaArray :: forall a b. Storable a => Int -> (Ptr a -> GHC.Types.IO b) -> GHC.Types.IO b
allocaArray0 :: forall a b. Storable a => Int -> (Ptr a -> GHC.Types.IO b) -> GHC.Types.IO b
allocaBytes :: forall a b. Int -> (Ptr a -> GHC.Types.IO b) -> GHC.Types.IO b
allocaBytesAligned :: forall a b. Int -> Int -> (Ptr a -> GHC.Types.IO b) -> GHC.Types.IO b
bitDefault :: forall a. (Bits a, GHC.Num.Num a) => Int -> a
bitReverse16 :: Word16 -> Word16
bitReverse32 :: Word32 -> Word32
bitReverse64 :: Word64 -> Word64
bitReverse8 :: Word8 -> Word8
byteSwap16 :: Word16 -> Word16
byteSwap32 :: Word32 -> Word32
byteSwap64 :: Word64 -> Word64
calloc :: forall a. Storable a => GHC.Types.IO (Ptr a)
callocArray :: forall a. Storable a => Int -> GHC.Types.IO (Ptr a)
callocArray0 :: forall a. Storable a => Int -> GHC.Types.IO (Ptr a)
callocBytes :: forall a. Int -> GHC.Types.IO (Ptr a)
castForeignPtr :: forall a b. ForeignPtr a -> ForeignPtr b
castFunPtr :: forall a b. FunPtr a -> FunPtr b
castFunPtrToPtr :: forall a b. FunPtr a -> Ptr b
castPtr :: forall a b. Ptr a -> Ptr b
castPtrToFunPtr :: forall a b. Ptr a -> FunPtr b
castPtrToStablePtr :: forall a. Ptr () -> StablePtr a
castStablePtrToPtr :: forall a. StablePtr a -> Ptr ()
copyArray :: forall a. Storable a => Ptr a -> Ptr a -> Int -> GHC.Types.IO ()
copyBytes :: forall a. Ptr a -> Ptr a -> Int -> GHC.Types.IO ()
deRefStablePtr :: forall a. StablePtr a -> GHC.Types.IO a
fillBytes :: forall a. Ptr a -> Word8 -> Int -> GHC.Types.IO ()
finalizeForeignPtr :: forall a. ForeignPtr a -> GHC.Types.IO ()
finalizerFree :: forall a. FinalizerPtr a
free :: forall a. Ptr a -> GHC.Types.IO ()
freeHaskellFunPtr :: forall a. FunPtr a -> GHC.Types.IO ()
freePool :: Pool -> GHC.Types.IO ()
freeStablePtr :: forall a. StablePtr a -> GHC.Types.IO ()
fromBool :: forall a. GHC.Num.Num a => GHC.Types.Bool -> a
intPtrToPtr :: forall a. IntPtr -> Ptr a
lengthArray0 :: forall a. (Storable a, GHC.Classes.Eq a) => a -> Ptr a -> GHC.Types.IO Int
malloc :: forall a. Storable a => GHC.Types.IO (Ptr a)
mallocArray :: forall a. Storable a => Int -> GHC.Types.IO (Ptr a)
mallocArray0 :: forall a. Storable a => Int -> GHC.Types.IO (Ptr a)
mallocBytes :: forall a. Int -> GHC.Types.IO (Ptr a)
mallocForeignPtr :: forall a. Storable a => GHC.Types.IO (ForeignPtr a)
mallocForeignPtrArray :: forall a. Storable a => Int -> GHC.Types.IO (ForeignPtr a)
mallocForeignPtrArray0 :: forall a. Storable a => Int -> GHC.Types.IO (ForeignPtr a)
mallocForeignPtrBytes :: forall a. Int -> GHC.Types.IO (ForeignPtr a)
maybeNew :: forall a b. (a -> GHC.Types.IO (Ptr b)) -> GHC.Maybe.Maybe a -> GHC.Types.IO (Ptr b)
maybePeek :: forall a b. (Ptr a -> GHC.Types.IO b) -> Ptr a -> GHC.Types.IO (GHC.Maybe.Maybe b)
maybeWith :: forall a b c. (a -> (Ptr b -> GHC.Types.IO c) -> GHC.Types.IO c) -> GHC.Maybe.Maybe a -> (Ptr b -> GHC.Types.IO c) -> GHC.Types.IO c
minusPtr :: forall a b. Ptr a -> Ptr b -> Int
moveArray :: forall a. Storable a => Ptr a -> Ptr a -> Int -> GHC.Types.IO ()
moveBytes :: forall a. Ptr a -> Ptr a -> Int -> GHC.Types.IO ()
new :: forall a. Storable a => a -> GHC.Types.IO (Ptr a)
newArray :: forall a. Storable a => [a] -> GHC.Types.IO (Ptr a)
newArray0 :: forall a. Storable a => a -> [a] -> GHC.Types.IO (Ptr a)
newForeignPtr :: forall a. FinalizerPtr a -> Ptr a -> GHC.Types.IO (ForeignPtr a)
newForeignPtrEnv :: forall env a. FinalizerEnvPtr env a -> Ptr env -> Ptr a -> GHC.Types.IO (ForeignPtr a)
newForeignPtr_ :: forall a. Ptr a -> GHC.Types.IO (ForeignPtr a)
newPool :: GHC.Types.IO Pool
newStablePtr :: forall a. a -> GHC.Types.IO (StablePtr a)
nullFunPtr :: forall a. FunPtr a
nullPtr :: forall a. Ptr a
oneBits :: forall a. FiniteBits a => a
peekArray :: forall a. Storable a => Int -> Ptr a -> GHC.Types.IO [a]
peekArray0 :: forall a. (Storable a, GHC.Classes.Eq a) => a -> Ptr a -> GHC.Types.IO [a]
plusForeignPtr :: forall a b. ForeignPtr a -> Int -> ForeignPtr b
plusPtr :: forall a b. Ptr a -> Int -> Ptr b
pokeArray :: forall a. Storable a => Ptr a -> [a] -> GHC.Types.IO ()
pokeArray0 :: forall a. Storable a => a -> Ptr a -> [a] -> GHC.Types.IO ()
pooledMalloc :: forall a. Storable a => Pool -> GHC.Types.IO (Ptr a)
pooledMallocArray :: forall a. Storable a => Pool -> Int -> GHC.Types.IO (Ptr a)
pooledMallocArray0 :: forall a. Storable a => Pool -> Int -> GHC.Types.IO (Ptr a)
pooledMallocBytes :: forall a. Pool -> Int -> GHC.Types.IO (Ptr a)
pooledNew :: forall a. Storable a => Pool -> a -> GHC.Types.IO (Ptr a)
pooledNewArray :: forall a. Storable a => Pool -> [a] -> GHC.Types.IO (Ptr a)
pooledNewArray0 :: forall a. Storable a => Pool -> a -> [a] -> GHC.Types.IO (Ptr a)
pooledRealloc :: forall a. Storable a => Pool -> Ptr a -> GHC.Types.IO (Ptr a)
pooledReallocArray :: forall a. Storable a => Pool -> Ptr a -> Int -> GHC.Types.IO (Ptr a)
pooledReallocArray0 :: forall a. Storable a => Pool -> Ptr a -> Int -> GHC.Types.IO (Ptr a)
pooledReallocBytes :: forall a. Pool -> Ptr a -> Int -> GHC.Types.IO (Ptr a)
popCountDefault :: forall a. (Bits a, GHC.Num.Num a) => a -> Int
ptrToIntPtr :: forall a. Ptr a -> IntPtr
ptrToWordPtr :: forall a. Ptr a -> WordPtr
realloc :: forall a b. Storable b => Ptr a -> GHC.Types.IO (Ptr b)
reallocArray :: forall a. Storable a => Ptr a -> Int -> GHC.Types.IO (Ptr a)
reallocArray0 :: forall a. Storable a => Ptr a -> Int -> GHC.Types.IO (Ptr a)
reallocBytes :: forall a. Ptr a -> Int -> GHC.Types.IO (Ptr a)
testBitDefault :: forall a. (Bits a, GHC.Num.Num a) => a -> Int -> GHC.Types.Bool
throwIf :: forall a. (a -> GHC.Types.Bool) -> (a -> GHC.Base.String) -> GHC.Types.IO a -> GHC.Types.IO a
throwIfNeg :: forall a. (GHC.Classes.Ord a, GHC.Num.Num a) => (a -> GHC.Base.String) -> GHC.Types.IO a -> GHC.Types.IO a
throwIfNeg_ :: forall a. (GHC.Classes.Ord a, GHC.Num.Num a) => (a -> GHC.Base.String) -> GHC.Types.IO a -> GHC.Types.IO ()
throwIfNull :: forall a. GHC.Base.String -> GHC.Types.IO (Ptr a) -> GHC.Types.IO (Ptr a)
throwIf_ :: forall a. (a -> GHC.Types.Bool) -> (a -> GHC.Base.String) -> GHC.Types.IO a -> GHC.Types.IO ()
toBool :: forall a. (GHC.Classes.Eq a, GHC.Num.Num a) => a -> GHC.Types.Bool
toIntegralSized :: forall a b. (GHC.Real.Integral a, GHC.Real.Integral b, Bits a, Bits b) => a -> GHC.Maybe.Maybe b
touchForeignPtr :: forall a. ForeignPtr a -> GHC.Types.IO ()
void :: forall a. GHC.Types.IO a -> GHC.Types.IO ()
with :: forall a b. Storable a => a -> (Ptr a -> GHC.Types.IO b) -> GHC.Types.IO b
withArray :: forall a b. Storable a => [a] -> (Ptr a -> GHC.Types.IO b) -> GHC.Types.IO b
withArray0 :: forall a b. Storable a => a -> [a] -> (Ptr a -> GHC.Types.IO b) -> GHC.Types.IO b
withArrayLen :: forall a b. Storable a => [a] -> (Int -> Ptr a -> GHC.Types.IO b) -> GHC.Types.IO b
withArrayLen0 :: forall a b. Storable a => a -> [a] -> (Int -> Ptr a -> GHC.Types.IO b) -> GHC.Types.IO b
withForeignPtr :: forall a b. ForeignPtr a -> (Ptr a -> GHC.Types.IO b) -> GHC.Types.IO b
withMany :: forall a b res. (a -> (b -> res) -> res) -> [a] -> ([b] -> res) -> res
withPool :: forall b. (Pool -> GHC.Types.IO b) -> GHC.Types.IO b
wordPtrToPtr :: forall a. WordPtr -> Ptr a
module Foreign.C where
-- Safety: Safe
type CBool :: *
newtype CBool = ...
type CChar :: *
newtype CChar = ...
type CClock :: *
newtype CClock = ...
type CDouble :: *
newtype CDouble = ...
type CFile :: *
data CFile = ...
type CFloat :: *
newtype CFloat = ...
type CFpos :: *
data CFpos = ...
type CInt :: *
newtype CInt = ...
type CIntMax :: *
newtype CIntMax = ...
type CIntPtr :: *
newtype CIntPtr = ...
type CJmpBuf :: *
data CJmpBuf = ...
type CLLong :: *
newtype CLLong = ...
type CLong :: *
newtype CLong = ...
type CPtrdiff :: *
newtype CPtrdiff = ...
type CSChar :: *
newtype CSChar = ...
type CSUSeconds :: *
newtype CSUSeconds = ...
type CShort :: *
newtype CShort = ...
type CSigAtomic :: *
newtype CSigAtomic = ...
type CSize :: *
newtype CSize = ...
type CString :: *
type CString = GHC.Ptr.Ptr CChar
type CStringLen :: *
type CStringLen = (GHC.Ptr.Ptr CChar, GHC.Types.Int)
type CTime :: *
newtype CTime = ...
type CUChar :: *
newtype CUChar = ...
type CUInt :: *
newtype CUInt = ...
type CUIntMax :: *
newtype CUIntMax = ...
type CUIntPtr :: *
newtype CUIntPtr = ...
type CULLong :: *
newtype CULLong = ...
type CULong :: *
newtype CULong = ...
type CUSeconds :: *
newtype CUSeconds = ...
type CUShort :: *
newtype CUShort = ...
type CWString :: *
type CWString = GHC.Ptr.Ptr CWchar
type CWStringLen :: *
type CWStringLen = (GHC.Ptr.Ptr CWchar, GHC.Types.Int)
type CWchar :: *
newtype CWchar = ...
type Errno :: *
newtype Errno = Errno CInt
castCCharToChar :: CChar -> GHC.Types.Char
castCSCharToChar :: CSChar -> GHC.Types.Char
castCUCharToChar :: CUChar -> GHC.Types.Char
castCharToCChar :: GHC.Types.Char -> CChar
castCharToCSChar :: GHC.Types.Char -> CSChar
castCharToCUChar :: GHC.Types.Char -> CUChar
charIsRepresentable :: GHC.Types.Char -> GHC.Types.IO GHC.Types.Bool
e2BIG :: Errno
eACCES :: Errno
eADDRINUSE :: Errno
eADDRNOTAVAIL :: Errno
eADV :: Errno
eAFNOSUPPORT :: Errno
eAGAIN :: Errno
eALREADY :: Errno
eBADF :: Errno
eBADMSG :: Errno
eBADRPC :: Errno
eBUSY :: Errno
eCHILD :: Errno
eCOMM :: Errno
eCONNABORTED :: Errno
eCONNREFUSED :: Errno
eCONNRESET :: Errno
eDEADLK :: Errno
eDESTADDRREQ :: Errno
eDIRTY :: Errno
eDOM :: Errno
eDQUOT :: Errno
eEXIST :: Errno
eFAULT :: Errno
eFBIG :: Errno
eFTYPE :: Errno
eHOSTDOWN :: Errno
eHOSTUNREACH :: Errno
eIDRM :: Errno
eILSEQ :: Errno
eINPROGRESS :: Errno
eINTR :: Errno
eINVAL :: Errno
eIO :: Errno
eISCONN :: Errno
eISDIR :: Errno
eLOOP :: Errno
eMFILE :: Errno
eMLINK :: Errno
eMSGSIZE :: Errno
eMULTIHOP :: Errno
eNAMETOOLONG :: Errno
eNETDOWN :: Errno
Loading
Loading full blame...