-
Notifications
You must be signed in to change notification settings - Fork 298
/
Copy pathAdvanced.Algorithms.DataStructures.Foundation.SortedHashSet-1.html
631 lines (590 loc) · 22.6 KB
/
Advanced.Algorithms.DataStructures.Foundation.SortedHashSet-1.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
<!DOCTYPE html>
<!--[if IE]><![endif]-->
<html>
<head>
<meta charset="utf-8">
<meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1">
<title>Class SortedHashSet<T>
| Advanced Algorithms </title>
<meta name="viewport" content="width=device-width">
<meta name="title" content="Class SortedHashSet<T>
| Advanced Algorithms ">
<meta name="generator" content="docfx 2.40.0.0">
<link rel="shortcut icon" href="../favicon.ico">
<link rel="stylesheet" href="../styles/docfx.vendor.css">
<link rel="stylesheet" href="../styles/docfx.css">
<link rel="stylesheet" href="../styles/main.css">
<meta property="docfx:navrel" content="">
<meta property="docfx:tocrel" content="toc.html">
<meta property="docfx:rel" content="../">
</head>
<body data-spy="scroll" data-target="#affix" data-offset="120">
<div id="wrapper">
<header>
<nav id="autocollapse" class="navbar navbar-inverse ng-scope" role="navigation">
<div class="container">
<div class="navbar-header">
<button type="button" class="navbar-toggle" data-toggle="collapse" data-target="#navbar">
<span class="sr-only">Toggle navigation</span>
<span class="icon-bar"></span>
<span class="icon-bar"></span>
<span class="icon-bar"></span>
</button>
<a class="navbar-brand" href="../index.html">
<img id="logo" class="svg" src="../logo.svg" alt="">
</a>
</div>
<div class="collapse navbar-collapse" id="navbar">
<form class="navbar-form navbar-right" role="search" id="search">
<div class="form-group">
<input type="text" class="form-control" id="search-query" placeholder="Search" autocomplete="off">
</div>
</form>
</div>
</div>
</nav>
<div class="subnav navbar navbar-default">
<div class="container hide-when-search" id="breadcrumb">
<ul class="breadcrumb">
<li></li>
</ul>
</div>
</div>
</header>
<div class="container body-content">
<div id="search-results">
<div class="search-list"></div>
<div class="sr-items">
<p><i class="glyphicon glyphicon-refresh index-loading"></i></p>
</div>
<ul id="pagination"></ul>
</div>
</div>
<div role="main" class="container body-content hide-when-search">
<div class="sidenav hide-when-search">
<a class="btn toc-toggle collapse" data-toggle="collapse" href="#sidetoggle" aria-expanded="false" aria-controls="sidetoggle">Show / Hide Table of Contents</a>
<div class="sidetoggle collapse" id="sidetoggle">
<div id="sidetoc"></div>
</div>
</div>
<div class="article row grid-right">
<div class="col-md-10">
<article class="content wrap" id="_content" data-uid="Advanced.Algorithms.DataStructures.Foundation.SortedHashSet`1">
<h1 id="Advanced_Algorithms_DataStructures_Foundation_SortedHashSet_1" data-uid="Advanced.Algorithms.DataStructures.Foundation.SortedHashSet`1" class="text-break">Class SortedHashSet<T>
</h1>
<div class="markdown level0 summary"><p>A sorted HashSet implementation using balanced binary search tree. IEnumerable will enumerate in sorted order.
This may be better than regular HashSet implementation which can give o(K) in worst case (but O(1) amortized when collisions K is avoided).</p>
</div>
<div class="markdown level0 conceptual"></div>
<div class="inheritance">
<h5>Inheritance</h5>
<div class="level0"><a class="xref" href="https://docs.microsoft.com/dotnet/api/system.object">Object</a></div>
<div class="level1"><span class="xref">SortedHashSet<T></span></div>
</div>
<h6><strong>Namespace</strong>: <a class="xref" href="Advanced.Algorithms.DataStructures.Foundation.html">Advanced.Algorithms.DataStructures.Foundation</a></h6>
<h6><strong>Assembly</strong>: Advanced.Algorithms.dll</h6>
<h5 id="Advanced_Algorithms_DataStructures_Foundation_SortedHashSet_1_syntax">Syntax</h5>
<div class="codewrapper">
<pre><code class="lang-csharp hljs">public class SortedHashSet<T> : IEnumerable<T> where T : IComparable</code></pre>
</div>
<h5 class="typeParameters">Type Parameters</h5>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Name</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><span class="parametername">T</span></td>
<td><p>The value datatype.</p>
</td>
</tr>
</tbody>
</table>
<h3 id="constructors">Constructors
</h3>
<a id="Advanced_Algorithms_DataStructures_Foundation_SortedHashSet_1__ctor_" data-uid="Advanced.Algorithms.DataStructures.Foundation.SortedHashSet`1.#ctor*"></a>
<h4 id="Advanced_Algorithms_DataStructures_Foundation_SortedHashSet_1__ctor" data-uid="Advanced.Algorithms.DataStructures.Foundation.SortedHashSet`1.#ctor">SortedHashSet()</h4>
<div class="markdown level1 summary"></div>
<div class="markdown level1 conceptual"></div>
<h5 class="decalaration">Declaration</h5>
<div class="codewrapper">
<pre><code class="lang-csharp hljs">public SortedHashSet()</code></pre>
</div>
<a id="Advanced_Algorithms_DataStructures_Foundation_SortedHashSet_1__ctor_" data-uid="Advanced.Algorithms.DataStructures.Foundation.SortedHashSet`1.#ctor*"></a>
<h4 id="Advanced_Algorithms_DataStructures_Foundation_SortedHashSet_1__ctor_IEnumerable__0__" data-uid="Advanced.Algorithms.DataStructures.Foundation.SortedHashSet`1.#ctor(IEnumerable{`0})">SortedHashSet(IEnumerable<T>)</h4>
<div class="markdown level1 summary"><p>Initialize the sorted hashset with given sorted key collection.
Time complexity: log(n).</p>
</div>
<div class="markdown level1 conceptual"></div>
<h5 class="decalaration">Declaration</h5>
<div class="codewrapper">
<pre><code class="lang-csharp hljs">public SortedHashSet(IEnumerable<T> sortedKeys)</code></pre>
</div>
<h5 class="parameters">Parameters</h5>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Type</th>
<th>Name</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><span class="xref">IEnumerable</span><T></td>
<td><span class="parametername">sortedKeys</span></td>
<td></td>
</tr>
</tbody>
</table>
<h3 id="properties">Properties
</h3>
<a id="Advanced_Algorithms_DataStructures_Foundation_SortedHashSet_1_Count_" data-uid="Advanced.Algorithms.DataStructures.Foundation.SortedHashSet`1.Count*"></a>
<h4 id="Advanced_Algorithms_DataStructures_Foundation_SortedHashSet_1_Count" data-uid="Advanced.Algorithms.DataStructures.Foundation.SortedHashSet`1.Count">Count</h4>
<div class="markdown level1 summary"></div>
<div class="markdown level1 conceptual"></div>
<h5 class="decalaration">Declaration</h5>
<div class="codewrapper">
<pre><code class="lang-csharp hljs">public int Count { get; }</code></pre>
</div>
<h5 class="propertyValue">Property Value</h5>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Type</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><a class="xref" href="https://docs.microsoft.com/dotnet/api/system.int32">Int32</a></td>
<td></td>
</tr>
</tbody>
</table>
<a id="Advanced_Algorithms_DataStructures_Foundation_SortedHashSet_1_Item_" data-uid="Advanced.Algorithms.DataStructures.Foundation.SortedHashSet`1.Item*"></a>
<h4 id="Advanced_Algorithms_DataStructures_Foundation_SortedHashSet_1_Item_System_Int32_" data-uid="Advanced.Algorithms.DataStructures.Foundation.SortedHashSet`1.Item(System.Int32)">Item[Int32]</h4>
<div class="markdown level1 summary"><p>Time complexity: O(log(n))</p>
</div>
<div class="markdown level1 conceptual"></div>
<h5 class="decalaration">Declaration</h5>
<div class="codewrapper">
<pre><code class="lang-csharp hljs">public T this[int index] { get; }</code></pre>
</div>
<h5 class="parameters">Parameters</h5>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Type</th>
<th>Name</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><a class="xref" href="https://docs.microsoft.com/dotnet/api/system.int32">Int32</a></td>
<td><span class="parametername">index</span></td>
<td></td>
</tr>
</tbody>
</table>
<h5 class="propertyValue">Property Value</h5>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Type</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><span class="xref">T</span></td>
<td></td>
</tr>
</tbody>
</table>
<h3 id="methods">Methods
</h3>
<a id="Advanced_Algorithms_DataStructures_Foundation_SortedHashSet_1_Add_" data-uid="Advanced.Algorithms.DataStructures.Foundation.SortedHashSet`1.Add*"></a>
<h4 id="Advanced_Algorithms_DataStructures_Foundation_SortedHashSet_1_Add__0_" data-uid="Advanced.Algorithms.DataStructures.Foundation.SortedHashSet`1.Add(`0)">Add(T)</h4>
<div class="markdown level1 summary"><p>Add a new value.
Time complexity: O(log(n)).</p>
</div>
<div class="markdown level1 conceptual"></div>
<h5 class="decalaration">Declaration</h5>
<div class="codewrapper">
<pre><code class="lang-csharp hljs">public void Add(T value)</code></pre>
</div>
<h5 class="parameters">Parameters</h5>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Type</th>
<th>Name</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><span class="xref">T</span></td>
<td><span class="parametername">value</span></td>
<td><p>The value to add.</p>
</td>
</tr>
</tbody>
</table>
<a id="Advanced_Algorithms_DataStructures_Foundation_SortedHashSet_1_Contains_" data-uid="Advanced.Algorithms.DataStructures.Foundation.SortedHashSet`1.Contains*"></a>
<h4 id="Advanced_Algorithms_DataStructures_Foundation_SortedHashSet_1_Contains__0_" data-uid="Advanced.Algorithms.DataStructures.Foundation.SortedHashSet`1.Contains(`0)">Contains(T)</h4>
<div class="markdown level1 summary"><p>Does this hash table contains the given value.
Time complexity: O(log(n)).</p>
</div>
<div class="markdown level1 conceptual"></div>
<h5 class="decalaration">Declaration</h5>
<div class="codewrapper">
<pre><code class="lang-csharp hljs">public bool Contains(T value)</code></pre>
</div>
<h5 class="parameters">Parameters</h5>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Type</th>
<th>Name</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><span class="xref">T</span></td>
<td><span class="parametername">value</span></td>
<td><p>The value to check.</p>
</td>
</tr>
</tbody>
</table>
<h5 class="returns">Returns</h5>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Type</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><a class="xref" href="https://docs.microsoft.com/dotnet/api/system.boolean">Boolean</a></td>
<td><p>True if this hashset contains the given value.</p>
</td>
</tr>
</tbody>
</table>
<a id="Advanced_Algorithms_DataStructures_Foundation_SortedHashSet_1_ElementAt_" data-uid="Advanced.Algorithms.DataStructures.Foundation.SortedHashSet`1.ElementAt*"></a>
<h4 id="Advanced_Algorithms_DataStructures_Foundation_SortedHashSet_1_ElementAt_System_Int32_" data-uid="Advanced.Algorithms.DataStructures.Foundation.SortedHashSet`1.ElementAt(System.Int32)">ElementAt(Int32)</h4>
<div class="markdown level1 summary"><p>Time complexity: O(log(n))</p>
</div>
<div class="markdown level1 conceptual"></div>
<h5 class="decalaration">Declaration</h5>
<div class="codewrapper">
<pre><code class="lang-csharp hljs">public T ElementAt(int index)</code></pre>
</div>
<h5 class="parameters">Parameters</h5>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Type</th>
<th>Name</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><a class="xref" href="https://docs.microsoft.com/dotnet/api/system.int32">Int32</a></td>
<td><span class="parametername">index</span></td>
<td></td>
</tr>
</tbody>
</table>
<h5 class="returns">Returns</h5>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Type</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><span class="xref">T</span></td>
<td></td>
</tr>
</tbody>
</table>
<a id="Advanced_Algorithms_DataStructures_Foundation_SortedHashSet_1_GetEnumerator_" data-uid="Advanced.Algorithms.DataStructures.Foundation.SortedHashSet`1.GetEnumerator*"></a>
<h4 id="Advanced_Algorithms_DataStructures_Foundation_SortedHashSet_1_GetEnumerator" data-uid="Advanced.Algorithms.DataStructures.Foundation.SortedHashSet`1.GetEnumerator">GetEnumerator()</h4>
<div class="markdown level1 summary"></div>
<div class="markdown level1 conceptual"></div>
<h5 class="decalaration">Declaration</h5>
<div class="codewrapper">
<pre><code class="lang-csharp hljs">public IEnumerator<T> GetEnumerator()</code></pre>
</div>
<h5 class="returns">Returns</h5>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Type</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><span class="xref">IEnumerator</span><T></td>
<td></td>
</tr>
</tbody>
</table>
<a id="Advanced_Algorithms_DataStructures_Foundation_SortedHashSet_1_IndexOf_" data-uid="Advanced.Algorithms.DataStructures.Foundation.SortedHashSet`1.IndexOf*"></a>
<h4 id="Advanced_Algorithms_DataStructures_Foundation_SortedHashSet_1_IndexOf__0_" data-uid="Advanced.Algorithms.DataStructures.Foundation.SortedHashSet`1.IndexOf(`0)">IndexOf(T)</h4>
<div class="markdown level1 summary"><p>Time complexity: O(log(n))</p>
</div>
<div class="markdown level1 conceptual"></div>
<h5 class="decalaration">Declaration</h5>
<div class="codewrapper">
<pre><code class="lang-csharp hljs">public int IndexOf(T key)</code></pre>
</div>
<h5 class="parameters">Parameters</h5>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Type</th>
<th>Name</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><span class="xref">T</span></td>
<td><span class="parametername">key</span></td>
<td></td>
</tr>
</tbody>
</table>
<h5 class="returns">Returns</h5>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Type</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><a class="xref" href="https://docs.microsoft.com/dotnet/api/system.int32">Int32</a></td>
<td></td>
</tr>
</tbody>
</table>
<a id="Advanced_Algorithms_DataStructures_Foundation_SortedHashSet_1_NextHigher_" data-uid="Advanced.Algorithms.DataStructures.Foundation.SortedHashSet`1.NextHigher*"></a>
<h4 id="Advanced_Algorithms_DataStructures_Foundation_SortedHashSet_1_NextHigher__0_" data-uid="Advanced.Algorithms.DataStructures.Foundation.SortedHashSet`1.NextHigher(`0)">NextHigher(T)</h4>
<div class="markdown level1 summary"><p>Return the next higher value after given value in this hashset.
Time complexity: O(log(n)).</p>
</div>
<div class="markdown level1 conceptual"></div>
<h5 class="decalaration">Declaration</h5>
<div class="codewrapper">
<pre><code class="lang-csharp hljs">public T NextHigher(T value)</code></pre>
</div>
<h5 class="parameters">Parameters</h5>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Type</th>
<th>Name</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><span class="xref">T</span></td>
<td><span class="parametername">value</span></td>
<td></td>
</tr>
</tbody>
</table>
<h5 class="returns">Returns</h5>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Type</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><span class="xref">T</span></td>
<td><p>Null if the given value does'nt exist or next value does'nt exist.</p>
</td>
</tr>
</tbody>
</table>
<a id="Advanced_Algorithms_DataStructures_Foundation_SortedHashSet_1_NextLower_" data-uid="Advanced.Algorithms.DataStructures.Foundation.SortedHashSet`1.NextLower*"></a>
<h4 id="Advanced_Algorithms_DataStructures_Foundation_SortedHashSet_1_NextLower__0_" data-uid="Advanced.Algorithms.DataStructures.Foundation.SortedHashSet`1.NextLower(`0)">NextLower(T)</h4>
<div class="markdown level1 summary"><p>Return the next lower value before given value in this HashSet.
Time complexity: O(log(n)).</p>
</div>
<div class="markdown level1 conceptual"></div>
<h5 class="decalaration">Declaration</h5>
<div class="codewrapper">
<pre><code class="lang-csharp hljs">public T NextLower(T value)</code></pre>
</div>
<h5 class="parameters">Parameters</h5>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Type</th>
<th>Name</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><span class="xref">T</span></td>
<td><span class="parametername">value</span></td>
<td></td>
</tr>
</tbody>
</table>
<h5 class="returns">Returns</h5>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Type</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><span class="xref">T</span></td>
<td><p>Null if the given value does'nt exist or previous value does'nt exist.</p>
</td>
</tr>
</tbody>
</table>
<a id="Advanced_Algorithms_DataStructures_Foundation_SortedHashSet_1_Remove_" data-uid="Advanced.Algorithms.DataStructures.Foundation.SortedHashSet`1.Remove*"></a>
<h4 id="Advanced_Algorithms_DataStructures_Foundation_SortedHashSet_1_Remove__0_" data-uid="Advanced.Algorithms.DataStructures.Foundation.SortedHashSet`1.Remove(`0)">Remove(T)</h4>
<div class="markdown level1 summary"><p>Remove the given value.
Time complexity: O(log(n)).</p>
</div>
<div class="markdown level1 conceptual"></div>
<h5 class="decalaration">Declaration</h5>
<div class="codewrapper">
<pre><code class="lang-csharp hljs">public bool Remove(T value)</code></pre>
</div>
<h5 class="parameters">Parameters</h5>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Type</th>
<th>Name</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><span class="xref">T</span></td>
<td><span class="parametername">value</span></td>
<td><p>The value to remove.</p>
</td>
</tr>
</tbody>
</table>
<h5 class="returns">Returns</h5>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Type</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><a class="xref" href="https://docs.microsoft.com/dotnet/api/system.boolean">Boolean</a></td>
<td></td>
</tr>
</tbody>
</table>
<a id="Advanced_Algorithms_DataStructures_Foundation_SortedHashSet_1_RemoveAt_" data-uid="Advanced.Algorithms.DataStructures.Foundation.SortedHashSet`1.RemoveAt*"></a>
<h4 id="Advanced_Algorithms_DataStructures_Foundation_SortedHashSet_1_RemoveAt_System_Int32_" data-uid="Advanced.Algorithms.DataStructures.Foundation.SortedHashSet`1.RemoveAt(System.Int32)">RemoveAt(Int32)</h4>
<div class="markdown level1 summary"><p>Remove the element at given index.
Time complexity: O(log(n)).</p>
</div>
<div class="markdown level1 conceptual"></div>
<h5 class="decalaration">Declaration</h5>
<div class="codewrapper">
<pre><code class="lang-csharp hljs">public T RemoveAt(int index)</code></pre>
</div>
<h5 class="parameters">Parameters</h5>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Type</th>
<th>Name</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><a class="xref" href="https://docs.microsoft.com/dotnet/api/system.int32">Int32</a></td>
<td><span class="parametername">index</span></td>
<td></td>
</tr>
</tbody>
</table>
<h5 class="returns">Returns</h5>
<table class="table table-bordered table-striped table-condensed">
<thead>
<tr>
<th>Type</th>
<th>Description</th>
</tr>
</thead>
<tbody>
<tr>
<td><span class="xref">T</span></td>
<td></td>
</tr>
</tbody>
</table>
</article>
</div>
<div class="hidden-sm col-md-2" role="complementary">
<div class="sideaffix">
<div class="contribution">
<ul class="nav">
</ul>
</div>
<nav class="bs-docs-sidebar hidden-print hidden-xs hidden-sm affix" id="affix">
<!-- <p><a class="back-to-top" href="#top">Back to top</a><p> -->
</nav>
</div>
</div>
</div>
</div>
<footer>
<div class="grad-bottom"></div>
<div class="footer">
<div class="container">
<span class="pull-right">
<a href="#top">Back to top</a>
</span>
<span>Generated by <strong>DocFX</strong></span>
</div>
</div>
</footer>
</div>
<script type="text/javascript" src="../styles/docfx.vendor.js"></script>
<script type="text/javascript" src="../styles/docfx.js"></script>
<script type="text/javascript" src="../styles/main.js"></script>
</body>
</html>