Class UriTrie<T>

A trie structure for URIs. It allows to insert, delete and find elements by their URI. More specifically, it allows to efficiently find all elements that are children of a given URI.

Unlike a regular trie, this implementation uses the name of the URI segments as keys.

See

https://en.wikipedia.org/wiki/Trie

Type Parameters

T

Index

Constructors

Methods

all clear delete find findAll findChildren findNode has hasNode insert

Constructors

constructor

new UriTrie<T>(): UriTrie<T>
Type Parameters
- T
Returns UriTrie<T>

Methods

all

all(): T[]
Returns T[]
- Defined in packages/langium/src/utils/uri-utils.ts:168

clear

clear(): void
Returns void
- Defined in packages/langium/src/utils/uri-utils.ts:114

delete

delete(uri: string | URI): void
Parameters
- uri: string | URI
Returns void
- Defined in packages/langium/src/utils/uri-utils.ts:123

find

find(uri: string | URI): undefined | T
Parameters
- uri: string | URI
Returns undefined | T
- Defined in packages/langium/src/utils/uri-utils.ts:138

findAll

findAll(prefix: string | URI): T[]
Parameters
- prefix: string | URI
Returns T[]
- Defined in packages/langium/src/utils/uri-utils.ts:172

findChildren

findChildren(uri: string | URI): UriTrieNode<T>[]
Parameters
- uri: string | URI
Returns UriTrieNode<T>[]
- Defined in packages/langium/src/utils/uri-utils.ts:155

findNode

findNode(uri: string | URI): undefined | UriTrieNode<T>
Parameters
- uri: string | URI
Returns undefined | UriTrieNode<T>
- Defined in packages/langium/src/utils/uri-utils.ts:142

has

has(uri: string | URI): boolean
Parameters
- uri: string | URI
Returns boolean
- Defined in packages/langium/src/utils/uri-utils.ts:130

hasNode

hasNode(uri: string | URI): boolean
Parameters
- uri: string | URI
Returns boolean
- Defined in packages/langium/src/utils/uri-utils.ts:134

insert

insert(uri: string | URI, element: T): void
Parameters
- uri: string | URI
- element: T
Returns void
- Defined in packages/langium/src/utils/uri-utils.ts:118