List.fold IL simplification

[ncave]

before:

public static TState Fold<T, TState>(FSharpFunc<TState, FSharpFunc<T, TState>> folder, TState state, FSharpList<T> list)
{
	if (list.tail == null)
	{
		return state;
	}
	OptimizedClosures.FSharpFunc<TState, T, TState> f = OptimizedClosures.FSharpFunc<TState, T, TState>.Adapt(folder);
	return ListModule.loop@219-29<T, TState>(f, state, list);
}

internal static TState loop@219-29<T, TState>(OptimizedClosures.FSharpFunc<TState, T, TState> f, TState s, FSharpList<T> xs)
{
	while (xs.tail != null)
	{
		FSharpList<T> fsharpList = xs;
		FSharpList<T> tail = fsharpList.tail;
		T head = fsharpList.head;
		OptimizedClosures.FSharpFunc<TState, T, TState> fsharpFunc = f;
		TState tstate = f.Invoke(s, head);
		xs = tail;
		s = tstate;
		f = fsharpFunc;
	}
	return s;
}

after:

public static TState Fold<T, TState>(FSharpFunc<TState, FSharpFunc<T, TState>> folder, TState state, FSharpList<T> list)
{
	if (list.tail == null)
	{
		return state;
	}
	OptimizedClosures.FSharpFunc<TState, T, TState> fsharpFunc = OptimizedClosures.FSharpFunc<TState, T, TState>.Adapt(folder);
	TState tstate = state;
	FSharpList<T> fsharpList = list;
	for (FSharpList<T> tail = fsharpList.tail; tail != null; tail = fsharpList.tail)
	{
		T head = fsharpList.head;
		tstate = fsharpFunc.Invoke(tstate, head);
		fsharpList = tail;
	}
	return tstate;
}

[KevinRansom]

Thanks for this

[dsyme]

Super, thanks