Issue 2 in backlinq: Sorting operators perform unstable sort

1 view
Skip to first unread message

codesite...@google.com

unread,
Aug 10, 2008, 8:27:21 PM8/10/08
to backlin...@googlegroups.com
Issue 2: Sorting operators perform unstable sort
http://code.google.com/p/backlinq/issues/detail?id=2

New issue report by azizatif:
The documentation for Enumerable.OrderBy in .NET Framework 3.5 says that
the method performs a stable sort. The BackLINQ implementation performs an
unstable sort; that is, if two elements are equal, their order might not
be preserved. In contrast, a stable sort preserves the order of elements
that are equal. In the interest of 100% compatibility, the BackLINQ
implementation should perform a stable sort as well.


Issue attributes:
Status: Accepted
Owner: azizatif
Labels: Type-Defect Priority-Medium

--
You received this message because you are listed in the owner
or CC fields of this issue, or because you starred this issue.
You may adjust your issue notification preferences at:
http://code.google.com/hosting/settings

codesite...@google.com

unread,
Aug 10, 2008, 8:31:21 PM8/10/08
to backlin...@googlegroups.com
Issue 2: Sorting operators perform unstable sort
http://code.google.com/p/backlinq/issues/detail?id=2

Comment #1 by azizatif:
(No comment was entered for this change.)


Issue attribute updates:
Status: Duplicate

Reply all
Reply to author
Forward
0 new messages