atlas::bits Namespace Reference

Functions
unsigned int	bitCount (unsigned long x)
size_t	firstBit (unsigned long f)
size_t	lastBit (unsigned long f)
void	permute (unsigned long &f, const setutils::Permutation &a)
void	copy (void *dest, const void *source, size_t d)

---

Function Documentation

unsigned atlas::bits::bitCount (  unsigned long  x  )

Synopsis: returns the sum of the bits (i.e., the number of set bits) in x. Definition at line 30 of file bits.cpp. Referenced by atlas::bitset::BitSetBase< 2 >::count(), atlas::bitset::BitSetBase< 1 >::count(), atlas::filekl::matrix_info::matrix_info(), atlas::bitmap::BitMap::n_th(), atlas::BitCount::operator()(), atlas::bitset::BitSetBase< 2 >::position(), atlas::bitset::BitSetBase< 1 >::position(), atlas::bitmap::BitMap::position(), atlas::bitset::BitSetBase< 1 >::scalarProduct(), and atlas::bitmap::BitMap::size().

void copy (  void *  dest, const void *  source, size_t  d )  [inline]

Definition at line 28 of file bits.h. Referenced by atlas::graph::OrientedGraph::addLinks(), atlas::weyl::WeylGroup::conjugacyClass(), atlas::topology::Connectivity::Connectivity(), atlas::cartanset::CartanClassSet::correlateDualForms(), atlas::cartanset::CartanClassSet::correlateForms(), atlas::kl::helper::Thicket::fill(), atlas::fillPositiveRoots(), atlas::kl::helper::Thicket::fillXList(), atlas::kl::KLContext::makeExtremalRow(), atlas::blocks::makeHasse(), atlas::kl::KLContext::makePrimitiveRow(), atlas::nextShape(), atlas::testrun::SubgroupIterator::resetGenerator(), atlas::weyl::WeylGroup::twistedConjugacyClass(), and atlas::kl::helper::Helper::writeRow().

size_t atlas::bits::firstBit (  unsigned long  f  )

Synopsis: returns the position of the first set bit in f. Returns longBits if there is no such bit. Definition at line 64 of file bits.cpp. References atlas::constants::firstbit. Referenced by atlas::interpreter::check_involution(), atlas::bitset::BitSet< numFlags >::firstBit(), atlas::bitset::BitSetBase< 2 >::firstBit(), atlas::bitset::BitSetBase< 1 >::firstBit(), atlas::bitmap::BitMap::front(), atlas::bitvector::BitMatrix< dim >::invert(), atlas::bitmap::BitMap::n_th(), atlas::bitset::BitSetBase< 1 >::iterator::operator *(), atlas::bitset::BitSetBase< 1 >::iterator::operator!=(), atlas::bitmap::BitMap::iterator::operator++(), and atlas::bitset::BitSetBase< 1 >::iterator::operator==().

size_t atlas::bits::lastBit (  unsigned long  f  )

Synopsis: returns the position of the last (most significant) set bit in f, PLUS ONE. Returns 0 if there is no such bit. Definition at line 86 of file bits.cpp. References atlas::constants::lastbit. Referenced by atlas::pool::Pool::allocate(), atlas::bitmap::BitMap::back_up(), atlas::pool::Pool::deallocate(), atlas::bitset::BitSet< numFlags >::lastBit(), atlas::bitset::BitSetBase< 2 >::lastBit(), and atlas::bitset::BitSetBase< 1 >::lastBit().

void atlas::bits::permute (  unsigned long &  f, const setutils::Permutation &  a )

Synopsis: permutes the bits of f according to a: if the bits of f are interpreted with respect to a sequence of objects x_0,...,x_{n-1}, then the bits of the result are interpreted with respect to the permuted sequence x_{a[0]},...,x_{a[n-1]} Precisely, we transform f = f_old into f_new, where f_new[i] = f_old[a[i]]. Note that the permutation of bits is not interpreted in the same way as the permutation of vector entries in setutils::permute, given in setutils_def.h Definition at line 107 of file bits.cpp. References atlas::constants::bitMask. Referenced by atlas::bitset::BitSet< numFlags >::permute(), and atlas::bitset::BitSetBase< 1 >::permute().

---