README.md

dastal - v5.0.0

dastal - v5.0.0

Table of contents

Namespaces

• ArrayUtils
• IteratorUtils
• NumberUtils
• StringUtils
• env
• u32

Classes

• AATree
• AVLTree
• ArrayList
• ArrayQueue
• ArrayStack
• BinaryHeap
• DoublyLinkedList
• InOrderSegmentTree
• LevelOrderSegmentTree
• LinkedList
• LinkedQueue
• LinkedStack
• SkewHeap

Interfaces

• AATreeNode
• AVLTreeNode
• BinaryTreeNode
• Collection
• DoublyLinkedNode
• Heap
• LinkedNode
• List
• Queue
• SegmentTree
• Sortable
• Sorted
• SortedTree
• Stack
• Tree

Type aliases

• CombineFn
• CompareFn

Functions

• isCollection

Type aliases

CombineFn

Ƭ CombineFn<T, K>: (a: T, b: T) => K

Type parameters

Name	Type
T	T
K	K = T

Type declaration

▸ (a, b): K

A function that combines two elements into another. The output may or may not be of the same type as the inputs, depending on the use case.

Parameters

Name	Type	Description
a	T	The first element
b	T	The second element

Returns

K

The combination of the given elements

Defined in

src/index.ts:23

---

CompareFn

Ƭ CompareFn<T>: (a: T, b: T) => number

Type parameters

Name
T

Type declaration

▸ (a, b): number

A function used to determine the order of a set of elements.

Parameters

Name	Type	Description
a	T	The first element
b	T	The second element

Returns

number

• A negative value if a < b
• Zero if a == b
• A positive value if a > b

Defined in

src/index.ts:35

Functions

isCollection

▸ isCollection(obj): obj is Collection<unknown>

Check if a value is a Collection.

Parameters

Name	Type	Description
obj	any	The value to check.

Returns

obj is Collection<unknown>

• true if obj is a Collection, false otherwise.

Defined in

src/collection/index.ts:12