Wie funktioniert Pythons Zip in C#?

Question

zip Funktion des Python macht folgendes:

a = [1, 2, 3] 
b = [6, 7, 8] 
zipped = zip(a, b) 

Ergebnis

[[1, 6], [2, 7], [3, 8]] 

Answer 1

Wie wäre es this?

C# 4.0 LINQ NEUE PLZ Betreiber

public static IEnumerable<TResult> Zip<TFirst, TSecond, TResult>(
     this IEnumerable<TFirst> first, 
     IEnumerable<TSecond> second, 
     Func<TFirst, TSecond, TResult> func); 

Answer 2

Lösung 1:

IEnumerable<KeyValuePair<T1, T2>> Zip<T1, T2>(
    IEnumerable<T1> a, IEnumerable<T2> b) 
{ 
    var enumeratorA = a.GetEnumerator(); 
    var enumeratorB = b.GetEnumerator(); 
    while (enumeratorA.MoveNext()) 
    { 
     enumeratorB.MoveNext(); 
     yield return new KeyValuePair<T1, T2> 
     (
      enumeratorA.Current, 
      enumeratorB.Current 
     ); 
    } 
} 

Answer 3

Lösung 2: Ähnlich wie bei C# 4.0 Zip, aber man kann es in C verwenden # 3,0

public static IEnumerable<TResult> Zip<TFirst, TSecond, TResult>(
     this IEnumerable<TFirst> first, 
     IEnumerable<TSecond> second, 
     Func<TFirst, TSecond, TResult> func) 
    { 
     using(var enumeratorA = first.GetEnumerator()) 
     using(var enumeratorB = second.GetEnumerator()) 
     { 
      while (enumeratorA.MoveNext()) 
      { 
       enumeratorB.MoveNext(); 
       yield return func(enumeratorA.Current, enumeratorB.Current); 
      } 
     } 
    } 

Answer 4

auch einen Blick auf Cadenza nehmen, die alle hat Arten von raffinierten Hilfsmethoden.

aussehen speziell auf die Zip-Erweiterungsmethoden hier: http://gitorious.org/cadenza/cadenza/blobs/master/src/Cadenza/Cadenza.Collections/Enumerable.cs#line1303

Answer 5

ich über das gleiche Problem nur gekommen sind. .NET-Bibliothek bietet keine Lösung, also habe ich es selbst gemacht. Hier ist meine Lösung.

Die Pivot Methode wird als Erweiterung zu IEnumerable<IEnumerable<T>> gemacht. Es erfordert, dass alle Elemente der Sequenz vom selben Typ sind T.

public static class LinqUtil 
{ 
    /// <summary> 
    /// From a number of input sequences makes a result sequence of sequences of elements 
    /// taken from the same position of each input sequence. 
    /// Example: ((1,2,3,4,5), (6,7,8,9,10), (11,12,13,14,15)) --> ((1,6,11), (2,7,12), (3,8,13), (4,9,14), (5,10,15)) 
    /// </summary> 
    /// <typeparam name="T">Type of sequence elements</typeparam> 
    /// <param name="source">source seq of seqs</param> 
    /// <param name="fillDefault"> 
    /// Defines how to handle situation when input sequences are of different length. 
    ///  false -- throw InvalidOperationException 
    ///  true -- fill missing values by the default values for the type T. 
    /// </param> 
    /// <returns>Pivoted sequence</returns> 
    public static IEnumerable<IEnumerable<T>> Pivot<T>(this IEnumerable<IEnumerable<T>> source, bool fillDefault = false) 
    { 
     IList<IEnumerator<T>> heads = new List<IEnumerator<T>>(); 

     foreach (IEnumerable<T> sourceSeq in source) 
     { 
      heads.Add(sourceSeq.GetEnumerator()); 
     } 

     while (MoveAllHeads(heads, fillDefault)) 
     { 
      yield return ReadHeads(heads); 
     } 
    } 

    private static IEnumerable<T> ReadHeads<T>(IEnumerable<IEnumerator<T>> heads) 
    { 
     foreach (IEnumerator<T> head in heads) 
     { 
      if (head == null) 
       yield return default(T); 
      else 
       yield return head.Current; 
     } 
    } 

    private static bool MoveAllHeads<T>(IList<IEnumerator<T>> heads, bool fillDefault) 
    { 
     bool any = false; 
     bool all = true; 

     for (int i = 0; i < heads.Count; ++i) 
     { 
      bool hasNext = false; 

      if(heads[i] != null) hasNext = heads[i].MoveNext(); 

      if (!hasNext) heads[i] = null; 

      any |= hasNext; 
      all &= hasNext; 
     } 

     if (any && !all && !fillDefault) 
      throw new InvalidOperationException("Input sequences are of different length"); 

     return any; 
    } 
}