jeanlemotan
43 lines
1.1 KiB
C++
43 lines
1.1 KiB
C++
#pragma once
|
|
|
|
#include "tl/detail/prologue.h"
|
|
#include <EASTL/algorithm.h>
|
|
#include <EASTL/sort.h>
|
|
|
|
namespace tl
|
|
{
|
|
//////////////////////////////////////////////////////////////////////////
|
|
|
|
template <typename Container>
|
|
void sort(Container& container) noexcept
|
|
{
|
|
eastl::sort(container.begin(), container.end());
|
|
}
|
|
|
|
//////////////////////////////////////////////////////////////////////////
|
|
|
|
template <typename Container, typename Compare>
|
|
void sort(Container& container, const Compare& compare) noexcept
|
|
{
|
|
eastl::sort(container.begin(), container.end(), compare);
|
|
}
|
|
|
|
//////////////////////////////////////////////////////////////////////////
|
|
|
|
template <typename Container>
|
|
void stable_sort(Container& container) noexcept
|
|
{
|
|
eastl::stable_sort(container.begin(), container.end());
|
|
}
|
|
|
|
//////////////////////////////////////////////////////////////////////////
|
|
|
|
template <typename Container, typename Compare>
|
|
void stable_sort(Container& container, const Compare& compare) noexcept
|
|
{
|
|
eastl::stable_sort(container.begin(), container.end(), compare);
|
|
}
|
|
|
|
//////////////////////////////////////////////////////////////////////////
|
|
}
|