proxygen
DoubleRadixSort.h
Go to the documentation of this file.
1 /*
2  * Copyright 2018-present Facebook, Inc.
3  *
4  * Licensed under the Apache License, Version 2.0 (the "License");
5  * you may not use this file except in compliance with the License.
6  * You may obtain a copy of the License at
7  *
8  * http://www.apache.org/licenses/LICENSE-2.0
9  *
10  * Unless required by applicable law or agreed to in writing, software
11  * distributed under the License is distributed on an "AS IS" BASIS,
12  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13  * See the License for the specific language governing permissions and
14  * limitations under the License.
15  */
16 #pragma once
17 
18 #include <cstdint>
19 
20 namespace folly {
21 namespace detail {
22 
23 /*
24  * Sorts a double[] array using radix sort (falling back to std::sort
25  * for small arrays).
26  *
27  * n - size of array
28  * buckets - must be array of uint64_t of size 256*9.
29  * in & out - must be double arrays of size n. in contains input data.
30  *
31  * output - in array is sorted.
32  */
33 void double_radix_sort(uint64_t n, uint64_t* buckets, double* in, double* tmp);
34 
35 } // namespace detail
36 } // namespace folly
void double_radix_sort(uint64_t n, uint64_t *buckets, double *in, double *tmp)
—— Concurrent Priority Queue Implementation ——
Definition: AtomicBitSet.h:29