0
2
0
1 | 1 |
/* -*- mode: C++; indent-tabs-mode: nil; -*- |
2 | 2 |
* |
3 | 3 |
* This file is a part of LEMON, a generic C++ optimization library. |
4 | 4 |
* |
5 |
* Copyright (C) 2003- |
|
5 |
* Copyright (C) 2003-2009 |
|
6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
7 | 7 |
* (Egervary Research Group on Combinatorial Optimization, EGRES). |
8 | 8 |
* |
9 | 9 |
* Permission to use, modify and distribute this software is granted |
... | ... |
@@ -347,9 +347,9 @@ |
347 | 347 |
signedStableRadixIntroSort(buffer, buffer + length, buffer + length, |
348 | 348 |
sizeof(Value) - 1, functor); |
349 | 349 |
std::copy(buffer + length, buffer + 2 * length, first); |
350 | 350 |
} else { |
351 |
signedStableRadixIntroSort(buffer + length, buffer + 2 * length, |
|
351 |
signedStableRadixIntroSort(buffer + length, buffer + 2 * length, |
|
352 | 352 |
buffer, sizeof(Value) - 1, functor); |
353 | 353 |
std::copy(buffer, buffer + length, first); |
354 | 354 |
} |
355 | 355 |
} catch (...) { |
... | ... |
@@ -359,9 +359,9 @@ |
359 | 359 |
allocator.deallocate(buffer, 2 * length); |
360 | 360 |
} |
361 | 361 |
|
362 | 362 |
template <typename Value, typename Iterator, typename Functor> |
363 |
void stableRadixUnsignedSort(Iterator first, Iterator last, |
|
363 |
void stableRadixUnsignedSort(Iterator first, Iterator last, |
|
364 | 364 |
Functor functor) { |
365 | 365 |
if (first == last) return; |
366 | 366 |
typedef typename std::iterator_traits<Iterator>::value_type Key; |
367 | 367 |
typedef std::allocator<Key> Allocator; |
1 | 1 |
/* -*- mode: C++; indent-tabs-mode: nil; -*- |
2 | 2 |
* |
3 | 3 |
* This file is a part of LEMON, a generic C++ optimization library. |
4 | 4 |
* |
5 |
* Copyright (C) 2003- |
|
5 |
* Copyright (C) 2003-2009 |
|
6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
7 | 7 |
* (Egervary Research Group on Combinatorial Optimization, EGRES). |
8 | 8 |
* |
9 | 9 |
* Permission to use, modify and distribute this software is granted |
0 comments (0 inline)