Example Code

Code for calculating the first 50 fibonacci number and write them to the console.

module MainModule;

import System;
using System;

// Fibonacci Example

function FindFibonacciNumber(n)
{
    var count= 2;
    var a = 1;
    var b = 1;
    var c = 1;
    if(n == 0)
    {
        return 0;
    }
    while(count<n)
    {
        c = a + b;
        a = b;
        b = c; 
        count++;
    }

    return c;
}

for(var i = 0; i < 50; i++)
{
    PrintLine(FindFibonacciNumber(i));
}

Simple code to show the use of inheritance and access of members.

class Foo
{
    var x = 5;
}

class TestClass : Foo
{
    function TestClass(n)
    {
        x = n;
    }
}

function TestFunction(n)
{
    n.x = 10;
}

var t = new TestClass(500);
PrintLine(t.x);

var a = new TestClass(150);

PrintLine(a.x);

TestFunction(a);

PrintLine(a.x);

The following code will calculate and print the 2-, 4-, 8-, 16-, 32- and 64-th Prime Number:

function FindPrimeNumber(n)
{
    var count=0;
    var a = 2;
    while(count<n)
    {
        var b = 2;
        var prime = 1;
        while(b * b <= a )
        {
            if(a % b == 0)
            {
                prime = 0;
                break;
            }
            b++;
        }
        if(prime > 0)
        {
            count++;
        }
        a++;
    }
    return (--a);
}

PrintLine(FindPrimeNumber(2));
PrintLine(FindPrimeNumber(4));
PrintLine(FindPrimeNumber(8));
PrintLine(FindPrimeNumber(16));
PrintLine(FindPrimeNumber(32));
PrintLine(FindPrimeNumber(64));

The following code will create a dynamic array and fill it with strings. Then it will print out the array elements:

var c = new Object();
var f = 0;
for(var x = 0; x < 10; x++)
{
    for(var y = 0; y < 10; y++)
    {
        for(var z = 0; z < 10; z++)
        {
           c[x][y][z] = "Number: " + f;
           f++;
        }
    }
}

for(var x = 0; x < 10; x++)
{
    for(var y = 0; y < 10; y++)
    {
        for(var z = 0; z < 10; z++)
        {
           PrintLine(c[x][y][z]);
        }
    }
}