Google OR-Tools v9.14
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
operations_research::math_opt::detail::KeySet< n > Class Template Reference

#include <attr_storage.h>

Public Types

using Key = AttrKey<n, NoSymmetry>

Public Member Functions

size_t size () const
template<typename F>
void ForEach (F f) const
 We can't do begin/end because the iterator types are not the same.
auto Erase (const Key &key)
void Insert (const Key &key)

Detailed Description

template<int n>
class operations_research::math_opt::detail::KeySet< n >

A non-default key set that switches between implementations opportunistically: It starts dense, and switches to sparse if there are deletions.

Definition at line 101 of file attr_storage.h.

Member Typedef Documentation

◆ Key

template<int n>
using operations_research::math_opt::detail::KeySet< n >::Key = AttrKey<n, NoSymmetry>

Definition at line 103 of file attr_storage.h.

Member Function Documentation

◆ Erase()

template<int n>
auto operations_research::math_opt::detail::KeySet< n >::Erase ( const Key & key)
inline

Definition at line 120 of file attr_storage.h.

◆ ForEach()

template<int n>
template<typename F>
void operations_research::math_opt::detail::KeySet< n >::ForEach ( F f) const
inline

We can't do begin/end because the iterator types are not the same.

requires std::invocable<F, const Key&>

Definition at line 112 of file attr_storage.h.

◆ Insert()

template<int n>
void operations_research::math_opt::detail::KeySet< n >::Insert ( const Key & key)
inline

Definition at line 122 of file attr_storage.h.

◆ size()

template<int n>
size_t operations_research::math_opt::detail::KeySet< n >::size ( ) const
inline

Definition at line 105 of file attr_storage.h.


The documentation for this class was generated from the following file: