LAL: Linear Arrangement Library 24.10.00
A library focused on algorithms on linear arrangements of graphs.
Loading...
Searching...
No Matches
lal::detail::arrangement_wrapper< type > Class Template Reference

A wrapper to easily use identity arrangements. More...

#include <arrangement_wrapper.hpp>

Public Member Functions

 arrangement_wrapper (const lal::linear_arrangement &arr) noexcept
 Constructor with arrangement.
 
template<typename param_t >
uint64_t operator[] (const param_t &p) const noexcept
 Access operator.
 
std::size_t size () const noexcept
 Returns the size of the arrangement.
 

Private Attributes

const lal::linear_arrangementm_arr
 Constant reference to actual arrangement.
 

Detailed Description

template<arrangement_type type>
class lal::detail::arrangement_wrapper< type >

A wrapper to easily use identity arrangements.

This reduces execution time: it prevents the explicit construction of the identity arrangement (which involves allocation of memory, ...)

Member Function Documentation

◆ operator[]()

template<arrangement_type type>
template<typename param_t >
uint64_t lal::detail::arrangement_wrapper< type >::operator[] ( const param_t & p) const
inlinenodiscardnoexcept

Access operator.

Only when the arrangement is not the identity arrangement, the method accessess m_arr.

Parameters
pEither a lal::node_t or a lal::position_t.

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