HashSet.js 4.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149
  1. "use strict";
  2. Object.defineProperty(exports, "t", {
  3. value: true
  4. });
  5. exports.default = void 0;
  6. var _Base = _interopRequireDefault(require("./Base"));
  7. var _Vector = _interopRequireDefault(require("../SequentialContainer/Vector"));
  8. var _OrderedSet = _interopRequireDefault(require("../TreeContainer/OrderedSet"));
  9. function _interopRequireDefault(e) {
  10. return e && e.t ? e : {
  11. default: e
  12. };
  13. }
  14. class HashSet extends _Base.default {
  15. constructor(e = [], t, s) {
  16. super(t, s);
  17. this.i = [];
  18. e.forEach((e => this.insert(e)));
  19. }
  20. h() {
  21. if (this.u >= 1073741824) return;
  22. const e = [];
  23. const t = this.u;
  24. this.u <<= 1;
  25. const s = Object.keys(this.i);
  26. const i = s.length;
  27. for (let r = 0; r < i; ++r) {
  28. const i = parseInt(s[r]);
  29. const n = this.i[i];
  30. const o = n.size();
  31. if (o === 0) continue;
  32. if (o === 1) {
  33. const t = n.front();
  34. e[this.l(t) & this.u - 1] = new _Vector.default([ t ], false);
  35. continue;
  36. }
  37. const c = [];
  38. const f = [];
  39. n.forEach((e => {
  40. const s = this.l(e);
  41. if ((s & t) === 0) {
  42. c.push(e);
  43. } else f.push(e);
  44. }));
  45. if (n instanceof _OrderedSet.default) {
  46. if (c.length > 6) {
  47. e[i] = new _OrderedSet.default(c);
  48. } else {
  49. e[i] = new _Vector.default(c, false);
  50. }
  51. if (f.length > 6) {
  52. e[i + t] = new _OrderedSet.default(f);
  53. } else {
  54. e[i + t] = new _Vector.default(f, false);
  55. }
  56. } else {
  57. e[i] = new _Vector.default(c, false);
  58. e[i + t] = new _Vector.default(f, false);
  59. }
  60. }
  61. this.i = e;
  62. }
  63. forEach(e) {
  64. const t = Object.values(this.i);
  65. const s = t.length;
  66. let i = 0;
  67. for (let r = 0; r < s; ++r) {
  68. t[r].forEach((t => e(t, i++)));
  69. }
  70. }
  71. insert(e) {
  72. const t = this.l(e) & this.u - 1;
  73. const s = this.i[t];
  74. if (!s) {
  75. this.i[t] = new _Vector.default([ e ], false);
  76. this.o += 1;
  77. } else {
  78. const i = s.size();
  79. if (s instanceof _Vector.default) {
  80. if (!s.find(e).equals(s.end())) return;
  81. s.pushBack(e);
  82. if (i + 1 >= 8) {
  83. if (this.u <= 64) {
  84. this.o += 1;
  85. this.h();
  86. return;
  87. }
  88. this.i[t] = new _OrderedSet.default(s);
  89. }
  90. this.o += 1;
  91. } else {
  92. s.insert(e);
  93. const t = s.size();
  94. this.o += t - i;
  95. }
  96. }
  97. if (this.o > this.u * .75) {
  98. this.h();
  99. }
  100. }
  101. eraseElementByKey(e) {
  102. const t = this.l(e) & this.u - 1;
  103. const s = this.i[t];
  104. if (!s) return;
  105. const i = s.size();
  106. if (i === 0) return;
  107. if (s instanceof _Vector.default) {
  108. s.eraseElementByValue(e);
  109. const t = s.size();
  110. this.o += t - i;
  111. } else {
  112. s.eraseElementByKey(e);
  113. const r = s.size();
  114. this.o += r - i;
  115. if (r <= 6) {
  116. this.i[t] = new _Vector.default(s);
  117. }
  118. }
  119. }
  120. find(e) {
  121. const t = this.l(e) & this.u - 1;
  122. const s = this.i[t];
  123. if (!s) return false;
  124. return !s.find(e).equals(s.end());
  125. }
  126. [Symbol.iterator]() {
  127. return function*() {
  128. const e = Object.values(this.i);
  129. const t = e.length;
  130. for (let s = 0; s < t; ++s) {
  131. const t = e[s];
  132. for (const e of t) {
  133. yield e;
  134. }
  135. }
  136. }.bind(this)();
  137. }
  138. }
  139. var _default = HashSet;
  140. exports.default = _default;