CexmcAngularRange.cc File Reference

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cmath>
#include "CexmcAngularRange.hh"

Include dependency graph for CexmcAngularRange.cc:

Go to the source code of this file.

Functions
void	GetNormalizedAngularRange (const CexmcAngularRangeList &src, CexmcAngularRangeList &dst)
void	GetAngularGaps (const CexmcAngularRangeList &src, CexmcAngularRangeList &dst)
std::ostream &	operator<< (std::ostream &out, const CexmcAngularRange &angularRange)
std::ostream &	operator<< (std::ostream &out, const CexmcAngularRangeList &angularRanges)

Function Documentation

GetAngularGaps()

void GetAngularGaps	(	const CexmcAngularRangeList &	src,
		CexmcAngularRangeList &	dst
	)

Definition at line 82 of file CexmcAngularRange.cc.

{
    if ( src.empty() )
    {
        dst.push_back( CexmcAngularRange( 1.0, -1.0 , 0 ) );
        return;
    }

    CexmcAngularRangeList  normalizedAngularRanges;
    GetNormalizedAngularRange( src, normalizedAngularRanges );

    G4int  index( 0 );
    if ( normalizedAngularRanges[ 0 ].top < 1.0 )
        dst.push_back( CexmcAngularRange(
                        1.0, normalizedAngularRanges[ 0 ].top, index++ ) );

    for ( CexmcAngularRangeList::iterator
            k( normalizedAngularRanges.begin() );
            k != normalizedAngularRanges.end(); ++k )
    {
        if ( k + 1 == normalizedAngularRanges.end() )
            break;
        dst.push_back( CexmcAngularRange(
                        k->bottom, ( k + 1 )->top, index++ ) );
    }

    if ( normalizedAngularRanges.back().bottom > -1.0 )
        dst.push_back( CexmcAngularRange(
                        normalizedAngularRanges.back().bottom, -1.0, index ) );
}

Here is the call graph for this function:

Here is the caller graph for this function:

GetNormalizedAngularRange()

void GetNormalizedAngularRange	(	const CexmcAngularRangeList &	src,
		CexmcAngularRangeList &	dst
	)

Definition at line 51 of file CexmcAngularRange.cc.

{
    dst = src;
    if ( dst.size() < 2 )
        return;

    std::sort( dst.begin(), dst.end() );

    const G4double  epsilon( 1E-7 );

    for ( CexmcAngularRangeList::iterator  k( dst.begin() + 1 );
                                                            k != dst.end(); )
    {
        if ( std::fabs( k->top - ( k - 1 )->top ) < epsilon ||
             k->bottom + epsilon >= ( k - 1 )->bottom )
        {
            k = dst.erase( k );
            continue;
        }
        if ( k->top + epsilon >= ( k - 1 )->bottom )
        {
            ( k - 1 )->bottom = k->bottom;
            k = dst.erase( k );
            continue;
        }
        ++k;
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

operator<<() [1/2]

std::ostream& operator<<	(	std::ostream &	out,
		const CexmcAngularRange &	angularRange
	)

Definition at line 115 of file CexmcAngularRange.cc.

{
    std::ostream::fmtflags  savedFlags( out.flags() );
    std::streamsize         prec( out.precision() );

    out.precision( 4 );
    out.flags( std::ios::fixed );

    out << std::setw( 2 ) << angularRange.index + 1 << " [" << std::setw( 7 ) <<
           angularRange.top << ", " << std::setw( 7 ) << angularRange.bottom <<
           ")";

    out.precision( prec );
    out.flags( savedFlags );

    return out;
}

Here is the caller graph for this function:

operator<<() [2/2]

std::ostream& operator<<	(	std::ostream &	out,
		const CexmcAngularRangeList &	angularRanges
	)

Definition at line 135 of file CexmcAngularRange.cc.

{
    out << std::endl;
    for ( CexmcAngularRangeList::const_iterator  k( angularRanges.begin() );
                                                k != angularRanges.end(); ++k )
    {
        out << "                 " << *k << std::endl;
    }

    return out;
}