[<EntryPoint>]
let main argv =
    let one = [1; 2; 3]
    let two = [11; 22; 33]

    printfn "append: %A" (List.append  one two)
    printfn "append: %A" (List.append  one [6..9])

    printfn "%A" (List.average  [3.; 2.; 1.])

    printfn "%A" (List.averageBy ((*) 0.5) [3.; 2.; 1.])

    printfn "collect: %A" (List.collect (fun x -> [for i in 5.0..10.0 -> x * i])  [3.; 2.; 1.])

    printfn "%b" (List.exists (fun c -> c > 2.)  [3.; 2.; 1.])
    printfn "%b" (List.exists (fun c -> c < 0.)  [3.; 2.; 1.])

    printfn "filter: %A" (List.filter (((&&&) 1) >> ((=) 0))  [1..10])

    printfn "%d" (List.find (((&&&) 1) >> ((<>) 0))  [1..10])

    //printfn "%d" (List.findBy) - функция не существует

    printfn "%d" (List.fold (*) 1 [2..10])

    printfn "%A" (List.foldBack (fun e ac -> (e * 2)::ac) [2..10] [])

    printfn "%b" (List.forall (((&&&) 1) >> ((=) 0)) [2; 4; 6])
    printfn "%b" (List.forall (((&&&) 1) >> ((=) 0)) [2; 4; 6; 1])

    printfn "%d" (List.head [2; 4; 6; 1])

    printfn "%A" (List.init 10 (fun x -> (x / 3) * 2))
    printfn "asdasd: %A" (List.init 1 (fun x -> (x * 2, x)))

    List.iter (fun x -> printf "%d " x) [1; 2; 3]
    printfn ""

    List.iter2 (fun x y -> printf "%d %d " x y) [1; 2; 3] [4; 5; 6]
    printfn ""

    List.iteri (fun i x -> printf "%d is %d, " i x) [666; 777; 888]
    printfn ""

    printfn "LENGTH: %d" (List.length [1..10])
    printfn "LENGTH: %d" (List.length [])

    printfn "%A" (List.map ((-) 10) [1..10])

    printfn "%A" (List.mapi (fun i x -> (i, i + x)) [4; 7; 1; 0])

    printfn "%d" (List.max [4; 7; 1; 0])
    printfn "%d" (List.maxBy ((-) 0) [4; 7; 1; 0])
    printfn "%d" (List.min [4; 7; 1; 0])
    printfn "%d" (List.minBy ((-) 0) [4; 7; 1; 0])

    printfn "%d" (List.nth [1..10] 4)

    let a, b = (List.partition (((&&&) 1) >> ((=) 0)) [1..10])
    printfn "%A %A" a b
    let c, d = (List.partition ((<) 10) [1..10])

    printfn "%A %A" c d
    printfn "%A" (List.permute (fun i -> (i + 1) % 5) [1..5])

    printfn "%d" (List.reduce (+) [1..4])
    printfn "%d" (List.reduce (+) [1])

    printfn "%A" (List.rev [1..10])

    printfn "SORT: %A" (List.sort [-1; -100; 23; 1])

    printfn "%A" (List.sortBy abs [1; 2; 5; -2; -1])

    let comp x y =
        if (abs x) < (abs y) then -1
        elif (abs x) > (abs y) then 1
        else 0
    printfn "%A" (List.sortWith comp [1; 2; 5; -2; -1])

    printfn "%d" (List.sum [1..4])

    printfn "%d" (List.sumBy ((&&&) 1) [1; 4; 2; 7; 9])

    printfn "%A" (List.tail [1..4])
    printfn "%A" (List.tail [1])
    //printfn "%A" (List.tail []) - вылет

    printfn "%A" (List.tryFind (fun x -> x * x > 10) [1..4])
    printfn "%A" (List.tryFind (fun x -> x * x > 10) [1..3])

    printfn "%A" (List.tryFindIndex (fun x -> x * x > 10) [1; 6; 7; 8])
    printfn "%A" (List.tryFindIndex (fun x -> x * x > 10) [1..3])

    let a, b = (List.unzip [for i in 1..5 -> (i - 1, i * 10)])
    printfn "%A %A" a b

    printfn "%A" (List.zip [0..4] [10..10..50])

    0 // return an integer exit code