/* tslint:disable */
var seed = 0x01000193;

function murmurhash3_32_gc(key: any) {
    var remainder: any, bytes: any, h1: any, h1b: any, c1: any, c2: any, k1: any, i: any;

    remainder = key.length & 3; // key.length % 4
    bytes = key.length - remainder;
    h1 = seed;
    c1 = 0xcc9e2d51;
    c2 = 0x1b873593;
    i = 0;

    while (i < bytes) {
        k1 =
            ((key.readUInt8(i) & 0xff)) |
            ((key.readUInt8(++i) & 0xff) << 8) |
            ((key.readUInt8(++i) & 0xff) << 16) |
            ((key.readUInt8(++i) & 0xff) << 24);
        ++i;

        k1 = ((((k1 & 0xffff) * c1) + ((((k1 >>> 16) * c1) & 0xffff) << 16))) & 0xffffffff;
        k1 = (k1 << 15) | (k1 >>> 17);
        k1 = ((((k1 & 0xffff) * c2) + ((((k1 >>> 16) * c2) & 0xffff) << 16))) & 0xffffffff;

        h1 ^= k1;
        h1 = (h1 << 13) | (h1 >>> 19);
        h1b = ((((h1 & 0xffff) * 5) + ((((h1 >>> 16) * 5) & 0xffff) << 16))) & 0xffffffff;
        h1 = (((h1b & 0xffff) + 0x6b64) + ((((h1b >>> 16) + 0xe654) & 0xffff) << 16));
    }

    k1 = 0;

    switch (remainder) {
        case 3:
            k1 ^= (key.readUInt8(i + 2) & 0xff) << 16;
        case 2:
            k1 ^= (key.readUInt8(i + 1) & 0xff) << 8;
        case 1:
            k1 ^= (key.readUInt8(i) & 0xff);

            k1 = (((k1 & 0xffff) * c1) + ((((k1 >>> 16) * c1) & 0xffff) << 16)) & 0xffffffff;
            k1 = (k1 << 15) | (k1 >>> 17);
            k1 = (((k1 & 0xffff) * c2) + ((((k1 >>> 16) * c2) & 0xffff) << 16)) & 0xffffffff;
            h1 ^= k1;
    }

    h1 ^= key.length;

    h1 ^= h1 >>> 16;
    h1 = (((h1 & 0xffff) * 0x85ebca6b) + ((((h1 >>> 16) * 0x85ebca6b) & 0xffff) << 16)) & 0xffffffff;
    h1 ^= h1 >>> 13;
    h1 = ((((h1 & 0xffff) * 0xc2b2ae35) + ((((h1 >>> 16) * 0xc2b2ae35) & 0xffff) << 16))) & 0xffffffff;
    h1 ^= h1 >>> 16;

    var result = h1 >>> 0;

    // This simulates the 32 bit integer overflow to match Java implementation
    return result | 0;
}

export = murmurhash3_32_gc;

for(int i = 0; i < children.length; i++)
{
	if(i == children.length-1)
		children[i] = null; 
	else
		children[i] = children[i+1]; 
}

for(int i = 0; i < children.length-1; i++)
{
	children[i] = children[i+1]; 
}
children[children.length-1] = null;

if(someValue) {
    return firstValue
}
return secondValue