The neighborhood of a cube in a set of cubes. More...

#include <bddacycl.h>

Public Member Functions
	Neighbors (const cubetype &middle, const settype &cset, BitField &bfield)
	The default constructor. More...

bool	check (int n) const
	The procedure for checking whether the given neighbor exists. More...

Private Attributes
const cubetype &	q
	The cube whose neighbors are verified. More...

const settype &	s
	The set of cubes in which the neighbors of the cube are sought. More...

BitField &	b
	The bitfield to record each neighbor in. More...

Detailed Description

template<class cubetype, class settype>
class chomp::homology::Neighbors< cubetype, settype >

The neighborhood of a cube in a set of cubes.

Definition at line 1138 of file bddacycl.h.

Constructor & Destructor Documentation

◆ Neighbors()

template<class cubetype , class settype >

chomp::homology::Neighbors< cubetype, settype >::Neighbors	(	const cubetype &	middle,
		const settype &	cset,
		BitField &	bfield
	)

inline

The default constructor.

Definition at line 1142 of file bddacycl.h.

1143 : q (middle), s (cset), b (bfield) {};

chomp::homology::Neighbors::q

const cubetype & q

The cube whose neighbors are verified.

Definition: bddacycl.h:1161

chomp::homology::Neighbors::s

const settype & s

The set of cubes in which the neighbors of the cube are sought.

Definition: bddacycl.h:1164

chomp::homology::Neighbors::b

BitField & b

The bitfield to record each neighbor in.

Definition: bddacycl.h:1167

Member Function Documentation

◆ check()

template<class cubetype , class settype >

bool chomp::homology::Neighbors< cubetype, settype >::check ( int n ) const

inline

The procedure for checking whether the given neighbor exists.

The number of the neighbor is consistent with the "bit2neighbor" and "neighbor2bit" procedures.

Definition at line 1148 of file bddacycl.h.

        {
                cubetype neighbor = bit2neighbor (q, n);
                if (neighbor == q)
                        return false;
                bool result = s. check (neighbor);
                if (result)
                        b. set (n);
                return result;
        }