Skip to content

Commit aefe3e3

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

File tree

3 files changed

+265
-1
lines changed

3 files changed

+265
-1
lines changed

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

Lines changed: 179 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -216,6 +216,32 @@ <h3 id="methods">Methods
216216
</h3>
217217

218218

219+
<a id="Advanced_Algorithms_DataStructures_AVLTree_1_AsEnumerableDesc_" data-uid="Advanced.Algorithms.DataStructures.AVLTree`1.AsEnumerableDesc*"></a>
220+
<h4 id="Advanced_Algorithms_DataStructures_AVLTree_1_AsEnumerableDesc" data-uid="Advanced.Algorithms.DataStructures.AVLTree`1.AsEnumerableDesc">AsEnumerableDesc()</h4>
221+
<div class="markdown level1 summary"><p>Descending enumerable.</p>
222+
</div>
223+
<div class="markdown level1 conceptual"></div>
224+
<h5 class="decalaration">Declaration</h5>
225+
<div class="codewrapper">
226+
<pre><code class="lang-csharp hljs">public IEnumerable&lt;T&gt; AsEnumerableDesc()</code></pre>
227+
</div>
228+
<h5 class="returns">Returns</h5>
229+
<table class="table table-bordered table-striped table-condensed">
230+
<thead>
231+
<tr>
232+
<th>Type</th>
233+
<th>Description</th>
234+
</tr>
235+
</thead>
236+
<tbody>
237+
<tr>
238+
<td><span class="xref">IEnumerable</span>&lt;T&gt;</td>
239+
<td></td>
240+
</tr>
241+
</tbody>
242+
</table>
243+
244+
219245
<a id="Advanced_Algorithms_DataStructures_AVLTree_1_Contains_" data-uid="Advanced.Algorithms.DataStructures.AVLTree`1.Contains*"></a>
220246
<h4 id="Advanced_Algorithms_DataStructures_AVLTree_1_Contains__0_" data-uid="Advanced.Algorithms.DataStructures.AVLTree`1.Contains(`0)">Contains(T)</h4>
221247
<div class="markdown level1 summary"><p>Time complexity: O(log(n)).</p>
@@ -287,6 +313,49 @@ <h5 class="parameters">Parameters</h5>
287313
</table>
288314

289315

316+
<a id="Advanced_Algorithms_DataStructures_AVLTree_1_ElementAt_" data-uid="Advanced.Algorithms.DataStructures.AVLTree`1.ElementAt*"></a>
317+
<h4 id="Advanced_Algorithms_DataStructures_AVLTree_1_ElementAt_System_Int32_" data-uid="Advanced.Algorithms.DataStructures.AVLTree`1.ElementAt(System.Int32)">ElementAt(Int32)</h4>
318+
<div class="markdown level1 summary"><p>Time complexity: O(log(n))</p>
319+
</div>
320+
<div class="markdown level1 conceptual"></div>
321+
<h5 class="decalaration">Declaration</h5>
322+
<div class="codewrapper">
323+
<pre><code class="lang-csharp hljs">public T ElementAt(int index)</code></pre>
324+
</div>
325+
<h5 class="parameters">Parameters</h5>
326+
<table class="table table-bordered table-striped table-condensed">
327+
<thead>
328+
<tr>
329+
<th>Type</th>
330+
<th>Name</th>
331+
<th>Description</th>
332+
</tr>
333+
</thead>
334+
<tbody>
335+
<tr>
336+
<td><a class="xref" href="https://docs.microsoft.com/dotnet/api/system.int32">Int32</a></td>
337+
<td><span class="parametername">index</span></td>
338+
<td></td>
339+
</tr>
340+
</tbody>
341+
</table>
342+
<h5 class="returns">Returns</h5>
343+
<table class="table table-bordered table-striped table-condensed">
344+
<thead>
345+
<tr>
346+
<th>Type</th>
347+
<th>Description</th>
348+
</tr>
349+
</thead>
350+
<tbody>
351+
<tr>
352+
<td><span class="xref">T</span></td>
353+
<td></td>
354+
</tr>
355+
</tbody>
356+
</table>
357+
358+
290359
<a id="Advanced_Algorithms_DataStructures_AVLTree_1_FindMax_" data-uid="Advanced.Algorithms.DataStructures.AVLTree`1.FindMax*"></a>
291360
<h4 id="Advanced_Algorithms_DataStructures_AVLTree_1_FindMax" data-uid="Advanced.Algorithms.DataStructures.AVLTree`1.FindMax">FindMax()</h4>
292361
<div class="markdown level1 summary"><p>Time complexity: O(log(n)).</p>
@@ -364,6 +433,31 @@ <h5 class="returns">Returns</h5>
364433
</table>
365434

366435

436+
<a id="Advanced_Algorithms_DataStructures_AVLTree_1_GetEnumeratorDesc_" data-uid="Advanced.Algorithms.DataStructures.AVLTree`1.GetEnumeratorDesc*"></a>
437+
<h4 id="Advanced_Algorithms_DataStructures_AVLTree_1_GetEnumeratorDesc" data-uid="Advanced.Algorithms.DataStructures.AVLTree`1.GetEnumeratorDesc">GetEnumeratorDesc()</h4>
438+
<div class="markdown level1 summary"></div>
439+
<div class="markdown level1 conceptual"></div>
440+
<h5 class="decalaration">Declaration</h5>
441+
<div class="codewrapper">
442+
<pre><code class="lang-csharp hljs">public IEnumerator&lt;T&gt; GetEnumeratorDesc()</code></pre>
443+
</div>
444+
<h5 class="returns">Returns</h5>
445+
<table class="table table-bordered table-striped table-condensed">
446+
<thead>
447+
<tr>
448+
<th>Type</th>
449+
<th>Description</th>
450+
</tr>
451+
</thead>
452+
<tbody>
453+
<tr>
454+
<td><span class="xref">IEnumerator</span>&lt;T&gt;</td>
455+
<td></td>
456+
</tr>
457+
</tbody>
458+
</table>
459+
460+
367461
<a id="Advanced_Algorithms_DataStructures_AVLTree_1_GetHeight_" data-uid="Advanced.Algorithms.DataStructures.AVLTree`1.GetHeight*"></a>
368462
<h4 id="Advanced_Algorithms_DataStructures_AVLTree_1_GetHeight" data-uid="Advanced.Algorithms.DataStructures.AVLTree`1.GetHeight">GetHeight()</h4>
369463
<div class="markdown level1 summary"><p>Time complexity: O(log(n))</p>
@@ -433,6 +527,48 @@ <h5 class="returns">Returns</h5>
433527
</table>
434528

435529

530+
<a id="Advanced_Algorithms_DataStructures_AVLTree_1_IndexOf_" data-uid="Advanced.Algorithms.DataStructures.AVLTree`1.IndexOf*"></a>
531+
<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>
533+
<div class="markdown level1 conceptual"></div>
534+
<h5 class="decalaration">Declaration</h5>
535+
<div class="codewrapper">
536+
<pre><code class="lang-csharp hljs">public int IndexOf(T item)</code></pre>
537+
</div>
538+
<h5 class="parameters">Parameters</h5>
539+
<table class="table table-bordered table-striped table-condensed">
540+
<thead>
541+
<tr>
542+
<th>Type</th>
543+
<th>Name</th>
544+
<th>Description</th>
545+
</tr>
546+
</thead>
547+
<tbody>
548+
<tr>
549+
<td><span class="xref">T</span></td>
550+
<td><span class="parametername">item</span></td>
551+
<td></td>
552+
</tr>
553+
</tbody>
554+
</table>
555+
<h5 class="returns">Returns</h5>
556+
<table class="table table-bordered table-striped table-condensed">
557+
<thead>
558+
<tr>
559+
<th>Type</th>
560+
<th>Description</th>
561+
</tr>
562+
</thead>
563+
<tbody>
564+
<tr>
565+
<td><a class="xref" href="https://docs.microsoft.com/dotnet/api/system.int32">Int32</a></td>
566+
<td></td>
567+
</tr>
568+
</tbody>
569+
</table>
570+
571+
436572
<a id="Advanced_Algorithms_DataStructures_AVLTree_1_Insert_" data-uid="Advanced.Algorithms.DataStructures.AVLTree`1.Insert*"></a>
437573
<h4 id="Advanced_Algorithms_DataStructures_AVLTree_1_Insert__0_" data-uid="Advanced.Algorithms.DataStructures.AVLTree`1.Insert(`0)">Insert(T)</h4>
438574
<div class="markdown level1 summary"><p>Time complexity: O(log(n))</p>
@@ -547,6 +683,49 @@ <h5 class="returns">Returns</h5>
547683
</tr>
548684
</tbody>
549685
</table>
686+
687+
688+
<a id="Advanced_Algorithms_DataStructures_AVLTree_1_RemoveAt_" data-uid="Advanced.Algorithms.DataStructures.AVLTree`1.RemoveAt*"></a>
689+
<h4 id="Advanced_Algorithms_DataStructures_AVLTree_1_RemoveAt_System_Int32_" data-uid="Advanced.Algorithms.DataStructures.AVLTree`1.RemoveAt(System.Int32)">RemoveAt(Int32)</h4>
690+
<div class="markdown level1 summary"><p>Time complexity: O(log(n))</p>
691+
</div>
692+
<div class="markdown level1 conceptual"></div>
693+
<h5 class="decalaration">Declaration</h5>
694+
<div class="codewrapper">
695+
<pre><code class="lang-csharp hljs">public T RemoveAt(int index)</code></pre>
696+
</div>
697+
<h5 class="parameters">Parameters</h5>
698+
<table class="table table-bordered table-striped table-condensed">
699+
<thead>
700+
<tr>
701+
<th>Type</th>
702+
<th>Name</th>
703+
<th>Description</th>
704+
</tr>
705+
</thead>
706+
<tbody>
707+
<tr>
708+
<td><a class="xref" href="https://docs.microsoft.com/dotnet/api/system.int32">Int32</a></td>
709+
<td><span class="parametername">index</span></td>
710+
<td></td>
711+
</tr>
712+
</tbody>
713+
</table>
714+
<h5 class="returns">Returns</h5>
715+
<table class="table table-bordered table-striped table-condensed">
716+
<thead>
717+
<tr>
718+
<th>Type</th>
719+
<th>Description</th>
720+
</tr>
721+
</thead>
722+
<tbody>
723+
<tr>
724+
<td><span class="xref">T</span></td>
725+
<td></td>
726+
</tr>
727+
</tbody>
728+
</table>
550729
<h3 id="implements">Implements</h3>
551730
<div>
552731
<span class="xref">IEnumerable&lt;&gt;</span>

‎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 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 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> 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 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 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) 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)