iter-tools
Version:
The iterable toolbox
144 lines (112 loc) • 4.88 kB
JavaScript
var _regeneratorRuntime = require("@babel/runtime/regenerator");
var _marked = /*#__PURE__*/_regeneratorRuntime.mark(__windowAhead);
function _createForOfIteratorHelper(o, allowArrayLike) { var it; if (typeof Symbol === "undefined" || o[Symbol.iterator] == null) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = o[Symbol.iterator](); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it["return"] != null) it["return"](); } finally { if (didErr) throw err; } } }; }
function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
var _require = require('../../internal/iterable.js'),
iterableCurry = _require.iterableCurry;
var _require2 = require('../../internal/circular-buffer.js'),
CircularBuffer = _require2.CircularBuffer,
ReadOnlyCircularBuffer = _require2.ReadOnlyCircularBuffer;
function __windowAhead(source, size) {
var _ref,
_ref$filler,
filler,
_ref$useFiller,
useFiller,
buffer,
bufferReadProxy,
len,
_iterator,
_step,
value,
i,
_i,
_args = arguments;
return _regeneratorRuntime.wrap(function __windowAhead$(_context) {
while (1) {
switch (_context.prev = _context.next) {
case 0:
_ref = _args.length > 2 && _args[2] !== undefined ? _args[2] : {}, _ref$filler = _ref.filler, filler = _ref$filler === void 0 ? undefined : _ref$filler, _ref$useFiller = _ref.useFiller, useFiller = _ref$useFiller === void 0 ? true : _ref$useFiller;
buffer = new CircularBuffer(size);
bufferReadProxy = new ReadOnlyCircularBuffer(buffer);
len = 0;
_iterator = _createForOfIteratorHelper(source);
_context.prev = 5;
_iterator.s();
case 7:
if ((_step = _iterator.n()).done) {
_context.next = 16;
break;
}
value = _step.value;
buffer.push(value);
if (!buffer.isFull()) {
_context.next = 13;
break;
}
_context.next = 13;
return bufferReadProxy;
case 13:
len++;
case 14:
_context.next = 7;
break;
case 16:
_context.next = 21;
break;
case 18:
_context.prev = 18;
_context.t0 = _context["catch"](5);
_iterator.e(_context.t0);
case 21:
_context.prev = 21;
_iterator.f();
return _context.finish(21);
case 24:
if (useFiller) {
for (i = len; i < size; i++) {
buffer.push(filler);
}
}
if (!(len > 0 && len < size)) {
_context.next = 28;
break;
}
_context.next = 28;
return bufferReadProxy;
case 28:
_i = 0;
case 29:
if (!(_i < Math.min(size, len) - 1)) {
_context.next = 37;
break;
}
buffer.shift();
if (useFiller) {
buffer.push(filler);
}
_context.next = 34;
return bufferReadProxy;
case 34:
_i++;
_context.next = 29;
break;
case 37:
case "end":
return _context.stop();
}
}
}, _marked, null, [[5, 18, 21, 24]]);
}
exports.__windowAhead = __windowAhead;
var windowAhead = /*#__PURE__*/iterableCurry(__windowAhead, {
minArgs: 1,
maxArgs: 2,
validateArgs: function validateArgs(args) {
if (typeof args[1] !== 'number') {
throw new Error('windowAhead'.concat(" must be passed a numeric size"));
}
}
});
exports.windowAhead = windowAhead;