Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>This seems to works and is easy to understand.</p> <pre><code> public static IEnumerable&lt;Range&lt;T&gt;&gt; Collapse&lt;T&gt;(this IEnumerable&lt;Range&lt;T&gt;&gt; me, IComparer&lt;T&gt; comparer) { List&lt;Range&lt;T&gt;&gt; orderdList = me.OrderBy(r =&gt; r.Start).ToList(); List&lt;Range&lt;T&gt;&gt; newList = new List&lt;Range&lt;T&gt;&gt;(); T max = orderdList[0].End; T min = orderdList[0].Start; foreach (var item in orderdList.Skip(1)) { if (comparer.Compare(item.End, max) &gt; 0 &amp;&amp; comparer.Compare(item.Start, max) &gt; 0) { newList.Add(new Range&lt;T&gt; { Start = min, End = max }); min = item.Start; } max = comparer.Compare(max, item.End) &gt; 0 ? max : item.End; } newList.Add(new Range&lt;T&gt;{Start=min,End=max}); return newList; } </code></pre> <hr> <p>Here is the variation which I mentioned in the comments. It's basically the same thing, but with some checking and yielding of the results instead of collecting in a list before returning.</p> <pre><code> public static IEnumerable&lt;Range&lt;T&gt;&gt; Collapse&lt;T&gt;(this IEnumerable&lt;Range&lt;T&gt;&gt; ranges, IComparer&lt;T&gt; comparer) { if(ranges == null || !ranges.Any()) yield break; if (comparer == null) comparer = Comparer&lt;T&gt;.Default; var orderdList = ranges.OrderBy(r =&gt; r.Start); var firstRange = orderdList.First(); T min = firstRange.Start; T max = firstRange.End; foreach (var current in orderdList.Skip(1)) { if (comparer.Compare(current.End, max) &gt; 0 &amp;&amp; comparer.Compare(current.Start, max) &gt; 0) { yield return Create(min, max); min = current.Start; } max = comparer.Compare(max, current.End) &gt; 0 ? max : current.End; } yield return Create(min, max); } </code></pre>
    singulars
    1. This table or related slice is empty.
    1. POWhat's a good, generic algorithm for collapsing a set of potentially-overlapping ranges?
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USSvish
    1. USGary W
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. POWhat's a good, generic algorithm for collapsing a set of potentially-overlapping ranges?
      singulars
      1. PTQuestion
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTAcceptedByOriginator
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. COYou should check if the list is empty, other than that, good approach.
      singulars
      1. PO
      1. USLasse Vågsæther Karlsen
    2. COYeah, I went with a slight variation of this solution. Thanks =)
      singulars
      1. PO
      1. USSvish
    3. COOne simplification: `if` statement within `foreach`: You should only check whether `comparer.Compare(item.Start, max) > 0`, because `item.End` will be greater as well... This simplification should of course be used only when ranges are always positive (`item.Start < item.End`)
      singulars
      1. PO
      1. USRobert Koritnik
 

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.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload