Default PMT simulation.  
 More...
#include <JPMTDefaultSimulator.hh>
Default PMT simulation. 
This class implements the JPMTDefaultSimulatorInterface interface for a given detector using a map of the PMT parameters. 
Definition at line 54 of file JPMTDefaultSimulator.hh.
 
◆ key_type
template<class JKey_t, class JValue_t, class JEvaluator_t = JHashEvaluator> 
 
 
◆ mapped_type
template<class JKey_t, class JValue_t, class JEvaluator_t = JHashEvaluator> 
 
 
◆ value_type
template<class JKey_t, class JValue_t, class JEvaluator_t = JHashEvaluator> 
 
 
◆ evaluator_type
template<class JKey_t, class JValue_t, class JEvaluator_t = JHashEvaluator> 
 
 
◆ container_type
template<class JKey_t, class JValue_t, class JEvaluator_t = JHashEvaluator> 
 
 
◆ const_iterator
template<class JKey_t, class JValue_t, class JEvaluator_t = JHashEvaluator> 
 
 
◆ const_reverse_iterator
template<class JKey_t, class JValue_t, class JEvaluator_t = JHashEvaluator> 
 
 
◆ iterator
template<class JKey_t, class JValue_t, class JEvaluator_t = JHashEvaluator> 
 
 
◆ reverse_iterator
template<class JKey_t, class JValue_t, class JEvaluator_t = JHashEvaluator> 
 
 
◆ pair_type
template<class JKey_t, class JValue_t, class JEvaluator_t = JHashEvaluator> 
 
 
◆ JPMTDefaultSimulator() [1/3]
  
  
      
        
          | JDETECTOR::JPMTDefaultSimulator::JPMTDefaultSimulator  | 
          ( | 
           | ) | 
           | 
         
       
   | 
  
inline   | 
  
 
 
◆ JPMTDefaultSimulator() [2/3]
Constructor. 
- Parameters
 - 
  
    | parameters | PMT parameters  | 
    | detector | detector  | 
  
   
Definition at line 72 of file JPMTDefaultSimulator.hh.
   75       for (JDetector::const_iterator module = detector.begin(); module != detector.end(); ++module) {
 
   76         for (
size_t pmt = 0; pmt != module->size(); ++pmt) {
 
 
 
 
◆ JPMTDefaultSimulator() [3/3]
◆ getPMTSignalProcessor()
◆ processHits()
◆ getPMTstatus()
  
  
      
        
          | virtual bool JDETECTOR::JPMTDefaultSimulatorInterface::getPMTstatus  | 
          ( | 
          const JPMTIdentifier &  | 
          id | ) | 
           const | 
         
       
   | 
  
inlinevirtualinherited   | 
  
 
 
◆ clear()
template<class JKey_t, class JValue_t, class JEvaluator_t = JHashEvaluator> 
 
 
◆ get() [1/2]
template<class JKey_t, class JValue_t, class JEvaluator_t = JHashEvaluator> 
 
 
◆ get() [2/2]
template<class JKey_t, class JValue_t, class JEvaluator_t = JHashEvaluator> 
 
Get mapped value. 
This method will throw an exception if given key is not present following the prerequisite of constness.
- Parameters
 - 
  
  
 
- Returns
 - mapped value 
 
Definition at line 179 of file JHashMap.hh.
  181       const int ival = this->
getValue(key);
 
  184         return container_type::operator[](
router.get(ival)).second;
 
  186         THROW(JIndexOutOfRange, 
"JHasMap::get(): invalid key.");
 
 
 
 
◆ insert()
template<class JKey_t, class JValue_t, class JEvaluator_t = JHashEvaluator> 
 
Insert element. 
- Parameters
 - 
  
  
 
- Returns
 - (position, status), where status is true if inserted; else false 
 
Definition at line 196 of file JHashMap.hh.
  200       const int ival = this->
getValue(element.first);
 
  204         iterator i = container_type::insert(lower_bound(this->begin(), this->end(), element.first, 
compare), element);
 
  208         for (
iterator __i = i; ++__i != this->end(); ) {
 
 
 
 
◆ erase() [1/3]
template<class JKey_t, class JValue_t, class JEvaluator_t = JHashEvaluator> 
 
Erase element at given position. 
- Parameters
 - 
  
  
 
Definition at line 226 of file JHashMap.hh.
  232       container_type::erase(i++);
 
  234       for ( ; i != this->end(); ++i) {
 
 
 
 
◆ erase() [2/3]
template<class JKey_t, class JValue_t, class JEvaluator_t = JHashEvaluator> 
 
Erase elements in given range. 
- Parameters
 - 
  
    | __begin | begin position (included)  | 
    | __end | end position (excluded)  | 
  
   
Definition at line 246 of file JHashMap.hh.
  254         container_type::erase(i++);
 
  257       for ( ; i != this->end(); ++i) {
 
 
 
 
◆ erase() [3/3]
template<class JKey_t, class JValue_t, class JEvaluator_t = JHashEvaluator> 
 
Erase element. 
- Parameters
 - 
  
  
 
- Returns
 - true if element with given key has been erased; else false 
 
Definition at line 269 of file JHashMap.hh.
  271       const int ival = this->
getValue(key);
 
  279         iterator i = container_type::erase(pos);
 
  281         for ( ; i != this->end(); ++i) {
 
 
 
 
◆ has()
template<class JKey_t, class JValue_t, class JEvaluator_t = JHashEvaluator> 
 
Test whether key is present. 
- Parameters
 - 
  
  
 
- Returns
 - true if present; else false 
 
Definition at line 298 of file JHashMap.hh.
 
 
◆ getComparator()
template<class JKey_t, class JValue_t, class JEvaluator_t = JHashEvaluator> 
 
Get comparator. 
- Returns
 - comparator 
 
Definition at line 309 of file JHashMap.hh.
 
 
◆ resize()
template<class JKey_t, class JValue_t, class JEvaluator_t = JHashEvaluator> 
 
 
◆ push_back()
template<class JKey_t, class JValue_t, class JEvaluator_t = JHashEvaluator> 
 
 
◆ pop_back()
template<class JKey_t, class JValue_t, class JEvaluator_t = JHashEvaluator> 
 
 
◆ operator[]()
template<class JKey_t, class JValue_t> 
 
 
◆ put()
template<class JKey_t, class JValue_t> 
 
 
◆ getValue
template<class JKey_t, class JValue_t, class JEvaluator_t = JHashEvaluator> 
 
Function object for evaluation of key. 
Definition at line 366 of file JHashMap.hh.
 
 
◆ compare
template<class JKey_t, class JValue_t, class JEvaluator_t = JHashEvaluator> 
 
Function object for comparison. 
Definition at line 373 of file JHashMap.hh.
 
 
◆ router
template<class JKey_t, class JValue_t, class JEvaluator_t = JHashEvaluator> 
 
 
The documentation for this class was generated from the following file:
 
std::vector< T >::difference_type distance(typename std::vector< T >::const_iterator first, typename PhysicsEvent::const_iterator< T > second)
Specialisation of STL distance.