Class template category

boost::histogram::axis::category — Maps at a set of unique values to bin indices.

Synopsis

// In header: <boost/histogram/axis/category.hpp>

template<typename Value, typename MetaData, typename Options, 
         typename Allocator> 
class category : public boost::histogram::axis::iterator_mixin< category< Value, MetaData, Options, Allocator > >,
                 public metadata_base_t< MetaData >
{
public:

  // public member functions
  category() = default;
  explicit category(allocator_type);
  template<typename It> 
    category(It, It, metadata_type = {}, options_type = {}, 
             allocator_type = {});
  template<typename It, typename A> category(It, It, metadata_type, A);
  template<typename C> 
    category(const C &, metadata_type = {}, options_type = {}, 
             allocator_type = {});
  template<typename C, typename A> category(const C &, metadata_type, A);
  template<typename U> 
    category(std::initializer_list< U >, metadata_type = {}, 
             options_type = {}, allocator_type = {});
  template<typename U, typename A> 
    category(std::initializer_list< U >, metadata_type, A);
  category(const category &, index_type, index_type, unsigned);
  index_type index(const value_type &) const noexcept;
  std::pair< index_type, index_type > update(const value_type &);
  auto value(index_type) const;
  decltype(auto) bin(index_type) const;
  index_type size() const noexcept;
  template<typename V, typename M, typename O, typename A> 
    bool operator==(const category< V, M, O, A > &) const noexcept;
  template<typename V, typename M, typename O, typename A> 
    bool operator!=(const category< V, M, O, A > &) const noexcept;
  allocator_type get_allocator() const;
  template<typename Archive> void serialize(Archive &, unsigned);

  // public static functions
  static constexpr unsigned options() noexcept;
  static constexpr bool inclusive() noexcept;
  static constexpr bool ordered() noexcept;
};

Description

The axis maps a set of values to bins, following the order of arguments in the constructor. The optional overflow bin for this axis counts input values that are not part of the set. Binning has O(N) complexity, but with a very small factor. For small N (the typical use case) it beats other kinds of lookup.

The options underflow andcircular are not allowed. The optionsgrowth andoverflow are mutually exclusive.

Template Parameters

```
typename Value
```
input value type, must be equal-comparable.
```
typename MetaData
```
type to store meta data.
```
typename Options
```
see boost::histogram::axis::option.
```
typename Allocator
```
allocator to use for dynamic memory management.

`category` public member functions

```
category() = default;
```

explicit category(allocator_type alloc);

template<typename It> 
  category(It begin, It end, metadata_type meta = {}, 
           options_type options = {}, allocator_type alloc = {});

Construct from forward iterator range of unique values.

The constructor throws std::invalid_argument if iterator range is invalid. If the range contains duplicated values, the behavior of the axis is undefined.

The arguments meta and alloc are passed by value. If you move either of them into the axis and the constructor throws, their values are lost. Do not move if you cannot guarantee that the bin description is not valid.

Parameters:

`begin`	begin of category range of unique values.
`end`	end of category range of unique values.
`meta`	description of the axis (optional).
`options`	see boost::histogram::axis::option (optional).
`alloc`	allocator instance to use (optional).

template<typename It, typename A> 
  category(It begin, It end, metadata_type meta, A alloc);

```
template<typename C> 
  category(const C & iterable, metadata_type meta = {}, 
           options_type options = {}, allocator_type alloc = {});
```
Construct axis from iterable sequence of unique values.

Parameters:

iterable

sequence of unique values.

meta

description of the axis.

options

see boost::histogram::axis::option (optional).

alloc

allocator instance to use.

template<typename C, typename A> 
  category(const C & iterable, metadata_type meta, A alloc);

template<typename U> 
  category(std::initializer_list< U > list, metadata_type meta = {}, 
           options_type options = {}, allocator_type alloc = {});

Construct axis from an initializer list of unique values.

Parameters:

`list`	`std::initializer_list` of unique values.
`meta`	description of the axis.
`options`	see boost::histogram::axis::option (optional).
`alloc`	allocator instance to use.

template<typename U, typename A> 
  category(std::initializer_list< U > list, metadata_type meta, A alloc);

category(const category & src, index_type begin, index_type end, 
         unsigned merge);

Constructor used by algorithm::reduce to shrink and rebin (not for users).

index_type index(const value_type & x) const noexcept;

Return index for value argument.

std::pair< index_type, index_type > update(const value_type & x);

Returns index and shift (if axis has grown) for the passed argument.

```
auto value(index_type idx) const;
```
Return value for index argument.
Throws std::out_of_range if the index is out of bounds.
```
decltype(auto) bin(index_type idx) const;
```
Return value for index argument; alias for value(...).
```
index_type size() const noexcept;
```
Returns the number of bins, without over- or underflow.

template<typename V, typename M, typename O, typename A> 
  bool operator==(const category< V, M, O, A > & o) const noexcept;

template<typename V, typename M, typename O, typename A> 
  bool operator!=(const category< V, M, O, A > & o) const noexcept;

```
allocator_type get_allocator() const;
```

template<typename Archive> void serialize(Archive & ar, unsigned);

`category` public static functions

static constexpr unsigned options() noexcept;

Returns the options.

```
static constexpr bool inclusive() noexcept;
```
Whether the axis is inclusive (see axis::traits::is_inclusive).

static constexpr bool ordered() noexcept;

Indicate that the axis is not ordered.

Boost C++ Libraries