StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
2303179
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
1
CommunityOwnedDate
CreationDate
2010-02-20T18:30:21.700
FavoriteCount
0
LastActivityDate
2010-02-20T18:35:41.363
LastEditDate
2010-02-20T18:35:41.363
LastEditorUserId
0
OwnerUserId
0
ParentId
2303068
PostTypeId
2
Score
7
ViewCount
0
LastEditorDisplayName
Aryabhatta
text
Body
You can use the List type to hold the pairs, Sort them and use List.BinarySearch. For instance you could have something like the following: <pre><code>struct Pair { public Pair(DateTime t, int v) { date = t; value = v; } public DateTime date; public int value; } .... List<Pair> pairs = new List<Pair>(); pairs.Add(new Pair(DateTime.Now, 100)); pairs.Add(new Pair(DateTime.Now, 200)); .... // Sort using the time. pairs.Sort(delegate(Pair pair1, Pair pair2) { return pair1.date.CompareTo( pair2.date); } ); // Do binary search. int index = pairs.BinarySearch(new Pair(dateToSearch, 0), delegate(Pair pair1, Pair pair2) { return pair1.date.CompareTo(pair2.date); }); if (index >= 0) { // Found the element! return pairs[index].value; } // If not found, List.BinarySearch returns the complement // of the index where the element should have been. index = ~index; // This date search for is larger than any if (index == pairs.Count) { // } // The date searched is smaller than any in the list. if (index == 0) { } // Otherwise return average of elements at index and index-1. return (pairs[index-1].value + pairs[index].value)/2; </code></pre> Of course the code is not the best possible, but you get the idea: use List, Sort it and then do BinarySearch. Lookup MSDN for more information. List: <a href="http://msdn.microsoft.com/en-us/library/6sh2ey19.aspx" rel="noreferrer">http://msdn.microsoft.com/en-us/library/6sh2ey19.aspx</a> List.Sort: <a href="http://msdn.microsoft.com/en-us/library/3da4abas.aspx" rel="noreferrer">http://msdn.microsoft.com/en-us/library/3da4abas.aspx</a> List.BinarySearch: <a href="http://msdn.microsoft.com/en-us/library/3f90y839.aspx" rel="noreferrer">http://msdn.microsoft.com/en-us/library/3f90y839.aspx</a>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POfind item in collection with closest date
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. This table or related slice is empty.
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. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
2. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
3. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
CommentsPostId
1. COThat's an enilightening insight into BinarySearch. Thanks.
 singulars
 PostPostId
 PO
 UserUserId
 USEchilon

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.