Script Programming(스크립트 프로그래밍)

(* Filename: testHexView_02.fs
 *
 * Compile: fsc testHexView_02.fs
 * Execute: testHexView_02 [filename]
 *
 * Date: 2013. 8. 18.
 *)

open System
open System.IO

let Value (c:char) =
    (int c) - (int 'A') + 1

let toHex n =
    let mutable s = ""
    let x1 = (n &&& 0xF0) >>> 4
    let x2 = n &&& 0xF
    if x1 < 10 then
        s <- s + (sprintf "%c" (char (x1 + (int '0'))))
    else
        s <- s + (sprintf "%c" (char (x1 - 10 + (int 'A'))))
    if x2 < 10 then
        s <- s + (sprintf "%c" (char (x2 + (int '0'))))
    else
        s <- s + (sprintf "%c" (char (x2 - 10 + (int 'A'))))
    s
   
let toHex8 n =
    let mutable s = ""
    let x1 = (n &&& 0xF0000000) >>> 28
    let x2 = (n &&& 0xF000000) >>> 24
    let x3 = (n &&& 0xF00000) >>> 20
    let x4 = (n &&& 0xF0000) >>> 16
    let x5 = (n &&& 0xF000) >>> 12
    let x6 = (n &&& 0xF00) >>> 18
    let x7 = (n &&& 0xF0) >>> 4
    let x8 = n &&& 0xF
    if x1 < 10 then
        s <- s + (sprintf "%c" (char (x1 + (int '0'))))
    else
        s <- s + (sprintf "%c" (char (x1 - 10 + (int 'A'))))
    if x2 < 10 then
        s <- s + (sprintf "%c" (char (x2 + (int '0'))))
    else
        s <- s + (sprintf "%c" (char (x2 - 10 + (int 'A'))))
    if x3 < 10 then
        s <- s + (sprintf "%c" (char (x3 + (int '0'))))
    else
        s <- s + (sprintf "%c" (char (x3 - 10 + (int 'A'))))
    if x4 < 10 then
        s <- s + (sprintf "%c" (char (x4 + (int '0'))))
    else
        s <- s + (sprintf "%c" (char (x4 - 10 + (int 'A'))))
    s <- s + " "
    if x5 < 10 then
        s <- s + (sprintf "%c" (char (x5 + (int '0'))))
    else
        s <- s + (sprintf "%c" (char (x5 - 10 + (int 'A'))))
    if x6 < 10 then
        s <- s + (sprintf "%c" (char (x6 + (int '0'))))
    else
        s <- s + (sprintf "%c" (char (x6 - 10 + (int 'A'))))
    if x7 < 10 then
        s <- s + (sprintf "%c" (char (x7 + (int '0'))))
    else
        s <- s + (sprintf "%c" (char (x7 - 10 + (int 'A'))))
    if x8 < 10 then
        s <- s + (sprintf "%c" (char (x8 + (int '0'))))
    else
        s <- s + (sprintf "%c" (char (x8 - 10 + (int 'A'))))
    s
    
   
[<EntryPoint>]
let main args =

    if args.Length < 1 then
        eprintfn "Usage: testHexView_02 [filename]"
        exit 1
    let fname = args.[0]

    if Directory.Exists(fname) then
          printfn "\"%s\" is a directory." fname
          exit 1

    let file = new FileInfo(fname)
    if not file.Exists then
          printfn "The file \"%s\" does not exist." fname
          exit 1
    let fsize = file.Length

    printfn "The size of the file \"%s\" is %d." fname fsize
    printfn ""

    let fs = IO.File.OpenRead fname
    let currentByte = ref 0
    let mutable n = 0
    let mutable dum = ""
    while (int64 n) < fsize do
        if (n % 16) = 0 then
            printf "%s: " (toHex8 n)
        currentByte := fs.ReadByte()
        if (int !currentByte) < (int ' ') || (int !currentByte) > 0x7F then
            dum <- dum + "."
        else
            dum <- dum + (sprintf "%c" (char !currentByte))
        if (n % 16) = 8 then
            printf "-%s" (toHex (int !currentByte))
        else
            printf " %s" (toHex (int !currentByte))
        if (n % 16) = 15 then
            printfn "  |%s|" dum
            dum <- ""
        n <- n + 1
    if (n % 16) > 0 then
        for i = 1 to (16 - (n % 16)) do
            printf "   "
        printf "  |%s" dum
        for i = 1 to (16 - (n % 16)) do
            printf " "
        printfn "|"
        dum <- ""

    fs.Close()
    printfn "\nRead %d bytes." n

    0

 (*
 * Filename: testNthRoot.fs
 *
 *            Approximate square roots, cubic roots and n-th roots of a given number.
 *
 * Compile: fsc --codepage:949 testNthRoot.fs
 * Execute: testNthRoot
 *
 * Date: 2013. 1. 7.
 * Copyright (c) 2013 PH Kim  (pkim __AT__ scripts.pe.kr)
 *)

# light

let MAX_ITER = 20000
let M_EPSILON = 1.0e-15

//
// Compute the n-th root of x to a given scale, x > 0.
//
let rec nPow(a: double, n: int) : double =
    if n > 0 then
        if n = 1 then
            a
        else
            if a = 0.0 || a = 1.0 then
                a
            elif a = -1.0 then
                if n % 2 = 1 then
                    -1.0
                else
                    1.0
            elif a < 0.0 then
                if n % 2 = 1 then
                    -nPow(-a, n)
                else
                    nPow(-a, n)
            else
                let mutable y = 1.0
                for i = 1 to n do
                    y <- y * a
                y
    elif n = 0 then
        1.0
    else      //  when n < 0
        if a = 0.0 then
            raise (new System.InvalidOperationException("Negative powering exception of zero."))
        else
            if n = -1 then
                1.0/a
            else
               1.0/nPow(a, -n)

//
// Compute the n-th root of x to a given scale, x > 0.
//
let rec gPow(a: double, n: int) : double =
    if n > 0 then
        if n = 1 then
            a
        else
            if a = 0.0 || a = 1.0 then
                a
            elif a = -1.0 then
                if n % 2 = 1 then
                    -1.0
                else
                    1.0
            elif a < 0.0 then
                if n % 2 = 1 then
                    -gPow(-a, n)
                else
                    gPow(-a, n)
            else
                let mutable y = 1.0
                let mutable r = a
                let mutable m = 8*4 - 1            //  8*sizeof(int) - 1;
                let mutable one = 1
                for i = 0 to m do
                    if (n &&& one) = 0 then
                        y <- y * 1.0
                    else
                        y <- y * r
                    r <- r*r
                    one <- (one <<< 1)
                y
    elif n = 0 then
        1.0
    else      //  when n < 0
        if a = 0.0 then
            raise (new System.InvalidOperationException("Negative powering exception of zero."))
        else
            if n = -1 then
                1.0/a
            else
                1.0/gPow(a, -n)

 

//
// Compute the n-th root of x to a given scale, x > 0.
//
let rec mPow(a: double, n: int) : double =
    if n > 0 then
        if n = 1 then
            a
        else
            if a = 0.0 || a = 1.0 then
                a
            elif a = -1.0 then
                if n % 2 = 1 then
                    -1.0
                else
                    1.0
            elif a < 0.0 then
                if n % 2 = 1 then
                    -mPow(-a, n)
                else
                    mPow(-a, n)
            else
                let mutable y = 1.0
                let mutable r = a
                let mutable m = n 
                while m > 0 do
                    if (m &&& 0x1) = 1 then
                        y <- y * r
                    r <- r*r
                    m <- (m >>> 1)
                y
    elif n = 0 then
        1.0
    else      //  when n < 0
        if a = 0.0 then
            raise (new System.InvalidOperationException("Negative powering exception of zero."))
        else
            if n = -1 then
                1.0/a
            else
                1.0/mPow(a, -n)

 

//
// Compute the square root of x to a given scale, x > 0.
//
let rec heronSqrt(a: double) : double =
    if a < 0.0 then
        raise (new System.InvalidOperationException("Cannot find the sqrt of a negative number."))
    elif a = 0.0 || a = 1.0 then
        a
    else
        let mutable x1 = a
        let mutable x2 = (x1 + a/x1)/2.0
        let mutable er = x1 - x2
        let mutable counter = 0
        let mutable not_stop = true
        while x1 + er <> x1 && not_stop do
            x1 <- x2
            x2 <- (x1 + a/x1)/2.0
            er <- x1 - x2
            if abs(er) < abs(M_EPSILON*x1) then
                not_stop <- false
            counter <- counter + 1
            if counter > MAX_ITER then
                not_stop <- false
        if counter >= MAX_ITER then
                raise (new System.InvalidOperationException("Inaccurate sqrt exception by too many iterations."))
        x2

//
// Compute the cubic root of x to a given scale, x > 0.
//
let rec newtonCbrt(a: double) : double =
    if a = 0.0 || a = 1.0 || a = -1.0 then
        a
    elif a < 0.0 then
        -newtonCbrt(-a)
    else
        let mutable x1 = a
        let mutable x2 = (2.0*x1 + a/(x1*x1))/3.0
        let mutable er = x1 - x2
        let mutable counter = 0
        let mutable not_stop = true
        while x1 + er <> x1 && not_stop do
            x1 <- x2
            x2 <- (2.0*x1 + a/(x1*x1))/3.0
            er <- x1 - x2
            if abs(er) < abs(M_EPSILON*x1) then
                not_stop <- false
            counter <- counter + 1
            if counter > MAX_ITER then
                not_stop <- false
        if counter >= MAX_ITER then
            raise (new System.InvalidOperationException("Inaccurate cbrt exception by too many iterations."))
        x2

//
// Compute the n-th root of x to a given scale, x > 0.
//
let rec newtonNthRoot(n: int, a: double) : double =
    if n = 0 then
        1.0
    elif n = 1 then
        a
    elif n > 0 then
        if a = 0.0 || a = 1.0 then
            a
        elif a = -1.0 then
            if n % 2 = 1 then
                a
            else
                raise (new System.InvalidOperationException("Cannot find the even n-th root of a negative number."))
        elif a < 0.0 then
            if n % 2 = 1 then
                -newtonNthRoot(n, -a)
            else
                raise (new System.InvalidOperationException("Cannot find the n-th root of a negative number."))
        elif a < 1.0 then
            1.0/newtonNthRoot(n, 1.0/a)
        else
            let mutable x1 = a
            let mutable xn = mPow(x1, n - 1)
            let mutable x2 = ((double n - 1.0)*x1 + a/xn)/(double n)
            let mutable er = x1 - x2
            let mutable counter = 0
            let mutable not_stop = true
            while x1 + er <> x1 && not_stop do
                x1 <- x2
                xn <- mPow(x1, n - 1)
                x2 <- ((double n - 1.0)*x1 + a/xn)/(double n)
                er <- x1 - x2
                if abs(er) < abs(M_EPSILON*x1) then
                    not_stop <- false
                counter <- counter + 1
                if counter > MAX_ITER then
                    not_stop <- false
            if counter >= MAX_ITER then
                raise (new System.InvalidOperationException("Inaccurate n-th root  exception by too many iterations."))
            x2
    else
        if a = 0.0 then
            raise (new System.InvalidOperationException("Cannot find the negative n-th root of zero."))
        else
            1.0/newtonNthRoot(-n, a)

 

 

let mutable x = 16.0
let mutable u = System.Math.Sqrt(x)

printfn "[ Testing heronSqrt(double) ]--------------------"
printfn "x = %g" x
printfn "u = sqrt(%g) = %g" x u
let mutable y = heronSqrt(x)
printfn "y = heronSqrt(%g) = %g" x y
printfn "y*y = %g" (y*y)
printfn ""

x <- 729000000000.0
printfn "x = %g" x
printfn "exp(log(x)/3.0) = %g" (System.Math.Exp (System.Math.Log x)/3.0)
let mutable w = (newtonCbrt x)
printfn "w = newtonCbrt(%g) = %g" x w
printfn "w*w*w = %g"  (w*w*w)
printfn ""

printfn "[ Testing newtonNthRoot(int, double) ]--------------------"
let mutable z = newtonNthRoot(3, x)
printfn "x = %g" x
printfn "z = newtonNthRoot(3, %g) = %g" x z
printfn "z*z*z = %g" (z*z*z)
printfn ""

x <- 12960000000000000000.0
z <- newtonNthRoot(4, x)
printfn "x = %g" x
printfn "z = newtonNthRoot(4, x) = newtonNthRoot(4, %g) =  %g" x z
printfn "z*z*z*z = %g" (z*z*z*z)
printfn ""

x <- 1.0/12960000000000000000.0
z <- newtonNthRoot(4, x)
printfn "x = %g" x
printfn "exp(log(x)/4.0) = %g" (System.Math.Exp (System.Math.Log x)/4.0)
printfn "z = newtonNthRoot(4, x) = newtonNthRoot(4, %g) =  %g" x z
printfn "z*z*z*z = %g" (z*z*z*z)
printfn ""

try
    x <- -4.0
    printfn "[ Test Exception heronSqrt(double) ]--------------------"
    printfn "x = %g" x
    printfn "Calculating heronSqrt(%g)" x
    y <- heronSqrt(x)
    printfn "y = heronSqrt(%g) = %g" x y
    printfn "y*y = %g" (y*y)
    printfn ""
with
    | err -> printfn "%s\nCaught some exception in calculating heronSqrt(%g)" err.Message x
             printfn ""

try
    x <- -4.0
    printfn "[ Test Exception newtonCbrt(double) ]--------------------"
    printfn "x = %g" x
    printfn "Calculating newtonCbrt(%g)" x
    y <- newtonCbrt(x)
    printfn "y = newtonCbrt(%g) = %g" x y
    printfn "y*y*y = %g" (y*y*y)
    printfn ""
with
    | err -> printfn "%s\nCaught some exception in calculating newtonCbrtrt(%g)" err.Message x
             printfn ""

printfn "[ Test calculations by powering ]-----------------------------"
x <- 200.0
z <- newtonNthRoot(10,  x)
printfn "x = %g" x
printfn "exp(log(x)/10.0) = %g"  ((System.Math.Exp (System.Math.Log x))/10.0)
printfn "z = newtonNthRoot(10, x) = newtonNthRoot(10, %g) = %g" x z
printfn "z**10.0 = pow(z, 10.0) = %g" (z**10.0)
printfn ""

x <- 3001.0
z <- newtonNthRoot(99, x)
printfn "x = %g" x
printfn "exp(log(x)/99.0) = %g" (System.Math.Exp(System.Math.Log(x)/99.0))
printfn "z = newtonNthRoot(99, x) = newtonNthRoot(99, %g) = %g" x z
printfn "z**99.0 = pow(z, 99) = %g" (z**99.0)
printfn ""

x <- 3001.0
z <- newtonNthRoot(-99, x)
printfn "x = %g" x
printfn "exp(log(x)/-99.0) = %g" (System.Math.Exp(System.Math.Log(x)/(-99.0)))
printfn "z = newtonNthRoot(-99, x) = newtonNthRoot(-99, %g) = %g" x z
printfn "1.0/z**99.0 = 1.0/pow(z, 99) = %g" (1.0/z**99.0)
printfn ""

printfn "2.1**2.1 = pow(2.1, 2.1) = %g" (2.1**2.1)
printfn "2.1**(-2.1) = pow(2.1, -2.1) = %g" (2.1**(-2.1))
printfn "2.1**2.1 * 2.1**(-2.1) = pow(2.1, 2.1) * pow(2.1, -2.1) = %g" (2.1**2.1 * 2.1**(-2.1))
printfn "2.1**2.1 = exp(2.1*log(2.1)) = %g" (System.Math.Exp(2.1*System.Math.Log(2.1)))
printfn "2.1**(-2.1) = exp(-2.1*log(2.1)) = %g" (System.Math.Exp(-2.1*System.Math.Log(2.1)))
printfn "2.1**2.1 * 2.1**(-2.1) = exp(2.1*log(2.1)) * exp(-2.1*log(2.1)) = %g"  (2.1**2.1 * 2.1**(-2.1))
printfn ""

let mutable k = 301
x <- -1.029
let mutable t1 = nPow(x, k)
let mutable t2 = gPow(x, k)
let mutable t3 = mPow(x, k)
let mutable tt =  System.Math.Pow(x, double k)
printfn "System.Math.Pow(%g, %d) = %g" x k tt
printfn "t1 = nPow(%g, %d) = %g" x k t1
printfn "t2 = gPow(%g, %d) = %g" x k t2
printfn "t3 = mPow(%g, %d) = %g" x k t3
printfn "t1 / t2 = %g" (t1 / t2)
printfn "t1 - t2 = %g" (t1 - t2)
printf "t1 == t2 ? "
if t1 = t2 then printfn "yes"
           else printfn "no"
printfn "t1 / t3 = %g" (t1 / t3)
printfn "t1 - t3 = %g" (t1 - t3)
printf "t1 == t3 ? "
if t1 = t3 then printfn "yes"
           else printfn "no"
printfn "t2 / t3 = %g" (t2 / t3)
printfn "t2 - t3 = %g" (t2 - t3)
printf "t2 == t3 ? "
if t2 = t3 then printfn "yes"
           else printfn "no"
printfn ""

printfn "Done."

 

(*
Output:
[ Testing heronSqrt(double) ]--------------------
x = 16
u = sqrt(16) = 4
y = heronSqrt(16) = 4
y*y = 16

x = 7.29e+11
exp(log(x)/3.0) = 2.43e+11
w = newtonCbrt(7.29e+11) = 9000
w*w*w = 7.29e+11

[ Testing newtonNthRoot(int, double) ]--------------------
x = 7.29e+11
z = newtonNthRoot(3, 7.29e+11) = 9000
z*z*z = 7.29e+11

x = 1.296e+19
z = newtonNthRoot(4, x) = newtonNthRoot(4, 1.296e+19) =  60000
z*z*z*z = 1.296e+19

x = 7.71605e-20
exp(log(x)/4.0) = 1.92901e-20
z = newtonNthRoot(4, x) = newtonNthRoot(4, 7.71605e-20) =  1.66667e-05
z*z*z*z = 7.71605e-20

[ Test Exception heronSqrt(double) ]--------------------
x = -4
Calculating heronSqrt(-4)
Cannot find the sqrt of a negative number.
Caught some exception in calculating heronSqrt(-4)

[ Test Exception newtonCbrt(double) ]--------------------
x = -4
Calculating newtonCbrt(-4)
y = newtonCbrt(-4) = -1.5874
y*y*y = -4

[ Test calculations by powering ]-----------------------------
x = 200
exp(log(x)/10.0) = 20
z = newtonNthRoot(10, x) = newtonNthRoot(10, 200) = 1.69865
z**10.0 = pow(z, 10.0) = 200

x = 3001
exp(log(x)/99.0) = 1.08424
z = newtonNthRoot(99, x) = newtonNthRoot(99, 3001) = 1.08424
z**99.0 = pow(z, 99) = 3001

x = 3001
exp(log(x)/-99.0) = 0.922308
z = newtonNthRoot(-99, x) = newtonNthRoot(-99, 3001) = 0.922308
1.0/z**99.0 = 1.0/pow(z, 99) = 3001

2.1**2.1 = pow(2.1, 2.1) = 4.74964
2.1**(-2.1) = pow(2.1, -2.1) = 0.210542
2.1**2.1 * 2.1**(-2.1) = pow(2.1, 2.1) * pow(2.1, -2.1) = 1
2.1**2.1 = exp(2.1*log(2.1)) = 4.74964
2.1**(-2.1) = exp(-2.1*log(2.1)) = 0.210542
2.1**2.1 * 2.1**(-2.1) = exp(2.1*log(2.1)) * exp(-2.1*log(2.1)) = 1

System.Math.Pow(-1.029, 301) = -5457.93
t1 = nPow(-1.029, 301) = -5457.93
t2 = gPow(-1.029, 301) = -5457.93
t3 = mPow(-1.029, 301) = -5457.93
t1 / t2 = 1
t1 - t2 = 6.18456e-11
t1 == t2 ? no
t1 / t3 = 1
t1 - t3 = 6.18456e-11
t1 == t3 ? no
t2 / t3 = 1
t2 - t3 = 0
t2 == t3 ? yes

Done.
*)

(*
 * Filename: testArcSine.fs
 *
 * Compile: fsc testArcSine.fs
 * Execute: testArcSine
 *
 * Date: 2013. 1. 2.
 * Copyright (c) pkim _AT_ scripts.pe.kr
 *)

#light

let sin(x: double) : double =
            System.Math.Sin(x)

let asin(x: double) : double =
            System.Math.Asin(x)

let sinh(x: double) : double =
            System.Math.Sinh(x)

let cosh(x: double) : double =
            System.Math.Cosh(x)

let asinh(x: double) : double =
            System.Math.Log(x + sqrt(x*x + 1.0))

let acosh(x: double) : double =
            System.Math.Log(x + sqrt(x*x - 1.0))

let mutable x = -0.9
let mutable y = asin(x)
printfn "y = asin(%.1g) = %.9f" x  y
printfn "sin(y) = sin(%.9f) = %.1g" y (sin y)
printfn ""

x <- 1.1
let mutable u = acosh(x)
printfn "u = acosh(%3.2g) = %.10f" x u

let mutable v = asinh(x)
printfn "v = asinh(%3.2g) = %.10f" x  v

printfn "cosh(u) = cosh(%.10f) = %3.2g" u (cosh u)
printfn "sinh(v) = sinh(%.10f) = %3.2g" v (sinh v)

(*
Output:
y = asin(-0.9) = -1.119769515
sin(y) = sin(-1.119769515) = -0.9

u = acosh(1.1) = 0.4435682544
v = asinh(1.1) = 0.9503469298
cosh(u) = cosh(0.4435682544) = 1.1
sinh(v) = sinh(0.9503469298) = 1.1
*)

printfn "Hello"
printfn "안녕하세요?"

// Filename: HelloWorldFSharpForm.fs
//
// Compile: fsc --codepage:949 --target:winexe --platform:x86 HelloWorldFSharpForm.fs
// Execute: HelloWorldFSharpForm

open System
open System.Drawing
open System.Windows.Forms

// Create the form and a label objects
let frm = new Form(Text = "Hello world by F#", Width = 400, Height = 170)      // Windows 7 을 위해 수정
let btn = new Button(Text = "인사하기", Width=120, Height=30,                          // Windows 7 을 위해 수정
                    TextAlign = ContentAlignment.MiddleCenter)
let displaybox = new Label(Width=320, Height=35,
                    TextAlign = ContentAlignment.MiddleLeft)
let editbox = new TextBox(Width=200, Height=35,
                    TextAlign = HorizontalAlignment.Left)

// Set ‘Font’ property of the label, textbox, button
btn.Font <- new Font("궁서체", 14.0f)
btn.BackColor <- Color.FromArgb(32, 216, 32)
btn.Location <- new System.Drawing.Point(240, 76)
displaybox.BackColor <- Color.FromArgb(255, 255, 255)
displaybox.Font <- new Font("Vernada", 14.0f, FontStyle.Bold)
displaybox.Location <- new Point(15, 20)
editbox.BackColor <- Color.FromArgb(255, 255, 255)
editbox.Location <- new Point(15, 80)
frm.Controls.Add(btn)
frm.Controls.Add(displaybox)
frm.Controls.Add(editbox)
frm.Show()
let dummy = editbox.Focus()  // Set focus to the textbox

// Function that changes the text of the label for button pressed event
let sayHello (e:EventArgs) =
    let msg = editbox.Text
    let dum = editbox.Focus()  // Set focus to the textbox
    // Set the text at the label
    displaybox.Text <- String.Format("Hello, {0}!", msg)

// Function that changes the text of the label for textbox key pressed event
let greet(ev:KeyEventArgs) =
    if ev.KeyCode = Keys.Enter  then
         let msg = editbox.Text
         let dum = editbox.Focus()  // Set focus to the textbox
         // Set the text at the label
         displaybox.Text <- String.Format("Hello, {0}!", msg)

btn.Click.Add(sayHello)
editbox.KeyDown.Add(greet)

do
  Application.Run(frm)

printfn "Hello"
printfn "안녕하세요?"

// Filename: HelloWorldFSharpForm.fs
//
// Compile: fsc --codepage:949 --target:winexe --platform:x86 HelloWorldFSharpForm.fs
// Execute: HelloWorldFSharpForm

open System
open System.Drawing
open System.Windows.Forms

// Create the form and a label objects
let frm = new Form(Text = "Hello world by F#", Width = 360, Height = 160)
let btn = new Button(Text = "인사하기", Width=100, Height=30,
                    TextAlign = ContentAlignment.MiddleCenter)
let displaybox = new Label(Width=320, Height=35,
                    TextAlign = ContentAlignment.MiddleLeft)
let editbox = new TextBox(Width=200, Height=35,
                    TextAlign = HorizontalAlignment.Left)

// Set ‘Font’ property of the label, textbox, button
btn.Font <- new Font("궁서체", 14.0f)
btn.BackColor <- Color.FromArgb(32, 216, 32)
btn.Location <- new System.Drawing.Point(230, 76)
displaybox.BackColor <- Color.FromArgb(255, 255, 255)
displaybox.Font <- new Font("Vernada", 14.0f, FontStyle.Bold)
displaybox.Location <- new Point(15, 20)
editbox.BackColor <- Color.FromArgb(255, 255, 255)
editbox.Location <- new Point(15, 80)
frm.Controls.Add(btn)
frm.Controls.Add(displaybox)
frm.Controls.Add(editbox)
frm.Show()
let dummy = editbox.Focus()  // Set focus to the textbox

// Function that changes the text of the label for button pressed event
let sayHello (e:EventArgs) =
    let msg = editbox.Text
    let dum = editbox.Focus()  // Set focus to the textbox
    // Set the text at the label
    displaybox.Text <- String.Format("Hello, {0}!", msg)

// Function that changes the text of the label for textbox key pressed event
let greet(ev:KeyEventArgs) =
    if ev.KeyCode = Keys.Enter  then
         let msg = editbox.Text
         let dum = editbox.Focus()  // Set focus to the textbox
         // Set the text at the label
         displaybox.Text <- String.Format("Hello, {0}!", msg)

btn.Click.Add(sayHello)
editbox.KeyDown.Add(greet)

do
  Application.Run(frm)

// Filename: ClickForm5.fs
//
// Compile: fsc --codepage:949 ClickForm5.fs
// Execute: ClickForm5

// Import useful .NET namespaces
open System
open System.Drawing
open System.Windows.Forms

// Create the form and a label objects
let frm = new Form(Text = "버튼 이벤트 핸들러 테스트", Height = 200)
let btn = new Button(Text = "여기를 클릭!", Width=240, Height=60,
                    TextAlign = ContentAlignment.MiddleCenter)
let displaybox = new Label(Width=260, Height=35,
                    TextAlign = ContentAlignment.MiddleLeft)

// Set ‘Font’ property of the label and add label to the form
btn.Font <- new Font("궁서체", 24.0f)
btn.Location <- new System.Drawing.Point(25, 80)
displaybox.BackColor <- Color.FromArgb(255, 255, 255)
displaybox.Font <- new Font("돋움체", 13.0f)
displaybox.Location <- new Point(15, 20)
frm.Controls.Add(btn)
frm.Controls.Add(displaybox)
frm.Show()

// Create random number generator
let rnd = new Random()  

// Function that changes the text of the label and back color of the form
let handleClick (e:EventArgs) =
    let r = rnd.Next(256)
    let g = rnd.Next(256)
    let b = rnd.Next(256)
    // Set the text and the new back color
    btn.Text <- if (btn.Text = "틱!") then "택!" elif (btn.Text = "택!") then "톡!" else "틱!"
    btn.BackColor <- Color.FromArgb(r, g, b)
    displaybox.Text <- String.Format("(R, G, B) = ({0}, {1}, {2})", r, g, b)

btn.Click.Add(handleClick)

do
  Application.Run(frm)

(*
 * Filename: TestMouseDownEvent.fs
 *
 *   Compile: fsc TestMouseDownEvent.fs
 *   Execute: TestMouseDownEvent
 *
 *   Date: 2010/07/23
 *   Author: phkim  pkim __AT__ scripts.pe.kr
 *)

open System
open System.Drawing
open System.Windows
open System.Windows.Forms

// Creates the user interface
let frm, lbl = new Form (), new Label()

frm.Width <- 300
frm.Height <- 300
frm.FormBorderStyle <- FormBorderStyle.Fixed3D
frm.Text <- "Test of MouseDown Event"

lbl.Size <- new System.Drawing.Size(200,30)
lbl.TextAlign <- ContentAlignment.MiddleLeft
lbl.Location <- new System.Drawing.Point(20,40)
lbl.Text <- "Click here"
lbl.ForeColor <- Color.DarkGreen
// lbl.Font <- new Font("verdana", 12.0f, FontStyle.Bold)
lbl.Font <- new Font("Lucida Console",10.0f,FontStyle.Bold)
lbl.BackColor <- Color.AliceBlue

frm.Controls.Add(lbl)

let rec loop(count) = async {
  let! args = Async.AwaitEvent(lbl.MouseDown)  // Wait for mouse down
  lbl.Text <- sprintf "Clicks: %d" count
  return! loop(count + 1) }

do
  Async.Start(loop(1))
  Application.Run(frm)

(*
    Filename: fact.fs
         Rapid factorial and fibonacci seq implementations
         by pattern matching and tail recursive call

    Compile: fsc fact.fs
    Execute: fact

    Date: 2010/07/20
    Author: phkim  pkim __AT__ scripts.pe.kr
*)

#light

let rec fact (n:int) : bigint =
    match n with
    | 0 | 1    -> 1I
    | k        -> (bigint k) * (fact (k-1))

let factorial n =
    let rec loop acc k =
          match k with
          | 0 -> acc
          | _ -> loop (acc*(bigint k)) (k - 1)
    loop 1I n

let fibonacci n =
    let rec loop a b k =
          match k with
          | 0 -> a
          | _ -> loop (a + b) a (k - 1)
    loop 0I 1I n

let a = 30000
let b = 200000
printfn "Factorial(%O) has %O digits" a ((sprintf "%O" (factorial a)).Length)
printfn "Fibonacci(%O) has %O digits" b ((sprintf "%O" (fibonacci b)).Length)
(*
    Expected result:
    Factorial(30000) has 121288 digits
    Fibonacci(200000) has 41798 digits
*)

(*
 *  Filename: DivideEach.fs
 *
 *  Purpose:  Determine whether the given integer is a prime or not.
 *
 *  Compile: fsc DivideEach.fs
 *  Execute: DivideEach [integer]
 *
 *     Date:  2010/07/17
 *   Author:  PH Kim   [ pkim ((AT)) scripts.pe.kr ]
 *)

(*
  Execution Examples:
      Prompt> DivideEach 1234567812343
      1234567812343 = 1 * 1234567812343
      1234567812343 is a prime
      Elapsed time: 0.750000 sec

      Prompt> DivideEach 9999994200000841
      9999994200000841 = 99999971 * 99999971
      9999994200000841 is a not prime
      Elapsed time: 121.140000 sec

      Prompt> DivideEach 18446744073709551617
      18446744073709551617 = 274177 * 67280421310721
      18446744073709551617 is a not prime
      Elapsed time: 0.218000 sec

      Prompt> DivideEach 10023859281455311421
      10023859281455311421 = 1308520867 * 7660450463
      10023859281455311421 is a not prime
      Elapsed time: 1471.500000 sec
/*)

#light

open System

let mutable n = 10006099720301I

// Begin here
let cmdArgs = System.Environment.GetCommandLineArgs()
if (Array.length cmdArgs > 1) then
    // n <- new Numerics.BigInteger(cmdArgs.[1])
    n <- (cmdArgs.[1]) |> Numerics.BigInteger.Parse

let mutable z = n / 2I
if n = 2I*z then
    printfn "%O = %O * %O" n  2I z

let time1 = DateTime.UtcNow

let mutable d = 1I
let mutable k = 3I
let mutable cont_flag = true
while (k*k <= n && cont_flag) do
    z <- n / k
    if n = k*z then
        d <- k
        cont_flag <- false
    else
        k <- k + 2I

let time2 = DateTime.UtcNow
let elapsed = float (int64 (time2 - time1).TotalMilliseconds) / 1000.0

printfn "%O = %O * %O" n d (n/d)
if d = 1I then
    printfn "%O is a prime" n
else
    printfn "%O is a not prime" n

printfn "Elapsed time: %f sec" elapsed

(*
 *  Filename: PollardRho.fs
 *
 *  Purpose:  By using the pollard rho method,
 *            determine whether the given integer is a prime or not.
 *
 *      See:  http://en.wikipedia.org/wiki/Pollard%27s_rho_algorithm
 *            http://en.wikipedia.org/wiki/Floyd%27s_cycle-finding_algorithm#Tortoise_and_hare#
 *
 *  Compile: fsc PollardRho.fs
 *  Execute: PollardRho [integer]
 *
 *     Date:  20010/07/18
 *   Author:  PH Kim   [ pkim ((AT)) scripts.pe.kr ]
 *)

(*
  Execution Examples:
      Prompt> PollardRho 1234567812343
      Try first the Pollard rho algorithm with c = 2
      d = 1234567812343, count = 466951
      Try second the Pollard rho algorithm with c = 3
      d = 1, count = 1111112
      Try third the Pollard rho algorithm with c = 1
      d = 1234567812343, count = 799441
      1234567812343 = 1234567812343 * 1
      Elapsed time: 63.640000 sec

      Prompt> PollardRho 9999994200000841
      Try first the Pollard rho algorithm with c = 2
      d = 99999971, count = 3593
      9999994200000841 = 99999971 * 99999971
      Elapsed time: 0.281000 sec

      Prompt> PollardRho 18446744073709551617
      Try first the Pollard rho algorithm with c = 2
      d = 274177, count = 1028
      18446744073709551617 = 274177 * 67280421310721
      Elapsed time: 0.187000 sec

      Prompt> PollardRho 10023859281455311421
      Try first the Pollard rho algorithm with c = 2
      d = 1308520867, count = 20350
      10023859281455311421 = 1308520867 * 7660450463
      Elapsed time: 0.968000 sec
*)

#light

open System

let f (x : bigint) (c : bigint) (n : bigint) =
    (x*x + c) % n

let g (x : bigint) (c : bigint) (n : bigint) =
    f (f x c n) c n

let gcd x  y =
    let mutable a = abs x
    let mutable b = abs y
    if b = 0I then
        a
    else
        while b <> 0I do
            let t = a % b
            a <- b
            b <- t
        a

let pollardRho (n : bigint) =
    let mutable c = 2I
    let mutable x = 1I
    let mutable y = 1I
    let mutable d = 1I
    let mutable savedX = x
    let mutable count = 0I
    printfn "Try first the Pollard rho algorithm with c = %O" c
    let mutable cont_flag = true
    while d = 1I && count*count <= n && cont_flag do
        x <- f x c n
        if x = savedX then
            printfn "It is cyclic.  x = %O" x
            cont_flag <- false
        else
            y <- g y c n
            d <- gcd (abs (x - y)) n
        count <- count + 1I

    printfn "d = %O, count = %O" d count
    if d > 1I && d < n then
        d
    else
        c <- 3I
        x <- 1I
        y <- 1I
        d <- 1I
        savedX <- x
        count <- 0I
        printfn "Try second the Pollard rho algorithm with c = %O" c
        cont_flag <- true
        while d = 1I && count*count <= n do
            x <- f x c n
            if x = savedX then
                 printfn "It is cyclic.  x = %O" x
                 cont_flag <- false
            else
                 y <- g y c n
                 d <- gcd (abs(x - y)) n
                 count <- count + 1I

        printfn "d = %O, count = %O" d count
        if d > 1I && d < n then
            d
        else
            c <- 1I
            x <- 1I
            y <- 1I
            d <- 1I
            savedX <- x
            count <- 0I
            printfn "Try third the Pollard rho algorithm with c = %O" c
            let mutable cont_flag2 = true
            while d = 1I && count*count <= n do
                x <- f x c n
                if x = savedX then
                    printfn "It is cyclic.  x = %O" x
                    cont_flag2 <- false
                else
                    y <- g y c n
                    d <- gcd (abs(x - y)) n
                    count <- count + 1I

            printfn "d = %O, count = %O" d count
            d

// Begin here
let mutable n = 9991I

let cmdArgs = System.Environment.GetCommandLineArgs()
if (Array.length cmdArgs > 1) then
    n <- (cmdArgs.[1]) |> Numerics.BigInteger.Parse

let time1 = DateTime.UtcNow
let k = pollardRho n
let time2 = DateTime.UtcNow
let elapsed = float (int64 (time2 - time1).TotalMilliseconds) / 1000.0

let z = n/k
if n = k*z then
    printfn "%O = %O * %O" n k z

printfn "Elapsed time: %f sec" elapsed