@trenskow/combinations 0.1.0

package/.vscode/launch.json

@@ -0,0 +1,15 @@
+{
+	// Use IntelliSense to learn about possible attributes.
+	// Hover to view descriptions of existing attributes.
+	// For more information, visit: https://go.microsoft.com/fwlink/?linkid=830387
+	"version": "0.2.0",
+	"configurations": [
+		{
+			"type":"node",
+			"request":"launch",
+			"name":"Run tests",
+			"runtimeExecutable":"_mocha",
+			"cwd":"${workspaceFolder}/test",
+			"args":["index.js"]}
+	]
+}

package/.vscode/settings.json

@@ -0,0 +1,6 @@
+{
+	"cSpell.words": [
+		"Kristian",
+		"trenskow"
+	]
+}

package/LICENSE

@@ -0,0 +1,9 @@
+Copyright 2026 Kristian Trenskow
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+
+2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS “AS IS” AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

package/README.md

@@ -0,0 +1,39 @@
+@trenskow/combinations
+----
+
+Small package that iterates an array and returns all ordering combinations.
+
+# Usage
+
+````javascript
+
+import combinations from '@trenskow/combinations';
+
+combinations([1, 2, 3])
+
+/*
+	-> [
+			[],
+			[ 1 ],
+			[ 1, 2 ],
+			[ 1, 2, 3 ],
+			[ 1, 3 ],
+			[ 1, 3, 2 ],
+			[ 2 ],
+			[ 2, 1 ],
+			[ 2, 1, 3 ],
+			[ 2, 3 ],
+			[ 2, 3, 1 ],
+			[ 3 ],
+			[ 3, 1 ],
+			[ 3, 1, 2 ],
+			[ 3, 2 ],
+			[ 3, 2, 1 ]
+		]
+*/
+
+````
+
+# License
+
+See license in LICENSE

package/eslint.config.js

@@ -0,0 +1,54 @@
+import globals from 'globals';
+import path from 'node:path';
+import { fileURLToPath } from 'node:url';
+import js from '@eslint/js';
+import { FlatCompat } from '@eslint/eslintrc';
+
+const __filename = fileURLToPath(import.meta.url);
+const __dirname = path.dirname(__filename);
+const compat = new FlatCompat({
+	baseDirectory: __dirname,
+	recommendedConfig: js.configs.recommended,
+	allConfig: js.configs.all
+});
+
+export default [...compat.extends('eslint:recommended'), {
+	languageOptions: {
+		globals: {
+			...globals.node,
+			...globals.mocha,
+		},
+
+		ecmaVersion: 'latest',
+		sourceType: 'module',
+	},
+
+	rules: {
+		indent: ['error', 'tab', {
+			SwitchCase: 1,
+		}],
+
+		'linebreak-style': ['error', 'unix'],
+		quotes: ['error', 'single'],
+		semi: ['error', 'always'],
+
+		'no-console': ['error', {
+			allow: ['warn', 'error', 'info'],
+		}],
+
+		'no-unused-vars': ['error', {
+			argsIgnorePattern: '^_',
+		}],
+
+		'no-empty': ['error', {
+			allowEmptyCatch: true,
+		}],
+
+		'no-trailing-spaces': ['error', {
+			ignoreComments: true,
+		}],
+
+		'require-atomic-updates': 'off',
+		'eol-last': ['error', 'always'],
+	},
+}];

package/index.d.ts

@@ -0,0 +1,13 @@
+//
+// index.d.ts
+// @trenskow/combinations
+//
+// Created by Kristian Trenskow on 2026/03/18
+// For license see LICENSE.
+//
+
+declare function combinations<T>(
+	array: T[]
+): T[][];
+
+export default combinations;

package/index.js

@@ -0,0 +1,9 @@
+//
+// index.js
+// @trenskow/combinations
+//
+// Created by Kristian Trenskow on 2026/03/18
+// For license see LICENSE.
+//
+
+export { default } from './lib/index.js';

package/lib/index.js

@@ -0,0 +1,40 @@
+//
+// index.js
+// @trenskow/combinations
+//
+// Created by Kristian Trenskow on 2026/03/18
+// For license see LICENSE.
+//
+
+export default (array) => {
+
+	const result = [[]];
+
+	function backtrack(
+		current,
+		remaining
+	) {
+
+		remaining
+			.forEach((item, index) => {
+
+				const next = [...current, item];
+
+				result.push(next);
+
+				backtrack(
+					next,
+					[
+						...remaining.slice(0, index),
+						...remaining.slice(index + 1)
+					]);
+
+			});
+
+	}
+
+	backtrack([], array);
+
+	return result;
+
+};

package/package.json

@@ -0,0 +1,35 @@
+{
+	"name": "@trenskow/combinations",
+	"version": "0.1.0",
+	"description": "Small package that iterates an array and returns all ordering combinations.",
+	"keywords": [
+		"array",
+		"combine",
+		"sort"
+	],
+	"homepage": "https://github.com/trenskow/combinations#readme",
+	"bugs": {
+		"url": "https://github.com/trenskow/combinations/issues"
+	},
+	"repository": {
+		"type": "git",
+		"url": "git+https://github.com/trenskow/combinations.git"
+	},
+	"license": "BSD-2-Clause",
+	"author": "Kristian Trenskow <this.is@kristians.email>",
+	"type": "module",
+	"main": "index.js",
+	"types": "index.d.ts",
+	"scripts": {
+		"test": "node ./node_modules/mocha/bin/mocha.js ./test/index.js"
+	},
+	"dependencies": {
+		"@eslint/compat": "^2.0.3",
+		"@eslint/eslintrc": "^3.3.5",
+		"@eslint/js": "^10.0.1",
+		"chai": "^6.2.2",
+		"eslint": "^10.0.3",
+		"globals": "^17.4.0",
+		"mocha": "^11.7.5"
+	}
+}

package/test/index.js

@@ -0,0 +1,36 @@
+//
+// index.js
+// @trenskow/combinations
+//
+// Created by Kristian Trenskow on 2026/03/18
+// For license see LICENSE.
+//
+
+import { expect } from 'chai';
+
+import combinations from '../index.js';
+
+describe('@trenskow/combinations', () => {
+
+	it('should come back with all combinations.', () => {
+		expect(combinations([1, 2, 3])).to.deep.equal([
+			[],
+			[ 1 ],
+			[ 1, 2 ],
+			[ 1, 2, 3 ],
+			[ 1, 3 ],
+			[ 1, 3, 2 ],
+			[ 2 ],
+			[ 2, 1 ],
+			[ 2, 1, 3 ],
+			[ 2, 3 ],
+			[ 2, 3, 1 ],
+			[ 3 ],
+			[ 3, 1 ],
+			[ 3, 1, 2 ],
+			[ 3, 2 ],
+			[ 3, 2, 1 ]
+		]);
+	});
+
+});