flex-algo - npm Package Compare versions

Comparing version 0.1.11 to 0.1.12

lib/index.d.ts

		import { PriorityQueue } from './priorityQueue';
		import { BinaryTree, BinaryNode } from './binaryTree';
		import { BST } from './bst';
		import { quickSort } from './quickSort';
		export { PriorityQueue, BinaryTree, BinaryNode, BST, quickSort };
		import { quickSort, pivot } from './quickSort';
		export { PriorityQueue, BinaryTree, BinaryNode, BST, quickSort, pivot };

lib/index.js

		"use strict";
		Object.defineProperty(exports, "__esModule", { value: true });
		exports.quickSort = exports.BST = exports.BinaryNode = exports.BinaryTree = exports.PriorityQueue = void 0;
		exports.pivot = exports.quickSort = exports.BST = exports.BinaryNode = exports.BinaryTree = exports.PriorityQueue = void 0;
		var priorityQueue_1 = require("./priorityQueue");
		@@ -13,1 +13,2 @@ Object.defineProperty(exports, "PriorityQueue", { enumerable: true, get: function () { return priorityQueue_1.PriorityQueue; } });
		Object.defineProperty(exports, "quickSort", { enumerable: true, get: function () { return quickSort_1.quickSort; } });
		Object.defineProperty(exports, "pivot", { enumerable: true, get: function () { return quickSort_1.pivot; } });

lib/quickSort.d.ts

		@@ -0,1 +1,2 @@
		export declare function pivot(data: number[], left: number, right: number): number;
		export declare function quickSort(data: number[]): void;

lib/quickSort.js

		"use strict";
		Object.defineProperty(exports, "__esModule", { value: true });
		exports.quickSort = void 0;
		exports.quickSort = exports.pivot = void 0;
		function swap(data, i, j) {
		@@ -20,2 +20,3 @@ var temp = data[i];
		}
		exports.pivot = pivot;
		function _quickSort(data, left, right) {
		@@ -22,0 +23,0 @@ if (left >= right)

package.json

		{
		"name": "flex-algo",
		"version": "0.1.11",
		"version": "0.1.12",
		"description": "\"SDK for commonly used data structure and algorithms\"",
		@@ -5,0 +5,0 @@ "main": "lib/index.js",

New alerts