1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 |
x1 x1 x1 x1 x1 x2 x1 x1 x1 x1 x2 x1 x1 x1 x1 x1 x1 x1 x1 x1 x1 x1 x1 x1 x1 x2 x1 |
/**
* Data structures for use in algorithms and other data manipulation.
*
* ```ts
* import { BinarySearchTree } from "@std/data-structures";
* import { assertEquals } from "@std/assert";
*
* const values = [3, 10, 13, 4, 6, 7, 1, 14];
* const tree = new BinarySearchTree<number>();
* values.forEach((value) => tree.insert(value));
*
* assertEquals([...tree], [1, 3, 4, 6, 7, 10, 13, 14]);
* assertEquals(tree.min(), 1);
* assertEquals(tree.max(), 14);
* assertEquals(tree.find(42), null);
* assertEquals(tree.find(7), 7);
* assertEquals(tree.remove(42), false);
* assertEquals(tree.remove(7), true);
* assertEquals([...tree], [1, 3, 4, 6, 10, 13, 14]);
* ```
*
* @module
*/
import { BinaryHeap as _class_BinaryHeap } from "jsr:@std/[email protected]"
/**
* A priority queue implemented with a binary heap. The heap is in descending
* order by default, using JavaScript's built-in comparison operators to sort
* the values.
*
* | Method | Average Case | Worst Case |
* | ----------- | ------------ | ---------- |
* | peek() | O(1) | O(1) |
* | pop() | O(log n) | O(log n) |
* | push(value) | O(1) | O(log n) |
*
* @example Usage
* ```ts
* import {
* ascend,
* BinaryHeap,
* descend,
* } from "@std/data-structures";
* import { assertEquals } from "@std/assert";
*
* const maxHeap = new BinaryHeap<number>();
* maxHeap.push(4, 1, 3, 5, 2);
* assertEquals(maxHeap.peek(), 5);
* assertEquals(maxHeap.pop(), 5);
* assertEquals([...maxHeap], [4, 3, 2, 1]);
* assertEquals([...maxHeap], []);
*
* const minHeap = new BinaryHeap<number>(ascend);
* minHeap.push(4, 1, 3, 5, 2);
* assertEquals(minHeap.peek(), 1);
* assertEquals(minHeap.pop(), 1);
* assertEquals([...minHeap], [2, 3, 4, 5]);
* assertEquals([...minHeap], []);
*
* const words = new BinaryHeap<string>((a, b) => descend(a.length, b.length));
* words.push("truck", "car", "helicopter", "tank");
* assertEquals(words.peek(), "helicopter");
* assertEquals(words.pop(), "helicopter");
* assertEquals([...words], ["truck", "tank", "car"]);
* assertEquals([...words], []);
* ```
*
* @template T The type of the values stored in the binary heap.
*/
class BinaryHeap<T> extends _class_BinaryHeap<T> {}
export { BinaryHeap }
import { BinarySearchTree as _class_BinarySearchTree } from "jsr:@std/[email protected]"
/**
* An unbalanced binary search tree. The values are in ascending order by default,
* using JavaScript's built-in comparison operators to sort the values.
*
* For performance, it's recommended that you use a self-balancing binary search
* tree instead of this one unless you are extending this to create a
* self-balancing tree. See {@link RedBlackTree} for an example of how BinarySearchTree
* can be extended to create a self-balancing binary search tree.
*
* | Method | Average Case | Worst Case |
* | ------------- | ------------ | ---------- |
* | find(value) | O(log n) | O(n) |
* | insert(value) | O(log n) | O(n) |
* | remove(value) | O(log n) | O(n) |
* | min() | O(log n) | O(n) |
* | max() | O(log n) | O(n) |
*
* @example Usage
* ```ts
* import {
* BinarySearchTree,
* ascend,
* descend,
* } from "@std/data-structures";
* import { assertEquals } from "@std/assert";
*
* const values = [3, 10, 13, 4, 6, 7, 1, 14];
* const tree = new BinarySearchTree<number>();
* values.forEach((value) => tree.insert(value));
* assertEquals([...tree], [1, 3, 4, 6, 7, 10, 13, 14]);
* assertEquals(tree.min(), 1);
* assertEquals(tree.max(), 14);
* assertEquals(tree.find(42), null);
* assertEquals(tree.find(7), 7);
* assertEquals(tree.remove(42), false);
* assertEquals(tree.remove(7), true);
* assertEquals([...tree], [1, 3, 4, 6, 10, 13, 14]);
*
* const invertedTree = new BinarySearchTree<number>(descend);
* values.forEach((value) => invertedTree.insert(value));
* assertEquals([...invertedTree], [14, 13, 10, 7, 6, 4, 3, 1]);
* assertEquals(invertedTree.min(), 14);
* assertEquals(invertedTree.max(), 1);
* assertEquals(invertedTree.find(42), null);
* assertEquals(invertedTree.find(7), 7);
* assertEquals(invertedTree.remove(42), false);
* assertEquals(invertedTree.remove(7), true);
* assertEquals([...invertedTree], [14, 13, 10, 6, 4, 3, 1]);
*
* const words = new BinarySearchTree<string>((a, b) =>
* ascend(a.length, b.length) || ascend(a, b)
* );
* ["truck", "car", "helicopter", "tank", "train", "suv", "semi", "van"]
* .forEach((value) => words.insert(value));
* assertEquals([...words], [
* "car",
* "suv",
* "van",
* "semi",
* "tank",
* "train",
* "truck",
* "helicopter",
* ]);
* assertEquals(words.min(), "car");
* assertEquals(words.max(), "helicopter");
* assertEquals(words.find("scooter"), null);
* assertEquals(words.find("tank"), "tank");
* assertEquals(words.remove("scooter"), false);
* assertEquals(words.remove("tank"), true);
* assertEquals([...words], [
* "car",
* "suv",
* "van",
* "semi",
* "train",
* "truck",
* "helicopter",
* ]);
* ```
*
* @template T The type of the values stored in the binary search tree.
*/
class BinarySearchTree<T> extends _class_BinarySearchTree<T> {}
export { BinarySearchTree }
import { ascend as _function_ascend } from "jsr:@std/[email protected]"
/**
* Compare two values in ascending order using JavaScript's built in comparison
* operators.
*
* @example Comparing numbers
* ```ts
* import { ascend } from "@std/data-structures";
* import { assertEquals } from "@std/assert";
*
* assertEquals(ascend(1, 2), -1);
* assertEquals(ascend(2, 1), 1);
* assertEquals(ascend(1, 1), 0);
* ```
*
* @template T The type of the values being compared.
* @param a The left comparison value.
* @param b The right comparison value.
* @return -1 if `a` is less than `b`, 0 if `a` is equal to `b`, and 1 if `a` is greater than `b`.
*/
const ascend = _function_ascend as typeof _function_ascend
export { ascend }
import { descend as _function_descend } from "jsr:@std/[email protected]"
/**
* Compare two values in descending order using JavaScript's built in comparison
* operators.
*
* @example Comparing numbers
* ```ts
* import { descend } from "@std/data-structures";
* import { assertEquals } from "@std/assert";
*
* assertEquals(descend(1, 2), 1);
* assertEquals(descend(2, 1), -1);
* assertEquals(descend(1, 1), 0);
* ```
*
* @template T The type of the values being compared.
* @param a The left comparison value.
* @param b The right comparison value.
* @return -1 if `a` is greater than `b`, 0 if `a` is equal to `b`, and 1 if `a` is less than `b`.
*/
const descend = _function_descend as typeof _function_descend
export { descend }
import { RedBlackTree as _class_RedBlackTree } from "jsr:@std/[email protected]"
/**
* A red-black tree. This is a kind of self-balancing binary search tree. The
* values are in ascending order by default, using JavaScript's built-in
* comparison operators to sort the values.
*
* Red-Black Trees require fewer rotations than AVL Trees, so they can provide
* faster insertions and removal operations. If you need faster lookups, you
* should use an AVL Tree instead. AVL Trees are more strictly balanced than
* Red-Black Trees, so they can provide faster lookups.
*
* | Method | Average Case | Worst Case |
* | ------------- | ------------ | ---------- |
* | find(value) | O(log n) | O(log n) |
* | insert(value) | O(log n) | O(log n) |
* | remove(value) | O(log n) | O(log n) |
* | min() | O(log n) | O(log n) |
* | max() | O(log n) | O(log n) |
*
* @example Usage
* ```ts
* import {
* ascend,
* descend,
* RedBlackTree,
* } from "@std/data-structures";
* import { assertEquals } from "@std/assert";
*
* const values = [3, 10, 13, 4, 6, 7, 1, 14];
* const tree = new RedBlackTree<number>();
* values.forEach((value) => tree.insert(value));
* assertEquals([...tree], [1, 3, 4, 6, 7, 10, 13, 14]);
* assertEquals(tree.min(), 1);
* assertEquals(tree.max(), 14);
* assertEquals(tree.find(42), null);
* assertEquals(tree.find(7), 7);
* assertEquals(tree.remove(42), false);
* assertEquals(tree.remove(7), true);
* assertEquals([...tree], [1, 3, 4, 6, 10, 13, 14]);
*
* const invertedTree = new RedBlackTree<number>(descend);
* values.forEach((value) => invertedTree.insert(value));
* assertEquals([...invertedTree], [14, 13, 10, 7, 6, 4, 3, 1]);
* assertEquals(invertedTree.min(), 14);
* assertEquals(invertedTree.max(), 1);
* assertEquals(invertedTree.find(42), null);
* assertEquals(invertedTree.find(7), 7);
* assertEquals(invertedTree.remove(42), false);
* assertEquals(invertedTree.remove(7), true);
* assertEquals([...invertedTree], [14, 13, 10, 6, 4, 3, 1]);
*
* const words = new RedBlackTree<string>((a, b) =>
* ascend(a.length, b.length) || ascend(a, b)
* );
* ["truck", "car", "helicopter", "tank", "train", "suv", "semi", "van"]
* .forEach((value) => words.insert(value));
* assertEquals([...words], [
* "car",
* "suv",
* "van",
* "semi",
* "tank",
* "train",
* "truck",
* "helicopter",
* ]);
* assertEquals(words.min(), "car");
* assertEquals(words.max(), "helicopter");
* assertEquals(words.find("scooter"), null);
* assertEquals(words.find("tank"), "tank");
* assertEquals(words.remove("scooter"), false);
* assertEquals(words.remove("tank"), true);
* assertEquals([...words], [
* "car",
* "suv",
* "van",
* "semi",
* "train",
* "truck",
* "helicopter",
* ]);
* ```
*
* @template T The type of the values being stored in the tree.
*/
class RedBlackTree<T> extends _class_RedBlackTree<T> {}
export { RedBlackTree }
|