import collections.abc import gc import pickle import random import sys import unittest import weakref from immutables.map import Map as PyMap from immutables._testutils import EqError from immutables._testutils import HashKey from immutables._testutils import HashKeyCrasher from immutables._testutils import HashingError from immutables._testutils import KeyStr from immutables._testutils import ReprError class BaseMapTest: Map = None def test_hashkey_helper_1(self): k1 = HashKey(10, 'aaa') k2 = HashKey(10, 'bbb') self.assertNotEqual(k1, k2) self.assertEqual(hash(k1), hash(k2)) d = dict() d[k1] = 'a' d[k2] = 'b' self.assertEqual(d[k1], 'a') self.assertEqual(d[k2], 'b') def test_map_basics_1(self): h = self.Map() h = None # NoQA def test_map_basics_2(self): h = self.Map() self.assertEqual(len(h), 0) h2 = h.set('a', 'b') self.assertIsNot(h, h2) self.assertEqual(len(h), 0) self.assertEqual(len(h2), 1) self.assertIsNone(h.get('a')) self.assertEqual(h.get('a', 42), 42) self.assertEqual(h2.get('a'), 'b') h3 = h2.set('b', 10) self.assertIsNot(h2, h3) self.assertEqual(len(h), 0) self.assertEqual(len(h2), 1) self.assertEqual(len(h3), 2) self.assertEqual(h3.get('a'), 'b') self.assertEqual(h3.get('b'), 10) self.assertIsNone(h.get('b')) self.assertIsNone(h2.get('b')) self.assertIsNone(h.get('a')) self.assertEqual(h2.get('a'), 'b') h = h2 = h3 = None def test_map_basics_3(self): h = self.Map() o = object() h1 = h.set('1', o) h2 = h1.set('1', o) self.assertIs(h1, h2) def test_map_basics_4(self): h = self.Map() h1 = h.set('key', []) h2 = h1.set('key', []) self.assertIsNot(h1, h2) self.assertEqual(len(h1), 1) self.assertEqual(len(h2), 1) self.assertIsNot(h1.get('key'), h2.get('key')) def test_map_collision_1(self): k1 = HashKey(10, 'aaa') k2 = HashKey(10, 'bbb') k3 = HashKey(10, 'ccc') h = self.Map() h2 = h.set(k1, 'a') h3 = h2.set(k2, 'b') self.assertEqual(h.get(k1), None) self.assertEqual(h.get(k2), None) self.assertEqual(h2.get(k1), 'a') self.assertEqual(h2.get(k2), None) self.assertEqual(h3.get(k1), 'a') self.assertEqual(h3.get(k2), 'b') h4 = h3.s
/**
 * [js-sha256]{@link https://github.com/emn178/js-sha256/}
 *
 * @version 0.9.0
 * @author Chen, Yi-Cyuan [emn178@gmail.com]
 * @copyright Chen, Yi-Cyuan 2014-2017
 * @license MIT
 */

var fake_window = {};

var ERROR = 'input is invalid type';
var WINDOW = typeof fake_window === 'object';
var root = /*WINDOW ? window : {}*/ fake_window;
if (root.JS_SHA256_NO_WINDOW) {
    WINDOW = false;
}
var WEB_WORKER = !WINDOW && typeof self === 'object';
var NODE_JS = !root.JS_SHA256_NO_NODE_JS && typeof process === 'object' && process.versions && process.versions.node;
if (NODE_JS) {
    root = global;
} else if (WEB_WORKER) {
    root = self;
}
var COMMON_JS = !root.JS_SHA256_NO_COMMON_JS && typeof module === 'object' && module.exports;
var AMD = typeof define === 'function' && define.amd;
var ARRAY_BUFFER = !root.JS_SHA256_NO_ARRAY_BUFFER && typeof ArrayBuffer !== 'undefined';
var HEX_CHARS = '0123456789abcdef'.split('');
var EXTRA = [-2147483648, 8388608, 32768, 128];
var SHIFT = [24, 16, 8, 0];
var K = [
    0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
    0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
    0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
    0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
    0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
    0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
    0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
    0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2
];
var OUTPUT_TYPES = ['hex', 'array', 'digest', 'arrayBuffer'];

var blocks = [];

if (root.JS_SHA256_NO_NODE_JS || !Array.isArray) {
    Array.isArray = function (obj) {
	return Object.prototype.toString.call(obj) === '[object Array]';
    };
}

if (ARRAY_BUFFER && (root.JS_SHA256_NO_ARRAY_BUFFER_IS_VIEW || !ArrayBuffer.isView)) {
    ArrayBuffer.isView = function (obj) {
	return typeof obj === 'object' && obj.buffer && obj.buffer.constructor === ArrayBuffer;
    };
}

var createOutputMethod = function (outputType, is224) {
    return function (message) {
	return new Sha256(is224, true).update(message)[outputType]();
    };
};

var createMethod = function (is224) {
    var method = createOutputMethod('hex', is224);
    if (NODE_JS) {
	method = nodeWrap(method, is224);
    }
    method.create = function () {
	return new Sha256(is224);
    };
    method.update = function (message) {
	return method.create().update(message);
    };
    for (var i = 0; i < OUTPUT_TYPES.length; ++i) {
	var type = OUTPUT_TYPES[i];
	method[type] = createOutputMethod(type, is224);
    }
    return method;
};

var nodeWrap = function (method, is224) {
    var crypto = eval("require('crypto')");
    var Buffer = eval("require('buffer').Buffer");
    var algorithm = is224 ? 'sha224' : 'sha256';
    var nodeMethod = function (message) {
	if (typeof message === 'string') {
            return crypto.createHash(algorithm).update(message, 'utf8').digest('hex');
	} else {
            if (message === null || message === undefined) {
		throw new Error(ERROR);
            } else if (message.constructor === ArrayBuffer) {
		message = new Uint8Array(message);
            }
	}
	if (Array.isArray(message) || ArrayBuffer.isView(message) ||
            message.constructor === Buffer) {
            return crypto.createHash(algorithm).update(new Buffer(message)).digest('hex');
	} else {
            return method(message);
	}
    };
    return nodeMethod;
};

var createHmacOutputMethod = function (outputType, is224) {
    return function (key, message) {
	return new HmacSha256(key, is224, true).update(message)[outputType]();
    };
};

var createHmacMethod = function (is224) {
    var method = createHmacOutputMethod('hex', is224);
    method.create = function (key) {
	return new HmacSha256(key, is224);
    };
    method.update = function (key, message) {
	return method.create(key).update(message);
    };
    for (var i = 0; i < OUTPUT_TYPES.length; ++i) {
	var type = OUTPUT_TYPES[i];
	method[type] = createHmacOutputMethod(type, is224);
    }
    return method;
};

function Sha256(is224, sharedMemory) {
    if (sharedMemory) {
	blocks[0] = blocks[16] = blocks[1] = blocks[2] = blocks[3] =
            blocks[4] = blocks[5] = blocks[6] = blocks[7] =
            blocks[8] = blocks[9] = blocks[10] = blocks[11] =
            blocks[12] = blocks[13] = blocks[14] = blocks[15] = 0;
	this.blocks = blocks;
    } else {
	this.blocks = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0];
    }

    if (is224) {
	this.h0 = 0xc1059ed8;
	this.h1 = 0x367cd507;
	this.h2 = 0x3070dd17;
	this.h3 = 0xf70e5939;
	this.h4 = 0xffc00b31;
	this.h5 = 0x68581511;
	this.h6 = 0x64f98fa7;
	this.h7 = 0xbefa4fa4;
    } else { // 256
	this.h0 = 0x6a09e667;
	this.h1 = 0xbb67ae85;
	this.h2 = 0x3c6ef372;
	this.h3 = 0xa54ff53a;
	this.h4 = 0x510e527f;
	this.h5 = 0x9b05688c;
	this.h6 = 0x1f83d9ab;
	this.h7 = 0x5be0cd19;
    }

    this.block = this.start = this.bytes = this.hBytes = 0;
    this.finalized = this.hashed = false;
    this.first = true;
    this.is224 = is224;
}

Sha256.prototype.update = function (message) {
    if (this.finalized) {
	return;
    }
    var notString, type = typeof message;
    if (type !== 'string') {
	if (type === 'object') {
            if (message === null) {
		throw new Error(ERROR);
            } else if (ARRAY_BUFFER && message.constructor === ArrayBuffer) {
		message = new Uint8Array(message);
            } else if (!Array.isArray(message)) {
		if (!ARRAY_BUFFER || !ArrayBuffer.isView(message)) {
		    throw new Error(ERROR);
		}
            }
	} else {
            throw new Error(ERROR);
	}
	notString = true;
    }
    var code, index = 0, i, length = message.length, blocks = this.blocks;

    while (index < length) {
	if (this.hashed) {
            this.hashed = false;
            blocks[0] = this.block;
            blocks[16] = blocks[1] = blocks[2] = blocks[3] =
		blocks[4] = blocks[5] = blocks[6] = blocks[7] =
		blocks[8] = blocks[9] = blocks[10] = blocks[11] =
		blocks[12] = blocks[13] = blocks[14] = blocks[15] = 0;
	}

	if (notString) {
            for (i = this.start; index < length && i < 64; ++index) {
		blocks[i >> 2] |= message[index] << SHIFT[i++ & 3];
            }
	} else {
            for (i = this.start; index < length && i < 64; ++index) {
		code = message.charCodeAt(index);
		if (code < 0x80) {
		    blocks[i >> 2] |= code << SHIFT[i++ & 3];
		} else if (code < 0x800) {
		    blocks[i >> 2] |= (0xc0 | (code >> 6)) << SHIFT[i++ & 3];
		    blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
		} else if (code < 0xd800 || code >= 0xe000) {
		    blocks[i >> 2] |= (0xe0 | (code >> 12)) << SHIFT[i++ & 3];
		    blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];
		    blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
		} else {
		    code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));
		    blocks[i >> 2] |= (0xf0 | (code >> 18)) << SHIFT[i++ & 3];
		    blocks[i >> 2] |= (0x80 | ((code >> 12) & 0x3f)) << SHIFT[i++ & 3];
		    blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];
		    blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
		}
            }
	}

	this.lastByteIndex = i;
	this.bytes += i - this.start;
	if (i >= 64) {
            this.block = blocks[16];
            this.start = i - 64;
            this.hash();
            this.hashed = true;
	} else {
            this.start = i;
	}
    }
    if (this.bytes > 4294967295) {
	this.hBytes += this.bytes / 4294967296 << 0;
	this.bytes = this.bytes % 4294967296;
    }
    return this;
};

Sha256.prototype.finalize = function () {
    if (this.finalized) {
	return;
    }
    this.finalized = true;
    var blocks = this.blocks, i = this.lastByteIndex;
    blocks[16] = this.block;
    blocks[i >> 2] |= EXTRA[i & 3];
    this.block = blocks[16];
    if (i >= 56) {
	if (!this.hashed) {
            this.hash();
	}
	blocks[0] = this.block;
	blocks[16] = blocks[1] = blocks[2] = blocks[3] =
            blocks[4] = blocks[5] = blocks[6] = blocks[7] =
            blocks[8] = blocks[9] = blocks[10] = blocks[11] =
            blocks[12] = blocks[13] = blocks[14] = blocks[15] = 0;
    }
    blocks[14] = this.hBytes << 3 | this.bytes >>> 29;
    blocks[15] = this.bytes << 3;
    this.hash();
};

Sha256.prototype.hash = function () {
    var a = this.h0, b = this.h1, c = this.h2, d = this.h3, e = this.h4, f = this.h5, g = this.h6,
	h = this.h7, blocks = this.blocks, j, s0, s1, maj, t1, t2, ch, ab, da, cd, bc;

    for (j = 16; j < 64; ++j) {
	// rightrotate
	t1 = blocks[j - 15];
	s0 = ((t1 >>> 7) | (t1 << 25)) ^ ((t1 >>> 18) | (t1 << 14)) ^ (t1 >>> 3);
	t1 = blocks[j - 2];
	s1 = ((t1 >>> 17) | (t1 << 15)) ^ ((t1 >>> 19) | (t1 << 13)) ^ (t1 >>> 10);
	blocks[j] = blocks[j - 16] + s0 + blocks[j - 7] + s1 << 0;
    }

    bc = b & c;
    for (j = 0; j < 64; j += 4) {
	if (this.first) {
            if (this.is224) {
		ab = 300032;
		t1 = blocks[0] - 1413257819;
		h = t1 - 150054599 << 0;
		d = t1 + 24177077 << 0;
            } else {
		ab = 704751109;
		t1 = blocks[0] - 210244248;
		h = t1 - 1521486534 << 0;
		d = t1 + 143694565 << 0;
            }
            this.first = false;
	} else {
            s0 = ((a >>> 2) | (a << 30)) ^ ((a >>> 13) | (a << 19)) ^ ((a >>> 22) | (a << 10));
            s1 = ((e >>> 6) | (e << 26)) ^ ((e >>> 11) | (e << 21)) ^ ((e >>> 25) | (e << 7));
            ab = a & b;
            maj = ab ^ (a & c) ^ bc;
            ch = (e & f) ^ (~e & g);
            t1 = h + s1 + ch + K[j] + blocks[j];
            t2 = s0 + maj;
            h = d + t1 << 0;
            d = t1 + t2 << 0;
	}
	s0 = ((d >>> 2) | (d << 30)) ^ ((d >>> 13) | (d << 19)) ^ ((d >>> 22) | (d << 10));
	s1 = ((h >>> 6) | (h << 26)) ^ ((h >>> 11) | (h << 21)) ^ ((h >>> 25) | (h << 7));
	da = d & a;
	maj = da ^ (d & b) ^ ab;
	ch = (h & e) ^ (~h & f);
	t1 = g + s1 + ch + K[j + 1] + blocks[j + 1];
	t2 = s0 + maj;
	g = c + t1 << 0;
	c = t1 + t2 << 0;
	s0 = ((c >>> 2) | (c << 30)) ^ ((c >>> 13) | (c << 19)) ^ ((c >>> 22) | (c << 10));
	s1 = ((g >>> 6) | (g << 26)) ^ ((g >>> 11) | (g << 21)) ^ ((g >>> 25) | (g << 7));
	cd = c & d;
	maj = cd ^ (c & a) ^ da;
	ch = (g & h) ^ (~g & e);
	t1 = f + s1 + ch + K[j + 2] + blocks[j + 2];
	t2 = s0 + maj;
	f = b + t1 << 0;
	b = t1 + t2 << 0;
	s0 = ((b >>> 2) | (b << 30)) ^ ((b >>> 13) | (b << 19)) ^ ((b >>> 22) | (b << 10));
	s1 = ((f >>> 6) | (f << 26)) ^ ((f >>> 11) | (f << 21)) ^ ((f >>> 25) | (f << 7));
	bc = b & c;
	maj = bc ^ (b & d) ^ cd;
	ch = (f & g) ^ (~f & h);
	t1 = e + s1 + ch + K[j + 3] + blocks[j + 3];
	t2 = s0 + maj;
	e = a + t1 << 0;
	a = t1 + t2 << 0;
    }

    this.h0 = this.h0 + a << 0;
    this.h1 = this.h1 + b << 0;
    this.h2 = this.h2 + c << 0;
    this.h3 = this.h3 + d << 0;
    this.h4 = this.h4 + e << 0;
    this.h5 = this.h5 + f << 0;
    this.h6 = this.h6 + g << 0;
    this.h7 = this.h7 + h << 0;
};

Sha256.prototype.hex = function () {
    this.finalize();

    var h0 = this.h0, h1 = this.h1, h2 = this.h2, h3 = this.h3, h4 = this.h4, h5 = this.h5,
	h6 = this.h6, h7 = this.h7;

    var hex = HEX_CHARS[(h0 >> 28) & 0x0F] + HEX_CHARS[(h0 >> 24) & 0x0F] +
	HEX_CHARS[(h0 >> 20) & 0x0F] + HEX_CHARS[(h0 >> 16) & 0x0F] +
	HEX_CHARS[(h0 >> 12) & 0x0F] + HEX_CHARS[(h0 >> 8) & 0x0F] +
	HEX_CHARS[(h0 >> 4) & 0x0F] + HEX_CHARS[h0 & 0x0F] +
	HEX_CHARS[(h1 >> 28) & 0x0F] + HEX_CHARS[(h1 >> 24) & 0x0F] +
	HEX_CHARS[(h1 >> 20) & 0x0F] + HEX_CHARS[(h1 >> 16) & 0x0F] +
	HEX_CHARS[(h1 >> 12) & 0x0F] + HEX_CHARS[(h1 >> 8) & 0x0F] +
	HEX_CHARS[(h1 >> 4) & 0x0F] + HEX_CHARS[h1 & 0x0F] +
	HEX_CHARS[(h2 >> 28) & 0x0F] + HEX_CHARS[(h2 >> 24) & 0x0F] +
	HEX_CHARS[(h2 >> 20) & 0x0F] + HEX_CHARS[(h2 >> 16) & 0x0F] +
	HEX_CHARS[(h2 >> 12) & 0x0F] + HEX_CHARS[(h2 >> 8) & 0x0F] +
	HEX_CHARS[(h2 >> 4) & 0x0F] + HEX_CHARS[h2 & 0x0F] +
	HEX_CHARS[(h3 >> 28) & 0x0F] + HEX_CHARS[(h3 >> 24) & 0x0F] +
	HEX_CHARS[(h3 >> 20) & 0x0F] + HEX_CHARS[(h3 >> 16) & 0x0F] +
	HEX_CHARS[(h3 >> 12) & 0x0F] + HEX_CHARS[(h3 >> 8) & 0x0F] +
	HEX_CHARS[(h3 >> 4) & 0x0F] + HEX_CHARS[h3 & 0x0F] +
	HEX_CHARS[(h4 >> 28) & 0x0F] + HEX_CHARS[(h4 >> 24) & 0x0F] +
	HEX_CHARS[(h4 >> 20) & 0x0F] + HEX_CHARS[(h4 >> 16) & 0x0F] +
	HEX_CHARS[(h4 >> 12) & 0x0F] + HEX_CHARS[(h4 >> 8) & 0x0F] +
	HEX_CHARS[(h4 >> 4) & 0x0F] + HEX_CHARS[h4 & 0x0F] +
	HEX_CHARS[(h5 >> 28) & 0x0F] + HEX_CHARS[(h5 >> 24) & 0x0F] +
	HEX_CHARS[(h5 >> 20) & 0x0F] + HEX_CHARS[(h5 >> 16) & 0x0F] +
	HEX_CHARS[(h5 >> 12) & 0x0F] + HEX_CHARS[(h5 >> 8) & 0x0F] +
	HEX_CHARS[(h5 >> 4) & 0x0F] + HEX_CHARS[h5 & 0x0F] +
	HEX_CHARS[(h6 >> 28) & 0x0F] + HEX_CHARS[(h6 >> 24) & 0x0F] +
	HEX_CHARS[(h6 >> 20) & 0x0F] + HEX_CHARS[(h6 >> 16) & 0x0F] +
	HEX_CHARS[(h6 >> 12) & 0x0F] + HEX_CHARS[(h6 >> 8) & 0x0F] +
	HEX_CHARS[(h6 >> 4) & 0x0F] + HEX_CHARS[h6 & 0x0F];
    if (!this.is224) {
	hex += HEX_CHARS[(h7 >> 28) & 0x0F] + HEX_CHARS[(h7 >> 24) & 0x0F] +
            HEX_CHARS[(h7 >> 20) & 0x0F] + HEX_CHARS[(h7 >> 16) & 0x0F] +
            HEX_CHARS[(h7 >> 12) & 0x0F] + HEX_CHARS[(h7 >> 8) & 0x0F] +
            HEX_CHARS[(h7 >> 4) & 0x0F] + HEX_CHARS[h7 & 0x0F];
    }
    return hex;
};

Sha256.prototype.toString = Sha256.prototype.hex;

Sha256.prototype.digest = function () {
    this.finalize();

    var h0 = this.h0, h1 = this.h1, h2 = this.h2, h3 = this.h3, h4 = this.h4, h5 = this.h5,
	h6 = this.h6, h7 = this.h7;

    var arr = [
	(h0 >> 24) & 0xFF, (h0 >> 16) & 0xFF, (h0 >> 8) & 0xFF, h0 & 0xFF,
	(h1 >> 24) & 0xFF, (h1 >> 16) & 0xFF, (h1 >> 8) & 0xFF, h1 & 0xFF,
	(h2 >> 24) & 0xFF, (h2 >> 16) & 0xFF, (h2 >> 8) & 0xFF, h2 & 0xFF,
	(h3 >> 24) & 0xFF, (h3 >> 16) & 0xFF, (h3 >> 8) & 0xFF, h3 & 0xFF,
	(h4 >> 24) & 0xFF, (h4 >> 16) & 0xFF, (h4 >> 8) & 0xFF, h4 & 0xFF,
	(h5 >> 24) & 0xFF, (h5 >> 16) & 0xFF, (h5 >> 8) & 0xFF, h5 & 0xFF,
	(h6 >> 24) & 0xFF, (h6 >> 16) & 0xFF, (h6 >> 8) & 0xFF, h6 & 0xFF
    ];
    if (!this.is224) {
	arr.push((h7 >> 24) & 0xFF, (h7 >> 16) & 0xFF, (h7 >> 8) & 0xFF, h7 & 0xFF);
    }
    return arr;
};

Sha256.prototype.array = Sha256.prototype.digest;

Sha256.prototype.arrayBuffer = function () {
    this.finalize();

    var buffer = new ArrayBuffer(this.is224 ? 28 : 32);
    var dataView = new DataView(buffer);
    dataView.setUint32(0, this.h0);
    dataView.setUint32(4, this.h1);
    dataView.setUint32(8, this.h2);
    dataView.setUint32(12, this.h3);
    dataView.setUint32(16, this.h4);
    dataView.setUint32(20, this.h5);
    dataView.setUint32(24, this.h6);
    if (!this.is224) {
	dataView.setUint32(28, this.h7);
    }
    return buffer;
};

function HmacSha256(key, is224, sharedMemory) {
    var i, type = typeof key;
    if (type === 'string') {
	var bytes = [], length = key.length, index = 0, code;
	for (i = 0; i < length; ++i) {
            code = key.charCodeAt(i);
            if (code < 0x80) {
		bytes[index++] = code;
            } else if (code < 0x800) {
		bytes[index++] = (0xc0 | (code >> 6));
		bytes[index++] = (0x80 | (code & 0x3f));
            } else if (code < 0xd800 || code >= 0xe000) {
		bytes[index++] = (0xe0 | (code >> 12));
		bytes[index++] = (0x80 | ((code >> 6) & 0x3f));
		bytes[index++] = (0x80 | (code & 0x3f));
            } else {
		code = 0x10000 + (((code & 0x3ff) << 10) | (key.charCodeAt(++i) & 0x3ff));
		bytes[index++] = (0xf0 | (code >> 18));
		bytes[index++] = (0x80 | ((code >> 12) & 0x3f));
		bytes[index++] = (0x80 | ((code >> 6) & 0x3f));
		bytes[index++] = (0x80 | (code & 0x3f));
            }
	}
	key = bytes;
    } else {
	if (type === 'object') {
            if (key === null) {
		throw new Error(ERROR);
            } else if (ARRAY_BUFFER && key.constructor === ArrayBuffer) {
		key = new Uint8Array(key);
            } else if (!Array.isArray(key)) {
		if (!ARRAY_BUFFER || !ArrayBuffer.isView(key)) {
		    throw new Error(ERROR);
		}
            }
	} else {
            throw new Error(ERROR);
	}
    }

    if (key.length > 64) {
	key = (new Sha256(is224, true)).update(key).array();
    }

    var oKeyPad = [], iKeyPad = [];
    for (i = 0; i < 64; ++i) {
	var b = key[i] || 0;
	oKeyPad[i] = 0x5c ^ b;
	iKeyPad[i] = 0x36 ^ b;
    }

    Sha256.call(this, is224, sharedMemory);

    this.update(iKeyPad);
    this.oKeyPad = oKeyPad;
    this.inner = true;
    this.sharedMemory = sharedMemory;
}
HmacSha256.prototype = new Sha256();

HmacSha256.prototype.finalize = function () {
    Sha256.prototype.finalize.call(this);
    if (this.inner) {
	this.inner = false;
	var innerHash = this.array();
	Sha256.call(this, this.is224, this.sharedMemory);
	this.update(this.oKeyPad);
	this.update(innerHash);
	Sha256.prototype.finalize.call(this);
    }
};

var exports = createMethod();
exports.sha256 = exports;
exports.sha224 = createMethod(true);
exports.sha256.hmac = createHmacMethod();
exports.sha224.hmac = createHmacMethod(true);

if (COMMON_JS) {
    module.exports = exports;
} else {
    root.sha256 = exports.sha256;
    root.sha224 = exports.sha224;
    if (AMD) {
	define(function () {
            return exports;
	});
    }
}

const sha256 = fake_window.sha256;

/*
 * EXPORTS_START
 * EXPORT sha256
 * EXPORTS_END
 */
generated by cgit
rtNotEqual(self.Map(), 1) def test_map_gc_1(self): A = HashKey(100, 'A') h = self.Map() h = h.set(0, 0) # empty Map node is memoized in _map.c ref = weakref.ref(h) a = [] a.append(a) a.append(h) b = [] a.append(b) b.append(a) h = h.set(A, b) del h, a, b gc.collect() gc.collect() gc.collect() self.assertIsNone(ref()) def test_map_gc_2(self): A = HashKey(100, 'A') h = self.Map() h = h.set(A, 'a') h = h.set(A, h) ref = weakref.ref(h) hi = iter(h.items()) next(hi) del h, hi gc.collect() gc.collect() gc.collect() self.assertIsNone(ref()) def test_map_in_1(self): A = HashKey(100, 'A') AA = HashKey(100, 'A') B = HashKey(101, 'B') h = self.Map() h = h.set(A, 1) self.assertTrue(A in h) self.assertFalse(B in h) with self.assertRaises(EqError): with HashKeyCrasher(error_on_eq=True): AA in h with self.assertRaises(HashingError): with HashKeyCrasher(error_on_hash=True): AA in h def test_map_getitem_1(self): A = HashKey(100, 'A') AA = HashKey(100, 'A') B = HashKey(101, 'B') h = self.Map() h = h.set(A, 1) self.assertEqual(h[A], 1) self.assertEqual(h[AA], 1) with self.assertRaises(KeyError): h[B] with self.assertRaises(EqError): with HashKeyCrasher(error_on_eq=True): h[AA] with self.assertRaises(HashingError): with HashKeyCrasher(error_on_hash=True): h[AA] def test_repr_1(self): h = self.Map() self.assertEqual(repr(h), 'immutables.Map({})') h = h.set(1, 2).set(2, 3).set(3, 4) self.assertEqual(repr(h), 'immutables.Map({1: 2, 2: 3, 3: 4})') def test_repr_2(self): h = self.Map() A = HashKey(100, 'A') with self.assertRaises(ReprError): with HashKeyCrasher(error_on_repr=True): repr(h.set(1, 2).set(A, 3).set(3, 4)) with self.assertRaises(ReprError): with HashKeyCrasher(error_on_repr=True): repr(h.set(1, 2).set(2, A).set(3, 4)) def test_repr_3(self): class Key: def __init__(self): self.val = None def __hash__(self): return 123 def __repr__(self): return repr(self.val) h = self.Map() k = Key() h = h.set(k, 1) k.val = h self.assertEqual(repr(h), 'immutables.Map({{...}: 1})') def test_hash_1(self): h = self.Map() self.assertNotEqual(hash(h), -1) self.assertEqual(hash(h), hash(h)) h = h.set(1, 2).set('a', 'b') self.assertNotEqual(hash(h), -1) self.assertEqual(hash(h), hash(h)) self.assertEqual( hash(h.set(1, 2).set('a', 'b')), hash(h.set('a', 'b').set(1, 2))) def test_hash_2(self): h = self.Map() A = HashKey(100, 'A') m = h.set(1, 2).set(A, 3).set(3, 4) with self.assertRaises(HashingError): with HashKeyCrasher(error_on_hash=True): hash(m) m = h.set(1, 2).set(2, A).set(3, 4) with self.assertRaises(HashingError): with HashKeyCrasher(error_on_hash=True): hash(m) def test_abc_1(self): self.assertTrue(issubclass(self.Map, collections.abc.Mapping)) def test_map_mut_1(self): h = self.Map() h = h.set('a', 1) hm1 = h.mutate() hm2 = h.mutate() self.assertFalse(isinstance(hm1, self.Map)) self.assertIsNot(hm1, hm2) self.assertEqual(hm1['a'], 1) self.assertEqual(hm2['a'], 1) hm1.set('b', 2) hm1.set('c', 3) hm2.set('x', 100) hm2.set('a', 1000) self.assertEqual(hm1['a'], 1) self.assertEqual(hm1.get('x', -1), -1) self.assertEqual(hm2['a'], 1000) self.assertTrue('x' in hm2) h1 = hm1.finish() h2 = hm2.finish() self.assertTrue(isinstance(h1, self.Map)) self.assertEqual(dict(h.items()), {'a': 1}) self.assertEqual(dict(h1.items()), {'a': 1, 'b': 2, 'c': 3}) self.assertEqual(dict(h2.items()), {'a': 1000, 'x': 100}) def test_map_mut_2(self): h = self.Map() h = h.set('a', 1) hm1 = h.mutate() hm1.set('a', 2) hm1.set('a', 3) hm1.set('a', 4) h2 = hm1.finish() self.assertEqual(dict(h.items()), {'a': 1}) self.assertEqual(dict(h2.items()), {'a': 4}) def test_map_mut_3(self): h = self.Map() h = h.set('a', 1) hm1 = h.mutate() self.assertEqual(repr(hm1), "immutables.MapMutation({'a': 1})") with self.assertRaisesRegex(TypeError, 'unhashable type'): hash(hm1) def test_map_mut_4(self): h = self.Map() h = h.set('a', 1) h = h.set('b', 2) hm1 = h.mutate() hm2 = h.mutate() self.assertEqual(hm1, hm2) hm1.set('a', 10) self.assertNotEqual(hm1, hm2) hm2.set('a', 10) self.assertEqual(hm1, hm2) self.assertEqual(hm2.pop('a'), 10) self.assertNotEqual(hm1, hm2) def test_map_mut_5(self): h = self.Map({'a': 1, 'b': 2}, z=100) self.assertTrue(isinstance(h, self.Map)) self.assertEqual(dict(h.items()), {'a': 1, 'b': 2, 'z': 100}) h2 = h.update(z=200, y=-1) self.assertEqual(dict(h.items()), {'a': 1, 'b': 2, 'z': 100}) self.assertEqual(dict(h2.items()), {'a': 1, 'b': 2, 'z': 200, 'y': -1}) h3 = h2.update([(1, 2), (3, 4)]) self.assertEqual(dict(h.items()), {'a': 1, 'b': 2, 'z': 100}) self.assertEqual(dict(h2.items()), {'a': 1, 'b': 2, 'z': 200, 'y': -1}) self.assertEqual(dict(h3.items()), {'a': 1, 'b': 2, 'z': 200, 'y': -1, 1: 2, 3: 4}) h4 = h3.update() self.assertIs(h4, h3) h5 = h4.update(self.Map({'zzz': 'yyz'})) self.assertEqual(dict(h5.items()), {'a': 1, 'b': 2, 'z': 200, 'y': -1, 1: 2, 3: 4, 'zzz': 'yyz'}) def test_map_mut_6(self): h = self.Map({'a': 1, 'b': 2}, z=100) self.assertEqual(dict(h.items()), {'a': 1, 'b': 2, 'z': 100}) with self.assertRaisesRegex(TypeError, 'not iterable'): h.update(1) with self.assertRaisesRegex(ValueError, 'map update sequence element'): h.update([(1, 2), (3, 4, 5)]) with self.assertRaisesRegex(TypeError, 'cannot convert map update'): h.update([(1, 2), 1]) self.assertEqual(dict(h.items()), {'a': 1, 'b': 2, 'z': 100}) def test_map_mut_7(self): key = HashKey(123, 'aaa') h = self.Map({'a': 1, 'b': 2}, z=100) self.assertEqual(dict(h.items()), {'a': 1, 'b': 2, 'z': 100}) upd = {key: 1} with HashKeyCrasher(error_on_hash=True): with self.assertRaises(HashingError): h.update(upd) upd = self.Map({key: 'zzz'}) with HashKeyCrasher(error_on_hash=True): with self.assertRaises(HashingError): h.update(upd) upd = [(1, 2), (key, 'zzz')] with HashKeyCrasher(error_on_hash=True): with self.assertRaises(HashingError): h.update(upd) self.assertEqual(dict(h.items()), {'a': 1, 'b': 2, 'z': 100}) def test_map_mut_8(self): key1 = HashKey(123, 'aaa') key2 = HashKey(123, 'bbb') h = self.Map({key1: 123}) self.assertEqual(dict(h.items()), {key1: 123}) upd = {key2: 1} with HashKeyCrasher(error_on_eq=True): with self.assertRaises(EqError): h.update(upd) upd = self.Map({key2: 'zzz'}) with HashKeyCrasher(error_on_eq=True): with self.assertRaises(EqError): h.update(upd) upd = [(1, 2), (key2, 'zzz')] with HashKeyCrasher(error_on_eq=True): with self.assertRaises(EqError): h.update(upd) self.assertEqual(dict(h.items()), {key1: 123}) def test_map_mut_9(self): key1 = HashKey(123, 'aaa') src = {key1: 123} with HashKeyCrasher(error_on_hash=True): with self.assertRaises(HashingError): self.Map(src) src = [(1, 2), (key1, 123)] with HashKeyCrasher(error_on_hash=True): with self.assertRaises(HashingError): self.Map(src) def test_map_mut_10(self): key1 = HashKey(123, 'aaa') m = self.Map({key1: 123}) mm = m.mutate() with HashKeyCrasher(error_on_hash=True): with self.assertRaises(HashingError): del mm[key1] mm = m.mutate() with HashKeyCrasher(error_on_hash=True): with self.assertRaises(HashingError): mm.pop(key1, None) mm = m.mutate() with HashKeyCrasher(error_on_hash=True): with self.assertRaises(HashingError): mm.set(key1, 123) def test_map_mut_11(self): m = self.Map({'a': 1, 'b': 2}) mm = m.mutate() self.assertEqual(mm.pop('a', 1), 1) self.assertEqual(mm.finish(), self.Map({'b': 2})) mm = m.mutate() self.assertEqual(mm.pop('b', 1), 2) self.assertEqual(mm.finish(), self.Map({'a': 1})) mm = m.mutate() self.assertEqual(mm.pop('b', 1), 2) del mm['a'] self.assertEqual(mm.finish(), self.Map()) def test_map_mut_12(self): m = self.Map({'a': 1, 'b': 2}) mm = m.mutate() mm.finish() with self.assertRaisesRegex(ValueError, 'has been finished'): mm.pop('a') with self.assertRaisesRegex(ValueError, 'has been finished'): del mm['a'] with self.assertRaisesRegex(ValueError, 'has been finished'): mm.set('a', 'b') with self.assertRaisesRegex(ValueError, 'has been finished'): mm['a'] = 'b' with self.assertRaisesRegex(ValueError, 'has been finished'): mm.update(a='b') def test_map_mut_13(self): key1 = HashKey(123, 'aaa') key2 = HashKey(123, 'aaa') m = self.Map({key1: 123}) mm = m.mutate() with HashKeyCrasher(error_on_eq=True): with self.assertRaises(EqError): del mm[key2] mm = m.mutate() with HashKeyCrasher(error_on_eq=True): with self.assertRaises(EqError): mm.pop(key2, None) mm = m.mutate() with HashKeyCrasher(error_on_eq=True): with self.assertRaises(EqError): mm.set(key2, 123) def test_map_mut_14(self): m = self.Map(a=1, b=2) with m.mutate() as mm: mm['z'] = 100 del mm['a'] self.assertEqual(mm.finish(), self.Map(z=100, b=2)) def test_map_mut_15(self): m = self.Map(a=1, b=2) with self.assertRaises(ZeroDivisionError): with m.mutate() as mm: mm['z'] = 100 del mm['a'] 1 / 0 self.assertEqual(mm.finish(), self.Map(z=100, b=2)) self.assertEqual(m, self.Map(a=1, b=2)) def test_map_mut_16(self): m = self.Map(a=1, b=2) hash(m) m2 = self.Map(m) m3 = self.Map(m, c=3) self.assertEqual(m, m2) self.assertEqual(len(m), len(m2)) self.assertEqual(hash(m), hash(m2)) self.assertIsNot(m, m2) self.assertEqual(m3, self.Map(a=1, b=2, c=3)) def test_map_mut_17(self): m = self.Map(a=1) with m.mutate() as mm: with self.assertRaisesRegex( TypeError, 'cannot create Maps from MapMutations'): self.Map(mm) def test_map_mut_18(self): m = self.Map(a=1, b=2) with m.mutate() as mm: mm.update(self.Map(x=1), z=2) mm.update(c=3) mm.update({'n': 100, 'a': 20}) m2 = mm.finish() expected = self.Map( {'b': 2, 'c': 3, 'n': 100, 'z': 2, 'x': 1, 'a': 20}) self.assertEqual(len(m2), 6) self.assertEqual(m2, expected) self.assertEqual(m, self.Map(a=1, b=2)) def test_map_mut_19(self): m = self.Map(a=1, b=2) m2 = m.update({'a': 20}) self.assertEqual(len(m2), 2) def test_map_mut_20(self): # Issue 24: h = self.Map() for i in range(19): # Create more than 16 keys to trigger the root bitmap # node to be converted into an array node h = h.set(HashKey(i, i), i) h = h.set(HashKey(18, '18-collision'), 18) with h.mutate() as m: del m[HashKey(18, 18)] del m[HashKey(18, '18-collision')] # The pre-issue-24 code failed to update the number of array # node element, so at this point it would be greater than it # actually is. h = m.finish() # Any of the below operations shouldn't crash the debug build. with h.mutate() as m: for i in range(18): del m[HashKey(i, i)] h = m.finish() h = h.set(HashKey(21, 21), 21) h = h.set(HashKey(22, 22), 22) def test_map_mut_21(self): # Issue 24: # Array nodes, while in mutation, failed to increment the # internal count of elements when adding a new key to it. # Because the internal count h = self.Map() for i in range(18): # Create more than 16 keys to trigger the root bitmap # node to be converted into an array node h = h.set(HashKey(i, i), i) with h.mutate() as m: # Add one new key to the array node m[HashKey(18, 18)] = 18 # Add another key -- after this the old code failed # to increment the number of elements in the mutated # array node. m[HashKey(19, 19)] = 19 h = m.finish() for i in range(20): # Start deleting keys one by one. Because array node # element count was accounted incorrectly (smaller by 1 # than it actually is, the mutation for "del h[18]" would # create an empty array node, clipping the "19" key). # Before the issue #24 fix, the below line would crash # on i=19. h = h.delete(HashKey(i, i)) def test_map_mut_stress(self): COLLECTION_SIZE = 7000 TEST_ITERS_EVERY = 647 RUN_XTIMES = 3 for _ in range(RUN_XTIMES): h = self.Map() d = dict() for i in range(COLLECTION_SIZE // TEST_ITERS_EVERY): hm = h.mutate() for j in range(TEST_ITERS_EVERY): key = random.randint(1, 100000) key = HashKey(key % 271, str(key)) hm.set(key, key) d[key] = key self.assertEqual(len(hm), len(d)) h2 = hm.finish() self.assertEqual(dict(h2.items()), d) h = h2 self.assertEqual(dict(h.items()), d) self.assertEqual(len(h), len(d)) it = iter(tuple(d.keys())) for i in range(COLLECTION_SIZE // TEST_ITERS_EVERY): hm = h.mutate() for j in range(TEST_ITERS_EVERY): try: key = next(it) except StopIteration: break del d[key] del hm[key] self.assertEqual(len(hm), len(d)) h2 = hm.finish() self.assertEqual(dict(h2.items()), d) h = h2 self.assertEqual(dict(h.items()), d) self.assertEqual(len(h), len(d)) def test_map_pickle(self): h = self.Map(a=1, b=2) for proto in range(pickle.HIGHEST_PROTOCOL): p = pickle.dumps(h, proto) uh = pickle.loads(p) self.assertTrue(isinstance(uh, self.Map)) self.assertEqual(h, uh) with self.assertRaisesRegex(TypeError, "can('t|not) pickle"): pickle.dumps(h.mutate()) @unittest.skipIf( sys.version_info < (3, 7, 0), "__class_getitem__ is not available" ) def test_map_is_subscriptable(self): self.assertIs(self.Map[int, str], self.Map) def test_kwarg_named_col(self): self.assertEqual(dict(self.Map(col=0)), {"col": 0}) self.assertEqual(dict(self.Map(a=0, col=1)), {"a": 0, "col": 1}) self.assertEqual(dict(self.Map({"a": 0}, col=1)), {"a": 0, "col": 1}) class PyMapTest(BaseMapTest, unittest.TestCase): Map = PyMap try: from immutables._map import Map as CMap except ImportError: CMap = None @unittest.skipIf(CMap is None, 'C Map is not available') class CMapTest(BaseMapTest, unittest.TestCase): Map = CMap if __name__ == "__main__": unittest.main()