Created
September 5, 2013 13:07
-
-
Save bretkoppel/6449868 to your computer and use it in GitHub Desktop.
dotPeek decompilation of SortedSet<T>.FindNode
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| internal virtual SortedSet<T>.Node FindNode(T item) | |
| { | |
| for (SortedSet<T>.Node node = this.root; node != null; { | |
| int num; | |
| node = num < 0 ? node.Left : node.Right; | |
| } | |
| ) | |
| { | |
| num = this.comparer.Compare(item, node.Item); | |
| if (num == 0) | |
| return node; | |
| } | |
| return (SortedSet<T>.Node) null; | |
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment