diff --git a/.dependency-cruiser.js b/.dependency-cruiser.js new file mode 100644 index 0000000..21b641c --- /dev/null +++ b/.dependency-cruiser.js @@ -0,0 +1,449 @@ +/** @type {import('dependency-cruiser').IConfiguration} */ +module.exports = { + forbidden: [ + /* rules from the 'recommended' preset: */ + { + name: 'no-circular', + severity: 'warn', + comment: + 'This dependency is part of a circular relationship. You might want to revise ' + + 'your solution (i.e. use dependency inversion, make sure the modules have a single responsibility) ', + from: {}, + to: { + circular: true + } + }, + { + name: 'no-orphans', + comment: + "This is an orphan module - it's likely not used (anymore?). Either use it or " + + "remove it. If it's logical this module is an orphan (i.e. it's a config file), " + + "add an exception for it in your dependency-cruiser configuration. By default " + + "this rule does not scrutinize dot-files (e.g. .eslintrc.js), TypeScript declaration " + + "files (.d.ts), tsconfig.json and some of the babel and webpack configs.", + severity: 'warn', + from: { + orphan: true, + pathNot: [ + '(^|/)\\.[^/]+\\.(js|cjs|mjs|ts|json)$', // dot files + '\\.d\\.ts$', // TypeScript declaration files + '(^|/)tsconfig\\.json$', // TypeScript config + '(^|/)(babel|webpack)\\.config\\.(js|cjs|mjs|ts|json)$' // other configs + ] + }, + to: {}, + }, + { + name: 'no-deprecated-core', + comment: + 'A module depends on a node core module that has been deprecated. Find an alternative - these are ' + + "bound to exist - node doesn't deprecate lightly.", + severity: 'warn', + from: {}, + to: { + dependencyTypes: [ + 'core' + ], + path: [ + '^(v8\/tools\/codemap)$', + '^(v8\/tools\/consarray)$', + '^(v8\/tools\/csvparser)$', + '^(v8\/tools\/logreader)$', + '^(v8\/tools\/profile_view)$', + '^(v8\/tools\/profile)$', + '^(v8\/tools\/SourceMap)$', + '^(v8\/tools\/splaytree)$', + '^(v8\/tools\/tickprocessor-driver)$', + '^(v8\/tools\/tickprocessor)$', + '^(node-inspect\/lib\/_inspect)$', + '^(node-inspect\/lib\/internal\/inspect_client)$', + '^(node-inspect\/lib\/internal\/inspect_repl)$', + '^(async_hooks)$', + '^(punycode)$', + '^(domain)$', + '^(constants)$', + '^(sys)$', + '^(_linklist)$', + '^(_stream_wrap)$' + ], + } + }, + { + name: 'not-to-deprecated', + comment: + 'This module uses a (version of an) npm module that has been deprecated. Either upgrade to a later ' + + 'version of that module, or find an alternative. Deprecated modules are a security risk.', + severity: 'warn', + from: {}, + to: { + dependencyTypes: [ + 'deprecated' + ] + } + }, + { + name: 'no-non-package-json', + severity: 'error', + comment: + "This module depends on an npm package that isn't in the 'dependencies' section of your package.json. " + + "That's problematic as the package either (1) won't be available on live (2 - worse) will be " + + "available on live with an non-guaranteed version. Fix it by adding the package to the dependencies " + + "in your package.json.", + from: {}, + to: { + dependencyTypes: [ + 'npm-no-pkg', + 'npm-unknown' + ] + } + }, + { + name: 'not-to-unresolvable', + comment: + "This module depends on a module that cannot be found ('resolved to disk'). If it's an npm " + + 'module: add it to your package.json. In all other cases you likely already know what to do.', + severity: 'error', + from: {}, + to: { + couldNotResolve: true + } + }, + { + name: 'no-duplicate-dep-types', + comment: + "Likely this module depends on an external ('npm') package that occurs more than once " + + "in your package.json i.e. bot as a devDependencies and in dependencies. This will cause " + + "maintenance problems later on.", + severity: 'warn', + from: {}, + to: { + moreThanOneDependencyType: true, + // as it's pretty common to have a type import be a type only import + // _and_ (e.g.) a devDependency - don't consider type-only dependency + // types for this rule + dependencyTypesNot: ["type-only"] + } + }, + + /* rules you might want to tweak for your specific situation: */ + { + name: 'not-to-spec', + comment: + 'This module depends on a spec (test) file. The sole responsibility of a spec file is to test code. ' + + "If there's something in a spec that's of use to other modules, it doesn't have that single " + + 'responsibility anymore. Factor it out into (e.g.) a separate utility/ helper or a mock.', + severity: 'error', + from: {}, + to: { + path: '\\.(spec|test)\\.(js|mjs|cjs|ts|ls|coffee|litcoffee|coffee\\.md)$' + } + }, + { + name: 'not-to-dev-dep', + severity: 'error', + comment: + "This module depends on an npm package from the 'devDependencies' section of your " + + 'package.json. It looks like something that ships to production, though. To prevent problems ' + + "with npm packages that aren't there on production declare it (only!) in the 'dependencies'" + + 'section of your package.json. If this module is development only - add it to the ' + + 'from.pathNot re of the not-to-dev-dep rule in the dependency-cruiser configuration', + from: { + path: '^(src)', + pathNot: '\\.(spec|test)\\.(js|mjs|cjs|ts|ls|coffee|litcoffee|coffee\\.md)$' + }, + to: { + dependencyTypes: [ + 'npm-dev' + ] + } + }, + { + name: 'optional-deps-used', + severity: 'info', + comment: + "This module depends on an npm package that is declared as an optional dependency " + + "in your package.json. As this makes sense in limited situations only, it's flagged here. " + + "If you're using an optional dependency here by design - add an exception to your" + + "dependency-cruiser configuration.", + from: {}, + to: { + dependencyTypes: [ + 'npm-optional' + ] + } + }, + { + name: 'peer-deps-used', + comment: + "This module depends on an npm package that is declared as a peer dependency " + + "in your package.json. This makes sense if your package is e.g. a plugin, but in " + + "other cases - maybe not so much. If the use of a peer dependency is intentional " + + "add an exception to your dependency-cruiser configuration.", + severity: 'warn', + from: {}, + to: { + dependencyTypes: [ + 'npm-peer' + ] + } + } + ], + options: { + + /* conditions specifying which files not to follow further when encountered: + - path: a regular expression to match + - dependencyTypes: see https://github.com/sverweij/dependency-cruiser/blob/main/doc/rules-reference.md#dependencytypes-and-dependencytypesnot + for a complete list + */ + doNotFollow: { + path: ['node_modules', 'src/libs'] + }, + + /* conditions specifying which dependencies to exclude + - path: a regular expression to match + - dynamic: a boolean indicating whether to ignore dynamic (true) or static (false) dependencies. + leave out if you want to exclude neither (recommended!) + */ + // exclude : { + // path: '', + // dynamic: true + // }, + + /* pattern specifying which files to include (regular expression) + dependency-cruiser will skip everything not matching this pattern + */ + // includeOnly : '', + + /* dependency-cruiser will include modules matching against the focus + regular expression in its output, as well as their neighbours (direct + dependencies and dependents) + */ + // focus : '', + + /* list of module systems to cruise */ + // moduleSystems: ['amd', 'cjs', 'es6', 'tsd'], + + /* prefix for links in html and svg output (e.g. 'https://github.com/you/yourrepo/blob/develop/' + to open it on your online repo or `vscode://file/${process.cwd()}/` to + open it in visual studio code), + */ + // prefix: '', + + /* false (the default): ignore dependencies that only exist before typescript-to-javascript compilation + true: also detect dependencies that only exist before typescript-to-javascript compilation + "specify": for each dependency identify whether it only exists before compilation or also after + */ + tsPreCompilationDeps: true, + + /* + list of extensions to scan that aren't javascript or compile-to-javascript. + Empty by default. Only put extensions in here that you want to take into + account that are _not_ parsable. + */ + // extraExtensionsToScan: [".json", ".jpg", ".png", ".svg", ".webp"], + + /* if true combines the package.jsons found from the module up to the base + folder the cruise is initiated from. Useful for how (some) mono-repos + manage dependencies & dependency definitions. + */ + // combinedDependencies: false, + + /* if true leave symlinks untouched, otherwise use the realpath */ + // preserveSymlinks: false, + + /* TypeScript project file ('tsconfig.json') to use for + (1) compilation and + (2) resolution (e.g. with the paths property) + + The (optional) fileName attribute specifies which file to take (relative to + dependency-cruiser's current working directory). When not provided + defaults to './tsconfig.json'. + */ + tsConfig: { + fileName: 'tsconfig.json' + }, + + /* Webpack configuration to use to get resolve options from. + + The (optional) fileName attribute specifies which file to take (relative + to dependency-cruiser's current working directory. When not provided defaults + to './webpack.conf.js'. + + The (optional) `env` and `arguments` attributes contain the parameters to be passed if + your webpack config is a function and takes them (see webpack documentation + for details) + */ + // webpackConfig: { + // fileName: './webpack.config.js', + // env: {}, + // arguments: {}, + // }, + + /* Babel config ('.babelrc', '.babelrc.json', '.babelrc.json5', ...) to use + for compilation (and whatever other naughty things babel plugins do to + source code). This feature is well tested and usable, but might change + behavior a bit over time (e.g. more precise results for used module + systems) without dependency-cruiser getting a major version bump. + */ + // babelConfig: { + // fileName: './.babelrc' + // }, + + /* List of strings you have in use in addition to cjs/ es6 requires + & imports to declare module dependencies. Use this e.g. if you've + re-declared require, use a require-wrapper or use window.require as + a hack. + */ + // exoticRequireStrings: [], + /* options to pass on to enhanced-resolve, the package dependency-cruiser + uses to resolve module references to disk. You can set most of these + options in a webpack.conf.js - this section is here for those + projects that don't have a separate webpack config file. + + Note: settings in webpack.conf.js override the ones specified here. + */ + enhancedResolveOptions: { + /* List of strings to consider as 'exports' fields in package.json. Use + ['exports'] when you use packages that use such a field and your environment + supports it (e.g. node ^12.19 || >=14.7 or recent versions of webpack). + + If you have an `exportsFields` attribute in your webpack config, that one + will have precedence over the one specified here. + */ + exportsFields: ["exports"], + /* List of conditions to check for in the exports field. e.g. use ['imports'] + if you're only interested in exposed es6 modules, ['require'] for commonjs, + or all conditions at once `(['import', 'require', 'node', 'default']`) + if anything goes for you. Only works when the 'exportsFields' array is + non-empty. + + If you have a 'conditionNames' attribute in your webpack config, that one will + have precedence over the one specified here. + */ + conditionNames: ["import", "require", "node", "default"], + /* + The extensions, by default are the same as the ones dependency-cruiser + can access (run `npx depcruise --info` to see which ones that are in + _your_ environment. If that list is larger than what you need (e.g. + it contains .js, .jsx, .ts, .tsx, .cts, .mts - but you don't use + TypeScript you can pass just the extensions you actually use (e.g. + [".js", ".jsx"]). This can speed up the most expensive step in + dependency cruising (module resolution) quite a bit. + */ + // extensions: [".js", ".jsx", ".ts", ".tsx", ".d.ts"], + /* + If your TypeScript project makes use of types specified in 'types' + fields in package.jsons of external dependencies, specify "types" + in addition to "main" in here, so enhanced-resolve (the resolver + dependency-cruiser uses) knows to also look there. You can also do + this if you're not sure, but still use TypeScript. In a future version + of dependency-cruiser this will likely become the default. + */ + mainFields: ["main", "types"], + }, + reporterOptions: { + dot: { + /* pattern of modules that can be consolidated in the detailed + graphical dependency graph. The default pattern in this configuration + collapses everything in node_modules to one folder deep so you see + the external modules, but not the innards your app depends upon. + */ + collapsePattern: 'node_modules/(@[^/]+/[^/]+|[^/]+)', + + /* Options to tweak the appearance of your graph.See + https://github.com/sverweij/dependency-cruiser/blob/main/doc/options-reference.md#reporteroptions + for details and some examples. If you don't specify a theme + don't worry - dependency-cruiser will fall back to the default one. + */ + // theme: { + // graph: { + // /* use splines: "ortho" for straight lines. Be aware though + // graphviz might take a long time calculating ortho(gonal) + // routings. + // */ + // splines: "true" + // }, + // modules: [ + // { + // criteria: { matchesFocus: true }, + // attributes: { + // fillcolor: "lime", + // penwidth: 2, + // }, + // }, + // { + // criteria: { matchesFocus: false }, + // attributes: { + // fillcolor: "lightgrey", + // }, + // }, + // { + // criteria: { matchesReaches: true }, + // attributes: { + // fillcolor: "lime", + // penwidth: 2, + // }, + // }, + // { + // criteria: { matchesReaches: false }, + // attributes: { + // fillcolor: "lightgrey", + // }, + // }, + // { + // criteria: { source: "^src/model" }, + // attributes: { fillcolor: "#ccccff" } + // }, + // { + // criteria: { source: "^src/view" }, + // attributes: { fillcolor: "#ccffcc" } + // }, + // ], + // dependencies: [ + // { + // criteria: { "rules[0].severity": "error" }, + // attributes: { fontcolor: "red", color: "red" } + // }, + // { + // criteria: { "rules[0].severity": "warn" }, + // attributes: { fontcolor: "orange", color: "orange" } + // }, + // { + // criteria: { "rules[0].severity": "info" }, + // attributes: { fontcolor: "blue", color: "blue" } + // }, + // { + // criteria: { resolved: "^src/model" }, + // attributes: { color: "#0000ff77" } + // }, + // { + // criteria: { resolved: "^src/view" }, + // attributes: { color: "#00770077" } + // } + // ] + // } + }, + archi: { + /* pattern of modules that can be consolidated in the high level + graphical dependency graph. If you use the high level graphical + dependency graph reporter (`archi`) you probably want to tweak + this collapsePattern to your situation. + */ + collapsePattern: '^(packages|src|lib|app|bin|test(s?)|spec(s?))/[^/]+|node_modules/(@[^/]+/[^/]+|[^/]+)', + + /* Options to tweak the appearance of your graph.See + https://github.com/sverweij/dependency-cruiser/blob/main/doc/options-reference.md#reporteroptions + for details and some examples. If you don't specify a theme + for 'archi' dependency-cruiser will use the one specified in the + dot section (see above), if any, and otherwise use the default one. + */ + // theme: { + // }, + }, + "text": { + "highlightFocused": true + }, + } + } +}; +// generated: dependency-cruiser@13.1.1 on 2023-08-02T09:11:55.676Z diff --git a/docs/classes/AVLTree.html b/docs/classes/AVLTree.html index 0aaa78c..8d21ff4 100644 --- a/docs/classes/AVLTree.html +++ b/docs/classes/AVLTree.html @@ -27,7 +27,7 @@

Hierarchy

+
  • Defined in src/data-structures/binary-tree/avl-tree.ts:14
  • @@ -130,7 +130,7 @@
    Optional Returns AVLTree<T>
    +
  • Defined in src/data-structures/binary-tree/bst.ts:17
  • Properties

    @@ -138,61 +138,61 @@
    +
  • Defined in src/data-structures/binary-tree/bst.ts:400
  • _count: number = 0
    +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:197
  • _loopType: LoopType = LoopType.iterative
    +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:141
  • _root: null | BinaryTreeNode<T> = null
    +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:173
  • _size: number = 0
    +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:187
  • _visitedCount: number[] = []
    +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:145
  • _visitedId: number[] = []
    +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:142
  • _visitedLeftSum: number[] = []
    +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:146
  • _visitedNode: BinaryTreeNode<T>[] = []
    +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:144
  • _visitedVal: T[] = []
    +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:143
  • Accessors

    @@ -203,7 +203,7 @@ +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:199
  • set count(v): void
  • @@ -214,7 +214,7 @@
    v:

    Returns void

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:203
  • set root(v): void
  • @@ -234,7 +234,7 @@
    v:

    Returns void

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:179
  • set size(v): void
  • @@ -254,7 +254,7 @@
    v:

    Returns void

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:193
  • Methods

    @@ -270,7 +270,7 @@

    Returns number +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:902
  • The BFS function performs a breadth-first search on a binary tree and returns the results based on a specified node @@ -292,7 +292,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:904
  • The BFS function performs a breadth-first search on a binary tree and returns the results based on a specified node @@ -314,7 +314,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:906
  • The BFS function performs a breadth-first search on a binary tree and returns the results based on a specified node @@ -336,7 +336,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:908
  • The BFS function performs a breadth-first search on a binary tree and returns the results based on a specified node @@ -358,7 +358,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:910
  • The DFS function performs a depth-first search traversal on a binary tree and returns the results based on the @@ -401,7 +401,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:940
  • The DFS function performs a depth-first search traversal on a binary tree and returns the results based on the @@ -430,7 +430,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:942
  • The DFS function performs a depth-first search traversal on a binary tree and returns the results based on the @@ -459,7 +459,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:944
  • The DFS function performs a depth-first search traversal on a binary tree and returns the results based on the @@ -488,7 +488,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:946
  • Time complexity is O(n) @@ -520,7 +520,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:990
  • Time complexity is O(n) @@ -539,7 +539,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:992
  • Time complexity is O(n) @@ -558,7 +558,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:994
  • Time complexity is O(n) @@ -577,7 +577,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:996
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1356
  • +
  • Defined in src/data-structures/binary-tree/bst.ts:402
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1385
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1319
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1295
  • +
  • Defined in src/data-structures/binary-tree/bst.ts:276
  • +
  • Defined in src/data-structures/binary-tree/bst.ts:322
  • +
  • Defined in src/data-structures/binary-tree/avl-tree.ts:64
  • +
  • Defined in src/data-structures/binary-tree/avl-tree.ts:126
  • +
  • Defined in src/data-structures/binary-tree/avl-tree.ts:156
  • +
  • Defined in src/data-structures/binary-tree/avl-tree.ts:95
  • +
  • Defined in src/data-structures/binary-tree/avl-tree.ts:239
  • +
  • Defined in src/data-structures/binary-tree/avl-tree.ts:204
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:226
  • +
  • Defined in src/data-structures/binary-tree/avl-tree.ts:16
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:389
  • +
  • Defined in src/data-structures/binary-tree/bst.ts:111
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:447
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:464
  • The getLeftMost function returns the leftmost node in a binary tree, either recursively or iteratively using tail @@ -1028,7 +1028,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:653
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:513
  • +
  • Defined in src/data-structures/binary-tree/bst.ts:170
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:641
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1170
  • The getRightMost function returns the rightmost node in a binary tree, either recursively or iteratively using @@ -1165,7 +1165,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:688
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:766
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:616
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:342
  • +
  • Defined in src/data-structures/binary-tree/bst.ts:358
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:729
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:561
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:237
  • +
  • Defined in src/data-structures/binary-tree/bst.ts:116
  • +
  • Defined in src/data-structures/binary-tree/bst.ts:211
  • The levelIterative function performs a level-order traversal on a binary tree and returns the values of the nodes @@ -1386,7 +1386,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1049
  • The levelIterative function performs a level-order traversal on a binary tree and returns the values of the nodes @@ -1415,7 +1415,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1051
  • The levelIterative function performs a level-order traversal on a binary tree and returns the values of the nodes @@ -1444,7 +1444,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1053
  • The levelIterative function performs a level-order traversal on a binary tree and returns the values of the nodes @@ -1473,7 +1473,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1055
  • The listLevels function collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1521,7 +1521,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1095
  • The listLevels function collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1547,7 +1547,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1097
  • The listLevels function collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1573,7 +1573,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1099
  • The listLevels function collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1599,7 +1599,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1101
  • The morris function performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris @@ -1644,7 +1644,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1186
  • The morris function performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris @@ -1673,7 +1673,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1188
  • The morris function performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris @@ -1702,7 +1702,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1190
  • The morris function performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris @@ -1731,7 +1731,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1192
  • +
  • Defined in src/data-structures/binary-tree/avl-tree.ts:32
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:249
  • +
  • Defined in src/data-structures/binary-tree/avl-tree.ts:48
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:861
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:805
  • +
  • Defined in src/data-structures/binary-tree/avl-tree.ts:77
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:116
  • Returns void

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:51
  • set weight(v): void
  • @@ -113,7 +113,7 @@

    Parameters

    v: number
  • Returns void

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:41
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:163
    • @@ -243,7 +243,7 @@

      Returns boolean

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:94
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:148
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:511
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:385
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:150
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:152
    • @@ -389,7 +389,7 @@
      costspredecessor: (null | V)[][]
    +
  • Defined in src/data-structures/graph/abstract-graph.ts:734
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:202
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:106
    • @@ -446,7 +446,7 @@

      Parameters

      edge: E

    Returns null | [V, V]

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:618
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:260
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:317
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:191
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:238
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:72
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:84
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:140
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:63
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:61
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:128
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:181
    • @@ -770,7 +770,7 @@
      dfnMaplowMap: Map<V, number>
    +
  • Defined in src/data-structures/graph/abstract-graph.ts:794
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:102
  • Returns void

    +
  • Defined in src/data-structures/graph/abstract-graph.ts:20
  • +
  • Defined in src/data-structures/queue/deque.ts:186
    • @@ -152,7 +152,7 @@

      Returns boolean

    +
  • Defined in src/data-structures/queue/deque.ts:205
  • +
  • Defined in src/data-structures/queue/deque.ts:132
  • +
  • Defined in src/data-structures/queue/deque.ts:105
  • +
  • Defined in src/data-structures/queue/deque.ts:141
  • +
  • Defined in src/data-structures/queue/deque.ts:149
  • +
  • Defined in src/data-structures/queue/deque.ts:122
  • +
  • Defined in src/data-structures/queue/deque.ts:113
  • +
  • Defined in src/data-structures/queue/deque.ts:196
  • +
  • Defined in src/data-structures/queue/deque.ts:172
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:938
  • The DFS function performs a depth-first search traversal on a binary tree and returns the results based on the @@ -396,7 +396,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:940
  • The DFS function performs a depth-first search traversal on a binary tree and returns the results based on the @@ -425,7 +425,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:942
  • The DFS function performs a depth-first search traversal on a binary tree and returns the results based on the @@ -454,7 +454,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:944
  • The DFS function performs a depth-first search traversal on a binary tree and returns the results based on the @@ -483,7 +483,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:946
    • @@ -496,7 +496,7 @@

      Returns number

    +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:988
  • Time complexity is O(n) @@ -515,7 +515,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:990
  • Time complexity is O(n) @@ -534,7 +534,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:992
  • Time complexity is O(n) @@ -553,7 +553,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:994
  • Time complexity is O(n) @@ -572,7 +572,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:996
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1356
    • @@ -615,7 +615,7 @@
      a:
      b: number

    Returns CP

    +
  • Defined in src/data-structures/binary-tree/bst.ts:402
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1385
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1319
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1295
  • Returns boolean

    +
  • Defined in src/data-structures/binary-tree/bst.ts:276
  • +
  • Defined in src/data-structures/binary-tree/bst.ts:322
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:226
  • +
  • Defined in src/data-structures/binary-tree/bst.ts:30
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:389
  • +
  • Defined in src/data-structures/binary-tree/bst.ts:111
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:447
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:464
  • The getLeftMost function returns the leftmost node in a binary tree, either recursively or iteratively using tail @@ -903,7 +903,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:653
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:513
  • +
  • Defined in src/data-structures/binary-tree/bst.ts:170
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:641
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1170
  • The getRightMost function returns the rightmost node in a binary tree, either recursively or iteratively using @@ -1040,7 +1040,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:688
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:766
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:616
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:342
  • +
  • Defined in src/data-structures/binary-tree/bst.ts:358
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:729
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:561
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:237
  • +
  • Defined in src/data-structures/binary-tree/bst.ts:116
  • Returns number

    +
  • Defined in src/data-structures/binary-tree/bst.ts:211
  • The levelIterative function performs a level-order traversal on a binary tree and returns the values of the nodes @@ -1258,7 +1258,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1049
  • The levelIterative function performs a level-order traversal on a binary tree and returns the values of the nodes @@ -1287,7 +1287,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1051
  • The levelIterative function performs a level-order traversal on a binary tree and returns the values of the nodes @@ -1316,7 +1316,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1053
  • The levelIterative function performs a level-order traversal on a binary tree and returns the values of the nodes @@ -1345,7 +1345,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1055
  • The listLevels function collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1393,7 +1393,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1095
  • The listLevels function collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1419,7 +1419,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1097
  • The listLevels function collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1445,7 +1445,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1099
  • The listLevels function collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1471,7 +1471,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1101
  • The morris function performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris @@ -1516,7 +1516,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1186
  • The morris function performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris @@ -1545,7 +1545,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1188
  • The morris function performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris @@ -1574,7 +1574,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1190
  • The morris function performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris @@ -1603,7 +1603,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1192
  • +
  • Defined in src/data-structures/binary-tree/bst.ts:46
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:249
  • +
  • Defined in src/data-structures/binary-tree/bst.ts:122
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:861
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:805
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:116
  • +
  • Defined in src/data-structures/binary-tree/binary-indexed-tree.ts:38
    • @@ -119,7 +119,7 @@

      Returns number

    +
  • Defined in src/data-structures/binary-tree/binary-indexed-tree.ts:55
  • +
  • Defined in src/data-structures/binary-tree/binary-indexed-tree.ts:24
    • @@ -159,7 +159,7 @@

      Parameters

      x: number

    Returns number

    +
  • Defined in src/data-structures/binary-tree/binary-indexed-tree.ts:12
  • Returns void

    +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:179
  • set size(v): void
  • @@ -245,7 +245,7 @@

    Parameters

    v: number
  • Returns void

    +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:193
  • Methods

    @@ -260,7 +260,7 @@

    Returns number +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:902
  • The BFS function performs a breadth-first search on a binary tree and returns the results based on a specified node @@ -281,7 +281,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:904
  • The BFS function performs a breadth-first search on a binary tree and returns the results based on a specified node @@ -302,7 +302,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:906
  • The BFS function performs a breadth-first search on a binary tree and returns the results based on a specified node @@ -323,7 +323,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:908
  • The BFS function performs a breadth-first search on a binary tree and returns the results based on a specified node @@ -344,7 +344,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:910
  • The DFS function performs a depth-first search traversal on a binary tree and returns the results based on the @@ -385,7 +385,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:940
  • The DFS function performs a depth-first search traversal on a binary tree and returns the results based on the @@ -413,7 +413,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:942
  • The DFS function performs a depth-first search traversal on a binary tree and returns the results based on the @@ -441,7 +441,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:944
  • The DFS function performs a depth-first search traversal on a binary tree and returns the results based on the @@ -469,7 +469,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:946
  • Time complexity is O(n) @@ -499,7 +499,7 @@

    Optional Returns number[]
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:990
  • Time complexity is O(n) @@ -517,7 +517,7 @@

    Optional Returns T[]
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:992
  • Time complexity is O(n) @@ -535,7 +535,7 @@

    Optional Returns BinaryTreeNode<T>[]
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:994
  • Time complexity is O(n) @@ -553,7 +553,7 @@

    Optional Returns number[]
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:996
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1356
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1385
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1319
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1295
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:226
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:219
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:389
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:629
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:447
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:464
  • The getLeftMost function returns the leftmost node in a binary tree, either recursively or iteratively using tail @@ -832,7 +832,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:653
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:513
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:577
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:641
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1170
  • The getRightMost function returns the rightmost node in a binary tree, either recursively or iteratively using @@ -963,7 +963,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:688
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:766
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:616
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:342
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:729
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:561
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:237
  • The levelIterative function performs a level-order traversal on a binary tree and returns the values of the nodes @@ -1142,7 +1142,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1049
  • The levelIterative function performs a level-order traversal on a binary tree and returns the values of the nodes @@ -1170,7 +1170,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1051
  • The levelIterative function performs a level-order traversal on a binary tree and returns the values of the nodes @@ -1198,7 +1198,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1053
  • The levelIterative function performs a level-order traversal on a binary tree and returns the values of the nodes @@ -1226,7 +1226,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1055
  • The listLevels function collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1272,7 +1272,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1095
  • The listLevels function collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1297,7 +1297,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1097
  • The listLevels function collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1322,7 +1322,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1099
  • The listLevels function collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1347,7 +1347,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1101
  • The morris function performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris @@ -1390,7 +1390,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1186
  • The morris function performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris @@ -1418,7 +1418,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1188
  • The morris function performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris @@ -1446,7 +1446,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1190
  • The morris function performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris @@ -1474,7 +1474,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1192
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:293
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:249
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:405
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:861
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:805
  • Returns void

    +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:102
  • set familyPosition(v): void
  • @@ -167,7 +167,7 @@

    Parameters

    v: FamilyPosition
  • Returns void

    +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:92
  • set height(v): void
  • @@ -185,7 +185,7 @@

    Parameters

    v: number
  • Returns void

    +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:112
  • set id(v): void
  • @@ -203,7 +203,7 @@

    Parameters

    v: number
  • Returns void

    +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:34
  • set left(v): void
  • @@ -221,7 +221,7 @@

    Parameters

    v: undefined | null | BinaryTreeNode<T>
  • Returns void

    +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:54
  • set parent(v): void
  • @@ -239,7 +239,7 @@

    Parameters

    v: undefined | null | BinaryTreeNode<T>
  • Returns void

    +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:82
  • set right(v): void
  • @@ -257,7 +257,7 @@

    Parameters

    v: undefined | null | BinaryTreeNode<T>
  • Returns void

    +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:68
  • set val(v): void
  • @@ -275,7 +275,7 @@

    Parameters

    v: T
  • Returns void

    +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:44
  • Methods

    @@ -285,7 +285,7 @@
    +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:135
  • Returns BinaryTreeNode<T>

    +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:116
  • +
  • Defined in src/data-structures/matrix/navigator.ts:9
  • +
  • Defined in src/data-structures/hash/coordinate-map.ts:20
    • @@ -288,7 +288,7 @@

      Returns

    +
  • Defined in src/data-structures/hash/coordinate-map.ts:32
    • diff --git a/docs/classes/CoordinateSet.html b/docs/classes/CoordinateSet.html index f372c41..a58b6a5 100644 --- a/docs/classes/CoordinateSet.html +++ b/docs/classes/CoordinateSet.html @@ -28,7 +28,7 @@

      Hierarchy

      • CoordinateSet
    +
  • Defined in src/data-structures/hash/coordinate-set.ts:5
  • @@ -72,7 +72,7 @@
    Optional Returns CoordinateSet
    +
  • Defined in src/data-structures/hash/coordinate-set.ts:8
  • Properties

    @@ -85,7 +85,7 @@
    _joint: string = '_'
    +
  • Defined in src/data-structures/hash/coordinate-set.ts:6
  • size: number
    @@ -137,7 +137,7 @@

    Returns

    +
  • Defined in src/data-structures/hash/coordinate-set.ts:31
  • +
  • Defined in src/data-structures/hash/coordinate-set.ts:42
  • +
  • Defined in src/data-structures/hash/coordinate-set.ts:20
    • diff --git a/docs/classes/Deque.html b/docs/classes/Deque.html index dc72f87..37cdb81 100644 --- a/docs/classes/Deque.html +++ b/docs/classes/Deque.html @@ -27,7 +27,7 @@

      Hierarchy

      • Deque
    +
  • Defined in src/data-structures/queue/deque.ts:9
  • @@ -79,7 +79,7 @@ +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:23
  • set size(v): void
  • @@ -90,7 +90,7 @@
    v:

    Returns void

  • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:27
  • Methods

    @@ -114,7 +114,7 @@

    Returns null +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:184
  • Returns the node at the specified index of the linked list. @@ -138,7 +138,7 @@

    Returns null

  • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:185
  • Returns the node at the specified index of the linked list. @@ -162,7 +162,7 @@

    Returns null

  • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:186
  • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:248
  • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:238
  • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:37
  • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:57
  • The peekFirst function returns the first node or value in a doubly linked list, depending on the specified @@ -276,7 +276,7 @@

    Returns null

  • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:72
  • The peekFirst function returns the first node or value in a doubly linked list, depending on the specified @@ -297,7 +297,7 @@

    Returns null

  • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:73
  • The peekLast function returns the last node or value in a doubly linked list.

    @@ -330,7 +330,7 @@

    Returns null

  • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:94
  • The peekLast function returns the last node or value in a doubly linked list.

    @@ -350,7 +350,7 @@

    Returns null

  • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:95
  • The function pollFirst removes and returns the first element of a doubly linked list, either as a node or its @@ -389,7 +389,7 @@

    Returns null

  • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:115
  • The function pollFirst removes and returns the first element of a doubly linked list, either as a node or its @@ -412,7 +412,7 @@

    Returns null

  • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:116
  • The function pollLast removes and returns the last element in a doubly linked list, either as a node or its value, @@ -451,7 +451,7 @@

    Returns null

  • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:150
  • The function pollLast removes and returns the last element in a doubly linked list, either as a node or its value, @@ -474,7 +474,7 @@

    Returns null

  • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:151
  • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:273
  • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:229
  • Returns void

    +
  • Defined in src/data-structures/graph/directed-graph.ts:27
  • set weight(v): void
  • @@ -160,7 +160,7 @@
    v:

    Returns void

  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:41
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:114
    • @@ -226,7 +226,7 @@
      preMap
    +
  • Defined in src/data-structures/graph/abstract-graph.ts:636
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:163
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:94
  • +
  • Defined in src/data-structures/graph/directed-graph.ts:226
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:511
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:385
  • +
  • Defined in src/data-structures/graph/directed-graph.ts:379
  • +
  • Defined in src/data-structures/graph/directed-graph.ts:253
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:734
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:202
  • +
  • Defined in src/data-structures/graph/directed-graph.ts:282
  • +
  • Defined in src/data-structures/graph/directed-graph.ts:61
  • +
  • Defined in src/data-structures/graph/directed-graph.ts:271
  • +
  • Defined in src/data-structures/graph/directed-graph.ts:262
  • +
  • Defined in src/data-structures/graph/directed-graph.ts:416
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:260
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:317
  • +
  • Defined in src/data-structures/graph/directed-graph.ts:393
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:238
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:72
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:84
  • +
  • Defined in src/data-structures/graph/directed-graph.ts:235
  • +
  • Defined in src/data-structures/graph/directed-graph.ts:199
  • +
  • Defined in src/data-structures/graph/directed-graph.ts:244
  • +
  • Defined in src/data-structures/graph/directed-graph.ts:213
  • +
  • Defined in src/data-structures/graph/directed-graph.ts:189
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:140
  • +
  • Defined in src/data-structures/graph/directed-graph.ts:161
  • +
  • Defined in src/data-structures/graph/directed-graph.ts:125
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:128
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:181
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:794
  • +
  • Defined in src/data-structures/graph/directed-graph.ts:307
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:102
  • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:37
    • @@ -253,7 +253,7 @@

      Returns boolean

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:57
    • @@ -267,7 +267,7 @@

      Returns null

    +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:71
  • The peekFirst function returns the first node or value in a doubly linked list, depending on the specified @@ -287,7 +287,7 @@

    Returns null

  • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:72
  • The peekFirst function returns the first node or value in a doubly linked list, depending on the specified @@ -307,7 +307,7 @@

    Returns null

  • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:73
  • The peekLast function returns the last node or value in a doubly linked list.

    @@ -338,7 +338,7 @@

    Returns null

  • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:94
  • The peekLast function returns the last node or value in a doubly linked list.

    @@ -357,7 +357,7 @@

    Returns null

  • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:95
  • The function pollFirst removes and returns the first element of a doubly linked list, either as a node or its @@ -394,7 +394,7 @@

    Returns null

  • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:115
  • The function pollFirst removes and returns the first element of a doubly linked list, either as a node or its @@ -416,7 +416,7 @@

    Returns null

  • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:116
  • The function pollLast removes and returns the last element in a doubly linked list, either as a node or its value, @@ -453,7 +453,7 @@

    Returns null

  • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:150
  • The function pollLast removes and returns the last element in a doubly linked list, either as a node or its value, @@ -475,7 +475,7 @@

    Returns null

  • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:151
  • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:273
  • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:229
  • +
  • Defined in src/data-structures/linked-list/doubly-linked-list.ts:8
  • +
  • Defined in src/data-structures/heap/heap.ts:10
  • Accessors

    @@ -122,7 +122,7 @@

    Returns number

    +
  • Defined in src/data-structures/heap/heap.ts:33
  • Methods

    @@ -135,7 +135,7 @@
    +
  • Defined in src/data-structures/heap/heap.ts:119
  • +
  • Defined in src/data-structures/heap/heap.ts:41
  • +
  • Defined in src/data-structures/heap/heap.ts:71
  • +
  • Defined in src/data-structures/heap/heap.ts:49
  • +
  • Defined in src/data-structures/heap/heap.ts:57
  • +
  • Defined in src/data-structures/heap/heap.ts:100
  • +
  • Defined in src/data-structures/heap/heap.ts:112
  • +
  • Defined in src/data-structures/matrix/matrix2d.ts:63
    • @@ -123,7 +123,7 @@

      Returns number

    +
  • Defined in src/data-structures/matrix/matrix2d.ts:33
  • +
  • Defined in src/data-structures/matrix/matrix2d.ts:41
  • Methods

    @@ -162,7 +162,7 @@

    Returns

    +
  • Defined in src/data-structures/matrix/matrix2d.ts:73
  • +
  • Defined in src/data-structures/matrix/matrix2d.ts:106
  • +
  • Defined in src/data-structures/matrix/matrix2d.ts:126
  • +
  • Defined in src/data-structures/matrix/matrix2d.ts:142
  • +
  • Defined in src/data-structures/matrix/matrix2d.ts:181
  • +
  • Defined in src/data-structures/matrix/matrix2d.ts:172
  • +
  • Defined in src/data-structures/matrix/matrix2d.ts:90
  • +
  • Defined in src/data-structures/matrix/matrix2d.ts:197
  • +
  • Defined in src/data-structures/matrix/matrix2d.ts:154
  • +
  • Defined in src/data-structures/heap/max-heap.ts:15
  • _priorityCb: ((element) => number)
    @@ -110,7 +110,7 @@
    element: Returns number
    +
  • Defined in src/data-structures/heap/heap.ts:10
  • Accessors

    @@ -125,7 +125,7 @@

    Returns number

    +
  • Defined in src/data-structures/heap/heap.ts:33
  • Methods

    @@ -139,7 +139,7 @@

    Returns void

    +
  • Defined in src/data-structures/heap/heap.ts:119
  • +
  • Defined in src/data-structures/heap/heap.ts:41
  • +
  • Defined in src/data-structures/heap/heap.ts:71
  • +
  • Defined in src/data-structures/heap/heap.ts:49
  • +
  • Defined in src/data-structures/heap/heap.ts:57
  • +
  • Defined in src/data-structures/heap/heap.ts:100
  • +
  • Defined in src/data-structures/heap/heap.ts:112
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:210
  • nodes: T[] = []
    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:8
  • Accessors

    @@ -123,7 +123,7 @@
    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:26
  • Methods

    @@ -148,7 +148,7 @@

    Returns (

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:181
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:223
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:325
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:281
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:262
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:253
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:271
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:312
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:299
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:244
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:232
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:111
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:129
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:104
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:138
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:94
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:59
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:69
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:77
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:165
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:119
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:37
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:50
  • +
  • Defined in src/data-structures/heap/min-heap.ts:15
  • _priorityCb: ((element) => number)
    @@ -111,7 +111,7 @@
    element: Returns number
    +
  • Defined in src/data-structures/heap/heap.ts:10
  • Accessors

    @@ -126,7 +126,7 @@

    Returns number

    +
  • Defined in src/data-structures/heap/heap.ts:33
  • Methods

    @@ -140,7 +140,7 @@

    Returns void

    +
  • Defined in src/data-structures/heap/heap.ts:119
  • +
  • Defined in src/data-structures/heap/heap.ts:41
  • +
  • Defined in src/data-structures/heap/heap.ts:71
  • +
  • Defined in src/data-structures/heap/heap.ts:49
  • +
  • Defined in src/data-structures/heap/heap.ts:57
  • +
  • Defined in src/data-structures/heap/heap.ts:100
  • +
  • Defined in src/data-structures/heap/heap.ts:112
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:210
  • nodes: T[] = []
    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:8
  • Accessors

    @@ -123,7 +123,7 @@
    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:26
  • Methods

    @@ -148,7 +148,7 @@

    Returns (

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:181
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:223
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:325
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:281
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:262
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:253
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:271
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:312
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:299
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:244
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:232
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:111
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:129
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:104
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:138
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:94
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:59
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:69
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:77
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:165
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:119
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:37
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:50
  • Returns Navigator<T>

    +
  • Defined in src/data-structures/matrix/navigator.ts:37
  • Properties

    _VISITED: T
    +
  • Defined in src/data-structures/matrix/navigator.ts:30
  • _character: Character
    +
  • Defined in src/data-structures/matrix/navigator.ts:29
  • _cur: [number, number]
    +
  • Defined in src/data-structures/matrix/navigator.ts:28
  • _matrix: T[][]
    +
  • Defined in src/data-structures/matrix/navigator.ts:27
  • onMove: ((cur) => void)
    @@ -115,7 +142,7 @@

    Parameters

    cur: [number, number]

    Returns void

    +
  • Defined in src/data-structures/matrix/navigator.ts:26
  • Methods

    @@ -138,7 +165,7 @@

    Returns boolean

    +
  • Defined in src/data-structures/matrix/navigator.ts:77
  • +
  • Defined in src/data-structures/matrix/navigator.ts:107
  • +
  • Defined in src/data-structures/matrix/navigator.ts:60
  • +
  • Defined in src/data-structures/queue/deque.ts:17
  • _size: number = 0
    +
  • Defined in src/data-structures/queue/deque.ts:21
  • Methods

    @@ -121,7 +121,7 @@

    Parameters

    index: number

    Returns null | NonNullable<T>

    +
  • Defined in src/data-structures/queue/deque.ts:82
  • +
  • Defined in src/data-structures/queue/deque.ts:86
    • @@ -142,7 +142,7 @@

      Parameters

      value: T

    Returns void

    +
  • Defined in src/data-structures/queue/deque.ts:31
    • @@ -155,7 +155,7 @@

      Parameters

      value: T

    Returns void

    +
  • Defined in src/data-structures/queue/deque.ts:43
  • +
  • Defined in src/data-structures/queue/deque.ts:64
  • +
  • Defined in src/data-structures/queue/deque.ts:78
  • +
  • Defined in src/data-structures/queue/deque.ts:55
  • +
  • Defined in src/data-structures/queue/deque.ts:68
  • +
  • Defined in src/data-structures/queue/deque.ts:27
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:223
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:325
    • @@ -205,7 +205,7 @@

      Returns number

    +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:281
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:262
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:253
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:271
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:312
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:299
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:244
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:232
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:111
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:129
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:104
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:138
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:94
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:59
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:69
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:77
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:165
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:119
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:37
  • +
  • Defined in src/data-structures/priority-queue/priority-queue.ts:50
  • +
  • Defined in src/data-structures/queue/queue.ts:93
    • @@ -155,7 +155,7 @@

      Returns

    +
  • Defined in src/data-structures/queue/queue.ts:38
  • +
  • Defined in src/data-structures/queue/queue.ts:68
  • +
  • Defined in src/data-structures/queue/queue.ts:77
  • +
  • Defined in src/data-structures/queue/queue.ts:48
  • +
  • Defined in src/data-structures/queue/queue.ts:85
  • +
  • Defined in src/data-structures/queue/queue.ts:101
  • +
  • Defined in src/data-structures/queue/queue.ts:29
  • Returns SegmentTreeNode

    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:97
    • @@ -129,7 +129,7 @@
      indexA: indexB: number

    Returns number

    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:139
    • @@ -146,7 +146,7 @@
      sum: Optional val: number

    Returns void

    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:110
  • Returns void

    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:32
  • set left(v): void
  • @@ -138,7 +138,7 @@

    Parameters

    v: null | SegmentTreeNode
  • Returns void

    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:62
  • set right(v): void
  • @@ -156,7 +156,7 @@

    Parameters

    v: null | SegmentTreeNode
  • Returns void

    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:72
  • set start(v): void
  • @@ -174,7 +174,7 @@

    Parameters

    v: number
  • Returns void

    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:22
  • set sum(v): void
  • @@ -192,7 +192,7 @@

    Parameters

    v: number
  • Returns void

    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:52
  • set val(v): void
  • @@ -210,7 +210,7 @@

    Parameters

    v: null | number
  • Returns void

    +
  • Defined in src/data-structures/binary-tree/segment-tree.ts:42
  • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:99
  • size: number
    @@ -121,7 +121,7 @@
    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:103
  • tail: null | SinglyLinkedListNode<NodeData>
    @@ -129,7 +129,7 @@
    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:101
  • Accessors

    @@ -142,7 +142,7 @@
    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:118
  • Methods

    @@ -157,7 +157,7 @@
    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:754
  • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:263
  • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:555
  • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:669
  • Returns undefined | NodeData

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:228
  • Returns number

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:245
  • Returns undefined | SinglyLinkedListNode<NodeData>

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:211
  • Returns undefined | {
        index: number;
        node:
    SinglyLinkedListNode<NodeData>;
    }

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:179
  • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:623
  • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:141
  • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:153
  • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:484
  • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:324
  • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:400
  • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:649
  • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:533
  • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:518
  • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:298
  • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:285
  • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:692
  • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:386
  • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:764
  • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:351
  • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:601
  • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:507
  • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:575
  • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:423
  • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:732
  • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:743
  • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:130
  • Returns SinglyLinkedListNode<NodeData>

    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:13
  • Properties

    @@ -106,7 +106,7 @@
    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:21
  • next: null | SinglyLinkedListNode<NodeData>
    @@ -114,7 +114,7 @@
    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:19
  • prev: null | SinglyLinkedListNode<NodeData>
    @@ -122,7 +122,7 @@
    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:17
  • val: NodeData
    @@ -130,7 +130,7 @@
    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:15
  • Accessors

    @@ -145,7 +145,7 @@
    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:41
  • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:31
  • Methods

    @@ -181,7 +181,7 @@
    val: Returns SinglyLinkedList<NodeData>
    +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:68
  • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:55
  • +
  • Defined in src/data-structures/linked-list/singly-linked-list.ts:80
  • +
  • Defined in src/data-structures/stack/stack.ts:33
    • @@ -140,7 +140,7 @@

      Returns null

    +
  • Defined in src/data-structures/stack/stack.ts:49
  • +
  • Defined in src/data-structures/stack/stack.ts:70
  • +
  • Defined in src/data-structures/stack/stack.ts:60
  • +
  • Defined in src/data-structures/stack/stack.ts:41
  • +
  • Defined in src/data-structures/stack/stack.ts:80
  • +
  • Defined in src/data-structures/stack/stack.ts:25
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:902
  • The BFS function performs a breadth-first search on a binary tree and returns the results based on a specified node @@ -285,7 +285,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:904
  • The BFS function performs a breadth-first search on a binary tree and returns the results based on a specified node @@ -307,7 +307,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:906
  • The BFS function performs a breadth-first search on a binary tree and returns the results based on a specified node @@ -329,7 +329,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:908
  • The BFS function performs a breadth-first search on a binary tree and returns the results based on a specified node @@ -351,7 +351,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:910
    • @@ -365,7 +365,7 @@

      Returns number

    +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:938
  • The DFS function performs a depth-first search traversal on a binary tree and returns the results based on the @@ -394,7 +394,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:940
  • The DFS function performs a depth-first search traversal on a binary tree and returns the results based on the @@ -423,7 +423,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:942
  • The DFS function performs a depth-first search traversal on a binary tree and returns the results based on the @@ -452,7 +452,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:944
  • The DFS function performs a depth-first search traversal on a binary tree and returns the results based on the @@ -481,7 +481,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:946
  • Time complexity is O(n) @@ -513,7 +513,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:990
  • Time complexity is O(n) @@ -532,7 +532,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:992
  • Time complexity is O(n) @@ -551,7 +551,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:994
  • Time complexity is O(n) @@ -570,7 +570,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:996
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1356
  • +
  • Defined in src/data-structures/binary-tree/bst.ts:402
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1385
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1319
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1295
  • +
  • Defined in src/data-structures/binary-tree/bst.ts:276
  • +
  • Defined in src/data-structures/binary-tree/bst.ts:322
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:226
  • +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:9
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:389
  • +
  • Defined in src/data-structures/binary-tree/bst.ts:111
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:447
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:464
  • The getLeftMost function returns the leftmost node in a binary tree, either recursively or iteratively using tail @@ -904,7 +904,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:653
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:513
  • +
  • Defined in src/data-structures/binary-tree/bst.ts:170
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:641
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1170
  • The getRightMost function returns the rightmost node in a binary tree, either recursively or iteratively using @@ -1041,7 +1041,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:688
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:766
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:616
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:342
  • +
  • Defined in src/data-structures/binary-tree/bst.ts:358
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:729
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:561
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:237
  • +
  • Defined in src/data-structures/binary-tree/bst.ts:116
  • +
  • Defined in src/data-structures/binary-tree/bst.ts:211
  • The levelIterative function performs a level-order traversal on a binary tree and returns the values of the nodes @@ -1262,7 +1262,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1049
  • The levelIterative function performs a level-order traversal on a binary tree and returns the values of the nodes @@ -1291,7 +1291,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1051
  • The levelIterative function performs a level-order traversal on a binary tree and returns the values of the nodes @@ -1320,7 +1320,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1053
  • The levelIterative function performs a level-order traversal on a binary tree and returns the values of the nodes @@ -1349,7 +1349,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1055
  • The listLevels function collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1397,7 +1397,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1095
  • The listLevels function collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1423,7 +1423,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1097
  • The listLevels function collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1449,7 +1449,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1099
  • The listLevels function collects nodes from a binary tree by a specified property and organizes them into levels.

    @@ -1475,7 +1475,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1101
  • The morris function performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris @@ -1520,7 +1520,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1186
  • The morris function performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris @@ -1549,7 +1549,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1188
  • The morris function performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris @@ -1578,7 +1578,7 @@

    Returns

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1190
  • The morris function performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris @@ -1607,7 +1607,7 @@

    Returns number

  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:1192
  • +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:13
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:249
  • +
  • Defined in src/data-structures/binary-tree/tree-multiset.ts:17
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:861
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:805
  • Returns void

    +
  • Defined in src/data-structures/trie/trie.ts:59
  • Methods

    @@ -113,7 +113,7 @@

    Returns string

    +
  • Defined in src/data-structures/trie/trie.ts:193
  • +
  • Defined in src/data-structures/trie/trie.ts:175
    • @@ -140,7 +140,7 @@

      Parameters

      input: string

    Returns boolean

    +
  • Defined in src/data-structures/trie/trie.ts:77
  • +
  • Defined in src/data-structures/trie/trie.ts:125
  • +
  • Defined in src/data-structures/trie/trie.ts:156
  • +
  • Defined in src/data-structures/trie/trie.ts:140
    • @@ -214,7 +214,7 @@

      Parameters

      word: string

    Returns boolean

    +
  • Defined in src/data-structures/trie/trie.ts:63
    • @@ -227,7 +227,7 @@

      Parameters

      word: string

    Returns boolean

    +
  • Defined in src/data-structures/trie/trie.ts:87
  • Returns void

    +
  • Defined in src/data-structures/trie/trie.ts:20
  • set isEnd(v): void
  • @@ -117,7 +117,7 @@

    Parameters

    v: boolean
  • Returns void

    +
  • Defined in src/data-structures/trie/trie.ts:30
  • set val(v): void
  • @@ -135,7 +135,7 @@

    Parameters

    v: string
  • Returns void

    +
  • Defined in src/data-structures/trie/trie.ts:38
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:41
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:114
    • @@ -206,7 +206,7 @@
      preMap
    +
  • Defined in src/data-structures/graph/abstract-graph.ts:636
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:163
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:94
  • +
  • Defined in src/data-structures/graph/undirected-graph.ts:127
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:511
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:385
  • +
  • Defined in src/data-structures/graph/undirected-graph.ts:156
  • +
  • Defined in src/data-structures/graph/undirected-graph.ts:143
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:734
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:202
  • +
  • Defined in src/data-structures/graph/undirected-graph.ts:47
  • +
  • Defined in src/data-structures/graph/undirected-graph.ts:172
  • +
  • Defined in src/data-structures/graph/undirected-graph.ts:209
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:260
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:317
  • +
  • Defined in src/data-structures/graph/undirected-graph.ts:186
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:238
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:72
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:84
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:140
  • +
  • Defined in src/data-structures/graph/undirected-graph.ts:116
  • +
  • Defined in src/data-structures/graph/undirected-graph.ts:90
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:128
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:181
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:794
  • +
  • Defined in src/data-structures/graph/abstract-graph.ts:102
  • +
  • Defined in src/data-structures/matrix/vector2d.ts:17
    • @@ -132,7 +132,7 @@

      Returns number

    +
  • Defined in src/data-structures/matrix/vector2d.ts:25
    • @@ -144,7 +144,7 @@

      Returns number

    +
  • Defined in src/data-structures/matrix/vector2d.ts:33
  • +
  • Defined in src/data-structures/matrix/vector2d.ts:42
  • Methods

    @@ -170,7 +170,7 @@
    +
  • Defined in src/data-structures/matrix/vector2d.ts:307
  • +
  • Defined in src/data-structures/matrix/vector2d.ts:200
  • +
  • Defined in src/data-structures/matrix/vector2d.ts:56
  • +
  • Defined in src/data-structures/matrix/vector2d.ts:285
  • +
  • Defined in src/data-structures/matrix/vector2d.ts:241
  • +
  • Defined in src/data-structures/matrix/vector2d.ts:255
  • +
  • Defined in src/data-structures/matrix/vector2d.ts:108
  • +
  • Defined in src/data-structures/matrix/vector2d.ts:211
  • +
  • Defined in src/data-structures/matrix/vector2d.ts:119
  • +
  • Defined in src/data-structures/matrix/vector2d.ts:133
  • +
  • Defined in src/data-structures/matrix/vector2d.ts:96
  • +
  • Defined in src/data-structures/matrix/vector2d.ts:148
  • +
  • Defined in src/data-structures/matrix/vector2d.ts:178
  • +
  • Defined in src/data-structures/matrix/vector2d.ts:298
  • +
  • Defined in src/data-structures/matrix/vector2d.ts:188
  • +
  • Defined in src/data-structures/matrix/vector2d.ts:270
  • +
  • Defined in src/data-structures/matrix/vector2d.ts:71
  • +
  • Defined in src/data-structures/matrix/vector2d.ts:84
  • +
  • Defined in src/data-structures/matrix/vector2d.ts:165
  • +
  • Defined in src/data-structures/binary-tree/bst.ts:8
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:17
  • +
  • Defined in src/data-structures/binary-tree/binary-tree.ts:19