01f4bf9f9a7a206873df7780ebf25a7c45fffbaf931724e086fae6281bbcec620089fdf83885cb809369f2783045eca29035d7e8f1b83109a4199b98f87f07 3.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158
  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 _RandomIterator = require("./Base/RandomIterator");
  8. function _interopRequireDefault(t) {
  9. return t && t.t ? t : {
  10. default: t
  11. };
  12. }
  13. class VectorIterator extends _RandomIterator.RandomIterator {
  14. constructor(t, r, e) {
  15. super(t, e);
  16. this.container = r;
  17. }
  18. copy() {
  19. return new VectorIterator(this.o, this.container, this.iteratorType);
  20. }
  21. }
  22. class Vector extends _Base.default {
  23. constructor(t = [], r = true) {
  24. super();
  25. if (Array.isArray(t)) {
  26. this.J = r ? [ ...t ] : t;
  27. this.i = t.length;
  28. } else {
  29. this.J = [];
  30. const r = this;
  31. t.forEach((function(t) {
  32. r.pushBack(t);
  33. }));
  34. }
  35. }
  36. clear() {
  37. this.i = 0;
  38. this.J.length = 0;
  39. }
  40. begin() {
  41. return new VectorIterator(0, this);
  42. }
  43. end() {
  44. return new VectorIterator(this.i, this);
  45. }
  46. rBegin() {
  47. return new VectorIterator(this.i - 1, this, 1);
  48. }
  49. rEnd() {
  50. return new VectorIterator(-1, this, 1);
  51. }
  52. front() {
  53. return this.J[0];
  54. }
  55. back() {
  56. return this.J[this.i - 1];
  57. }
  58. getElementByPos(t) {
  59. if (t < 0 || t > this.i - 1) {
  60. throw new RangeError;
  61. }
  62. return this.J[t];
  63. }
  64. eraseElementByPos(t) {
  65. if (t < 0 || t > this.i - 1) {
  66. throw new RangeError;
  67. }
  68. this.J.splice(t, 1);
  69. this.i -= 1;
  70. return this.i;
  71. }
  72. eraseElementByValue(t) {
  73. let r = 0;
  74. for (let e = 0; e < this.i; ++e) {
  75. if (this.J[e] !== t) {
  76. this.J[r++] = this.J[e];
  77. }
  78. }
  79. this.i = this.J.length = r;
  80. return this.i;
  81. }
  82. eraseElementByIterator(t) {
  83. const r = t.o;
  84. t = t.next();
  85. this.eraseElementByPos(r);
  86. return t;
  87. }
  88. pushBack(t) {
  89. this.J.push(t);
  90. this.i += 1;
  91. return this.i;
  92. }
  93. popBack() {
  94. if (this.i === 0) return;
  95. this.i -= 1;
  96. return this.J.pop();
  97. }
  98. setElementByPos(t, r) {
  99. if (t < 0 || t > this.i - 1) {
  100. throw new RangeError;
  101. }
  102. this.J[t] = r;
  103. }
  104. insert(t, r, e = 1) {
  105. if (t < 0 || t > this.i) {
  106. throw new RangeError;
  107. }
  108. this.J.splice(t, 0, ...new Array(e).fill(r));
  109. this.i += e;
  110. return this.i;
  111. }
  112. find(t) {
  113. for (let r = 0; r < this.i; ++r) {
  114. if (this.J[r] === t) {
  115. return new VectorIterator(r, this);
  116. }
  117. }
  118. return this.end();
  119. }
  120. reverse() {
  121. this.J.reverse();
  122. }
  123. unique() {
  124. let t = 1;
  125. for (let r = 1; r < this.i; ++r) {
  126. if (this.J[r] !== this.J[r - 1]) {
  127. this.J[t++] = this.J[r];
  128. }
  129. }
  130. this.i = this.J.length = t;
  131. return this.i;
  132. }
  133. sort(t) {
  134. this.J.sort(t);
  135. }
  136. forEach(t) {
  137. for (let r = 0; r < this.i; ++r) {
  138. t(this.J[r], r, this);
  139. }
  140. }
  141. [Symbol.iterator]() {
  142. return function*() {
  143. yield* this.J;
  144. }.bind(this)();
  145. }
  146. }
  147. var _default = Vector;
  148. exports.default = _default;
  149. //# sourceMappingURL=Vector.js.map