webcpu/haskellswift

Data.List

map

let xs = "haskell"
map(toUpper, xs)

"HASKELL"

filter

let xs               = [1, 2, 3, 4, 5]
let greaterThanThree = { x in x > 3 }
filter(greaterThanThree, list)

[4, 5]

foldl

let xs       = [1, 2, 3]
let adds     = { (x: Int,y: Int) in x+y }
foldl1(adds, xs)

6

Data.Function

.. (Function Composition)

1

let process : ([Int]) -> Int = last .. reverse
let xs       = [1,2,3,4,5]
process(xs)

1

2

func _isPrime(n : Int) -> Bool {
    let array2ToN : Int->[Int]   = { x in Array(2...x) }
    let divisors  : Int->[Int]   = array2ToN .. Int.init .. ceil .. sqrt .. Double.init
    let isDivisible              = or .. map({ x in n % x == 0})
    let isNotPrime               = isDivisible .. divisors
    return !isNotPrime(n)
}
_isPrime(3)

true

Data.Maybe

maybeToList

let x : Int? = nil
maybeToList(x)

``

catMaybes

let xs: [Int?] = [1, nil, 3]
catMaybes(xs)

[1,3]

How does it help?

There are 3 solutions to the same problem. A, B, C <img width="892" alt="screenshot 2016-03-15 12 02 15" src="https://user-images.githubusercontent.com/4646838/32611428-f51b9eaa-c565-11e7-96ea-8a365e92946a.png">

A doesn't use HaskellSwift, B and C use HaskellSwift. A is imperative, B and C are declarative.

If you want to know more about it, please check the test cases in the Xcode Project or use Hoogle.

https://www.haskell.org/hoogle/?hoogle=map

In addition, there is a public project which is written in HaskellSwift.

https://github.com/unchartedworks/autobuild

Package Metadata

Repository: webcpu/haskellswift

Default branch: master

README: README.md