RhodeCode

/* -*- mode: C++; indent-tabs-mode: nil; -*-

 *

 * This file is a part of LEMON, a generic C++ optimization library.

 *

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, EGRES).

 *

 * Permission to use, modify and distribute this software is granted

 * provided that this copyright notice appears in all copies. For

 * precise terms see the accompanying LICENSE file.

 *

 * This software is provided "AS IS" with no warranty of any kind,

 * express or implied, and with no claim as to its suitability for any

 * purpose.

 *

 */

#ifndef RADIX_SORT_H

#define RADIX_SORT_H

/// \ingroup auxalg

/// \file

/// \brief Radix sort

///

/// Linear time sorting algorithms

#include <vector>

#include <limits>

#include <iterator>

#include <algorithm>

namespace lemon {

  namespace _radix_sort_bits {

    template <typename Value>

        ++it;

      }

    }

    template <typename Value, typename Iterator, typename Functor>

    void stableRadixSignedSort(Iterator first, Iterator last, Functor functor) {

      if (first == last) return;

      typedef typename std::iterator_traits<Iterator>::value_type Key;

      typedef std::allocator<Key> Allocator;

      Allocator allocator;

      int length = std::distance(first, last);

      Key* buffer = allocator.allocate(2 * length);

      try {

        bool dir = true;

        std::copy(first, last, buffer);

        for (int i = 0; i < int(sizeof(Value)) - 1; ++i) {

          if (dir) {

            stableRadixIntroSort(buffer, buffer + length, buffer + length,

                                 i, functor);

          } else {

            stableRadixIntroSort(buffer + length, buffer + 2 * length, buffer,

                                 i, functor);

          }

          dir = !dir;

        }

        if (dir) {

          signedStableRadixIntroSort(buffer, buffer + length, buffer + length,

                                     sizeof(Value) - 1, functor);

          std::copy(buffer + length, buffer + 2 * length, first);

        }        else {

                                     buffer, sizeof(Value) - 1, functor);

          std::copy(buffer, buffer + length, first);

        }

      } catch (...) {

        allocator.deallocate(buffer, 2 * length);

        throw;

      }

      allocator.deallocate(buffer, 2 * length);

    }

    template <typename Value, typename Iterator, typename Functor>

                                 Functor functor) {

      if (first == last) return;

      typedef typename std::iterator_traits<Iterator>::value_type Key;

      typedef std::allocator<Key> Allocator;

      Allocator allocator;

      int length = std::distance(first, last);

      Key *buffer = allocator.allocate(2 * length);

      try {

        bool dir = true;

        std::copy(first, last, buffer);

        for (int i = 0; i < int(sizeof(Value)); ++i) {

          if (dir) {

            stableRadixIntroSort(buffer, buffer + length,

                                 buffer + length, i, functor);

          } else {

            stableRadixIntroSort(buffer + length, buffer + 2 * length,

                                 buffer, i, functor);

          }

          dir = !dir;

        }

        if (dir) {

          std::copy(buffer, buffer + length, first);

        }        else {

          std::copy(buffer + length, buffer + 2 * length, first);

        }

      } catch (...) {

        allocator.deallocate(buffer, 2 * length);

        throw;

      }

      allocator.deallocate(buffer, 2 * length);

    }

/* -*- mode: C++; indent-tabs-mode: nil; -*-

 *

 * This file is a part of LEMON, a generic C++ optimization library.

 *

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, EGRES).

 *

 * Permission to use, modify and distribute this software is granted

 * provided that this copyright notice appears in all copies. For

 * precise terms see the accompanying LICENSE file.

 *

 * This software is provided "AS IS" with no warranty of any kind,

 * express or implied, and with no claim as to its suitability for any

 * purpose.

 *

 */

#include <lemon/time_measure.h>

#include <lemon/smart_graph.h>

#include <lemon/maps.h>

#include <lemon/radix_sort.h>

#include <lemon/math.h>

#include "test_tools.h"

#include <vector>

#include <algorithm>

using namespace lemon;

static const int n = 10000;

struct Negate {

  typedef int argument_type;

  typedef int result_type;

  int operator()(int a) { return - a; }