edg-l/ddnet
1
0
Fork 0
mirror of https://github.com/ddnet/ddnet.git synced 2024-09-20 01:24:18 +00:00
Code Issues Packages Projects Releases Wiki Activity

Remove base/tl/algorithm.h

Browse source
This commit is contained in:
Robert Müller 2022-05-24 11:27:32 +02:00
parent ca309d6ef8
commit 47098daa42
2 changed files with 0 additions and 119 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

1
CMakeLists.txt
View file

@ -1686,7 +1686,6 @@ set_src(BASE GLOB_RECURSE src/base
math.h math.h
system.cpp system.cpp
system.h system.h
tl/algorithm.h
tl/allocator.h tl/allocator.h
tl/range.h tl/range.h
tl/threading.h tl/threading.h

118
src/base/tl/algorithm.h
View file

@ -1,118 +0,0 @@
/* (c) Magnus Auvinen. See licence.txt in the root of the distribution for more information. */
/* If you are missing that file, acquire a complete release at teeworlds.com. */
#ifndef BASE_TL_ALGORITHM_H
#define BASE_TL_ALGORITHM_H
#include "base/tl/range.h"
#include <algorithm>
#include <functional>
/*
insert 4
v
1 2 3 4 5 6
*/
template<class R, class T>
R partition_linear(R range, T value)
{
concept_empty::check(range);
concept_forwarditeration::check(range);
concept_sorted::check(range);
for(; !range.empty(); range.pop_front())
{
if(!(range.front() < value))
return range;
}
return range;
}
template<class R, class T>
R partition_binary(R range, T value)
{
concept_empty::check(range);
concept_index::check(range);
concept_size::check(range);
concept_slice::check(range);
concept_sorted::check(range);
if(range.empty())
return range;
if(range.back() < value)
return R();
while(range.size() > 1)
{
unsigned pivot = (range.size() - 1) / 2;
if(range.index(pivot) < value)
range = range.slice(pivot + 1, range.size() - 1);
else
range = range.slice(0, pivot + 1);
}
return range;
}
template<class R, class T>
R find_linear(R range, T value)
{
concept_empty::check(range);
concept_forwarditeration::check(range);
for(; !range.empty(); range.pop_front())
if(value == range.front())
break;
return range;
}
template<class R, class T>
R find_binary(R range, T value)
{
range = partition_binary(range, value);
if(range.empty())
return range;
if(range.front() == value)
return range;
return R();
}
template<class R>
void sort(R range)
{
std::stable_sort(&range.front(), &range.back() + 1);
}
template<class R>
bool sort_verify(R range)
{
concept_empty::check(range);
concept_forwarditeration::check(range);
typename R::type *prev = &range.front();
range.pop_front();
for(; !range.empty(); range.pop_front())
{
typename R::type *cur = &range.front();
if(*cur < *prev)
return false;
prev = cur;
}
return true;
}
template<class R>
void for_each(R range, std::function<void(typename R::type)> fcn)
{
concept_empty::check(range);
concept_forwarditeration::check(range);
for(; !range.empty(); range.pop_front())
{
typename R::type *cur = &range.front();
fcn(*cur);
}
}
#endif // TL_FILE_ALGORITHMS_HPP