Skip to content
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

Jump to bottom

Delete the superfluous ; #366

Merged
merged 1 commit into from
Apr 14, 2021
Merged

Delete the superfluous ; #366

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
6 changes: 3 additions & 3 deletions include/etl/algorithm.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1016,7 +1016,7 @@ namespace etl
template <typename TIteratorIn, typename TIteratorOut, typename TUnaryOperation>
TIteratorOut transform(TIteratorIn first1, TIteratorIn last1, TIteratorOut d_first, TUnaryOperation unary_operation)
{
return std::transform(first1, last1, d_first, unary_operation);;
return std::transform(first1, last1, d_first, unary_operation);
}

template <typename TIteratorIn1, typename TIteratorIn2, typename TIteratorOut, typename TBinaryOperation>
Expand Down Expand Up @@ -2720,7 +2720,7 @@ namespace etl
template <typename TIterator, typename TUnaryPredicate>
TIterator remove_if(TIterator first, TIterator last, TUnaryPredicate predicate)
{
return std::remove_if(first, last, predicate);;
return std::remove_if(first, last, predicate);
}
#endif
}
Expand Down Expand Up @@ -3446,7 +3446,7 @@ namespace etl
void selection_sort(TIterator first, TIterator last, TCompare compare)
{
TIterator min;
const TIterator ilast = private_algorithm::get_before_last(first, last);;
const TIterator ilast = private_algorithm::get_before_last(first, last);
const TIterator jlast = last;

for (TIterator i = first; i != ilast; ++i)
Expand Down
4 changes: 2 additions & 2 deletions include/etl/map.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1321,15 +1321,15 @@ namespace etl
key_compare key_comp() const
{
return kcompare;
};
}

//*************************************************************************
/// How to compare two value elements.
//*************************************************************************
value_compare value_comp() const
{
return vcompare;
};
}

protected:

Expand Down
2 changes: 1 addition & 1 deletion include/etl/private/pvoidvector.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -371,7 +371,7 @@ namespace etl
void** p_first = (void**)(first);
void** p_last = (void**)(last);

p_end = etl::copy(p_first, p_last, p_buffer);;
p_end = etl::copy(p_first, p_last, p_buffer);
}

//*********************************************************************
Expand Down