Mirrors/overte-HifiExperiments
3
0
Fork 0
mirror of https://github.com/HifiExperiments/overte.git synced 2025-08-16 14:20:12 +02:00
Code Issues Projects Releases Packages Wiki Activity Actions

naming and such...

Browse source
This commit is contained in:
tosh 2013-03-27 03:32:53 +01:00
parent 68a62cf8c6
commit 403c9d9ce5
1 changed files with 11 additions and 7 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

18
shared/src/Radix2InplaceSort.h
View file

@ -24,13 +24,17 @@ void radix2InplaceSort( BidiIterator from, BidiIterator to,
template< class S, typename I > struct radix2InplaceSort_impl : private S
template< class Scanner, typename Iterator >
struct radix2InplaceSort_impl : Scanner
{
radix2InplaceSort_impl(S const& scanner) : S(scanner) { }
radix2InplaceSort_impl(Scanner const& s) : Scanner(s) { }
void go(I& from, I& to, typename S::state_type s)
using Scanner::advance;
using Scanner::bit;
void go(Iterator& from, Iterator& to, typename Scanner::state_type s)
{
I l(from), r(to);
Iterator l(from), r(to);
unsigned cl, cr;
using std::swap;
@ -39,11 +43,11 @@ template< class S, typename I > struct radix2InplaceSort_impl : private S
{
// scan from left for set bit
for (cl = cr = 0u; l != r ; ++l, ++cl)
if (S::bit(*l, s))
if (bit(*l, s))
{
// scan from the right for unset bit
for (++cr; --r != l ;++cr)
if (! S::bit(*r, s))
if (! bit(*r, s))
{
// swap, continue scanning from left
swap(*l, *r);
@ -54,7 +58,7 @@ template< class S, typename I > struct radix2InplaceSort_impl : private S
}
// on to the next digit, if any
if (! S::advance(s))
if (! advance(s))
return;
// recurse into smaller branch and prepare iterative