SigSet< T, Compare > Struct Template Reference

#include <sigtools.h>

Data Structures
struct	bitDef_t

Public Member Functions
void	clear ()
void	insert (RTLIL::SigSpec sig, T data)
void	insert (RTLIL::SigSpec sig, const std::set< T > &data)
void	erase (RTLIL::SigSpec sig)
void	erase (RTLIL::SigSpec sig, T data)
void	erase (RTLIL::SigSpec sig, const std::set< T > &data)
void	find (RTLIL::SigSpec sig, std::set< T > &result)
std::set< T >	find (RTLIL::SigSpec sig)
bool	has (RTLIL::SigSpec sig)

Data Fields
std::map< bitDef_t, std::set < T, Compare > >	bits

Detailed Description

template<typename T, class Compare = std::less<T>>
struct SigSet< T, Compare >

Definition at line 138 of file sigtools.h.

Member Function Documentation

template<typename T, class Compare = std::less<T>>

void SigSet< T, Compare >::clear ( )

inline

Definition at line 147 of file sigtools.h.

    {
        bits.clear();
    }

Here is the caller graph for this function:

template<typename T, class Compare = std::less<T>>

void SigSet< T, Compare >::erase ( RTLIL::SigSpec  sig )

inline

Definition at line 166 of file sigtools.h.

    {
        for (auto &bit : sig)
            if (bit.wire != NULL)
                bits[bit].clear();
    }

template<typename T, class Compare = std::less<T>>

void SigSet< T, Compare >::erase ( RTLIL::SigSpec  sig, T  data  )

inline

Definition at line 173 of file sigtools.h.

    {
        for (auto &bit : sig)
            if (bit.wire != NULL)
                bits[bit].erase(data);
    }

template<typename T, class Compare = std::less<T>>

void SigSet< T, Compare >::erase ( RTLIL::SigSpec  sig, const std::set< T > &  data  )

inline

Definition at line 180 of file sigtools.h.

    {
        for (auto &bit : sig)
            if (bit.wire != NULL)
                bits[bit].erase(data.begin(), data.end());
    }

template<typename T, class Compare = std::less<T>>

void SigSet< T, Compare >::find ( RTLIL::SigSpec  sig, std::set< T > &  result  )

inline

Definition at line 187 of file sigtools.h.

    {
        for (auto &bit : sig)
            if (bit.wire != NULL) {
                auto &data = bits[bit];
                result.insert(data.begin(), data.end());
            }
    }

Here is the caller graph for this function:

template<typename T, class Compare = std::less<T>>

std::set<T> SigSet< T, Compare >::find ( RTLIL::SigSpec  sig )

inline

Definition at line 196 of file sigtools.h.

    {
        std::set<T> result;
        find(sig, result);
        return result;
    }

template<typename T, class Compare = std::less<T>>

bool SigSet< T, Compare >::has ( RTLIL::SigSpec  sig )

inline

Definition at line 203 of file sigtools.h.

    {
        for (auto &bit : sig)
            if (bit.wire != NULL && bits.count(bit))
                return true;
        return false;
    }

Here is the caller graph for this function:

template<typename T, class Compare = std::less<T>>

void SigSet< T, Compare >::insert ( RTLIL::SigSpec  sig, T  data  )

inline

Definition at line 152 of file sigtools.h.

    {
        for (auto &bit : sig)
            if (bit.wire != NULL)
                bits[bit].insert(data);
    }

Here is the caller graph for this function:

template<typename T, class Compare = std::less<T>>

void SigSet< T, Compare >::insert ( RTLIL::SigSpec  sig, const std::set< T > &  data  )

inline

Definition at line 159 of file sigtools.h.

    {
        for (auto &bit : sig)
            if (bit.wire != NULL)
                bits[bit].insert(data.begin(), data.end());
    }

Field Documentation

template<typename T, class Compare = std::less<T>>

std::map<bitDef_t, std::set<T, Compare> > SigSet< T, Compare >::bits

Definition at line 145 of file sigtools.h.

---

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

• sigtools.h