Inefficient? but fun. :-)

[jehugaleahsa]

public static IEnumerable<TRotateLeft<T>(IEnumerable<T>
collection)
{
using (IEnumerator<Tvalues = collection.GetEnumerator())
{
if (values.MoveNext())
{
T last = values.Current;
while (values.MoveNext())
{
yield return values.Current;
}
yield return last;
}
}
}
public static IEnumerable<TRotateLeft<T>(IEnumerable<Tcollection ,
int toTheLeft)
{
if (toTheLeft < 0)
{
throw new ArgumentException("No negatives please");
}
IEnumerable<Tresult = collection;
for (int i = 0; i != toTheLeft; ++i)
{
result = RotateLeft<T>(result);
}
return result;
}