Consulta de LINQ para dividir una lista ordenada en sublistas de puntos contiguos según algunos criterios

Question

Buscando ayuda para escribir una consulta LINQ en algunos objetos. Siento que si mis habilidades de LINQ fueran más ninjas, podría hacer esto con algún inteligente GroupBy/SelectMany (¡o algo así!).

En términos genéricos, la pregunta es: dada una lista de objetos en algún tipo de orden, donde cada objeto tiene una bandera, ¿cómo puedo dividir la lista en sublistas, donde cada sublista es todos los puntos contiguos donde la bandera está puesta?

forma imperativa de hacer esto sería como el siguiente pseudocódigo:

foreach object obj 
    if(obj.FlagSet) 
    add it to my currentsublist 
    else 
    skip to the next obj where FlagSet and start a new sublist 

Por lo tanto, dada la siguiente entrada:

{1, Bandera}, {2, Bandera}, {3, noetiqueta}, {4, Bandera}, {5, noetiqueta}, {6} Bandera ...

me gustaría que el siguiente resultado:

Lista 1: {1, 2} Lista 2 : {4} Lista 3: {6}

Y me gustaría hacerlo funcionalmente a través de LINQ. ¿Algunas ideas?

(He mirado alrededor primero, pero todas las preguntas que pude ver que parecía que desee, ya sea simplemente una lista o grupo a dividirse en igual tamaño, que no ha sido de gran ayuda para mí.)

Answer 1

Este MSDN artículo proporciona código para agrupar por valores contiguos:

http://msdn.microsoft.com/en-us/library/cc138361.aspx

he reproducido el código desde el enlace anterior en caso de link-rot:

public static class MyExtensions 
{ 
    public static IEnumerable<IGrouping<TKey, TSource>> ChunkBy<TSource, TKey>(this IEnumerable<TSource> source, Func<TSource, TKey> keySelector) 
    { 
     return source.ChunkBy(keySelector, EqualityComparer<TKey>.Default); 
    } 

    public static IEnumerable<IGrouping<TKey, TSource>> ChunkBy<TSource, TKey>(this IEnumerable<TSource> source, Func<TSource, TKey> keySelector, IEqualityComparer<TKey> comparer) 
    { 
     // Flag to signal end of source sequence. 
     const bool noMoreSourceElements = true; 

     // Auto-generated iterator for the source array.  
     var enumerator = source.GetEnumerator(); 

     // Move to the first element in the source sequence. 
     if (!enumerator.MoveNext()) yield break; 

     // Iterate through source sequence and create a copy of each Chunk. 
     // On each pass, the iterator advances to the first element of the next "Chunk" 
     // in the source sequence. This loop corresponds to the outer foreach loop that 
     // executes the query. 
     Chunk<TKey, TSource> current = null; 
     while (true) 
     { 
      // Get the key for the current Chunk. The source iterator will churn through 
      // the source sequence until it finds an element with a key that doesn't match. 
      var key = keySelector(enumerator.Current); 

      // Make a new Chunk (group) object that initially has one GroupItem, which is a copy of the current source element. 
      current = new Chunk<TKey, TSource>(key, enumerator, value => comparer.Equals(key, keySelector(value))); 

      // Return the Chunk. A Chunk is an IGrouping<TKey,TSource>, which is the return value of the ChunkBy method. 
      // At this point the Chunk only has the first element in its source sequence. The remaining elements will be 
      // returned only when the client code foreach's over this chunk. See Chunk.GetEnumerator for more info. 
      yield return current; 

      // Check to see whether (a) the chunk has made a copy of all its source elements or 
      // (b) the iterator has reached the end of the source sequence. If the caller uses an inner 
      // foreach loop to iterate the chunk items, and that loop ran to completion, 
      // then the Chunk.GetEnumerator method will already have made 
      // copies of all chunk items before we get here. If the Chunk.GetEnumerator loop did not 
      // enumerate all elements in the chunk, we need to do it here to avoid corrupting the iterator 
      // for clients that may be calling us on a separate thread. 
      if (current.CopyAllChunkElements() == noMoreSourceElements) 
      { 
       yield break; 
      } 
     } 
    } 

    // A Chunk is a contiguous group of one or more source elements that have the same key. A Chunk 
    // has a key and a list of ChunkItem objects, which are copies of the elements in the source sequence. 
    class Chunk<TKey, TSource> : IGrouping<TKey, TSource> 
    { 
     // INVARIANT: DoneCopyingChunk == true || 
     // (predicate != null && predicate(enumerator.Current) && current.Value == enumerator.Current) 

     // A Chunk has a linked list of ChunkItems, which represent the elements in the current chunk. Each ChunkItem 
     // has a reference to the next ChunkItem in the list. 
     class ChunkItem 
     { 
      public ChunkItem(TSource value) 
      { 
       Value = value; 
      } 
      public readonly TSource Value; 
      public ChunkItem Next = null; 
     } 
     // The value that is used to determine matching elements 
     private readonly TKey key; 

     // Stores a reference to the enumerator for the source sequence 
     private IEnumerator<TSource> enumerator; 

     // A reference to the predicate that is used to compare keys. 
     private Func<TSource, bool> predicate; 

     // Stores the contents of the first source element that 
     // belongs with this chunk. 
     private readonly ChunkItem head; 

     // End of the list. It is repositioned each time a new 
     // ChunkItem is added. 
     private ChunkItem tail; 

     // Flag to indicate the source iterator has reached the end of the source sequence. 
     internal bool isLastSourceElement = false; 

     // Private object for thread syncronization 
     private object m_Lock; 

     // REQUIRES: enumerator != null && predicate != null 
     public Chunk(TKey key, IEnumerator<TSource> enumerator, Func<TSource, bool> predicate) 
     { 
      this.key = key; 
      this.enumerator = enumerator; 
      this.predicate = predicate; 

      // A Chunk always contains at least one element. 
      head = new ChunkItem(enumerator.Current); 

      // The end and beginning are the same until the list contains > 1 elements. 
      tail = head; 

      m_Lock = new object(); 
     } 

     // Indicates that all chunk elements have been copied to the list of ChunkItems, 
     // and the source enumerator is either at the end, or else on an element with a new key. 
     // the tail of the linked list is set to null in the CopyNextChunkElement method if the 
     // key of the next element does not match the current chunk's key, or there are no more elements in the source. 
     private bool DoneCopyingChunk { get { return tail == null; } } 

     // Adds one ChunkItem to the current group 
     // REQUIRES: !DoneCopyingChunk && lock(this) 
     private void CopyNextChunkElement() 
     { 
      // Try to advance the iterator on the source sequence. 
      // If MoveNext returns false we are at the end, and isLastSourceElement is set to true 
      isLastSourceElement = !enumerator.MoveNext(); 

      // If we are (a) at the end of the source, or (b) at the end of the current chunk 
      // then null out the enumerator and predicate for reuse with the next chunk. 
      if (isLastSourceElement || !predicate(enumerator.Current)) 
      { 
       enumerator = null; 
       predicate = null; 
      } 
      else 
      { 
       tail.Next = new ChunkItem(enumerator.Current); 
      } 

      // tail will be null if we are at the end of the chunk elements 
      // This check is made in DoneCopyingChunk. 
      tail = tail.Next; 
     } 

     // Called after the end of the last chunk was reached. It first checks whether 
     // there are more elements in the source sequence. If there are, it 
     // Returns true if enumerator for this chunk was exhausted. 
     internal bool CopyAllChunkElements() 
     { 
      while (true) 
      { 
       lock (m_Lock) 
       { 
        if (DoneCopyingChunk) 
        { 
         // If isLastSourceElement is false, 
         // it signals to the outer iterator 
         // to continue iterating. 
         return isLastSourceElement; 
        } 
        else 
        { 
         CopyNextChunkElement(); 
        } 
       } 
      } 
     } 

     public TKey Key { get { return key; } } 

     // Invoked by the inner foreach loop. This method stays just one step ahead 
     // of the client requests. It adds the next element of the chunk only after 
     // the clients requests the last element in the list so far. 
     public IEnumerator<TSource> GetEnumerator() 
     { 
      //Specify the initial element to enumerate. 
      ChunkItem current = head; 

      // There should always be at least one ChunkItem in a Chunk. 
      while (current != null) 
      { 
       // Yield the current item in the list. 
       yield return current.Value; 

       // Copy the next item from the source sequence, 
       // if we are at the end of our local list. 
       lock (m_Lock) 
       { 
        if (current == tail) 
        { 
         CopyNextChunkElement(); 
        } 
       } 

       // Move to the next ChunkItem in the list. 
       current = current.Next; 
      } 
     } 

     System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator() 
     { 
      return GetEnumerator(); 
     } 
    } 
} 

No es bonito, pero funciona bien.

En su caso sería algo así como:

myList.ChunkBy(o => o.FlagSet) 

Answer 2

Creo que la forma es a administrar dos listas y por último los demás sólo agrega primera lista a la lista definitiva y clara primera lista y añadir objeto a primera lista cuando el indicador se establece

Answer 3

Además de @spenders excellent link (+1!), me gustaría añadir:

es bastante, y funciona así:

• que opera completamente en el modo perezoso
• es seguro para subprocesos
• integra en linq estándar proporcionando Chunk<> que implementa IGrouping<>
• que tiene algunos problemas de estilo (denominación, el exceso de alcance, falta modificador de sólo lectura para m_lock; cosas por el estilo)

La única verdadera queja que vi en este momento era que no logra disponer de forma proactiva los enumeradores que obtiene de la fuente enumerable.Aquí está mi dosis relevante:

public static IEnumerable<IGrouping<TKey, TSource>> ChunkBy<TSource, TKey>(this IEnumerable<TSource> source, Func<TSource, TKey> keySelector, IEqualityComparer<TKey> comparer) 
{ 
    // ... 
    using (var enumerator = source.GetEnumerator()) // <--- FIXED 
    { 

actualización

aquí es mi fuente completamente modificada, fija todos los problemas mencionados anteriormente. ** Esto también hace Chunk<> desechable:

using System; 
using System.Collections.Generic; 
using System.Linq; 

namespace ChunkIt 
{ 
    public static class MyExtensions 
    { 
     public static IEnumerable<IGrouping<TKey, TSource>> ChunkBy<TSource, TKey>(this IEnumerable<TSource> source, Func<TSource, TKey> keySelector) 
     { 
      return source.ChunkBy(keySelector, EqualityComparer<TKey>.Default); 
     } 

     public static IEnumerable<IGrouping<TKey, TSource>> ChunkBy<TSource, TKey>(this IEnumerable<TSource> source, Func<TSource, TKey> keySelector, IEqualityComparer<TKey> comparer) 
     { 
      const bool noMoreSourceElements = true; 

      using (var enumerator = source.GetEnumerator()) 
      { 
       if (!enumerator.MoveNext()) 
        yield break; 

       Chunk<TKey, TSource> current; 
       while (true) 
       { 
        var key = keySelector(enumerator.Current); 
        current = new Chunk<TKey, TSource>(key, enumerator, value => comparer.Equals(key, keySelector(value))); 

        yield return current; 

        if (current.CopyAllChunkElements() == noMoreSourceElements) 
         yield break; 
       } 
      } 
     } 

     class Chunk<TKey, TSource> : IGrouping<TKey, TSource>, IDisposable 
     { 
      class ChunkItem 
      { 
       public ChunkItem(TSource value) 
       { 
        Value = value; 
       } 
       public readonly TSource Value; 
       public ChunkItem Next; 
      } 

      private readonly TKey _key; 
      private IEnumerator<TSource> _enumerator; 
      private Func<TSource, bool> _predicate; 
      private readonly ChunkItem _head; 
      private ChunkItem _tail; 
      private bool _isLastSourceElement; 
      private readonly object _mLock; 

      public Chunk(TKey key, IEnumerator<TSource> enumerator, Func<TSource, bool> predicate) 
      { 
       _key = key; 
       _enumerator = enumerator; 
       _predicate = predicate; 

       _head = new ChunkItem(enumerator.Current); 

       _tail = _head; 

       _mLock = new object(); 
      } 

      private bool DoneCopyingChunk { get { return _tail == null; } } 

      private void CopyNextChunkElement() 
      { 
       _isLastSourceElement = !_enumerator.MoveNext(); 

       if (_isLastSourceElement || !_predicate(_enumerator.Current)) 
       { 
        _enumerator = null; 
        _predicate = null; 
       } 
       else 
       { 
        _tail.Next = new ChunkItem(_enumerator.Current); 
       } 

       _tail = _tail.Next; 
      } 

      internal bool CopyAllChunkElements() 
      { 
       while (true) 
        lock (_mLock) 
        { 
         if (DoneCopyingChunk) 
          return _isLastSourceElement; 

         CopyNextChunkElement(); 
        } 
      } 

      public TKey Key { get { return _key; } } 

      public IEnumerator<TSource> GetEnumerator() 
      { 
       ChunkItem current = _head; 

       while (current != null) 
       { 
        yield return current.Value; 

        lock (_mLock) 
         if (current == _tail) 
          CopyNextChunkElement(); 

        current = current.Next; 
       } 
      } 

      System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator() 
      { 
       return GetEnumerator(); 
      } 

      #region Implementation of IDisposable 

      public void Dispose() 
      { 
       if (null!=_enumerator) 
        _enumerator.Dispose(); 

      } 

      #endregion 
     } 
    } 
} 

Answer 4

Por LINQ

var list = new[] 
{ 
    new KeyValuePair<string, string>("A", "We"), 
    new KeyValuePair<string, string>("A", "Think"), 
    new KeyValuePair<string, string>("A", "That"), 
    new KeyValuePair<string, string>("B", "Linq"), 
    new KeyValuePair<string, string>("C", "Is"), 
    new KeyValuePair<string, string>("A", "Really"), 
    new KeyValuePair<string, string>("B", "Cool"), 
    new KeyValuePair<string, string>("B", "!") 
}; 
var queryGroup = list.Select(data => data). 
    GroupBy(g => g.Key, //group key 
      i => i.Value //value 
    ); 
foreach (var group in queryGroup) 
{ 
    foreach (var data in group) 
    { 

    } 
} 
//even/odd grouping 
int groupCount = 2; 
var queryEvenOdd = list.Select((data, index) => new { data, index }). 
     GroupBy(
     g => g.index % groupCount,//group key 
     i => i.data //value 
     );