document.evaluate( "//div[contains(@class, 'js-gps-related-tags')]/div/a",
            rTag, null, XPathResult.UNORDERED_NODE_SNAPSHOT_TYPE, null);

function crc32 (str) {
  // kevin.vanzonneveld.net
  // +   original by: Webtoolkit.info (webtoolkit.info)
  // +   improved by: T0bsn
  // -    depends on: utf8_encode
  // *     example 1: crc32('Kevin van Zonneveld');
  // *     returns 1: 1249991249
  str = this.utf8_encode(str);
  var table = "00000000 77073096 EE0E612C 990951BA 076DC419 706AF48F E963A535 9E6495A3 0EDB8832 79DCB8A4 E0D5E91E 97D2D988 09B64C2B 7EB17CBD E7B82D07 90BF1D91 1DB71064 6AB020F2 F3B97148 84BE41DE 1ADAD47D 6DDDE4EB F4D4B551 83D385C7 136C9856 646BA8C0 FD62F97A 8A65C9EC 14015C4F 63066CD9 FA0F3D63…

(!vowels)

google

var button = document.querySelector('#sayit-button');
button.attributes
> NamedNodeMap {0: class, 1: id, length: 2}

var div = document.createElement("div");
div.className = "this is";
div.id = "fortyTwo";
div.onclick = function(){alert("click");};

div.attributes; div.attributes.id.nodeValue;

        crc  = 0xFFFFFFFF;       // initial contents of LFBSR
        int poly = 0xEDB88320;   // reverse polynomial

        for (byte b : bytes) {
            int temp = (crc ^ b) & 0xff;

            // read 8 bits one at a time
            for (int i = 0; i < 8; i++) {
                if ((temp & 1) == 1) temp = (temp >>> 1) ^ poly;
                else                 temp = (temp >>> 1);
            }
            crc = (crc >>> 8) ^ temp;
        }

        // flip bits
        crc = crc ^ 0xffffffff;

float Q_rsqrt( float number )
{
	long i;
	float x2, y;
	const float threehalfs = 1.5F;

	x2 = number * 0.5F;
	y  = number;
	i  = * ( long * ) &y;                       // evil floating point bit level hacking
	i  = 0x5f3759df - ( i >> 1 );               // what the fuck?
	y  = * ( float * ) &i;
	y  = y * ( threehalfs - ( x2 * y * y ) );   // 1st iteration
//	y  = y * ( threehalfs - ( x2 * y * y ) );   // 2nd iteration, this can be removed

	return y;
}

The algorithm computes 1/√x by performing the following steps:

    Alias the argument x to an integer, as a way to compute an approximation of log2(x)
    Use this approximation to compute an approximation of log2(1/√x)
    Alias back to a float, as a way to compute an approximation of the base-2 exponential
    Refine the approximation using a single iteration of the Newton's method.

The algorithm computes 1/√x by performing the following steps:
    Dark, dark magic.

x = (2**a)*(1+b)
log x = a + log(1+b)