Skip to content

Implement accumulate #8

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
warp-records wants to merge 3 commits into
base: master
Choose a base branch
from
Open

Implement accumulate #8

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
0340fea
Implement accumulate
warp-records Oct 27, 2021
b66eae9
Compile time bug fix
warp-records Oct 30, 2021
1c5a58f
Merge branch 'FireflyOS:master' into master
warp-records Nov 4, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
30 changes: 26 additions & 4 deletions algorithm.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -46,9 +46,9 @@ namespace firefly::std {
}

template <typename InputIt, typename UnaryPredicate>
std::size_t count_if(InputIt first, const InputIt last,
size_t count_if(InputIt first, const InputIt last,
UnaryPredicate func) {
std::size_t count = 0;
size_t count = 0;

for (; first != last; first++) {
if (func(*first))
Expand All @@ -58,9 +58,9 @@ namespace firefly::std {
return count;
}

template <typename InputIt, typename T> std::size_t count(InputIt first, const InputIt last,
template <typename InputIt, typename T> size_t count(InputIt first, const InputIt last,
const T& lval) {
std::size_t count = 0;
size_t count = 0;

for (; first != last; first++) {
if (*first == lval)
Expand All @@ -70,6 +70,28 @@ namespace firefly::std {
return count;
}

template <typename InputIt> size_t
accumulate(InputIt begin, InputIt end) {
size_t sum = 0;

while (begin != end) {
sum += *begin;
}

return sum;
}

template <typename InputIt, typename Op> size_t
accumulate(InputIt begin, InputIt end, Op op) {
size_t sum = 0;

while (begin != end) {
sum = op(sum, *begin);
}

return sum;
}

/*
template <class RandomIt>
void sort(RandomIt first, RandomIt last) {
Expand Down