Algorithms and data structures for JS/TS
  • Introduction
  • GETTING STARTED
    • TS
    • Node.js
    • ES Modules
    • Browsers
  • PUBLIC API
    • How to read
    • Linked lists
      • SinglyLinkedList
      • DoublyLinkedList
      • CircularlyLinkedList
    • Stacks and queues
      • LinkedStack
      • LinkedQueue
      • LinkedDeque
      • CircularQueue
      • CircularArrayBuffer
      • UnsortedPriorityQueue
      • SortedPriorityQueue
      • AdaptableHeapPriorityQueue
    • Maps
      • SortedMap
      • MaximaSet
      • AVLTreeMap
      • SplayTreeMap
      • RedBlackTreeMap
    • Trees
      • GeneralTree
      • LinkedBinaryTree
      • PreorderTreeTraversal
      • InorderTreeTraversal
      • PostorderTreeTraversal
      • EulerTourTreeTraversal
    • Searches
      • Binary search
      • Quick select
    • Text processing
      • Longest common subsequence
      • Boyer-Moore
      • Knuth-Morris-Pratt
    • Position
    • Locator
    • Comparators
  • CONTRIBUTION NOTES
    • How to contribute
    • Project structure
  • Changelog
Powered by GitBook
On this page

Was this helpful?

  1. PUBLIC API

How to read

PreviousBrowsersNextLinked lists

Last updated 5 years ago

Was this helpful?

Classes and functions in this section are grouped together by their corresponding topics in the computer science. Data structures are implemented in an object-oriented way to couple data and operations on it. Realizations of distinct algorithms for simplicity and convenience follow the functional approach.

Documentation for classes includes:

  • Name of a class

  • Brief description (usually taken from comment attached to the class in source code)

  • Detailed description (explains how this class is implemented, its purpose and possible caveats)

  • Specifications for constructor, properties and methods sorted alphabetically with code samples explaining usage of the described property/method

Documentation for algorithms includes:

  • Name of an algorithm

  • Its definition in computer science

  • Usage notes (pros and cons, typical use-cases)

  • Specifications for ADSJS functions implementing this algorithm and their details

Work on the documentation is still in progress. Some parts of this section may be not finished yet or lack of examples so please refer to this package's for additional information. If you are willing to help please visit .

specs on Github
how to contribute