// find_backward_if
vector<int> v{5,3,2,3,1,2,0,1,8,9,4,3};
	
auto p = mt::find_backward_if(v.begin(), v.end(),
							  [&](const int x) { return x == 0;});
if (p != v.end()) {
		cout << " found." << endl;
	} else {
		cout << " not found." << endl;
	}
	
	
// gather
std::array<int, 10> a10{9,0,1,4,4,0,7,7,8,0};
auto insertPos = std::begin(a10) + 4;

mt::gather(std::begin(a10), std::begin(a10)+10, insertPos, less_than<int>{2});

/*
	Before gather:
  	[ 9, 0, 1, 4, 4, 0, 7, 7, 8, 0 ]
  	After we gather all less than 2:
  	[ 9, 4, 0, 1, 0, 0, 4, 7, 7, 8 ]
*/

// remove_if_not
std::vector<int> v1 {9,0,1,4,4,0,7,7,8,0};
// mark for deletion
auto p = mt::remove_if_not(std::begin(v1), std::end(v1), less_than<int>{5});
v1.erase(p, v1.end());

/* 
	Before remove:
	[ 9, 0, 1, 4, 4, 0, 7, 7, 8, 0 ]
	After remove not less than 5:
	[ 0, 1, 4, 4, 0, 0 ]
*/

// keep_if
std::vector<int> v2 {9,0,1,4,4,0,7,7,8,0};
mt::keep_if(v2, less_than<int>{8});

/*
	Before:
	[ 9, 0, 1, 4, 4, 0, 7, 7, 8, 0 ]
	After keep all less than 8:
	[ 0, 1, 4, 4, 0, 7, 7, 0 ]
*/

// stable_partition_position
int  a[] = { 1, 2, 3, 4, 5, 5, 4, 3, 2, 1 }; 
bool b[] = { 0, 1, 0, 1, 0, 0, 1, 0, 1, 0 }; // mask for every even 

// divide the even(upfront) and odd(at the end) numbers 
auto pos = mt::stable_partition_position(std::begin(a), std::end(a), [&](auto i) {
	return *(std::begin(b) + (i - std::begin(a)));
});
for (auto f = std::begin(a), l = pos; f != l; ++f) 
	std::cout << *f << " ";
std::cout << "^ ";
for (auto f = pos, l = std::end(a); f != l; ++f) 
	std::cout << *f << " ";
std::cout << std::endl;
// 2 4 4 2 ^ 1 3 5 5 3 1

// random
using card = int;
std::array<card, 52> deck{};
std::iota(begin(deck), end(deck), 0);
// Shuffle the deck:
mt::randomize(deck);
print(deck);

int rInt = mt::pick_a_number(5, 15);
double rDouble = mt::pick_a_number(0.5, 5.0);


// random range
std::vector<double> rd(15);
mt::random(rd, 5.0, 0.5); // gen radnom range with min and max limit
// [ 5.14483, 4.66518, 4.48297, 5.51647, 4.95101 ]

// split
std::string line {"man,meal,moon;fat,food,feel;cat,coat,cook;love,leg,lunch"};

// split string to any container
std::vector<std::string> vec_words;
std::list<std::string> list_words;

mt::split(line, ";", vec_words);
mt::split(line, ",;.", list_words);

/*

	[ man,meal,moon, 
	fat,food,feel, 
	cat,coat,cook, 
	love,leg,lunch ]

	[ man, meal, moon, fat, food, feel, cat, coat, cook, love, leg, lunch ]
*/

// trim_right_if
std::string  s  = "woow!!!!";
std::wstring ws = L"Awesome........";
std::string  sp = "lot of space       ";
trim_right_if(s, '!');   // => woow
trim_right_if(sp, ' ');  // => Awesome
trim_right_if(ws, L'.'); // => lot of space

std::string s1 {"';;;'yep..'';"};
s2 = trim_right_if(s1, is_any_of(";,.'")); // => yep
std::string srcp {"trim me     "};         // => len: 12
// same as default trim_right 
trim_right_if(srcp, is_space);             // => trim me (len: 7)


std::wstring badstr {L"some,12<script>-1=1test29710-1---,.1888Osss"};
sanitize(badstr); 	  // =>  some12script11test2971011888osss
digits_copy(badstr);  // =>  1211297101188810
letters_copy(badstr); // =>  somescripttestOsss

// prefix suffix
std::string uristr {"https://www.google.com"};
	
if (has_prefix(uristr, "https://")) 
	std::cout << "yes!" << std::endl;
	
if (has_suffix(uristr, ".com")) 
	std::cout << "yes!" << std::endl;

// find_f and find_if_not
std::string sr{"-1,2,3;name=marko$"};
// remove all digits
remove_if(sr, ::isdigit);			// => -,,;name=marko$
// remove all non-digits
remove_if_not(sr2, ::isdigit);	// => 123


//find
std::string fs {"-some1+2"};
auto p = find_if_backward(fs.begin(), fs.end(), 
						[](const char c) {return c == '+';});
if (p != fs.end())
	std::cout << "\nfound " << *p << "at " 
	          << std::distance(begin(fs), p) << '\n';	
// found + at 6

// to_lower, to_upper...
to_lower("MARKO") // => marko
to_upper("cpp")   // => CPP