Skip to content

lisitsyn/algorithme

Repository files navigation

Algorithme

Some set of wrappers on top of the STL aimed to achieve less verbose code. Pretty experimental stuff.

As a basic example - instead of

std::sort(container.begin(), container.end())

we can use shorter

algorithme::sort(container);

or instead of

if (condition)
	i++;

some kind of magic

algorithme::conditional_do([&] () { i++ }).when(condition);

About

Basic wrappers on top of the STL

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages