diff --git a/AK/Vector.h b/AK/Vector.h index d65d425a147..2296bc5884f 100644 --- a/AK/Vector.h +++ b/AK/Vector.h @@ -163,22 +163,22 @@ public: T const& last() const { return at(size() - 1); } T& last() { return at(size() - 1); } - template - Optional first_matching(Callback callback) + template + Optional first_matching(TUnaryPredicate predicate) { for (size_t i = 0; i < size(); ++i) { - if (callback(at(i))) { + if (predicate(at(i))) { return at(i); } } return {}; } - template - Optional last_matching(Callback callback) + template + Optional last_matching(TUnaryPredicate predicate) { for (ssize_t i = size() - 1; i >= 0; --i) { - if (callback(at(i))) { + if (predicate(at(i))) { return at(i); } } @@ -220,10 +220,10 @@ public: VERIFY(did_allocate); } - template - void insert_before_matching(U&& value, C callback, size_t first_index = 0, size_t* inserted_index = nullptr) requires(CanBePlacedInsideVector) + template + void insert_before_matching(U&& value, TUnaryPredicate predicate, size_t first_index = 0, size_t* inserted_index = nullptr) requires(CanBePlacedInsideVector) { - auto did_allocate = try_insert_before_matching(forward(value), callback, first_index, inserted_index); + auto did_allocate = try_insert_before_matching(forward(value), predicate, first_index, inserted_index); VERIFY(did_allocate); } @@ -397,11 +397,11 @@ public: m_size -= count; } - template - bool remove_first_matching(Callback callback) + template + bool remove_first_matching(TUnaryPredicate predicate) { for (size_t i = 0; i < size(); ++i) { - if (callback(at(i))) { + if (predicate(at(i))) { remove(i); return true; } @@ -409,11 +409,11 @@ public: return false; } - template - void remove_all_matching(Callback callback) + template + void remove_all_matching(TUnaryPredicate predicate) { for (size_t i = 0; i < size();) { - if (callback(at(i))) { + if (predicate(at(i))) { remove(i); } else { ++i; @@ -487,11 +487,11 @@ public: return true; } - template - [[nodiscard]] bool try_insert_before_matching(U&& value, C callback, size_t first_index = 0, size_t* inserted_index = nullptr) requires(CanBePlacedInsideVector) + template + [[nodiscard]] bool try_insert_before_matching(U&& value, TUnaryPredicate predicate, size_t first_index = 0, size_t* inserted_index = nullptr) requires(CanBePlacedInsideVector) { for (size_t i = first_index; i < size(); ++i) { - if (callback(at(i))) { + if (predicate(at(i))) { if (!try_insert(i, forward(value))) return false; if (inserted_index)