If I have an IEnumerable like:

```
string[] items = new string[] { "a", "b", "c", "d" };
```

I would like to loop thru all the pairs of consecutive items (sliding window of size 2). Which would be

```
("a","b"), ("b", "c"), ("c", "d")
```

My solution was is this

```
public static IEnumerable<Pair<T, T>> Pairs(IEnumerable<T> enumerable) {
IEnumerator<T> e = enumerable.GetEnumerator(); e.MoveNext();
T current = e.Current;
while ( e.MoveNext() ) {
T next = e.Current;
yield return new Pair<T, T>(current, next);
current = next;
}
}
// used like this :
foreach (Pair<String,String> pair in IterTools<String>.Pairs(items)) {
System.Out.PrintLine("{0}, {1}", pair.First, pair.Second)
}
```

When I wrote this code, I wondered if there are already functions in the .NET framework that do the same thing and do it not just for pairs but for any size tuples. IMHO there should be a nice way to do this kind of sliding window operations.

I use C# 2.0 and I can imagine that with C# 3.0 (w/ LINQ) there are more (and nicer) ways to do this, but I'm primarily interested in C# 2.0 solutions. Though, I will also appreciate C# 3.0 solutions.

`SmartEnumerator`

which tells you whether an item is the last in the list. msmvps.com/blogs/jon_skeet/archive/2007/07/27/…