//-------------------------------------------------------------------------------------------------------
// Copyright (C) Microsoft. All rights reserved.
// Licensed under the MIT license. See LICENSE.txt file in the project root for full license information.
//-------------------------------------------------------------------------------------------------------

function foo() {}

var all = [ undefined, null,
            true, false, new Boolean(true), new Boolean(false),
            NaN, +0, -0, 0, 1, 10.0, 10.1, -1, -5, 5,
            124, 248, 654, 987, -1026, +98768.2546, -88754.15478,
            1<<32, -(1<<32), (1<<32)-1, 1<<31, -(1<<31), 1<<25, -1<<25,
            Number.MAX_VALUE, Number.MIN_VALUE, Number.NaN, Number.POSITIVE_INFINITY, Number.NEGATIVE_INFINITY,
            new Number(NaN), new Number(+0), new Number( -0), new Number(0), new Number(1),
            new Number(10.0), new Number(10.1),
            new Number(Number.MAX_VALUE), new Number(Number.MIN_VALUE), new Number(Number.NaN),
            new Number(Number.POSITIVE_INFINITY), new Number(Number.NEGATIVE_INFINITY),
            "", "hello", "hel" + "lo", "+0", "-0", "0", "1", "10.0", "10.1",
            new String(""), new String("hello"), new String("he" + "llo"),
            new Object(), [1,2,3], new Object(), [1,2,3] , foo
          ];


function AsmModuleUInt() {
    "use asm";


    function LtUInt(x,y) {
        x = x|0;
        y = y|0;
        return ((x>>>0)<(y>>>0))|0;
    }


    function LeUInt(x,y) {
        x = x|0;
        y = y|0;
        return ((x>>>0)<=(y>>>0))|0;
    }

    function GtUInt(x,y) {
        x = x|0;
        y = y|0;
        return ((x>>>0)>(y>>>0))|0;
    }

    function GeUInt(x,y) {
        x = x|0;
        y = y|0;
        return ((x>>>0)>=(y>>>0))|0;
    }

    function EqUInt(x,y) {
        x = x|0;
        y = y|0;
        return ((x>>>0)==(y>>>0))|0;
    }

    function NeUInt(x,y) {
        x = x|0;
        y = y|0;
        return ((x>>>0)!=(y>>>0))|0;
    }

    return {
         Lt : LtUInt
        ,Le : LeUInt
        ,Gt : GtUInt
        ,Ge : GeUInt
        ,Eq : EqUInt
        ,Ne : NeUInt
    };
}

var asmModuleUInt = AsmModuleUInt();     // produces AOT-compiled version

print("Comparison for unsigned ints");
for (var i=0; i<all.length; ++i) {
    for (var j=0; j<all.length; ++j) {
        print("ui a["+i+"](" + all[i] +") <  a["+j+"]("+all[j]+") = " + (asmModuleUInt.Lt(all[i],all[j])));
        print("ui a["+i+"](" + all[i] +") <= a["+j+"]("+all[j]+") = " + (asmModuleUInt.Le(all[i],all[j])));
        print("ui a["+i+"](" + all[i] +") >  a["+j+"]("+all[j]+") = " + (asmModuleUInt.Gt(all[i],all[j])));
        print("ui a["+i+"](" + all[i] +") >= a["+j+"]("+all[j]+") = " + (asmModuleUInt.Ge(all[i],all[j])));
        print("ui a["+i+"](" + all[i] +") == a["+j+"]("+all[j]+") = " + (asmModuleUInt.Eq(all[i],all[j])));
        print("ui a["+i+"](" + all[i] +") != a["+j+"]("+all[j]+") = " + (asmModuleUInt.Ne(all[i],all[j])));
    }
}