Continuously maps elements from a domain to a range, provided a limited set of points, by interpolating.
More...
#include <ContinuousMap.hpp>
|
|
using | elements_type = std::map< Key, T > |
| | Type used to store elements internally.
|
| |
|
| template<typename... Args> |
| T | at (const Key k, Args... inner_keys) const noexcept |
| | Returns a linearly interpolated value at the given key. More...
|
| |
|
T & | operator[] (const Key &k) |
| | Returns a reference to the value at a given key.
|
| |
|
|
elements_type | elements |
| | This class essentially wraps an STL container.
|
| |
template<typename Key, typename T>
class ContinuousMap< Key, T >
Continuously maps elements from a domain to a range, provided a limited set of points, by interpolating.
- Template Parameters
-
| Key | Type of the domain |
| T | Type of the range |
◆ at()
template<typename Key , typename T >
template<typename... Args>
| T ContinuousMap< Key, T >::at |
( |
const Key |
k, |
|
|
Args... |
inner_keys |
|
) |
| const |
|
inlinenoexcept |
Returns a linearly interpolated value at the given key.
- Template Parameters
-
- Todo:
- Support other interpolation methods
The documentation for this class was generated from the following file:
1.9.5