Welcome to the Lounge

we conspired to create a virtual reality,
to build a nest of misunderstanding with
fragments of false memories, bits of woe
and joy veneered with faux rainbow shiny

oh, the beauty of our first egg, mottled
with fires of iridescent gems: a perfect
echo of imperfections erased in a mirror
of self-delusion's simulations of sanity

in this unpixelated bliss we conjured: a,
subject-object dichotomy gave us giggles;
half-dead, half-alive, cats serenaded us
with fugues of quantum entangled screech
 
ah, wondrous eternity when our first egg
hatches, and, we are chicky's first meal

LINQ's Last extension method will enumerate over the *entire* collection giving
a time complexity of O(n) regardless of the data structure.  This is due to the
"one size fits all" approach of LINQ.  SortedDictionary supplies no optimized
implementation of Last. Also, SortedDictionary does not supply any optimized
way of performing queries based on a key range.  Again, the time complexity of
such an operation is O(n).

Loading SortedDictionary with 5000000 elements:

Load time = 4297ms
Last time = 244ms

SortedBPlusTreeDictionary has its own implementation of Last() which does not suffer the
performance hit that SortedDictionary.Last() does.  SortedBPlusTreeDictionary also
supports optimized range queries with its SkipUntilKey(TKey) and
BetweenKeys(TKey,TKey) methods.

Loading SortedBPlusTreeDictionary with 5000000 elements:

Load time = 4520ms
Last time = 1ms
Range time = 12ms