Package frege.Prelude

Compiled: Wed Dec 05 00:00:27 PST 2012 from source file: ./frege/Prelude.fr

Package Documentation

Table of Content

Imports

Instances

instance Enum Ordering

Member Functions

.. :: Ordering -> Ordering -> [Ordering]

inherited from Enum

from :: Int -> Ordering

Function generated for derived istance.

ord :: Ordering -> Int

Function generated for derived istance.

pred :: Ordering -> Ordering

Function generated for derived istance.

succ :: Ordering -> Ordering

Function generated for derived istance.

instance Eq (Eq a, Eq b) => (a, b)

Member Functions

!= :: (Eq α, Eq β) => (α, β) -> (α, β) -> Bool

inherited from Eq.!=

/= :: (Eq α, Eq β) => (α, β) -> (α, β) -> Bool

inherited from Eq./=

== :: (Eq α, Eq β) => (α, β) -> (α, β) -> Bool

Function generated for derived istance.

hashCode :: (Eq α, Eq β) => (α, β) -> Int

Function generated for derived istance.

instance Eq (Eq b, Eq a, Eq c) => (a, b, c)

Member Functions

!= :: (Eq β, Eq α, Eq γ) => (α, β, γ) -> (α, β, γ) -> Bool

inherited from Eq.!=

/= :: (Eq β, Eq α, Eq γ) => (α, β, γ) -> (α, β, γ) -> Bool

inherited from Eq./=

== :: (Eq β, Eq α, Eq γ) => (α, β, γ) -> (α, β, γ) -> Bool

Function generated for derived istance.

hashCode :: (Eq β, Eq α, Eq γ) => (α, β, γ) -> Int

Function generated for derived istance.

instance Eq (Eq a, Eq b) => Either a b

Member Functions

!= :: (Eq α, Eq β) => Either α β -> Either α β -> Bool

inherited from Eq.!=

/= :: (Eq α, Eq β) => Either α β -> Either α β -> Bool

inherited from Eq./=

== :: (Eq α, Eq β) => Either α β -> Either α β -> Bool

Function generated for derived istance.

hashCode :: (Eq α, Eq β) => Either α β -> Int

Function generated for derived istance.

instance Eq Ordering

Member Functions

!= :: Ordering -> Ordering -> Bool

inherited from Eq.!=

/= :: Ordering -> Ordering -> Bool

inherited from Eq./=

== :: Ordering -> Ordering -> Bool

Function generated for derived istance.

hashCode :: Ordering -> Int

Function generated for derived istance.

instance Ord ()

Member Functions

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

inherited from Ord.<

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

inherited from Ord.<=

<=> :: () -> () -> Ordering

Function generated for derived istance.

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

inherited from Ord.>

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

inherited from Ord.>=

compare :: () -> () -> Ordering

inherited from Ord.compare

max :: () -> () -> ()

inherited from Ord.max

min :: () -> () -> ()

inherited from Ord.min

instance Ord (Ord a, Ord b) => (a, b)

Member Functions

< :: (Ord α, Ord β) => (α, β) -> (α, β) -> Bool

inherited from Ord.<

<= :: (Ord α, Ord β) => (α, β) -> (α, β) -> Bool

inherited from Ord.<=

<=> :: (Ord α, Ord β) => (α, β) -> (α, β) -> Ordering

Function generated for derived istance.

> :: (Ord α, Ord β) => (α, β) -> (α, β) -> Bool

inherited from Ord.>

>= :: (Ord α, Ord β) => (α, β) -> (α, β) -> Bool

inherited from Ord.>=

compare :: (Ord α, Ord β) => (α, β) -> (α, β) -> Ordering

inherited from Ord.compare

max :: (Ord α, Ord β) => (α, β) -> (α, β) -> (α, β)

inherited from Ord.max

min :: (Ord α, Ord β) => (α, β) -> (α, β) -> (α, β)

inherited from Ord.min

instance Ord (Ord b, Ord a, Ord c) => (a, b, c)

Member Functions

< :: (Ord β, Ord α, Ord γ) => (α, β, γ) -> (α, β, γ) -> Bool

inherited from Ord.<

<= :: (Ord β, Ord α, Ord γ) => (α, β, γ) -> (α, β, γ) -> Bool

inherited from Ord.<=

<=> :: (Ord β, Ord α, Ord γ) => (α, β, γ) -> (α, β, γ) -> Ordering

Function generated for derived istance.

> :: (Ord β, Ord α, Ord γ) => (α, β, γ) -> (α, β, γ) -> Bool

inherited from Ord.>

>= :: (Ord β, Ord α, Ord γ) => (α, β, γ) -> (α, β, γ) -> Bool

inherited from Ord.>=

compare :: (Ord β, Ord α, Ord γ) => (α, β, γ) -> (α, β, γ) -> Ordering

inherited from Ord.compare

max :: (Ord β, Ord α, Ord γ) => (α, β, γ) -> (α, β, γ) -> (α, β, γ)

inherited from Ord.max

min :: (Ord β, Ord α, Ord γ) => (α, β, γ) -> (α, β, γ) -> (α, β, γ)

inherited from Ord.min

instance Ord (Ord a, Ord b) => Either a b

Member Functions

< :: (Ord α, Ord β) => Either α β -> Either α β -> Bool

inherited from Ord.<

<= :: (Ord α, Ord β) => Either α β -> Either α β -> Bool

inherited from Ord.<=

<=> :: (Ord α, Ord β) => Either α β -> Either α β -> Ordering

Function generated for derived istance.

> :: (Ord α, Ord β) => Either α β -> Either α β -> Bool

inherited from Ord.>

>= :: (Ord α, Ord β) => Either α β -> Either α β -> Bool

inherited from Ord.>=

compare :: (Ord α, Ord β) => Either α β -> Either α β -> Ordering

inherited from Ord.compare

max :: (Ord α, Ord β) => Either α β -> Either α β -> Either α β

inherited from Ord.max

min :: (Ord α, Ord β) => Either α β -> Either α β -> Either α β

inherited from Ord.min

instance Ord Ordering

Member Functions

< :: Ordering -> Ordering -> Bool

inherited from Ord.<

<= :: Ordering -> Ordering -> Bool

inherited from Ord.<=

<=> :: Ordering -> Ordering -> Ordering

Function generated for derived istance.

> :: Ordering -> Ordering -> Bool

inherited from Ord.>

>= :: Ordering -> Ordering -> Bool

inherited from Ord.>=

compare :: Ordering -> Ordering -> Ordering

inherited from Ord.compare

max :: Ordering -> Ordering -> Ordering

inherited from Ord.max

min :: Ordering -> Ordering -> Ordering

inherited from Ord.min

Functions and Values

!! :: [α] -> Int -> α

xs !! n is the element with index /n/ of the list /xs/, where the head element of a list has index 0.

lines :: String -> [String]

splits a String on end-of-line and returns a list of Strings

The last line may or may not be terminated by newline.

End-of-line is signaled by a number of carriage returns followed by a new line.

This should work for UNIX and Windows.

print :: Show α => α -> IO ()
println :: Show α => α -> IO ()
trace :: String -> Bool

unsafe trace, returns always false and can thus be used like

 fun x y
    | trace   ("x is " ++ show x) = undefined
    | traceLn ("y is " ++ show y) = undefined
    | otherwise = ......

Note that this imposes strictness on the traced data.

traceLn :: String -> Bool

same as trace but appends a line break

unlines :: [String] -> String

unlines is an inverse operation to lines.

It joins lines, after appending a terminating newline to each.

unwords :: [String] -> String

unwords is an inverse operation to words.

It joins words with separating spaces.

words :: String -> [String]

splits a String on non empty sequences of spaces and returns a list of Strings

Functions and Values by Type

String -> [String]

lines, words

String -> Bool

trace, traceLn

[String] -> String

unlines, unwords

() -> () -> ()

Ord_().max, Ord_().min

() -> () -> Bool

Ord_().>, Ord_().<=, Ord_().<, Ord_().>=

() -> () -> Ordering

Ord_().<=>, Ord_().compare

Int -> Ordering

Enum_Ordering.from

Ordering -> Ordering -> [Ordering]

Enum_Ordering...

Ordering -> Ordering -> Bool

Eq_Ordering./=, Eq_Ordering.!=, Eq_Ordering.==, Ord_Ordering.>, Ord_Ordering.<=, Ord_Ordering.<, Ord_Ordering.>=

Ordering -> Ordering -> Ordering

Ord_Ordering.<=>, Ord_Ordering.compare, Ord_Ordering.max, Ord_Ordering.min

Ordering -> Int

Enum_Ordering.ord, Eq_Ordering.hashCode

Ordering -> Ordering

Enum_Ordering.pred, Enum_Ordering.succ

[α] -> Int -> α

!!

Show α => α -> IO ()

print, println

(Eq α, Eq β) => (α, β) -> (α, β) -> Bool

Eq_(,)./=, Eq_(,).!=, Eq_(,).==

(Eq α, Eq β) => (α, β) -> Int

Eq_(,).hashCode

(Eq α, Eq β) => Either α β -> Either α β -> Bool

Eq_Either./=, Eq_Either.!=, Eq_Either.==

(Eq α, Eq β) => Either α β -> Int

Eq_Either.hashCode

(Ord α, Ord β) => (α, β) -> (α, β) -> (α, β)

Ord_(,).max, Ord_(,).min

(Ord α, Ord β) => (α, β) -> (α, β) -> Bool

Ord_(,).>, Ord_(,).<=, Ord_(,).<, Ord_(,).>=

(Ord α, Ord β) => (α, β) -> (α, β) -> Ordering

Ord_(,).<=>, Ord_(,).compare

(Ord α, Ord β) => Either α β -> Either α β -> Either α β

Ord_Either.max, Ord_Either.min

(Ord α, Ord β) => Either α β -> Either α β -> Bool

Ord_Either.>, Ord_Either.<=, Ord_Either.<, Ord_Either.>=

(Ord α, Ord β) => Either α β -> Either α β -> Ordering

Ord_Either.<=>, Ord_Either.compare

(Eq β, Eq α, Eq γ) => (α, β, γ) -> (α, β, γ) -> Bool

Eq_(,,)./=, Eq_(,,).!=, Eq_(,,).==

(Eq β, Eq α, Eq γ) => (α, β, γ) -> Int

Eq_(,,).hashCode

(Ord β, Ord α, Ord γ) => (α, β, γ) -> (α, β, γ) -> (α, β, γ)

Ord_(,,).max, Ord_(,,).min

(Ord β, Ord α, Ord γ) => (α, β, γ) -> (α, β, γ) -> Bool

Ord_(,,).>, Ord_(,,).<=, Ord_(,,).<, Ord_(,,).>=

(Ord β, Ord α, Ord γ) => (α, β, γ) -> (α, β, γ) -> Ordering

Ord_(,,).<=>, Ord_(,,).compare

Valid HTML 4.01 Strict