StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
14797850
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
2
CommunityOwnedDate
CreationDate
2013-02-10T12:42:15.910
FavoriteCount
0
LastActivityDate
2013-02-10T12:57:17.343
LastEditDate
2013-02-10T12:57:17.343
LastEditorUserId
905902
OwnerUserId
905902
ParentId
14797377
PostTypeId
2
Score
0
ViewCount
0
LastEditorDisplayName
text
Body
<p>Use a range tree. A range tree is n log(n), just like the sorted begin/end points, but it has the additional advantage that overlapping ranges will reduce the number of elements (but maybe increase the cost of insertion) Snippet (untested)</p> <pre><code>struct segment { struct segment *ll, *rr; float lo, hi; }; struct segment * newsegment(float lo, float hi) { struct segment * ret; ret = malloc (sizeof *ret); ret->lo = lo; ret->hi = hi; ret->ll= ret->rr = NULL; return ret; } struct segment * insert_range(struct segment *root, float lo, float hi) { if (!root) return newsegment(lo, hi); /* non-overlapping(or touching) ranges can be put into the {l,r} subtrees} */ if (hi < root->lo) { root->ll = insert_range(root->ll, lo, hi); return root; } if (lo > root->hi) { root->rr = insert_range(root->rr, lo, hi); return root; } /* when we get here, we must have overlap; we can extend the current node ** we also need to check if the broader range overlaps the child nodes */ if (lo < root->lo ) { root->lo = lo; while (root->ll && root->ll->hi >= root->lo) { struct segment *tmp; tmp = root->ll; root->lo = tmp->lo; root->ll = tmp->ll; tmp->ll = NULL; // freetree(tmp); } } if (hi > root->hi ) { root->hi = hi; while (root->rr && root->rr->lo <= root->hi) { struct segment *tmp; tmp = root->rr; root->hi = tmp->hi; root->rr = tmp->rr; tmp->rr = NULL; // freetree(tmp); } } return root; } float total_width(struct segment *ptr) { float ret; if (!ptr) return 0.0; ret = ptr->hi - ptr->lo; ret += total_width(ptr->ll); ret += total_width(ptr->rr); return ret; } </code></pre>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POFinding union length of many line segments
  singulars
  PostTypePostTypeId
  PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USwildplasser
UserOwnerUserId
1. USwildplasser
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. COIs this interval tree? Sorry, but this is the first time I heard the name "range tree"
  singulars
  PostPostId
  PO
  UserUserId
  USnhahtdh
2. COcould be. I just took the first name that came up.
  singulars
  PostPostId
  PO
  UserUserId
  USwildplasser

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.