<h1 id="sortedset">SortedSet<a aria-hidden="true" class="anchor-heading icon-link" href="#sortedset"></a></h1>
<h1 id="sortedset-1">SortedSet<a aria-hidden="true" class="anchor-heading icon-link" href="#sortedset-1"></a></h1>
<p>implements <a href="/cs/notes/tnanvy1qtu9v1k85x3pkm86">Set</a></p>
<ul>
<li><a href="/cs/notes/erabl4efwn49ad1hyh9q9xo">Duplicates - NOT Allowed</a></li>
<li><a href="/cs/notes/c8sos8r4mdfod3yi0hrbxxs">Insertion Order - Preserved</a></li>
<li>Sorting Order: Customizable</li>
</ul>
<div class="table-responsive">




































<table><thead><tr><th>Methods</th><th>Returns</th></tr></thead><tbody><tr><td><code>first()</code></td><td>first element</td></tr><tr><td><code>last()</code></td><td>last element</td></tr><tr><td><code>headSet(a)</code></td><td>elements less than <em>a</em></td></tr><tr><td><code>tailSet(a)</code></td><td>elements greater than or equal to <em>a</em></td></tr><tr><td><code>subSet(a,b)</code></td><td>elements between <em>a</em> and <em>b</em> including <em>a</em></td></tr><tr><td><code>comparator()</code></td><td>Comparator object which defines underlying sorting technique</td></tr><tr><td></td><td>(If we're using default natural sorting order, then it simply returns null)</td></tr></tbody></table></div>
<p>Child classes/interfaces:</p>
<p><a href="/cs/notes/0y56oy381qsfyzonzjl0ln8">NavigableSet</a> (I)</p>
<hr>
<strong>Children</strong>
<ol>
<li><a href="/cs/notes/0y56oy381qsfyzonzjl0ln8">NavigableSet</a></li>
</ol>
<hr>
<strong>Backlinks</strong>
<ul>
<li><a href="/cs/notes/fi3xznhjsf8ezkolih7torp">Collection Frameworks Cheatsheet (cs)</a></li>
<li><a href="/cs/notes/tnanvy1qtu9v1k85x3pkm86">Set (cs)</a></li>
<li><a href="/cs/notes/0y56oy381qsfyzonzjl0ln8">NavigableSet (cs)</a></li>
</ul>

SortedSet



These notes are arranged into the below topics:

- AI (Sorry this is on the top, list is alphabetic)
- [[arch]]
- Data
- Execution
- Languages
- Semantics
- [[paradigm]]
- Philosophy
- Dev
- Tools
- Type Theory

## References

- Hierarchy inpiration - [Map of Computer Science](https://www.flickr.com/photos/95869671@N08/36231833334/in/photostream/lightbox/)

Methods	Returns
`first()`	first element
`last()`	last element
`headSet(a)`	elements less than a
`tailSet(a)`	elements greater than or equal to a
`subSet(a,b)`	elements between a and b including a
`comparator()`	Comparator object which defines underlying sorting technique
	(If we're using default natural sorting order, then it simply returns null)