@extra-array/subsequences.min
Version:
Lists all possible subsequences.
1 lines • 985 B
JavaScript
!function(e){if("object"==typeof exports&&"undefined"!=typeof module)module.exports=e();else if("function"==typeof define&&define.amd)define([],e);else{("undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof self?self:this).array_subsequences=e()}}(function(){return function(){return function e(n,r,o){function t(i,u){if(!r[i]){if(!n[i]){var d="function"==typeof require&&require;if(!u&&d)return d(i,!0);if(f)return f(i,!0);var l=new Error("Cannot find module '"+i+"'");throw l.code="MODULE_NOT_FOUND",l}var s=r[i]={exports:{}};n[i][0].call(s.exports,function(e){return t(n[i][1][e]||e)},s,s.exports,e,n,r,o)}return r[i].exports}for(var f="function"==typeof require&&require,i=0;i<o.length;i++)t(o[i]);return t}}()({1:[function(e,n,r){"use strict";n.exports=function*e(n,r=-1){var o=n.length;if(r>=o)r===o&&(yield n);else if(0!==r&&0!==o){var t=n.slice(0,-1);for(var f of(yield*e(t,r),e(t,r-1)))f.push(n[o-1]),yield f}else yield[]}},{}]},{},[1])(1)});