proc ellipse (X, Y, X2, Y2, size, col : int)
    for i : X2 - size .. X + size
        for j : Y2 - size .. Y + size
            if sqrt ((X - i) ** 2 + (Y - j) ** 2) + sqrt ((X2 - i) ** 2 + (Y2 - j) ** 2) <= size then
                Draw.Dot (i, j, col)
            end if
        end for
    end for
end ellipse

Pic.Opacity(picID, opacity) %or maybe
Pic.Opacity(picID,opacity,backgroundcolour)

proc checksomething
   if blah > cjah then
       cfor(down,1,10,1)
    end if
end checksomething
cfor (up,1, 1, 10)
%stuff goes here
checksomething
end for

cfor(up/down,forID,startnum,endnum)

Mouse.ButtonChoose ("multibutton")
var x1, y1, x2, y2 : real
var mx, my, btn : int
var firsthit := false

loop
    cls
    mousewhere (mx, my, btn)

    if btn = 1 and firsthit = false then
        firsthit := true
        x1 := mx
        y1 := my
    end if
    if btn = 100 then
        firsthit := false
    end if
    if firsthit = true then
        x2 := mx
        y2 := my
        drawline (round (x1), round (y1), round (x2), round (y2), black)
        locate (1, 1)
        put Math.Angle (x1, y1, x2, y2)
    end if
    View.Update
    delay (10)
end loop

string := "hi::how::are::you"
new_array := Explode (string, new_array, "::")
/*
i'm a bit rusty with turing and php, but new_array should include:
new_array[0] := "hi"
new_array[1] := "how"
new_array[2] := "are"
new_array[3] := "you"
*/

/*
 By: Tan (aka Mystic)

 For: "NEW COMMANDS FOR TURING"

 This program takes a string and splits it depending on what the splitting letter is
 You may enter any letter but if the letter is not present in the sentence, the entire sentence is the
 result. Comments are put to guide how it works.

 Usage: Many Encryption problem deal with removing spaces, and many other problems deal with removing certain characters,
 not a really necessary program but still useful sometimes.

 */

fcn stringSplit (line : string, letter : string) : string  %Creating a function that outputs the result and takes a word, and letter
    var splitter : string  % The main Answer

    for x : 1 .. length (line)               % This loop checks whether the beginning is from a space or not or the series of
        if line (x) not= letter then         % letters in the beginning
            splitter := line (x .. *)        % If it finds the non-splitter inside
            exit
        end if
    end for

    for decreasing x : length (splitter) .. 1   %Same as above loop. except this time it checks whether In the end
        if splitter (x) not= letter then        %If there are letters left
            splitter := splitter (1 .. x)
            exit
        end if
    end for

    loop %Looping untill the sentence is letter free!
        exit when index (splitter, letter) = 0  %Exits the loop, when no letters are left in the sentence
        splitter := splitter (1 .. index (splitter, letter) - 1) + splitter (index (splitter, letter) + 1 .. *) %Main splitting
    end loop %Self Explainatory (maybe =P)

    result splitter  %Resulting the answer
end stringSplit

put stringSplit ("      I    THINNNNNK IT WORKS ? ? ? ?  ASND A DAS DSDA DD A ", " ") % Well the sentences, splitting letter here.

string.split();

import Key

var input : array char of boolean

loop
Input.KeyDown (input)
if input (KEY_RIGHT_ARROW) then
Draw.FillOval (maxx div 2 - 20, maxy div 2, 20, 20, Rand.Int (1, 10))
end if

if Key.Check (input, KEY_LEFT_ARROW) then
Draw.FillOval (maxx div 2 + 20, maxy div 2, 20, 20, Rand.Int (1, 10))
end if

Key.Switch (input, KEY_LEFT_ARROW)
end loop

Draw.ThickOval (x, y, xRadius, yRadius, thickness, Color : int)
Draw.ThickBox (x1, y1, x2, y2, thickness, Color : int)

    proc ThickBox (x1, y1, x2, y2, thickness, Color : int)
        Draw.FillBox (x1, y1, x1 + thickness, y2, Color)    %left side
        Draw.FillBox (x2 - thickness, y1, x2, y2, Color)    %right side
        Draw.FillBox (x1, y1, x2, y1 + thickness, Color)    %bottom
        Draw.FillBox (x1, y2 - thickness, x2, y2, Color)    %top
    end ThickBox

proc ThickBox (x1, y1, x2, y2, thickness, Color : int)
    Draw.Box (x1, y1, x2, y2, Color)
    Draw.Box (x1 + thickness, y1 + thickness, x2 - thickness, y2 - thickness, Color)
    Draw.Fill (x1 + 1, y1 + 1, Color, Color)
end ThickBox

proc ThickBox (x1, y1, x2, y2, thickness, Color : int)
    Draw.FillBox (x1, y1, x1 + thickness, y2, Color)        %left side
    Draw.FillBox (x2 - thickness, y1, x2, y2, Color)        %right side
    Draw.FillBox (x1, y1, x2, y1 + thickness, Color)        %bottom
    Draw.FillBox (x1, y2 - thickness, x2, y2, Color)        %top
end ThickBox

proc ThickBox2 (x1, y1, x2, y2, thickness, Color : int)
    Draw.Box (x1, y1, x2, y2, Color)
    Draw.Box (x1 + thickness, y1 + thickness, x2 - thickness, y2 - thickness, Color)
    Draw.Fill (x1 + 1, y1 + 1, Color, Color)
end ThickBox2


var currentTime := Time.Elapsed
for i : 1 .. 200
    ThickBox (50, 50, 100, 100, 20, black)
end for
put Time.Elapsed - currentTime

currentTime := Time.Elapsed
for i : 1 .. 200
    ThickBox2 (50, 50, 100, 100, 20, black)
end for
put Time.Elapsed - currentTime

Draw.ThickCircle (x,y,radius,thickness,colour)

Hello world

proc ThickOval (x, y, xr, yr, thickness, c : int)
    for i : 1 .. 360
        Draw.FillOval (round (x + (cosd (i) * xr)), round (y + (sind (i) * yr)), thickness, thickness, c)
    end for
end ThickOval

proc ThickFillOval (x, y, xr, yr, thickness, ct, cm : int)
    drawoval (x, y, xr, yr, 255)
    for s : 1 .. thickness
        drawoval (x, y, xr + s, yr + s, 255)
        drawoval (x, y, xr - s, yr - s, 255)
    end for
    drawfilloval (x, y, xr - 1, yr - 1, cm)
end ThickFillOval

ThickFillOval (maxx div 2, maxy div 2, 50, 50, 3, 255, brightred)

/*
 Created by: Tan (aka Mystic)
 Module fraction.Reduce takes a fraction in a*b/c format and reduces it to lowest terms
 */

module fraction %%% MODULE

    export Reduce

    proc Reduce (whole : int, numerator : int, denominator : int) %%% REDUCTION PROCEDURE

        var num := (denominator * whole) + numerator %% NUMERATOR
        var den := denominator %% DENOMINATOR
        var numorden : int
        var ans : string %% ANSWER

        if num mod den = 0 then %% IF IT IS A LIKE FRACTION
            ans := "Reduced Fraction: " + intstr (whole) + " " + intstr (numerator) + "/" + intstr (denominator) + " into: \n" + intstr (num div den) + "/" + "1"
            %%put ans
        else % IF IT IS AN UNLIKE FRACTION

            if den < num then   %% IF THE DENOMINATOR IS GREATOR THEN WE TAKE THE GCF FROM DECREASING DENOMINATOR
                numorden := den
            elsif den > num then %% VICE VERSA
                numorden := num
            end if

            for decreasing s : numorden .. 1 %% GREATEST COMMON FACTOR
                if (num mod s = 0) and (den mod s = 0) then
                    numorden := s %% NUM OR DEN NOW BECOMES THE GCF
                    exit
                end if
            end for

            if den > num then  %% ANSWERS
                %% IF IT CANT BE REDUCED MORE THEN
                ans := "Reduced Fraction: " + intstr (whole) + " " + intstr (numerator) + "/" + intstr (denominator) + " into: \n" + intstr (num div numorden) + "/" + intstr (den div numorden)
            elsif den < num then
                %% IF IT CAN BE REDUCED, EXPRESS IT AS A MIXED FRACTION
                ans := "Reduced Fraction: " + intstr (whole) + " " + intstr (numerator) + "/" + intstr (denominator) + " into: \n" + intstr ((num div numorden) div (den div numorden)) + " " +
                    intstr ((num div numorden) - (((num div numorden) div (den div numorden)) * den div numorden)) + "/" + intstr (den div numorden)
            end if
        end if

        put ans %% PUTTING THE MAIN ANSWER WE GOT

    end Reduce %% ENDING THE REDUCE

end fraction %% ENDING THE MODULE

fraction.Reduce (5, 45, 3) %% HERE 0 IS THE WHOLE NUMBER, 3 IS THE NUMERATOR, 2 IS THE DENOMINATOR

type Fraction :
   record
      numerator, denominator : int
   end record

function makeFraction (num, denom : int) : Fraction
   var output : Fraction
   output.numerator := num
   output.denominator := denom
   result output
end makeFraction

function reduce (f : Fraction) : Fraction
   if f.numerator mod f.denominator == 0 then
      result makeFraction (f.numerator div f.denominator, 1)
   else
      ...
   end if
end reduce

setscreen ("graphics:max;max")
var exampleFont : int := Font.New ("Times:100:bold,italic")
Font.Centre ("Gandalf", maxx div 2, maxy div 2, exampleFont, green)

result (y2 - y1) / (x2 - x1)

/* Created by : Tan.
 All 3 in one module!
 1: Reduces the Fractions into Lowest terms
 2: Finds the LCM in 2 denomintors
 3: Adds mixed fractions and results the answer in lowest terms!
 */

module Maths  %% Module

    export LCM, fractionAdd, Reduce %% .LCM

    fcn Reduce (whole : int, numerator : int, denominator : int) : string    %%% REDUCTION PROCEDURE

        var num := (denominator * whole) + numerator %% NUMERATOR
        var den := denominator %% DENOMINATOR
        var numorden : int
        var ans : string %% ANSWER

        if num mod den = 0 then %% IF IT IS A LIKE FRACTION
            ans := intstr (num div den) + "/" + "1"
            %%put ans
        else % IF IT IS AN UNLIKE FRACTION

            if den < num then   %% IF THE DENOMINATOR IS GREATOR THEN WE TAKE THE GCF FROM DECREASING DENOMINATOR
                numorden := den
            elsif den > num then %% VICE VERSA
                numorden := num
            end if

            for decreasing s : numorden .. 1 %% GREATEST COMMON FACTOR
                if (num mod s = 0) and (den mod s = 0) then
                    numorden := s %% NUM OR DEN NOW BECOMES THE GCF
                    exit
                end if
            end for

            if den > num then  %% ANSWERS
                %% IF IT CANT BE REDUCED MORE THEN
                ans := intstr (num div numorden) + "/" + intstr (den div numorden)
            elsif den < num then
                %% IF IT CAN BE REDUCED, EXPRESS IT AS A MIXED FRACTION
                ans := intstr ((num div numorden) div (den div numorden)) + " " +
                    intstr ((num div numorden) - (((num div numorden) div (den div numorden)) * den div numorden)) + "/" + intstr (den div numorden)
            end if
        end if

        result ans %% PUTTING THE MAIN ANSWER WE GOT

    end Reduce %% ENDING THE REDUCE


    %%%%% Finds the LCM %%%%%
    fcn LCM (denominator1 : int, denominator2 : int) : int %% Main Function

        var choice, ans : int %choice detemines whether to start counting from numerator or denominator

        if denominator1 > denominator2 then
            choice := denominator1 %if numerator is bigger then choice = numerator
        elsif denominator1 < denominator2 then
            choice := denominator2 %elsif it = denominator
        else
            choice := denominator1 %% both are equal
        end if

        loop
            exit when (choice mod denominator1 = 0) and (choice mod denominator2 = 0)
            choice += 1
        end loop

        ans := choice

        result ans

    end LCM %% Lcm Ends

    %%%%%% Adds the Fractions and then reduces them to lowest terms%%%%%%
    fcn fractionAdd (whole1 : int, num1 : int, den1 : int, whole2 : int, num2 : int, den2 : int) : string
        var wholetotal := whole1 + whole2
        var lcm := LCM (den1, den2)
        var numerator := ((lcm div den1) * num1) + ((lcm div den2) * num2)
        result Reduce (wholetotal, numerator, lcm)
    end fractionAdd

end Maths %% End Module

put Maths.Reduce (0, 10, 25) %Whole num, Numerator, denominator
put skip, Maths.LCM (8, 7) % Denominator1, Denominator2
put skip, Maths.fractionAdd (0, 1, 2, 2, 3, 4) %Whole1, Numerator1, Denominator1, Whole2, Numerator2, Denominator2

Foo* bar;

struct Foo* bar;

View.Set ("graphics:200;200,offscreenonly,position:center,middle,nobuttonbar")

proc ellipse (x, y, xh, yh, angle, c : int)
    for i : 1 .. 360
        Draw.Dot (x + round ((cosd (i - angle) * xh)), y + round ((sind (i) * yh)), c)
    end for
end ellipse

for i : 1 .. 360
    cls
    ellipse (100, 100, 70, 50, i, 2)
    put "Angle:",i
    View.Update
    delay (10)
end for

setscreen ("graphics:max;max,nobuttonbar")
colorback (black)
cls
var mx, my, mz : int

procedure ShadeOval (x, y, a, b, c1, c2 : int)
    var high : int
    if a > b then
        high := a
    elsif b > a then
        high := b
    else
        high := a
    end if
    var r, g, bl : array 1 .. 2 of real
    RGB.GetColor (c1, r (1), g (1), bl (1))
    RGB.GetColor (c2, r (2), g (2), bl (2))
    var C : int
    var dr, dg, db : real
    dr := (r (1) - r (2)) / high
    dg := (g (1) - g (2)) / high
    db := (bl (1) - bl (2)) / high
    for decreasing i : high .. 2
        r (2) += dr
        g (2) += dg
        bl (2) += db
        C := RGB.AddColor (r (2), g (2), bl (2))
        drawfilloval (x, y, round (a * (i / high)), round (b * (i / high)), C)
    end for
end ShadeOval

loop
    mousewhere (mx, my, mz)
    if mz = 1 then
        ShadeOval (mx, my, 15, 15, yellow, black)
    end if
end loop

proc circle (c : int)
    for a : 0 .. 360
        for i : 1 .. c
            drawdot (round (100 + sin (a) * i), round (100 + cos (a) * i), black)
        end for
    end for
    drawdot (100, 100, black)
end circle

circle (20)

proc circle (c, X : int)
    var res : array 1 .. 360, 1 .. c of int
    var r, g, b : array 1 .. 2 of real
    var C : int
    for d : 1 .. 2
        for a : 1 .. 360
            for i : 1 .. c
                if d = 1 then
                    C := whatdotcolor (round (maxx div 2 + sin (a) * i), round (maxy div 2 + cos (a) * i))
                    RGB.GetColor (C, r (1), g (1), b (1))
                    RGB.GetColor (X, r (2), g (2), b (2))
                    res (a, i) := RGB.AddColor ((r (1) + r (2)) / 2, (g (1) + g (2)) / 2, (b (1) + b (2)) / 2)
                else
                    drawdot (round (maxx div 2 + sin (a) * i), round (maxy div 2 + cos (a) * i), res (a, i))

                end if
            end for
        end for
    end for
    C := whatdotcolor (maxx div 2, maxy div 2)
    RGB.GetColor (C, r (1), g (1), b (1))
    RGB.GetColor (X, r (2), g (2), b (2))
    var BLAAAAAAAAH : int := RGB.AddColor ((r (1) + r (2)) / 2, (g (1) + g (2)) / 2, (b (1) + b (2)) / 2)
    drawdot (maxx div 2, maxy div 2, BLAAAAAAAAH)
end circle
setscreen ("graphics:300;200,nobuttonbar,position:center;center")
for i : 1 .. 1000
    drawfilloval (Rand.Int (0, maxx), Rand.Int (0, maxy), Rand.Int (5, 20), Rand.Int (5, 20), Rand.Int (1, 6))
end for
circle (20, black)