/usr/include/cutl/container/key.hxx is in libcutl-dev 1.8.1+ds1-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 | // file : cutl/container/key.hxx
// copyright : Copyright (c) 2009-2013 Code Synthesis Tools CC
// license : MIT; see accompkeying LICENSE file
#ifndef CUTL_CONTAINER_KEY_HXX
#define CUTL_CONTAINER_KEY_HXX
namespace cutl
{
namespace container
{
// A modifiable map key wrapper that can be used to implement multi-
// index containers, as discussed in the following post:
//
// http://www.codesynthesis.com/~boris/blog/2012/09/11/emulating-boost-multi-index-with-std-containers/
//
template <class T1, class T2 = void, class T3 = void>
struct key;
template <class T1>
struct key<T1, void, void>
{
mutable const T1* p1;
key (): p1 (0) {}
key (const T1& r1): p1 (&r1) {}
void assign (const T1& r1) const {p1 = &r1;}
bool operator< (const key& x) const {return *p1 < *x.p1;}
};
template <class T1, class T2>
struct key<T1, T2, void>
{
mutable const T1* p1;
mutable const T2* p2;
key (): p1 (0), p2 (0) {}
key (const T1& r1, const T2& r2): p1 (&r1), p2 (&r2) {}
void assign (const T1& r1, const T2& r2) const {p1 = &r1; p2 = &r2;}
bool operator< (const key& x) const
{
return *p1 < *x.p1 || (!(*x.p1 < *p1) && *p2 < *x.p2);
}
};
template <class T1, class T2, class T3>
struct key
{
mutable const T1* p1;
mutable const T2* p2;
mutable const T3* p3;
key (): p1 (0), p2 (0), p3 (0) {}
key (const T1& r1, const T2& r2, const T3& r3)
: p1 (&r1), p2 (&r2) , p3 (&r3) {}
void assign (const T1& r1, const T2& r2, const T3& r3) const
{p1 = &r1; p2 = &r2; p3 = &r3;}
bool operator< (const key& x) const
{
return (*p1 < *x.p1 ||
(!(*x.p1 < *p1) && (*p2 < *x.p2 ||
(!(*x.p2 < *p2) && *p3 < *x.p3))));
}
};
}
}
#endif // CUTL_CONTAINER_KEY_HXX
|