Skip to content

Commit 825cbca

Browse files
author
buildbot121
committed
API documentation update by build server
1 parent aefe3e3 commit 825cbca

File tree

2 files changed

+3
-2
lines changed

2 files changed

+3
-2
lines changed

docs/api/Advanced.Algorithms.DataStructures.AVLTree-1.html

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -529,7 +529,8 @@ <h5 class="returns">Returns</h5>
529529

530530
<a id="Advanced_Algorithms_DataStructures_AVLTree_1_IndexOf_" data-uid="Advanced.Algorithms.DataStructures.AVLTree`1.IndexOf*"></a>
531531
<h4 id="Advanced_Algorithms_DataStructures_AVLTree_1_IndexOf__0_" data-uid="Advanced.Algorithms.DataStructures.AVLTree`1.IndexOf(`0)">IndexOf(T)</h4>
532-
<div class="markdown level1 summary"></div>
532+
<div class="markdown level1 summary"><p>Time complexity: O(log(n))</p>
533+
</div>
533534
<div class="markdown level1 conceptual"></div>
534535
<h5 class="decalaration">Declaration</h5>
535536
<div class="codewrapper">

docs/index.json

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -52,7 +52,7 @@
5252
"api/Advanced.Algorithms.DataStructures.AVLTree-1.html": {
5353
"href": "api/Advanced.Algorithms.DataStructures.AVLTree-1.html",
5454
"title": "Class AVLTree<T> | Advanced Algorithms",
55-
"keywords": "Class AVLTree<T> An AVL tree implementation. Inheritance Object BSTBase <T> AVLTree<T> Implements IEnumerable <T> Namespace : Advanced.Algorithms.DataStructures Assembly : Advanced.Algorithms.dll Syntax public class AVLTree<T> : BSTBase<T>, IEnumerable<T> where T : IComparable Type Parameters Name Description T Constructors AVLTree(IEnumerable<T>, Boolean) Initialize the BST with given sorted keys. Time complexity: O(n). Declaration public AVLTree(IEnumerable<T> sortedKeys, bool enableNodeLookUp = false) Parameters Type Name Description IEnumerable <T> sortedKeys The sorted keys. Boolean enableNodeLookUp Enabling lookup will fasten deletion/insertion/exists operations at the cost of additional space. AVLTree(Boolean) Declaration public AVLTree(bool enableNodeLookUp = false) Parameters Type Name Description Boolean enableNodeLookUp Enabling lookup will fasten deletion/insertion/exists operations at the cost of additional space. Properties Count Declaration public int Count { get; } Property Value Type Description Int32 Methods AsEnumerableDesc() Descending enumerable. Declaration public IEnumerable<T> AsEnumerableDesc() Returns Type Description IEnumerable <T> Contains(T) Time complexity: O(log(n)). Declaration public bool Contains(T value) Parameters Type Name Description T value Returns Type Description Boolean Delete(T) Time complexity: O(log(n)). Declaration public void Delete(T value) Parameters Type Name Description T value ElementAt(Int32) Time complexity: O(log(n)) Declaration public T ElementAt(int index) Parameters Type Name Description Int32 index Returns Type Description T FindMax() Time complexity: O(log(n)). Declaration public T FindMax() Returns Type Description T FindMin() Time complexity: O(log(n)). Declaration public T FindMin() Returns Type Description T GetEnumerator() Declaration public IEnumerator<T> GetEnumerator() Returns Type Description IEnumerator <T> GetEnumeratorDesc() Declaration public IEnumerator<T> GetEnumeratorDesc() Returns Type Description IEnumerator <T> GetHeight() Time complexity: O(log(n)) Declaration public int GetHeight() Returns Type Description Int32 HasItem(T) Time complexity: O(log(n)) Declaration public bool HasItem(T value) Parameters Type Name Description T value Returns Type Description Boolean IndexOf(T) Declaration public int IndexOf(T item) Parameters Type Name Description T item Returns Type Description Int32 Insert(T) Time complexity: O(log(n)) Declaration public void Insert(T value) Parameters Type Name Description T value NextHigher(T) Get the next higher value to given value in this BST. Time complexity: O(log(n)) Declaration public T NextHigher(T value) Parameters Type Name Description T value Returns Type Description T NextLower(T) Get the next lower value to given value in this BST. Time complexity: O(log(n)) Declaration public T NextLower(T value) Parameters Type Name Description T value Returns Type Description T RemoveAt(Int32) Time complexity: O(log(n)) Declaration public T RemoveAt(int index) Parameters Type Name Description Int32 index Returns Type Description T Implements IEnumerable<>"
55+
"keywords": "Class AVLTree<T> An AVL tree implementation. Inheritance Object BSTBase <T> AVLTree<T> Implements IEnumerable <T> Namespace : Advanced.Algorithms.DataStructures Assembly : Advanced.Algorithms.dll Syntax public class AVLTree<T> : BSTBase<T>, IEnumerable<T> where T : IComparable Type Parameters Name Description T Constructors AVLTree(IEnumerable<T>, Boolean) Initialize the BST with given sorted keys. Time complexity: O(n). Declaration public AVLTree(IEnumerable<T> sortedKeys, bool enableNodeLookUp = false) Parameters Type Name Description IEnumerable <T> sortedKeys The sorted keys. Boolean enableNodeLookUp Enabling lookup will fasten deletion/insertion/exists operations at the cost of additional space. AVLTree(Boolean) Declaration public AVLTree(bool enableNodeLookUp = false) Parameters Type Name Description Boolean enableNodeLookUp Enabling lookup will fasten deletion/insertion/exists operations at the cost of additional space. Properties Count Declaration public int Count { get; } Property Value Type Description Int32 Methods AsEnumerableDesc() Descending enumerable. Declaration public IEnumerable<T> AsEnumerableDesc() Returns Type Description IEnumerable <T> Contains(T) Time complexity: O(log(n)). Declaration public bool Contains(T value) Parameters Type Name Description T value Returns Type Description Boolean Delete(T) Time complexity: O(log(n)). Declaration public void Delete(T value) Parameters Type Name Description T value ElementAt(Int32) Time complexity: O(log(n)) Declaration public T ElementAt(int index) Parameters Type Name Description Int32 index Returns Type Description T FindMax() Time complexity: O(log(n)). Declaration public T FindMax() Returns Type Description T FindMin() Time complexity: O(log(n)). Declaration public T FindMin() Returns Type Description T GetEnumerator() Declaration public IEnumerator<T> GetEnumerator() Returns Type Description IEnumerator <T> GetEnumeratorDesc() Declaration public IEnumerator<T> GetEnumeratorDesc() Returns Type Description IEnumerator <T> GetHeight() Time complexity: O(log(n)) Declaration public int GetHeight() Returns Type Description Int32 HasItem(T) Time complexity: O(log(n)) Declaration public bool HasItem(T value) Parameters Type Name Description T value Returns Type Description Boolean IndexOf(T) Time complexity: O(log(n)) Declaration public int IndexOf(T item) Parameters Type Name Description T item Returns Type Description Int32 Insert(T) Time complexity: O(log(n)) Declaration public void Insert(T value) Parameters Type Name Description T value NextHigher(T) Get the next higher value to given value in this BST. Time complexity: O(log(n)) Declaration public T NextHigher(T value) Parameters Type Name Description T value Returns Type Description T NextLower(T) Get the next lower value to given value in this BST. Time complexity: O(log(n)) Declaration public T NextLower(T value) Parameters Type Name Description T value Returns Type Description T RemoveAt(Int32) Time complexity: O(log(n)) Declaration public T RemoveAt(int index) Parameters Type Name Description Int32 index Returns Type Description T Implements IEnumerable<>"
5656
},
5757
"api/Advanced.Algorithms.DataStructures.BHeap-1.html": {
5858
"href": "api/Advanced.Algorithms.DataStructures.BHeap-1.html",

0 commit comments

Comments
 (0)