You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
concurrentqueue/benchmarks/dlib/map.h

60 lines
1.5 KiB
C++

// Copyright (C) 2003 Davis E. King (davis@dlib.net)
// License: Boost Software License See LICENSE.txt for the full license.
#ifndef DLIB_MAp_
#define DLIB_MAp_
#include "map/map_kernel_1.h"
#include "map/map_kernel_c.h"
#include "binary_search_tree.h"
#include "algs.h"
#include <functional>
namespace dlib
{
template <
typename domain,
typename range,
typename mem_manager = default_memory_manager,
typename compare = std::less<domain>
>
class map
{
map() {}
// a typedef for the binary search tree used by kernel_2
typedef typename binary_search_tree<domain,range,mem_manager,compare>::kernel_1a
binary_search_tree_1;
// a typedef for the binary search tree used by kernel_2
typedef typename binary_search_tree<domain,range,mem_manager,compare>::kernel_2a
binary_search_tree_2;
public:
//----------- kernels ---------------
// kernel_1a
typedef map_kernel_1<domain,range,binary_search_tree_1,mem_manager>
kernel_1a;
typedef map_kernel_c<kernel_1a >
kernel_1a_c;
// kernel_1b
typedef map_kernel_1<domain,range,binary_search_tree_2,mem_manager>
kernel_1b;
typedef map_kernel_c<kernel_1b >
kernel_1b_c;
};
}
#endif // DLIB_MAp_