collect-your-stuff 1.2.9 → 1.3.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/main.d.ts +24 -1
- package/dist/main.js +101 -1
- package/dist/main.min.js +1 -1
- package/dist/services/services.d.ts +2 -2
- package/package.json +1 -1
package/dist/main.d.ts
CHANGED
|
@@ -6,27 +6,50 @@
|
|
|
6
6
|
* @module collect-your-stuff
|
|
7
7
|
*/
|
|
8
8
|
import 'core-js/stable';
|
|
9
|
+
import { ArrayElement } from './collections/arrayable/ArrayElement';
|
|
9
10
|
import { Arrayable } from './collections/arrayable/Arrayable';
|
|
11
|
+
import { DoubleLinker } from './collections/doubly-linked-list/DoubleLinker';
|
|
10
12
|
import { DoublyLinkedList } from './collections/doubly-linked-list/DoublyLinkedList';
|
|
13
|
+
import { Linker } from './collections/linked-list/Linker';
|
|
11
14
|
import { LinkedList } from './collections/linked-list/LinkedList';
|
|
15
|
+
import { TreeLinker } from './collections/linked-tree-list/TreeLinker';
|
|
12
16
|
import { LinkedTreeList } from './collections/linked-tree-list/LinkedTreeList';
|
|
17
|
+
import { Queueable } from './collections/queue/Queueable';
|
|
13
18
|
import { Queue } from './collections/queue/Queue';
|
|
19
|
+
import { Stackable } from './collections/stack/Stackable';
|
|
14
20
|
import { Stack } from './collections/stack/Stack';
|
|
21
|
+
import { recipes } from './recipes/recipes';
|
|
22
|
+
import { services } from './services/services';
|
|
15
23
|
/**
|
|
16
24
|
* TODO:
|
|
17
25
|
* 1. Create binary tree. Use the tree, but it has a limit of only two children per parent, and when adding / removing sort is applied. Add sort function in fromArray
|
|
18
26
|
* 2. Create a heap (both min and max heap variants) which is similar to binary tree in structure, but tree having its min / max value as root. and it must insert on the left-most lowest level, and removes from root. Be able to easily swap nodes to ensure min / max ordering.
|
|
19
27
|
* 3. Create a graph type which can have directional and undirectional variants for linking nodes
|
|
20
28
|
*/
|
|
29
|
+
export { ArrayElement, Arrayable, DoubleLinker, DoublyLinkedList, Linker, LinkedList, TreeLinker, LinkedTreeList, Queueable, Queue, Stackable, Stack, recipes, services };
|
|
30
|
+
export type { IsArrayable, forEachCallback } from './recipes/IsArrayable';
|
|
31
|
+
export type { IsDoubleLinker } from './recipes/IsDoubleLinker';
|
|
32
|
+
export type { IsElement } from './recipes/IsElement';
|
|
33
|
+
export type { IsLinker } from './recipes/IsLinker';
|
|
34
|
+
export type { IsTree } from './recipes/IsTree';
|
|
35
|
+
export type { IsTreeNode } from './recipes/IsTreeNode';
|
|
36
|
+
export type { IsRunnable, completeResponse } from './recipes/Runnable';
|
|
21
37
|
/**
|
|
22
|
-
* All methods exported from this module are encapsulated within collect-your-stuff
|
|
38
|
+
* All methods exported from this module are encapsulated within collect-your-stuff (this default export is the same
|
|
39
|
+
* set of classes as the named exports).
|
|
23
40
|
*/
|
|
24
41
|
declare const collectYourStuff: {
|
|
42
|
+
ArrayElement: typeof ArrayElement;
|
|
25
43
|
Arrayable: typeof Arrayable;
|
|
44
|
+
DoubleLinker: typeof DoubleLinker;
|
|
26
45
|
DoublyLinkedList: typeof DoublyLinkedList;
|
|
46
|
+
Linker: typeof Linker;
|
|
27
47
|
LinkedList: typeof LinkedList;
|
|
48
|
+
TreeLinker: typeof TreeLinker;
|
|
28
49
|
LinkedTreeList: typeof LinkedTreeList;
|
|
50
|
+
Queueable: typeof Queueable;
|
|
29
51
|
Queue: typeof Queue;
|
|
52
|
+
Stackable: typeof Stackable;
|
|
30
53
|
Stack: typeof Stack;
|
|
31
54
|
recipes: {
|
|
32
55
|
ArrayIterator: typeof import("./recipes/ArrayIterator").ArrayIterator;
|
package/dist/main.js
CHANGED
|
@@ -3,13 +3,103 @@
|
|
|
3
3
|
Object.defineProperty(exports, '__esModule', {
|
|
4
4
|
value: true
|
|
5
5
|
})
|
|
6
|
+
Object.defineProperty(exports, 'ArrayElement', {
|
|
7
|
+
enumerable: true,
|
|
8
|
+
get: function () {
|
|
9
|
+
return _ArrayElement.ArrayElement
|
|
10
|
+
}
|
|
11
|
+
})
|
|
12
|
+
Object.defineProperty(exports, 'Arrayable', {
|
|
13
|
+
enumerable: true,
|
|
14
|
+
get: function () {
|
|
15
|
+
return _Arrayable.Arrayable
|
|
16
|
+
}
|
|
17
|
+
})
|
|
18
|
+
Object.defineProperty(exports, 'DoubleLinker', {
|
|
19
|
+
enumerable: true,
|
|
20
|
+
get: function () {
|
|
21
|
+
return _DoubleLinker.DoubleLinker
|
|
22
|
+
}
|
|
23
|
+
})
|
|
24
|
+
Object.defineProperty(exports, 'DoublyLinkedList', {
|
|
25
|
+
enumerable: true,
|
|
26
|
+
get: function () {
|
|
27
|
+
return _DoublyLinkedList.DoublyLinkedList
|
|
28
|
+
}
|
|
29
|
+
})
|
|
30
|
+
Object.defineProperty(exports, 'LinkedList', {
|
|
31
|
+
enumerable: true,
|
|
32
|
+
get: function () {
|
|
33
|
+
return _LinkedList.LinkedList
|
|
34
|
+
}
|
|
35
|
+
})
|
|
36
|
+
Object.defineProperty(exports, 'LinkedTreeList', {
|
|
37
|
+
enumerable: true,
|
|
38
|
+
get: function () {
|
|
39
|
+
return _LinkedTreeList.LinkedTreeList
|
|
40
|
+
}
|
|
41
|
+
})
|
|
42
|
+
Object.defineProperty(exports, 'Linker', {
|
|
43
|
+
enumerable: true,
|
|
44
|
+
get: function () {
|
|
45
|
+
return _Linker.Linker
|
|
46
|
+
}
|
|
47
|
+
})
|
|
48
|
+
Object.defineProperty(exports, 'Queue', {
|
|
49
|
+
enumerable: true,
|
|
50
|
+
get: function () {
|
|
51
|
+
return _Queue.Queue
|
|
52
|
+
}
|
|
53
|
+
})
|
|
54
|
+
Object.defineProperty(exports, 'Queueable', {
|
|
55
|
+
enumerable: true,
|
|
56
|
+
get: function () {
|
|
57
|
+
return _Queueable.Queueable
|
|
58
|
+
}
|
|
59
|
+
})
|
|
60
|
+
Object.defineProperty(exports, 'Stack', {
|
|
61
|
+
enumerable: true,
|
|
62
|
+
get: function () {
|
|
63
|
+
return _Stack.Stack
|
|
64
|
+
}
|
|
65
|
+
})
|
|
66
|
+
Object.defineProperty(exports, 'Stackable', {
|
|
67
|
+
enumerable: true,
|
|
68
|
+
get: function () {
|
|
69
|
+
return _Stackable.Stackable
|
|
70
|
+
}
|
|
71
|
+
})
|
|
72
|
+
Object.defineProperty(exports, 'TreeLinker', {
|
|
73
|
+
enumerable: true,
|
|
74
|
+
get: function () {
|
|
75
|
+
return _TreeLinker.TreeLinker
|
|
76
|
+
}
|
|
77
|
+
})
|
|
6
78
|
exports.default = void 0
|
|
79
|
+
Object.defineProperty(exports, 'recipes', {
|
|
80
|
+
enumerable: true,
|
|
81
|
+
get: function () {
|
|
82
|
+
return _recipes.recipes
|
|
83
|
+
}
|
|
84
|
+
})
|
|
85
|
+
Object.defineProperty(exports, 'services', {
|
|
86
|
+
enumerable: true,
|
|
87
|
+
get: function () {
|
|
88
|
+
return _services.services
|
|
89
|
+
}
|
|
90
|
+
})
|
|
7
91
|
require('core-js/stable')
|
|
92
|
+
var _ArrayElement = require('./collections/arrayable/ArrayElement')
|
|
8
93
|
var _Arrayable = require('./collections/arrayable/Arrayable')
|
|
94
|
+
var _DoubleLinker = require('./collections/doubly-linked-list/DoubleLinker')
|
|
9
95
|
var _DoublyLinkedList = require('./collections/doubly-linked-list/DoublyLinkedList')
|
|
96
|
+
var _Linker = require('./collections/linked-list/Linker')
|
|
10
97
|
var _LinkedList = require('./collections/linked-list/LinkedList')
|
|
98
|
+
var _TreeLinker = require('./collections/linked-tree-list/TreeLinker')
|
|
11
99
|
var _LinkedTreeList = require('./collections/linked-tree-list/LinkedTreeList')
|
|
100
|
+
var _Queueable = require('./collections/queue/Queueable')
|
|
12
101
|
var _Queue = require('./collections/queue/Queue')
|
|
102
|
+
var _Stackable = require('./collections/stack/Stackable')
|
|
13
103
|
var _Stack = require('./collections/stack/Stack')
|
|
14
104
|
var _recipes = require('./recipes/recipes')
|
|
15
105
|
var _services = require('./services/services')
|
|
@@ -27,15 +117,25 @@ var _services = require('./services/services')
|
|
|
27
117
|
* 2. Create a heap (both min and max heap variants) which is similar to binary tree in structure, but tree having its min / max value as root. and it must insert on the left-most lowest level, and removes from root. Be able to easily swap nodes to ensure min / max ordering.
|
|
28
118
|
* 3. Create a graph type which can have directional and undirectional variants for linking nodes
|
|
29
119
|
*/
|
|
120
|
+
// Every collection (with the linker / element class it is built from), the recipes and the services are available by
|
|
121
|
+
// name: import { LinkedList, Linker } from 'collect-your-stuff', require('collect-your-stuff').LinkedList ...
|
|
122
|
+
|
|
30
123
|
/**
|
|
31
|
-
* All methods exported from this module are encapsulated within collect-your-stuff
|
|
124
|
+
* All methods exported from this module are encapsulated within collect-your-stuff (this default export is the same
|
|
125
|
+
* set of classes as the named exports).
|
|
32
126
|
*/
|
|
33
127
|
const collectYourStuff = {
|
|
128
|
+
ArrayElement: _ArrayElement.ArrayElement,
|
|
34
129
|
Arrayable: _Arrayable.Arrayable,
|
|
130
|
+
DoubleLinker: _DoubleLinker.DoubleLinker,
|
|
35
131
|
DoublyLinkedList: _DoublyLinkedList.DoublyLinkedList,
|
|
132
|
+
Linker: _Linker.Linker,
|
|
36
133
|
LinkedList: _LinkedList.LinkedList,
|
|
134
|
+
TreeLinker: _TreeLinker.TreeLinker,
|
|
37
135
|
LinkedTreeList: _LinkedTreeList.LinkedTreeList,
|
|
136
|
+
Queueable: _Queueable.Queueable,
|
|
38
137
|
Queue: _Queue.Queue,
|
|
138
|
+
Stackable: _Stackable.Stackable,
|
|
39
139
|
Stack: _Stack.Stack,
|
|
40
140
|
recipes: _recipes.recipes,
|
|
41
141
|
services: _services.services
|
package/dist/main.min.js
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),exports.default=void 0,require("core-js/stable");var _Arrayable=require("./collections/arrayable/Arrayable"),_DoublyLinkedList=require("./collections/doubly-linked-list/DoublyLinkedList"),_LinkedList=require("./collections/linked-list/LinkedList"),_LinkedTreeList=require("./collections/linked-tree-list/LinkedTreeList"),_Queue=require("./collections/queue/Queue"),_Stack=require("./collections/stack/Stack"),_recipes=require("./recipes/recipes"),_services=require("./services/services");const collectYourStuff={Arrayable:_Arrayable.Arrayable,DoublyLinkedList:_DoublyLinkedList.DoublyLinkedList,LinkedList:_LinkedList.LinkedList,LinkedTreeList:_LinkedTreeList.LinkedTreeList,Queue:_Queue.Queue,Stack:_Stack.Stack,recipes:_recipes.recipes,services:_services.services};var _default=exports.default=collectYourStuff;"undefined"!=typeof window&&(window.collectYourStuff=collectYourStuff);
|
|
1
|
+
"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),Object.defineProperty(exports,"ArrayElement",{enumerable:!0,get:function(){return _ArrayElement.ArrayElement}}),Object.defineProperty(exports,"Arrayable",{enumerable:!0,get:function(){return _Arrayable.Arrayable}}),Object.defineProperty(exports,"DoubleLinker",{enumerable:!0,get:function(){return _DoubleLinker.DoubleLinker}}),Object.defineProperty(exports,"DoublyLinkedList",{enumerable:!0,get:function(){return _DoublyLinkedList.DoublyLinkedList}}),Object.defineProperty(exports,"LinkedList",{enumerable:!0,get:function(){return _LinkedList.LinkedList}}),Object.defineProperty(exports,"LinkedTreeList",{enumerable:!0,get:function(){return _LinkedTreeList.LinkedTreeList}}),Object.defineProperty(exports,"Linker",{enumerable:!0,get:function(){return _Linker.Linker}}),Object.defineProperty(exports,"Queue",{enumerable:!0,get:function(){return _Queue.Queue}}),Object.defineProperty(exports,"Queueable",{enumerable:!0,get:function(){return _Queueable.Queueable}}),Object.defineProperty(exports,"Stack",{enumerable:!0,get:function(){return _Stack.Stack}}),Object.defineProperty(exports,"Stackable",{enumerable:!0,get:function(){return _Stackable.Stackable}}),Object.defineProperty(exports,"TreeLinker",{enumerable:!0,get:function(){return _TreeLinker.TreeLinker}}),exports.default=void 0,Object.defineProperty(exports,"recipes",{enumerable:!0,get:function(){return _recipes.recipes}}),Object.defineProperty(exports,"services",{enumerable:!0,get:function(){return _services.services}}),require("core-js/stable");var _ArrayElement=require("./collections/arrayable/ArrayElement"),_Arrayable=require("./collections/arrayable/Arrayable"),_DoubleLinker=require("./collections/doubly-linked-list/DoubleLinker"),_DoublyLinkedList=require("./collections/doubly-linked-list/DoublyLinkedList"),_Linker=require("./collections/linked-list/Linker"),_LinkedList=require("./collections/linked-list/LinkedList"),_TreeLinker=require("./collections/linked-tree-list/TreeLinker"),_LinkedTreeList=require("./collections/linked-tree-list/LinkedTreeList"),_Queueable=require("./collections/queue/Queueable"),_Queue=require("./collections/queue/Queue"),_Stackable=require("./collections/stack/Stackable"),_Stack=require("./collections/stack/Stack"),_recipes=require("./recipes/recipes"),_services=require("./services/services");const collectYourStuff={ArrayElement:_ArrayElement.ArrayElement,Arrayable:_Arrayable.Arrayable,DoubleLinker:_DoubleLinker.DoubleLinker,DoublyLinkedList:_DoublyLinkedList.DoublyLinkedList,Linker:_Linker.Linker,LinkedList:_LinkedList.LinkedList,TreeLinker:_TreeLinker.TreeLinker,LinkedTreeList:_LinkedTreeList.LinkedTreeList,Queueable:_Queueable.Queueable,Queue:_Queue.Queue,Stackable:_Stackable.Stackable,Stack:_Stack.Stack,recipes:_recipes.recipes,services:_services.services};var _default=exports.default=collectYourStuff;"undefined"!=typeof window&&(window.collectYourStuff=collectYourStuff);
|
|
@@ -8,6 +8,6 @@
|
|
|
8
8
|
* List helpful functions when dealing with collections.
|
|
9
9
|
*/
|
|
10
10
|
export declare const services: {
|
|
11
|
-
parseTree: (tree: import("../
|
|
12
|
-
parseTreeNext: (treeNode: import("../
|
|
11
|
+
parseTree: (tree: import("../main").IsTree, callback: import("../main").forEachCallback) => import("../main").IsTree;
|
|
12
|
+
parseTreeNext: (treeNode: import("../main").IsTreeNode) => import("../main").IsTreeNode | null;
|
|
13
13
|
};
|
package/package.json
CHANGED