StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
20812887
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2013-12-28T09:20:06.513
FavoriteCount
0
LastActivityDate
2013-12-29T07:55:35.017
LastEditDate
2013-12-29T07:55:35.017
LastEditorUserId
1382701
OwnerUserId
1382701
ParentId
20363810
PostTypeId
2
Score
0
ViewCount
0
LastEditorDisplayName
text
Body
view my code snippet <a href="http://rextester.com/VUJQ53092" rel="nofollow">here</a>. it's just for first level sorting and not optimized. OrderBy and ThenBy are using general algorithm. you need to re-implement OrderBy and ThenBy with special algorithm like mine. then it can work as <code>OrderBy().ThenBy()</code>. Detail of algorithm: in a sorted sequence(x1 x2 x3...) under your EpsilonComparer, if x4>x1, then x5>x1. if x4=x1, then x3=x1 and either x5>x1 or x5=x1. with epsilon(0.4), input following numbers:0.1, 0.6, 1, 1.1, 1.6, 2, 2, 2.6, 3, 3.1, 3.6, 4, 4.1, 4.6, 5, 5.1, 5.6, 6, 6.1, 6.6 result:0.1 0.6 1 1.1 (1.6 2 2 ) 2.6 3 3.1 3.6 4 4.1 4.6 (5 5.1 ) 5.6 (6 6.1 ) 6.6 (a,b,c) indicates these numbers are equal and the order of numbers is not fixed. they can be (a,b,c), (c,a,b) and any other order. a b indicates a <pre><code>using System; using System.Collections.Generic; using System.Linq; namespace Rextester { class Program { public static void Main(string[] args) { new EpsilonSort(new EpsilonComparer(0.4), 0.1, 0.6, 1, 1.1, 1.6, 2, 2, 2.6, 3, 3.1, 3.6, 4, 4.1, 4.6, 5, 5.1, 5.6, 6, 6.1, 6.6).Sort(); } } public class EpsilonSort { private readonly IComparer<double> m_comparer; private readonly double[] m_nums; public EpsilonSort(IComparer<double> comparer, params double[] nums) { this.m_comparer = comparer; this.m_nums = nums; } public void Sort() { Node root = new Node(); root.Datas = new List<double>(this.m_nums); foreach (double i in (double[])this.m_nums.Clone()) { this.ProcessNode(i, root); } this.OutputNodes(root); } private void OutputNodes(Node root) { if (root.Datas == null) { foreach (var i in root.Nodes) { this.OutputNodes(i); } } else { if (root.Datas.Count == 1) { Console.WriteLine(root.Datas[0]); } else { Console.Write('('); foreach (var i in root.Datas) { Console.Write(i); Console.Write(' '); } Console.WriteLine(')'); } } } private void ProcessNode(double value, Node one) { if (one.Datas == null) { foreach (var i in one.Nodes) { this.ProcessNode(value, i); } } else { Node[] childrennodes = new Node[3]; foreach (var i in one.Datas) { int direction = this.m_comparer.Compare(i, value); if (direction == 0) { this.AddData(ref childrennodes[1], i); } else { if (direction < 0) { this.AddData(ref childrennodes[0], i); } else { this.AddData(ref childrennodes[2], i); } } } childrennodes = childrennodes.Where(x => x != null).ToArray(); if (childrennodes.Length >= 2) { one.Datas = null; one.Nodes = childrennodes; } } } private void AddData(ref Node node, double value) { node = node ?? new Node(); node.Datas = node.Datas ?? new List<double>(); node.Datas.Add(value); } private class Node { public Node[] Nodes; public List<double> Datas; } } public class EpsilonComparer : IComparer<double> { private readonly double epsilon; public EpsilonComparer(double epsilon) { this.epsilon = epsilon; } public int Compare(double d1, double d2) { if (Math.Abs(d1 - d2) <= epsilon) return 0; return d1.CompareTo(d2); } } } </code></pre>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POOrderBy with a non-transitive IComparer
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USVince
UserOwnerUserId
1. USVince
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. This table or related slice is empty.
CommentsPostId
1. This table or related slice is empty.

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.