souffle::detail::brie::fix_first_nested< Dim > Struct Template Reference

#include <Brie.h>

Collaboration diagram for souffle::detail::brie::fix_first_nested< Dim >:

Public Member Functions
template<unsigned bits, typename iterator >
void	operator() (const SparseBitMap< bits > &store, iterator &&iter) const
template<typename Store , typename iterator >
void	operator() (const Store &store, iterator &&iter) const

Detailed Description

template<unsigned Dim>
struct souffle::detail::brie::fix_first_nested< Dim >

Definition at line 2242 of file Brie.h.

Member Function Documentation

operator()() [1/2]

template<unsigned Dim>

template<unsigned bits, typename iterator >

void souffle::detail::brie::fix_first_nested< Dim >::operator() ( const SparseBitMap< bits > &  store, iterator &&  iter  ) const

inline

Definition at line 2244 of file Brie.h.

                   {

operator()() [2/2]

template<unsigned Dim>

template<typename Store , typename iterator >

void souffle::detail::brie::fix_first_nested< Dim >::operator() ( const Store &  store, iterator &&  iter  ) const

inline

Definition at line 2252 of file Brie.h.

                   {
    template <unsigned bits, typename iterator, typename entry_type>
    bool operator()(
            const SparseBitMap<bits>& store, iterator& begin, iterator& end, const entry_type& entry) const {
        // search in current level
        auto cur = store.find(entry[Pos]);
 
        // if not present => fail

References souffle::SparseBitMap< BITS >::end(), and souffle::SparseBitMap< BITS >::find().

Here is the call graph for this function:

---

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

• include/souffle/datastructure/Brie.h