class TaBlind: public string


HALL A C++/ROOT Parity Analyzer  Pan

       TaBlind.hh  (implementation)

 Author:  R. Holmes <http://mep1.phy.syr.edu/~rsholmes>, A. Vacheret <http://www.jlab.org/~vacheret>, R. Michaels <http://www.jlab.org/~rom>, K.Paschke
 @(#)pan/src:$Name:  $:$Id: TaBlind.cc,v 1.7 2004/06/18 09:07:22 rsholmes Exp $



  Methods to facilitate blind analysis.  Inspired by BaBar/E158.

  A string is used to provide an initial seed for a random number
  generator.  Asymmetries are hidden with

A_hidden = ((A_true * Asign - AMean) * BlindSign
               + BlindOffset * AOffScale + AMean) * Asign

  where

    Asign is the slow helicity reversal sign.
    AMean is a supplied constant, typically the expected mean when
       Asign is 1.
AOffScale is a supplied constant, typically the expected
      error
    BlindSign is supplied by the blinding algorithm and is -1 or +1
BlindOffset is supplied by the blinding algorithm and is in range
      -1 to +1

  (Note that E158 fixes BlindSign = 1, in which case the value of
  AMean is immaterial and the hidden asymmetry is simply

    A_hidden = A_true + BlindOffset * AOffScale * Asign

  We might do this too, and in fact I don't know why one would want
  a random BlindSign at all, but this class is written to allow it.)

  (Also note that E158 does not include Asign in the blinding
  methods; instead it is assumed that A_true has the "correct" sign,
  as will A_hidden.)

  This is done by Blind and undone by UnBlind.

  To keep the sign of the asymmetry correlations with beam
  parameters, beam differences should get multiplied by BlindSign:

    D_blind = D_true * BlindSign

  This is done by BlindSignOnly.

Function Members (Methods)

public:

	TaBlind()
	TaBlind(const string& s, const Double_t as, const Double_t am, const Double_t ao)
	TaBlind(const char* c, const Double_t as, const Double_t am, const Double_t ao)
virtual	~TaBlind()
string&	string::append(const string& str)
string&	string::append(const char* s)
string&	string::append(const string& str)
string&	string::append(const char* s)
string&	string::append(const char* s, size_t n)
string&	string::append(char c, size_t rep)
string&	string::append(const char* s, size_t n)
string&	string::append(char c, size_t rep)
string&	string::append(const string& str, size_t pos, size_t n)
string&	string::append(const string& str, size_t pos, size_t n)
string&	string::assign(const string& str)
string&	string::assign(const char* s)
string&	string::assign(const string& str)
string&	string::assign(const char* s)
string&	string::assign(const char* s, size_t n)
string&	string::assign(char c, size_t rep)
string&	string::assign(const char* s, size_t n)
string&	string::assign(char c, size_t rep)
string&	string::assign(const string& str, size_t pos, size_t n)
string&	string::assign(const string& str, size_t pos, size_t n)
string::iterator	string::begin()
string::const_iterator	string::begin() const
Double_t	Blind(Double_t atrue) const
Bool_t	Blinding() const
Double_t	BlindSignOnly(Double_t atrue) const
const char*	string::c_str() const
const char*	string::c_str() const
string::size_type	string::capacity() const
static TClass*	Class()
void	string::clear()
int	string::compare(const string& str) const
int	string::compare(const char* s) const
int	string::compare(const string& str) const
int	string::compare(const char* s) const
size_t	string::copy(char* s, size_t n, size_t pos = 0)
size_t	string::copy(char* s, size_t n, size_t pos = 0)
const char*	string::data() const
const char*	string::data() const
bool	string::empty() const
string::iterator	string::end()
string::const_iterator	string::end() const
size_t	string::find(const string& str, size_t pos = 0) const
size_t	string::find(const char* s, size_t pos = 0) const
size_t	string::find(char c, size_t pos = 0) const
size_t	string::find(const string& str, size_t pos = 0) const
size_t	string::find(const char* s, size_t pos = 0) const
size_t	string::find(char c, size_t pos = 0) const
size_t	string::find(const char* s, size_t pos, size_t n) const
size_t	string::find(const char* s, size_t pos, size_t n) const
size_t	string::find_first_not_of(const string& str, size_t pos = 0) const
size_t	string::find_first_not_of(const char* s, size_t pos = 0) const
size_t	string::find_first_not_of(char c, size_t pos = 0) const
size_t	string::find_first_not_of(const string& str, size_t pos = 0) const
size_t	string::find_first_not_of(const char* s, size_t pos = 0) const
size_t	string::find_first_not_of(char c, size_t pos = 0) const
size_t	string::find_first_not_of(const char* s, size_t pos, size_t n) const
size_t	string::find_first_not_of(const char* s, size_t pos, size_t n) const
size_t	string::find_first_of(const string& str, size_t pos = 0) const
size_t	string::find_first_of(const char* s, size_t pos = 0) const
size_t	string::find_first_of(char c, size_t pos = 0) const
size_t	string::find_first_of(const string& str, size_t pos = 0) const
size_t	string::find_first_of(const char* s, size_t pos = 0) const
size_t	string::find_first_of(char c, size_t pos = 0) const
size_t	string::find_first_of(const char* s, size_t pos, size_t n) const
size_t	string::find_first_of(const char* s, size_t pos, size_t n) const
size_t	string::find_last_not_of(const string& str, size_t pos = npos) const
size_t	string::find_last_not_of(const char* s, size_t pos = npos) const
size_t	string::find_last_not_of(char c, size_t pos = npos) const
size_t	string::find_last_not_of(const string& str, size_t pos = npos) const
size_t	string::find_last_not_of(const char* s, size_t pos = npos) const
size_t	string::find_last_not_of(char c, size_t pos = npos) const
size_t	string::find_last_not_of(const char* s, size_t pos, size_t n) const
size_t	string::find_last_not_of(const char* s, size_t pos, size_t n) const
size_t	string::find_last_of(const string& str, size_t pos = npos) const
size_t	string::find_last_of(const char* s, size_t pos = npos) const
size_t	string::find_last_of(char c, size_t pos = npos) const
size_t	string::find_last_of(const string& str, size_t pos = npos) const
size_t	string::find_last_of(const char* s, size_t pos = npos) const
size_t	string::find_last_of(char c, size_t pos = npos) const
size_t	string::find_last_of(const char* s, size_t pos, size_t n) const
size_t	string::find_last_of(const char* s, size_t pos, size_t n) const
string&	string::insert(size_t pos1, const string& str)
string&	string::insert(size_t pos, const char* s)
string&	string::insert(size_t pos1, const string& str)
string&	string::insert(size_t pos, const char* s)
string&	string::insert(size_t pos, const char* s, size_t n)
string&	string::insert(size_t pos, char c, size_t rep)
string&	string::insert(size_t pos, const char* s, size_t n)
string&	string::insert(size_t pos, char c, size_t rep)
string&	string::insert(size_t pos1, const string& str, size_t pos2, size_t n)
string&	string::insert(size_t pos1, const string& str, size_t pos2, size_t n)
virtual TClass*	IsA() const
size_t	string::length() const
size_t	string::length() const
size_t	string::max_size() const
string&	string::operator+=(const string& rhs)
string&	string::operator+=(const char* s)
string&	string::operator+=(char c)
string&	string::operator+=(const string& rhs)
string&	string::operator+=(const char* s)
string&	string::operator+=(char c)
const char&	string::operator[](size_t pos) const
char&	string::operator[](size_t pos)
const char&	string::operator[](size_t pos) const
char&	string::operator[](size_t pos)
string&	string::replace(size_t pos1, size_t n1, const string& str)
string&	string::replace(size_t pos, size_t n1, const char* s)
string&	string::replace(size_t pos1, size_t n1, const string& str)
string&	string::replace(size_t pos, size_t n1, const char* s)
string&	string::replace(size_t pos, size_t n1, const char* s, size_t n2)
string&	string::replace(size_t pos, size_t n, char c, size_t rep)
string&	string::replace(size_t pos, size_t n1, const char* s, size_t n2)
string&	string::replace(size_t pos, size_t n, char c, size_t rep)
string&	string::replace(size_t pos1, size_t n1, const string& str, size_t pos2, size_t n2)
string&	string::replace(size_t pos1, size_t n1, const string& str, size_t pos2, size_t n2)
void	string::reserve(size_t res_arg)
void	string::reserve(size_t res_arg)
void	string::resize(size_t n)
void	string::resize(size_t n)
void	string::resize(size_t n, char c)
void	string::resize(size_t n, char c)
size_t	string::rfind(const string& str, size_t pos = npos) const
size_t	string::rfind(const char* s, size_t pos = npos) const
size_t	string::rfind(char c, size_t pos = npos) const
size_t	string::rfind(const string& str, size_t pos = npos) const
size_t	string::rfind(const char* s, size_t pos = npos) const
size_t	string::rfind(char c, size_t pos = npos) const
size_t	string::rfind(const char* s, size_t pos, size_t n) const
size_t	string::rfind(const char* s, size_t pos, size_t n) const
virtual void	ShowMembers(TMemberInspector& insp, char* parent)
int	string::size()
int	string::size()
virtual void	Streamer(TBuffer& b)
void	StreamerNVirtual(TBuffer& b)
string	string::substr(size_t pos = 0, size_t n = npos) const
string	string::substr(size_t pos = 0, size_t n = npos) const
Double_t	UnBlind(Double_t ablind) const

private:

	TaBlind(const TaBlind& tb)
void	Create(const string s)
const TaBlind&	operator=(const TaBlind& tb)

Double_t	fAMean	value around which we blind
Double_t	fAOffScale	scale of offset
Double_t	fASign	slow helicity reversal sign
Double_t	fBlindOffset	secret offset
Double_t	fBlindSign	secret sign

Pan: The Parity Analyzer -- Class Index

class TaBlind: public string

Function Members (Methods)

Data Members

Class Charts

Function documentation