HashMap.js 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410
  1. var __extends = this && this.t || function() {
  2. var extendStatics = function(r, e) {
  3. extendStatics = Object.setPrototypeOf || {
  4. __proto__: []
  5. } instanceof Array && function(r, e) {
  6. r.__proto__ = e;
  7. } || function(r, e) {
  8. for (var t in e) if (Object.prototype.hasOwnProperty.call(e, t)) r[t] = e[t];
  9. };
  10. return extendStatics(r, e);
  11. };
  12. return function(r, e) {
  13. if (typeof e !== "function" && e !== null) throw new TypeError("Class extends value " + String(e) + " is not a constructor or null");
  14. extendStatics(r, e);
  15. function __() {
  16. this.constructor = r;
  17. }
  18. r.prototype = e === null ? Object.create(e) : (__.prototype = e.prototype, new __);
  19. };
  20. }();
  21. var __generator = this && this.i || function(r, e) {
  22. var t = {
  23. label: 0,
  24. sent: function() {
  25. if (a[0] & 1) throw a[1];
  26. return a[1];
  27. },
  28. trys: [],
  29. ops: []
  30. }, n, i, a, f;
  31. return f = {
  32. next: verb(0),
  33. throw: verb(1),
  34. return: verb(2)
  35. }, typeof Symbol === "function" && (f[Symbol.iterator] = function() {
  36. return this;
  37. }), f;
  38. function verb(r) {
  39. return function(e) {
  40. return step([ r, e ]);
  41. };
  42. }
  43. function step(f) {
  44. if (n) throw new TypeError("Generator is already executing.");
  45. while (t) try {
  46. if (n = 1, i && (a = f[0] & 2 ? i["return"] : f[0] ? i["throw"] || ((a = i["return"]) && a.call(i),
  47. 0) : i.next) && !(a = a.call(i, f[1])).done) return a;
  48. if (i = 0, a) f = [ f[0] & 2, a.value ];
  49. switch (f[0]) {
  50. case 0:
  51. case 1:
  52. a = f;
  53. break;
  54. case 4:
  55. t.label++;
  56. return {
  57. value: f[1],
  58. done: false
  59. };
  60. case 5:
  61. t.label++;
  62. i = f[1];
  63. f = [ 0 ];
  64. continue;
  65. case 7:
  66. f = t.ops.pop();
  67. t.trys.pop();
  68. continue;
  69. default:
  70. if (!(a = t.trys, a = a.length > 0 && a[a.length - 1]) && (f[0] === 6 || f[0] === 2)) {
  71. t = 0;
  72. continue;
  73. }
  74. if (f[0] === 3 && (!a || f[1] > a[0] && f[1] < a[3])) {
  75. t.label = f[1];
  76. break;
  77. }
  78. if (f[0] === 6 && t.label < a[1]) {
  79. t.label = a[1];
  80. a = f;
  81. break;
  82. }
  83. if (a && t.label < a[2]) {
  84. t.label = a[2];
  85. t.ops.push(f);
  86. break;
  87. }
  88. if (a[2]) t.ops.pop();
  89. t.trys.pop();
  90. continue;
  91. }
  92. f = e.call(r, t);
  93. } catch (r) {
  94. f = [ 6, r ];
  95. i = 0;
  96. } finally {
  97. n = a = 0;
  98. }
  99. if (f[0] & 5) throw f[1];
  100. return {
  101. value: f[0] ? f[1] : void 0,
  102. done: true
  103. };
  104. }
  105. };
  106. var __values = this && this.u || function(r) {
  107. var e = typeof Symbol === "function" && Symbol.iterator, t = e && r[e], n = 0;
  108. if (t) return t.call(r);
  109. if (r && typeof r.length === "number") return {
  110. next: function() {
  111. if (r && n >= r.length) r = void 0;
  112. return {
  113. value: r && r[n++],
  114. done: !r
  115. };
  116. }
  117. };
  118. throw new TypeError(e ? "Object is not iterable." : "Symbol.iterator is not defined.");
  119. };
  120. import HashContainer from "./Base";
  121. import Vector from "../SequentialContainer/Vector";
  122. import OrderedMap from "../TreeContainer/OrderedMap";
  123. var HashMap = function(r) {
  124. __extends(HashMap, r);
  125. function HashMap(e, t, n) {
  126. if (e === void 0) {
  127. e = [];
  128. }
  129. var i = r.call(this, t, n) || this;
  130. i.h = [];
  131. e.forEach((function(r) {
  132. return i.setElement(r[0], r[1]);
  133. }));
  134. return i;
  135. }
  136. HashMap.prototype.v = function() {
  137. var r = this;
  138. if (this.l >= 1073741824) return;
  139. var e = [];
  140. var t = this.l;
  141. this.l <<= 1;
  142. var n = Object.keys(this.h);
  143. var i = n.length;
  144. var _loop_1 = function(i) {
  145. var f = parseInt(n[i]);
  146. var s = a.h[f];
  147. var o = s.size();
  148. if (o === 0) return "continue";
  149. if (o === 1) {
  150. var u = s.front();
  151. e[a.p(u[0]) & a.l - 1] = new Vector([ u ], false);
  152. return "continue";
  153. }
  154. var c = [];
  155. var h = [];
  156. s.forEach((function(e) {
  157. var n = r.p(e[0]);
  158. if ((n & t) === 0) {
  159. c.push(e);
  160. } else h.push(e);
  161. }));
  162. if (s instanceof OrderedMap) {
  163. if (c.length > 6) {
  164. e[f] = new OrderedMap(c);
  165. } else {
  166. e[f] = new Vector(c, false);
  167. }
  168. if (h.length > 6) {
  169. e[f + t] = new OrderedMap(h);
  170. } else {
  171. e[f + t] = new Vector(h, false);
  172. }
  173. } else {
  174. e[f] = new Vector(c, false);
  175. e[f + t] = new Vector(h, false);
  176. }
  177. };
  178. var a = this;
  179. for (var f = 0; f < i; ++f) {
  180. _loop_1(f);
  181. }
  182. this.h = e;
  183. };
  184. HashMap.prototype.forEach = function(r) {
  185. var e = Object.values(this.h);
  186. var t = e.length;
  187. var n = 0;
  188. for (var i = 0; i < t; ++i) {
  189. e[i].forEach((function(e) {
  190. return r(e, n++);
  191. }));
  192. }
  193. };
  194. HashMap.prototype.setElement = function(r, e) {
  195. var t, n;
  196. var i = this.p(r) & this.l - 1;
  197. var a = this.h[i];
  198. if (!a) {
  199. this.o += 1;
  200. this.h[i] = new Vector([ [ r, e ] ], false);
  201. } else {
  202. var f = a.size();
  203. if (a instanceof Vector) {
  204. try {
  205. for (var s = __values(a), o = s.next(); !o.done; o = s.next()) {
  206. var u = o.value;
  207. if (u[0] === r) {
  208. u[1] = e;
  209. return;
  210. }
  211. }
  212. } catch (r) {
  213. t = {
  214. error: r
  215. };
  216. } finally {
  217. try {
  218. if (o && !o.done && (n = s.return)) n.call(s);
  219. } finally {
  220. if (t) throw t.error;
  221. }
  222. }
  223. a.pushBack([ r, e ]);
  224. if (f + 1 >= 8) {
  225. if (this.l <= 64) {
  226. this.o += 1;
  227. this.v();
  228. return;
  229. }
  230. this.h[i] = new OrderedMap(this.h[i]);
  231. }
  232. this.o += 1;
  233. } else {
  234. a.setElement(r, e);
  235. var c = a.size();
  236. this.o += c - f;
  237. }
  238. }
  239. if (this.o > this.l * .75) {
  240. this.v();
  241. }
  242. };
  243. HashMap.prototype.getElementByKey = function(r) {
  244. var e, t;
  245. var n = this.p(r) & this.l - 1;
  246. var i = this.h[n];
  247. if (!i) return undefined;
  248. if (i instanceof OrderedMap) {
  249. return i.getElementByKey(r);
  250. } else {
  251. try {
  252. for (var a = __values(i), f = a.next(); !f.done; f = a.next()) {
  253. var s = f.value;
  254. if (s[0] === r) return s[1];
  255. }
  256. } catch (r) {
  257. e = {
  258. error: r
  259. };
  260. } finally {
  261. try {
  262. if (f && !f.done && (t = a.return)) t.call(a);
  263. } finally {
  264. if (e) throw e.error;
  265. }
  266. }
  267. return undefined;
  268. }
  269. };
  270. HashMap.prototype.eraseElementByKey = function(r) {
  271. var e, t;
  272. var n = this.p(r) & this.l - 1;
  273. var i = this.h[n];
  274. if (!i) return;
  275. if (i instanceof Vector) {
  276. var a = 0;
  277. try {
  278. for (var f = __values(i), s = f.next(); !s.done; s = f.next()) {
  279. var o = s.value;
  280. if (o[0] === r) {
  281. i.eraseElementByPos(a);
  282. this.o -= 1;
  283. return;
  284. }
  285. a += 1;
  286. }
  287. } catch (r) {
  288. e = {
  289. error: r
  290. };
  291. } finally {
  292. try {
  293. if (s && !s.done && (t = f.return)) t.call(f);
  294. } finally {
  295. if (e) throw e.error;
  296. }
  297. }
  298. } else {
  299. var u = i.size();
  300. i.eraseElementByKey(r);
  301. var c = i.size();
  302. this.o += c - u;
  303. if (c <= 6) {
  304. this.h[n] = new Vector(i);
  305. }
  306. }
  307. };
  308. HashMap.prototype.find = function(r) {
  309. var e, t;
  310. var n = this.p(r) & this.l - 1;
  311. var i = this.h[n];
  312. if (!i) return false;
  313. if (i instanceof OrderedMap) {
  314. return !i.find(r).equals(i.end());
  315. }
  316. try {
  317. for (var a = __values(i), f = a.next(); !f.done; f = a.next()) {
  318. var s = f.value;
  319. if (s[0] === r) return true;
  320. }
  321. } catch (r) {
  322. e = {
  323. error: r
  324. };
  325. } finally {
  326. try {
  327. if (f && !f.done && (t = a.return)) t.call(a);
  328. } finally {
  329. if (e) throw e.error;
  330. }
  331. }
  332. return false;
  333. };
  334. HashMap.prototype[Symbol.iterator] = function() {
  335. return function() {
  336. var r, e, t, n, i, a, f, s;
  337. var o, u;
  338. return __generator(this, (function(c) {
  339. switch (c.label) {
  340. case 0:
  341. r = Object.values(this.h);
  342. e = r.length;
  343. t = 0;
  344. c.label = 1;
  345. case 1:
  346. if (!(t < e)) return [ 3, 10 ];
  347. n = r[t];
  348. c.label = 2;
  349. case 2:
  350. c.trys.push([ 2, 7, 8, 9 ]);
  351. i = (o = void 0, __values(n)), a = i.next();
  352. c.label = 3;
  353. case 3:
  354. if (!!a.done) return [ 3, 6 ];
  355. f = a.value;
  356. return [ 4, f ];
  357. case 4:
  358. c.sent();
  359. c.label = 5;
  360. case 5:
  361. a = i.next();
  362. return [ 3, 3 ];
  363. case 6:
  364. return [ 3, 9 ];
  365. case 7:
  366. s = c.sent();
  367. o = {
  368. error: s
  369. };
  370. return [ 3, 9 ];
  371. case 8:
  372. try {
  373. if (a && !a.done && (u = i.return)) u.call(i);
  374. } finally {
  375. if (o) throw o.error;
  376. }
  377. return [ 7 ];
  378. case 9:
  379. ++t;
  380. return [ 3, 1 ];
  381. case 10:
  382. return [ 2 ];
  383. }
  384. }));
  385. }.bind(this)();
  386. };
  387. return HashMap;
  388. }(HashContainer);
  389. export default HashMap;