rawwjs 1.0.0 | Documentation

rawwjs

1.0.0

External Structures
BinarySearchTree ▸
- Static members
- .checkKeyIsValid
- Instance members
- #root
- #insert
- #get
- #has
- #min
- #max
- #remove
- #_transplant
LinkedList ▸
- Instance members
- #head
- #length
- #insert
- #insertAt
- #insertFirst
- #get
- #findAt
- #positionOf
- #deleteAt
- #delete
- #toArray
- #_checkIsInBounds
Internal Structures
BinarySearchTreeNode ▸
- Instance members
- #key
- #value
- #parent
- #left
- #right
LinkedListNode ▸
- Instance members
- #value
- #next

Need help reading this?

External Structures

These are the exported data structures.

BinarySearchTree

new BinarySearchTree()

Static Members

▸ checkKeyIsValid(key)

checkKeyIsValid(key: any)

Parameters

key (any)

Instance Members

▸ root

root

Type: TTreeNode?

▸ insert(key, value, currentNode)

Inserts a key with the provided value into the tree. If the key is already present it will replace the old value with the new one.

insert(key: number, value: any, currentNode: TTreeNode?): BinarySearchTree

Parameters

key (number)

value

(any
            = null)

currentNode

(TTreeNode?
            = this.root)

Returns

BinarySearchTree

▸ get(key, currentNode, parentNode)

Attempts to find the node with the key provided and return a result containing both the node and its parent.

get(key: number, currentNode: TTreeNode?, parentNode: TTreeNode?): TTreeNode?

Parameters

key (number)

currentNode

(TTreeNode?
            = this.root)

parentNode

(TTreeNode?
            = null)

Returns

TTreeNode?

▸ has(key)

Returns whether or not the tree contains a specific value.

has(key: number): boolean

Parameters

key (number)

Returns

boolean

▸ min(currentNode)

Attempts to find node with the min key in the tree.

min(currentNode: TTreeNode?): TTreeNode?

Parameters

currentNode

(TTreeNode?
            = this.root)

Returns

TTreeNode?

▸ max(currentNode)

Attempts to find node with the max key in the tree.

max(currentNode: TTreeNode?): TTreeNode?

Parameters

currentNode

(TTreeNode?
            = this.root)

Returns

TTreeNode?

▸ remove(key, currentNode)

Attempts to remove the node with the specified key. It will return null if no node is found with that key.

remove(key: number, currentNode: TTreeNode?): TTreeNode?

Parameters

key (number)

currentNode

(TTreeNode?
            = this.root)

Returns

TTreeNode?

▸ _transplant(existingNode, replacementNode)

_transplant(existingNode: TTreeNode, replacementNode: TTreeNode?): void

Parameters

existingNode (TTreeNode)

replacementNode (TTreeNode?)

Returns

void

LinkedList

new LinkedList()

Instance Members

▸ head

head

Type: LinkedListNode?

▸ length

length

Type: number

▸ insert(value, node)

Inserts the value into a node at the end of the list, recursively.

insert(value: any, node: LinkedListNode?): LinkedList

Parameters

value (any)

node

(LinkedListNode?
            = this.head)

Returns

LinkedList

▸ insertAt(value, position)

Inserts the value into a node with a specific position in the list.

insertAt(value: any, position: number): LinkedList

Parameters

value (any)

position (number)

Returns

LinkedList

▸ insertFirst(value)

Inserts the value into a node at the beginning of the list, as the head.

insertFirst(value: any): LinkedList

Parameters

value (any)

Returns

LinkedList

▸ get(value)

Returns the first node with a value matching that provided.

get(value: any): LinkedListNode?

Parameters

value (any)

Returns

LinkedListNode?

▸ findAt(position)

Finds the node located at the provided position.

findAt(position: number): any

Parameters

position (number)

Returns

any

▸ positionOf(value)

Search the list for the first node containing the value provided using a strict equality comparison and return the index.

positionOf(value: any): number

Parameters

value (any)

Returns

number

▸ deleteAt(position)

Deletes the the first node with the value provided, returning the value deleted.

deleteAt(position: number): any

Parameters

position (number)

Returns

any

▸ delete(value)

Deletes the the first node with the value provided, returning the value deleted.

delete(value: any): any

Parameters

value (any)

Returns

any

▸ toArray()

toArray(): Array<any>

Returns

Array<any>

▸ _checkIsInBounds(num)

_checkIsInBounds(num: number): boolean

Parameters

num (number)

Returns

boolean

Internal Structures

These are non-exported data structures that are used internally.

BinarySearchTreeNode

new BinarySearchTreeNode(key: number, value: any)

Parameters

key (number)

value (any)

Instance Members

▸ key

key

Type: number

▸ value

value

Type: any

▸ parent

parent

Type: BinarySearchTreeNode?

▸ left

left

Type: BinarySearchTreeNode?

▸ right

right

Type: BinarySearchTreeNode?

LinkedListNode

new LinkedListNode(value: any)

Parameters

value (any)

Instance Members

▸ value

value

Type: any

▸ next

Type: LinkedListNode?