-
Marco Bubke authored
Many STL algorithms have value version. So you can only use a predicate: std::stable_partition(std::begin(list), std::end(list), [](int entry) { return entry < 20; }); With this predicates you can write it in a shorter form: std::stable_partition(std::begin(list), std::end(list), lessThan(20)); The find helpers are moved to predicates too. Change-Id: I791b3105ca84ef7c5a519d22589a91b5548cf3e4 Reviewed-by: Orgad Shaneh <orgads@gmail.com> Reviewed-by: Eike Ziller <eike.ziller@qt.io>
4911d5be