TrigPassBitsCnv_p1.cxx File Reference

#include "TrigSteeringEvent/TrigPassBits.h"
#include <cmath>
#include <iostream>
#include "TrigSteeringEventTPCnv/TrigPassBits_p1.h"
#include "TrigSteeringEventTPCnv/TrigPassBitsCnv_p1.h"

Include dependency graph for TrigPassBitsCnv_p1.cxx:

Go to the source code of this file.

Functions
void	store_bits (const std::vector< bool > &bits, std::vector< uint32_t > &store)
void	restore_bits (std::vector< bool > &bits, const std::vector< uint32_t > &store)
unsigned	necessary_words (unsigned size)

Function Documentation

necessary_words()

unsigned necessary_words

(

unsigned

size

)

Definition at line 52 of file TrigPassBitsCnv_p1.cxx.

                                        {
  return  (size ? 1 : 0) + size/32;
}

restore_bits()

void restore_bits	(	std::vector< bool > &	bits,
		const std::vector< uint32_t > &	store
	)

Definition at line 30 of file TrigPassBitsCnv_p1.cxx.

                                                                           {
  const unsigned word_count = store.size();
  const unsigned bits_count = bits.size();
 
 
  for ( unsigned word = 0; word < word_count; ++word) {    
    const uint32_t& temp(store[word]);
 
    for ( unsigned bit = 0; bit < 32; ++bit) {
      const unsigned position = word*32+bit;
      if (position >= bits_count )
    return;
 
      if (temp & (1 << bit))
    bits[position] = true;
      else
    bits[position] = false;      
    }
  }
}

store_bits()

void store_bits	(	const std::vector< bool > &	bits,
		std::vector< uint32_t > &	store
	)

Definition at line 13 of file TrigPassBitsCnv_p1.cxx.

                                                                          {
  const unsigned word_count = store.size();
  const unsigned bits_count = bits.size();
 
  for ( unsigned word = 0; word < word_count; ++word) {    
    uint32_t& temp(store[word]);
 
    for ( unsigned bit = 0; bit < 32; ++bit) {
      const unsigned position = word*32+bit;
      if (position >= bits_count )
    return;
      if (bits[position])
    temp |= (1 << bit);
    }
  }
}