Gamelogic.Extensions.Algorithms Namespace

This class provides useful extension methods for collections, mostly IEnumerable.

Combinatorial algorithms, including generating tuples, combinations, permutations and partitions. Except for PowerSet, all methods are implemented after Knuth, described in The Art of Computer Programming Volume 4.

Dithers responses by adding noise before passing it to a step response. The noise is provided by an arbitrary generator, and errors are diffused over several calls.

Contains static methods for creating generators, and extension methods to create generators from existing ones.

This class provides a convenient base class to base an implementation of IGenerator on.

A lightweight implementation of an L-system.

Contains extension methods for Response curves.

A class that can be used as the base of the implementation of a response curve.

A response curve with outputs of Color.

A response curve with outputs of float.

A response curve where the outputs are sequences of floats.

A response curve with outputs of float.

A response curve with outputs of Vector2.

A response curve with outputs of Vector3.

A response curve with outputs of Vector4.

A response curve with a step response.

A response curve with a step response.

A generator can produce a infinite sequence of objects.

All generic generators implement this interface.

This interface represents a piecewise linear curve, with input-output pairs at the bends. Outputs can be any type for which continuous interpolation makes sense.

Used to indicate whether steps are to the left, middle or right of samples.