SYMBOL INDEX (600 symbols across 195 files) FILE: src/algorithms/cryptography/hill-cipher/hillCipher.js function hillCipherEncrypt (line 59) | function hillCipherEncrypt(message, keyString) { FILE: src/algorithms/cryptography/polynomial-hash/PolynomialHash.js constant DEFAULT_BASE (line 1) | const DEFAULT_BASE = 37; constant DEFAULT_MODULUS (line 2) | const DEFAULT_MODULUS = 101; class PolynomialHash (line 4) | class PolynomialHash { method constructor (line 9) | constructor({ base = DEFAULT_BASE, modulus = DEFAULT_MODULUS } = {}) { method hash (line 22) | hash(word) { method roll (line 49) | roll(prevHash, prevWord, newWord) { method charToNumber (line 77) | charToNumber(char) { FILE: src/algorithms/cryptography/polynomial-hash/SimplePolynomialHash.js constant DEFAULT_BASE (line 1) | const DEFAULT_BASE = 17; class SimplePolynomialHash (line 3) | class SimplePolynomialHash { method constructor (line 7) | constructor(base = DEFAULT_BASE) { method hash (line 24) | hash(word) { method roll (line 51) | roll(prevHash, prevWord, newWord) { FILE: src/algorithms/cryptography/rail-fence-cipher/railFenceCipher.js constant DIRECTIONS (line 13) | const DIRECTIONS = { UP: -1, DOWN: 1 }; function onEachRail (line 61) | function onEachRail(rail, currentRail) { FILE: src/algorithms/graph/articulation-points/articulationPoints.js class VisitMetadata (line 6) | class VisitMetadata { method constructor (line 7) | constructor({ discoveryTime, lowDiscoveryTime }) { function articulationPoints (line 22) | function articulationPoints(graph) { FILE: src/algorithms/graph/bellman-ford/bellmanFord.js function bellmanFord (line 6) | function bellmanFord(graph, startVertex) { FILE: src/algorithms/graph/breadth-first-search/breadthFirstSearch.js function initCallbacks (line 19) | function initCallbacks(callbacks = {}) { function breadthFirstSearch (line 49) | function breadthFirstSearch(graph, startVertex, originalCallbacks) { FILE: src/algorithms/graph/bridges/graphBridges.js class VisitMetadata (line 6) | class VisitMetadata { method constructor (line 7) | constructor({ discoveryTime, lowDiscoveryTime }) { function graphBridges (line 17) | function graphBridges(graph) { FILE: src/algorithms/graph/depth-first-search/depthFirstSearch.js function initCallbacks (line 17) | function initCallbacks(callbacks = {}) { function depthFirstSearchRecursive (line 48) | function depthFirstSearchRecursive(graph, currentVertex, previousVertex,... function depthFirstSearch (line 65) | function depthFirstSearch(graph, startVertex, callbacks) { FILE: src/algorithms/graph/detect-cycle/detectDirectedCycle.js function detectDirectedCycle (line 8) | function detectDirectedCycle(graph) { FILE: src/algorithms/graph/detect-cycle/detectUndirectedCycle.js function detectUndirectedCycle (line 8) | function detectUndirectedCycle(graph) { FILE: src/algorithms/graph/detect-cycle/detectUndirectedCycleUsingDisjointSet.js function detectUndirectedCycleUsingDisjointSet (line 8) | function detectUndirectedCycleUsingDisjointSet(graph) { FILE: src/algorithms/graph/dijkstra/dijkstra.js function dijkstra (line 15) | function dijkstra(graph, startVertex) { FILE: src/algorithms/graph/eulerian-path/__test__/eulerianPath.test.js function findEulerianPathInNotEulerianGraph (line 8) | function findEulerianPathInNotEulerianGraph() { FILE: src/algorithms/graph/eulerian-path/eulerianPath.js function eulerianPath (line 9) | function eulerianPath(graph) { FILE: src/algorithms/graph/floyd-warshall/floydWarshall.js function floydWarshall (line 5) | function floydWarshall(graph) { FILE: src/algorithms/graph/hamiltonian-cycle/hamiltonianCycle.js function isSafe (line 10) | function isSafe(adjacencyMatrix, verticesIndices, cycle, vertexCandidate) { function isCycle (line 34) | function isCycle(adjacencyMatrix, verticesIndices, cycle) { function hamiltonianCycleRecursive (line 56) | function hamiltonianCycleRecursive({ function hamiltonianCycle (line 105) | function hamiltonianCycle(graph) { FILE: src/algorithms/graph/kruskal/__test__/kruskal.test.js function applyPrimToDirectedGraph (line 8) | function applyPrimToDirectedGraph() { FILE: src/algorithms/graph/kruskal/kruskal.js function kruskal (line 9) | function kruskal(graph) { FILE: src/algorithms/graph/prim/__test__/prim.test.js function applyPrimToDirectedGraph (line 8) | function applyPrimToDirectedGraph() { FILE: src/algorithms/graph/prim/prim.js function prim (line 8) | function prim(graph) { FILE: src/algorithms/graph/strongly-connected-components/stronglyConnectedComponents.js function getVerticesSortedByDfsFinishTime (line 8) | function getVerticesSortedByDfsFinishTime(graph) { function getSCCSets (line 62) | function getSCCSets(graph, verticesByFinishTime) { function stronglyConnectedComponents (line 119) | function stronglyConnectedComponents(graph) { FILE: src/algorithms/graph/topological-sorting/topologicalSort.js function topologicalSort (line 7) | function topologicalSort(graph) { FILE: src/algorithms/graph/travelling-salesman/bfTravellingSalesman.js function findAllPaths (line 7) | function findAllPaths(startVertex, paths = [], path = []) { function getCycleWeight (line 49) | function getCycleWeight(adjacencyMatrix, verticesIndices, cycle) { function bfTravellingSalesman (line 69) | function bfTravellingSalesman(graph) { FILE: src/algorithms/image-processing/seam-carving/__tests__/resizeImageWidth.node.js function pixelsDiff (line 17) | function pixelsDiff(imgA, imgB, threshold = 0) { FILE: src/algorithms/linked-list/reverse-traversal/reverseTraversal.js function reverseTraversalRecursive (line 11) | function reverseTraversalRecursive(node, callback) { function reverseTraversal (line 22) | function reverseTraversal(linkedList, callback) { FILE: src/algorithms/linked-list/traversal/traversal.js function traversal (line 11) | function traversal(linkedList, callback) { FILE: src/algorithms/math/binary-floating-point/bitsToFloat.js function bitsToFloat (line 59) | function bitsToFloat(bits, precisionConfig) { function bitsToFloat16 (line 97) | function bitsToFloat16(bits) { function bitsToFloat32 (line 107) | function bitsToFloat32(bits) { function bitsToFloat64 (line 117) | function bitsToFloat64(bits) { FILE: src/algorithms/math/binary-floating-point/floatAsBinaryString.js function floatAsBinaryString (line 17) | function floatAsBinaryString(floatNumber, byteLength) { function floatAs64BinaryString (line 49) | function floatAs64BinaryString(floatNumber) { function floatAs32BinaryString (line 59) | function floatAs32BinaryString(floatNumber) { FILE: src/algorithms/math/bits/bitLength.js function bitLength (line 7) | function bitLength(number) { FILE: src/algorithms/math/bits/bitsDiff.js function bitsDiff (line 11) | function bitsDiff(numberA, numberB) { FILE: src/algorithms/math/bits/clearBit.js function clearBit (line 6) | function clearBit(number, bitPosition) { FILE: src/algorithms/math/bits/countSetBits.js function countSetBits (line 5) | function countSetBits(originalNumber) { FILE: src/algorithms/math/bits/divideByTwo.js function divideByTwo (line 5) | function divideByTwo(number) { FILE: src/algorithms/math/bits/fullAdder.js function fullAdder (line 37) | function fullAdder(a, b) { FILE: src/algorithms/math/bits/getBit.js function getBit (line 6) | function getBit(number, bitPosition) { FILE: src/algorithms/math/bits/isEven.js function isEven (line 5) | function isEven(number) { FILE: src/algorithms/math/bits/isPositive.js function isPositive (line 5) | function isPositive(number) { FILE: src/algorithms/math/bits/isPowerOfTwo.js function isPowerOfTwo (line 5) | function isPowerOfTwo(number) { FILE: src/algorithms/math/bits/multiply.js function multiply (line 27) | function multiply(a, b) { FILE: src/algorithms/math/bits/multiplyByTwo.js function multiplyByTwo (line 5) | function multiplyByTwo(number) { FILE: src/algorithms/math/bits/multiplyUnsigned.js function multiplyUnsigned (line 19) | function multiplyUnsigned(number1, number2) { FILE: src/algorithms/math/bits/setBit.js function setBit (line 6) | function setBit(number, bitPosition) { FILE: src/algorithms/math/bits/switchSign.js function switchSign (line 6) | function switchSign(number) { FILE: src/algorithms/math/bits/updateBit.js function updateBit (line 7) | function updateBit(number, bitPosition, bitValue) { FILE: src/algorithms/math/complex-number/ComplexNumber.js class ComplexNumber (line 3) | class ComplexNumber { method constructor (line 11) | constructor({ re = 0, im = 0 } = {}) { method add (line 20) | add(addend) { method subtract (line 34) | subtract(subtrahend) { method multiply (line 48) | multiply(multiplicand) { method divide (line 62) | divide(divider) { method conjugate (line 84) | conjugate(number) { method getRadius (line 97) | getRadius() { method getPhase (line 105) | getPhase(inRadians = true) { method getPolarForm (line 139) | getPolarForm(inRadians = true) { method toComplexNumber (line 153) | toComplexNumber(number) { FILE: src/algorithms/math/euclidean-algorithm/euclideanAlgorithm.js function euclideanAlgorithm (line 7) | function euclideanAlgorithm(originalA, originalB) { FILE: src/algorithms/math/euclidean-algorithm/euclideanAlgorithmIterative.js function euclideanAlgorithmIterative (line 7) | function euclideanAlgorithmIterative(originalA, originalB) { FILE: src/algorithms/math/factorial/factorial.js function factorial (line 5) | function factorial(number) { FILE: src/algorithms/math/factorial/factorialRecursive.js function factorialRecursive (line 5) | function factorialRecursive(number) { FILE: src/algorithms/math/fast-powering/fastPowering.js function fastPowering (line 11) | function fastPowering(base, power) { FILE: src/algorithms/math/fibonacci/fibonacci.js function fibonacci (line 7) | function fibonacci(n) { FILE: src/algorithms/math/fibonacci/fibonacciNth.js function fibonacciNth (line 7) | function fibonacciNth(n) { FILE: src/algorithms/math/fibonacci/fibonacciNthClosedForm.js function fibonacciClosedForm (line 8) | function fibonacciClosedForm(position) { FILE: src/algorithms/math/fourier-transform/__test__/FourierTester.js class FourierTester (line 238) | class FourierTester { method testDirectFourierTransform (line 242) | static testDirectFourierTransform(fourierTransform) { method testInverseFourierTransform (line 272) | static testInverseFourierTransform(inverseFourierTransform) { FILE: src/algorithms/math/fourier-transform/__test__/fastFourierTransform.test.js function sequencesApproximatelyEqual (line 10) | function sequencesApproximatelyEqual(sequence1, sequence2, delta) { FILE: src/algorithms/math/fourier-transform/discreteFourierTransform.js constant CLOSE_TO_ZERO_THRESHOLD (line 3) | const CLOSE_TO_ZERO_THRESHOLD = 1e-10; function dft (line 22) | function dft(inputAmplitudes, zeroThreshold = CLOSE_TO_ZERO_THRESHOLD) { FILE: src/algorithms/math/fourier-transform/fastFourierTransform.js function reverseBits (line 11) | function reverseBits(input, bitsCount) { function fastFourierTransform (line 33) | function fastFourierTransform(inputData, inverse = false) { FILE: src/algorithms/math/fourier-transform/inverseDiscreteFourierTransform.js constant CLOSE_TO_ZERO_THRESHOLD (line 3) | const CLOSE_TO_ZERO_THRESHOLD = 1e-10; function inverseDiscreteFourierTransform (line 16) | function inverseDiscreteFourierTransform( FILE: src/algorithms/math/horner-method/classicPolynome.js function classicPolynome (line 9) | function classicPolynome(coefficients, xVal) { FILE: src/algorithms/math/horner-method/hornerMethod.js function hornerMethod (line 9) | function hornerMethod(coefficients, xVal) { FILE: src/algorithms/math/integer-partition/integerPartition.js function integerPartition (line 5) | function integerPartition(number) { FILE: src/algorithms/math/is-power-of-two/isPowerOfTwo.js function isPowerOfTwo (line 5) | function isPowerOfTwo(number) { FILE: src/algorithms/math/is-power-of-two/isPowerOfTwoBitwise.js function isPowerOfTwoBitwise (line 5) | function isPowerOfTwoBitwise(number) { FILE: src/algorithms/math/least-common-multiple/leastCommonMultiple.js function leastCommonMultiple (line 9) | function leastCommonMultiple(a, b) { FILE: src/algorithms/math/liu-hui/liuHui.js function getNGonSideLength (line 12) | function getNGonSideLength(sideLength, splitCounter) { function getNGonSideCount (line 31) | function getNGonSideCount(splitCount) { function liuHui (line 46) | function liuHui(splitCount = 1) { FILE: src/algorithms/math/pascal-triangle/pascalTriangle.js function pascalTriangle (line 5) | function pascalTriangle(lineNumber) { FILE: src/algorithms/math/pascal-triangle/pascalTriangleRecursive.js function pascalTriangleRecursive (line 5) | function pascalTriangleRecursive(lineNumber) { FILE: src/algorithms/math/primality-test/__test__/trialDivision.test.js function primalityTest (line 6) | function primalityTest(testFunction) { FILE: src/algorithms/math/primality-test/trialDivision.js function trialDivision (line 5) | function trialDivision(number) { FILE: src/algorithms/math/prime-factors/__test__/primeFactors.test.js function approximationError (line 12) | function approximationError(exactCount, approximateCount) { FILE: src/algorithms/math/prime-factors/primeFactors.js function primeFactors (line 7) | function primeFactors(n) { function hardyRamanujan (line 40) | function hardyRamanujan(n) { FILE: src/algorithms/math/radian/degreeToRadian.js function degreeToRadian (line 5) | function degreeToRadian(degree) { FILE: src/algorithms/math/radian/radianToDegree.js function radianToDegree (line 5) | function radianToDegree(radian) { FILE: src/algorithms/math/sieve-of-eratosthenes/sieveOfEratosthenes.js function sieveOfEratosthenes (line 5) | function sieveOfEratosthenes(maxNumber) { FILE: src/algorithms/math/square-root/__test__/squareRoot.test.js function failingSquareRoot (line 5) | function failingSquareRoot() { FILE: src/algorithms/math/square-root/squareRoot.js function squareRoot (line 9) | function squareRoot(number, tolerance = 0) { FILE: src/algorithms/ml/k-means/kMeans.js function KMeans (line 11) | function KMeans( FILE: src/algorithms/ml/knn/kNN.js function kNN (line 13) | function kNN( FILE: src/algorithms/search/binary-search/binarySearch.js function binarySearch (line 12) | function binarySearch(sortedArray, seekElement, comparatorCallback) { FILE: src/algorithms/search/interpolation-search/interpolationSearch.js function interpolationSearch (line 8) | function interpolationSearch(sortedArray, seekElement) { FILE: src/algorithms/search/jump-search/jumpSearch.js function jumpSearch (line 11) | function jumpSearch(sortedArray, seekElement, comparatorCallback) { FILE: src/algorithms/search/linear-search/linearSearch.js function linearSearch (line 11) | function linearSearch(array, seekElement, comparatorCallback) { FILE: src/algorithms/sets/cartesian-product/cartesianProduct.js function cartesianProduct (line 7) | function cartesianProduct(setA, setB) { FILE: src/algorithms/sets/combination-sum/combinationSum.js function combinationSumRecursive (line 9) | function combinationSumRecursive( function combinationSum (line 63) | function combinationSum(candidates, target) { FILE: src/algorithms/sets/combinations/combineWithRepetitions.js function combineWithRepetitions (line 6) | function combineWithRepetitions(comboOptions, comboLength) { FILE: src/algorithms/sets/combinations/combineWithoutRepetitions.js function combineWithoutRepetitions (line 6) | function combineWithoutRepetitions(comboOptions, comboLength) { FILE: src/algorithms/sets/fisher-yates/fisherYates.js function fisherYates (line 5) | function fisherYates(originalArray) { FILE: src/algorithms/sets/knapsack-problem/Knapsack.js class Knapsack (line 3) | class Knapsack { method constructor (line 8) | constructor(possibleItems, weightLimit) { method sortPossibleItemsByWeight (line 14) | sortPossibleItemsByWeight() { method sortPossibleItemsByValue (line 30) | sortPossibleItemsByValue() { method sortPossibleItemsByValuePerWeightRatio (line 46) | sortPossibleItemsByValuePerWeightRatio() { method solveZeroOneKnapsackProblem (line 64) | solveZeroOneKnapsackProblem() { method solveUnboundedKnapsackProblem (line 155) | solveUnboundedKnapsackProblem() { method totalValue (line 182) | get totalValue() { method totalWeight (line 189) | get totalWeight() { FILE: src/algorithms/sets/knapsack-problem/KnapsackItem.js class KnapsackItem (line 1) | class KnapsackItem { method constructor (line 8) | constructor({ value, weight, itemsInStock = 1 }) { method totalValue (line 16) | get totalValue() { method totalWeight (line 20) | get totalWeight() { method valuePerWeightRatio (line 26) | get valuePerWeightRatio() { method toString (line 30) | toString() { FILE: src/algorithms/sets/longest-common-subsequence/longestCommonSubsequence.js function longestCommonSubsequence (line 6) | function longestCommonSubsequence(set1, set2) { FILE: src/algorithms/sets/longest-common-subsequence/longestCommonSubsequenceRecursive.js function longestCommonSubsequenceRecursive (line 9) | function longestCommonSubsequenceRecursive(string1, string2) { FILE: src/algorithms/sets/longest-increasing-subsequence/dpLongestIncreasingSubsequence.js function dpLongestIncreasingSubsequence (line 8) | function dpLongestIncreasingSubsequence(sequence) { FILE: src/algorithms/sets/maximum-subarray/bfMaximumSubarray.js function bfMaximumSubarray (line 8) | function bfMaximumSubarray(inputArray) { FILE: src/algorithms/sets/maximum-subarray/dcMaximumSubarraySum.js function dcMaximumSubarraySum (line 8) | function dcMaximumSubarraySum(inputArray) { FILE: src/algorithms/sets/maximum-subarray/dpMaximumSubarray.js function dpMaximumSubarray (line 8) | function dpMaximumSubarray(inputArray) { FILE: src/algorithms/sets/permutations/permutateWithRepetitions.js function permutateWithRepetitions (line 6) | function permutateWithRepetitions( FILE: src/algorithms/sets/permutations/permutateWithoutRepetitions.js function permutateWithoutRepetitions (line 5) | function permutateWithoutRepetitions(permutationOptions) { FILE: src/algorithms/sets/power-set/btPowerSet.js function btPowerSetRecursive (line 8) | function btPowerSetRecursive(originalSet, allSubsets = [[]], currentSubS... function btPowerSet (line 39) | function btPowerSet(originalSet) { FILE: src/algorithms/sets/power-set/bwPowerSet.js function bwPowerSet (line 7) | function bwPowerSet(originalSet) { FILE: src/algorithms/sets/power-set/caPowerSet.js function caPowerSet (line 7) | function caPowerSet(originalSet) { FILE: src/algorithms/sets/shortest-common-supersequence/shortestCommonSupersequence.js function shortestCommonSupersequence (line 9) | function shortestCommonSupersequence(set1, set2) { FILE: src/algorithms/sorting/Sort.js class Sort (line 11) | class Sort { method constructor (line 12) | constructor(originalCallbacks) { method initSortingCallbacks (line 21) | static initSortingCallbacks(originalCallbacks) { method sort (line 31) | sort() { FILE: src/algorithms/sorting/SortTester.js class SortTester (line 8) | class SortTester { method testSort (line 9) | static testSort(SortingClass) { method testNegativeNumbersSort (line 23) | static testNegativeNumbersSort(SortingClass) { method testSortWithCustomComparator (line 28) | static testSortWithCustomComparator(SortingClass) { method testSortStability (line 47) | static testSortStability(SortingClass) { method testAlgorithmTimeComplexity (line 63) | static testAlgorithmTimeComplexity(SortingClass, arrayToBeSorted, numb... FILE: src/algorithms/sorting/__test__/Sort.test.js function doForbiddenSort (line 5) | function doForbiddenSort() { FILE: src/algorithms/sorting/bubble-sort/BubbleSort.js class BubbleSort (line 3) | class BubbleSort extends Sort { method sort (line 4) | sort(originalArray) { FILE: src/algorithms/sorting/bubble-sort/__test__/BubbleSort.test.js constant SORTED_ARRAY_VISITING_COUNT (line 11) | const SORTED_ARRAY_VISITING_COUNT = 20; constant NOT_SORTED_ARRAY_VISITING_COUNT (line 12) | const NOT_SORTED_ARRAY_VISITING_COUNT = 189; constant REVERSE_SORTED_ARRAY_VISITING_COUNT (line 13) | const REVERSE_SORTED_ARRAY_VISITING_COUNT = 209; constant EQUAL_ARRAY_VISITING_COUNT (line 14) | const EQUAL_ARRAY_VISITING_COUNT = 20; FILE: src/algorithms/sorting/bucket-sort/BucketSort.js function BucketSort (line 10) | function BucketSort(arr, bucketsNum = 1) { FILE: src/algorithms/sorting/counting-sort/CountingSort.js class CountingSort (line 3) | class CountingSort extends Sort { method sort (line 9) | sort(originalArray, smallestElement = undefined, biggestElement = unde... FILE: src/algorithms/sorting/counting-sort/__test__/CountingSort.test.js constant SORTED_ARRAY_VISITING_COUNT (line 11) | const SORTED_ARRAY_VISITING_COUNT = 60; constant NOT_SORTED_ARRAY_VISITING_COUNT (line 12) | const NOT_SORTED_ARRAY_VISITING_COUNT = 60; constant REVERSE_SORTED_ARRAY_VISITING_COUNT (line 13) | const REVERSE_SORTED_ARRAY_VISITING_COUNT = 60; constant EQUAL_ARRAY_VISITING_COUNT (line 14) | const EQUAL_ARRAY_VISITING_COUNT = 60; FILE: src/algorithms/sorting/heap-sort/HeapSort.js class HeapSort (line 4) | class HeapSort extends Sort { method sort (line 5) | sort(originalArray) { FILE: src/algorithms/sorting/heap-sort/__test__/HeapSort.test.js constant SORTED_ARRAY_VISITING_COUNT (line 13) | const SORTED_ARRAY_VISITING_COUNT = 40; constant NOT_SORTED_ARRAY_VISITING_COUNT (line 14) | const NOT_SORTED_ARRAY_VISITING_COUNT = 40; constant REVERSE_SORTED_ARRAY_VISITING_COUNT (line 15) | const REVERSE_SORTED_ARRAY_VISITING_COUNT = 40; constant EQUAL_ARRAY_VISITING_COUNT (line 16) | const EQUAL_ARRAY_VISITING_COUNT = 40; FILE: src/algorithms/sorting/insertion-sort/InsertionSort.js class InsertionSort (line 3) | class InsertionSort extends Sort { method sort (line 4) | sort(originalArray) { FILE: src/algorithms/sorting/insertion-sort/__test__/InsertionSort.test.js constant SORTED_ARRAY_VISITING_COUNT (line 11) | const SORTED_ARRAY_VISITING_COUNT = 19; constant NOT_SORTED_ARRAY_VISITING_COUNT (line 12) | const NOT_SORTED_ARRAY_VISITING_COUNT = 100; constant REVERSE_SORTED_ARRAY_VISITING_COUNT (line 13) | const REVERSE_SORTED_ARRAY_VISITING_COUNT = 209; constant EQUAL_ARRAY_VISITING_COUNT (line 14) | const EQUAL_ARRAY_VISITING_COUNT = 19; FILE: src/algorithms/sorting/merge-sort/MergeSort.js class MergeSort (line 3) | class MergeSort extends Sort { method sort (line 4) | sort(originalArray) { method mergeSortedArrays (line 26) | mergeSortedArrays(leftArray, rightArray) { FILE: src/algorithms/sorting/merge-sort/__test__/MergeSort.test.js constant SORTED_ARRAY_VISITING_COUNT (line 11) | const SORTED_ARRAY_VISITING_COUNT = 79; constant NOT_SORTED_ARRAY_VISITING_COUNT (line 12) | const NOT_SORTED_ARRAY_VISITING_COUNT = 102; constant REVERSE_SORTED_ARRAY_VISITING_COUNT (line 13) | const REVERSE_SORTED_ARRAY_VISITING_COUNT = 87; constant EQUAL_ARRAY_VISITING_COUNT (line 14) | const EQUAL_ARRAY_VISITING_COUNT = 79; FILE: src/algorithms/sorting/quick-sort/QuickSort.js class QuickSort (line 3) | class QuickSort extends Sort { method sort (line 8) | sort(originalArray) { FILE: src/algorithms/sorting/quick-sort/QuickSortInPlace.js class QuickSortInPlace (line 3) | class QuickSortInPlace extends Sort { method sort (line 15) | sort( FILE: src/algorithms/sorting/quick-sort/__test__/QuickSort.test.js constant SORTED_ARRAY_VISITING_COUNT (line 11) | const SORTED_ARRAY_VISITING_COUNT = 190; constant NOT_SORTED_ARRAY_VISITING_COUNT (line 12) | const NOT_SORTED_ARRAY_VISITING_COUNT = 62; constant REVERSE_SORTED_ARRAY_VISITING_COUNT (line 13) | const REVERSE_SORTED_ARRAY_VISITING_COUNT = 190; constant EQUAL_ARRAY_VISITING_COUNT (line 14) | const EQUAL_ARRAY_VISITING_COUNT = 19; FILE: src/algorithms/sorting/quick-sort/__test__/QuickSortInPlace.test.js constant SORTED_ARRAY_VISITING_COUNT (line 11) | const SORTED_ARRAY_VISITING_COUNT = 19; constant NOT_SORTED_ARRAY_VISITING_COUNT (line 12) | const NOT_SORTED_ARRAY_VISITING_COUNT = 12; constant REVERSE_SORTED_ARRAY_VISITING_COUNT (line 13) | const REVERSE_SORTED_ARRAY_VISITING_COUNT = 19; constant EQUAL_ARRAY_VISITING_COUNT (line 14) | const EQUAL_ARRAY_VISITING_COUNT = 19; FILE: src/algorithms/sorting/radix-sort/RadixSort.js constant BASE_CHAR_CODE (line 4) | const BASE_CHAR_CODE = 97; constant NUMBER_OF_POSSIBLE_DIGITS (line 5) | const NUMBER_OF_POSSIBLE_DIGITS = 10; constant ENGLISH_ALPHABET_LENGTH (line 6) | const ENGLISH_ALPHABET_LENGTH = 26; class RadixSort (line 8) | class RadixSort extends Sort { method sort (line 13) | sort(originalArray) { method placeElementsInNumberBuckets (line 39) | placeElementsInNumberBuckets(array, index) { method placeElementsInCharacterBuckets (line 69) | placeElementsInCharacterBuckets(array, index, numPasses) { method getCharCodeOfElementAtIndex (line 87) | getCharCodeOfElementAtIndex(element, index, numPasses) { method determineNumPasses (line 106) | determineNumPasses(array) { method getLengthOfLongestElement (line 114) | getLengthOfLongestElement(array) { method isArrayOfNumbers (line 128) | isArrayOfNumbers(array) { method createBuckets (line 137) | createBuckets(numBuckets) { method isNumber (line 149) | isNumber(element) { FILE: src/algorithms/sorting/radix-sort/__test__/RadixSort.test.js constant ARRAY_OF_STRINGS_VISIT_COUNT (line 5) | const ARRAY_OF_STRINGS_VISIT_COUNT = 24; constant ARRAY_OF_INTEGERS_VISIT_COUNT (line 6) | const ARRAY_OF_INTEGERS_VISIT_COUNT = 77; FILE: src/algorithms/sorting/selection-sort/SelectionSort.js class SelectionSort (line 3) | class SelectionSort extends Sort { method sort (line 4) | sort(originalArray) { FILE: src/algorithms/sorting/selection-sort/__test__/SelectionSort.test.js constant SORTED_ARRAY_VISITING_COUNT (line 11) | const SORTED_ARRAY_VISITING_COUNT = 209; constant NOT_SORTED_ARRAY_VISITING_COUNT (line 12) | const NOT_SORTED_ARRAY_VISITING_COUNT = 209; constant REVERSE_SORTED_ARRAY_VISITING_COUNT (line 13) | const REVERSE_SORTED_ARRAY_VISITING_COUNT = 209; constant EQUAL_ARRAY_VISITING_COUNT (line 14) | const EQUAL_ARRAY_VISITING_COUNT = 209; FILE: src/algorithms/sorting/shell-sort/ShellSort.js class ShellSort (line 3) | class ShellSort extends Sort { method sort (line 4) | sort(originalArray) { FILE: src/algorithms/sorting/shell-sort/__test__/ShellSort.test.js constant SORTED_ARRAY_VISITING_COUNT (line 11) | const SORTED_ARRAY_VISITING_COUNT = 320; constant NOT_SORTED_ARRAY_VISITING_COUNT (line 12) | const NOT_SORTED_ARRAY_VISITING_COUNT = 320; constant REVERSE_SORTED_ARRAY_VISITING_COUNT (line 13) | const REVERSE_SORTED_ARRAY_VISITING_COUNT = 320; constant EQUAL_ARRAY_VISITING_COUNT (line 14) | const EQUAL_ARRAY_VISITING_COUNT = 320; FILE: src/algorithms/stack/valid-parentheses/validParentheses.js function isValid (line 16) | function isValid(parenthesesString) { FILE: src/algorithms/statistics/weighted-random/weightedRandom.js function weightedRandom (line 16) | function weightedRandom(items, weights) { FILE: src/algorithms/string/hamming-distance/hammingDistance.js function hammingDistance (line 6) | function hammingDistance(a, b) { FILE: src/algorithms/string/knuth-morris-pratt/knuthMorrisPratt.js function buildPatternTable (line 6) | function buildPatternTable(word) { function knuthMorrisPratt (line 32) | function knuthMorrisPratt(text, word) { FILE: src/algorithms/string/levenshtein-distance/levenshteinDistance.js function levenshteinDistance (line 6) | function levenshteinDistance(a, b) { FILE: src/algorithms/string/longest-common-substring/longestCommonSubstring.js function longestCommonSubstring (line 8) | function longestCommonSubstring(string1, string2) { FILE: src/algorithms/string/palindrome/isPalindrome.js function isPalindrome (line 6) | function isPalindrome(string) { FILE: src/algorithms/string/rabin-karp/rabinKarp.js function rabinKarp (line 8) | function rabinKarp(text, word) { FILE: src/algorithms/string/regular-expression-matching/regularExpressionMatching.js constant ZERO_OR_MORE_CHARS (line 1) | const ZERO_OR_MORE_CHARS = '*'; constant ANY_CHAR (line 2) | const ANY_CHAR = '.'; function regularExpressionMatching (line 11) | function regularExpressionMatching(string, pattern) { FILE: src/algorithms/string/z-algorithm/zAlgorithm.js constant SEPARATOR (line 2) | const SEPARATOR = '$'; function buildZArray (line 8) | function buildZArray(zString) { function zAlgorithm (line 106) | function zAlgorithm(text, word) { FILE: src/algorithms/tree/breadth-first-search/breadthFirstSearch.js function initCallbacks (line 15) | function initCallbacks(callbacks = {}) { function breadthFirstSearch (line 32) | function breadthFirstSearch(rootNode, originalCallbacks) { FILE: src/algorithms/tree/depth-first-search/depthFirstSearch.js function initCallbacks (line 18) | function initCallbacks(callbacks = {}) { function depthFirstSearchRecursive (line 43) | function depthFirstSearchRecursive(node, callbacks) { function depthFirstSearch (line 70) | function depthFirstSearch(rootNode, callbacks) { FILE: src/algorithms/uncategorized/hanoi-tower/hanoiTower.js function hanoiTowerRecursive (line 10) | function hanoiTowerRecursive({ function hanoiTower (line 61) | function hanoiTower({ FILE: src/algorithms/uncategorized/jump-game/backtrackingJumpGame.js function backtrackingJumpGame (line 15) | function backtrackingJumpGame(numbers, startIndex = 0, currentJumps = []) { FILE: src/algorithms/uncategorized/jump-game/dpBottomUpJumpGame.js function dpBottomUpJumpGame (line 19) | function dpBottomUpJumpGame(numbers) { FILE: src/algorithms/uncategorized/jump-game/dpTopDownJumpGame.js function dpTopDownJumpGame (line 20) | function dpTopDownJumpGame( FILE: src/algorithms/uncategorized/jump-game/greedyJumpGame.js function greedyJumpGame (line 20) | function greedyJumpGame(numbers) { FILE: src/algorithms/uncategorized/knight-tour/knightTour.js function getPossibleMoves (line 6) | function getPossibleMoves(chessboard, position) { function isMoveAllowed (line 31) | function isMoveAllowed(chessboard, move) { function isBoardCompletelyVisited (line 40) | function isBoardCompletelyVisited(chessboard, moves) { function knightTourRecursive (line 52) | function knightTourRecursive(chessboard, moves) { function knightTour (line 96) | function knightTour(chessboardSize) { FILE: src/algorithms/uncategorized/n-queens/QueenPosition.js class QueenPosition (line 4) | class QueenPosition { method constructor (line 9) | constructor(rowIndex, columnIndex) { method leftDiagonal (line 17) | get leftDiagonal() { method rightDiagonal (line 28) | get rightDiagonal() { method toString (line 36) | toString() { FILE: src/algorithms/uncategorized/n-queens/nQueens.js function isSafe (line 9) | function isSafe(queensPositions, rowIndex, columnIndex) { function nQueensRecursive (line 48) | function nQueensRecursive(solutions, previousQueensPositions, queensCoun... function nQueens (line 88) | function nQueens(queensCount) { FILE: src/algorithms/uncategorized/n-queens/nQueensBitwise.js function nQueensBitwiseRecursive (line 14) | function nQueensBitwiseRecursive( function nQueensBitwise (line 99) | function nQueensBitwise(boardSize) { FILE: src/algorithms/uncategorized/rain-terraces/bfRainTerraces.js function bfRainTerraces (line 7) | function bfRainTerraces(terraces) { FILE: src/algorithms/uncategorized/rain-terraces/dpRainTerraces.js function dpRainTerraces (line 7) | function dpRainTerraces(terraces) { FILE: src/algorithms/uncategorized/recursive-staircase/recursiveStaircaseBF.js function recursiveStaircaseBF (line 7) | function recursiveStaircaseBF(stairsNum) { FILE: src/algorithms/uncategorized/recursive-staircase/recursiveStaircaseDP.js function recursiveStaircaseDP (line 7) | function recursiveStaircaseDP(stairsNum) { FILE: src/algorithms/uncategorized/recursive-staircase/recursiveStaircaseIT.js function recursiveStaircaseIT (line 7) | function recursiveStaircaseIT(stairsNum) { FILE: src/algorithms/uncategorized/recursive-staircase/recursiveStaircaseMEM.js function recursiveStaircaseMEM (line 7) | function recursiveStaircaseMEM(totalStairs) { FILE: src/algorithms/uncategorized/square-matrix-rotation/squareMatrixRotation.js function squareMatrixRotation (line 5) | function squareMatrixRotation(originalMatrix) { FILE: src/algorithms/uncategorized/unique-paths/btUniquePaths.js function btUniquePaths (line 10) | function btUniquePaths(width, height, steps = [[0, 0]], uniqueSteps = 0) { FILE: src/algorithms/uncategorized/unique-paths/dpUniquePaths.js function dpUniquePaths (line 8) | function dpUniquePaths(width, height) { FILE: src/algorithms/uncategorized/unique-paths/uniquePaths.js function uniquePaths (line 8) | function uniquePaths(width, height) { FILE: src/data-structures/bloom-filter/BloomFilter.js class BloomFilter (line 1) | class BloomFilter { method constructor (line 5) | constructor(size = 100) { method insert (line 15) | insert(item) { method mayContain (line 26) | mayContain(item) { method createStore (line 49) | createStore(size) { method hash1 (line 73) | hash1(item) { method hash2 (line 90) | hash2(item) { method hash3 (line 105) | hash3(item) { method getHashValues (line 124) | getHashValues(item) { FILE: src/data-structures/disjoint-set/DisjointSet.js class DisjointSet (line 3) | class DisjointSet { method constructor (line 7) | constructor(keyCallback) { method makeSet (line 16) | makeSet(itemValue) { method find (line 33) | find(itemValue) { method union (line 53) | union(valueA, valueB) { method inSameSet (line 87) | inSameSet(valueA, valueB) { FILE: src/data-structures/disjoint-set/DisjointSetAdhoc.js class DisjointSetAdhoc (line 19) | class DisjointSetAdhoc { method constructor (line 24) | constructor(size) { method find (line 40) | find(a) { method union (line 52) | union(a, b) { method connected (line 73) | connected(a, b) { FILE: src/data-structures/disjoint-set/DisjointSetItem.js class DisjointSetItem (line 1) | class DisjointSetItem { method constructor (line 6) | constructor(value, keyCallback) { method getKey (line 17) | getKey() { method getRoot (line 30) | getRoot() { method isRoot (line 37) | isRoot() { method getRank (line 46) | getRank() { method getChildren (line 68) | getChildren() { method setParent (line 77) | setParent(parentItem, forceSettingParentChild = true) { method addChild (line 90) | addChild(childItem) { FILE: src/data-structures/disjoint-set/__test__/DisjointSet.test.js function mergeNotExistingSets (line 5) | function mergeNotExistingSets() { function checkNotExistingSets (line 11) | function checkNotExistingSets() { FILE: src/data-structures/doubly-linked-list/DoublyLinkedList.js class DoublyLinkedList (line 4) | class DoublyLinkedList { method constructor (line 8) | constructor(comparatorFunction) { method prepend (line 22) | prepend(value) { method append (line 46) | append(value) { method delete (line 73) | delete(value) { method find (line 129) | find({ value = undefined, callback = undefined }) { method deleteTail (line 156) | deleteTail() { method deleteHead (line 183) | deleteHead() { method toArray (line 204) | toArray() { method fromArray (line 220) | fromArray(values) { method toString (line 230) | toString(callback) { method reverse (line 238) | reverse() { FILE: src/data-structures/doubly-linked-list/DoublyLinkedListNode.js class DoublyLinkedListNode (line 1) | class DoublyLinkedListNode { method constructor (line 2) | constructor(value, next = null, previous = null) { method toString (line 8) | toString(callback) { FILE: src/data-structures/graph/Graph.js class Graph (line 1) | class Graph { method constructor (line 5) | constructor(isDirected = false) { method addVertex (line 15) | addVertex(newVertex) { method getVertexByKey (line 31) | getVertexByKey(vertexKey) { method getNeighbors (line 39) | getNeighbors(vertex) { method getAllVertices (line 46) | getAllVertices() { method getAllEdges (line 53) | getAllEdges() { method addEdge (line 61) | addEdge(edge) { method deleteEdge (line 101) | deleteEdge(edge) { method findEdge (line 122) | findEdge(startVertex, endVertex) { method getWeight (line 135) | getWeight() { method reverse (line 145) | reverse() { method getVerticesIndices (line 164) | getVerticesIndices() { method getAdjacencyMatrix (line 176) | getAdjacencyMatrix() { method toString (line 200) | toString() { FILE: src/data-structures/graph/GraphEdge.js class GraphEdge (line 1) | class GraphEdge { method constructor (line 8) | constructor(startVertex, endVertex, weight = 0, key = null) { method getKey (line 15) | getKey() { method reverse (line 31) | reverse() { method toString (line 42) | toString() { FILE: src/data-structures/graph/GraphVertex.js class GraphVertex (line 3) | class GraphVertex { method constructor (line 7) | constructor(value) { method addEdge (line 34) | addEdge(edge) { method deleteEdge (line 43) | deleteEdge(edge) { method getNeighbors (line 50) | getNeighbors() { method getEdges (line 66) | getEdges() { method getDegree (line 73) | getDegree() { method hasEdge (line 81) | hasEdge(requiredEdge) { method hasNeighbor (line 93) | hasNeighbor(vertex) { method findEdge (line 105) | findEdge(vertex) { method getKey (line 118) | getKey() { method deleteAllEdges (line 125) | deleteAllEdges() { method toString (line 135) | toString(callback) { FILE: src/data-structures/graph/__test__/Graph.test.js function addSameEdgeTwice (line 145) | function addSameEdgeTwice() { function addSameEdgeTwice (line 162) | function addSameEdgeTwice() { function deleteNotExistingEdge (line 265) | function deleteNotExistingEdge() { FILE: src/data-structures/graph/__test__/GraphEdge.test.js method toString (line 57) | toString() { return 'custom_key'; } FILE: src/data-structures/graph/__test__/GraphVertex.test.js function createEmptyVertex (line 8) | function createEmptyVertex() { method toString (line 197) | toString() { return 'A'; } FILE: src/data-structures/hash-table/HashTable.js class HashTable (line 9) | class HashTable { method constructor (line 13) | constructor(hashTableSize = defaultHashTableSize) { method hash (line 27) | hash(key) { method set (line 51) | set(key, value) { method delete (line 70) | delete(key) { method get (line 87) | get(key) { method has (line 98) | has(key) { method getKeys (line 105) | getKeys() { method getValues (line 114) | getValues() { FILE: src/data-structures/heap/Heap.js class Heap (line 6) | class Heap { method constructor (line 11) | constructor(comparatorFunction) { method getLeftChildIndex (line 25) | getLeftChildIndex(parentIndex) { method getRightChildIndex (line 33) | getRightChildIndex(parentIndex) { method getParentIndex (line 41) | getParentIndex(childIndex) { method hasParent (line 49) | hasParent(childIndex) { method hasLeftChild (line 57) | hasLeftChild(parentIndex) { method hasRightChild (line 65) | hasRightChild(parentIndex) { method leftChild (line 73) | leftChild(parentIndex) { method rightChild (line 81) | rightChild(parentIndex) { method parent (line 89) | parent(childIndex) { method swap (line 97) | swap(indexOne, indexTwo) { method peek (line 106) | peek() { method poll (line 117) | poll() { method add (line 139) | add(item) { method remove (line 150) | remove(item, comparator = this.compare) { method find (line 194) | find(item, comparator = this.compare) { method isEmpty (line 209) | isEmpty() { method toString (line 216) | toString() { method heapifyUp (line 223) | heapifyUp(customStartIndex) { method heapifyDown (line 241) | heapifyDown(customStartIndex = 0) { method pairIsInCorrectOrder (line 280) | pairIsInCorrectOrder(firstElement, secondElement) { FILE: src/data-structures/heap/MaxHeap.js class MaxHeap (line 3) | class MaxHeap extends Heap { method pairIsInCorrectOrder (line 13) | pairIsInCorrectOrder(firstElement, secondElement) { FILE: src/data-structures/heap/MaxHeapAdhoc.js class MaxHeapAdhoc (line 7) | class MaxHeapAdhoc { method constructor (line 8) | constructor(heap = []) { method add (line 13) | add(num) { method peek (line 18) | peek() { method poll (line 22) | poll() { method isEmpty (line 31) | isEmpty() { method toString (line 35) | toString() { method heapifyUp (line 39) | heapifyUp() { method heapifyDown (line 49) | heapifyDown() { method getLeftChildIndex (line 80) | getLeftChildIndex(parentIndex) { method getRightChildIndex (line 84) | getRightChildIndex(parentIndex) { method getParentIndex (line 88) | getParentIndex(childIndex) { method hasLeftChild (line 92) | hasLeftChild(parentIndex) { method hasRightChild (line 96) | hasRightChild(parentIndex) { method leftChild (line 100) | leftChild(parentIndex) { method rightChild (line 104) | rightChild(parentIndex) { method swap (line 108) | swap(indexOne, indexTwo) { FILE: src/data-structures/heap/MinHeap.js class MinHeap (line 3) | class MinHeap extends Heap { method pairIsInCorrectOrder (line 13) | pairIsInCorrectOrder(firstElement, secondElement) { FILE: src/data-structures/heap/MinHeapAdhoc.js class MinHeapAdhoc (line 7) | class MinHeapAdhoc { method constructor (line 8) | constructor(heap = []) { method add (line 13) | add(num) { method peek (line 18) | peek() { method poll (line 22) | poll() { method isEmpty (line 31) | isEmpty() { method toString (line 35) | toString() { method heapifyUp (line 39) | heapifyUp() { method heapifyDown (line 49) | heapifyDown() { method getLeftChildIndex (line 82) | getLeftChildIndex(parentIndex) { method getRightChildIndex (line 86) | getRightChildIndex(parentIndex) { method getParentIndex (line 90) | getParentIndex(childIndex) { method hasLeftChild (line 94) | hasLeftChild(parentIndex) { method hasRightChild (line 98) | hasRightChild(parentIndex) { method leftChild (line 102) | leftChild(parentIndex) { method rightChild (line 106) | rightChild(parentIndex) { method swap (line 110) | swap(indexOne, indexTwo) { FILE: src/data-structures/linked-list/LinkedList.js class LinkedList (line 4) | class LinkedList { method constructor (line 8) | constructor(comparatorFunction) { method prepend (line 22) | prepend(value) { method append (line 39) | append(value) { method insert (line 62) | insert(value, rawIndex) { method delete (line 95) | delete(value) { method find (line 137) | find({ value = undefined, callback = undefined }) { method deleteTail (line 164) | deleteTail() { method deleteHead (line 195) | deleteHead() { method fromArray (line 216) | fromArray(values) { method toArray (line 225) | toArray() { method toString (line 241) | toString(callback) { method reverse (line 249) | reverse() { FILE: src/data-structures/linked-list/LinkedListNode.js class LinkedListNode (line 1) | class LinkedListNode { method constructor (line 2) | constructor(value, next = null) { method toString (line 7) | toString(callback) { FILE: src/data-structures/lru-cache/LRUCache.js class LinkedListNode (line 7) | class LinkedListNode { method constructor (line 15) | constructor(key, val, prev = null, next = null) { class LRUCache (line 31) | class LRUCache { method constructor (line 36) | constructor(capacity) { method get (line 50) | get(key) { method set (line 63) | set(key, val) { method promote (line 80) | promote(node) { method append (line 89) | append(node) { method evict (line 118) | evict(node) { FILE: src/data-structures/lru-cache/LRUCacheOnMap.js class LRUCacheOnMap (line 11) | class LRUCacheOnMap { method constructor (line 16) | constructor(capacity) { method get (line 27) | get(key) { method set (line 41) | set(key, val) { FILE: src/data-structures/priority-queue/PriorityQueue.js class PriorityQueue (line 6) | class PriorityQueue extends MinHeap { method constructor (line 7) | constructor() { method add (line 25) | add(item, priority = 0) { method remove (line 37) | remove(item, customFindingComparator) { method changePriority (line 49) | changePriority(item, priority) { method findByValue (line 60) | findByValue(item) { method hasValue (line 69) | hasValue(item) { method comparePriority (line 79) | comparePriority(a, b) { method compareValue (line 92) | compareValue(a, b) { FILE: src/data-structures/queue/Queue.js class Queue (line 3) | class Queue { method constructor (line 4) | constructor() { method isEmpty (line 15) | isEmpty() { method peek (line 23) | peek() { method enqueue (line 36) | enqueue(value) { method dequeue (line 45) | dequeue() { method toString (line 54) | toString(callback) { FILE: src/data-structures/stack/Stack.js class Stack (line 3) | class Stack { method constructor (line 4) | constructor() { method isEmpty (line 14) | isEmpty() { method peek (line 22) | peek() { method push (line 35) | push(value) { method pop (line 44) | pop() { method toArray (line 54) | toArray() { method toString (line 64) | toString(callback) { FILE: src/data-structures/tree/BinaryTreeNode.js class BinaryTreeNode (line 4) | class BinaryTreeNode { method constructor (line 8) | constructor(value = null) { method leftHeight (line 24) | get leftHeight() { method rightHeight (line 35) | get rightHeight() { method height (line 46) | get height() { method balanceFactor (line 53) | get balanceFactor() { method uncle (line 61) | get uncle() { method setValue (line 92) | setValue(value) { method setLeft (line 102) | setLeft(node) { method setRight (line 123) | setRight(node) { method removeChild (line 144) | removeChild(nodeToRemove) { method replaceChild (line 163) | replaceChild(nodeToReplace, replacementNode) { method copyNode (line 185) | static copyNode(sourceNode, targetNode) { method traverseInOrder (line 194) | traverseInOrder() { method toString (line 216) | toString() { FILE: src/data-structures/tree/avl-tree/AvlTree.js class AvlTree (line 3) | class AvlTree extends BinarySearchTree { method insert (line 7) | insert(value) { method remove (line 23) | remove(value) { method balance (line 34) | balance(node) { method rotateLeftLeft (line 60) | rotateLeftLeft(rootNode) { method rotateLeftRight (line 86) | rotateLeftRight(rootNode) { method rotateRightLeft (line 114) | rotateRightLeft(rootNode) { method rotateRightRight (line 141) | rotateRightRight(rootNode) { FILE: src/data-structures/tree/binary-search-tree/BinarySearchTree.js class BinarySearchTree (line 3) | class BinarySearchTree { method constructor (line 7) | constructor(nodeValueCompareFunction) { method insert (line 18) | insert(value) { method contains (line 26) | contains(value) { method remove (line 34) | remove(value) { method toString (line 41) | toString() { FILE: src/data-structures/tree/binary-search-tree/BinarySearchTreeNode.js class BinarySearchTreeNode (line 4) | class BinarySearchTreeNode extends BinaryTreeNode { method constructor (line 9) | constructor(value = null, compareFunction = undefined) { method insert (line 21) | insert(value) { method find (line 59) | find(value) { method contains (line 82) | contains(value) { method remove (line 90) | remove(value) { method findMin (line 144) | findMin() { FILE: src/data-structures/tree/binary-search-tree/__test__/BinarySearchTreeNode.test.js function removeNotExistingElementFromTree (line 209) | function removeNotExistingElementFromTree() { FILE: src/data-structures/tree/fenwick-tree/FenwickTree.js class FenwickTree (line 1) | class FenwickTree { method constructor (line 8) | constructor(arraySize) { method increase (line 22) | increase(position, value) { method query (line 40) | query(position) { method queryRange (line 61) | queryRange(leftIndex, rightIndex) { FILE: src/data-structures/tree/red-black-tree/RedBlackTree.js constant RED_BLACK_TREE_COLORS (line 4) | const RED_BLACK_TREE_COLORS = { constant COLOR_PROP_NAME (line 10) | const COLOR_PROP_NAME = 'color'; class RedBlackTree (line 12) | class RedBlackTree extends BinarySearchTree { method insert (line 17) | insert(value) { method remove (line 39) | remove(value) { method balance (line 46) | balance(node) { method leftLeftRotation (line 123) | leftLeftRotation(grandParentNode) { method leftRightRotation (line 170) | leftRightRotation(grandParentNode) { method rightRightRotation (line 198) | rightRightRotation(grandParentNode) { method rightLeftRotation (line 245) | rightLeftRotation(grandParentNode) { method makeNodeRed (line 272) | makeNodeRed(node) { method makeNodeBlack (line 282) | makeNodeBlack(node) { method isNodeRed (line 292) | isNodeRed(node) { method isNodeBlack (line 300) | isNodeBlack(node) { method isNodeColored (line 308) | isNodeColored(node) { method swapNodeColors (line 316) | swapNodeColors(firstNode, secondNode) { FILE: src/data-structures/tree/segment-tree/SegmentTree.js class SegmentTree (line 3) | class SegmentTree { method constructor (line 9) | constructor(inputArray, operation, operationFallback) { method initSegmentTree (line 24) | initSegmentTree(inputArray) { method buildSegmentTree (line 48) | buildSegmentTree() { method buildTreeRecursively (line 62) | buildTreeRecursively(leftInputIndex, rightInputIndex, position) { method rangeQuery (line 94) | rangeQuery(queryLeftIndex, queryRightIndex) { method rangeQueryRecursive (line 118) | rangeQueryRecursive(queryLeftIndex, queryRightIndex, leftIndex, rightI... method getLeftChildIndex (line 156) | getLeftChildIndex(parentIndex) { method getRightChildIndex (line 165) | getRightChildIndex(parentIndex) { FILE: src/data-structures/trie/Trie.js constant HEAD_CHARACTER (line 4) | const HEAD_CHARACTER = '*'; class Trie (line 6) | class Trie { method constructor (line 7) | constructor() { method addWord (line 15) | addWord(word) { method deleteWord (line 31) | deleteWord(word) { method suggestNextCharacters (line 70) | suggestNextCharacters(word) { method doesWordExist (line 86) | doesWordExist(word) { method getLastCharacterNode (line 96) | getLastCharacterNode(word) { FILE: src/data-structures/trie/TrieNode.js class TrieNode (line 3) | class TrieNode { method constructor (line 8) | constructor(character, isCompleteWord = false) { method getChild (line 18) | getChild(character) { method addChild (line 27) | addChild(character, isCompleteWord = false) { method removeChild (line 44) | removeChild(character) { method hasChild (line 65) | hasChild(character) { method hasChildren (line 73) | hasChildren() { method suggestChildren (line 80) | suggestChildren() { method toString (line 87) | toString() { FILE: src/playground/playground.js function playground (line 7) | function playground() { FILE: src/utils/comparator/Comparator.js class Comparator (line 1) | class Comparator { method constructor (line 7) | constructor(compareFunction) { method defaultCompareFunction (line 17) | static defaultCompareFunction(a, b) { method equal (line 31) | equal(a, b) { method lessThan (line 41) | lessThan(a, b) { method greaterThan (line 51) | greaterThan(a, b) { method lessThanOrEqual (line 61) | lessThanOrEqual(a, b) { method greaterThanOrEqual (line 71) | greaterThanOrEqual(a, b) { method reverse (line 78) | reverse() {