[29410b]: classic-bugs / vol2 / cervix / baz Maximize Restore History

Download this file

baz    4512 lines (4476 with data), 737.0 kB

Flat profile:

Each sample counts as 0.01 seconds.
  %   cumulative   self              self     total           
 time   seconds   seconds    calls  Ks/call  Ks/call  name    
 18.78    280.82   280.82 121900944     0.00     0.00  DBern::logLikelihood(long, std::vector<SArray const*, std::allocator<SArray const*> > const&) const
 15.03    505.62   224.80  5827214     0.00     0.00  GibbsSampler::setValue(double const*, long)
 11.23    673.57   167.95 51221032     0.00     0.00  std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::find(long const&)
  8.95    807.39   133.82 121947191     0.00     0.00  StochasticNode::logDensity()
  8.62    936.30   128.91 121900944     0.00     0.00  DistFinite::logLikelihood(SArray const&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const
  7.95   1055.18   118.88 42554472     0.00     0.00  ILogit::evaluate(std::vector<SArray const*, std::allocator<SArray const*> > const&) const
  7.43   1166.35   111.17 141065291     0.00     0.00  LogicalNode::forwardSample()
  6.20   1259.08    92.73 51221032     0.00     0.00  MixtureNode::forwardSample()
  3.72   1314.78    55.70 30390586     0.00     0.00  Multiply::evaluate(std::vector<SArray const*, std::allocator<SArray const*> > const&) const
  3.30   1364.16    49.38 48352567     0.00     0.00  Add::evaluate(std::vector<SArray const*, std::allocator<SArray const*> > const&) const
  2.85   1406.78    42.62 19756655     0.00     0.00  Subtract::evaluate(std::vector<SArray const*, std::allocator<SArray const*> > const&) const
  1.53   1429.64    22.86  3904247     0.00     0.00  Sampler::logFullConditional()
  1.21   1447.76    18.12 203912840     0.00     0.00  SArray::setValue(double const*, unsigned long)
  0.72   1458.50    10.74 141065291     0.00     0.00  ScalarFunc::evaluate(SArray&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const
  0.34   1463.52     5.02 96244414     0.00     0.00  Index::operator[](unsigned int) const
  0.33   1468.50     4.98 141059285     0.00     0.00  Function::checkParameterValue(std::vector<SArray const*, std::allocator<SArray const*> > const&) const
  0.22   1471.83     3.33  5789044     0.00     0.00  OffsetNode::forwardSample()
  0.20   1474.80     2.97 11578088     0.00     0.00  SubSetIndex::value() const
  0.15   1476.99     2.19  5846318     0.00     0.00  Range::leftOffset(Index const&) const
  0.13   1478.88     1.89  5989472     0.00     0.00  Range::contains(Index const&) const
  0.10   1480.37     1.49  1929000     0.00     0.00  FiniteSampler::update()
  0.10   1481.84     1.47  1941812     0.00     0.00  StochasticNode::distribution() const
  0.09   1483.22     1.38 51408928     0.00     0.00  SArray::length() const
  0.08   1484.49     1.27 11578088     0.00     0.00  asInteger(double)
  0.08   1485.70     1.21       20     0.00     0.07  Model::update(long)
  0.08   1486.83     1.13   670605     0.00     0.00  std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::find(Node* const&) const
  0.05   1487.56     0.73   520807     0.00     0.00  std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::find(Node const* const&)
  0.04   1488.23     0.67  1184488     0.00     0.00  std::_Rb_tree_base_iterator::_M_increment()
  0.04   1488.76     0.53  6044854     0.00     0.00  Index::Index(unsigned int)
  0.03   1489.20     0.44 12210221     0.00     0.00  Index::operator[](unsigned int)
  0.03   1489.63     0.43 19724490     0.00     0.00  Index::length() const
  0.03   1490.06     0.43     1940     0.00     0.00  Graph::getSortedNodes(std::vector<Node*, std::allocator<Node*> >&)
  0.02   1490.40     0.34    46247     0.00     0.00  DistReal::logLikelihood(SArray const&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const
  0.02   1490.72     0.32    87950     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const
  0.02   1491.04     0.32     7000     0.00     0.00  SliceSampler::update()
  0.01   1491.25     0.21   124618     0.00     0.00  std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::find(Node const* const&) const
  0.01   1491.46     0.21    33542     0.00     0.00  getParameters(double&, double&, std::vector<SArray const*, std::allocator<SArray const*> > const&)
  0.01   1491.65     0.19    54174     0.00     0.00  Node::hasDescendant(bool (*)(Node const*)) const
  0.01   1491.81     0.16  6374332     0.00     0.00  Index::~Index()
  0.01   1491.96     0.15    53247     0.00     0.00  Distribution::lowerBound(std::vector<SArray const*, std::allocator<SArray const*> > const&) const
  0.01   1492.10     0.14  5829150     0.00     0.00  Sampler::deterministicChildren() const
  0.01   1492.24     0.14   221640     0.00     0.00  std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::insert_unique(Node* const&)
  0.01   1492.38     0.14   128622     0.00     0.00  Node::isInitialized()
  0.01   1492.50     0.12    12705     0.00     0.00  DNorm::d(double, std::vector<SArray const*, std::allocator<SArray const*> > const&, bool) const
  0.01   1492.61     0.11   658014     0.00     0.00  indexComp(Index const&, Index const&)
  0.01   1492.72     0.11   392644     0.00     0.00  std::_Rb_tree_rebalance(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&)
  0.01   1492.83     0.11    36664     0.00     0.00  std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::_M_erase(std::_Rb_tree_node<Node*>*)
  0.01   1492.93     0.10  5815000     0.00     0.00  GibbsSampler::node()
  0.01   1493.03     0.10  3872000     0.00     0.00  StochasticNode::parameters() const
  0.01   1493.12     0.09    33542     0.00     0.00  DUnif::d(double, std::vector<SArray const*, std::allocator<SArray const*> > const&, bool) const
  0.01   1493.21     0.09    12288     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const
  0.01   1493.29     0.08   498763     0.00     0.00  std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >::~pair()
  0.00   1493.36     0.07   187651     0.00     0.00  SArray::isFixed() const
  0.00   1493.43     0.07   123409     0.00     0.00  Node::unref()
  0.00   1493.50     0.07    28567     0.00     0.00  std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::insert_unique(std::pair<Node const* const, int> const&)
  0.00   1493.57     0.07     1942     0.00     0.00  std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::_M_erase(std::_Rb_tree_node<std::pair<Node const* const, int> >*)
  0.00   1493.63     0.06   500810     0.00     0.00  std::_Vector_base<Node*, std::allocator<Node*> >::_Vector_base(unsigned int, std::allocator<Node*> const&)
  0.00   1493.69     0.06    50817     0.00     0.00  std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::lower_bound(Node* const&)
  0.00   1493.74     0.05   576216     0.00     0.00  rangeComp(Range const&, Range const&)
  0.00   1493.79     0.05   103570     0.00     0.00  std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::lower_bound(Node const* const&)
  0.00   1493.84     0.05    79806     0.00     0.00  Range::Range(Index const&, Index const&)
  0.00   1493.88     0.04  1929000     0.00     0.00  DBern::lowerLimit(std::vector<SArray const*, std::allocator<SArray const*> > const&) const
  0.00   1493.92     0.04  1929000     0.00     0.00  DBern::upperLimit(std::vector<SArray const*, std::allocator<SArray const*> > const&) const
  0.00   1493.96     0.04   670605     0.00     0.00  Graph::contains(Node*) const
  0.00   1494.00     0.04   417237     0.00     0.00  GraphMarks::mark(Node const*)
  0.00   1494.04     0.04   279074     0.00     0.00  std::_Rb_tree_rotate_left(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&)
  0.00   1494.08     0.04    67494     0.00     0.00  CounterTab::getCounter(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const
  0.00   1494.12     0.04    51187     0.00     0.00  Range::dim(bool) const
  0.00   1494.16     0.04    40942     0.00     0.00  std::vector<SArray const*, std::allocator<SArray const*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<SArray const**, std::vector<SArray const*, std::allocator<SArray const*> > >, SArray const* const&)
  0.00   1494.20     0.04    40899     0.00     0.00  std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::find(Range const&) const
  0.00   1494.24     0.04    26626     0.00     0.00  findDescendant(Node*, Node*, Graph const*, GraphMarks&)
  0.00   1494.28     0.04    12268     0.00     0.00  printRange(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, Range const&)
  0.00   1494.31     0.03  1932865     0.00     0.00  asFinite(Distribution const*)
  0.00   1494.34     0.03  1293571     0.00     0.00  Range::lower() const
  0.00   1494.37     0.03   221640     0.00     0.00  std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, Node* const&)
  0.00   1494.40     0.03    50817     0.00     0.00  std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::upper_bound(Node* const&)
  0.00   1494.43     0.03    44549     0.00     0.00  std::_Rb_tree_rebalance_for_erase(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&, std::_Rb_tree_node_base*&, std::_Rb_tree_node_base*&)
  0.00   1494.46     0.03    38862     0.00     0.00  Range::Range()
  0.00   1494.49     0.03    38852     0.00     0.00  Compiler::getRange(std::vector<ParseTree*, std::allocator<ParseTree*> > const&, Range const&, Range&)
  0.00   1494.52     0.03    32760     0.00     0.00  char* std::basic_string<char, std::char_traits<char>, std::allocator<char> >::_S_construct<char*>(char*, char*, std::allocator<char> const&, std::forward_iterator_tag)
  0.00   1494.55     0.03    26626     0.00     0.00  Node::Node(Index const&)
  0.00   1494.58     0.03    26614     0.00     0.00  Compiler::getLogicalParameter(ParseTree const*)
  0.00   1494.61     0.03    18405     0.00     0.00  NodeArray::rangeContainsSetNodes(Range const&) const
  0.00   1494.64     0.03    18304     0.00     0.00  Node::canInitialize()
  0.00   1494.67     0.03     6154     0.00     0.00  LogicalFactory::getLogicalNode(Function const*, std::vector<Node*, std::allocator<Node*> > const&)
  0.00   1494.70     0.03     6139     0.00     0.00  Compiler::allocateStochastic(ParseTree const*)
  0.00   1494.73     0.03     2834     0.00     0.00  void std::__push_heap<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, Sampler*, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, int, Sampler*, less_sampler)
  0.00   1494.76     0.03     2834     0.00     0.00  void std::__adjust_heap<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, Sampler*, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, int, Sampler*, less_sampler)
  0.00   1494.79     0.03       20     0.00     0.00  __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > > std::__unguarded_partition<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, Sampler*, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, Sampler*, less_sampler)
  0.00   1494.81     0.02   403140     0.00     0.00  Index::Index(Index const&)
  0.00   1494.83     0.02   321300     0.00     0.00  ParseTree::parameters() const
  0.00   1494.85     0.02   248358     0.00     0.00  ltlogical::operator()(std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >)
  0.00   1494.87     0.02   154886     0.00     0.00  isObserved(Node const*)
  0.00   1494.89     0.02   145241     0.00     0.00  ParseTree::name() const
  0.00   1494.91     0.02   130196     0.00     0.00  std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::_M_create_node(std::pair<Node const* const, int> const&)
  0.00   1494.93     0.02   126554     0.00     0.00  Sampler::nodes() const
  0.00   1494.95     0.02   103570     0.00     0.00  GraphMarks::mark(Node const*, int)
  0.00   1494.97     0.02    53247     0.00     0.00  Distribution::upperBound(std::vector<SArray const*, std::allocator<SArray const*> > const&) const
  0.00   1494.99     0.02    42979     0.00     0.00  Node::addParent(Node*)
  0.00   1495.01     0.02    24546     0.00     0.00  Compiler::VariableSubsetRange(ParseTree const*)
  0.00   1495.03     0.02    14353     0.00     0.00  Node::~Node()
  0.00   1495.05     0.02    12273     0.00     0.00  NodeArray::set(Node*, Range const&)
  0.00   1495.07     0.02     7007     0.00     0.00  asReal(Distribution const*)
  0.00   1495.09     0.02     7000     0.00     0.00  DistReal::lowerLimit(std::vector<SArray const*, std::allocator<SArray const*> > const&) const
  0.00   1495.11     0.02     6154     0.00     0.00  std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::find(std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const&)
  0.00   1495.13     0.02     6139     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const
  0.00   1495.15     0.02     6134     0.00     0.00  Compiler::allocateLogical(ParseTree const*)
  0.00   1495.17     0.02     1938     0.00     0.00  Sampler::classifyChildren(std::set<StochasticNode const*, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> > const&, std::vector<StochasticNode*, std::allocator<StochasticNode*> >&, std::vector<DeterministicNode*, std::allocator<DeterministicNode*> >&)
  0.00   1495.19     0.02        2     0.00     0.00  std::_Rb_tree<SArray const*, SArray const*, std::_Identity<SArray const*>, std::less<SArray const*>, std::allocator<SArray const*> >::_M_erase(std::_Rb_tree_node<SArray const*>*)
  0.00   1495.21     0.02        1     0.00     0.00  Graph::isClosed()
  0.00   1495.22     0.01   321087     0.00     0.00  Range::upper() const
  0.00   1495.23     0.01   221640     0.00     0.00  std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::_M_create_node(Node* const&)
  0.00   1495.24     0.01   173821     0.00     0.00  Range::ndim(bool) const
  0.00   1495.25     0.01   135682     0.00     0.00  Node::ref()
  0.00   1495.26     0.01   130196     0.00     0.00  std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<Node const* const, int> const&)
  0.00   1495.27     0.01   103570     0.00     0.00  std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::insert_unique(std::_Rb_tree_iterator<std::pair<Node const* const, int>, std::pair<Node const* const, int>&, std::pair<Node const* const, int>*>, std::pair<Node const* const, int> const&)
  0.00   1495.28     0.01    83857     0.00     0.00  LeftRangeIterator::atEnd() const
  0.00   1495.29     0.01    74607     0.00     0.00  isStochastic(Node const*)
  0.00   1495.30     0.01    73616     0.00     0.00  Index::operator=(Index const&)
  0.00   1495.31     0.01    57266     0.00     0.00  leftIncrement(Index&, Index const&, Index const&, int)
  0.00   1495.32     0.01    57266     0.00     0.00  LeftRangeIterator::operator++()
  0.00   1495.33     0.01    51137     0.00     0.00  LeftRangeIterator::LeftRangeIterator(Range const&)
  0.00   1495.34     0.01    51137     0.00     0.00  Index::Index(Index const&)
  0.00   1495.35     0.01    42011     0.00     0.00  Graph::remove(Node*)
  0.00   1495.36     0.01    40899     0.00     0.00  NodeArray::get(Range const&) const
  0.00   1495.37     0.01    40509     0.00     0.00  std::vector<Node*, std::allocator<Node*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<Node**, std::vector<Node*, std::allocator<Node*> > >, Node* const&)
  0.00   1495.38     0.01    32760     0.00     0.00  std::basic_stringbuf<char, std::char_traits<char>, std::allocator<char> >::str() const
  0.00   1495.39     0.01    26670     0.00     0.00  Range::length() const
  0.00   1495.40     0.01    26634     0.00     0.00  SArray::SArray(Index const&)
  0.00   1495.41     0.01    26546     0.00     0.00  std::_Rb_tree_base_iterator::_M_decrement()
  0.00   1495.42     0.01    24312     0.00     0.00  classifyNode(Node*, Graph&, Graph&)
  0.00   1495.43     0.01    22494     0.00     0.00  Compiler::VarGetParameter(ParseTree const*)
  0.00   1495.44     0.01    20440     0.00     0.00  SubSetIndex::node() const
  0.00   1495.45     0.01    18304     0.00     0.00  Node::initialize()
  0.00   1495.46     0.01    12288     0.00     0.00  Compiler::getLogicalParameterVector(ParseTree const*, std::vector<Node*, std::allocator<Node*> >&)
  0.00   1495.47     0.01    12273     0.00     0.00  Compiler::VarGetNode(ParseTree const*)
  0.00   1495.48     0.01    12273     0.00     0.00  std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::lower_bound(Range const&)
  0.00   1495.49     0.01    12264     0.00     0.00  __gnu_cxx::__normal_iterator<std::pair<long, Node*>*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > > std::__uninitialized_copy_aux<__gnu_cxx::__normal_iterator<std::pair<long, Node*>*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > >, __gnu_cxx::__normal_iterator<std::pair<long, Node*>*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > > >(__gnu_cxx::__normal_iterator<std::pair<long, Node*>*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > >, __gnu_cxx::__normal_iterator<std::pair<long, Node*>*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > >, __gnu_cxx::__normal_iterator<std::pair<long, Node*>*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > >, __false_type)
  0.00   1495.50     0.01    10589     0.00     0.00  SArray::setFixed(bool)
  0.00   1495.51     0.01    10240     0.00     0.00  ParseTree::getOperator() const
  0.00   1495.52     0.01    10222     0.00     0.00  std::_Rb_tree<SArray const*, SArray const*, std::_Identity<SArray const*>, std::less<SArray const*>, std::allocator<SArray const*> >::insert_unique(SArray const* const&)
  0.00   1495.53     0.01    10222     0.00     0.00  std::_Rb_tree<SArray const*, SArray const*, std::_Identity<SArray const*>, std::less<SArray const*>, std::allocator<SArray const*> >::_M_create_node(SArray const* const&)
  0.00   1495.54     0.01     6181     0.00     0.00  Function::name() const
  0.00   1495.55     0.01     6153     0.00     0.00  makeName(Function const*, std::vector<Node*, std::allocator<Node*> > const&)
  0.00   1495.56     0.01     6153     0.00     0.00  std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::lower_bound(std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const&)
  0.00   1495.57     0.01     6139     0.00     0.00  Compiler::setStochasticParameters(ParseTree const*)
  0.00   1495.58     0.01     6139     0.00     0.00  Distribution::checkParameterLength(std::vector<SArray const*, std::allocator<SArray const*> > const&) const
  0.00   1495.59     0.01     6139     0.00     0.00  DistTab::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const
  0.00   1495.60     0.01     6132     0.00     0.00  std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::pair<long, Node*>*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > >, std::pair<long, Node*> const&)
  0.00   1495.61     0.01     6006     0.00     0.00  Divide::checkParameterValue(std::vector<SArray const*, std::allocator<SArray const*> > const&) const
  0.00   1495.62     0.01     4112     0.00     0.00  setConstantNameToValue(ConstantNode*)
  0.00   1495.63     0.01     2044     0.00     0.00  SubSetIndex::checkLimits(std::vector<SubSetIndex, std::allocator<SubSetIndex> > const&, std::vector<SubSetIndex, std::allocator<SubSetIndex> > const&)
  0.00   1495.64     0.01     2044     0.00     0.00  Compiler::getMixtureNode(ParseTree const*)
  0.00   1495.65     0.01     1941     0.00     0.00  GraphMarks::GraphMarks(Graph const&)
  0.00   1495.66     0.01        2     0.00     0.00  ConjugateNormal::canSample(StochasticNode const*)
  0.00   1495.67     0.01        2     0.00     0.00  Compiler::traverseTree(ParseTree const*, void (Compiler::*)(ParseTree const*), void (Compiler::*)(ParseTree const*))
  0.00   1495.68     0.01        1     0.00     0.00  init_tables()
  0.00   1495.69     0.01        1     0.00     0.00  std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::_M_erase(std::_Rb_tree_node<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >*)
  0.00   1495.70     0.01                             std::basic_stringbuf<char, std::char_traits<char>, std::allocator<char> >::overflow(int)
  0.00   1495.70     0.00   302808     0.00     0.00  ParseTree::treeClass() const
  0.00   1495.70     0.00   236427     0.00     0.00  Node::parents() const
  0.00   1495.70     0.00   232325     0.00     0.00  Node::children() const
  0.00   1495.70     0.00   147955     0.00     0.00  Graph::add(Node*)
  0.00   1495.70     0.00    94079     0.00     0.00  NodeArray::range() const
  0.00   1495.70     0.00    87950     0.00     0.00  SymTab::getVariable(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const
  0.00   1495.70     0.00    71577     0.00     0.00  Range::contains(Range const&) const
  0.00   1495.70     0.00    57063     0.00     0.00  asStochastic(Node*)
  0.00   1495.70     0.00    54519     0.00     0.00  isDeterministic(Node const*)
  0.00   1495.70     0.00    51137     0.00     0.00  Index::~Index()
  0.00   1495.70     0.00    50817     0.00     0.00  std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::erase(Node* const&)
  0.00   1495.70     0.00    50817     0.00     0.00  std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::erase(std::_Rb_tree_iterator<Node*, Node*&, Node**>, std::_Rb_tree_iterator<Node*, Node*&, Node**>)
  0.00   1495.70     0.00    50295     0.00     0.00  asDeterministic(Node*)
  0.00   1495.70     0.00    42964     0.00     0.00  Compiler::indexExpression(ParseTree const*, long&)
  0.00   1495.70     0.00    42964     0.00     0.00  Compiler::constantExpression(ParseTree const*, double&)
  0.00   1495.70     0.00    36861     0.00     0.00  Node::name() const
  0.00   1495.70     0.00    36832     0.00     0.00  asInteger(double)
  0.00   1495.70     0.00    36808     0.00     0.00  Counter::value() const
  0.00   1495.70     0.00    33891     0.00     0.00  std::_Rb_tree_rotate_right(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&)
  0.00   1495.70     0.00    32760     0.00     0.00  std::basic_string<char, std::char_traits<char>, std::allocator<char> >::basic_string<char*>(char*, char*, std::allocator<char> const&)
  0.00   1495.70     0.00    32760     0.00     0.00  std::basic_stringbuf<char, std::char_traits<char>, std::allocator<char> >::_M_really_sync(unsigned int, unsigned int)
  0.00   1495.70     0.00    32755     0.00     0.00  Index::operator==(Index const&) const
  0.00   1495.70     0.00    28626     0.00     0.00  NodeArray::getSubset(Range const&)
  0.00   1495.70     0.00    24544     0.00     0.00  SArray::dim(bool) const
  0.00   1495.70     0.00    24298     0.00     0.00  std::_Rb_tree<StochasticNode const*, StochasticNode const*, std::_Identity<StochasticNode const*>, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> >::find(StochasticNode const* const&) const
  0.00   1495.70     0.00    22538     0.00     0.00  Node::setName(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
  0.00   1495.70     0.00    22508     0.00     0.00  Compiler::Param(ParseTree const*)
  0.00   1495.70     0.00    20456     0.00     0.00  Index::operator!=(Index const&) const
  0.00   1495.70     0.00    18440     0.00     0.00  Function::checkParameterLength(std::vector<SArray const*, std::allocator<SArray const*> > const&) const
  0.00   1495.70     0.00    16375     0.00     0.00  DeterministicNode::initialize()
  0.00   1495.70     0.00    16375     0.00     0.00  DeterministicNode::DeterministicNode(Index const&)
  0.00   1495.70     0.00    16352     0.00     0.00  __gnu_cxx::__normal_iterator<SubSetIndex*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > > std::__uninitialized_copy_aux<__gnu_cxx::__normal_iterator<SubSetIndex*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, __gnu_cxx::__normal_iterator<SubSetIndex*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > > >(__gnu_cxx::__normal_iterator<SubSetIndex*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, __gnu_cxx::__normal_iterator<SubSetIndex*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, __gnu_cxx::__normal_iterator<SubSetIndex*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, __false_type)
  0.00   1495.70     0.00    14377     0.00     0.00  SArray::~SArray()
  0.00   1495.70     0.00    14353     0.00     0.00  Node::unlink()
  0.00   1495.70     0.00    14308     0.00     0.00  Compiler::getSubSetNode(ParseTree const*)
  0.00   1495.70     0.00    12337     0.00     0.00  zzlex()
  0.00   1495.70     0.00    12312     0.00     0.00  SArray::range() const
  0.00   1495.70     0.00    12287     0.00     0.00  LogicalNode::initialize()
  0.00   1495.70     0.00    12287     0.00     0.00  LogicalNode::setParameters(std::vector<Node*, std::allocator<Node*> > const&)
  0.00   1495.70     0.00    12287     0.00     0.00  LogicalNode::LogicalNode(Function const*, Index const&)
  0.00   1495.70     0.00    12287     0.00     0.00  ScalarFunc::checkDim(SArray const&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const
  0.00   1495.70     0.00    12280     0.00     0.00  Range::operator==(Range const&) const
  0.00   1495.70     0.00    12273     0.00     0.00  NodeArray::name() const
  0.00   1495.70     0.00    12273     0.00     0.00  std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<Range const, Node*>, std::pair<Range const, Node*>&, std::pair<Range const, Node*>*>, std::pair<Range const, Node*> const&)
  0.00   1495.70     0.00    12273     0.00     0.00  std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::_M_create_node(std::pair<Range const, Node*> const&)
  0.00   1495.70     0.00    12273     0.00     0.00  std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<Range const, Node*> const&)
  0.00   1495.70     0.00    10270     0.00     0.00  ParseTree::value() const
  0.00   1495.70     0.00    10259     0.00     0.00  std::allocator<Node*>::~allocator()
  0.00   1495.70     0.00    10244     0.00     0.00  getFunction(ParseTree const*, FuncTab const&)
  0.00   1495.70     0.00    10244     0.00     0.00  FuncTab::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const
  0.00   1495.70     0.00    10222     0.00     0.00  std::_Rb_tree<SArray const*, SArray const*, std::_Identity<SArray const*>, std::less<SArray const*>, std::allocator<SArray const*> >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, SArray const* const&)
  0.00   1495.70     0.00     8176     0.00     0.00  std::vector<SubSetIndex, std::allocator<SubSetIndex> >::_M_insert_aux(__gnu_cxx::__normal_iterator<SubSetIndex*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, SubSetIndex const&)
  0.00   1495.70     0.00     8176     0.00     0.00  std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::lower_bound(long const&)
  0.00   1495.70     0.00     8176     0.00     0.00  std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<long const, Node*>, std::pair<long const, Node*>&, std::pair<long const, Node*>*>, std::pair<long const, Node*> const&)
  0.00   1495.70     0.00     8176     0.00     0.00  std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::_M_create_node(std::pair<long const, Node*> const&)
  0.00   1495.70     0.00     8176     0.00     0.00  std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<long const, Node*> const&)
  0.00   1495.70     0.00     7832     0.00     0.00  std::vector<DeterministicNode*, std::allocator<DeterministicNode*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<DeterministicNode**, std::vector<DeterministicNode*, std::allocator<DeterministicNode*> > >, DeterministicNode* const&)
  0.00   1495.70     0.00     7000     0.00     0.00  lowerDefault(Support)
  0.00   1495.70     0.00     7000     0.00     0.00  upperDefault(Support)
  0.00   1495.70     0.00     7000     0.00     0.00  DistReal::upperLimit(std::vector<SArray const*, std::allocator<SArray const*> > const&) const
  0.00   1495.70     0.00     6330     0.00     0.00  ParseTree::ParseTree(TreeClass)
  0.00   1495.70     0.00     6169     0.00     0.00  ParseTree::setValue(double)
  0.00   1495.70     0.00     6153     0.00     0.00  LogicalNode::~LogicalNode()
  0.00   1495.70     0.00     6153     0.00     0.00  ScalarFunc::dim(std::vector<SArray const*, std::allocator<SArray const*> > const&) const
  0.00   1495.70     0.00     6153     0.00     0.00  std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>::~pair()
  0.00   1495.70     0.00     6153     0.00     0.00  std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>&, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>*>, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> const&)
  0.00   1495.70     0.00     6153     0.00     0.00  std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::_M_create_node(std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> const&)
  0.00   1495.70     0.00     6153     0.00     0.00  std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> const&)
  0.00   1495.70     0.00     6153     0.00     0.00  SArray const** std::fill_n<SArray const**, unsigned int, SArray const*>(SArray const**, unsigned int, SArray const* const&)
  0.00   1495.70     0.00     6140     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const
  0.00   1495.70     0.00     6139     0.00     0.00  getDistribution(ParseTree const*, DistTab const&)
  0.00   1495.70     0.00     6139     0.00     0.00  StochasticNode::setParameters(std::vector<Node*, std::allocator<Node*> > const&)
  0.00   1495.70     0.00     6139     0.00     0.00  StochasticNode::StochasticNode(Distribution const*, Index const&)
  0.00   1495.70     0.00     6134     0.00     0.00  asLogical(Node*)
  0.00   1495.70     0.00     6134     0.00     0.00  Compiler::setLogicalParameters(ParseTree const*)
  0.00   1495.70     0.00     6132     0.00     0.00  DBern::checkParameterDim(SArray const&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const
  0.00   1495.70     0.00     6006     0.00     0.00  Divide::evaluate(std::vector<SArray const*, std::allocator<SArray const*> > const&) const
  0.00   1495.70     0.00     4112     0.00     0.00  ConstantNode::ConstantNode(double)
  0.00   1495.70     0.00     4112     0.00     0.00  ConstantNode::~ConstantNode()
  0.00   1495.70     0.00     4108     0.00     0.00  Counter::atEnd() const
  0.00   1495.70     0.00     4106     0.00     0.00  std::__simple_alloc<Node*, std::__default_alloc_template<true, 0> >::allocate(unsigned int)
  0.00   1495.70     0.00     4106     0.00     0.00  std::vector<Node*, std::allocator<Node*> >::~vector()
  0.00   1495.70     0.00     4100     0.00     0.00  Counter::increment()
  0.00   1495.70     0.00     4088     0.00     0.00  SubSetIndex::SubSetIndex(Node*)
  0.00   1495.70     0.00     4088     0.00     0.00  SubSetIndex::SubSetIndex()
  0.00   1495.70     0.00     4088     0.00     0.00  Compiler::makeSubsetIndex(ParseTree const*, std::vector<SubSetIndex, std::allocator<SubSetIndex> >&, Index const&)
  0.00   1495.70     0.00     4004     0.00     0.00  Exp::evaluate(std::vector<SArray const*, std::allocator<SArray const*> > const&) const
  0.00   1495.70     0.00     3967     0.00     0.00  std::vector<StochasticNode*, std::allocator<StochasticNode*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<StochasticNode**, std::vector<StochasticNode*, std::allocator<StochasticNode*> > >, StochasticNode* const&)
  0.00   1495.70     0.00     3891     0.00     0.00  Graph::Graph()
  0.00   1495.70     0.00     3879     0.00     0.00  Graph::~Graph()
  0.00   1495.70     0.00     2044     0.00     0.00  getLink(ParseTree const*, FuncTab const&)
  0.00   1495.70     0.00     2044     0.00     0.00  OffsetNode::OffsetNode(Range const&, std::vector<SubSetIndex, std::allocator<SubSetIndex> > const&)
  0.00   1495.70     0.00     2044     0.00     0.00  OffsetNode::~OffsetNode()
  0.00   1495.70     0.00     2044     0.00     0.00  MixtureNode::MixtureNode(Node*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > const&)
  0.00   1495.70     0.00     2044     0.00     0.00  MixtureNode::~MixtureNode()
  0.00   1495.70     0.00     2044     0.00     0.00  FuncTab::findInverse(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const
  0.00   1495.70     0.00     2044     0.00     0.00  std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::insert_unique(std::pair<long const, Node*> const&)
  0.00   1495.70     0.00     2044     0.00     0.00  std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::_M_erase(std::_Rb_tree_node<std::pair<long const, Node*> >*)
  0.00   1495.70     0.00     2044     0.00     0.00  SubSetIndex* std::__uninitialized_copy_aux<__gnu_cxx::__normal_iterator<SubSetIndex const*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, SubSetIndex*>(__gnu_cxx::__normal_iterator<SubSetIndex const*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, __gnu_cxx::__normal_iterator<SubSetIndex const*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, SubSetIndex*, __false_type)
  0.00   1495.70     0.00     1963     0.00     0.00  Distribution::name() const
  0.00   1495.70     0.00     1951     0.00     0.00  Graph::getNodes(std::vector<Node*, std::allocator<Node*> >&) const
  0.00   1495.70     0.00     1941     0.00     0.00  GraphMarks::~GraphMarks()
  0.00   1495.70     0.00     1941     0.00     0.00  Graph::nodes() const
  0.00   1495.70     0.00     1938     0.00     0.00  std::_Rb_tree<StochasticNode const*, StochasticNode const*, std::_Identity<StochasticNode const*>, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> >::insert_unique(StochasticNode const* const&)
  0.00   1495.70     0.00     1938     0.00     0.00  std::_Rb_tree<StochasticNode const*, StochasticNode const*, std::_Identity<StochasticNode const*>, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> >::_M_create_node(StochasticNode const* const&)
  0.00   1495.70     0.00     1938     0.00     0.00  std::_Rb_tree<StochasticNode const*, StochasticNode const*, std::_Identity<StochasticNode const*>, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> >::_M_erase(std::_Rb_tree_node<StochasticNode const*>*)
  0.00   1495.70     0.00     1938     0.00     0.00  std::_Rb_tree<StochasticNode const*, StochasticNode const*, std::_Identity<StochasticNode const*>, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, StochasticNode const* const&)
  0.00   1495.70     0.00     1936     0.00     0.00  GibbsSampler::GibbsSampler(StochasticNode*)
  0.00   1495.70     0.00     1936     0.00     0.00  FiniteSampler::canSample(StochasticNode const*)
  0.00   1495.70     0.00     1936     0.00     0.00  Sampler::Sampler(std::vector<StochasticNode*, std::allocator<StochasticNode*> > const&)
  0.00   1495.70     0.00     1936     0.00     0.00  Sampler::~Sampler()
  0.00   1495.70     0.00     1936     0.00     0.00  FiniteFactory::canSample(StochasticNode const*) const
  0.00   1495.70     0.00     1936     0.00     0.00  ConjugateFactory::canSample(StochasticNode const*) const
  0.00   1495.70     0.00     1936     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const
  0.00   1495.70     0.00     1936     0.00     0.00  std::_Rb_tree<StochasticNode*, StochasticNode*, std::_Identity<StochasticNode*>, std::less<StochasticNode*>, std::allocator<StochasticNode*> >::insert_unique(StochasticNode* const&)
  0.00   1495.70     0.00     1936     0.00     0.00  std::_Rb_tree<StochasticNode*, StochasticNode*, std::_Identity<StochasticNode*>, std::less<StochasticNode*>, std::allocator<StochasticNode*> >::_M_create_node(StochasticNode* const&)
  0.00   1495.70     0.00     1936     0.00     0.00  std::_Rb_tree<StochasticNode*, StochasticNode*, std::_Identity<StochasticNode*>, std::less<StochasticNode*>, std::allocator<StochasticNode*> >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, StochasticNode* const&)
  0.00   1495.70     0.00     1936     0.00     0.00  StochasticNode** std::fill_n<StochasticNode**, unsigned int, StochasticNode*>(StochasticNode**, unsigned int, StochasticNode* const&)
  0.00   1495.70     0.00     1935     0.00     0.00  void std::__unguarded_linear_insert<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, Sampler*, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, Sampler*, less_sampler)
  0.00   1495.70     0.00     1929     0.00     0.00  FiniteSampler::FiniteSampler(StochasticNode*)
  0.00   1495.70     0.00     1929     0.00     0.00  FiniteSampler::~FiniteSampler()
  0.00   1495.70     0.00     1929     0.00     0.00  StochasticNode::forwardSample()
  0.00   1495.70     0.00     1929     0.00     0.00  DistFinite::randomSample(SArray&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const
  0.00   1495.70     0.00     1929     0.00     0.00  FiniteFactory::makeGibbsSampler(StochasticNode*) const
  0.00   1495.70     0.00     1929     0.00     0.00  DBern::randomSample(std::vector<SArray const*, std::allocator<SArray const*> > const&) const
  0.00   1495.70     0.00     1001     0.00     0.00  UnaryMinus::evaluate(std::vector<SArray const*, std::allocator<SArray const*> > const&) const
  0.00   1495.70     0.00      286     0.00     0.00  yylex()
  0.00   1495.70     0.00      141     0.00     0.00  std::vector<ParseTree*, std::allocator<ParseTree*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<ParseTree**, std::vector<ParseTree*, std::allocator<ParseTree*> > >, ParseTree* const&)
  0.00   1495.70     0.00      116     0.00     0.00  ParseTree::setParameters(std::vector<ParseTree*, std::allocator<ParseTree*> > const&)
  0.00   1495.70     0.00      116     0.00     0.00  ParseTree** std::vector<ParseTree*, std::allocator<ParseTree*> >::_M_allocate_and_copy<__gnu_cxx::__normal_iterator<ParseTree* const*, std::vector<ParseTree*, std::allocator<ParseTree*> > > >(unsigned int, __gnu_cxx::__normal_iterator<ParseTree* const*, std::vector<ParseTree*, std::allocator<ParseTree*> > >, __gnu_cxx::__normal_iterator<ParseTree* const*, std::vector<ParseTree*, std::allocator<ParseTree*> > >)
  0.00   1495.70     0.00      116     0.00     0.00  std::vector<ParseTree*, std::allocator<ParseTree*> >::operator=(std::vector<ParseTree*, std::allocator<ParseTree*> > const&)
  0.00   1495.70     0.00       89     0.00     0.00  ParseTree::setName(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
  0.00   1495.70     0.00       81     0.00     0.00  setName(ParseTree*, std::basic_string<char, std::char_traits<char>, std::allocator<char> >*)
  0.00   1495.70     0.00       77     0.00     0.00  ParseTree** std::fill_n<ParseTree**, unsigned int, ParseTree*>(ParseTree**, unsigned int, ParseTree* const&)
  0.00   1495.70     0.00       49     0.00     0.00  setParameters(ParseTree*, std::vector<ParseTree*, std::allocator<ParseTree*> >*)
  0.00   1495.70     0.00       32     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::lower_bound(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
  0.00   1495.70     0.00       32     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> const&)
  0.00   1495.70     0.00       32     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::_M_create_node(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> const&)
  0.00   1495.70     0.00       32     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
  0.00   1495.70     0.00       32     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> const&)
  0.00   1495.70     0.00       28     0.00     0.00  setParameters(ParseTree*, ParseTree*, ParseTree*)
  0.00   1495.70     0.00       28     0.00     0.00  Function::Function(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int)
  0.00   1495.70     0.00       28     0.00     0.00  Function::~Function()
  0.00   1495.70     0.00       25     0.00     0.00  ParseTree::setOperator(Operator)
  0.00   1495.70     0.00       24     0.00     0.00  ScalarFunc::ScalarFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int)
  0.00   1495.70     0.00       24     0.00     0.00  FuncTab::insert(Function const*)
  0.00   1495.70     0.00       23     0.00     0.00  Distribution::Distribution(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int)
  0.00   1495.70     0.00       23     0.00     0.00  Distribution::~Distribution()
  0.00   1495.70     0.00       23     0.00     0.00  DistTab::insert(Distribution const*)
  0.00   1495.70     0.00       23     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::lower_bound(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
  0.00   1495.70     0.00       23     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> const&)
  0.00   1495.70     0.00       23     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::_M_create_node(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> const&)
  0.00   1495.70     0.00       23     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
  0.00   1495.70     0.00       23     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> const&)
  0.00   1495.70     0.00       22     0.00     0.00  setParameters(ParseTree*, ParseTree*)
  0.00   1495.70     0.00       21     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::lower_bound(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
  0.00   1495.70     0.00       21     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> const&)
  0.00   1495.70     0.00       21     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::_M_create_node(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> const&)
  0.00   1495.70     0.00       21     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> const&)
  0.00   1495.70     0.00       20     0.00     0.00  Sampler* const& std::__median<Sampler*, less_sampler>(Sampler* const&, Sampler* const&, Sampler* const&, less_sampler)
  0.00   1495.70     0.00       16     0.00     0.00  SArray::SArray(SArray const&)
  0.00   1495.70     0.00       12     0.00     0.00  SymTab::addVariable(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, Index const&)
  0.00   1495.70     0.00       12     0.00     0.00  DistReal::DistReal(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int, Support, int, int)
  0.00   1495.70     0.00       12     0.00     0.00  NodeArray::setName(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
  0.00   1495.70     0.00       12     0.00     0.00  NodeArray::NodeArray(Index const&)
  0.00   1495.70     0.00       12     0.00     0.00  NodeArray::graph() const
  0.00   1495.70     0.00       12     0.00     0.00  std::vector<Sampler*, std::allocator<Sampler*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, Sampler* const&)
  0.00   1495.70     0.00       12     0.00     0.00  std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::insert_unique(std::pair<Range const, Node*> const&)
  0.00   1495.70     0.00       12     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::lower_bound(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
  0.00   1495.70     0.00       12     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> const&)
  0.00   1495.70     0.00       12     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::_M_create_node(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> const&)
  0.00   1495.70     0.00       12     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
  0.00   1495.70     0.00       12     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> const&)
  0.00   1495.70     0.00       11     0.00     0.00  setParameters(ParseTree*, ParseTree*)
  0.00   1495.70     0.00        9     0.00     0.00  yy_get_next_buffer()
  0.00   1495.70     0.00        9     0.00     0.00  zz_load_buffer_state()
  0.00   1495.70     0.00        8     0.00     0.00  setName(ParseTree*, std::basic_string<char, std::char_traits<char>, std::allocator<char> >*)
  0.00   1495.70     0.00        8     0.00     0.00  CounterTab::popCounter()
  0.00   1495.70     0.00        8     0.00     0.00  CounterTab::pushCounter(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, Range const&)
  0.00   1495.70     0.00        8     0.00     0.00  Counter::reset()
  0.00   1495.70     0.00        8     0.00     0.00  Counter::Counter(long, long)
  0.00   1495.70     0.00        8     0.00     0.00  Compiler::CounterRange(ParseTree const*)
  0.00   1495.70     0.00        8     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::lower_bound(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
  0.00   1495.70     0.00        8     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> const&)
  0.00   1495.70     0.00        8     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::_M_create_node(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> const&)
  0.00   1495.70     0.00        8     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> const&)
  0.00   1495.70     0.00        8     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> const&)
  0.00   1495.70     0.00        8     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::_M_create_node(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> const&)
  0.00   1495.70     0.00        8     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
  0.00   1495.70     0.00        8     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> const&)
  0.00   1495.70     0.00        7     0.00     0.00  yy_get_previous_state()
  0.00   1495.70     0.00        7     0.00     0.00  SliceSampler::canSample(StochasticNode const*)
  0.00   1495.70     0.00        7     0.00     0.00  SliceSampler::SliceSampler(StochasticNode*, double, long)
  0.00   1495.70     0.00        7     0.00     0.00  SliceSampler::~SliceSampler()
  0.00   1495.70     0.00        7     0.00     0.00  NodeArray::setValue(SArray const&, bool)
  0.00   1495.70     0.00        7     0.00     0.00  SliceFactory::makeGibbsSampler(StochasticNode*) const
  0.00   1495.70     0.00        7     0.00     0.00  SliceFactory::canSample(StochasticNode const*) const
  0.00   1495.70     0.00        7     0.00     0.00  DistReal::checkParameterDim(SArray const&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const
  0.00   1495.70     0.00        6     0.00     0.00  yy_flex_alloc(unsigned int)
  0.00   1495.70     0.00        6     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::lower_bound(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
  0.00   1495.70     0.00        6     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> const&)
  0.00   1495.70     0.00        6     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::_M_create_node(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> const&)
  0.00   1495.70     0.00        6     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> const&)
  0.00   1495.70     0.00        5     0.00     0.00  setParameters(ParseTree*, std::vector<ParseTree*, std::allocator<ParseTree*> >*)
  0.00   1495.70     0.00        5     0.00     0.00  zz_init_buffer(yy_buffer_state*, _IO_FILE*)
  0.00   1495.70     0.00        5     0.00     0.00  zz_flush_buffer(yy_buffer_state*)
  0.00   1495.70     0.00        5     0.00     0.00  DistFinite::DistFinite(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int)
  0.00   1495.70     0.00        4     0.00     0.00  yy_flex_free(void*)
  0.00   1495.70     0.00        4     0.00     0.00  zz_switch_to_buffer(yy_buffer_state*)
  0.00   1495.70     0.00        4     0.00     0.00  getDist(StochasticNode const*)
  0.00   1495.70     0.00        4     0.00     0.00  InverseLinkFunc::InverseLinkFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
  0.00   1495.70     0.00        4     0.00     0.00  FuncTab::insert(InverseLinkFunc const*)
  0.00   1495.70     0.00        4     0.00     0.00  InverseLinkFunc::linkName() const
  0.00   1495.70     0.00        4     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
  0.00   1495.70     0.00        4     0.00     0.00  __gnu_cxx::__normal_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>*, std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > > > std::__uninitialized_copy_aux<__gnu_cxx::__normal_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>*, std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > > >, __gnu_cxx::__normal_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>*, std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > > > >(__gnu_cxx::__normal_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>*, std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > > >, __gnu_cxx::__normal_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>*, std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > > >, __gnu_cxx::__normal_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>*, std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > > >, __false_type)
  0.00   1495.70     0.00        3     0.00     0.00  zz_create_buffer(_IO_FILE*, int)
  0.00   1495.70     0.00        3     0.00     0.00  yy_get_next_buffer()
  0.00   1495.70     0.00        3     0.00     0.00  yy_load_buffer_state()
  0.00   1495.70     0.00        3     0.00     0.00  Model::graph()
  0.00   1495.70     0.00        3     0.00     0.00  GibbsFactory::makeSampler(std::set<StochasticNode*, std::less<StochasticNode*>, std::allocator<StochasticNode*> >&, std::vector<Sampler*, std::allocator<Sampler*> >&) const
  0.00   1495.70     0.00        3     0.00     0.00  Graph::size() const
  0.00   1495.70     0.00        3     0.00     0.00  std::vector<SamplerFactory const*, std::allocator<SamplerFactory const*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<SamplerFactory const**, std::vector<SamplerFactory const*, std::allocator<SamplerFactory const*> > >, SamplerFactory const* const&)
  0.00   1495.70     0.00        2     0.00     0.00  yy_flex_alloc(unsigned int)
  0.00   1495.70     0.00        2     0.00     0.00  yy_init_buffer(yy_buffer_state*, _IO_FILE*)
  0.00   1495.70     0.00        2     0.00     0.00  yy_flush_buffer(yy_buffer_state*)
  0.00   1495.70     0.00        2     0.00     0.00  open_data_buffer(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const*)
  0.00   1495.70     0.00        2     0.00     0.00  zz_delete_buffer(yy_buffer_state*)
  0.00   1495.70     0.00        2     0.00     0.00  return_to_main_buffer()
  0.00   1495.70     0.00        2     0.00     0.00  yy_get_previous_state()
  0.00   1495.70     0.00        2     0.00     0.00  readRData(std::vector<ParseTree*, std::allocator<ParseTree*> > const*, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >&)
  0.00   1495.70     0.00        2     0.00     0.00  zzrestart(_IO_FILE*)
  0.00   1495.70     0.00        2     0.00     0.00  DistDiscrete::DistDiscrete(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int)
  0.00   1495.70     0.00        2     0.00     0.00  GibbsSampler::classifyChildren(StochasticNode const*, std::vector<StochasticNode*, std::allocator<StochasticNode*> >&, std::vector<DeterministicNode*, std::allocator<DeterministicNode*> >&)
  0.00   1495.70     0.00        2     0.00     0.00  std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>*, std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > > >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> const&)
  0.00   1495.70     0.00        2     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> const&)
  0.00   1495.70     0.00        2     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >*)
  0.00   1495.70     0.00        2     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >*)
  0.00   1495.70     0.00        2     0.00     0.00  zzwrap
  0.00   1495.70     0.00        1     0.00     0.00  global constructors keyed to JAGS_NA
  0.00   1495.70     0.00        1     0.00     0.00  global constructors keyed to _Z7getDistPK14StochasticNode
  0.00   1495.70     0.00        1     0.00     0.00  global constructors keyed to _Z9MatrixExpPdPKdid
  0.00   1495.70     0.00        1     0.00     0.00  global constructors keyed to _Z9readRDataPKSt6vectorIP9ParseTreeSaIS1_EERSt3mapISs6SArraySt4lessISsESaISt4pairIKSsS7_EEE
  0.00   1495.70     0.00        1     0.00     0.00  global constructors keyed to _ZN11LogicalNodeC2EPK8FunctionRK5Index
  0.00   1495.70     0.00        1     0.00     0.00  global constructors keyed to _ZN11MixtureNodeC2EP4NodeRKSt6vectorISt4pairIlS1_ESaIS4_EE
  0.00   1495.70     0.00        1     0.00     0.00  global constructors keyed to _ZN11SubSetIndexC2Ev
  0.00   1495.70     0.00        1     0.00     0.00  global constructors keyed to _ZN12TraceMonitorC2EP4Nodelli
  0.00   1495.70     0.00        1     0.00     0.00  global constructors keyed to _ZN18ConjugateDirichletC2EP14StochasticNode
  0.00   1495.70     0.00        1     0.00     0.00  global constructors keyed to _ZN5ModelC2Ev
  0.00   1495.70     0.00        1     0.00     0.00  global constructors keyed to _ZN6SymTabC2Ev
  0.00   1495.70     0.00        1     0.00     0.00  global constructors keyed to _ZN7ConsoleC2ERSoS0_
  0.00   1495.70     0.00        1     0.00     0.00  global constructors keyed to _ZN7DMStateC2Ev
  0.00   1495.70     0.00        1     0.00     0.00  global constructors keyed to _ZN7SamplerC2ERKSt6vectorIP14StochasticNodeSaIS2_EE
  0.00   1495.70     0.00        1     0.00     0.00  global constructors keyed to _ZN8Compiler18constantExpressionEPK9ParseTreeRd
  0.00   1495.70     0.00        1     0.00     0.00  global constructors keyed to _ZN9NodeArrayC2ERK5Index
  0.00   1495.70     0.00        1     0.00     0.00  global constructors keyed to _data_table
  0.00   1495.70     0.00        1     0.00     0.00  global constructors keyed to yydebug
  0.00   1495.70     0.00        1     0.00     0.00  global constructors keyed to zzleng
  0.00   1495.70     0.00        1     0.00     0.00  parse_bugs(_IO_FILE*, std::vector<ParseTree*, std::allocator<ParseTree*> >**, ParseTree**)
  0.00   1495.70     0.00        1     0.00     0.00  setParameters(ParseTree*, ParseTree*, ParseTree*)
  0.00   1495.70     0.00        1     0.00     0.00  yy_create_buffer(_IO_FILE*, int)
  0.00   1495.70     0.00        1     0.00     0.00  __static_initialization_and_destruction_0(int, int)
  0.00   1495.70     0.00        1     0.00     0.00  __static_initialization_and_destruction_0(int, int)
  0.00   1495.70     0.00        1     0.00     0.00  __static_initialization_and_destruction_0(int, int)
  0.00   1495.70     0.00        1     0.00     0.00  __static_initialization_and_destruction_0(int, int)
  0.00   1495.70     0.00        1     0.00     0.00  __static_initialization_and_destruction_0(int, int)
  0.00   1495.70     0.00        1     0.00     0.00  __static_initialization_and_destruction_0(int, int)
  0.00   1495.70     0.00        1     0.00     0.00  __static_initialization_and_destruction_0(int, int)
  0.00   1495.70     0.00        1     0.00     0.00  __static_initialization_and_destruction_0(int, int)
  0.00   1495.70     0.00        1     0.00     0.00  __static_initialization_and_destruction_0(int, int)
  0.00   1495.70     0.00        1     0.00     0.00  __static_initialization_and_destruction_0(int, int)
  0.00   1495.70     0.00        1     0.00     0.00  __static_initialization_and_destruction_0(int, int)
  0.00   1495.70     0.00        1     0.00     0.00  __static_initialization_and_destruction_0(int, int)
  0.00   1495.70     0.00        1     0.00     0.00  __static_initialization_and_destruction_0(int, int)
  0.00   1495.70     0.00        1     0.00     0.00  __static_initialization_and_destruction_0(int, int)
  0.00   1495.70     0.00        1     0.00     0.00  __static_initialization_and_destruction_0(int, int)
  0.00   1495.70     0.00        1     0.00     0.00  __static_initialization_and_destruction_0(int, int)
  0.00   1495.70     0.00        1     0.00     0.00  __static_initialization_and_destruction_0(int, int)
  0.00   1495.70     0.00        1     0.00     0.00  __static_initialization_and_destruction_0(int, int)
  0.00   1495.70     0.00        1     0.00     0.00  __static_initialization_and_destruction_0(int, int)
  0.00   1495.70     0.00        1     0.00     0.00  yyparse()
  0.00   1495.70     0.00        1     0.00     1.50  zzparse()
  0.00   1495.70     0.00        1     0.00     0.00  yyrestart(_IO_FILE*)
  0.00   1495.70     0.00        1     0.00     0.00  CounterTab::CounterTab()
  0.00   1495.70     0.00        1     0.00     0.00  CounterTab::~CounterTab()
  0.00   1495.70     0.00        1     0.00     0.00  UnaryMinus::UnaryMinus()
  0.00   1495.70     0.00        1     0.00     0.00  UnaryMinus::~UnaryMinus()
  0.00   1495.70     0.00        1     0.00     0.00  SliceFactory::~SliceFactory()
  0.00   1495.70     0.00        1     0.00     0.00  FiniteFactory::~FiniteFactory()
  0.00   1495.70     0.00        1     0.00     0.00  ConjugateFactory::ConjugateFactory()
  0.00   1495.70     0.00        1     0.00     0.00  ConjugateFactory::~ConjugateFactory()
  0.00   1495.70     0.00        1     0.00     0.00  DT::DT()
  0.00   1495.70     0.00        1     0.00     0.00  DT::~DT()
  0.00   1495.70     0.00        1     0.00     0.00  SD::SD()
  0.00   1495.70     0.00        1     0.00     0.00  SD::~SD()
  0.00   1495.70     0.00        1     0.00     0.00  Add::Add()
  0.00   1495.70     0.00        1     0.00     0.00  Add::~Add()
  0.00   1495.70     0.00        1     0.00     0.00  Exp::Exp()
  0.00   1495.70     0.00        1     0.00     0.00  Exp::~Exp()
  0.00   1495.70     0.00        1     0.00     0.00  Log::Log()
  0.00   1495.70     0.00        1     0.00     0.00  Log::~Log()
  0.00   1495.70     0.00        1     0.00     0.00  Max::Max()
  0.00   1495.70     0.00        1     0.00     0.00  Max::~Max()
  0.00   1495.70     0.00        1     0.00     0.00  Min::Min()
  0.00   1495.70     0.00        1     0.00     0.00  Min::~Min()
  0.00   1495.70     0.00        1     0.00     0.00  Phi::Phi()
  0.00   1495.70     0.00        1     0.00     0.00  Phi::~Phi()
  0.00   1495.70     0.00        1     0.00     0.00  Pow::Pow()
  0.00   1495.70     0.00        1     0.00     0.00  Pow::~Pow()
  0.00   1495.70     0.00        1     0.00     0.00  Sum::Sum()
  0.00   1495.70     0.00        1     0.00     0.00  Sum::~Sum()
  0.00   1495.70     0.00        1     0.00     0.00  DBin::DBin()
  0.00   1495.70     0.00        1     0.00     0.00  DBin::~DBin()
  0.00   1495.70     0.00        1     0.00     0.00  DCat::DCat()
  0.00   1495.70     0.00        1     0.00     0.00  DCat::~DCat()
  0.00   1495.70     0.00        1     0.00     0.00  DExp::DExp()
  0.00   1495.70     0.00        1     0.00     0.00  DExp::~DExp()
  0.00   1495.70     0.00        1     0.00     0.00  DPar::DPar()
  0.00   1495.70     0.00        1     0.00     0.00  DPar::~DPar()
  0.00   1495.70     0.00        1     0.00     0.00  Mean::Mean()
  0.00   1495.70     0.00        1     0.00     0.00  Mean::~Mean()
  0.00   1495.70     0.00        1     0.00     0.00  Mexp::Mexp()
  0.00   1495.70     0.00        1     0.00     0.00  Mexp::~Mexp()
  0.00   1495.70     0.00        1     0.00     0.00  Sqrt::Sqrt()
  0.00   1495.70     0.00        1     0.00     0.00  Sqrt::~Sqrt()
  0.00   1495.70     0.00        1     0.00     0.00  Step::Step()
  0.00   1495.70     0.00        1     0.00     0.00  Step::~Step()
  0.00   1495.70     0.00        1     0.00     0.00  DBern::DBern()
  0.00   1495.70     0.00        1     0.00     0.00  DBern::~DBern()
  0.00   1495.70     0.00        1     0.00     0.00  DBeta::DBeta()
  0.00   1495.70     0.00        1     0.00     0.00  DBeta::~DBeta()
  0.00   1495.70     0.00        1     0.00     0.00  DDexp::DDexp()
  0.00   1495.70     0.00        1     0.00     0.00  DDexp::~DDexp()
  0.00   1495.70     0.00        1     0.00     0.00  DNorm::DNorm()
  0.00   1495.70     0.00        1     0.00     0.00  DNorm::~DNorm()
  0.00   1495.70     0.00        1     0.00     0.00  DPois::DPois()
  0.00   1495.70     0.00        1     0.00     0.00  DPois::~DPois()
  0.00   1495.70     0.00        1     0.00     0.00  DUnif::DUnif()
  0.00   1495.70     0.00        1     0.00     0.00  DUnif::~DUnif()
  0.00   1495.70     0.00        1     0.00     0.00  DWeib::DWeib()
  0.00   1495.70     0.00        1     0.00     0.00  DWeib::~DWeib()
  0.00   1495.70     0.00        1     0.00     0.00  DWish::DWish()
  0.00   1495.70     0.00        1     0.00     0.00  DWish::~DWish()
  0.00   1495.70     0.00        1     0.00     0.00  Graph::hasCycle()
  0.00   1495.70     0.00        1     0.00     0.00  Logit::Logit()
  0.00   1495.70     0.00        1     0.00     0.00  Logit::~Logit()
  0.00   1495.70     0.00        1     0.00     0.00  Model::checkGraph()
  0.00   1495.70     0.00        1     0.00     0.00  Model::initialize()
  0.00   1495.70     0.00        1     0.00     0.00  Model::isInitialized()
  0.00   1495.70     0.00        1     0.00     0.00  Model::chooseSamplers(std::vector<SamplerFactory const*, std::allocator<SamplerFactory const*> > const&)
  0.00   1495.70     0.00        1     0.00     0.00  Model::Model()
  0.00   1495.70     0.00        1     0.00     0.00  Model::~Model()
  0.00   1495.70     0.00        1     0.00     0.00  DChisq::DChisq()
  0.00   1495.70     0.00        1     0.00     0.00  DChisq::~DChisq()
  0.00   1495.70     0.00        1     0.00     0.00  DDirch::DDirch()
  0.00   1495.70     0.00        1     0.00     0.00  DDirch::~DDirch()
  0.00   1495.70     0.00        1     0.00     0.00  DGamma::DGamma()
  0.00   1495.70     0.00        1     0.00     0.00  DGamma::~DGamma()
  0.00   1495.70     0.00        1     0.00     0.00  DLnorm::DLnorm()
  0.00   1495.70     0.00        1     0.00     0.00  DLnorm::~DLnorm()
  0.00   1495.70     0.00        1     0.00     0.00  DLogis::DLogis()
  0.00   1495.70     0.00        1     0.00     0.00  DLogis::~DLogis()
  0.00   1495.70     0.00        1     0.00     0.00  DMNorm::DMNorm()
  0.00   1495.70     0.00        1     0.00     0.00  DMNorm::~DMNorm()
  0.00   1495.70     0.00        1     0.00     0.00  DMulti::DMulti()
  0.00   1495.70     0.00        1     0.00     0.00  DMulti::~DMulti()
  0.00   1495.70     0.00        1     0.00     0.00  Divide::Divide()
  0.00   1495.70     0.00        1     0.00     0.00  Divide::~Divide()
  0.00   1495.70     0.00        1     0.00     0.00  Equals::Equals()
  0.00   1495.70     0.00        1     0.00     0.00  Equals::~Equals()
  0.00   1495.70     0.00        1     0.00     0.00  ILogit::ILogit()
  0.00   1495.70     0.00        1     0.00     0.00  ILogit::~ILogit()
  0.00   1495.70     0.00        1     0.00     0.00  InProd::InProd()
  0.00   1495.70     0.00        1     0.00     0.00  InProd::~InProd()
  0.00   1495.70     0.00        1     0.00     0.00  LogDet::LogDet()
  0.00   1495.70     0.00        1     0.00     0.00  LogDet::~LogDet()
  0.00   1495.70     0.00        1     0.00     0.00  LogGam::LogGam()
  0.00   1495.70     0.00        1     0.00     0.00  LogGam::~LogGam()
  0.00   1495.70     0.00        1     0.00     0.00  Probit::Probit()
  0.00   1495.70     0.00        1     0.00     0.00  Probit::~Probit()
  0.00   1495.70     0.00        1     0.00     0.00  SymTab::getNodes(std::vector<Node*, std::allocator<Node*> >&)
  0.00   1495.70     0.00        1     0.00     0.00  SymTab::writeData(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, bool)
  0.00   1495.70     0.00        1     0.00     0.00  SymTab::SymTab()
  0.00   1495.70     0.00        1     0.00     0.00  CLogLog::CLogLog()
  0.00   1495.70     0.00        1     0.00     0.00  CLogLog::~CLogLog()
  0.00   1495.70     0.00        1     0.00     0.00  Console::checkModel(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
  0.00   1495.70     0.00        1     0.00     0.00  Console::initialize()
  0.00   1495.70     0.00        1     0.00     0.00  Console::setParameters(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, unsigned int)
  0.00   1495.70     0.00        1     0.00     1.49  Console::update(long)
  0.00   1495.70     0.00        1     0.00     0.00  Console::compile(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, unsigned int)
  0.00   1495.70     0.00        1     0.00     0.00  Console::setSeed(unsigned int)
  0.00   1495.70     0.00        1     0.00     0.00  Console::Console(std::basic_ostream<char, std::char_traits<char> >&, std::basic_ostream<char, std::char_traits<char> >&)
  0.00   1495.70     0.00        1     0.00     0.00  Console::~Console()
  0.00   1495.70     0.00        1     0.00     0.00  DMState::DMState()
  0.00   1495.70     0.00        1     0.00     0.00  DMState::~DMState()
  0.00   1495.70     0.00        1     0.00     0.00  DNegBin::DNegBin()
  0.00   1495.70     0.00        1     0.00     0.00  DNegBin::~DNegBin()
  0.00   1495.70     0.00        1     0.00     0.00  DistTab::DistTab()
  0.00   1495.70     0.00        1     0.00     0.00  DistTab::~DistTab()
  0.00   1495.70     0.00        1     0.00     0.00  FuncTab::FuncTab()
  0.00   1495.70     0.00        1     0.00     0.00  FuncTab::~FuncTab()
  0.00   1495.70     0.00        1     0.00     0.00  Inverse::Inverse()
  0.00   1495.70     0.00        1     0.00     0.00  Inverse::~Inverse()
  0.00   1495.70     0.00        1     0.00     0.00  LogFact::LogFact()
  0.00   1495.70     0.00        1     0.00     0.00  LogFact::~LogFact()
  0.00   1495.70     0.00        1     0.00     0.00  Compiler::collectNodes()
  0.00   1495.70     0.00        1     0.00     0.00  Compiler::fillConstants()
  0.00   1495.70     0.00        1     0.00     0.00  Compiler::resolveAliases()
  0.00   1495.70     0.00        1     0.00     0.00  Compiler::writeRelations(ParseTree const*)
  0.00   1495.70     0.00        1     0.00     0.00  Compiler::declareVariables(std::vector<ParseTree*, std::allocator<ParseTree*> > const&)
  0.00   1495.70     0.00        1     0.00     0.00  Compiler::writeValuesToGraph(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, bool)
  0.00   1495.70     0.00        1     0.00     0.00  Compiler::Compiler(Graph&, SymTab&, FuncTab const&, DistTab const&, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&)
  0.00   1495.70     0.00        1     0.00     0.00  ICLogLog::ICLogLog()
  0.00   1495.70     0.00        1     0.00     0.00  ICLogLog::~ICLogLog()
  0.00   1495.70     0.00        1     0.00     0.00  Multiply::Multiply()
  0.00   1495.70     0.00        1     0.00     0.00  Multiply::~Multiply()
  0.00   1495.70     0.00        1     0.00     0.00  Subtract::Subtract()
  0.00   1495.70     0.00        1     0.00     0.00  Subtract::~Subtract()
  0.00   1495.70     0.00        1     0.00     0.00  DInterval::DInterval()
  0.00   1495.70     0.00        1     0.00     0.00  DInterval::~DInterval()
  0.00   1495.70     0.00        1     0.00     0.00  LogicalFactory::graph() const
  0.00   1495.70     0.00        1     0.00     0.00  std::_List_base<TraceMonitor*, std::allocator<TraceMonitor*> >::__clear()
  0.00   1495.70     0.00        1     0.00     0.00  std::_List_base<NodeAlias*, std::allocator<NodeAlias*> >::__clear()
  0.00   1495.70     0.00        1     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> const&)
  0.00   1495.70     0.00        1     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >*)
  0.00   1495.70     0.00        1     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> const&)
  0.00   1495.70     0.00        1     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >*)
  0.00   1495.70     0.00        1     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> const&)
  0.00   1495.70     0.00        1     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >*)
  0.00   1495.70     0.00        1     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> const&)
  0.00   1495.70     0.00        1     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >*)
  0.00   1495.70     0.00        1     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> const&)
  0.00   1495.70     0.00        1     0.00     0.00  std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >*)
  0.00   1495.70     0.00        1     0.00     0.00  std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::insert_unique(std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> const&)
  0.00   1495.70     0.00        1     0.00     0.00  void std::partial_sort<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler)
  0.00   1495.70     0.00        1     0.00     0.00  void std::__insertion_sort<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler)
  0.00   1495.70     0.00        1     0.00     0.00  void std::__introsort_loop<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, less_sampler)
  0.00   1495.70     0.00        1     0.00     0.00  void std::__final_insertion_sort<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler)
  0.00   1495.70     0.00        1     0.00     0.00  void std::make_heap<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler)
  0.00   1495.70     0.00        1     0.00     0.00  void std::sort_heap<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler)
  0.00   1495.70     0.00        1     0.00     0.00  yywrap

 %         the percentage of the total running time of the
time       program used by this function.

cumulative a running sum of the number of seconds accounted
 seconds   for by this function and those listed above it.

 self      the number of seconds accounted for by this
seconds    function alone.  This is the major sort for this
           listing.

calls      the number of times this function was invoked, if
           this function is profiled, else blank.
 
 self      the average number of milliseconds spent in this
ms/call    function per call, if this function is profiled,
	   else blank.

 total     the average number of milliseconds spent in this
ms/call    function and its descendents per call, if this 
	   function is profiled, else blank.

name       the name of the function.  This is the minor sort
           for this listing. The index shows the location of
	   the function in the gprof listing. If the index is
	   in parenthesis it shows where it would appear in
	   the gprof listing if it were to be printed.

		     Call graph (explanation follows)


granularity: each sample hit covers 4 byte(s) for 0.00% of 1495.70 seconds

index % time    self  children    called     name
                                                 <spontaneous>
[1]    100.0    0.00 1495.67                 main [1]
                0.00 1495.67       1/1           zzparse() [2]
                0.00    0.00       1/1           Console::~Console() [256]
                0.00    0.00       1/1           Console::Console(std::basic_ostream<char, std::char_traits<char> >&, std::basic_ostream<char, std::char_traits<char> >&) [260]
                0.00    0.00       1/1           Console::setSeed(unsigned int) [584]
-----------------------------------------------
                0.00 1495.67       1/1           main [1]
[2]    100.0    0.00 1495.67       1         zzparse() [2]
                0.00 1488.52       1/1           Console::update(long) [4]
                0.00    4.17       1/1           Console::initialize() [27]
                0.00    2.97       1/1           Console::compile(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, unsigned int) [35]
                0.00    0.02       1/1           Console::setParameters(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, unsigned int) [196]
                0.00    0.00       2/2           readRData(std::vector<ParseTree*, std::allocator<ParseTree*> > const*, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >&) [249]
                0.00    0.00       1/2           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >*) [296]
                0.00    0.00   12337/12337       zzlex() [333]
                0.00    0.00    6159/6330        ParseTree::ParseTree(TreeClass) [345]
                0.00    0.00    6142/6169        ParseTree::setValue(double) [346]
                0.00    0.00      40/141         std::vector<ParseTree*, std::allocator<ParseTree*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<ParseTree**, std::vector<ParseTree*, std::allocator<ParseTree*> > >, ParseTree* const&) [373]
                0.00    0.00      11/11          setParameters(ParseTree*, ParseTree*) [404]
                0.00    0.00       8/8           setName(ParseTree*, std::basic_string<char, std::char_traits<char>, std::allocator<char> >*) [407]
                0.00    0.00       7/77          ParseTree** std::fill_n<ParseTree**, unsigned int, ParseTree*>(ParseTree**, unsigned int, ParseTree* const&) [379]
                0.00    0.00       5/5           setParameters(ParseTree*, std::vector<ParseTree*, std::allocator<ParseTree*> >*) [419]
                0.00    0.00       2/2           open_data_buffer(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const*) [438]
                0.00    0.00       1/1           Console::checkModel(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [583]
                0.00    0.00       1/1           setParameters(ParseTree*, ParseTree*, ParseTree*) [466]
-----------------------------------------------
                1.21 1487.31      20/20          Console::update(long) [4]
[3]     99.5    1.21 1487.31      20         Model::update(long) [3]
                1.49 1472.32 1929000/1929000     FiniteSampler::update() [5]
                0.32   13.11    7000/7000        SliceSampler::update() [21]
                0.02    0.05   23000/141065291     LogicalNode::forwardSample() [10]
-----------------------------------------------
                0.00 1488.52       1/1           zzparse() [2]
[4]     99.5    0.00 1488.52       1         Console::update(long) [4]
                1.21 1487.31      20/20          Model::update(long) [3]
                0.00    0.00       1/1           Model::isInitialized() [550]
-----------------------------------------------
                1.49 1472.32 1929000/1929000     Model::update(long) [3]
[5]     98.5    1.49 1472.32 1929000         FiniteSampler::update() [5]
              223.25  686.70 5787000/5827214     GibbsSampler::setValue(double const*, long) [6]
               22.59  538.01 3858000/3904247     Sampler::logFullConditional() [7]
                1.46    0.00 1929000/1941812     StochasticNode::distribution() const [39]
                0.10    0.00 3858000/3872000     StochasticNode::parameters() const [115]
                0.10    0.00 5787000/5815000     GibbsSampler::node() [114]
                0.04    0.00 1929000/1929000     DBern::lowerLimit(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [151]
                0.04    0.00 1929000/1929000     DBern::upperLimit(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [152]
                0.03    0.00 1929000/1932865     asFinite(Distribution const*) [165]
-----------------------------------------------
                1.55    4.77   40214/5827214     SliceSampler::update() [21]
              223.25  686.70 5787000/5827214     FiniteSampler::update() [5]
[6]     61.3  224.80  691.47 5827214         GibbsSampler::setValue(double const*, long) [6]
              111.14  294.77 141030004/141065291     LogicalNode::forwardSample() [10]
               92.73  173.87 51218988/51221032     MixtureNode::forwardSample() [13]
                3.33   14.98 5787000/5789044     OffsetNode::forwardSample() [19]
                0.52    0.00 5827214/203912840     SArray::setValue(double const*, unsigned long) [20]
                0.14    0.00 5827214/5829150     Sampler::deterministicChildren() const [101]
-----------------------------------------------
                0.27    6.45   46247/3904247     SliceSampler::update() [21]
               22.59  538.01 3858000/3904247     FiniteSampler::update() [5]
[7]     37.9   22.86  544.46 3904247         Sampler::logFullConditional() [7]
              133.82  410.64 121947191/121947191     StochasticNode::logDensity() [8]
-----------------------------------------------
              133.82  410.64 121947191/121947191     Sampler::logFullConditional() [7]
[8]     36.4  133.82  410.64 121947191         StochasticNode::logDensity() [8]
              128.91  280.82 121900944/121900944     DistFinite::logLikelihood(SArray const&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [9]
                0.34    0.57   46247/46247       DistReal::logLikelihood(SArray const&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [45]
-----------------------------------------------
              128.91  280.82 121900944/121900944     StochasticNode::logDensity() [8]
[9]     27.4  128.91  280.82 121900944         DistFinite::logLikelihood(SArray const&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [9]
              280.82    0.00 121900944/121900944     DBern::logLikelihood(long, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [12]
-----------------------------------------------
                0.01    0.03   12287/141065291     Node::initialize() [91]
                0.02    0.05   23000/141065291     Model::update(long) [3]
              111.14  294.77 141030004/141065291     GibbsSampler::setValue(double const*, long) [6]
[10]    27.1  111.17  294.85 141065291         LogicalNode::forwardSample() [10]
               10.74  279.12 141065291/141065291     ScalarFunc::evaluate(SArray&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [11]
                4.98    0.00 141059285/141059285     Function::checkParameterValue(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [24]
                0.01    0.00    6006/6006        Divide::checkParameterValue(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [227]
-----------------------------------------------
               10.74  279.12 141065291/141065291     LogicalNode::forwardSample() [10]
[11]    19.4   10.74  279.12 141065291         ScalarFunc::evaluate(SArray&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [11]
              118.88    0.00 42554472/42554472     ILogit::evaluate(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [15]
               55.70    0.00 30390586/30390586     Multiply::evaluate(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [16]
               49.38    0.00 48352567/48352567     Add::evaluate(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [17]
               42.62    0.00 19756655/19756655     Subtract::evaluate(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [18]
               12.54    0.00 141065291/203912840     SArray::setValue(double const*, unsigned long) [20]
                0.00    0.00    6006/6006        Divide::evaluate(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [350]
                0.00    0.00    4004/4004        Exp::evaluate(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [356]
                0.00    0.00    1001/1001        UnaryMinus::evaluate(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [371]
-----------------------------------------------
              280.82    0.00 121900944/121900944     DistFinite::logLikelihood(SArray const&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [9]
[12]    18.8  280.82    0.00 121900944         DBern::logLikelihood(long, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [12]
-----------------------------------------------
                0.00    0.01    2044/51221032     Node::initialize() [91]
               92.73  173.87 51218988/51221032     GibbsSampler::setValue(double const*, long) [6]
[13]    17.8   92.73  173.88 51221032         MixtureNode::forwardSample() [13]
              167.95    0.00 51221032/51221032     std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::find(long const&) [14]
                4.55    0.00 51221032/203912840     SArray::setValue(double const*, unsigned long) [20]
                1.37    0.00 51221032/51408928     SArray::length() const [40]
-----------------------------------------------
              167.95    0.00 51221032/51221032     MixtureNode::forwardSample() [13]
[14]    11.2  167.95    0.00 51221032         std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::find(long const&) [14]
-----------------------------------------------
              118.88    0.00 42554472/42554472     ScalarFunc::evaluate(SArray&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [11]
[15]     7.9  118.88    0.00 42554472         ILogit::evaluate(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [15]
-----------------------------------------------
               55.70    0.00 30390586/30390586     ScalarFunc::evaluate(SArray&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [11]
[16]     3.7   55.70    0.00 30390586         Multiply::evaluate(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [16]
-----------------------------------------------
               49.38    0.00 48352567/48352567     ScalarFunc::evaluate(SArray&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [11]
[17]     3.3   49.38    0.00 48352567         Add::evaluate(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [17]
-----------------------------------------------
               42.62    0.00 19756655/19756655     ScalarFunc::evaluate(SArray&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [11]
[18]     2.8   42.62    0.00 19756655         Subtract::evaluate(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [18]
-----------------------------------------------
                0.00    0.01    2044/5789044     Node::initialize() [91]
                3.33   14.98 5787000/5789044     GibbsSampler::setValue(double const*, long) [6]
[19]     1.2    3.33   14.98 5789044         OffsetNode::forwardSample() [19]
                2.17    6.99 5789044/5846318     Range::leftOffset(Index const&) const [22]
                2.97    1.27 11578088/11578088     SubSetIndex::value() const [26]
                0.51    0.00 5789044/203912840     SArray::setValue(double const*, unsigned long) [20]
                0.51    0.00 5789044/6044854     Index::Index(unsigned int) [53]
                0.42    0.00 11578088/12210221     Index::operator[](unsigned int) [55]
                0.15    0.00 5789044/6374332     Index::~Index() [95]
-----------------------------------------------
                0.00    0.00       8/203912840     readRData(std::vector<ParseTree*, std::allocator<ParseTree*> > const*, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >&) [249]
                0.00    0.00    1929/203912840     DistFinite::randomSample(SArray&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [252]
                0.00    0.00    4112/203912840     ConstantNode::ConstantNode(double) [179]
                0.00    0.00    4210/203912840     NodeArray::setValue(SArray const&, bool) [172]
                0.51    0.00 5789044/203912840     OffsetNode::forwardSample() [19]
                0.52    0.00 5827214/203912840     GibbsSampler::setValue(double const*, long) [6]
                4.55    0.00 51221032/203912840     MixtureNode::forwardSample() [13]
               12.54    0.00 141065291/203912840     ScalarFunc::evaluate(SArray&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [11]
[20]     1.2   18.12    0.00 203912840         SArray::setValue(double const*, unsigned long) [20]
-----------------------------------------------
                0.32   13.11    7000/7000        Model::update(long) [3]
[21]     0.9    0.32   13.11    7000         SliceSampler::update() [21]
                0.27    6.45   46247/3904247     Sampler::logFullConditional() [7]
                1.55    4.77   40214/5827214     GibbsSampler::setValue(double const*, long) [6]
                0.02    0.02    7000/7000        DistReal::lowerLimit(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [157]
                0.02    0.00    7000/7007        asReal(Distribution const*) [187]
                0.01    0.00    7000/1941812     StochasticNode::distribution() const [39]
                0.00    0.00    7000/7000        DistReal::upperLimit(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [235]
                0.00    0.00   28000/5815000     GibbsSampler::node() [114]
                0.00    0.00   14000/3872000     StochasticNode::parameters() const [115]
-----------------------------------------------
                0.00    0.00       8/5846318     Compiler::constantExpression(ParseTree const*, double&) <cycle 1> [161]
                0.00    0.01    6139/5846318     NodeArray::setValue(SArray const&, bool) [172]
                0.00    0.01    8176/5846318     Compiler::getMixtureNode(ParseTree const*) <cycle 2> [80]
                0.01    0.02   18405/5846318     NodeArray::rangeContainsSetNodes(Range const&) const [107]
                0.01    0.03   24546/5846318     NodeArray::set(Node*, Range const&) [56]
                2.17    6.99 5789044/5846318     OffsetNode::forwardSample() [19]
[22]     0.6    2.19    7.06 5846318         Range::leftOffset(Index const&) const [22]
                1.84    2.66 5846318/5989472     Range::contains(Index const&) const [25]
                2.43    0.00 46574216/96244414     Index::operator[](unsigned int) const [23]
                0.13    0.00 5846318/19724490     Index::length() const [58]
-----------------------------------------------
                0.00    0.00      16/96244414     CounterTab::pushCounter(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, Range const&) [293]
                0.00    0.00    8176/96244414     Compiler::getMixtureNode(ParseTree const*) <cycle 2> [80]
                0.00    0.00   36816/96244414     printRange(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, Range const&) [141]
                0.00    0.00   53356/96244414     Range::length() const [204]
                0.00    0.00   65474/96244414     leftIncrement(Index&, Index const&, Index const&, int) [192]
                0.01    0.00  102402/96244414     Range::dim(bool) const [143]
                0.01    0.00  167714/96244414     LeftRangeIterator::atEnd() const [173]
                0.11    0.00 2023908/96244414     indexComp(Index const&, Index const&) [79]
                2.43    0.00 46574216/96244414     Range::leftOffset(Index const&) const [22]
                2.46    0.00 47212336/96244414     Range::contains(Index const&) const [25]
[23]     0.3    5.02    0.00 96244414         Index::operator[](unsigned int) const [23]
-----------------------------------------------
                4.98    0.00 141059285/141059285     LogicalNode::forwardSample() [10]
[24]     0.3    4.98    0.00 141059285         Function::checkParameterValue(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [24]
-----------------------------------------------
                0.05    0.07  143154/5989472     Range::contains(Range const&) const [109]
                1.84    2.66 5846318/5989472     Range::leftOffset(Index const&) const [22]
[25]     0.3    1.89    2.72 5989472         Range::contains(Index const&) const [25]
                2.46    0.00 47212336/96244414     Index::operator[](unsigned int) const [23]
                0.26    0.00 11978944/19724490     Index::length() const [58]
-----------------------------------------------
                2.97    1.27 11578088/11578088     OffsetNode::forwardSample() [19]
[26]     0.3    2.97    1.27 11578088         SubSetIndex::value() const [26]
                1.27    0.00 11578088/11578088     asInteger(double) [41]
-----------------------------------------------
                0.00    4.17       1/1           zzparse() [2]
[27]     0.3    0.00    4.17       1         Console::initialize() [27]
                0.00    3.89       1/1           Model::chooseSamplers(std::vector<SamplerFactory const*, std::allocator<SamplerFactory const*> > const&) [28]
                0.00    0.27       1/1           Model::initialize() [73]
                0.00    0.00       1/1           ConjugateFactory::ConjugateFactory() [289]
                0.00    0.00       3/3           std::vector<SamplerFactory const*, std::allocator<SamplerFactory const*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<SamplerFactory const**, std::vector<SamplerFactory const*, std::allocator<SamplerFactory const*> > >, SamplerFactory const* const&) [434]
                0.00    0.00       1/3           Model::graph() [432]
                0.00    0.00       1/3           Graph::size() const [433]
                0.00    0.00       1/1           SliceFactory::~SliceFactory() [493]
                0.00    0.00       1/1           FiniteFactory::~FiniteFactory() [494]
                0.00    0.00       1/1           ConjugateFactory::~ConjugateFactory() [495]
-----------------------------------------------
                0.00    3.89       1/1           Console::initialize() [27]
[28]     0.3    0.00    3.89       1         Model::chooseSamplers(std::vector<SamplerFactory const*, std::allocator<SamplerFactory const*> > const&) [28]
                0.00    3.23       3/3           GibbsFactory::makeSampler(std::set<StochasticNode*, std::less<StochasticNode*>, std::allocator<StochasticNode*> >&, std::vector<Sampler*, std::allocator<Sampler*> >&) const [29]
                0.00    0.31       1/1           void std::__introsort_loop<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, less_sampler) [68]
                0.01    0.18   42011/42011       Graph::remove(Node*) [90]
                0.07    0.02   26626/28567       std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::insert_unique(std::pair<Node const* const, int> const&) [120]
                0.00    0.05   16037/147955      Graph::add(Node*) [57]
                0.01    0.00   32765/187651      SArray::isFixed() const [133]
                0.01    0.00    1936/54174       Node::hasDescendant(bool (*)(Node const*)) const [78]
                0.00    0.01       1/1           void std::__final_insertion_sort<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler) [229]
                0.00    0.00       1/1940        Graph::getSortedNodes(std::vector<Node*, std::allocator<Node*> >&) [38]
                0.00    0.00    1936/1936        std::_Rb_tree<StochasticNode*, StochasticNode*, std::_Identity<StochasticNode*>, std::less<StochasticNode*>, std::allocator<StochasticNode*> >::insert_unique(StochasticNode* const&) [240]
                0.00    0.00    1936/126554      Sampler::nodes() const [185]
                0.00    0.00       1/3879        Graph::~Graph() [62]
                0.00    0.00    1936/5829150     Sampler::deterministicChildren() const [101]
                0.00    0.00   26626/57063       asStochastic(Node*) [316]
                0.00    0.00       1/3891        Graph::Graph() [358]
-----------------------------------------------
                0.00    3.23       3/3           Model::chooseSamplers(std::vector<SamplerFactory const*, std::allocator<SamplerFactory const*> > const&) [28]
[29]     0.2    0.00    3.23       3         GibbsFactory::makeSampler(std::set<StochasticNode*, std::less<StochasticNode*>, std::allocator<StochasticNode*> >&, std::vector<Sampler*, std::allocator<Sampler*> >&) const [29]
                0.00    3.14    1929/1929        FiniteFactory::makeGibbsSampler(StochasticNode*) const [34]
                0.00    0.07    1936/1936        ConjugateFactory::canSample(StochasticNode const*) const [136]
                0.00    0.01       7/7           SliceFactory::makeGibbsSampler(StochasticNode*) const [209]
                0.00    0.00    3879/1184488     std::_Rb_tree_base_iterator::_M_increment() [49]
                0.00    0.00    1936/1936        FiniteFactory::canSample(StochasticNode const*) const [237]
                0.00    0.00    1936/44549       std::_Rb_tree_rebalance_for_erase(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&, std::_Rb_tree_node_base*&, std::_Rb_tree_node_base*&) [163]
                0.00    0.00       7/7           SliceFactory::canSample(StochasticNode const*) const [268]
                0.00    0.00      12/12          std::vector<Sampler*, std::allocator<Sampler*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, Sampler* const&) [400]
-----------------------------------------------
                0.00    0.00       2/1938        GibbsSampler::classifyChildren(StochasticNode const*, std::vector<StochasticNode*, std::allocator<StochasticNode*> >&, std::vector<DeterministicNode*, std::allocator<DeterministicNode*> >&) [232]
                0.02    3.13    1936/1938        Sampler::Sampler(std::vector<StochasticNode*, std::allocator<StochasticNode*> > const&) [32]
[30]     0.2    0.02    3.14    1938         Sampler::classifyChildren(std::set<StochasticNode const*, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> > const&, std::vector<StochasticNode*, std::allocator<StochasticNode*> >&, std::vector<DeterministicNode*, std::allocator<DeterministicNode*> >&) [30]
                0.43    1.71    1938/1940        Graph::getSortedNodes(std::vector<Node*, std::allocator<Node*> >&) [38]
                0.01    0.60   24312/24312       classifyNode(Node*, Graph&, Graph&) [51]
                0.00    0.35    3876/3879        Graph::~Graph() [62]
                0.00    0.02    1938/1951        Graph::getNodes(std::vector<Node*, std::allocator<Node*> >&) const [176]
                0.01    0.00   26250/1184488     std::_Rb_tree_base_iterator::_M_increment() [49]
                0.00    0.00   50295/50295       asDeterministic(Node*) [319]
                0.00    0.00   28188/232325      Node::children() const [314]
                0.00    0.00   24298/57063       asStochastic(Node*) [316]
                0.00    0.00   24298/24298       std::_Rb_tree<StochasticNode const*, StochasticNode const*, std::_Identity<StochasticNode const*>, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> >::find(StochasticNode const* const&) const [328]
                0.00    0.00    7832/7832        std::vector<DeterministicNode*, std::allocator<DeterministicNode*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<DeterministicNode**, std::vector<DeterministicNode*, std::allocator<DeterministicNode*> > >, DeterministicNode* const&) [342]
                0.00    0.00    3967/3967        std::vector<StochasticNode*, std::allocator<StochasticNode*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<StochasticNode**, std::vector<StochasticNode*, std::allocator<StochasticNode*> > >, StochasticNode* const&) [357]
                0.00    0.00    3876/3891        Graph::Graph() [358]
-----------------------------------------------
                0.00    0.01       7/1936        SliceSampler::SliceSampler(StochasticNode*, double, long) [208]
                0.00    3.14    1929/1936        FiniteSampler::FiniteSampler(StochasticNode*) [33]
[31]     0.2    0.00    3.15    1936         GibbsSampler::GibbsSampler(StochasticNode*) [31]
                0.00    3.15    1936/1936        Sampler::Sampler(std::vector<StochasticNode*, std::allocator<StochasticNode*> > const&) [32]
                0.00    0.00    1936/1936        StochasticNode** std::fill_n<StochasticNode**, unsigned int, StochasticNode*>(StochasticNode**, unsigned int, StochasticNode* const&) [368]
-----------------------------------------------
                0.00    3.15    1936/1936        GibbsSampler::GibbsSampler(StochasticNode*) [31]
[32]     0.2    0.00    3.15    1936         Sampler::Sampler(std::vector<StochasticNode*, std::allocator<StochasticNode*> > const&) [32]
                0.02    3.13    1936/1938        Sampler::classifyChildren(std::set<StochasticNode const*, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> > const&, std::vector<StochasticNode*, std::allocator<StochasticNode*> >&, std::vector<DeterministicNode*, std::allocator<DeterministicNode*> >&) [30]
                0.00    0.00    1936/1938        std::_Rb_tree<StochasticNode const*, StochasticNode const*, std::_Identity<StochasticNode const*>, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> >::insert_unique(StochasticNode const* const&) [245]
                0.00    0.00    1936/1938        std::_Rb_tree<StochasticNode const*, StochasticNode const*, std::_Identity<StochasticNode const*>, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> >::_M_erase(std::_Rb_tree_node<StochasticNode const*>*) [364]
-----------------------------------------------
                0.00    3.14    1929/1929        FiniteFactory::makeGibbsSampler(StochasticNode*) const [34]
[33]     0.2    0.00    3.14    1929         FiniteSampler::FiniteSampler(StochasticNode*) [33]
                0.00    3.14    1929/1936        GibbsSampler::GibbsSampler(StochasticNode*) [31]
                0.00    0.00    1929/1941812     StochasticNode::distribution() const [39]
                0.00    0.00    1929/1932865     asFinite(Distribution const*) [165]
-----------------------------------------------
                0.00    3.14    1929/1929        GibbsFactory::makeSampler(std::set<StochasticNode*, std::less<StochasticNode*>, std::allocator<StochasticNode*> >&, std::vector<Sampler*, std::allocator<Sampler*> >&) const [29]
[34]     0.2    0.00    3.14    1929         FiniteFactory::makeGibbsSampler(StochasticNode*) const [34]
                0.00    3.14    1929/1929        FiniteSampler::FiniteSampler(StochasticNode*) [33]
-----------------------------------------------
                0.00    2.97       1/1           zzparse() [2]
[35]     0.2    0.00    2.97       1         Console::compile(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, unsigned int) [35]
                0.00    2.36       1/1           Compiler::writeRelations(ParseTree const*) [36]
                0.00    0.54       1/1           Model::checkGraph() [52]
                0.00    0.05       1/1           Compiler::collectNodes() [142]
                0.00    0.01       1/1           Compiler::writeValuesToGraph(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, bool) [206]
                0.01    0.00       1/1           std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::_M_erase(std::_Rb_tree_node<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >*) [228]
                0.00    0.00       1/3879        Graph::~Graph() [62]
                0.00    0.00       1/1           Compiler::declareVariables(std::vector<ParseTree*, std::allocator<ParseTree*> > const&) [263]
                0.00    0.00       2/3           Model::graph() [432]
                0.00    0.00       1/1           Compiler::Compiler(Graph&, SymTab&, FuncTab const&, DistTab const&, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&) [594]
                0.00    0.00       1/3           Graph::size() const [433]
                0.00    0.00       1/1           std::_List_base<NodeAlias*, std::allocator<NodeAlias*> >::__clear() [605]
                0.00    0.00       1/1           CounterTab::~CounterTab() [490]
-----------------------------------------------
                0.00    2.36       1/1           Console::compile(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, unsigned int) [35]
[36]     0.2    0.00    2.36       1         Compiler::writeRelations(ParseTree const*) [36]
                0.01    2.30       2/2           Compiler::traverseTree(ParseTree const*, void (Compiler::*)(ParseTree const*), void (Compiler::*)(ParseTree const*)) [37]
                0.00    0.05       1/1           Compiler::fillConstants() [146]
                0.00    0.00       1/1           Compiler::resolveAliases() [593]
-----------------------------------------------
                                4100             Compiler::traverseTree(ParseTree const*, void (Compiler::*)(ParseTree const*), void (Compiler::*)(ParseTree const*)) [37]
                0.01    2.30       2/2           Compiler::writeRelations(ParseTree const*) [36]
[37]     0.2    0.01    2.30       2+4100    Compiler::traverseTree(ParseTree const*, void (Compiler::*)(ParseTree const*), void (Compiler::*)(ParseTree const*)) [37]
                0.01    0.73    6139/6139        Compiler::setStochasticParameters(ParseTree const*) [46]
                0.00    0.73    6134/6134        Compiler::setLogicalParameters(ParseTree const*) [47]
                0.02    0.40    6134/6134        Compiler::allocateLogical(ParseTree const*) [59]
                0.03    0.38    6139/6139        Compiler::allocateStochastic(ParseTree const*) [60]
                0.00    0.00    4118/321300      ParseTree::parameters() const [180]
                0.00    0.00       8/8           Compiler::CounterRange(ParseTree const*) [261]
                0.00    0.00       8/8           CounterTab::pushCounter(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, Range const&) [293]
                0.00    0.00       8/145241      ParseTree::name() const [183]
                0.00    0.00      16/6374332     Index::~Index() [95]
                0.00    0.00   24554/302808      ParseTree::treeClass() const [312]
                0.00    0.00    4108/4108        Counter::atEnd() const [351]
                0.00    0.00    4100/4100        Counter::increment() [354]
                0.00    0.00       8/8           Counter::reset() [409]
                0.00    0.00       8/8           CounterTab::popCounter() [408]
                                4100             Compiler::traverseTree(ParseTree const*, void (Compiler::*)(ParseTree const*), void (Compiler::*)(ParseTree const*)) [37]
-----------------------------------------------
                0.00    0.00       1/1940        Model::checkGraph() [52]
                0.00    0.00       1/1940        Model::chooseSamplers(std::vector<SamplerFactory const*, std::allocator<SamplerFactory const*> > const&) [28]
                0.43    1.71    1938/1940        Sampler::classifyChildren(std::set<StochasticNode const*, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> > const&, std::vector<StochasticNode*, std::allocator<StochasticNode*> >&, std::vector<DeterministicNode*, std::allocator<DeterministicNode*> >&) [30]
[38]     0.1    0.43    1.71    1940         Graph::getSortedNodes(std::vector<Node*, std::allocator<Node*> >&) [38]
                0.02    0.50  299464/670605      Graph::contains(Node*) const [42]
                0.03    0.49  347632/417237      GraphMarks::mark(Node const*) [50]
                0.28    0.00  490210/1184488     std::_Rb_tree_base_iterator::_M_increment() [49]
                0.01    0.19    1940/1941        GraphMarks::GraphMarks(Graph const&) [89]
                0.01    0.11   76944/103570      GraphMarks::mark(Node const*, int) [94]
                0.00    0.07    1940/1941        GraphMarks::~GraphMarks() [135]
                0.00    0.00    7854/40509       std::vector<Node*, std::allocator<Node*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<Node**, std::vector<Node*, std::allocator<Node*> > >, Node* const&) [218]
                0.00    0.00  172380/236427      Node::parents() const [313]
-----------------------------------------------
                0.00    0.00       4/1941812     getDist(StochasticNode const*) [210]
                0.00    0.00       7/1941812     SliceSampler::canSample(StochasticNode const*) [267]
                0.00    0.00    1929/1941812     FiniteSampler::FiniteSampler(StochasticNode*) [33]
                0.00    0.00    1936/1941812     ConjugateFactory::canSample(StochasticNode const*) const [136]
                0.00    0.00    1936/1941812     FiniteSampler::canSample(StochasticNode const*) [236]
                0.01    0.00    7000/1941812     SliceSampler::update() [21]
                1.46    0.00 1929000/1941812     FiniteSampler::update() [5]
[39]     0.1    1.47    0.00 1941812         StochasticNode::distribution() const [39]
-----------------------------------------------
                0.00    0.00       7/51408928     NodeArray::setValue(SArray const&, bool) [172]
                0.00    0.00       7/51408928     SliceSampler::canSample(StochasticNode const*) [267]
                0.00    0.00      35/51408928     DistReal::checkParameterDim(SArray const&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [295]
                0.00    0.00    1929/51408928     DistFinite::randomSample(SArray&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [252]
                0.00    0.00    2044/51408928     MixtureNode::MixtureNode(Node*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > const&) [150]
                0.00    0.00    4088/51408928     SubSetIndex::SubSetIndex(Node*) [258]
                0.00    0.00    4088/51408928     SubSetIndex::checkLimits(std::vector<SubSetIndex, std::allocator<SubSetIndex> > const&, std::vector<SubSetIndex, std::allocator<SubSetIndex> > const&) [201]
                0.00    0.00   12264/51408928     DBern::checkParameterDim(SArray const&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [250]
                0.00    0.00   34812/51408928     ScalarFunc::checkDim(SArray const&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [242]
                0.00    0.00  128622/51408928     Node::isInitialized() [98]
                1.37    0.00 51221032/51408928     MixtureNode::forwardSample() [13]
[40]     0.1    1.38    0.00 51408928         SArray::length() const [40]
-----------------------------------------------
                1.27    0.00 11578088/11578088     SubSetIndex::value() const [26]
[41]     0.1    1.27    0.00 11578088         asInteger(double) [41]
-----------------------------------------------
                0.00    0.07   42011/670605      Graph::remove(Node*) [90]
                0.00    0.07   42979/670605      findDescendant(Node*, Node*, Graph const*, GraphMarks&) [72]
                0.00    0.09   52238/670605      classifyNode(Node*, Graph&, Graph&) [51]
                0.01    0.14   85958/670605      Graph::isClosed() [81]
                0.01    0.25  147955/670605      Graph::add(Node*) [57]
                0.02    0.50  299464/670605      Graph::getSortedNodes(std::vector<Node*, std::allocator<Node*> >&) [38]
[42]     0.1    0.04    1.13  670605         Graph::contains(Node*) const [42]
                1.13    0.00  670605/670605      std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::find(Node* const&) const [43]
-----------------------------------------------
                1.13    0.00  670605/670605      Graph::contains(Node*) const [42]
[43]     0.1    1.13    0.00  670605         std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::find(Node* const&) const [43]
-----------------------------------------------
[44]     0.1    0.06    1.03   12280+77756   <cycle 2 as a whole> [44]
                0.03    0.42   26614             Compiler::getLogicalParameter(ParseTree const*) <cycle 2> [54]
                0.01    0.36   22494             Compiler::VarGetParameter(ParseTree const*) <cycle 2> [61]
                0.01    0.22    2044             Compiler::getMixtureNode(ParseTree const*) <cycle 2> [80]
                0.00    0.01    4088             Compiler::makeSubsetIndex(ParseTree const*, std::vector<SubSetIndex, std::allocator<SubSetIndex> >&, Index const&) <cycle 2> [205]
                0.00    0.00   22508             Compiler::Param(ParseTree const*) <cycle 2> [254]
-----------------------------------------------
                0.34    0.57   46247/46247       StochasticNode::logDensity() [8]
[45]     0.1    0.34    0.57   46247         DistReal::logLikelihood(SArray const&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [45]
                0.09    0.21   33542/33542       DUnif::d(double, std::vector<SArray const*, std::allocator<SArray const*> > const&, bool) const [70]
                0.13    0.00   46247/53247       Distribution::lowerBound(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [96]
                0.12    0.00   12705/12705       DNorm::d(double, std::vector<SArray const*, std::allocator<SArray const*> > const&, bool) const [106]
                0.02    0.00   46247/53247       Distribution::upperBound(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [186]
-----------------------------------------------
                0.01    0.73    6139/6139        Compiler::traverseTree(ParseTree const*, void (Compiler::*)(ParseTree const*), void (Compiler::*)(ParseTree const*)) [37]
[46]     0.0    0.01    0.73    6139         Compiler::setStochasticParameters(ParseTree const*) [46]
                0.03    0.51    6146/12280       Compiler::Param(ParseTree const*) <cycle 2> [254]
                0.01    0.13    6139/12273       Compiler::VarGetNode(ParseTree const*) [74]
                0.00    0.05    6139/6139        StochasticNode::setParameters(std::vector<Node*, std::allocator<Node*> > const&) [148]
                0.00    0.00   24556/321300      ParseTree::parameters() const [180]
                0.00    0.00    6146/40509       std::vector<Node*, std::allocator<Node*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<Node**, std::vector<Node*, std::allocator<Node*> > >, Node* const&) [218]
                0.00    0.00    6139/302808      ParseTree::treeClass() const [312]
                0.00    0.00    6139/57063       asStochastic(Node*) [316]
-----------------------------------------------
                0.00    0.73    6134/6134        Compiler::traverseTree(ParseTree const*, void (Compiler::*)(ParseTree const*), void (Compiler::*)(ParseTree const*)) [37]
[47]     0.0    0.00    0.73    6134         Compiler::setLogicalParameters(ParseTree const*) [47]
                0.03    0.51    6134/12280       Compiler::getLogicalParameterVector(ParseTree const*, std::vector<Node*, std::allocator<Node*> >&) <cycle 2> [193]
                0.00    0.13    6134/12273       Compiler::VarGetNode(ParseTree const*) [74]
                0.00    0.05    6134/12287       LogicalNode::setParameters(std::vector<Node*, std::allocator<Node*> > const&) [112]
                0.00    0.00   12268/321300      ParseTree::parameters() const [180]
                0.00    0.00   12268/302808      ParseTree::treeClass() const [312]
                0.00    0.00    6134/6134        asLogical(Node*) [349]
-----------------------------------------------
                0.15    0.00  103570/520807      GraphMarks::mark(Node const*, int) [94]
                0.58    0.00  417237/520807      GraphMarks::mark(Node const*) [50]
[48]     0.0    0.73    0.00  520807         std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::find(Node const* const&) [48]
-----------------------------------------------
                0.00    0.00       4/1184488     Compiler::fillConstants() [146]
                0.00    0.00       4/1184488     Compiler::writeValuesToGraph(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, bool) [206]
                0.00    0.00       4/1184488     SymTab::writeData(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, bool) [195]
                0.00    0.00      12/1184488     SymTab::getNodes(std::vector<Node*, std::allocator<Node*> >&) [255]
                0.00    0.00      23/1184488     DistTab::~DistTab() [272]
                0.00    0.00      28/1184488     FuncTab::~FuncTab() [271]
                0.00    0.00      96/1184488     Node::hasDescendant(bool (*)(Node const*)) const [78]
                0.00    0.00    3879/1184488     GibbsFactory::makeSampler(std::set<StochasticNode*, std::less<StochasticNode*>, std::allocator<StochasticNode*> >&, std::vector<Sampler*, std::allocator<Sampler*> >&) const [29]
                0.00    0.00    4671/1184488     DeterministicNode::initialize() [92]
                0.00    0.00    6139/1184488     NodeArray::setValue(SArray const&, bool) [172]
                0.01    0.00   26250/1184488     Sampler::classifyChildren(std::set<StochasticNode const*, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> > const&, std::vector<StochasticNode*, std::allocator<StochasticNode*> >&, std::vector<DeterministicNode*, std::allocator<DeterministicNode*> >&) [30]
                0.02    0.00   26626/1184488     Graph::hasCycle() [69]
                0.02    0.00   34803/1184488     Node::unlink() [83]
                0.02    0.00   38762/1184488     Node::canInitialize() [117]
                0.02    0.00   42613/1184488     std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::erase(std::_Rb_tree_iterator<Node*, Node*&, Node**>, std::_Rb_tree_iterator<Node*, Node*&, Node**>) [127]
                0.02    0.00   42724/1184488     Graph::getNodes(std::vector<Node*, std::allocator<Node*> >&) const [176]
                0.02    0.00   42979/1184488     findDescendant(Node*, Node*, Graph const*, GraphMarks&) [72]
                0.03    0.00   50295/1184488     classifyNode(Node*, Graph&, Graph&) [51]
                0.03    0.00   50817/1184488     std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::erase(Node* const&) [88]
                0.06    0.00  103570/1184488     GraphMarks::GraphMarks(Graph const&) [89]
                0.06    0.00  107395/1184488     Graph::~Graph() [62]
                0.06    0.00  112584/1184488     Graph::isClosed() [81]
                0.28    0.00  490210/1184488     Graph::getSortedNodes(std::vector<Node*, std::allocator<Node*> >&) [38]
[49]     0.0    0.67    0.00 1184488         std::_Rb_tree_base_iterator::_M_increment() [49]
-----------------------------------------------
                0.01    0.10   69605/417237      findDescendant(Node*, Node*, Graph const*, GraphMarks&) [72]
                0.03    0.49  347632/417237      Graph::getSortedNodes(std::vector<Node*, std::allocator<Node*> >&) [38]
[50]     0.0    0.04    0.58  417237         GraphMarks::mark(Node const*) [50]
                0.58    0.00  417237/520807      std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::find(Node const* const&) [48]
-----------------------------------------------
                               50295             classifyNode(Node*, Graph&, Graph&) [51]
                0.01    0.60   24312/24312       Sampler::classifyChildren(std::set<StochasticNode const*, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> > const&, std::vector<StochasticNode*, std::allocator<StochasticNode*> >&, std::vector<DeterministicNode*, std::allocator<DeterministicNode*> >&) [30]
[51]     0.0    0.01    0.60   24312+50295   classifyNode(Node*, Graph&, Graph&) [51]
                0.18    0.05   52238/54174       Node::hasDescendant(bool (*)(Node const*)) const [78]
                0.00    0.22   74593/147955      Graph::add(Node*) [57]
                0.00    0.09   52238/670605      Graph::contains(Node*) const [42]
                0.03    0.00   50295/1184488     std::_Rb_tree_base_iterator::_M_increment() [49]
                0.00    0.01   24298/154886      isObserved(Node const*) [129]
                0.01    0.00   74607/74607       isStochastic(Node const*) [215]
                0.00    0.00  150885/232325      Node::children() const [314]
                0.00    0.00   50309/54519       isDeterministic(Node const*) [317]
                               50295             classifyNode(Node*, Graph&, Graph&) [51]
-----------------------------------------------
                0.00    0.54       1/1           Console::compile(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, unsigned int) [35]
[52]     0.0    0.00    0.54       1         Model::checkGraph() [52]
                0.00    0.30       1/1           Graph::hasCycle() [69]
                0.02    0.21       1/1           Graph::isClosed() [81]
                0.00    0.00       1/1940        Graph::getSortedNodes(std::vector<Node*, std::allocator<Node*> >&) [38]
-----------------------------------------------
                0.00    0.00       8/6044854     readRData(std::vector<ParseTree*, std::allocator<ParseTree*> > const*, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >&) [249]
                0.00    0.00      12/6044854     Compiler::declareVariables(std::vector<ParseTree*, std::allocator<ParseTree*> > const&) [263]
                0.00    0.00      12/6044854     NodeArray::NodeArray(Index const&) [269]
                0.00    0.00      16/6044854     Compiler::CounterRange(ParseTree const*) [261]
                0.00    0.00    2044/6044854     OffsetNode::OffsetNode(Range const&, std::vector<SubSetIndex, std::allocator<SubSetIndex> > const&) [178]
                0.00    0.00    4112/6044854     ConstantNode::ConstantNode(double) [179]
                0.00    0.00    6153/6044854     ScalarFunc::dim(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [248]
                0.00    0.00   10220/6044854     Compiler::getMixtureNode(ParseTree const*) <cycle 2> [80]
                0.00    0.00   26634/6044854     SArray::SArray(Index const&) [125]
                0.00    0.00   51187/6044854     Range::dim(bool) const [143]
                0.01    0.00   77688/6044854     Compiler::getRange(std::vector<ParseTree*, std::allocator<ParseTree*> > const&, Range const&, Range&) <cycle 1> [116]
                0.01    0.00   77724/6044854     Range::Range() [158]
                0.51    0.00 5789044/6044854     OffsetNode::forwardSample() [19]
[53]     0.0    0.53    0.00 6044854         Index::Index(unsigned int) [53]
-----------------------------------------------
                                4088             Compiler::makeSubsetIndex(ParseTree const*, std::vector<SubSetIndex, std::allocator<SubSetIndex> >&, Index const&) <cycle 2> [205]
                               22526             Compiler::getLogicalParameterVector(ParseTree const*, std::vector<Node*, std::allocator<Node*> >&) <cycle 2> [193]
[54]     0.0    0.03    0.42   26614         Compiler::getLogicalParameter(ParseTree const*) <cycle 2> [54]
                0.03    0.29    6154/6154        LogicalFactory::getLogicalNode(Function const*, std::vector<Node*, std::allocator<Node*> > const&) [64]
                0.00    0.05    6154/10244       getFunction(ParseTree const*, FuncTab const&) [122]
                0.00    0.02    4098/4112        ConstantNode::ConstantNode(double) [179]
                0.01    0.01    4098/4112        setConstantNameToValue(ConstantNode*) [199]
                0.00    0.01    4098/147955      Graph::add(Node*) [57]
                0.00    0.00   26614/302808      ParseTree::treeClass() const [312]
                0.00    0.00    4098/10270       ParseTree::value() const [337]
                               16362             Compiler::Param(ParseTree const*) <cycle 2> [254]
                                6154             Compiler::getLogicalParameterVector(ParseTree const*, std::vector<Node*, std::allocator<Node*> >&) <cycle 2> [193]
-----------------------------------------------
                0.00    0.00       8/12210221     Compiler::declareVariables(std::vector<ParseTree*, std::allocator<ParseTree*> > const&) [263]
                0.00    0.00      11/12210221     readRData(std::vector<ParseTree*, std::allocator<ParseTree*> > const*, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >&) [249]
                0.00    0.00      16/12210221     Compiler::CounterRange(ParseTree const*) [261]
                0.00    0.00   12290/12210221     Range::dim(bool) const [143]
                0.00    0.00  110376/12210221     Compiler::getMixtureNode(ParseTree const*) <cycle 2> [80]
                0.00    0.00  112468/12210221     Compiler::getRange(std::vector<ParseTree*, std::allocator<ParseTree*> > const&, Range const&, Range&) <cycle 1> [116]
                0.00    0.00  126844/12210221     leftIncrement(Index&, Index const&, Index const&, int) [192]
                0.01    0.00  270120/12210221     Range::Range(Index const&, Index const&) [131]
                0.42    0.00 11578088/12210221     OffsetNode::forwardSample() [19]
[55]     0.0    0.44    0.00 12210221         Index::operator[](unsigned int) [55]
-----------------------------------------------
                0.01    0.21    6134/12273       Compiler::allocateLogical(ParseTree const*) [59]
                0.01    0.21    6139/12273       Compiler::allocateStochastic(ParseTree const*) [60]
[56]     0.0    0.02    0.41   12273         NodeArray::set(Node*, Range const&) [56]
                0.01    0.10   12273/12273       std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::lower_bound(Range const&) [108]
                0.02    0.06   12273/18405       NodeArray::rangeContainsSetNodes(Range const&) const [107]
                0.04    0.02   12268/12268       printRange(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, Range const&) [141]
                0.01    0.03   24546/5846318     Range::leftOffset(Index const&) const [22]
                0.00    0.04   12273/147955      Graph::add(Node*) [57]
                0.00    0.02   12273/71577       Range::contains(Range const&) const [109]
                0.00    0.02   12273/12273       std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<Range const, Node*>, std::pair<Range const, Node*>&, std::pair<Range const, Node*>*>, std::pair<Range const, Node*> const&) [194]
                0.00    0.01   24546/57266       LeftRangeIterator::operator++() [162]
                0.00    0.01   24546/51137       LeftRangeIterator::LeftRangeIterator(Range const&) [174]
                0.01    0.00   12273/51187       Range::dim(bool) const [143]
                0.00    0.01   24546/83857       LeftRangeIterator::atEnd() const [173]
                0.00    0.00   85911/6374332     Index::~Index() [95]
                0.00    0.00   24546/403140      Index::Index(Index const&) [181]
                0.00    0.00   24546/51137       Index::~Index() [318]
                0.00    0.00   12273/24544       SArray::dim(bool) const [327]
                0.00    0.00   12273/20456       Index::operator!=(Index const&) const [330]
                0.00    0.00   12273/12273       NodeArray::name() const [336]
                0.00    0.00   12273/36861       Node::name() const [321]
                0.00    0.00   12273/12312       SArray::range() const [334]
                0.00    0.00   12273/94079       NodeArray::range() const [315]
                0.00    0.00   12273/12280       Range::operator==(Range const&) const [335]
                0.00    0.00   12273/22538       Node::setName(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [329]
-----------------------------------------------
                0.00    0.00      14/147955      Compiler::Param(ParseTree const*) <cycle 2> [254]
                0.00    0.01    4088/147955      Compiler::getMixtureNode(ParseTree const*) <cycle 2> [80]
                0.00    0.01    4098/147955      Compiler::getLogicalParameter(ParseTree const*) <cycle 2> [54]
                0.00    0.02    6134/147955      Compiler::allocateLogical(ParseTree const*) [59]
                0.00    0.02    6139/147955      Compiler::allocateStochastic(ParseTree const*) [60]
                0.00    0.02    6153/147955      LogicalFactory::getLogicalNode(Function const*, std::vector<Node*, std::allocator<Node*> > const&) [64]
                0.00    0.04   12273/147955      NodeArray::set(Node*, Range const&) [56]
                0.00    0.05   16037/147955      Model::chooseSamplers(std::vector<SamplerFactory const*, std::allocator<SamplerFactory const*> > const&) [28]
                0.00    0.05   18426/147955      Compiler::collectNodes() [142]
                0.00    0.22   74593/147955      classifyNode(Node*, Graph&, Graph&) [51]
[57]     0.0    0.00    0.43  147955         Graph::add(Node*) [57]
                0.01    0.25  147955/670605      Graph::contains(Node*) const [42]
                0.09    0.08  135682/221640      std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::insert_unique(Node* const&) [75]
                0.01    0.00  135682/135682      Node::ref() [214]
-----------------------------------------------
                0.00    0.00      12/19724490     NodeArray::NodeArray(Index const&) [269]
                0.00    0.00    4088/19724490     Compiler::makeSubsetIndex(ParseTree const*, std::vector<SubSetIndex, std::allocator<SubSetIndex> >&, Index const&) <cycle 2> [205]
                0.00    0.00   26634/19724490     SArray::SArray(Index const&) [125]
                0.00    0.00   26670/19724490     Range::length() const [204]
                0.00    0.00   51187/19724490     Range::dim(bool) const [143]
                0.00    0.00   61370/19724490     leftIncrement(Index&, Index const&, Index const&, int) [192]
                0.00    0.00  173821/19724490     Range::ndim(bool) const [203]
                0.01    0.00  239418/19724490     Range::Range(Index const&, Index const&) [131]
                0.03    0.00 1316028/19724490     indexComp(Index const&, Index const&) [79]
                0.13    0.00 5846318/19724490     Range::leftOffset(Index const&) const [22]
                0.26    0.00 11978944/19724490     Range::contains(Index const&) const [25]
[58]     0.0    0.43    0.00 19724490         Index::length() const [58]
-----------------------------------------------
                0.02    0.40    6134/6134        Compiler::traverseTree(ParseTree const*, void (Compiler::*)(ParseTree const*), void (Compiler::*)(ParseTree const*)) [37]
[59]     0.0    0.02    0.40    6134         Compiler::allocateLogical(ParseTree const*) [59]
                0.01    0.21    6134/12273       NodeArray::set(Node*, Range const&) [56]
                0.00    0.05    6134/24546       Compiler::VariableSubsetRange(ParseTree const*) [82]
                0.00    0.03    4090/10244       getFunction(ParseTree const*, FuncTab const&) [122]
                0.00    0.03    6134/12287       LogicalNode::LogicalNode(Function const*, Index const&) [144]
                0.00    0.02    6134/87950       SymTab::getVariable(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [66]
                0.00    0.02    6134/147955      Graph::add(Node*) [57]
                0.00    0.02    2044/2044        getLink(ParseTree const*, FuncTab const&) [197]
                0.00    0.00    6134/51187       Range::dim(bool) const [143]
                0.00    0.00    6134/145241      ParseTree::name() const [183]
                0.00    0.00   12268/321300      ParseTree::parameters() const [180]
                0.00    0.00   18402/6374332     Index::~Index() [95]
                0.00    0.00    6134/302808      ParseTree::treeClass() const [312]
-----------------------------------------------
                0.03    0.38    6139/6139        Compiler::traverseTree(ParseTree const*, void (Compiler::*)(ParseTree const*), void (Compiler::*)(ParseTree const*)) [37]
[60]     0.0    0.03    0.38    6139         Compiler::allocateStochastic(ParseTree const*) [60]
                0.01    0.21    6139/12273       NodeArray::set(Node*, Range const&) [56]
                0.01    0.05    6139/24546       Compiler::VariableSubsetRange(ParseTree const*) [82]
                0.00    0.03    6139/6139        getDistribution(ParseTree const*, DistTab const&) [164]
                0.00    0.03    6139/6139        StochasticNode::StochasticNode(Distribution const*, Index const&) [175]
                0.00    0.02    6139/87950       SymTab::getVariable(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [66]
                0.00    0.02    6139/147955      Graph::add(Node*) [57]
                0.00    0.00    6139/51187       Range::dim(bool) const [143]
                0.00    0.00    6139/145241      ParseTree::name() const [183]
                0.00    0.00   18417/6374332     Index::~Index() [95]
                0.00    0.00    6139/321300      ParseTree::parameters() const [180]
-----------------------------------------------
                               22494             Compiler::Param(ParseTree const*) <cycle 2> [254]
[61]     0.0    0.01    0.36   22494         Compiler::VarGetParameter(ParseTree const*) <cycle 2> [61]
                0.00    0.21   14308/14308       Compiler::getSubSetNode(ParseTree const*) [87]
                0.00    0.08   22494/87950       SymTab::getVariable(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [66]
                0.00    0.06    8186/28626       NodeArray::getSubset(Range const&) [84]
                0.00    0.00   22494/145241      ParseTree::name() const [183]
                0.00    0.00   22494/321300      ParseTree::parameters() const [180]
                0.00    0.00   22494/302808      ParseTree::treeClass() const [312]
                0.00    0.00    8186/94079       NodeArray::range() const [315]
                                2044             Compiler::getMixtureNode(ParseTree const*) <cycle 2> [80]
-----------------------------------------------
                0.00    0.00       1/3879        Console::compile(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, unsigned int) [35]
                0.00    0.00       1/3879        Model::~Model() [259]
                0.00    0.00       1/3879        Model::chooseSamplers(std::vector<SamplerFactory const*, std::allocator<SamplerFactory const*> > const&) [28]
                0.00    0.35    3876/3879        Sampler::classifyChildren(std::set<StochasticNode const*, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> > const&, std::vector<StochasticNode*, std::allocator<StochasticNode*> >&, std::vector<DeterministicNode*, std::allocator<DeterministicNode*> >&) [30]
[62]     0.0    0.00    0.35    3879         Graph::~Graph() [62]
                0.06    0.22  107395/123409      Node::unref() [65]
                0.06    0.00  107395/1184488     std::_Rb_tree_base_iterator::_M_increment() [49]
                0.01    0.00    3879/36664       std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::_M_erase(std::_Rb_tree_node<Node*>*) [110]
-----------------------------------------------
                0.00    0.09   12273/40899       Compiler::VarGetNode(ParseTree const*) [74]
                0.01    0.22   28626/40899       NodeArray::getSubset(Range const&) [84]
[63]     0.0    0.01    0.31   40899         NodeArray::get(Range const&) const [63]
                0.04    0.21   40899/40899       std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::find(Range const&) const [77]
                0.00    0.06   40899/71577       Range::contains(Range const&) const [109]
-----------------------------------------------
                0.03    0.29    6154/6154        Compiler::getLogicalParameter(ParseTree const*) <cycle 2> [54]
[64]     0.0    0.03    0.29    6154         LogicalFactory::getLogicalNode(Function const*, std::vector<Node*, std::allocator<Node*> > const&) [64]
                0.02    0.07    6154/6154        std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::find(std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const&) [118]
                0.01    0.07    6153/6153        std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::lower_bound(std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const&) [123]
                0.00    0.05    6153/12287       LogicalNode::setParameters(std::vector<Node*, std::allocator<Node*> > const&) [112]
                0.00    0.03    6153/12287       LogicalNode::LogicalNode(Function const*, Index const&) [144]
                0.00    0.02    6153/147955      Graph::add(Node*) [57]
                0.00    0.02    6153/6153        std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>&, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>*>, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> const&) [198]
                0.00    0.00    6153/6153        std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>::~pair() [241]
                0.00    0.00    6153/500810      std::_Vector_base<Node*, std::allocator<Node*> >::_Vector_base(unsigned int, std::allocator<Node*> const&) [139]
                0.00    0.00    4106/498763      std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >::~pair() [124]
                0.00    0.00    6153/6153        ScalarFunc::dim(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [248]
                0.00    0.00    4106/248358      ltlogical::operator()(std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >) [182]
                0.00    0.00    6153/6374332     Index::~Index() [95]
                0.00    0.00   10259/10259       std::allocator<Node*>::~allocator() [338]
                0.00    0.00    6153/6153        SArray const** std::fill_n<SArray const**, unsigned int, SArray const*>(SArray const**, unsigned int, SArray const* const&) [347]
                0.00    0.00    6153/18440       Function::checkParameterLength(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [331]
                0.00    0.00    4106/4106        std::vector<Node*, std::allocator<Node*> >::~vector() [353]
                0.00    0.00    4106/4106        std::__simple_alloc<Node*, std::__default_alloc_template<true, 0> >::allocate(unsigned int) [352]
-----------------------------------------------
                0.01    0.03   16014/123409      Graph::remove(Node*) [90]
                0.06    0.22  107395/123409      Graph::~Graph() [62]
[65]     0.0    0.07    0.25  123409         Node::unref() [65]
                0.00    0.11    6153/6153        LogicalNode::~LogicalNode() [113]
                0.00    0.07    4112/4112        ConstantNode::~ConstantNode() [132]
                0.00    0.04    2044/2044        OffsetNode::~OffsetNode() [159]
                0.00    0.04    2044/2044        MixtureNode::~MixtureNode() [160]
-----------------------------------------------
                0.00    0.00       4/87950       Compiler::fillConstants() [146]
                0.00    0.00       4/87950       Compiler::writeValuesToGraph(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, bool) [206]
                0.00    0.00       4/87950       SymTab::writeData(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, bool) [195]
                0.00    0.01    2044/87950       Compiler::getMixtureNode(ParseTree const*) <cycle 2> [80]
                0.00    0.02    6134/87950       Compiler::allocateLogical(ParseTree const*) [59]
                0.00    0.02    6139/87950       Compiler::allocateStochastic(ParseTree const*) [60]
                0.00    0.04   12273/87950       Compiler::VarGetNode(ParseTree const*) [74]
                0.00    0.05   14308/87950       Compiler::getSubSetNode(ParseTree const*) [87]
                0.00    0.08   22494/87950       Compiler::VarGetParameter(ParseTree const*) <cycle 2> [61]
                0.00    0.09   24546/87950       Compiler::VariableSubsetRange(ParseTree const*) [82]
[66]     0.0    0.00    0.32   87950         SymTab::getVariable(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [66]
                0.32    0.00   87950/87950       std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [67]
-----------------------------------------------
                0.32    0.00   87950/87950       SymTab::getVariable(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [66]
[67]     0.0    0.32    0.00   87950         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [67]
-----------------------------------------------
                                  20             void std::__introsort_loop<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, less_sampler) [68]
                0.00    0.31       1/1           Model::chooseSamplers(std::vector<SamplerFactory const*, std::allocator<SamplerFactory const*> > const&) [28]
[68]     0.0    0.00    0.31       1+20      void std::__introsort_loop<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, less_sampler) [68]
                0.03    0.14      20/20          __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > > std::__unguarded_partition<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, Sampler*, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, Sampler*, less_sampler) [93]
                0.00    0.14       1/1           void std::partial_sort<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler) [100]
                0.00    0.00      20/20          Sampler* const& std::__median<Sampler*, less_sampler>(Sampler* const&, Sampler* const&, Sampler* const&, less_sampler) [253]
                                  20             void std::__introsort_loop<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, less_sampler) [68]
-----------------------------------------------
                0.00    0.30       1/1           Model::checkGraph() [52]
[69]     0.0    0.00    0.30       1         Graph::hasCycle() [69]
                0.04    0.25   26626/26626       findDescendant(Node*, Node*, Graph const*, GraphMarks&) [72]
                0.02    0.00   26626/1184488     std::_Rb_tree_base_iterator::_M_increment() [49]
                0.00    0.00       1/1941        GraphMarks::GraphMarks(Graph const&) [89]
                0.00    0.00       1/1941        GraphMarks::~GraphMarks() [135]
-----------------------------------------------
                0.09    0.21   33542/33542       DistReal::logLikelihood(SArray const&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [45]
[70]     0.0    0.09    0.21   33542         DUnif::d(double, std::vector<SArray const*, std::allocator<SArray const*> > const&, bool) const [70]
                0.21    0.00   33542/33542       getParameters(double&, double&, std::vector<SArray const*, std::allocator<SArray const*> > const&) [86]
-----------------------------------------------
                0.00    0.01   12261/576216      std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<Range const, Node*>, std::pair<Range const, Node*>&, std::pair<Range const, Node*>*>, std::pair<Range const, Node*> const&) [194]
                0.00    0.01   12261/576216      std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<Range const, Node*> const&) [207]
                0.02    0.09  202571/576216      std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::lower_bound(Range const&) [108]
                0.03    0.15  349123/576216      std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::find(Range const&) const [77]
[71]     0.0    0.05    0.25  576216         rangeComp(Range const&, Range const&) [71]
                0.10    0.12  576216/658014      indexComp(Index const&, Index const&) [79]
                0.03    0.00 1152432/1293571     Range::lower() const [171]
                0.01    0.00  163596/321087      Range::upper() const [212]
-----------------------------------------------
                               42979             findDescendant(Node*, Node*, Graph const*, GraphMarks&) [72]
                0.04    0.25   26626/26626       Graph::hasCycle() [69]
[72]     0.0    0.04    0.25   26626+42979   findDescendant(Node*, Node*, Graph const*, GraphMarks&) [72]
                0.01    0.10   69605/417237      GraphMarks::mark(Node const*) [50]
                0.00    0.07   42979/670605      Graph::contains(Node*) const [42]
                0.01    0.04   26626/103570      GraphMarks::mark(Node const*, int) [94]
                0.02    0.00   42979/1184488     std::_Rb_tree_base_iterator::_M_increment() [49]
                0.00    0.00   26626/232325      Node::children() const [314]
                               42979             findDescendant(Node*, Node*, Graph const*, GraphMarks&) [72]
-----------------------------------------------
                0.00    0.27       1/1           Console::initialize() [27]
[73]     0.0    0.00    0.27       1         Model::initialize() [73]
                0.00    0.13   12287/12287       LogicalNode::initialize() [103]
                0.08    0.00   71556/128622      Node::isInitialized() [98]
                0.00    0.04    4088/16375       DeterministicNode::initialize() [92]
                0.00    0.02    1929/18304       Node::initialize() [91]
-----------------------------------------------
                0.00    0.13    6134/12273       Compiler::setLogicalParameters(ParseTree const*) [47]
                0.01    0.13    6139/12273       Compiler::setStochasticParameters(ParseTree const*) [46]
[74]     0.0    0.01    0.26   12273         Compiler::VarGetNode(ParseTree const*) [74]
                0.01    0.11   12273/24546       Compiler::VariableSubsetRange(ParseTree const*) [82]
                0.00    0.09   12273/40899       NodeArray::get(Range const&) const [63]
                0.00    0.04   12273/87950       SymTab::getVariable(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [66]
                0.00    0.00   12273/145241      ParseTree::name() const [183]
                0.00    0.00   24546/6374332     Index::~Index() [95]
                0.00    0.00   12273/302808      ParseTree::treeClass() const [312]
-----------------------------------------------
                0.05    0.05   85958/221640      Node::addParent(Node*) [105]
                0.09    0.08  135682/221640      Graph::add(Node*) [57]
[75]     0.0    0.14    0.13  221640         std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::insert_unique(Node* const&) [75]
                0.03    0.09  221640/221640      std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, Node* const&) [104]
                0.00    0.00    8162/26546       std::_Rb_tree_base_iterator::_M_decrement() [219]
-----------------------------------------------
                0.00    0.03    2044/14353       MixtureNode::~MixtureNode() [160]
                0.00    0.03    2044/14353       OffsetNode::~OffsetNode() [159]
                0.01    0.07    4112/14353       ConstantNode::~ConstantNode() [132]
                0.01    0.10    6153/14353       LogicalNode::~LogicalNode() [113]
[76]     0.0    0.02    0.23   14353         Node::~Node() [76]
                0.00    0.23   14353/14353       Node::unlink() [83]
                0.00    0.00   14353/14377       SArray::~SArray() [238]
-----------------------------------------------
                0.04    0.21   40899/40899       NodeArray::get(Range const&) const [63]
[77]     0.0    0.04    0.21   40899         std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::find(Range const&) const [77]
                0.03    0.15  349123/576216      rangeComp(Range const&, Range const&) [71]
                0.01    0.02   81798/658014      indexComp(Index const&, Index const&) [79]
-----------------------------------------------
                               57656             Node::hasDescendant(bool (*)(Node const*)) const [78]
                0.01    0.00    1936/54174       Model::chooseSamplers(std::vector<SamplerFactory const*, std::allocator<SamplerFactory const*> > const&) [28]
                0.18    0.05   52238/54174       classifyNode(Node*, Graph&, Graph&) [51]
[78]     0.0    0.19    0.06   54174+57656   Node::hasDescendant(bool (*)(Node const*)) const [78]
                0.01    0.04  111816/154886      isObserved(Node const*) [129]
                0.00    0.00      96/1184488     std::_Rb_tree_base_iterator::_M_increment() [49]
                               57656             Node::hasDescendant(bool (*)(Node const*)) const [78]
-----------------------------------------------
                0.01    0.02   81798/658014      std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::find(Range const&) const [77]
                0.10    0.12  576216/658014      rangeComp(Range const&, Range const&) [71]
[79]     0.0    0.11    0.13  658014         indexComp(Index const&, Index const&) [79]
                0.11    0.00 2023908/96244414     Index::operator[](unsigned int) const [23]
                0.03    0.00 1316028/19724490     Index::length() const [58]
-----------------------------------------------
                                2044             Compiler::VarGetParameter(ParseTree const*) <cycle 2> [61]
[80]     0.0    0.01    0.22    2044         Compiler::getMixtureNode(ParseTree const*) <cycle 2> [80]
                0.00    0.06    8176/28626       NodeArray::getSubset(Range const&) [84]
                0.00    0.04    2044/2044        MixtureNode::MixtureNode(Node*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > const&) [150]
                0.00    0.02    2044/2044        OffsetNode::OffsetNode(Range const&, std::vector<SubSetIndex, std::allocator<SubSetIndex> > const&) [178]
                0.01    0.01    6132/6132        std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::pair<long, Node*>*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > >, std::pair<long, Node*> const&) [189]
                0.01    0.00    2044/2044        SubSetIndex::checkLimits(std::vector<SubSetIndex, std::allocator<SubSetIndex> > const&, std::vector<SubSetIndex, std::allocator<SubSetIndex> > const&) [201]
                0.00    0.01    8176/5846318     Range::leftOffset(Index const&) const [22]
                0.00    0.01    4088/147955      Graph::add(Node*) [57]
                0.01    0.00   10220/79806       Range::Range(Index const&, Index const&) [131]
                0.00    0.01    2044/87950       SymTab::getVariable(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [66]
                0.00    0.00    8176/57266       LeftRangeIterator::operator++() [162]
                0.00    0.00    8176/20440       SubSetIndex::node() const [220]
                0.00    0.00  110376/12210221     Index::operator[](unsigned int) [55]
                0.00    0.00   10220/83857       LeftRangeIterator::atEnd() const [173]
                0.00    0.00    2044/51137       LeftRangeIterator::LeftRangeIterator(Range const&) [174]
                0.00    0.00   10220/6044854     Index::Index(unsigned int) [53]
                0.00    0.00   34748/6374332     Index::~Index() [95]
                0.00    0.00   10220/321300      ParseTree::parameters() const [180]
                0.00    0.00    8176/96244414     Index::operator[](unsigned int) const [23]
                0.00    0.00    2044/145241      ParseTree::name() const [183]
                0.00    0.00    8176/1293571     Range::lower() const [171]
                0.00    0.00    4088/321087      Range::upper() const [212]
                0.00    0.00   10220/94079       NodeArray::range() const [315]
                0.00    0.00    6132/302808      ParseTree::treeClass() const [312]
                0.00    0.00    4088/8176        std::vector<SubSetIndex, std::allocator<SubSetIndex> >::_M_insert_aux(__gnu_cxx::__normal_iterator<SubSetIndex*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, SubSetIndex const&) [339]
                0.00    0.00    2044/51137       Index::~Index() [318]
                                4088             Compiler::makeSubsetIndex(ParseTree const*, std::vector<SubSetIndex, std::allocator<SubSetIndex> >&, Index const&) <cycle 2> [205]
-----------------------------------------------
                0.02    0.21       1/1           Model::checkGraph() [52]
[81]     0.0    0.02    0.21       1         Graph::isClosed() [81]
                0.01    0.14   85958/670605      Graph::contains(Node*) const [42]
                0.06    0.00  112584/1184488     std::_Rb_tree_base_iterator::_M_increment() [49]
                0.00    0.00   26626/236427      Node::parents() const [313]
                0.00    0.00   26626/232325      Node::children() const [314]
-----------------------------------------------
                0.00    0.05    6134/24546       Compiler::allocateLogical(ParseTree const*) [59]
                0.01    0.05    6139/24546       Compiler::allocateStochastic(ParseTree const*) [60]
                0.01    0.11   12273/24546       Compiler::VarGetNode(ParseTree const*) [74]
[82]     0.0    0.02    0.21   24546         Compiler::VariableSubsetRange(ParseTree const*) [82]
                0.00    0.09   24546/87950       SymTab::getVariable(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [66]
                0.02    0.06   24536/42956       Compiler::getRange(std::vector<ParseTree*, std::allocator<ParseTree*> > const&, Range const&, Range&) <cycle 1> [116]
                0.02    0.00   24546/38862       Range::Range() [158]
                0.01    0.00   24546/67494       CounterTab::getCounter(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [154]
                0.00    0.00   24546/145241      ParseTree::name() const [183]
                0.00    0.00   49092/403140      Index::Index(Index const&) [181]
                0.00    0.00   24536/173821      Range::ndim(bool) const [203]
                0.00    0.00   24546/321300      ParseTree::parameters() const [180]
                0.00    0.00   49092/6374332     Index::~Index() [95]
                0.00    0.00   49082/94079       NodeArray::range() const [315]
                0.00    0.00   24546/302808      ParseTree::treeClass() const [312]
-----------------------------------------------
                0.00    0.23   14353/14353       Node::~Node() [76]
[83]     0.0    0.00    0.23   14353         Node::unlink() [83]
                0.00    0.14   34803/50817       std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::erase(Node* const&) [88]
                0.07    0.00   24581/36664       std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::_M_erase(std::_Rb_tree_node<Node*>*) [110]
                0.02    0.00   34803/1184488     std::_Rb_tree_base_iterator::_M_increment() [49]
-----------------------------------------------
                0.00    0.06    8176/28626       Compiler::getMixtureNode(ParseTree const*) <cycle 2> [80]
                0.00    0.06    8186/28626       Compiler::VarGetParameter(ParseTree const*) <cycle 2> [61]
                0.00    0.10   12264/28626       Compiler::getSubSetNode(ParseTree const*) [87]
[84]     0.0    0.00    0.23   28626         NodeArray::getSubset(Range const&) [84]
                0.01    0.22   28626/40899       NodeArray::get(Range const&) const [63]
-----------------------------------------------
                0.00    0.00      30/124618      void std::__insertion_sort<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler) [257]
                0.00    0.00     100/124618      Sampler* const& std::__median<Sampler*, less_sampler>(Sampler* const&, Sampler* const&, Sampler* const&, less_sampler) [253]
                0.01    0.00    3912/124618      void std::__unguarded_linear_insert<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, Sampler*, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, Sampler*, less_sampler) [230]
                0.01    0.00    8276/124618      void std::__push_heap<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, Sampler*, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, int, Sampler*, less_sampler) [149]
                0.06    0.00   35768/124618      void std::__adjust_heap<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, Sampler*, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, int, Sampler*, less_sampler) [99]
                0.13    0.00   76532/124618      __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > > std::__unguarded_partition<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, Sampler*, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, Sampler*, less_sampler) [93]
[85]     0.0    0.21    0.00  124618         std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::find(Node const* const&) const [85]
-----------------------------------------------
                0.21    0.00   33542/33542       DUnif::d(double, std::vector<SArray const*, std::allocator<SArray const*> > const&, bool) const [70]
[86]     0.0    0.21    0.00   33542         getParameters(double&, double&, std::vector<SArray const*, std::allocator<SArray const*> > const&) [86]
-----------------------------------------------
                0.00    0.21   14308/14308       Compiler::VarGetParameter(ParseTree const*) <cycle 2> [61]
[87]     0.0    0.00    0.21   14308         Compiler::getSubSetNode(ParseTree const*) [87]
                0.00    0.10   12264/28626       NodeArray::getSubset(Range const&) [84]
                0.00    0.05   14308/87950       SymTab::getVariable(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [66]
                0.01    0.03   14308/42956       Compiler::getRange(std::vector<ParseTree*, std::allocator<ParseTree*> > const&, Range const&, Range&) <cycle 1> [116]
                0.01    0.00   14308/38862       Range::Range() [158]
                0.00    0.00   14308/145241      ParseTree::name() const [183]
                0.00    0.00   14308/321300      ParseTree::parameters() const [180]
                0.00    0.00   28616/6374332     Index::~Index() [95]
                0.00    0.00   14308/302808      ParseTree::treeClass() const [312]
                0.00    0.00   14308/94079       NodeArray::range() const [315]
-----------------------------------------------
                0.00    0.06   16014/50817       Graph::remove(Node*) [90]
                0.00    0.14   34803/50817       Node::unlink() [83]
[88]     0.0    0.00    0.20   50817         std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::erase(Node* const&) [88]
                0.00    0.08   50817/50817       std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::erase(std::_Rb_tree_iterator<Node*, Node*&, Node**>, std::_Rb_tree_iterator<Node*, Node*&, Node**>) [127]
                0.06    0.00   50817/50817       std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::lower_bound(Node* const&) [140]
                0.03    0.00   50817/50817       std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::upper_bound(Node* const&) [170]
                0.03    0.00   50817/1184488     std::_Rb_tree_base_iterator::_M_increment() [49]
-----------------------------------------------
                0.00    0.00       1/1941        Graph::hasCycle() [69]
                0.01    0.19    1940/1941        Graph::getSortedNodes(std::vector<Node*, std::allocator<Node*> >&) [38]
[89]     0.0    0.01    0.19    1941         GraphMarks::GraphMarks(Graph const&) [89]
                0.01    0.07  103570/103570      std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::insert_unique(std::_Rb_tree_iterator<std::pair<Node const* const, int>, std::pair<Node const* const, int>&, std::pair<Node const* const, int>*>, std::pair<Node const* const, int> const&) [128]
                0.06    0.00  103570/1184488     std::_Rb_tree_base_iterator::_M_increment() [49]
                0.05    0.00  103570/103570      std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::lower_bound(Node const* const&) [145]
                0.00    0.00    1941/1941        Graph::nodes() const [362]
-----------------------------------------------
                0.01    0.18   42011/42011       Model::chooseSamplers(std::vector<SamplerFactory const*, std::allocator<SamplerFactory const*> > const&) [28]
[90]     0.0    0.01    0.18   42011         Graph::remove(Node*) [90]
                0.00    0.07   42011/670605      Graph::contains(Node*) const [42]
                0.00    0.06   16014/50817       std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::erase(Node* const&) [88]
                0.01    0.03   16014/123409      Node::unref() [65]
-----------------------------------------------
                0.00    0.02    1929/18304       Model::initialize() [73]
                0.01    0.15   16375/18304       DeterministicNode::initialize() [92]
[91]     0.0    0.01    0.17   18304         Node::initialize() [91]
                0.03    0.07   18304/18304       Node::canInitialize() [117]
                0.01    0.03   12287/141065291     LogicalNode::forwardSample() [10]
                0.02    0.00   18304/128622      Node::isInitialized() [98]
                0.00    0.01    2044/51221032     MixtureNode::forwardSample() [13]
                0.00    0.01    2044/5789044     OffsetNode::forwardSample() [19]
                0.00    0.00    1929/1929        StochasticNode::forwardSample() [251]
-----------------------------------------------
                0.00    0.04    4088/16375       Model::initialize() [73]
                0.00    0.13   12287/16375       LogicalNode::initialize() [103]
[92]     0.0    0.00    0.17   16375         DeterministicNode::initialize() [92]
                0.01    0.15   16375/18304       Node::initialize() [91]
                0.00    0.01   18772/154886      isObserved(Node const*) [129]
                0.00    0.00    4671/1184488     std::_Rb_tree_base_iterator::_M_increment() [49]
                0.00    0.00    2274/10589       SArray::setFixed(bool) [222]
                0.00    0.00   37421/236427      Node::parents() const [313]
-----------------------------------------------
                0.03    0.14      20/20          void std::__introsort_loop<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, less_sampler) [68]
[93]     0.0    0.03    0.14      20         __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > > std::__unguarded_partition<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, Sampler*, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, Sampler*, less_sampler) [93]
                0.13    0.00   76532/124618      std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::find(Node const* const&) const [85]
                0.01    0.00   76532/126554      Sampler::nodes() const [185]
-----------------------------------------------
                0.01    0.04   26626/103570      findDescendant(Node*, Node*, Graph const*, GraphMarks&) [72]
                0.01    0.11   76944/103570      Graph::getSortedNodes(std::vector<Node*, std::allocator<Node*> >&) [38]
[94]     0.0    0.02    0.15  103570         GraphMarks::mark(Node const*, int) [94]
                0.15    0.00  103570/520807      std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::find(Node const* const&) [48]
-----------------------------------------------
                0.00    0.00       3/6374332     Compiler::writeValuesToGraph(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, bool) [206]
                0.00    0.00       4/6374332     SymTab::writeData(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, bool) [195]
                0.00    0.00       8/6374332     readRData(std::vector<ParseTree*, std::allocator<ParseTree*> > const*, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >&) [249]
                0.00    0.00      12/6374332     Compiler::declareVariables(std::vector<ParseTree*, std::allocator<ParseTree*> > const&) [263]
                0.00    0.00      12/6374332     NodeArray::NodeArray(Index const&) [269]
                0.00    0.00      16/6374332     Compiler::constantExpression(ParseTree const*, double&) <cycle 1> [161]
                0.00    0.00      16/6374332     Compiler::CounterRange(ParseTree const*) [261]
                0.00    0.00      16/6374332     Compiler::traverseTree(ParseTree const*, void (Compiler::*)(ParseTree const*), void (Compiler::*)(ParseTree const*)) [37]
                0.00    0.00    2044/6374332     OffsetNode::OffsetNode(Range const&, std::vector<SubSetIndex, std::allocator<SubSetIndex> > const&) [178]
                0.00    0.00    4088/6374332     OffsetNode::~OffsetNode() [159]
                0.00    0.00    4112/6374332     ConstantNode::ConstantNode(double) [179]
                0.00    0.00    6153/6374332     LogicalFactory::getLogicalNode(Function const*, std::vector<Node*, std::allocator<Node*> > const&) [64]
                0.00    0.00   12270/6374332     Compiler::fillConstants() [146]
                0.00    0.00   12278/6374332     NodeArray::setValue(SArray const&, bool) [172]
                0.00    0.00   12284/6374332     Range::dim(bool) const [143]
                0.00    0.00   18402/6374332     Compiler::allocateLogical(ParseTree const*) [59]
                0.00    0.00   18417/6374332     Compiler::allocateStochastic(ParseTree const*) [60]
                0.00    0.00   24546/6374332     Compiler::VarGetNode(ParseTree const*) [74]
                0.00    0.00   26634/6374332     SArray::SArray(Index const&) [125]
                0.00    0.00   28616/6374332     Compiler::getSubSetNode(ParseTree const*) [87]
                0.00    0.00   34748/6374332     Compiler::getMixtureNode(ParseTree const*) <cycle 2> [80]
                0.00    0.00   36810/6374332     NodeArray::rangeContainsSetNodes(Range const&) const [107]
                0.00    0.00   49092/6374332     Compiler::VariableSubsetRange(ParseTree const*) [82]
                0.00    0.00   57508/6374332     SArray::~SArray() [238]
                0.00    0.00   85911/6374332     NodeArray::set(Node*, Range const&) [56]
                0.00    0.00  151288/6374332     Compiler::getRange(std::vector<ParseTree*, std::allocator<ParseTree*> > const&, Range const&, Range&) <cycle 1> [116]
                0.15    0.00 5789044/6374332     OffsetNode::forwardSample() [19]
[95]     0.0    0.16    0.00 6374332         Index::~Index() [95]
-----------------------------------------------
                0.02    0.00    7000/53247       DistReal::lowerLimit(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [157]
                0.13    0.00   46247/53247       DistReal::logLikelihood(SArray const&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [45]
[96]     0.0    0.15    0.00   53247         Distribution::lowerBound(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [96]
-----------------------------------------------
                0.00    0.00       6/392644      std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> const&) [292]
                0.00    0.00       8/392644      std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> const&) [282]
                0.00    0.00       8/392644      std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> const&) [290]
                0.00    0.00      12/392644      std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> const&) [287]
                0.00    0.00      21/392644      std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> const&) [284]
                0.00    0.00      23/392644      std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> const&) [280]
                0.00    0.00      32/392644      std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> const&) [273]
                0.00    0.00    1936/392644      std::_Rb_tree<StochasticNode*, StochasticNode*, std::_Identity<StochasticNode*>, std::less<StochasticNode*>, std::allocator<StochasticNode*> >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, StochasticNode* const&) [247]
                0.00    0.00    1938/392644      std::_Rb_tree<StochasticNode const*, StochasticNode const*, std::_Identity<StochasticNode const*>, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, StochasticNode const* const&) [246]
                0.00    0.00    6153/392644      std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> const&) [231]
                0.00    0.00    8176/392644      std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<long const, Node*> const&) [234]
                0.00    0.00   10222/392644      std::_Rb_tree<SArray const*, SArray const*, std::_Identity<SArray const*>, std::less<SArray const*>, std::allocator<SArray const*> >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, SArray const* const&) [202]
                0.00    0.00   12273/392644      std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<Range const, Node*> const&) [207]
                0.04    0.01  130196/392644      std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<Node const* const, int> const&) [126]
                0.06    0.02  221640/392644      std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, Node* const&) [104]
[97]     0.0    0.11    0.04  392644         std::_Rb_tree_rebalance(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&) [97]
                0.04    0.00  267893/279074      std::_Rb_tree_rotate_left(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&) [153]
                0.00    0.00   25585/33891       std::_Rb_tree_rotate_right(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&) [324]
-----------------------------------------------
                0.02    0.00   18304/128622      Node::initialize() [91]
                0.04    0.00   38762/128622      Node::canInitialize() [117]
                0.08    0.00   71556/128622      Model::initialize() [73]
[98]     0.0    0.14    0.00  128622         Node::isInitialized() [98]
                0.00    0.00  128622/51408928     SArray::length() const [40]
-----------------------------------------------
                0.01    0.04     945/2834        void std::make_heap<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler) [147]
                0.02    0.07    1889/2834        void std::sort_heap<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler) [119]
[99]     0.0    0.03    0.11    2834         void std::__adjust_heap<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, Sampler*, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, int, Sampler*, less_sampler) [99]
                0.06    0.00   35768/124618      std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::find(Node const* const&) const [85]
                0.03    0.02    2834/2834        void std::__push_heap<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, Sampler*, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, int, Sampler*, less_sampler) [149]
                0.01    0.00   35768/126554      Sampler::nodes() const [185]
-----------------------------------------------
                0.00    0.14       1/1           void std::__introsort_loop<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, less_sampler) [68]
[100]    0.0    0.00    0.14       1         void std::partial_sort<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler) [100]
                0.00    0.09       1/1           void std::sort_heap<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler) [119]
                0.00    0.05       1/1           void std::make_heap<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler) [147]
-----------------------------------------------
                0.00    0.00    1936/5829150     Model::chooseSamplers(std::vector<SamplerFactory const*, std::allocator<SamplerFactory const*> > const&) [28]
                0.14    0.00 5827214/5829150     GibbsSampler::setValue(double const*, long) [6]
[101]    0.0    0.14    0.00 5829150         Sampler::deterministicChildren() const [101]
-----------------------------------------------
[102]    0.0    0.03    0.10   42956+81824   <cycle 1 as a whole> [102]
                0.00    0.03   42964             Compiler::constantExpression(ParseTree const*, double&) <cycle 1> [161]
                0.00    0.00   42964             Compiler::indexExpression(ParseTree const*, long&) <cycle 1> [320]
-----------------------------------------------
                0.00    0.13   12287/12287       Model::initialize() [73]
[103]    0.0    0.00    0.13   12287         LogicalNode::initialize() [103]
                0.00    0.13   12287/16375       DeterministicNode::initialize() [92]
-----------------------------------------------
                0.03    0.09  221640/221640      std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::insert_unique(Node* const&) [75]
[104]    0.0    0.03    0.09  221640         std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, Node* const&) [104]
                0.06    0.02  221640/392644      std::_Rb_tree_rebalance(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&) [97]
                0.01    0.00  221640/221640      std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::_M_create_node(Node* const&) [213]
-----------------------------------------------
                0.00    0.01    4088/42979       OffsetNode::OffsetNode(Range const&, std::vector<SubSetIndex, std::allocator<SubSetIndex> > const&) [178]
                0.00    0.01    6146/42979       StochasticNode::setParameters(std::vector<Node*, std::allocator<Node*> > const&) [148]
                0.00    0.02   10220/42979       MixtureNode::MixtureNode(Node*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > const&) [150]
                0.01    0.05   22525/42979       LogicalNode::setParameters(std::vector<Node*, std::allocator<Node*> > const&) [112]
[105]    0.0    0.02    0.10   42979         Node::addParent(Node*) [105]
                0.05    0.05   85958/221640      std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::insert_unique(Node* const&) [75]
-----------------------------------------------
                0.12    0.00   12705/12705       DistReal::logLikelihood(SArray const&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [45]
[106]    0.0    0.12    0.00   12705         DNorm::d(double, std::vector<SArray const*, std::allocator<SArray const*> > const&, bool) const [106]
-----------------------------------------------
                0.01    0.03    6132/18405       Compiler::fillConstants() [146]
                0.02    0.06   12273/18405       NodeArray::set(Node*, Range const&) [56]
[107]    0.0    0.03    0.09   18405         NodeArray::rangeContainsSetNodes(Range const&) const [107]
                0.01    0.02   18405/5846318     Range::leftOffset(Index const&) const [22]
                0.00    0.03   18405/71577       Range::contains(Range const&) const [109]
                0.00    0.01   30678/83857       LeftRangeIterator::atEnd() const [173]
                0.00    0.01   18405/51137       LeftRangeIterator::LeftRangeIterator(Range const&) [174]
                0.00    0.00   12273/57266       LeftRangeIterator::operator++() [162]
                0.00    0.00   36810/6374332     Index::~Index() [95]
                0.00    0.00   18405/51137       Index::~Index() [318]
-----------------------------------------------
                0.01    0.10   12273/12273       NodeArray::set(Node*, Range const&) [56]
[108]    0.0    0.01    0.10   12273         std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::lower_bound(Range const&) [108]
                0.02    0.09  202571/576216      rangeComp(Range const&, Range const&) [71]
-----------------------------------------------
                0.00    0.02   12273/71577       NodeArray::set(Node*, Range const&) [56]
                0.00    0.03   18405/71577       NodeArray::rangeContainsSetNodes(Range const&) const [107]
                0.00    0.06   40899/71577       NodeArray::get(Range const&) const [63]
[109]    0.0    0.00    0.11   71577         Range::contains(Range const&) const [109]
                0.05    0.07  143154/5989472     Range::contains(Index const&) const [25]
-----------------------------------------------
                              150402             std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::_M_erase(std::_Rb_tree_node<Node*>*) [110]
                0.01    0.00    3879/36664       Graph::~Graph() [62]
                0.02    0.00    8204/36664       std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::erase(std::_Rb_tree_iterator<Node*, Node*&, Node**>, std::_Rb_tree_iterator<Node*, Node*&, Node**>) [127]
                0.07    0.00   24581/36664       Node::unlink() [83]
[110]    0.0    0.11    0.00   36664+150402  std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::_M_erase(std::_Rb_tree_node<Node*>*) [110]
                              150402             std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::_M_erase(std::_Rb_tree_node<Node*>*) [110]
-----------------------------------------------
                0.00    0.01    4112/26626       ConstantNode::ConstantNode(double) [179]
                0.01    0.02    6139/26626       StochasticNode::StochasticNode(Distribution const*, Index const&) [175]
                0.02    0.05   16375/26626       DeterministicNode::DeterministicNode(Index const&) [138]
[111]    0.0    0.03    0.08   26626         Node::Node(Index const&) [111]
                0.01    0.07   26626/26634       SArray::SArray(Index const&) [125]
-----------------------------------------------
                0.00    0.05    6134/12287       Compiler::setLogicalParameters(ParseTree const*) [47]
                0.00    0.05    6153/12287       LogicalFactory::getLogicalNode(Function const*, std::vector<Node*, std::allocator<Node*> > const&) [64]
[112]    0.0    0.00    0.11   12287         LogicalNode::setParameters(std::vector<Node*, std::allocator<Node*> > const&) [112]
                0.01    0.05   22525/42979       Node::addParent(Node*) [105]
                0.02    0.00   22525/40942       std::vector<SArray const*, std::allocator<SArray const*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<SArray const**, std::vector<SArray const*, std::allocator<SArray const*> > >, SArray const* const&) [155]
                0.01    0.01    6153/6153        makeName(Function const*, std::vector<Node*, std::allocator<Node*> > const&) [191]
                0.00    0.00   12287/12287       ScalarFunc::checkDim(SArray const&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [242]
                0.00    0.00   12287/18440       Function::checkParameterLength(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [331]
                0.00    0.00   12287/36861       Node::name() const [321]
                0.00    0.00    6153/22538       Node::setName(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [329]
-----------------------------------------------
                0.00    0.11    6153/6153        Node::unref() [65]
[113]    0.0    0.00    0.11    6153         LogicalNode::~LogicalNode() [113]
                0.01    0.10    6153/14353       Node::~Node() [76]
-----------------------------------------------
                0.00    0.00   28000/5815000     SliceSampler::update() [21]
                0.10    0.00 5787000/5815000     FiniteSampler::update() [5]
[114]    0.0    0.10    0.00 5815000         GibbsSampler::node() [114]
-----------------------------------------------
                0.00    0.00   14000/3872000     SliceSampler::update() [21]
                0.10    0.00 3858000/3872000     FiniteSampler::update() [5]
[115]    0.0    0.10    0.00 3872000         StochasticNode::parameters() const [115]
-----------------------------------------------
                                   8             Compiler::constantExpression(ParseTree const*, double&) <cycle 1> [161]
                0.01    0.03   14308/42956       Compiler::getSubSetNode(ParseTree const*) [87]
                0.02    0.06   24536/42956       Compiler::VariableSubsetRange(ParseTree const*) [82]
[116]    0.0    0.03    0.07   38852         Compiler::getRange(std::vector<ParseTree*, std::allocator<ParseTree*> > const&, Range const&, Range&) <cycle 1> [116]
                0.02    0.01   36800/79806       Range::Range(Index const&, Index const&) [131]
                0.01    0.00   73616/73616       Index::operator=(Index const&) [216]
                0.01    0.00   77688/6044854     Index::Index(unsigned int) [53]
                0.00    0.00   77704/321300      ParseTree::parameters() const [180]
                0.00    0.00  112468/12210221     Index::operator[](unsigned int) [55]
                0.00    0.00  151288/6374332     Index::~Index() [95]
                0.00    0.00   38844/173821      Range::ndim(bool) const [203]
                0.00    0.00   40896/302808      ParseTree::treeClass() const [312]
                               38852             Compiler::indexExpression(ParseTree const*, long&) <cycle 1> [320]
-----------------------------------------------
                0.03    0.07   18304/18304       Node::initialize() [91]
[117]    0.0    0.03    0.07   18304         Node::canInitialize() [117]
                0.04    0.00   38762/128622      Node::isInitialized() [98]
                0.02    0.00   38762/1184488     std::_Rb_tree_base_iterator::_M_increment() [49]
-----------------------------------------------
                0.02    0.07    6154/6154        LogicalFactory::getLogicalNode(Function const*, std::vector<Node*, std::allocator<Node*> > const&) [64]
[118]    0.0    0.02    0.07    6154         std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::find(std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const&) [118]
                0.04    0.00  231984/498763      std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >::~pair() [124]
                0.03    0.00  231984/500810      std::_Vector_base<Node*, std::allocator<Node*> >::_Vector_base(unsigned int, std::allocator<Node*> const&) [139]
                0.01    0.00  115992/248358      ltlogical::operator()(std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >) [182]
-----------------------------------------------
                0.00    0.09       1/1           void std::partial_sort<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler) [100]
[119]    0.0    0.00    0.09       1         void std::sort_heap<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler) [119]
                0.02    0.07    1889/2834        void std::__adjust_heap<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, Sampler*, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, int, Sampler*, less_sampler) [99]
-----------------------------------------------
                0.00    0.00    1941/28567       std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::insert_unique(std::_Rb_tree_iterator<std::pair<Node const* const, int>, std::pair<Node const* const, int>&, std::pair<Node const* const, int>*>, std::pair<Node const* const, int> const&) [128]
                0.07    0.02   26626/28567       Model::chooseSamplers(std::vector<SamplerFactory const*, std::allocator<SamplerFactory const*> > const&) [28]
[120]    0.0    0.07    0.02   28567         std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::insert_unique(std::pair<Node const* const, int> const&) [120]
                0.00    0.02   28567/130196      std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<Node const* const, int> const&) [126]
                0.00    0.00   10229/26546       std::_Rb_tree_base_iterator::_M_decrement() [219]
-----------------------------------------------
                0.01    0.00    2044/12288       FuncTab::findInverse(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [200]
                0.08    0.00   10244/12288       FuncTab::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [130]
[121]    0.0    0.09    0.00   12288         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [121]
-----------------------------------------------
                0.00    0.03    4090/10244       Compiler::allocateLogical(ParseTree const*) [59]
                0.00    0.05    6154/10244       Compiler::getLogicalParameter(ParseTree const*) <cycle 2> [54]
[122]    0.0    0.00    0.09   10244         getFunction(ParseTree const*, FuncTab const&) [122]
                0.00    0.08   10244/10244       FuncTab::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [130]
                0.01    0.00   10240/10240       ParseTree::getOperator() const [223]
                0.00    0.00       4/145241      ParseTree::name() const [183]
                0.00    0.00   10244/302808      ParseTree::treeClass() const [312]
-----------------------------------------------
                0.01    0.07    6153/6153        LogicalFactory::getLogicalNode(Function const*, std::vector<Node*, std::allocator<Node*> > const&) [64]
[123]    0.0    0.01    0.07    6153         std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::lower_bound(std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const&) [123]
                0.04    0.00  223726/498763      std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >::~pair() [124]
                0.03    0.00  223726/500810      std::_Vector_base<Node*, std::allocator<Node*> >::_Vector_base(unsigned int, std::allocator<Node*> const&) [139]
                0.01    0.00  111863/248358      ltlogical::operator()(std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >) [182]
-----------------------------------------------
                0.00    0.00    4106/498763      LogicalFactory::getLogicalNode(Function const*, std::vector<Node*, std::allocator<Node*> > const&) [64]
                0.00    0.00    6153/498763      std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>::~pair() [241]
                0.00    0.00   12282/498763      std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> const&) [231]
                0.00    0.00   20512/498763      std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>&, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>*>, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> const&) [198]
                0.04    0.00  223726/498763      std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::lower_bound(std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const&) [123]
                0.04    0.00  231984/498763      std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::find(std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const&) [118]
[124]    0.0    0.08    0.00  498763         std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >::~pair() [124]
-----------------------------------------------
                0.00    0.00       8/26634       readRData(std::vector<ParseTree*, std::allocator<ParseTree*> > const*, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >&) [249]
                0.01    0.07   26626/26634       Node::Node(Index const&) [111]
[125]    0.0    0.01    0.07   26634         SArray::SArray(Index const&) [125]
                0.02    0.01   26634/51187       Range::dim(bool) const [143]
                0.02    0.01   26634/79806       Range::Range(Index const&, Index const&) [131]
                0.01    0.00   26634/26670       Range::length() const [204]
                0.00    0.00   26634/6044854     Index::Index(unsigned int) [53]
                0.00    0.00   26634/403140      Index::Index(Index const&) [181]
                0.00    0.00   26634/6374332     Index::~Index() [95]
                0.00    0.00   26634/19724490     Index::length() const [58]
-----------------------------------------------
                0.00    0.02   28567/130196      std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::insert_unique(std::pair<Node const* const, int> const&) [120]
                0.01    0.05  101629/130196      std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::insert_unique(std::_Rb_tree_iterator<std::pair<Node const* const, int>, std::pair<Node const* const, int>&, std::pair<Node const* const, int>*>, std::pair<Node const* const, int> const&) [128]
[126]    0.0    0.01    0.07  130196         std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<Node const* const, int> const&) [126]
                0.04    0.01  130196/392644      std::_Rb_tree_rebalance(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&) [97]
                0.02    0.00  130196/130196      std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::_M_create_node(std::pair<Node const* const, int> const&) [184]
-----------------------------------------------
                0.00    0.08   50817/50817       std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::erase(Node* const&) [88]
[127]    0.0    0.00    0.08   50817         std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::erase(std::_Rb_tree_iterator<Node*, Node*&, Node**>, std::_Rb_tree_iterator<Node*, Node*&, Node**>) [127]
                0.03    0.00   42613/44549       std::_Rb_tree_rebalance_for_erase(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&, std::_Rb_tree_node_base*&, std::_Rb_tree_node_base*&) [163]
                0.02    0.00    8204/36664       std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::_M_erase(std::_Rb_tree_node<Node*>*) [110]
                0.02    0.00   42613/1184488     std::_Rb_tree_base_iterator::_M_increment() [49]
-----------------------------------------------
                0.01    0.07  103570/103570      GraphMarks::GraphMarks(Graph const&) [89]
[128]    0.0    0.01    0.07  103570         std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::insert_unique(std::_Rb_tree_iterator<std::pair<Node const* const, int>, std::pair<Node const* const, int>&, std::pair<Node const* const, int>*>, std::pair<Node const* const, int> const&) [128]
                0.01    0.05  101629/130196      std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<Node const* const, int> const&) [126]
                0.00    0.00    1941/28567       std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::insert_unique(std::pair<Node const* const, int> const&) [120]
-----------------------------------------------
                0.00    0.01   18772/154886      DeterministicNode::initialize() [92]
                0.00    0.01   24298/154886      classifyNode(Node*, Graph&, Graph&) [51]
                0.01    0.04  111816/154886      Node::hasDescendant(bool (*)(Node const*)) const [78]
[129]    0.0    0.02    0.06  154886         isObserved(Node const*) [129]
                0.06    0.00  154886/187651      SArray::isFixed() const [133]
-----------------------------------------------
                0.00    0.08   10244/10244       getFunction(ParseTree const*, FuncTab const&) [122]
[130]    0.0    0.00    0.08   10244         FuncTab::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [130]
                0.08    0.00   10244/12288       std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [121]
-----------------------------------------------
                0.00    0.00       8/79806       Compiler::CounterRange(ParseTree const*) [261]
                0.00    0.00      12/79806       NodeArray::NodeArray(Index const&) [269]
                0.00    0.00    6132/79806       Compiler::fillConstants() [146]
                0.01    0.00   10220/79806       Compiler::getMixtureNode(ParseTree const*) <cycle 2> [80]
                0.02    0.01   26634/79806       SArray::SArray(Index const&) [125]
                0.02    0.01   36800/79806       Compiler::getRange(std::vector<ParseTree*, std::allocator<ParseTree*> > const&, Range const&, Range&) <cycle 1> [116]
[131]    0.0    0.05    0.02   79806         Range::Range(Index const&, Index const&) [131]
                0.01    0.00  270120/12210221     Index::operator[](unsigned int) [55]
                0.01    0.00  159612/403140      Index::Index(Index const&) [181]
                0.01    0.00  239418/19724490     Index::length() const [58]
-----------------------------------------------
                0.00    0.07    4112/4112        Node::unref() [65]
[132]    0.0    0.00    0.07    4112         ConstantNode::~ConstantNode() [132]
                0.01    0.07    4112/14353       Node::~Node() [76]
-----------------------------------------------
                0.01    0.00   32765/187651      Model::chooseSamplers(std::vector<SamplerFactory const*, std::allocator<SamplerFactory const*> > const&) [28]
                0.06    0.00  154886/187651      isObserved(Node const*) [129]
[133]    0.0    0.07    0.00  187651         SArray::isFixed() const [133]
-----------------------------------------------
                              130196             std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::_M_erase(std::_Rb_tree_node<std::pair<Node const* const, int> >*) [134]
                0.00    0.00       1/1942        __tcf_0 [265]
                0.07    0.00    1941/1942        GraphMarks::~GraphMarks() [135]
[134]    0.0    0.07    0.00    1942+130196  std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::_M_erase(std::_Rb_tree_node<std::pair<Node const* const, int> >*) [134]
                              130196             std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::_M_erase(std::_Rb_tree_node<std::pair<Node const* const, int> >*) [134]
-----------------------------------------------
                0.00    0.00       1/1941        Graph::hasCycle() [69]
                0.00    0.07    1940/1941        Graph::getSortedNodes(std::vector<Node*, std::allocator<Node*> >&) [38]
[135]    0.0    0.00    0.07    1941         GraphMarks::~GraphMarks() [135]
                0.07    0.00    1941/1942        std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::_M_erase(std::_Rb_tree_node<std::pair<Node const* const, int> >*) [134]
-----------------------------------------------
                0.00    0.07    1936/1936        GibbsFactory::makeSampler(std::set<StochasticNode*, std::less<StochasticNode*>, std::allocator<StochasticNode*> >&, std::vector<Sampler*, std::allocator<Sampler*> >&) const [29]
[136]    0.0    0.00    0.07    1936         ConjugateFactory::canSample(StochasticNode const*) const [136]
                0.01    0.06       2/2           ConjugateNormal::canSample(StochasticNode const*) [137]
                0.00    0.00    1936/1941812     StochasticNode::distribution() const [39]
                0.00    0.00    1936/1963        Distribution::name() const [361]
                0.00    0.00    1936/1936        std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [366]
-----------------------------------------------
                0.01    0.06       2/2           ConjugateFactory::canSample(StochasticNode const*) const [136]
[137]    0.0    0.01    0.06       2         ConjugateNormal::canSample(StochasticNode const*) [137]
                0.01    0.02   10222/10222       std::_Rb_tree<SArray const*, SArray const*, std::_Identity<SArray const*>, std::less<SArray const*>, std::allocator<SArray const*> >::insert_unique(SArray const* const&) [177]
                0.02    0.00       2/2           std::_Rb_tree<SArray const*, SArray const*, std::_Identity<SArray const*>, std::less<SArray const*>, std::allocator<SArray const*> >::_M_erase(std::_Rb_tree_node<SArray const*>*) [190]
                0.00    0.01       4/4           getDist(StochasticNode const*) [210]
                0.00    0.00       2/2           GibbsSampler::classifyChildren(StochasticNode const*, std::vector<StochasticNode*, std::allocator<StochasticNode*> >&, std::vector<DeterministicNode*, std::allocator<DeterministicNode*> >&) [232]
-----------------------------------------------
                0.00    0.01    2044/16375       MixtureNode::MixtureNode(Node*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > const&) [150]
                0.00    0.01    2044/16375       OffsetNode::OffsetNode(Range const&, std::vector<SubSetIndex, std::allocator<SubSetIndex> > const&) [178]
                0.00    0.05   12287/16375       LogicalNode::LogicalNode(Function const*, Index const&) [144]
[138]    0.0    0.00    0.07   16375         DeterministicNode::DeterministicNode(Index const&) [138]
                0.02    0.05   16375/26626       Node::Node(Index const&) [111]
-----------------------------------------------
                0.00    0.00    6153/500810      LogicalFactory::getLogicalNode(Function const*, std::vector<Node*, std::allocator<Node*> > const&) [64]
                0.00    0.00    6153/500810      std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::_M_create_node(std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> const&) [244]
                0.00    0.00   12282/500810      std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> const&) [231]
                0.00    0.00   20512/500810      std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>&, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>*>, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> const&) [198]
                0.03    0.00  223726/500810      std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::lower_bound(std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const&) [123]
                0.03    0.00  231984/500810      std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::find(std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const&) [118]
[139]    0.0    0.06    0.00  500810         std::_Vector_base<Node*, std::allocator<Node*> >::_Vector_base(unsigned int, std::allocator<Node*> const&) [139]
-----------------------------------------------
                0.06    0.00   50817/50817       std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::erase(Node* const&) [88]
[140]    0.0    0.06    0.00   50817         std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::lower_bound(Node* const&) [140]
-----------------------------------------------
                0.04    0.02   12268/12268       NodeArray::set(Node*, Range const&) [56]
[141]    0.0    0.04    0.02   12268         printRange(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, Range const&) [141]
                0.00    0.01   12268/32760       std::basic_stringbuf<char, std::char_traits<char>, std::allocator<char> >::str() const [156]
                0.00    0.00   24540/173821      Range::ndim(bool) const [203]
                0.00    0.00   36816/96244414     Index::operator[](unsigned int) const [23]
                0.00    0.00   24544/1293571     Range::lower() const [171]
                0.00    0.00   12272/321087      Range::upper() const [212]
                0.00    0.00   12268/32760       std::basic_stringbuf<char, std::char_traits<char>, std::allocator<char> >::_M_really_sync(unsigned int, unsigned int) [325]
-----------------------------------------------
                0.00    0.05       1/1           Console::compile(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, unsigned int) [35]
[142]    0.0    0.00    0.05       1         Compiler::collectNodes() [142]
                0.00    0.05   18426/147955      Graph::add(Node*) [57]
                0.00    0.00       1/1           SymTab::getNodes(std::vector<Node*, std::allocator<Node*> >&) [255]
                0.00    0.00       1/1951        Graph::getNodes(std::vector<Node*, std::allocator<Node*> >&) const [176]
                0.00    0.00       1/1           LogicalFactory::graph() const [603]
-----------------------------------------------
                0.00    0.00       3/51187       Compiler::writeValuesToGraph(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, bool) [206]
                0.00    0.00       4/51187       SymTab::writeData(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, bool) [195]
                0.00    0.00    6134/51187       Compiler::allocateLogical(ParseTree const*) [59]
                0.00    0.00    6139/51187       Compiler::allocateStochastic(ParseTree const*) [60]
                0.01    0.00   12273/51187       NodeArray::set(Node*, Range const&) [56]
                0.02    0.01   26634/51187       SArray::SArray(Index const&) [125]
[143]    0.0    0.04    0.01   51187         Range::dim(bool) const [143]
                0.01    0.00  102402/96244414     Index::operator[](unsigned int) const [23]
                0.00    0.00   51187/6044854     Index::Index(unsigned int) [53]
                0.00    0.00   51187/19724490     Index::length() const [58]
                0.00    0.00   12284/403140      Index::Index(Index const&) [181]
                0.00    0.00   12290/12210221     Index::operator[](unsigned int) [55]
                0.00    0.00   12284/6374332     Index::~Index() [95]
-----------------------------------------------
                0.00    0.03    6134/12287       Compiler::allocateLogical(ParseTree const*) [59]
                0.00    0.03    6153/12287       LogicalFactory::getLogicalNode(Function const*, std::vector<Node*, std::allocator<Node*> > const&) [64]
[144]    0.0    0.00    0.05   12287         LogicalNode::LogicalNode(Function const*, Index const&) [144]
                0.00    0.05   12287/16375       DeterministicNode::DeterministicNode(Index const&) [138]
-----------------------------------------------
                0.05    0.00  103570/103570      GraphMarks::GraphMarks(Graph const&) [89]
[145]    0.0    0.05    0.00  103570         std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::lower_bound(Node const* const&) [145]
-----------------------------------------------
                0.00    0.05       1/1           Compiler::writeRelations(ParseTree const*) [36]
[146]    0.0    0.00    0.05       1         Compiler::fillConstants() [146]
                0.01    0.03    6132/18405       NodeArray::rangeContainsSetNodes(Range const&) const [107]
                0.00    0.00    6132/79806       Range::Range(Index const&, Index const&) [131]
                0.00    0.00    6132/57266       LeftRangeIterator::operator++() [162]
                0.00    0.00    6135/83857       LeftRangeIterator::atEnd() const [173]
                0.00    0.00   12270/6374332     Index::~Index() [95]
                0.00    0.00       4/87950       SymTab::getVariable(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [66]
                0.00    0.00       4/1184488     std::_Rb_tree_base_iterator::_M_increment() [49]
                0.00    0.00       3/51137       LeftRangeIterator::LeftRangeIterator(Range const&) [174]
                0.00    0.00       3/94079       NodeArray::range() const [315]
                0.00    0.00       3/51137       Index::~Index() [318]
-----------------------------------------------
                0.00    0.05       1/1           void std::partial_sort<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler) [100]
[147]    0.0    0.00    0.05       1         void std::make_heap<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler) [147]
                0.01    0.04     945/2834        void std::__adjust_heap<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, Sampler*, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, int, Sampler*, less_sampler) [99]
-----------------------------------------------
                0.00    0.05    6139/6139        Compiler::setStochasticParameters(ParseTree const*) [46]
[148]    0.0    0.00    0.05    6139         StochasticNode::setParameters(std::vector<Node*, std::allocator<Node*> > const&) [148]
                0.02    0.00   18417/40942       std::vector<SArray const*, std::allocator<SArray const*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<SArray const**, std::vector<SArray const*, std::allocator<SArray const*> > >, SArray const* const&) [155]
                0.00    0.01    6146/42979       Node::addParent(Node*) [105]
                0.01    0.00    6139/6139        Distribution::checkParameterLength(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [226]
                0.00    0.00    6132/6132        DBern::checkParameterDim(SArray const&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [250]
                0.00    0.00       7/7           DistReal::checkParameterDim(SArray const&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [295]
-----------------------------------------------
                0.03    0.02    2834/2834        void std::__adjust_heap<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, Sampler*, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, int, Sampler*, less_sampler) [99]
[149]    0.0    0.03    0.02    2834         void std::__push_heap<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, Sampler*, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, int, Sampler*, less_sampler) [149]
                0.01    0.00    8276/124618      std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::find(Node const* const&) const [85]
                0.00    0.00    8276/126554      Sampler::nodes() const [185]
-----------------------------------------------
                0.00    0.04    2044/2044        Compiler::getMixtureNode(ParseTree const*) <cycle 2> [80]
[150]    0.0    0.00    0.04    2044         MixtureNode::MixtureNode(Node*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > const&) [150]
                0.00    0.02   10220/42979       Node::addParent(Node*) [105]
                0.00    0.01    2044/16375       DeterministicNode::DeterministicNode(Index const&) [138]
                0.00    0.00    8176/8176        std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<long const, Node*>, std::pair<long const, Node*>&, std::pair<long const, Node*>*>, std::pair<long const, Node*> const&) [233]
                0.00    0.00    2044/51408928     SArray::length() const [40]
                0.00    0.00   12264/24544       SArray::dim(bool) const [327]
                0.00    0.00    8176/20456       Index::operator!=(Index const&) const [330]
                0.00    0.00    8176/8176        std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::lower_bound(long const&) [340]
-----------------------------------------------
                0.04    0.00 1929000/1929000     FiniteSampler::update() [5]
[151]    0.0    0.04    0.00 1929000         DBern::lowerLimit(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [151]
-----------------------------------------------
                0.04    0.00 1929000/1929000     FiniteSampler::update() [5]
[152]    0.0    0.04    0.00 1929000         DBern::upperLimit(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [152]
-----------------------------------------------
                0.00    0.00   11181/279074      std::_Rb_tree_rebalance_for_erase(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&, std::_Rb_tree_node_base*&, std::_Rb_tree_node_base*&) [163]
                0.04    0.00  267893/279074      std::_Rb_tree_rebalance(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&) [97]
[153]    0.0    0.04    0.00  279074         std::_Rb_tree_rotate_left(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&) [153]
-----------------------------------------------
                0.01    0.00   24546/67494       Compiler::VariableSubsetRange(ParseTree const*) [82]
                0.03    0.00   42948/67494       Compiler::constantExpression(ParseTree const*, double&) <cycle 1> [161]
[154]    0.0    0.04    0.00   67494         CounterTab::getCounter(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [154]
-----------------------------------------------
                0.02    0.00   18417/40942       StochasticNode::setParameters(std::vector<Node*, std::allocator<Node*> > const&) [148]
                0.02    0.00   22525/40942       LogicalNode::setParameters(std::vector<Node*, std::allocator<Node*> > const&) [112]
[155]    0.0    0.04    0.00   40942         std::vector<SArray const*, std::allocator<SArray const*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<SArray const**, std::vector<SArray const*, std::allocator<SArray const*> > >, SArray const* const&) [155]
-----------------------------------------------
                0.00    0.00    4112/32760       setConstantNameToValue(ConstantNode*) [199]
                0.00    0.01   12268/32760       printRange(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, Range const&) [141]
                0.01    0.01   16380/32760       std::basic_stringbuf<char, std::char_traits<char>, std::allocator<char> >::overflow(int) [169]
[156]    0.0    0.01    0.03   32760         std::basic_stringbuf<char, std::char_traits<char>, std::allocator<char> >::str() const [156]
                0.00    0.03   32760/32760       std::basic_string<char, std::char_traits<char>, std::allocator<char> >::basic_string<char*>(char*, char*, std::allocator<char> const&) [167]
-----------------------------------------------
                0.02    0.02    7000/7000        SliceSampler::update() [21]
[157]    0.0    0.02    0.02    7000         DistReal::lowerLimit(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [157]
                0.02    0.00    7000/53247       Distribution::lowerBound(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [96]
                0.00    0.00    7000/7000        lowerDefault(Support) [343]
-----------------------------------------------
                0.00    0.00       8/38862       Compiler::constantExpression(ParseTree const*, double&) <cycle 1> [161]
                0.01    0.00   14308/38862       Compiler::getSubSetNode(ParseTree const*) [87]
                0.02    0.00   24546/38862       Compiler::VariableSubsetRange(ParseTree const*) [82]
[158]    0.0    0.03    0.01   38862         Range::Range() [158]
                0.01    0.00   77724/6044854     Index::Index(unsigned int) [53]
-----------------------------------------------
                0.00    0.04    2044/2044        Node::unref() [65]
[159]    0.0    0.00    0.04    2044         OffsetNode::~OffsetNode() [159]
                0.00    0.03    2044/14353       Node::~Node() [76]
                0.00    0.00    4088/6374332     Index::~Index() [95]
-----------------------------------------------
                0.00    0.04    2044/2044        Node::unref() [65]
[160]    0.0    0.00    0.04    2044         MixtureNode::~MixtureNode() [160]
                0.00    0.03    2044/14353       Node::~Node() [76]
                0.00    0.00    2044/2044        std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::_M_erase(std::_Rb_tree_node<std::pair<long const, Node*> >*) [359]
-----------------------------------------------
                               42964             Compiler::indexExpression(ParseTree const*, long&) <cycle 1> [320]
[161]    0.0    0.00    0.03   42964         Compiler::constantExpression(ParseTree const*, double&) <cycle 1> [161]
                0.03    0.00   42948/67494       CounterTab::getCounter(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [154]
                0.01    0.00   49088/145241      ParseTree::name() const [183]
                0.00    0.00   42964/321300      ParseTree::parameters() const [180]
                0.00    0.00       8/5846318     Range::leftOffset(Index const&) const [22]
                0.00    0.00       8/38862       Range::Range() [158]
                0.00    0.00       8/26670       Range::length() const [204]
                0.00    0.00      16/6374332     Index::~Index() [95]
                0.00    0.00       8/1293571     Range::lower() const [171]
                0.00    0.00   42964/302808      ParseTree::treeClass() const [312]
                0.00    0.00   36808/36808       Counter::value() const [323]
                0.00    0.00    6140/6140        std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [348]
                0.00    0.00      16/12312       SArray::range() const [334]
                0.00    0.00      16/10270       ParseTree::value() const [337]
                                   8             Compiler::getRange(std::vector<ParseTree*, std::allocator<ParseTree*> > const&, Range const&, Range&) <cycle 1> [116]
-----------------------------------------------
                0.00    0.00    6132/57266       Compiler::fillConstants() [146]
                0.00    0.00    6139/57266       NodeArray::setValue(SArray const&, bool) [172]
                0.00    0.00    8176/57266       Compiler::getMixtureNode(ParseTree const*) <cycle 2> [80]
                0.00    0.00   12273/57266       NodeArray::rangeContainsSetNodes(Range const&) const [107]
                0.00    0.01   24546/57266       NodeArray::set(Node*, Range const&) [56]
[162]    0.0    0.01    0.02   57266         LeftRangeIterator::operator++() [162]
                0.01    0.01   57266/57266       leftIncrement(Index&, Index const&, Index const&, int) [192]
                0.00    0.00   57266/321087      Range::upper() const [212]
                0.00    0.00   57266/1293571     Range::lower() const [171]
-----------------------------------------------
                0.00    0.00    1936/44549       GibbsFactory::makeSampler(std::set<StochasticNode*, std::less<StochasticNode*>, std::allocator<StochasticNode*> >&, std::vector<Sampler*, std::allocator<Sampler*> >&) const [29]
                0.03    0.00   42613/44549       std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::erase(std::_Rb_tree_iterator<Node*, Node*&, Node**>, std::_Rb_tree_iterator<Node*, Node*&, Node**>) [127]
[163]    0.0    0.03    0.00   44549         std::_Rb_tree_rebalance_for_erase(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&, std::_Rb_tree_node_base*&, std::_Rb_tree_node_base*&) [163]
                0.00    0.00   11181/279074      std::_Rb_tree_rotate_left(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&) [153]
                0.00    0.00    8306/33891       std::_Rb_tree_rotate_right(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&) [324]
-----------------------------------------------
                0.00    0.03    6139/6139        Compiler::allocateStochastic(ParseTree const*) [60]
[164]    0.0    0.00    0.03    6139         getDistribution(ParseTree const*, DistTab const&) [164]
                0.01    0.02    6139/6139        DistTab::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [168]
                0.00    0.00    6139/145241      ParseTree::name() const [183]
                0.00    0.00    6139/321300      ParseTree::parameters() const [180]
                0.00    0.00   12278/302808      ParseTree::treeClass() const [312]
-----------------------------------------------
                0.00    0.00    1929/1932865     FiniteSampler::FiniteSampler(StochasticNode*) [33]
                0.00    0.00    1936/1932865     FiniteSampler::canSample(StochasticNode const*) [236]
                0.03    0.00 1929000/1932865     FiniteSampler::update() [5]
[165]    0.0    0.03    0.00 1932865         asFinite(Distribution const*) [165]
-----------------------------------------------
                0.03    0.00   32760/32760       std::basic_string<char, std::char_traits<char>, std::allocator<char> >::basic_string<char*>(char*, char*, std::allocator<char> const&) [167]
[166]    0.0    0.03    0.00   32760         char* std::basic_string<char, std::char_traits<char>, std::allocator<char> >::_S_construct<char*>(char*, char*, std::allocator<char> const&, std::forward_iterator_tag) [166]
-----------------------------------------------
                0.00    0.03   32760/32760       std::basic_stringbuf<char, std::char_traits<char>, std::allocator<char> >::str() const [156]
[167]    0.0    0.00    0.03   32760         std::basic_string<char, std::char_traits<char>, std::allocator<char> >::basic_string<char*>(char*, char*, std::allocator<char> const&) [167]
                0.03    0.00   32760/32760       char* std::basic_string<char, std::char_traits<char>, std::allocator<char> >::_S_construct<char*>(char*, char*, std::allocator<char> const&, std::forward_iterator_tag) [166]
-----------------------------------------------
                0.01    0.02    6139/6139        getDistribution(ParseTree const*, DistTab const&) [164]
[168]    0.0    0.01    0.02    6139         DistTab::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [168]
                0.02    0.00    6139/6139        std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [188]
-----------------------------------------------
                                                 <spontaneous>
[169]    0.0    0.01    0.02                 std::basic_stringbuf<char, std::char_traits<char>, std::allocator<char> >::overflow(int) [169]
                0.01    0.01   16380/32760       std::basic_stringbuf<char, std::char_traits<char>, std::allocator<char> >::str() const [156]
                0.00    0.00   16380/32760       std::basic_stringbuf<char, std::char_traits<char>, std::allocator<char> >::_M_really_sync(unsigned int, unsigned int) [325]
-----------------------------------------------
                0.03    0.00   50817/50817       std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::erase(Node* const&) [88]
[170]    0.0    0.03    0.00   50817         std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::upper_bound(Node* const&) [170]
-----------------------------------------------
                0.00    0.00       8/1293571     Compiler::constantExpression(ParseTree const*, double&) <cycle 1> [161]
                0.00    0.00       8/1293571     CounterTab::pushCounter(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, Range const&) [293]
                0.00    0.00    8176/1293571     Compiler::getMixtureNode(ParseTree const*) <cycle 2> [80]
                0.00    0.00   24544/1293571     printRange(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, Range const&) [141]
                0.00    0.00   51137/1293571     LeftRangeIterator::LeftRangeIterator(Range const&) [174]
                0.00    0.00   57266/1293571     LeftRangeIterator::operator++() [162]
                0.03    0.00 1152432/1293571     rangeComp(Range const&, Range const&) [71]
[171]    0.0    0.03    0.00 1293571         Range::lower() const [171]
-----------------------------------------------
                0.00    0.01       3/7           Compiler::writeValuesToGraph(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, bool) [206]
                0.00    0.02       4/7           SymTab::writeData(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, bool) [195]
[172]    0.0    0.00    0.03       7         NodeArray::setValue(SArray const&, bool) [172]
                0.00    0.01    6139/5846318     Range::leftOffset(Index const&) const [22]
                0.00    0.00   12278/83857       LeftRangeIterator::atEnd() const [173]
                0.00    0.00    4203/10589       SArray::setFixed(bool) [222]
                0.00    0.00    6139/57266       LeftRangeIterator::operator++() [162]
                0.00    0.00    6139/1184488     std::_Rb_tree_base_iterator::_M_increment() [49]
                0.00    0.00    6139/51137       LeftRangeIterator::LeftRangeIterator(Range const&) [174]
                0.00    0.00    4210/203912840     SArray::setValue(double const*, unsigned long) [20]
                0.00    0.00   12278/6374332     Index::~Index() [95]
                0.00    0.00       7/51408928     SArray::length() const [40]
                0.00    0.00    6139/51137       Index::~Index() [318]
                0.00    0.00    4210/54519       isDeterministic(Node const*) [317]
                0.00    0.00       7/12312       SArray::range() const [334]
                0.00    0.00       7/12280       Range::operator==(Range const&) const [335]
-----------------------------------------------
                0.00    0.00    6135/83857       Compiler::fillConstants() [146]
                0.00    0.00   10220/83857       Compiler::getMixtureNode(ParseTree const*) <cycle 2> [80]
                0.00    0.00   12278/83857       NodeArray::setValue(SArray const&, bool) [172]
                0.00    0.01   24546/83857       NodeArray::set(Node*, Range const&) [56]
                0.00    0.01   30678/83857       NodeArray::rangeContainsSetNodes(Range const&) const [107]
[173]    0.0    0.01    0.02   83857         LeftRangeIterator::atEnd() const [173]
                0.01    0.00  167714/96244414     Index::operator[](unsigned int) const [23]
                0.00    0.00   83857/173821      Range::ndim(bool) const [203]
                0.00    0.00   83857/321087      Range::upper() const [212]
-----------------------------------------------
                0.00    0.00       3/51137       Compiler::fillConstants() [146]
                0.00    0.00    2044/51137       Compiler::getMixtureNode(ParseTree const*) <cycle 2> [80]
                0.00    0.00    6139/51137       NodeArray::setValue(SArray const&, bool) [172]
                0.00    0.01   18405/51137       NodeArray::rangeContainsSetNodes(Range const&) const [107]
                0.00    0.01   24546/51137       NodeArray::set(Node*, Range const&) [56]
[174]    0.0    0.01    0.02   51137         LeftRangeIterator::LeftRangeIterator(Range const&) [174]
                0.01    0.00   51137/51137       Index::Index(Index const&) [217]
                0.01    0.00  102274/403140      Index::Index(Index const&) [181]
                0.00    0.00   51137/1293571     Range::lower() const [171]
-----------------------------------------------
                0.00    0.03    6139/6139        Compiler::allocateStochastic(ParseTree const*) [60]
[175]    0.0    0.00    0.03    6139         StochasticNode::StochasticNode(Distribution const*, Index const&) [175]
                0.01    0.02    6139/26626       Node::Node(Index const&) [111]
-----------------------------------------------
                0.00    0.00       1/1951        Compiler::collectNodes() [142]
                0.00    0.00      12/1951        SymTab::getNodes(std::vector<Node*, std::allocator<Node*> >&) [255]
                0.00    0.02    1938/1951        Sampler::classifyChildren(std::set<StochasticNode const*, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> > const&, std::vector<StochasticNode*, std::allocator<StochasticNode*> >&, std::vector<DeterministicNode*, std::allocator<DeterministicNode*> >&) [30]
[176]    0.0    0.00    0.03    1951         Graph::getNodes(std::vector<Node*, std::allocator<Node*> >&) const [176]
                0.02    0.00   42724/1184488     std::_Rb_tree_base_iterator::_M_increment() [49]
                0.00    0.00    3983/40509       std::vector<Node*, std::allocator<Node*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<Node**, std::vector<Node*, std::allocator<Node*> > >, Node* const&) [218]
-----------------------------------------------
                0.01    0.02   10222/10222       ConjugateNormal::canSample(StochasticNode const*) [137]
[177]    0.0    0.01    0.02   10222         std::_Rb_tree<SArray const*, SArray const*, std::_Identity<SArray const*>, std::less<SArray const*>, std::allocator<SArray const*> >::insert_unique(SArray const* const&) [177]
                0.00    0.01   10222/10222       std::_Rb_tree<SArray const*, SArray const*, std::_Identity<SArray const*>, std::less<SArray const*>, std::allocator<SArray const*> >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, SArray const* const&) [202]
                0.00    0.00    3064/26546       std::_Rb_tree_base_iterator::_M_decrement() [219]
-----------------------------------------------
                0.00    0.02    2044/2044        Compiler::getMixtureNode(ParseTree const*) <cycle 2> [80]
[178]    0.0    0.00    0.02    2044         OffsetNode::OffsetNode(Range const&, std::vector<SubSetIndex, std::allocator<SubSetIndex> > const&) [178]
                0.00    0.01    4088/42979       Node::addParent(Node*) [105]
                0.00    0.01    2044/16375       DeterministicNode::DeterministicNode(Index const&) [138]
                0.00    0.00    4088/20440       SubSetIndex::node() const [220]
                0.00    0.00    4088/403140      Index::Index(Index const&) [181]
                0.00    0.00    2044/6044854     Index::Index(unsigned int) [53]
                0.00    0.00    2044/173821      Range::ndim(bool) const [203]
                0.00    0.00    2044/6374332     Index::~Index() [95]
                0.00    0.00    2044/2044        SubSetIndex* std::__uninitialized_copy_aux<__gnu_cxx::__normal_iterator<SubSetIndex const*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, SubSetIndex*>(__gnu_cxx::__normal_iterator<SubSetIndex const*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, __gnu_cxx::__normal_iterator<SubSetIndex const*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, SubSetIndex*, __false_type) [360]
-----------------------------------------------
                0.00    0.00      14/4112        Compiler::Param(ParseTree const*) <cycle 2> [254]
                0.00    0.02    4098/4112        Compiler::getLogicalParameter(ParseTree const*) <cycle 2> [54]
[179]    0.0    0.00    0.02    4112         ConstantNode::ConstantNode(double) [179]
                0.00    0.01    4112/26626       Node::Node(Index const&) [111]
                0.00    0.00    4112/10589       SArray::setFixed(bool) [222]
                0.00    0.00    4112/203912840     SArray::setValue(double const*, unsigned long) [20]
                0.00    0.00    4112/6044854     Index::Index(unsigned int) [53]
                0.00    0.00    4112/6374332     Index::~Index() [95]
-----------------------------------------------
                0.00    0.00      20/321300      Compiler::declareVariables(std::vector<ParseTree*, std::allocator<ParseTree*> > const&) [263]
                0.00    0.00      48/321300      Compiler::CounterRange(ParseTree const*) [261]
                0.00    0.00    4118/321300      Compiler::traverseTree(ParseTree const*, void (Compiler::*)(ParseTree const*), void (Compiler::*)(ParseTree const*)) [37]
                0.00    0.00    6139/321300      getDistribution(ParseTree const*, DistTab const&) [164]
                0.00    0.00    6139/321300      Compiler::allocateStochastic(ParseTree const*) [60]
                0.00    0.00    6168/321300      readRData(std::vector<ParseTree*, std::allocator<ParseTree*> > const*, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >&) [249]
                0.00    0.00   10220/321300      Compiler::getMixtureNode(ParseTree const*) <cycle 2> [80]
                0.00    0.00   12268/321300      Compiler::setLogicalParameters(ParseTree const*) [47]
                0.00    0.00   12268/321300      Compiler::allocateLogical(ParseTree const*) [59]
                0.00    0.00   14308/321300      Compiler::getSubSetNode(ParseTree const*) [87]
                0.00    0.00   22494/321300      Compiler::VarGetParameter(ParseTree const*) <cycle 2> [61]
                0.00    0.00   24546/321300      Compiler::VariableSubsetRange(ParseTree const*) [82]
                0.00    0.00   24556/321300      Compiler::setStochasticParameters(ParseTree const*) [46]
                0.00    0.00   42964/321300      Compiler::constantExpression(ParseTree const*, double&) <cycle 1> [161]
                0.00    0.00   57340/321300      Compiler::getLogicalParameterVector(ParseTree const*, std::vector<Node*, std::allocator<Node*> >&) <cycle 2> [193]
                0.00    0.00   77704/321300      Compiler::getRange(std::vector<ParseTree*, std::allocator<ParseTree*> > const&, Range const&, Range&) <cycle 1> [116]
[180]    0.0    0.02    0.00  321300         ParseTree::parameters() const [180]
-----------------------------------------------
                0.00    0.00      64/403140      SArray::SArray(SArray const&) [275]
                0.00    0.00    4088/403140      OffsetNode::OffsetNode(Range const&, std::vector<SubSetIndex, std::allocator<SubSetIndex> > const&) [178]
                0.00    0.00   12284/403140      Range::dim(bool) const [143]
                0.00    0.00   24546/403140      NodeArray::set(Node*, Range const&) [56]
                0.00    0.00   24546/403140      std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::_M_create_node(std::pair<Range const, Node*> const&) [239]
                0.00    0.00   26634/403140      SArray::SArray(Index const&) [125]
                0.00    0.00   49092/403140      Compiler::VariableSubsetRange(ParseTree const*) [82]
                0.01    0.00  102274/403140      LeftRangeIterator::LeftRangeIterator(Range const&) [174]
                0.01    0.00  159612/403140      Range::Range(Index const&, Index const&) [131]
[181]    0.0    0.02    0.00  403140         Index::Index(Index const&) [181]
-----------------------------------------------
                0.00    0.00    4106/248358      LogicalFactory::getLogicalNode(Function const*, std::vector<Node*, std::allocator<Node*> > const&) [64]
                0.00    0.00    6141/248358      std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> const&) [231]
                0.00    0.00   10256/248358      std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>&, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>*>, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> const&) [198]
                0.01    0.00  111863/248358      std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::lower_bound(std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const&) [123]
                0.01    0.00  115992/248358      std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::find(std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const&) [118]
[182]    0.0    0.02    0.00  248358         ltlogical::operator()(std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >) [182]
-----------------------------------------------
                0.00    0.00       4/145241      getFunction(ParseTree const*, FuncTab const&) [122]
                0.00    0.00       8/145241      readRData(std::vector<ParseTree*, std::allocator<ParseTree*> > const*, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >&) [249]
                0.00    0.00       8/145241      Compiler::traverseTree(ParseTree const*, void (Compiler::*)(ParseTree const*), void (Compiler::*)(ParseTree const*)) [37]
                0.00    0.00      12/145241      Compiler::declareVariables(std::vector<ParseTree*, std::allocator<ParseTree*> > const&) [263]
                0.00    0.00    2044/145241      Compiler::getMixtureNode(ParseTree const*) <cycle 2> [80]
                0.00    0.00    2044/145241      getLink(ParseTree const*, FuncTab const&) [197]
                0.00    0.00    6134/145241      Compiler::allocateLogical(ParseTree const*) [59]
                0.00    0.00    6139/145241      getDistribution(ParseTree const*, DistTab const&) [164]
                0.00    0.00    6139/145241      Compiler::allocateStochastic(ParseTree const*) [60]
                0.00    0.00   12273/145241      Compiler::VarGetNode(ParseTree const*) [74]
                0.00    0.00   14308/145241      Compiler::getSubSetNode(ParseTree const*) [87]
                0.00    0.00   22494/145241      Compiler::VarGetParameter(ParseTree const*) <cycle 2> [61]
                0.00    0.00   24546/145241      Compiler::VariableSubsetRange(ParseTree const*) [82]
                0.01    0.00   49088/145241      Compiler::constantExpression(ParseTree const*, double&) <cycle 1> [161]
[183]    0.0    0.02    0.00  145241         ParseTree::name() const [183]
-----------------------------------------------
                0.02    0.00  130196/130196      std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<Node const* const, int> const&) [126]
[184]    0.0    0.02    0.00  130196         std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::_M_create_node(std::pair<Node const* const, int> const&) [184]
-----------------------------------------------
                0.00    0.00      30/126554      void std::__insertion_sort<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler) [257]
                0.00    0.00     100/126554      Sampler* const& std::__median<Sampler*, less_sampler>(Sampler* const&, Sampler* const&, Sampler* const&, less_sampler) [253]
                0.00    0.00    1936/126554      Model::chooseSamplers(std::vector<SamplerFactory const*, std::allocator<SamplerFactory const*> > const&) [28]
                0.00    0.00    3912/126554      void std::__unguarded_linear_insert<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, Sampler*, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, Sampler*, less_sampler) [230]
                0.00    0.00    8276/126554      void std::__push_heap<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, Sampler*, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, int, Sampler*, less_sampler) [149]
                0.01    0.00   35768/126554      void std::__adjust_heap<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, Sampler*, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, int, Sampler*, less_sampler) [99]
                0.01    0.00   76532/126554      __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > > std::__unguarded_partition<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, Sampler*, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, Sampler*, less_sampler) [93]
[185]    0.0    0.02    0.00  126554         Sampler::nodes() const [185]
-----------------------------------------------
                0.00    0.00    7000/53247       DistReal::upperLimit(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [235]
                0.02    0.00   46247/53247       DistReal::logLikelihood(SArray const&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [45]
[186]    0.0    0.02    0.00   53247         Distribution::upperBound(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [186]
-----------------------------------------------
                0.00    0.00       7/7007        SliceSampler::canSample(StochasticNode const*) [267]
                0.02    0.00    7000/7007        SliceSampler::update() [21]
[187]    0.0    0.02    0.00    7007         asReal(Distribution const*) [187]
-----------------------------------------------
                0.02    0.00    6139/6139        DistTab::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [168]
[188]    0.0    0.02    0.00    6139         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [188]
-----------------------------------------------
                0.01    0.01    6132/6132        Compiler::getMixtureNode(ParseTree const*) <cycle 2> [80]
[189]    0.0    0.01    0.01    6132         std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::pair<long, Node*>*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > >, std::pair<long, Node*> const&) [189]
                0.01    0.00   12264/12264       __gnu_cxx::__normal_iterator<std::pair<long, Node*>*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > > std::__uninitialized_copy_aux<__gnu_cxx::__normal_iterator<std::pair<long, Node*>*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > >, __gnu_cxx::__normal_iterator<std::pair<long, Node*>*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > > >(__gnu_cxx::__normal_iterator<std::pair<long, Node*>*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > >, __gnu_cxx::__normal_iterator<std::pair<long, Node*>*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > >, __gnu_cxx::__normal_iterator<std::pair<long, Node*>*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > >, __false_type) [221]
-----------------------------------------------
                               10222             std::_Rb_tree<SArray const*, SArray const*, std::_Identity<SArray const*>, std::less<SArray const*>, std::allocator<SArray const*> >::_M_erase(std::_Rb_tree_node<SArray const*>*) [190]
                0.02    0.00       2/2           ConjugateNormal::canSample(StochasticNode const*) [137]
[190]    0.0    0.02    0.00       2+10222   std::_Rb_tree<SArray const*, SArray const*, std::_Identity<SArray const*>, std::less<SArray const*>, std::allocator<SArray const*> >::_M_erase(std::_Rb_tree_node<SArray const*>*) [190]
                               10222             std::_Rb_tree<SArray const*, SArray const*, std::_Identity<SArray const*>, std::less<SArray const*>, std::allocator<SArray const*> >::_M_erase(std::_Rb_tree_node<SArray const*>*) [190]
-----------------------------------------------
                0.01    0.01    6153/6153        LogicalNode::setParameters(std::vector<Node*, std::allocator<Node*> > const&) [112]
[191]    0.0    0.01    0.01    6153         makeName(Function const*, std::vector<Node*, std::allocator<Node*> > const&) [191]
                0.01    0.00    6153/6181        Function::name() const [225]
                0.00    0.00   12301/36861       Node::name() const [321]
-----------------------------------------------
                0.01    0.01   57266/57266       LeftRangeIterator::operator++() [162]
[192]    0.0    0.01    0.01   57266         leftIncrement(Index&, Index const&, Index const&, int) [192]
                0.00    0.00  126844/12210221     Index::operator[](unsigned int) [55]
                0.00    0.00   65474/96244414     Index::operator[](unsigned int) const [23]
                0.00    0.00   61370/19724490     Index::length() const [58]
-----------------------------------------------
                                6154             Compiler::getLogicalParameter(ParseTree const*) <cycle 2> [54]
                0.03    0.51    6134/12280       Compiler::setLogicalParameters(ParseTree const*) [47]
[193]    0.0    0.01    0.01   12288         Compiler::getLogicalParameterVector(ParseTree const*, std::vector<Node*, std::allocator<Node*> >&) <cycle 2> [193]
                0.01    0.00   22526/40509       std::vector<Node*, std::allocator<Node*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<Node**, std::vector<Node*, std::allocator<Node*> > >, Node* const&) [218]
                0.00    0.00   57340/321300      ParseTree::parameters() const [180]
                0.00    0.00   12288/302808      ParseTree::treeClass() const [312]
                               22526             Compiler::getLogicalParameter(ParseTree const*) <cycle 2> [54]
-----------------------------------------------
                0.00    0.02   12273/12273       NodeArray::set(Node*, Range const&) [56]
[194]    0.0    0.00    0.02   12273         std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<Range const, Node*>, std::pair<Range const, Node*>&, std::pair<Range const, Node*>*>, std::pair<Range const, Node*> const&) [194]
                0.00    0.01   12261/12273       std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<Range const, Node*> const&) [207]
                0.00    0.01   12261/576216      rangeComp(Range const&, Range const&) [71]
                0.00    0.00      12/12          std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::insert_unique(std::pair<Range const, Node*> const&) [274]
-----------------------------------------------
                0.00    0.02       1/1           Console::setParameters(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, unsigned int) [196]
[195]    0.0    0.00    0.02       1         SymTab::writeData(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, bool) [195]
                0.00    0.02       4/7           NodeArray::setValue(SArray const&, bool) [172]
                0.00    0.00       4/87950       SymTab::getVariable(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [66]
                0.00    0.00       4/51187       Range::dim(bool) const [143]
                0.00    0.00       4/1184488     std::_Rb_tree_base_iterator::_M_increment() [49]
                0.00    0.00       4/6374332     Index::~Index() [95]
                0.00    0.00       4/24544       SArray::dim(bool) const [327]
                0.00    0.00       4/94079       NodeArray::range() const [315]
                0.00    0.00       4/20456       Index::operator!=(Index const&) const [330]
-----------------------------------------------
                0.00    0.02       1/1           zzparse() [2]
[196]    0.0    0.00    0.02       1         Console::setParameters(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, unsigned int) [196]
                0.00    0.02       1/1           SymTab::writeData(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, bool) [195]
-----------------------------------------------
                0.00    0.02    2044/2044        Compiler::allocateLogical(ParseTree const*) [59]
[197]    0.0    0.00    0.02    2044         getLink(ParseTree const*, FuncTab const&) [197]
                0.00    0.01    2044/2044        FuncTab::findInverse(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [200]
                0.00    0.00    2044/145241      ParseTree::name() const [183]
                0.00    0.00    2044/302808      ParseTree::treeClass() const [312]
-----------------------------------------------
                0.00    0.02    6153/6153        LogicalFactory::getLogicalNode(Function const*, std::vector<Node*, std::allocator<Node*> > const&) [64]
[198]    0.0    0.00    0.02    6153         std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>&, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>*>, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> const&) [198]
                0.00    0.01    6152/6153        std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> const&) [231]
                0.00    0.00   20512/498763      std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >::~pair() [124]
                0.00    0.00   20512/500810      std::_Vector_base<Node*, std::allocator<Node*> >::_Vector_base(unsigned int, std::allocator<Node*> const&) [139]
                0.00    0.00    4104/26546       std::_Rb_tree_base_iterator::_M_decrement() [219]
                0.00    0.00   10256/248358      ltlogical::operator()(std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >) [182]
                0.00    0.00       1/1           std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::insert_unique(std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> const&) [294]
-----------------------------------------------
                0.00    0.00      14/4112        Compiler::Param(ParseTree const*) <cycle 2> [254]
                0.01    0.01    4098/4112        Compiler::getLogicalParameter(ParseTree const*) <cycle 2> [54]
[199]    0.0    0.01    0.01    4112         setConstantNameToValue(ConstantNode*) [199]
                0.00    0.00    4112/32760       std::basic_stringbuf<char, std::char_traits<char>, std::allocator<char> >::str() const [156]
                0.00    0.00    4112/32760       std::basic_stringbuf<char, std::char_traits<char>, std::allocator<char> >::_M_really_sync(unsigned int, unsigned int) [325]
                0.00    0.00    4112/22538       Node::setName(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [329]
-----------------------------------------------
                0.00    0.01    2044/2044        getLink(ParseTree const*, FuncTab const&) [197]
[200]    0.0    0.00    0.01    2044         FuncTab::findInverse(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [200]
                0.01    0.00    2044/12288       std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [121]
-----------------------------------------------
                0.01    0.00    2044/2044        Compiler::getMixtureNode(ParseTree const*) <cycle 2> [80]
[201]    0.0    0.01    0.00    2044         SubSetIndex::checkLimits(std::vector<SubSetIndex, std::allocator<SubSetIndex> > const&, std::vector<SubSetIndex, std::allocator<SubSetIndex> > const&) [201]
                0.00    0.00    8176/20440       SubSetIndex::node() const [220]
                0.00    0.00    4088/51408928     SArray::length() const [40]
-----------------------------------------------
                0.00    0.01   10222/10222       std::_Rb_tree<SArray const*, SArray const*, std::_Identity<SArray const*>, std::less<SArray const*>, std::allocator<SArray const*> >::insert_unique(SArray const* const&) [177]
[202]    0.0    0.00    0.01   10222         std::_Rb_tree<SArray const*, SArray const*, std::_Identity<SArray const*>, std::less<SArray const*>, std::allocator<SArray const*> >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, SArray const* const&) [202]
                0.01    0.00   10222/10222       std::_Rb_tree<SArray const*, SArray const*, std::_Identity<SArray const*>, std::less<SArray const*>, std::allocator<SArray const*> >::_M_create_node(SArray const* const&) [224]
                0.00    0.00   10222/392644      std::_Rb_tree_rebalance(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&) [97]
-----------------------------------------------
                0.00    0.00    2044/173821      OffsetNode::OffsetNode(Range const&, std::vector<SubSetIndex, std::allocator<SubSetIndex> > const&) [178]
                0.00    0.00   24536/173821      Compiler::VariableSubsetRange(ParseTree const*) [82]
                0.00    0.00   24540/173821      printRange(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, Range const&) [141]
                0.00    0.00   38844/173821      Compiler::getRange(std::vector<ParseTree*, std::allocator<ParseTree*> > const&, Range const&, Range&) <cycle 1> [116]
                0.00    0.00   83857/173821      LeftRangeIterator::atEnd() const [173]
[203]    0.0    0.01    0.00  173821         Range::ndim(bool) const [203]
                0.00    0.00  173821/19724490     Index::length() const [58]
-----------------------------------------------
                0.00    0.00       8/26670       Compiler::constantExpression(ParseTree const*, double&) <cycle 1> [161]
                0.00    0.00      12/26670       NodeArray::NodeArray(Index const&) [269]
                0.00    0.00      16/26670       SArray::SArray(SArray const&) [275]
                0.01    0.00   26634/26670       SArray::SArray(Index const&) [125]
[204]    0.0    0.01    0.00   26670         Range::length() const [204]
                0.00    0.00   53356/96244414     Index::operator[](unsigned int) const [23]
                0.00    0.00   26670/19724490     Index::length() const [58]
-----------------------------------------------
                                4088             Compiler::getMixtureNode(ParseTree const*) <cycle 2> [80]
[205]    0.0    0.00    0.01    4088         Compiler::makeSubsetIndex(ParseTree const*, std::vector<SubSetIndex, std::allocator<SubSetIndex> >&, Index const&) <cycle 2> [205]
                0.00    0.01    4088/42956       Compiler::indexExpression(ParseTree const*, long&) <cycle 1> [320]
                0.00    0.00    4088/4088        SubSetIndex::SubSetIndex(Node*) [258]
                0.00    0.00    4088/19724490     Index::length() const [58]
                0.00    0.00    4088/4088        SubSetIndex::SubSetIndex() [355]
                0.00    0.00    4088/302808      ParseTree::treeClass() const [312]
                0.00    0.00    4088/8176        std::vector<SubSetIndex, std::allocator<SubSetIndex> >::_M_insert_aux(__gnu_cxx::__normal_iterator<SubSetIndex*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, SubSetIndex const&) [339]
                                4088             Compiler::getLogicalParameter(ParseTree const*) <cycle 2> [54]
-----------------------------------------------
                0.00    0.01       1/1           Console::compile(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, unsigned int) [35]
[206]    0.0    0.00    0.01       1         Compiler::writeValuesToGraph(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, bool) [206]
                0.00    0.01       3/7           NodeArray::setValue(SArray const&, bool) [172]
                0.00    0.00       4/87950       SymTab::getVariable(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [66]
                0.00    0.00       3/51187       Range::dim(bool) const [143]
                0.00    0.00       4/1184488     std::_Rb_tree_base_iterator::_M_increment() [49]
                0.00    0.00       3/6374332     Index::~Index() [95]
                0.00    0.00       3/24544       SArray::dim(bool) const [327]
                0.00    0.00       3/94079       NodeArray::range() const [315]
                0.00    0.00       3/20456       Index::operator!=(Index const&) const [330]
-----------------------------------------------
                0.00    0.00      12/12273       std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::insert_unique(std::pair<Range const, Node*> const&) [274]
                0.00    0.01   12261/12273       std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<Range const, Node*>, std::pair<Range const, Node*>&, std::pair<Range const, Node*>*>, std::pair<Range const, Node*> const&) [194]
[207]    0.0    0.00    0.01   12273         std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<Range const, Node*> const&) [207]
                0.00    0.01   12261/576216      rangeComp(Range const&, Range const&) [71]
                0.00    0.00   12273/392644      std::_Rb_tree_rebalance(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&) [97]
                0.00    0.00   12273/12273       std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::_M_create_node(std::pair<Range const, Node*> const&) [239]
-----------------------------------------------
                0.00    0.01       7/7           SliceFactory::makeGibbsSampler(StochasticNode*) const [209]
[208]    0.0    0.00    0.01       7         SliceSampler::SliceSampler(StochasticNode*, double, long) [208]
                0.00    0.01       7/1936        GibbsSampler::GibbsSampler(StochasticNode*) [31]
-----------------------------------------------
                0.00    0.01       7/7           GibbsFactory::makeSampler(std::set<StochasticNode*, std::less<StochasticNode*>, std::allocator<StochasticNode*> >&, std::vector<Sampler*, std::allocator<Sampler*> >&) const [29]
[209]    0.0    0.00    0.01       7         SliceFactory::makeGibbsSampler(StochasticNode*) const [209]
                0.00    0.01       7/7           SliceSampler::SliceSampler(StochasticNode*, double, long) [208]
-----------------------------------------------
                0.00    0.01       4/4           ConjugateNormal::canSample(StochasticNode const*) [137]
[210]    0.0    0.00    0.01       4         getDist(StochasticNode const*) [210]
                0.01    0.00       1/1           init_tables() [211]
                0.00    0.00       4/1941812     StochasticNode::distribution() const [39]
                0.00    0.00       4/1963        Distribution::name() const [361]
                0.00    0.00       4/4           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [427]
-----------------------------------------------
                0.01    0.00       1/1           getDist(StochasticNode const*) [210]
[211]    0.0    0.01    0.00       1         init_tables() [211]
                0.00    0.00      21/21          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> const&) [283]
                0.00    0.00       6/6           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> const&) [291]
                0.00    0.00      21/21          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::lower_bound(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [395]
                0.00    0.00       6/6           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::lower_bound(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [417]
-----------------------------------------------
                0.00    0.00       8/321087      CounterTab::pushCounter(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, Range const&) [293]
                0.00    0.00    4088/321087      Compiler::getMixtureNode(ParseTree const*) <cycle 2> [80]
                0.00    0.00   12272/321087      printRange(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, Range const&) [141]
                0.00    0.00   57266/321087      LeftRangeIterator::operator++() [162]
                0.00    0.00   83857/321087      LeftRangeIterator::atEnd() const [173]
                0.01    0.00  163596/321087      rangeComp(Range const&, Range const&) [71]
[212]    0.0    0.01    0.00  321087         Range::upper() const [212]
-----------------------------------------------
                0.01    0.00  221640/221640      std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, Node* const&) [104]
[213]    0.0    0.01    0.00  221640         std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::_M_create_node(Node* const&) [213]
-----------------------------------------------
                0.01    0.00  135682/135682      Graph::add(Node*) [57]
[214]    0.0    0.01    0.00  135682         Node::ref() [214]
-----------------------------------------------
                0.01    0.00   74607/74607       classifyNode(Node*, Graph&, Graph&) [51]
[215]    0.0    0.01    0.00   74607         isStochastic(Node const*) [215]
-----------------------------------------------
                0.01    0.00   73616/73616       Compiler::getRange(std::vector<ParseTree*, std::allocator<ParseTree*> > const&, Range const&, Range&) <cycle 1> [116]
[216]    0.0    0.01    0.00   73616         Index::operator=(Index const&) [216]
-----------------------------------------------
                0.01    0.00   51137/51137       LeftRangeIterator::LeftRangeIterator(Range const&) [174]
[217]    0.0    0.01    0.00   51137         Index::Index(Index const&) [217]
-----------------------------------------------
                0.00    0.00    3983/40509       Graph::getNodes(std::vector<Node*, std::allocator<Node*> >&) const [176]
                0.00    0.00    6146/40509       Compiler::setStochasticParameters(ParseTree const*) [46]
                0.00    0.00    7854/40509       Graph::getSortedNodes(std::vector<Node*, std::allocator<Node*> >&) [38]
                0.01    0.00   22526/40509       Compiler::getLogicalParameterVector(ParseTree const*, std::vector<Node*, std::allocator<Node*> >&) <cycle 2> [193]
[218]    0.0    0.01    0.00   40509         std::vector<Node*, std::allocator<Node*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<Node**, std::vector<Node*, std::allocator<Node*> > >, Node* const&) [218]
-----------------------------------------------
                0.00    0.00       2/26546       std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> const&) [277]
                0.00    0.00       2/26546       std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> const&) [288]
                0.00    0.00       2/26546       std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> const&) [291]
                0.00    0.00       7/26546       std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> const&) [285]
                0.00    0.00      10/26546       std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> const&) [270]
                0.00    0.00     964/26546       std::_Rb_tree<StochasticNode*, StochasticNode*, std::_Identity<StochasticNode*>, std::less<StochasticNode*>, std::allocator<StochasticNode*> >::insert_unique(StochasticNode* const&) [240]
                0.00    0.00    3064/26546       std::_Rb_tree<SArray const*, SArray const*, std::_Identity<SArray const*>, std::less<SArray const*>, std::allocator<SArray const*> >::insert_unique(SArray const* const&) [177]
                0.00    0.00    4104/26546       std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>&, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>*>, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> const&) [198]
                0.00    0.00    8162/26546       std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::insert_unique(Node* const&) [75]
                0.00    0.00   10229/26546       std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::insert_unique(std::pair<Node const* const, int> const&) [120]
[219]    0.0    0.01    0.00   26546         std::_Rb_tree_base_iterator::_M_decrement() [219]
-----------------------------------------------
                0.00    0.00    4088/20440       OffsetNode::OffsetNode(Range const&, std::vector<SubSetIndex, std::allocator<SubSetIndex> > const&) [178]
                0.00    0.00    8176/20440       Compiler::getMixtureNode(ParseTree const*) <cycle 2> [80]
                0.00    0.00    8176/20440       SubSetIndex::checkLimits(std::vector<SubSetIndex, std::allocator<SubSetIndex> > const&, std::vector<SubSetIndex, std::allocator<SubSetIndex> > const&) [201]
[220]    0.0    0.01    0.00   20440         SubSetIndex::node() const [220]
-----------------------------------------------
                0.01    0.00   12264/12264       std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::pair<long, Node*>*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > >, std::pair<long, Node*> const&) [189]
[221]    0.0    0.01    0.00   12264         __gnu_cxx::__normal_iterator<std::pair<long, Node*>*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > > std::__uninitialized_copy_aux<__gnu_cxx::__normal_iterator<std::pair<long, Node*>*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > >, __gnu_cxx::__normal_iterator<std::pair<long, Node*>*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > > >(__gnu_cxx::__normal_iterator<std::pair<long, Node*>*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > >, __gnu_cxx::__normal_iterator<std::pair<long, Node*>*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > >, __gnu_cxx::__normal_iterator<std::pair<long, Node*>*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > >, __false_type) [221]
-----------------------------------------------
                0.00    0.00    2274/10589       DeterministicNode::initialize() [92]
                0.00    0.00    4112/10589       ConstantNode::ConstantNode(double) [179]
                0.00    0.00    4203/10589       NodeArray::setValue(SArray const&, bool) [172]
[222]    0.0    0.01    0.00   10589         SArray::setFixed(bool) [222]
-----------------------------------------------
                0.01    0.00   10240/10240       getFunction(ParseTree const*, FuncTab const&) [122]
[223]    0.0    0.01    0.00   10240         ParseTree::getOperator() const [223]
-----------------------------------------------
                0.01    0.00   10222/10222       std::_Rb_tree<SArray const*, SArray const*, std::_Identity<SArray const*>, std::less<SArray const*>, std::allocator<SArray const*> >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, SArray const* const&) [202]
[224]    0.0    0.01    0.00   10222         std::_Rb_tree<SArray const*, SArray const*, std::_Identity<SArray const*>, std::less<SArray const*>, std::allocator<SArray const*> >::_M_create_node(SArray const* const&) [224]
-----------------------------------------------
                0.00    0.00       4/6181        FuncTab::insert(InverseLinkFunc const*) [276]
                0.00    0.00      24/6181        FuncTab::insert(Function const*) [264]
                0.01    0.00    6153/6181        makeName(Function const*, std::vector<Node*, std::allocator<Node*> > const&) [191]
[225]    0.0    0.01    0.00    6181         Function::name() const [225]
-----------------------------------------------
                0.01    0.00    6139/6139        StochasticNode::setParameters(std::vector<Node*, std::allocator<Node*> > const&) [148]
[226]    0.0    0.01    0.00    6139         Distribution::checkParameterLength(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [226]
-----------------------------------------------
                0.01    0.00    6006/6006        LogicalNode::forwardSample() [10]
[227]    0.0    0.01    0.00    6006         Divide::checkParameterValue(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [227]
-----------------------------------------------
                                6153             std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::_M_erase(std::_Rb_tree_node<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >*) [228]
                0.01    0.00       1/1           Console::compile(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, unsigned int) [35]
[228]    0.0    0.01    0.00       1+6153    std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::_M_erase(std::_Rb_tree_node<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >*) [228]
                                6153             std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::_M_erase(std::_Rb_tree_node<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >*) [228]
-----------------------------------------------
                0.00    0.01       1/1           Model::chooseSamplers(std::vector<SamplerFactory const*, std::allocator<SamplerFactory const*> > const&) [28]
[229]    0.0    0.00    0.01       1         void std::__final_insertion_sort<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler) [229]
                0.00    0.01    1920/1935        void std::__unguarded_linear_insert<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, Sampler*, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, Sampler*, less_sampler) [230]
                0.00    0.00       1/1           void std::__insertion_sort<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler) [257]
-----------------------------------------------
                0.00    0.00      15/1935        void std::__insertion_sort<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler) [257]
                0.00    0.01    1920/1935        void std::__final_insertion_sort<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler) [229]
[230]    0.0    0.00    0.01    1935         void std::__unguarded_linear_insert<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, Sampler*, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, Sampler*, less_sampler) [230]
                0.01    0.00    3912/124618      std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::find(Node const* const&) const [85]
                0.00    0.00    3912/126554      Sampler::nodes() const [185]
-----------------------------------------------
                0.00    0.00       1/6153        std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::insert_unique(std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> const&) [294]
                0.00    0.01    6152/6153        std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>&, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>*>, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> const&) [198]
[231]    0.0    0.00    0.01    6153         std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> const&) [231]
                0.00    0.00    6153/392644      std::_Rb_tree_rebalance(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&) [97]
                0.00    0.00   12282/498763      std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >::~pair() [124]
                0.00    0.00   12282/500810      std::_Vector_base<Node*, std::allocator<Node*> >::_Vector_base(unsigned int, std::allocator<Node*> const&) [139]
                0.00    0.00    6153/6153        std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::_M_create_node(std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> const&) [244]
                0.00    0.00    6141/248358      ltlogical::operator()(std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >) [182]
-----------------------------------------------
                0.00    0.00       2/2           ConjugateNormal::canSample(StochasticNode const*) [137]
[232]    0.0    0.00    0.00       2         GibbsSampler::classifyChildren(StochasticNode const*, std::vector<StochasticNode*, std::allocator<StochasticNode*> >&, std::vector<DeterministicNode*, std::allocator<DeterministicNode*> >&) [232]
                0.00    0.00       2/1938        Sampler::classifyChildren(std::set<StochasticNode const*, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> > const&, std::vector<StochasticNode*, std::allocator<StochasticNode*> >&, std::vector<DeterministicNode*, std::allocator<DeterministicNode*> >&) [30]
                0.00    0.00       2/1938        std::_Rb_tree<StochasticNode const*, StochasticNode const*, std::_Identity<StochasticNode const*>, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> >::insert_unique(StochasticNode const* const&) [245]
                0.00    0.00       2/1938        std::_Rb_tree<StochasticNode const*, StochasticNode const*, std::_Identity<StochasticNode const*>, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> >::_M_erase(std::_Rb_tree_node<StochasticNode const*>*) [364]
-----------------------------------------------
                0.00    0.00    8176/8176        MixtureNode::MixtureNode(Node*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > const&) [150]
[233]    0.0    0.00    0.00    8176         std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<long const, Node*>, std::pair<long const, Node*>&, std::pair<long const, Node*>*>, std::pair<long const, Node*> const&) [233]
                0.00    0.00    6132/8176        std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<long const, Node*> const&) [234]
                0.00    0.00    2044/2044        std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::insert_unique(std::pair<long const, Node*> const&) [243]
-----------------------------------------------
                0.00    0.00    2044/8176        std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::insert_unique(std::pair<long const, Node*> const&) [243]
                0.00    0.00    6132/8176        std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<long const, Node*>, std::pair<long const, Node*>&, std::pair<long const, Node*>*>, std::pair<long const, Node*> const&) [233]
[234]    0.0    0.00    0.00    8176         std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<long const, Node*> const&) [234]
                0.00    0.00    8176/392644      std::_Rb_tree_rebalance(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&) [97]
                0.00    0.00    8176/8176        std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::_M_create_node(std::pair<long const, Node*> const&) [341]
-----------------------------------------------
                0.00    0.00    7000/7000        SliceSampler::update() [21]
[235]    0.0    0.00    0.00    7000         DistReal::upperLimit(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [235]
                0.00    0.00    7000/53247       Distribution::upperBound(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [186]
                0.00    0.00    7000/7000        upperDefault(Support) [344]
-----------------------------------------------
                0.00    0.00    1936/1936        FiniteFactory::canSample(StochasticNode const*) const [237]
[236]    0.0    0.00    0.00    1936         FiniteSampler::canSample(StochasticNode const*) [236]
                0.00    0.00    1936/1941812     StochasticNode::distribution() const [39]
                0.00    0.00    1936/1932865     asFinite(Distribution const*) [165]
-----------------------------------------------
                0.00    0.00    1936/1936        GibbsFactory::makeSampler(std::set<StochasticNode*, std::less<StochasticNode*>, std::allocator<StochasticNode*> >&, std::vector<Sampler*, std::allocator<Sampler*> >&) const [29]
[237]    0.0    0.00    0.00    1936         FiniteFactory::canSample(StochasticNode const*) const [237]
                0.00    0.00    1936/1936        FiniteSampler::canSample(StochasticNode const*) [236]
-----------------------------------------------
                0.00    0.00       8/14377       std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >*) [296]
                0.00    0.00      16/14377       readRData(std::vector<ParseTree*, std::allocator<ParseTree*> > const*, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >&) [249]
                0.00    0.00   14353/14377       Node::~Node() [76]
[238]    0.0    0.00    0.00   14377         SArray::~SArray() [238]
                0.00    0.00   57508/6374332     Index::~Index() [95]
-----------------------------------------------
                0.00    0.00   12273/12273       std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<Range const, Node*> const&) [207]
[239]    0.0    0.00    0.00   12273         std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::_M_create_node(std::pair<Range const, Node*> const&) [239]
                0.00    0.00   24546/403140      Index::Index(Index const&) [181]
-----------------------------------------------
                0.00    0.00    1936/1936        Model::chooseSamplers(std::vector<SamplerFactory const*, std::allocator<SamplerFactory const*> > const&) [28]
[240]    0.0    0.00    0.00    1936         std::_Rb_tree<StochasticNode*, StochasticNode*, std::_Identity<StochasticNode*>, std::less<StochasticNode*>, std::allocator<StochasticNode*> >::insert_unique(StochasticNode* const&) [240]
                0.00    0.00    1936/1936        std::_Rb_tree<StochasticNode*, StochasticNode*, std::_Identity<StochasticNode*>, std::less<StochasticNode*>, std::allocator<StochasticNode*> >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, StochasticNode* const&) [247]
                0.00    0.00     964/26546       std::_Rb_tree_base_iterator::_M_decrement() [219]
-----------------------------------------------
                0.00    0.00    6153/6153        LogicalFactory::getLogicalNode(Function const*, std::vector<Node*, std::allocator<Node*> > const&) [64]
[241]    0.0    0.00    0.00    6153         std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>::~pair() [241]
                0.00    0.00    6153/498763      std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >::~pair() [124]
-----------------------------------------------
                0.00    0.00   12287/12287       LogicalNode::setParameters(std::vector<Node*, std::allocator<Node*> > const&) [112]
[242]    0.0    0.00    0.00   12287         ScalarFunc::checkDim(SArray const&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [242]
                0.00    0.00   34812/51408928     SArray::length() const [40]
-----------------------------------------------
                0.00    0.00    2044/2044        std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<long const, Node*>, std::pair<long const, Node*>&, std::pair<long const, Node*>*>, std::pair<long const, Node*> const&) [233]
[243]    0.0    0.00    0.00    2044         std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::insert_unique(std::pair<long const, Node*> const&) [243]
                0.00    0.00    2044/8176        std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<long const, Node*> const&) [234]
-----------------------------------------------
                0.00    0.00    6153/6153        std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> const&) [231]
[244]    0.0    0.00    0.00    6153         std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::_M_create_node(std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> const&) [244]
                0.00    0.00    6153/500810      std::_Vector_base<Node*, std::allocator<Node*> >::_Vector_base(unsigned int, std::allocator<Node*> const&) [139]
-----------------------------------------------
                0.00    0.00       2/1938        GibbsSampler::classifyChildren(StochasticNode const*, std::vector<StochasticNode*, std::allocator<StochasticNode*> >&, std::vector<DeterministicNode*, std::allocator<DeterministicNode*> >&) [232]
                0.00    0.00    1936/1938        Sampler::Sampler(std::vector<StochasticNode*, std::allocator<StochasticNode*> > const&) [32]
[245]    0.0    0.00    0.00    1938         std::_Rb_tree<StochasticNode const*, StochasticNode const*, std::_Identity<StochasticNode const*>, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> >::insert_unique(StochasticNode const* const&) [245]
                0.00    0.00    1938/1938        std::_Rb_tree<StochasticNode const*, StochasticNode const*, std::_Identity<StochasticNode const*>, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, StochasticNode const* const&) [246]
-----------------------------------------------
                0.00    0.00    1938/1938        std::_Rb_tree<StochasticNode const*, StochasticNode const*, std::_Identity<StochasticNode const*>, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> >::insert_unique(StochasticNode const* const&) [245]
[246]    0.0    0.00    0.00    1938         std::_Rb_tree<StochasticNode const*, StochasticNode const*, std::_Identity<StochasticNode const*>, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, StochasticNode const* const&) [246]
                0.00    0.00    1938/392644      std::_Rb_tree_rebalance(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&) [97]
                0.00    0.00    1938/1938        std::_Rb_tree<StochasticNode const*, StochasticNode const*, std::_Identity<StochasticNode const*>, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> >::_M_create_node(StochasticNode const* const&) [363]
-----------------------------------------------
                0.00    0.00    1936/1936        std::_Rb_tree<StochasticNode*, StochasticNode*, std::_Identity<StochasticNode*>, std::less<StochasticNode*>, std::allocator<StochasticNode*> >::insert_unique(StochasticNode* const&) [240]
[247]    0.0    0.00    0.00    1936         std::_Rb_tree<StochasticNode*, StochasticNode*, std::_Identity<StochasticNode*>, std::less<StochasticNode*>, std::allocator<StochasticNode*> >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, StochasticNode* const&) [247]
                0.00    0.00    1936/392644      std::_Rb_tree_rebalance(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&) [97]
                0.00    0.00    1936/1936        std::_Rb_tree<StochasticNode*, StochasticNode*, std::_Identity<StochasticNode*>, std::less<StochasticNode*>, std::allocator<StochasticNode*> >::_M_create_node(StochasticNode* const&) [367]
-----------------------------------------------
                0.00    0.00    6153/6153        LogicalFactory::getLogicalNode(Function const*, std::vector<Node*, std::allocator<Node*> > const&) [64]
[248]    0.0    0.00    0.00    6153         ScalarFunc::dim(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [248]
                0.00    0.00    6153/6044854     Index::Index(unsigned int) [53]
-----------------------------------------------
                0.00    0.00       2/2           zzparse() [2]
[249]    0.0    0.00    0.00       2         readRData(std::vector<ParseTree*, std::allocator<ParseTree*> > const*, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >&) [249]
                0.00    0.00    6168/321300      ParseTree::parameters() const [180]
                0.00    0.00       8/26634       SArray::SArray(Index const&) [125]
                0.00    0.00       8/8           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> const&) [277]
                0.00    0.00       8/16          SArray::SArray(SArray const&) [275]
                0.00    0.00      16/14377       SArray::~SArray() [238]
                0.00    0.00       8/145241      ParseTree::name() const [183]
                0.00    0.00       8/203912840     SArray::setValue(double const*, unsigned long) [20]
                0.00    0.00       8/6044854     Index::Index(unsigned int) [53]
                0.00    0.00      11/12210221     Index::operator[](unsigned int) [55]
                0.00    0.00       8/6374332     Index::~Index() [95]
                0.00    0.00    6142/10270       ParseTree::value() const [337]
                0.00    0.00       8/302808      ParseTree::treeClass() const [312]
                0.00    0.00       8/8           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [413]
-----------------------------------------------
                0.00    0.00    6132/6132        StochasticNode::setParameters(std::vector<Node*, std::allocator<Node*> > const&) [148]
[250]    0.0    0.00    0.00    6132         DBern::checkParameterDim(SArray const&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [250]
                0.00    0.00   12264/51408928     SArray::length() const [40]
-----------------------------------------------
                0.00    0.00    1929/1929        Node::initialize() [91]
[251]    0.0    0.00    0.00    1929         StochasticNode::forwardSample() [251]
                0.00    0.00    1929/1929        DistFinite::randomSample(SArray&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [252]
-----------------------------------------------
                0.00    0.00    1929/1929        StochasticNode::forwardSample() [251]
[252]    0.0    0.00    0.00    1929         DistFinite::randomSample(SArray&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [252]
                0.00    0.00    1929/203912840     SArray::setValue(double const*, unsigned long) [20]
                0.00    0.00    1929/51408928     SArray::length() const [40]
                0.00    0.00    1929/1929        DBern::randomSample(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [370]
-----------------------------------------------
                0.00    0.00      20/20          void std::__introsort_loop<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, less_sampler) [68]
[253]    0.0    0.00    0.00      20         Sampler* const& std::__median<Sampler*, less_sampler>(Sampler* const&, Sampler* const&, Sampler* const&, less_sampler) [253]
                0.00    0.00     100/124618      std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::find(Node const* const&) const [85]
                0.00    0.00     100/126554      Sampler::nodes() const [185]
-----------------------------------------------
                               16362             Compiler::getLogicalParameter(ParseTree const*) <cycle 2> [54]
                0.03    0.51    6146/12280       Compiler::setStochasticParameters(ParseTree const*) [46]
[254]    0.0    0.00    0.00   22508         Compiler::Param(ParseTree const*) <cycle 2> [254]
                0.00    0.00      14/4112        ConstantNode::ConstantNode(double) [179]
                0.00    0.00      14/4112        setConstantNameToValue(ConstantNode*) [199]
                0.00    0.00      14/147955      Graph::add(Node*) [57]
                0.00    0.00   22508/302808      ParseTree::treeClass() const [312]
                0.00    0.00      14/10270       ParseTree::value() const [337]
                               22494             Compiler::VarGetParameter(ParseTree const*) <cycle 2> [61]
-----------------------------------------------
                0.00    0.00       1/1           Compiler::collectNodes() [142]
[255]    0.0    0.00    0.00       1         SymTab::getNodes(std::vector<Node*, std::allocator<Node*> >&) [255]
                0.00    0.00      12/1951        Graph::getNodes(std::vector<Node*, std::allocator<Node*> >&) const [176]
                0.00    0.00      12/1184488     std::_Rb_tree_base_iterator::_M_increment() [49]
                0.00    0.00      12/12          NodeArray::graph() const [399]
-----------------------------------------------
                0.00    0.00       1/1           main [1]
[256]    0.0    0.00    0.00       1         Console::~Console() [256]
                0.00    0.00       1/1           Model::~Model() [259]
                0.00    0.00       1/1           FuncTab::~FuncTab() [271]
                0.00    0.00       1/1           DistTab::~DistTab() [272]
                0.00    0.00       1/1           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >*) [610]
-----------------------------------------------
                0.00    0.00       1/1           void std::__final_insertion_sort<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler) [229]
[257]    0.0    0.00    0.00       1         void std::__insertion_sort<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler) [257]
                0.00    0.00      15/1935        void std::__unguarded_linear_insert<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, Sampler*, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, Sampler*, less_sampler) [230]
                0.00    0.00      30/124618      std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::find(Node const* const&) const [85]
                0.00    0.00      30/126554      Sampler::nodes() const [185]
-----------------------------------------------
                0.00    0.00    4088/4088        Compiler::makeSubsetIndex(ParseTree const*, std::vector<SubSetIndex, std::allocator<SubSetIndex> >&, Index const&) <cycle 2> [205]
[258]    0.0    0.00    0.00    4088         SubSetIndex::SubSetIndex(Node*) [258]
                0.00    0.00    4088/51408928     SArray::length() const [40]
-----------------------------------------------
                0.00    0.00       1/1           Console::~Console() [256]
[259]    0.0    0.00    0.00       1         Model::~Model() [259]
                0.00    0.00       1/3879        Graph::~Graph() [62]
                0.00    0.00    1929/1929        FiniteSampler::~FiniteSampler() [369]
                0.00    0.00       7/7           SliceSampler::~SliceSampler() [415]
                0.00    0.00       1/1           std::_List_base<TraceMonitor*, std::allocator<TraceMonitor*> >::__clear() [604]
-----------------------------------------------
                0.00    0.00       1/1           main [1]
[260]    0.0    0.00    0.00       1         Console::Console(std::basic_ostream<char, std::char_traits<char> >&, std::basic_ostream<char, std::char_traits<char> >&) [260]
                0.00    0.00       1/1           FuncTab::FuncTab() [262]
                0.00    0.00       1/1           DistTab::DistTab() [281]
                0.00    0.00       1/1           SymTab::SymTab() [580]
-----------------------------------------------
                0.00    0.00       8/8           Compiler::traverseTree(ParseTree const*, void (Compiler::*)(ParseTree const*), void (Compiler::*)(ParseTree const*)) [37]
[261]    0.0    0.00    0.00       8         Compiler::CounterRange(ParseTree const*) [261]
                0.00    0.00      16/42956       Compiler::indexExpression(ParseTree const*, long&) <cycle 1> [320]
                0.00    0.00       8/79806       Range::Range(Index const&, Index const&) [131]
                0.00    0.00      48/321300      ParseTree::parameters() const [180]
                0.00    0.00      16/6044854     Index::Index(unsigned int) [53]
                0.00    0.00      16/12210221     Index::operator[](unsigned int) [55]
                0.00    0.00      16/6374332     Index::~Index() [95]
                0.00    0.00      16/302808      ParseTree::treeClass() const [312]
-----------------------------------------------
                0.00    0.00       1/1           Console::Console(std::basic_ostream<char, std::char_traits<char> >&, std::basic_ostream<char, std::char_traits<char> >&) [260]
[262]    0.0    0.00    0.00       1         FuncTab::FuncTab() [262]
                0.00    0.00      24/24          FuncTab::insert(Function const*) [264]
                0.00    0.00       4/4           FuncTab::insert(InverseLinkFunc const*) [276]
                0.00    0.00       1/1           Add::Add() [500]
                0.00    0.00       1/1           Subtract::Subtract() [599]
                0.00    0.00       1/1           Multiply::Multiply() [597]
                0.00    0.00       1/1           Divide::Divide() [566]
                0.00    0.00       1/1           Equals::Equals() [568]
                0.00    0.00       1/1           InProd::InProd() [572]
                0.00    0.00       1/1           Inverse::Inverse() [589]
                0.00    0.00       1/1           LogDet::LogDet() [574]
                0.00    0.00       1/1           LogFact::LogFact() [591]
                0.00    0.00       1/1           LogGam::LogGam() [576]
                0.00    0.00       1/1           Max::Max() [506]
                0.00    0.00       1/1           Mean::Mean() [524]
                0.00    0.00       1/1           Min::Min() [508]
                0.00    0.00       1/1           Pow::Pow() [512]
                0.00    0.00       1/1           SD::SD() [498]
                0.00    0.00       1/1           Sqrt::Sqrt() [528]
                0.00    0.00       1/1           Step::Step() [530]
                0.00    0.00       1/1           Sum::Sum() [514]
                0.00    0.00       1/1           UnaryMinus::UnaryMinus() [491]
                0.00    0.00       1/1           Mexp::Mexp() [526]
                0.00    0.00       1/1           CLogLog::CLogLog() [581]
                0.00    0.00       1/1           ICLogLog::ICLogLog() [595]
                0.00    0.00       1/1           Log::Log() [504]
                0.00    0.00       1/1           Exp::Exp() [502]
                0.00    0.00       1/1           Logit::Logit() [548]
                0.00    0.00       1/1           ILogit::ILogit() [570]
                0.00    0.00       1/1           Probit::Probit() [578]
                0.00    0.00       1/1           Phi::Phi() [510]
-----------------------------------------------
                0.00    0.00       1/1           Console::compile(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, unsigned int) [35]
[263]    0.0    0.00    0.00       1         Compiler::declareVariables(std::vector<ParseTree*, std::allocator<ParseTree*> > const&) [263]
                0.00    0.00      12/12          SymTab::addVariable(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, Index const&) [266]
                0.00    0.00       8/42956       Compiler::indexExpression(ParseTree const*, long&) <cycle 1> [320]
                0.00    0.00      12/145241      ParseTree::name() const [183]
                0.00    0.00      20/321300      ParseTree::parameters() const [180]
                0.00    0.00      12/6044854     Index::Index(unsigned int) [53]
                0.00    0.00      12/6374332     Index::~Index() [95]
                0.00    0.00       8/12210221     Index::operator[](unsigned int) [55]
                0.00    0.00      12/302808      ParseTree::treeClass() const [312]
-----------------------------------------------
                0.00    0.00      24/24          FuncTab::FuncTab() [262]
[264]    0.0    0.00    0.00      24         FuncTab::insert(Function const*) [264]
                0.00    0.00      24/6181        Function::name() const [225]
                0.00    0.00      24/32          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> const&) [270]
                0.00    0.00      24/32          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [383]
                0.00    0.00      24/32          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::lower_bound(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [381]
-----------------------------------------------
                                                 <spontaneous>
[265]    0.0    0.00    0.00                 __tcf_0 [265]
                0.00    0.00       1/1942        std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::_M_erase(std::_Rb_tree_node<std::pair<Node const* const, int> >*) [134]
-----------------------------------------------
                0.00    0.00      12/12          Compiler::declareVariables(std::vector<ParseTree*, std::allocator<ParseTree*> > const&) [263]
[266]    0.0    0.00    0.00      12         SymTab::addVariable(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, Index const&) [266]
                0.00    0.00      12/12          NodeArray::NodeArray(Index const&) [269]
                0.00    0.00      12/12          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> const&) [285]
                0.00    0.00      12/12          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [403]
                0.00    0.00      12/12          NodeArray::setName(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [398]
                0.00    0.00      12/12          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::lower_bound(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [401]
-----------------------------------------------
                0.00    0.00       7/7           SliceFactory::canSample(StochasticNode const*) const [268]
[267]    0.0    0.00    0.00       7         SliceSampler::canSample(StochasticNode const*) [267]
                0.00    0.00       7/7007        asReal(Distribution const*) [187]
                0.00    0.00       7/1941812     StochasticNode::distribution() const [39]
                0.00    0.00       7/51408928     SArray::length() const [40]
-----------------------------------------------
                0.00    0.00       7/7           GibbsFactory::makeSampler(std::set<StochasticNode*, std::less<StochasticNode*>, std::allocator<StochasticNode*> >&, std::vector<Sampler*, std::allocator<Sampler*> >&) const [29]
[268]    0.0    0.00    0.00       7         SliceFactory::canSample(StochasticNode const*) const [268]
                0.00    0.00       7/7           SliceSampler::canSample(StochasticNode const*) [267]
-----------------------------------------------
                0.00    0.00      12/12          SymTab::addVariable(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, Index const&) [266]
[269]    0.0    0.00    0.00      12         NodeArray::NodeArray(Index const&) [269]
                0.00    0.00      12/79806       Range::Range(Index const&, Index const&) [131]
                0.00    0.00      12/26670       Range::length() const [204]
                0.00    0.00      12/6044854     Index::Index(unsigned int) [53]
                0.00    0.00      12/6374332     Index::~Index() [95]
                0.00    0.00      12/19724490     Index::length() const [58]
                0.00    0.00      12/3891        Graph::Graph() [358]
-----------------------------------------------
                0.00    0.00       8/32          FuncTab::insert(InverseLinkFunc const*) [276]
                0.00    0.00      24/32          FuncTab::insert(Function const*) [264]
[270]    0.0    0.00    0.00      32         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> const&) [270]
                0.00    0.00      30/32          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> const&) [273]
                0.00    0.00      10/26546       std::_Rb_tree_base_iterator::_M_decrement() [219]
                0.00    0.00       2/2           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> const&) [297]
-----------------------------------------------
                0.00    0.00       1/1           Console::~Console() [256]
[271]    0.0    0.00    0.00       1         FuncTab::~FuncTab() [271]
                0.00    0.00      28/1184488     std::_Rb_tree_base_iterator::_M_increment() [49]
                0.00    0.00       2/2           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >*) [445]
                0.00    0.00       1/1           Sum::~Sum() [515]
                0.00    0.00       1/1           Step::~Step() [531]
                0.00    0.00       1/1           Sqrt::~Sqrt() [529]
                0.00    0.00       1/1           SD::~SD() [499]
                0.00    0.00       1/1           Probit::~Probit() [579]
                0.00    0.00       1/1           Pow::~Pow() [513]
                0.00    0.00       1/1           Phi::~Phi() [511]
                0.00    0.00       1/1           Min::~Min() [509]
                0.00    0.00       1/1           Mexp::~Mexp() [527]
                0.00    0.00       1/1           Mean::~Mean() [525]
                0.00    0.00       1/1           Max::~Max() [507]
                0.00    0.00       1/1           Logit::~Logit() [549]
                0.00    0.00       1/1           LogGam::~LogGam() [577]
                0.00    0.00       1/1           LogFact::~LogFact() [592]
                0.00    0.00       1/1           LogDet::~LogDet() [575]
                0.00    0.00       1/1           Log::~Log() [505]
                0.00    0.00       1/1           Inverse::~Inverse() [590]
                0.00    0.00       1/1           InProd::~InProd() [573]
                0.00    0.00       1/1           ILogit::~ILogit() [571]
                0.00    0.00       1/1           ICLogLog::~ICLogLog() [596]
                0.00    0.00       1/1           Exp::~Exp() [503]
                0.00    0.00       1/1           Equals::~Equals() [569]
                0.00    0.00       1/1           CLogLog::~CLogLog() [582]
                0.00    0.00       1/1           UnaryMinus::~UnaryMinus() [492]
                0.00    0.00       1/1           Divide::~Divide() [567]
                0.00    0.00       1/1           Subtract::~Subtract() [600]
                0.00    0.00       1/1           Add::~Add() [501]
                0.00    0.00       1/1           Multiply::~Multiply() [598]
-----------------------------------------------
                0.00    0.00       1/1           Console::~Console() [256]
[272]    0.0    0.00    0.00       1         DistTab::~DistTab() [272]
                0.00    0.00      23/1184488     std::_Rb_tree_base_iterator::_M_increment() [49]
                0.00    0.00       1/1           DWish::~DWish() [547]
                0.00    0.00       1/1           DWeib::~DWeib() [545]
                0.00    0.00       1/1           DUnif::~DUnif() [543]
                0.00    0.00       1/1           DT::~DT() [497]
                0.00    0.00       1/1           DPois::~DPois() [541]
                0.00    0.00       1/1           DPar::~DPar() [523]
                0.00    0.00       1/1           DNorm::~DNorm() [539]
                0.00    0.00       1/1           DNegBin::~DNegBin() [588]
                0.00    0.00       1/1           DMulti::~DMulti() [565]
                0.00    0.00       1/1           DMState::~DMState() [586]
                0.00    0.00       1/1           DMNorm::~DMNorm() [563]
                0.00    0.00       1/1           DLogis::~DLogis() [561]
                0.00    0.00       1/1           DLnorm::~DLnorm() [559]
                0.00    0.00       1/1           DInterval::~DInterval() [602]
                0.00    0.00       1/1           DGamma::~DGamma() [557]
                0.00    0.00       1/1           DExp::~DExp() [521]
                0.00    0.00       1/1           DDirch::~DDirch() [555]
                0.00    0.00       1/1           DDexp::~DDexp() [537]
                0.00    0.00       1/1           DChisq::~DChisq() [553]
                0.00    0.00       1/1           DCat::~DCat() [519]
                0.00    0.00       1/1           DBin::~DBin() [517]
                0.00    0.00       1/1           DBeta::~DBeta() [535]
                0.00    0.00       1/1           DBern::~DBern() [533]
                0.00    0.00       1/1           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >*) [609]
-----------------------------------------------
                0.00    0.00       2/32          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> const&) [297]
                0.00    0.00      30/32          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> const&) [270]
[273]    0.0    0.00    0.00      32         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> const&) [273]
                0.00    0.00      32/392644      std::_Rb_tree_rebalance(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&) [97]
                0.00    0.00      32/32          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::_M_create_node(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> const&) [382]
-----------------------------------------------
                0.00    0.00      12/12          std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<Range const, Node*>, std::pair<Range const, Node*>&, std::pair<Range const, Node*>*>, std::pair<Range const, Node*> const&) [194]
[274]    0.0    0.00    0.00      12         std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::insert_unique(std::pair<Range const, Node*> const&) [274]
                0.00    0.00      12/12273       std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<Range const, Node*> const&) [207]
-----------------------------------------------
                0.00    0.00       8/16          readRData(std::vector<ParseTree*, std::allocator<ParseTree*> > const*, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >&) [249]
                0.00    0.00       8/16          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::_M_create_node(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> const&) [286]
[275]    0.0    0.00    0.00      16         SArray::SArray(SArray const&) [275]
                0.00    0.00      16/26670       Range::length() const [204]
                0.00    0.00      64/403140      Index::Index(Index const&) [181]
                0.00    0.00      16/12312       SArray::range() const [334]
-----------------------------------------------
                0.00    0.00       4/4           FuncTab::FuncTab() [262]
[276]    0.0    0.00    0.00       4         FuncTab::insert(InverseLinkFunc const*) [276]
                0.00    0.00       4/6181        Function::name() const [225]
                0.00    0.00       8/32          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> const&) [270]
                0.00    0.00       8/32          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [383]
                0.00    0.00       8/32          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::lower_bound(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [381]
                0.00    0.00       4/4           InverseLinkFunc::linkName() const [426]
-----------------------------------------------
                0.00    0.00       8/8           readRData(std::vector<ParseTree*, std::allocator<ParseTree*> > const*, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >&) [249]
[277]    0.0    0.00    0.00       8         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> const&) [277]
                0.00    0.00       8/8           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> const&) [282]
                0.00    0.00       2/26546       std::_Rb_tree_base_iterator::_M_decrement() [219]
-----------------------------------------------
                0.00    0.00      23/23          DistTab::DistTab() [281]
[278]    0.0    0.00    0.00      23         DistTab::insert(Distribution const*) [278]
                0.00    0.00      23/23          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> const&) [279]
                0.00    0.00      23/1963        Distribution::name() const [361]
                0.00    0.00      23/23          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [393]
                0.00    0.00      23/23          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::lower_bound(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [391]
-----------------------------------------------
                0.00    0.00      23/23          DistTab::insert(Distribution const*) [278]
[279]    0.0    0.00    0.00      23         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> const&) [279]
                0.00    0.00      22/23          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> const&) [280]
                0.00    0.00       1/1           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> const&) [302]
-----------------------------------------------
                0.00    0.00       1/23          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> const&) [302]
                0.00    0.00      22/23          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> const&) [279]
[280]    0.0    0.00    0.00      23         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> const&) [280]
                0.00    0.00      23/392644      std::_Rb_tree_rebalance(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&) [97]
                0.00    0.00      23/23          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::_M_create_node(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> const&) [392]
-----------------------------------------------
                0.00    0.00       1/1           Console::Console(std::basic_ostream<char, std::char_traits<char> >&, std::basic_ostream<char, std::char_traits<char> >&) [260]
[281]    0.0    0.00    0.00       1         DistTab::DistTab() [281]
                0.00    0.00      23/23          DistTab::insert(Distribution const*) [278]
                0.00    0.00       1/1           DBern::DBern() [532]
                0.00    0.00       1/1           DBeta::DBeta() [534]
                0.00    0.00       1/1           DBin::DBin() [516]
                0.00    0.00       1/1           DCat::DCat() [518]
                0.00    0.00       1/1           DChisq::DChisq() [552]
                0.00    0.00       1/1           DDexp::DDexp() [536]
                0.00    0.00       1/1           DDirch::DDirch() [554]
                0.00    0.00       1/1           DExp::DExp() [520]
                0.00    0.00       1/1           DGamma::DGamma() [556]
                0.00    0.00       1/1           DInterval::DInterval() [601]
                0.00    0.00       1/1           DLnorm::DLnorm() [558]
                0.00    0.00       1/1           DLogis::DLogis() [560]
                0.00    0.00       1/1           DMNorm::DMNorm() [562]
                0.00    0.00       1/1           DMState::DMState() [585]
                0.00    0.00       1/1           DMulti::DMulti() [564]
                0.00    0.00       1/1           DNegBin::DNegBin() [587]
                0.00    0.00       1/1           DNorm::DNorm() [538]
                0.00    0.00       1/1           DPar::DPar() [522]
                0.00    0.00       1/1           DPois::DPois() [540]
                0.00    0.00       1/1           DT::DT() [496]
                0.00    0.00       1/1           DUnif::DUnif() [542]
                0.00    0.00       1/1           DWeib::DWeib() [544]
                0.00    0.00       1/1           DWish::DWish() [546]
-----------------------------------------------
                0.00    0.00       8/8           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> const&) [277]
[282]    0.0    0.00    0.00       8         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> const&) [282]
                0.00    0.00       8/8           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::_M_create_node(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> const&) [286]
                0.00    0.00       8/392644      std::_Rb_tree_rebalance(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&) [97]
-----------------------------------------------
                0.00    0.00      21/21          init_tables() [211]
[283]    0.0    0.00    0.00      21         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> const&) [283]
                0.00    0.00      20/21          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> const&) [284]
                0.00    0.00       1/1           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> const&) [300]
-----------------------------------------------
                0.00    0.00       1/21          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> const&) [300]
                0.00    0.00      20/21          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> const&) [283]
[284]    0.0    0.00    0.00      21         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> const&) [284]
                0.00    0.00      21/392644      std::_Rb_tree_rebalance(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&) [97]
                0.00    0.00      21/21          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::_M_create_node(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> const&) [396]
-----------------------------------------------
                0.00    0.00      12/12          SymTab::addVariable(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, Index const&) [266]
[285]    0.0    0.00    0.00      12         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> const&) [285]
                0.00    0.00      11/12          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> const&) [287]
                0.00    0.00       7/26546       std::_Rb_tree_base_iterator::_M_decrement() [219]
                0.00    0.00       1/1           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> const&) [303]
-----------------------------------------------
                0.00    0.00       8/8           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> const&) [282]
[286]    0.0    0.00    0.00       8         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::_M_create_node(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> const&) [286]
                0.00    0.00       8/16          SArray::SArray(SArray const&) [275]
-----------------------------------------------
                0.00    0.00       1/12          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> const&) [303]
                0.00    0.00      11/12          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> const&) [285]
[287]    0.0    0.00    0.00      12         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> const&) [287]
                0.00    0.00      12/392644      std::_Rb_tree_rebalance(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&) [97]
                0.00    0.00      12/12          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::_M_create_node(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> const&) [402]
-----------------------------------------------
                0.00    0.00       8/8           ConjugateFactory::ConjugateFactory() [289]
[288]    0.0    0.00    0.00       8         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> const&) [288]
                0.00    0.00       7/8           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> const&) [290]
                0.00    0.00       2/26546       std::_Rb_tree_base_iterator::_M_decrement() [219]
                0.00    0.00       1/1           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> const&) [301]
-----------------------------------------------
                0.00    0.00       1/1           Console::initialize() [27]
[289]    0.0    0.00    0.00       1         ConjugateFactory::ConjugateFactory() [289]
                0.00    0.00       8/8           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> const&) [288]
                0.00    0.00       8/8           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::lower_bound(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [411]
-----------------------------------------------
                0.00    0.00       1/8           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> const&) [301]
                0.00    0.00       7/8           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> const&) [288]
[290]    0.0    0.00    0.00       8         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> const&) [290]
                0.00    0.00       8/392644      std::_Rb_tree_rebalance(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&) [97]
                0.00    0.00       8/8           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::_M_create_node(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> const&) [412]
-----------------------------------------------
                0.00    0.00       6/6           init_tables() [211]
[291]    0.0    0.00    0.00       6         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> const&) [291]
                0.00    0.00       5/6           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> const&) [292]
                0.00    0.00       2/26546       std::_Rb_tree_base_iterator::_M_decrement() [219]
                0.00    0.00       1/1           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> const&) [299]
-----------------------------------------------
                0.00    0.00       1/6           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> const&) [299]
                0.00    0.00       5/6           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> const&) [291]
[292]    0.0    0.00    0.00       6         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> const&) [292]
                0.00    0.00       6/392644      std::_Rb_tree_rebalance(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&) [97]
                0.00    0.00       6/6           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::_M_create_node(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> const&) [418]
-----------------------------------------------
                0.00    0.00       8/8           Compiler::traverseTree(ParseTree const*, void (Compiler::*)(ParseTree const*), void (Compiler::*)(ParseTree const*)) [37]
[293]    0.0    0.00    0.00       8         CounterTab::pushCounter(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, Range const&) [293]
                0.00    0.00      16/96244414     Index::operator[](unsigned int) const [23]
                0.00    0.00       8/321087      Range::upper() const [212]
                0.00    0.00       8/1293571     Range::lower() const [171]
                0.00    0.00       8/8           Counter::Counter(long, long) [410]
                0.00    0.00       2/2           std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>*, std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > > >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> const&) [444]
-----------------------------------------------
                0.00    0.00       1/1           std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>&, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>*>, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> const&) [198]
[294]    0.0    0.00    0.00       1         std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::insert_unique(std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> const&) [294]
                0.00    0.00       1/6153        std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> const&) [231]
-----------------------------------------------
                0.00    0.00       7/7           StochasticNode::setParameters(std::vector<Node*, std::allocator<Node*> > const&) [148]
[295]    0.0    0.00    0.00       7         DistReal::checkParameterDim(SArray const&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [295]
                0.00    0.00      35/51408928     SArray::length() const [40]
-----------------------------------------------
                                   8             std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >*) [296]
                0.00    0.00       1/2           zzparse() [2]
                0.00    0.00       1/2           __tcf_1 [298]
[296]    0.0    0.00    0.00       2+8       std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >*) [296]
                0.00    0.00       8/14377       SArray::~SArray() [238]
                                   8             std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >*) [296]
-----------------------------------------------
                0.00    0.00       2/2           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> const&) [270]
[297]    0.0    0.00    0.00       2         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> const&) [297]
                0.00    0.00       2/32          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> const&) [273]
-----------------------------------------------
                                                 <spontaneous>
[298]    0.0    0.00    0.00                 __tcf_1 [298]
                0.00    0.00       1/2           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >*) [296]
-----------------------------------------------
                0.00    0.00       1/1           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> const&) [291]
[299]    0.0    0.00    0.00       1         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> const&) [299]
                0.00    0.00       1/6           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> const&) [292]
-----------------------------------------------
                0.00    0.00       1/1           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> const&) [283]
[300]    0.0    0.00    0.00       1         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> const&) [300]
                0.00    0.00       1/21          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> const&) [284]
-----------------------------------------------
                0.00    0.00       1/1           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> const&) [288]
[301]    0.0    0.00    0.00       1         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> const&) [301]
                0.00    0.00       1/8           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> const&) [290]
-----------------------------------------------
                0.00    0.00       1/1           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> const&) [279]
[302]    0.0    0.00    0.00       1         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> const&) [302]
                0.00    0.00       1/23          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> const&) [280]
-----------------------------------------------
                0.00    0.00       1/1           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> const&) [285]
[303]    0.0    0.00    0.00       1         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> const&) [303]
                0.00    0.00       1/12          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> const&) [287]
-----------------------------------------------
                0.00    0.00       2/2           zzlex() [333]
[304]    0.0    0.00    0.00       2         zzwrap [304]
-----------------------------------------------
                0.00    0.00       1/1           yylex() [372]
[305]    0.0    0.00    0.00       1         yywrap [305]
-----------------------------------------------
                0.00    0.00       8/302808      readRData(std::vector<ParseTree*, std::allocator<ParseTree*> > const*, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >&) [249]
                0.00    0.00      12/302808      Compiler::declareVariables(std::vector<ParseTree*, std::allocator<ParseTree*> > const&) [263]
                0.00    0.00      16/302808      Compiler::CounterRange(ParseTree const*) [261]
                0.00    0.00    2044/302808      getLink(ParseTree const*, FuncTab const&) [197]
                0.00    0.00    4088/302808      Compiler::makeSubsetIndex(ParseTree const*, std::vector<SubSetIndex, std::allocator<SubSetIndex> >&, Index const&) <cycle 2> [205]
                0.00    0.00    6132/302808      Compiler::getMixtureNode(ParseTree const*) <cycle 2> [80]
                0.00    0.00    6134/302808      Compiler::allocateLogical(ParseTree const*) [59]
                0.00    0.00    6139/302808      Compiler::setStochasticParameters(ParseTree const*) [46]
                0.00    0.00   10244/302808      getFunction(ParseTree const*, FuncTab const&) [122]
                0.00    0.00   12268/302808      Compiler::setLogicalParameters(ParseTree const*) [47]
                0.00    0.00   12273/302808      Compiler::VarGetNode(ParseTree const*) [74]
                0.00    0.00   12278/302808      getDistribution(ParseTree const*, DistTab const&) [164]
                0.00    0.00   12288/302808      Compiler::getLogicalParameterVector(ParseTree const*, std::vector<Node*, std::allocator<Node*> >&) <cycle 2> [193]
                0.00    0.00   14308/302808      Compiler::getSubSetNode(ParseTree const*) [87]
                0.00    0.00   22494/302808      Compiler::VarGetParameter(ParseTree const*) <cycle 2> [61]
                0.00    0.00   22508/302808      Compiler::Param(ParseTree const*) <cycle 2> [254]
                0.00    0.00   24546/302808      Compiler::VariableSubsetRange(ParseTree const*) [82]
                0.00    0.00   24554/302808      Compiler::traverseTree(ParseTree const*, void (Compiler::*)(ParseTree const*), void (Compiler::*)(ParseTree const*)) [37]
                0.00    0.00   26614/302808      Compiler::getLogicalParameter(ParseTree const*) <cycle 2> [54]
                0.00    0.00   40896/302808      Compiler::getRange(std::vector<ParseTree*, std::allocator<ParseTree*> > const&, Range const&, Range&) <cycle 1> [116]
                0.00    0.00   42964/302808      Compiler::constantExpression(ParseTree const*, double&) <cycle 1> [161]
[312]    0.0    0.00    0.00  302808         ParseTree::treeClass() const [312]
-----------------------------------------------
                0.00    0.00   26626/236427      Graph::isClosed() [81]
                0.00    0.00   37421/236427      DeterministicNode::initialize() [92]
                0.00    0.00  172380/236427      Graph::getSortedNodes(std::vector<Node*, std::allocator<Node*> >&) [38]
[313]    0.0    0.00    0.00  236427         Node::parents() const [313]
-----------------------------------------------
                0.00    0.00   26626/232325      Graph::isClosed() [81]
                0.00    0.00   26626/232325      findDescendant(Node*, Node*, Graph const*, GraphMarks&) [72]
                0.00    0.00   28188/232325      Sampler::classifyChildren(std::set<StochasticNode const*, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> > const&, std::vector<StochasticNode*, std::allocator<StochasticNode*> >&, std::vector<DeterministicNode*, std::allocator<DeterministicNode*> >&) [30]
                0.00    0.00  150885/232325      classifyNode(Node*, Graph&, Graph&) [51]
[314]    0.0    0.00    0.00  232325         Node::children() const [314]
-----------------------------------------------
                0.00    0.00       3/94079       Compiler::fillConstants() [146]
                0.00    0.00       3/94079       Compiler::writeValuesToGraph(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, bool) [206]
                0.00    0.00       4/94079       SymTab::writeData(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, bool) [195]
                0.00    0.00    8186/94079       Compiler::VarGetParameter(ParseTree const*) <cycle 2> [61]
                0.00    0.00   10220/94079       Compiler::getMixtureNode(ParseTree const*) <cycle 2> [80]
                0.00    0.00   12273/94079       NodeArray::set(Node*, Range const&) [56]
                0.00    0.00   14308/94079       Compiler::getSubSetNode(ParseTree const*) [87]
                0.00    0.00   49082/94079       Compiler::VariableSubsetRange(ParseTree const*) [82]
[315]    0.0    0.00    0.00   94079         NodeArray::range() const [315]
-----------------------------------------------
                0.00    0.00    6139/57063       Compiler::setStochasticParameters(ParseTree const*) [46]
                0.00    0.00   24298/57063       Sampler::classifyChildren(std::set<StochasticNode const*, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> > const&, std::vector<StochasticNode*, std::allocator<StochasticNode*> >&, std::vector<DeterministicNode*, std::allocator<DeterministicNode*> >&) [30]
                0.00    0.00   26626/57063       Model::chooseSamplers(std::vector<SamplerFactory const*, std::allocator<SamplerFactory const*> > const&) [28]
[316]    0.0    0.00    0.00   57063         asStochastic(Node*) [316]
-----------------------------------------------
                0.00    0.00    4210/54519       NodeArray::setValue(SArray const&, bool) [172]
                0.00    0.00   50309/54519       classifyNode(Node*, Graph&, Graph&) [51]
[317]    0.0    0.00    0.00   54519         isDeterministic(Node const*) [317]
-----------------------------------------------
                0.00    0.00       3/51137       Compiler::fillConstants() [146]
                0.00    0.00    2044/51137       Compiler::getMixtureNode(ParseTree const*) <cycle 2> [80]
                0.00    0.00    6139/51137       NodeArray::setValue(SArray const&, bool) [172]
                0.00    0.00   18405/51137       NodeArray::rangeContainsSetNodes(Range const&) const [107]
                0.00    0.00   24546/51137       NodeArray::set(Node*, Range const&) [56]
[318]    0.0    0.00    0.00   51137         Index::~Index() [318]
-----------------------------------------------
                0.00    0.00   50295/50295       Sampler::classifyChildren(std::set<StochasticNode const*, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> > const&, std::vector<StochasticNode*, std::allocator<StochasticNode*> >&, std::vector<DeterministicNode*, std::allocator<DeterministicNode*> >&) [30]
[319]    0.0    0.00    0.00   50295         asDeterministic(Node*) [319]
-----------------------------------------------
                               38852             Compiler::getRange(std::vector<ParseTree*, std::allocator<ParseTree*> > const&, Range const&, Range&) <cycle 1> [116]
                0.00    0.00       8/42956       Compiler::declareVariables(std::vector<ParseTree*, std::allocator<ParseTree*> > const&) [263]
                0.00    0.00      16/42956       Compiler::CounterRange(ParseTree const*) [261]
                0.00    0.01    4088/42956       Compiler::makeSubsetIndex(ParseTree const*, std::vector<SubSetIndex, std::allocator<SubSetIndex> >&, Index const&) <cycle 2> [205]
[320]    0.0    0.00    0.00   42964         Compiler::indexExpression(ParseTree const*, long&) <cycle 1> [320]
                0.00    0.00   36832/36832       asInteger(double) [322]
                               42964             Compiler::constantExpression(ParseTree const*, double&) <cycle 1> [161]
-----------------------------------------------
                0.00    0.00   12273/36861       NodeArray::set(Node*, Range const&) [56]
                0.00    0.00   12287/36861       LogicalNode::setParameters(std::vector<Node*, std::allocator<Node*> > const&) [112]
                0.00    0.00   12301/36861       makeName(Function const*, std::vector<Node*, std::allocator<Node*> > const&) [191]
[321]    0.0    0.00    0.00   36861         Node::name() const [321]
-----------------------------------------------
                0.00    0.00   36832/36832       Compiler::indexExpression(ParseTree const*, long&) <cycle 1> [320]
[322]    0.0    0.00    0.00   36832         asInteger(double) [322]
-----------------------------------------------
                0.00    0.00   36808/36808       Compiler::constantExpression(ParseTree const*, double&) <cycle 1> [161]
[323]    0.0    0.00    0.00   36808         Counter::value() const [323]
-----------------------------------------------
                0.00    0.00    8306/33891       std::_Rb_tree_rebalance_for_erase(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&, std::_Rb_tree_node_base*&, std::_Rb_tree_node_base*&) [163]
                0.00    0.00   25585/33891       std::_Rb_tree_rebalance(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&) [97]
[324]    0.0    0.00    0.00   33891         std::_Rb_tree_rotate_right(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&) [324]
-----------------------------------------------
                0.00    0.00    4112/32760       setConstantNameToValue(ConstantNode*) [199]
                0.00    0.00   12268/32760       printRange(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, Range const&) [141]
                0.00    0.00   16380/32760       std::basic_stringbuf<char, std::char_traits<char>, std::allocator<char> >::overflow(int) [169]
[325]    0.0    0.00    0.00   32760         std::basic_stringbuf<char, std::char_traits<char>, std::allocator<char> >::_M_really_sync(unsigned int, unsigned int) [325]
-----------------------------------------------
                0.00    0.00   12299/32755       Range::operator==(Range const&) const [335]
                0.00    0.00   20456/32755       Index::operator!=(Index const&) const [330]
[326]    0.0    0.00    0.00   32755         Index::operator==(Index const&) const [326]
-----------------------------------------------
                0.00    0.00       3/24544       Compiler::writeValuesToGraph(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, bool) [206]
                0.00    0.00       4/24544       SymTab::writeData(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, bool) [195]
                0.00    0.00   12264/24544       MixtureNode::MixtureNode(Node*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > const&) [150]
                0.00    0.00   12273/24544       NodeArray::set(Node*, Range const&) [56]
[327]    0.0    0.00    0.00   24544         SArray::dim(bool) const [327]
-----------------------------------------------
                0.00    0.00   24298/24298       Sampler::classifyChildren(std::set<StochasticNode const*, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> > const&, std::vector<StochasticNode*, std::allocator<StochasticNode*> >&, std::vector<DeterministicNode*, std::allocator<DeterministicNode*> >&) [30]
[328]    0.0    0.00    0.00   24298         std::_Rb_tree<StochasticNode const*, StochasticNode const*, std::_Identity<StochasticNode const*>, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> >::find(StochasticNode const* const&) const [328]
-----------------------------------------------
                0.00    0.00    4112/22538       setConstantNameToValue(ConstantNode*) [199]
                0.00    0.00    6153/22538       LogicalNode::setParameters(std::vector<Node*, std::allocator<Node*> > const&) [112]
                0.00    0.00   12273/22538       NodeArray::set(Node*, Range const&) [56]
[329]    0.0    0.00    0.00   22538         Node::setName(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [329]
-----------------------------------------------
                0.00    0.00       3/20456       Compiler::writeValuesToGraph(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, bool) [206]
                0.00    0.00       4/20456       SymTab::writeData(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, bool) [195]
                0.00    0.00    8176/20456       MixtureNode::MixtureNode(Node*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > const&) [150]
                0.00    0.00   12273/20456       NodeArray::set(Node*, Range const&) [56]
[330]    0.0    0.00    0.00   20456         Index::operator!=(Index const&) const [330]
                0.00    0.00   20456/32755       Index::operator==(Index const&) const [326]
-----------------------------------------------
                0.00    0.00    6153/18440       LogicalFactory::getLogicalNode(Function const*, std::vector<Node*, std::allocator<Node*> > const&) [64]
                0.00    0.00   12287/18440       LogicalNode::setParameters(std::vector<Node*, std::allocator<Node*> > const&) [112]
[331]    0.0    0.00    0.00   18440         Function::checkParameterLength(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [331]
-----------------------------------------------
                0.00    0.00   16352/16352       std::vector<SubSetIndex, std::allocator<SubSetIndex> >::_M_insert_aux(__gnu_cxx::__normal_iterator<SubSetIndex*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, SubSetIndex const&) [339]
[332]    0.0    0.00    0.00   16352         __gnu_cxx::__normal_iterator<SubSetIndex*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > > std::__uninitialized_copy_aux<__gnu_cxx::__normal_iterator<SubSetIndex*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, __gnu_cxx::__normal_iterator<SubSetIndex*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > > >(__gnu_cxx::__normal_iterator<SubSetIndex*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, __gnu_cxx::__normal_iterator<SubSetIndex*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, __gnu_cxx::__normal_iterator<SubSetIndex*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, __false_type) [332]
-----------------------------------------------
                0.00    0.00   12337/12337       zzparse() [2]
[333]    0.0    0.00    0.00   12337         zzlex() [333]
                0.00    0.00       9/9           yy_get_next_buffer() [405]
                0.00    0.00       7/7           yy_get_previous_state() [414]
                0.00    0.00       2/2           zzwrap [304]
                0.00    0.00       2/2           return_to_main_buffer() [440]
                0.00    0.00       1/9           zz_load_buffer_state() [406]
                0.00    0.00       1/3           zz_create_buffer(_IO_FILE*, int) [429]
-----------------------------------------------
                0.00    0.00       7/12312       NodeArray::setValue(SArray const&, bool) [172]
                0.00    0.00      16/12312       Compiler::constantExpression(ParseTree const*, double&) <cycle 1> [161]
                0.00    0.00      16/12312       SArray::SArray(SArray const&) [275]
                0.00    0.00   12273/12312       NodeArray::set(Node*, Range const&) [56]
[334]    0.0    0.00    0.00   12312         SArray::range() const [334]
-----------------------------------------------
                0.00    0.00       7/12280       NodeArray::setValue(SArray const&, bool) [172]
                0.00    0.00   12273/12280       NodeArray::set(Node*, Range const&) [56]
[335]    0.0    0.00    0.00   12280         Range::operator==(Range const&) const [335]
                0.00    0.00   12299/32755       Index::operator==(Index const&) const [326]
-----------------------------------------------
                0.00    0.00   12273/12273       NodeArray::set(Node*, Range const&) [56]
[336]    0.0    0.00    0.00   12273         NodeArray::name() const [336]
-----------------------------------------------
                0.00    0.00      14/10270       Compiler::Param(ParseTree const*) <cycle 2> [254]
                0.00    0.00      16/10270       Compiler::constantExpression(ParseTree const*, double&) <cycle 1> [161]
                0.00    0.00    4098/10270       Compiler::getLogicalParameter(ParseTree const*) <cycle 2> [54]
                0.00    0.00    6142/10270       readRData(std::vector<ParseTree*, std::allocator<ParseTree*> > const*, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >&) [249]
[337]    0.0    0.00    0.00   10270         ParseTree::value() const [337]
-----------------------------------------------
                0.00    0.00   10259/10259       LogicalFactory::getLogicalNode(Function const*, std::vector<Node*, std::allocator<Node*> > const&) [64]
[338]    0.0    0.00    0.00   10259         std::allocator<Node*>::~allocator() [338]
-----------------------------------------------
                0.00    0.00    4088/8176        Compiler::makeSubsetIndex(ParseTree const*, std::vector<SubSetIndex, std::allocator<SubSetIndex> >&, Index const&) <cycle 2> [205]
                0.00    0.00    4088/8176        Compiler::getMixtureNode(ParseTree const*) <cycle 2> [80]
[339]    0.0    0.00    0.00    8176         std::vector<SubSetIndex, std::allocator<SubSetIndex> >::_M_insert_aux(__gnu_cxx::__normal_iterator<SubSetIndex*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, SubSetIndex const&) [339]
                0.00    0.00   16352/16352       __gnu_cxx::__normal_iterator<SubSetIndex*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > > std::__uninitialized_copy_aux<__gnu_cxx::__normal_iterator<SubSetIndex*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, __gnu_cxx::__normal_iterator<SubSetIndex*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > > >(__gnu_cxx::__normal_iterator<SubSetIndex*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, __gnu_cxx::__normal_iterator<SubSetIndex*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, __gnu_cxx::__normal_iterator<SubSetIndex*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, __false_type) [332]
-----------------------------------------------
                0.00    0.00    8176/8176        MixtureNode::MixtureNode(Node*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > const&) [150]
[340]    0.0    0.00    0.00    8176         std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::lower_bound(long const&) [340]
-----------------------------------------------
                0.00    0.00    8176/8176        std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<long const, Node*> const&) [234]
[341]    0.0    0.00    0.00    8176         std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::_M_create_node(std::pair<long const, Node*> const&) [341]
-----------------------------------------------
                0.00    0.00    7832/7832        Sampler::classifyChildren(std::set<StochasticNode const*, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> > const&, std::vector<StochasticNode*, std::allocator<StochasticNode*> >&, std::vector<DeterministicNode*, std::allocator<DeterministicNode*> >&) [30]
[342]    0.0    0.00    0.00    7832         std::vector<DeterministicNode*, std::allocator<DeterministicNode*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<DeterministicNode**, std::vector<DeterministicNode*, std::allocator<DeterministicNode*> > >, DeterministicNode* const&) [342]
-----------------------------------------------
                0.00    0.00    7000/7000        DistReal::lowerLimit(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [157]
[343]    0.0    0.00    0.00    7000         lowerDefault(Support) [343]
-----------------------------------------------
                0.00    0.00    7000/7000        DistReal::upperLimit(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [235]
[344]    0.0    0.00    0.00    7000         upperDefault(Support) [344]
-----------------------------------------------
                0.00    0.00     171/6330        yyparse() [487]
                0.00    0.00    6159/6330        zzparse() [2]
[345]    0.0    0.00    0.00    6330         ParseTree::ParseTree(TreeClass) [345]
-----------------------------------------------
                0.00    0.00      27/6169        yyparse() [487]
                0.00    0.00    6142/6169        zzparse() [2]
[346]    0.0    0.00    0.00    6169         ParseTree::setValue(double) [346]
-----------------------------------------------
                0.00    0.00    6153/6153        LogicalFactory::getLogicalNode(Function const*, std::vector<Node*, std::allocator<Node*> > const&) [64]
[347]    0.0    0.00    0.00    6153         SArray const** std::fill_n<SArray const**, unsigned int, SArray const*>(SArray const**, unsigned int, SArray const* const&) [347]
-----------------------------------------------
                0.00    0.00    6140/6140        Compiler::constantExpression(ParseTree const*, double&) <cycle 1> [161]
[348]    0.0    0.00    0.00    6140         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [348]
-----------------------------------------------
                0.00    0.00    6134/6134        Compiler::setLogicalParameters(ParseTree const*) [47]
[349]    0.0    0.00    0.00    6134         asLogical(Node*) [349]
-----------------------------------------------
                0.00    0.00    6006/6006        ScalarFunc::evaluate(SArray&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [11]
[350]    0.0    0.00    0.00    6006         Divide::evaluate(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [350]
-----------------------------------------------
                0.00    0.00    4108/4108        Compiler::traverseTree(ParseTree const*, void (Compiler::*)(ParseTree const*), void (Compiler::*)(ParseTree const*)) [37]
[351]    0.0    0.00    0.00    4108         Counter::atEnd() const [351]
-----------------------------------------------
                0.00    0.00    4106/4106        LogicalFactory::getLogicalNode(Function const*, std::vector<Node*, std::allocator<Node*> > const&) [64]
[352]    0.0    0.00    0.00    4106         std::__simple_alloc<Node*, std::__default_alloc_template<true, 0> >::allocate(unsigned int) [352]
-----------------------------------------------
                0.00    0.00    4106/4106        LogicalFactory::getLogicalNode(Function const*, std::vector<Node*, std::allocator<Node*> > const&) [64]
[353]    0.0    0.00    0.00    4106         std::vector<Node*, std::allocator<Node*> >::~vector() [353]
-----------------------------------------------
                0.00    0.00    4100/4100        Compiler::traverseTree(ParseTree const*, void (Compiler::*)(ParseTree const*), void (Compiler::*)(ParseTree const*)) [37]
[354]    0.0    0.00    0.00    4100         Counter::increment() [354]
-----------------------------------------------
                0.00    0.00    4088/4088        Compiler::makeSubsetIndex(ParseTree const*, std::vector<SubSetIndex, std::allocator<SubSetIndex> >&, Index const&) <cycle 2> [205]
[355]    0.0    0.00    0.00    4088         SubSetIndex::SubSetIndex() [355]
-----------------------------------------------
                0.00    0.00    4004/4004        ScalarFunc::evaluate(SArray&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [11]
[356]    0.0    0.00    0.00    4004         Exp::evaluate(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [356]
-----------------------------------------------
                0.00    0.00    3967/3967        Sampler::classifyChildren(std::set<StochasticNode const*, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> > const&, std::vector<StochasticNode*, std::allocator<StochasticNode*> >&, std::vector<DeterministicNode*, std::allocator<DeterministicNode*> >&) [30]
[357]    0.0    0.00    0.00    3967         std::vector<StochasticNode*, std::allocator<StochasticNode*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<StochasticNode**, std::vector<StochasticNode*, std::allocator<StochasticNode*> > >, StochasticNode* const&) [357]
-----------------------------------------------
                0.00    0.00       1/3891        Compiler::Compiler(Graph&, SymTab&, FuncTab const&, DistTab const&, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&) [594]
                0.00    0.00       1/3891        Model::Model() [551]
                0.00    0.00       1/3891        Model::chooseSamplers(std::vector<SamplerFactory const*, std::allocator<SamplerFactory const*> > const&) [28]
                0.00    0.00      12/3891        NodeArray::NodeArray(Index const&) [269]
                0.00    0.00    3876/3891        Sampler::classifyChildren(std::set<StochasticNode const*, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> > const&, std::vector<StochasticNode*, std::allocator<StochasticNode*> >&, std::vector<DeterministicNode*, std::allocator<DeterministicNode*> >&) [30]
[358]    0.0    0.00    0.00    3891         Graph::Graph() [358]
-----------------------------------------------
                                8176             std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::_M_erase(std::_Rb_tree_node<std::pair<long const, Node*> >*) [359]
                0.00    0.00    2044/2044        MixtureNode::~MixtureNode() [160]
[359]    0.0    0.00    0.00    2044+8176    std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::_M_erase(std::_Rb_tree_node<std::pair<long const, Node*> >*) [359]
                                8176             std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::_M_erase(std::_Rb_tree_node<std::pair<long const, Node*> >*) [359]
-----------------------------------------------
                0.00    0.00    2044/2044        OffsetNode::OffsetNode(Range const&, std::vector<SubSetIndex, std::allocator<SubSetIndex> > const&) [178]
[360]    0.0    0.00    0.00    2044         SubSetIndex* std::__uninitialized_copy_aux<__gnu_cxx::__normal_iterator<SubSetIndex const*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, SubSetIndex*>(__gnu_cxx::__normal_iterator<SubSetIndex const*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, __gnu_cxx::__normal_iterator<SubSetIndex const*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, SubSetIndex*, __false_type) [360]
-----------------------------------------------
                0.00    0.00       4/1963        getDist(StochasticNode const*) [210]
                0.00    0.00      23/1963        DistTab::insert(Distribution const*) [278]
                0.00    0.00    1936/1963        ConjugateFactory::canSample(StochasticNode const*) const [136]
[361]    0.0    0.00    0.00    1963         Distribution::name() const [361]
-----------------------------------------------
                0.00    0.00    1941/1941        GraphMarks::GraphMarks(Graph const&) [89]
[362]    0.0    0.00    0.00    1941         Graph::nodes() const [362]
-----------------------------------------------
                0.00    0.00    1938/1938        std::_Rb_tree<StochasticNode const*, StochasticNode const*, std::_Identity<StochasticNode const*>, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, StochasticNode const* const&) [246]
[363]    0.0    0.00    0.00    1938         std::_Rb_tree<StochasticNode const*, StochasticNode const*, std::_Identity<StochasticNode const*>, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> >::_M_create_node(StochasticNode const* const&) [363]
-----------------------------------------------
                                1938             std::_Rb_tree<StochasticNode const*, StochasticNode const*, std::_Identity<StochasticNode const*>, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> >::_M_erase(std::_Rb_tree_node<StochasticNode const*>*) [364]
                0.00    0.00       2/1938        GibbsSampler::classifyChildren(StochasticNode const*, std::vector<StochasticNode*, std::allocator<StochasticNode*> >&, std::vector<DeterministicNode*, std::allocator<DeterministicNode*> >&) [232]
                0.00    0.00    1936/1938        Sampler::Sampler(std::vector<StochasticNode*, std::allocator<StochasticNode*> > const&) [32]
[364]    0.0    0.00    0.00    1938+1938    std::_Rb_tree<StochasticNode const*, StochasticNode const*, std::_Identity<StochasticNode const*>, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> >::_M_erase(std::_Rb_tree_node<StochasticNode const*>*) [364]
                                1938             std::_Rb_tree<StochasticNode const*, StochasticNode const*, std::_Identity<StochasticNode const*>, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> >::_M_erase(std::_Rb_tree_node<StochasticNode const*>*) [364]
-----------------------------------------------
                0.00    0.00       7/1936        SliceSampler::~SliceSampler() [415]
                0.00    0.00    1929/1936        FiniteSampler::~FiniteSampler() [369]
[365]    0.0    0.00    0.00    1936         Sampler::~Sampler() [365]
-----------------------------------------------
                0.00    0.00    1936/1936        ConjugateFactory::canSample(StochasticNode const*) const [136]
[366]    0.0    0.00    0.00    1936         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [366]
-----------------------------------------------
                0.00    0.00    1936/1936        std::_Rb_tree<StochasticNode*, StochasticNode*, std::_Identity<StochasticNode*>, std::less<StochasticNode*>, std::allocator<StochasticNode*> >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, StochasticNode* const&) [247]
[367]    0.0    0.00    0.00    1936         std::_Rb_tree<StochasticNode*, StochasticNode*, std::_Identity<StochasticNode*>, std::less<StochasticNode*>, std::allocator<StochasticNode*> >::_M_create_node(StochasticNode* const&) [367]
-----------------------------------------------
                0.00    0.00    1936/1936        GibbsSampler::GibbsSampler(StochasticNode*) [31]
[368]    0.0    0.00    0.00    1936         StochasticNode** std::fill_n<StochasticNode**, unsigned int, StochasticNode*>(StochasticNode**, unsigned int, StochasticNode* const&) [368]
-----------------------------------------------
                0.00    0.00    1929/1929        Model::~Model() [259]
[369]    0.0    0.00    0.00    1929         FiniteSampler::~FiniteSampler() [369]
                0.00    0.00    1929/1936        Sampler::~Sampler() [365]
-----------------------------------------------
                0.00    0.00    1929/1929        DistFinite::randomSample(SArray&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [252]
[370]    0.0    0.00    0.00    1929         DBern::randomSample(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [370]
-----------------------------------------------
                0.00    0.00    1001/1001        ScalarFunc::evaluate(SArray&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [11]
[371]    0.0    0.00    0.00    1001         UnaryMinus::evaluate(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [371]
-----------------------------------------------
                0.00    0.00     286/286         yyparse() [487]
[372]    0.0    0.00    0.00     286         yylex() [372]
                0.00    0.00       3/3           yy_get_next_buffer() [430]
                0.00    0.00       2/2           yy_get_previous_state() [441]
                0.00    0.00       1/3           yy_load_buffer_state() [431]
                0.00    0.00       1/1           yywrap [305]
                0.00    0.00       1/1           yy_create_buffer(_IO_FILE*, int) [467]
-----------------------------------------------
                0.00    0.00       2/141         setParameters(ParseTree*, ParseTree*, ParseTree*) [466]
                0.00    0.00      40/141         zzparse() [2]
                0.00    0.00      43/141         yyparse() [487]
                0.00    0.00      56/141         setParameters(ParseTree*, ParseTree*, ParseTree*) [384]
[373]    0.0    0.00    0.00     141         std::vector<ParseTree*, std::allocator<ParseTree*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<ParseTree**, std::vector<ParseTree*, std::allocator<ParseTree*> > >, ParseTree* const&) [373]
-----------------------------------------------
                0.00    0.00       1/116         setParameters(ParseTree*, ParseTree*, ParseTree*) [466]
                0.00    0.00       5/116         setParameters(ParseTree*, std::vector<ParseTree*, std::allocator<ParseTree*> >*) [419]
                0.00    0.00      11/116         setParameters(ParseTree*, ParseTree*) [404]
                0.00    0.00      22/116         setParameters(ParseTree*, ParseTree*) [394]
                0.00    0.00      28/116         setParameters(ParseTree*, ParseTree*, ParseTree*) [384]
                0.00    0.00      49/116         setParameters(ParseTree*, std::vector<ParseTree*, std::allocator<ParseTree*> >*) [380]
[374]    0.0    0.00    0.00     116         ParseTree::setParameters(std::vector<ParseTree*, std::allocator<ParseTree*> > const&) [374]
                0.00    0.00     116/116         std::vector<ParseTree*, std::allocator<ParseTree*> >::operator=(std::vector<ParseTree*, std::allocator<ParseTree*> > const&) [376]
-----------------------------------------------
                0.00    0.00     116/116         std::vector<ParseTree*, std::allocator<ParseTree*> >::operator=(std::vector<ParseTree*, std::allocator<ParseTree*> > const&) [376]
[375]    0.0    0.00    0.00     116         ParseTree** std::vector<ParseTree*, std::allocator<ParseTree*> >::_M_allocate_and_copy<__gnu_cxx::__normal_iterator<ParseTree* const*, std::vector<ParseTree*, std::allocator<ParseTree*> > > >(unsigned int, __gnu_cxx::__normal_iterator<ParseTree* const*, std::vector<ParseTree*, std::allocator<ParseTree*> > >, __gnu_cxx::__normal_iterator<ParseTree* const*, std::vector<ParseTree*, std::allocator<ParseTree*> > >) [375]
-----------------------------------------------
                0.00    0.00     116/116         ParseTree::setParameters(std::vector<ParseTree*, std::allocator<ParseTree*> > const&) [374]
[376]    0.0    0.00    0.00     116         std::vector<ParseTree*, std::allocator<ParseTree*> >::operator=(std::vector<ParseTree*, std::allocator<ParseTree*> > const&) [376]
                0.00    0.00     116/116         ParseTree** std::vector<ParseTree*, std::allocator<ParseTree*> >::_M_allocate_and_copy<__gnu_cxx::__normal_iterator<ParseTree* const*, std::vector<ParseTree*, std::allocator<ParseTree*> > > >(unsigned int, __gnu_cxx::__normal_iterator<ParseTree* const*, std::vector<ParseTree*, std::allocator<ParseTree*> > >, __gnu_cxx::__normal_iterator<ParseTree* const*, std::vector<ParseTree*, std::allocator<ParseTree*> > >) [375]
-----------------------------------------------
                0.00    0.00       8/89          setName(ParseTree*, std::basic_string<char, std::char_traits<char>, std::allocator<char> >*) [407]
                0.00    0.00      81/89          setName(ParseTree*, std::basic_string<char, std::char_traits<char>, std::allocator<char> >*) [378]
[377]    0.0    0.00    0.00      89         ParseTree::setName(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [377]
-----------------------------------------------
                0.00    0.00      81/81          yyparse() [487]
[378]    0.0    0.00    0.00      81         setName(ParseTree*, std::basic_string<char, std::char_traits<char>, std::allocator<char> >*) [378]
                0.00    0.00      81/89          ParseTree::setName(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [377]
-----------------------------------------------
                0.00    0.00       7/77          zzparse() [2]
                0.00    0.00      11/77          setParameters(ParseTree*, ParseTree*) [404]
                0.00    0.00      22/77          setParameters(ParseTree*, ParseTree*) [394]
                0.00    0.00      37/77          yyparse() [487]
[379]    0.0    0.00    0.00      77         ParseTree** std::fill_n<ParseTree**, unsigned int, ParseTree*>(ParseTree**, unsigned int, ParseTree* const&) [379]
-----------------------------------------------
                0.00    0.00      49/49          yyparse() [487]
[380]    0.0    0.00    0.00      49         setParameters(ParseTree*, std::vector<ParseTree*, std::allocator<ParseTree*> >*) [380]
                0.00    0.00      49/116         ParseTree::setParameters(std::vector<ParseTree*, std::allocator<ParseTree*> > const&) [374]
-----------------------------------------------
                0.00    0.00       8/32          FuncTab::insert(InverseLinkFunc const*) [276]
                0.00    0.00      24/32          FuncTab::insert(Function const*) [264]
[381]    0.0    0.00    0.00      32         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::lower_bound(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [381]
-----------------------------------------------
                0.00    0.00      32/32          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> const&) [273]
[382]    0.0    0.00    0.00      32         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::_M_create_node(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> const&) [382]
-----------------------------------------------
                0.00    0.00       8/32          FuncTab::insert(InverseLinkFunc const*) [276]
                0.00    0.00      24/32          FuncTab::insert(Function const*) [264]
[383]    0.0    0.00    0.00      32         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [383]
-----------------------------------------------
                0.00    0.00      28/28          yyparse() [487]
[384]    0.0    0.00    0.00      28         setParameters(ParseTree*, ParseTree*, ParseTree*) [384]
                0.00    0.00      56/141         std::vector<ParseTree*, std::allocator<ParseTree*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<ParseTree**, std::vector<ParseTree*, std::allocator<ParseTree*> > >, ParseTree* const&) [373]
                0.00    0.00      28/116         ParseTree::setParameters(std::vector<ParseTree*, std::allocator<ParseTree*> > const&) [374]
-----------------------------------------------
                0.00    0.00       1/28          Inverse::Inverse() [589]
                0.00    0.00       1/28          Mexp::Mexp() [526]
                0.00    0.00       1/28          Max::Max() [506]
                0.00    0.00       1/28          Min::Min() [508]
                0.00    0.00      24/28          ScalarFunc::ScalarFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [388]
[385]    0.0    0.00    0.00      28         Function::Function(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [385]
-----------------------------------------------
                0.00    0.00       1/28          LogGam::~LogGam() [577]
                0.00    0.00       1/28          Phi::~Phi() [511]
                0.00    0.00       1/28          Logit::~Logit() [549]
                0.00    0.00       1/28          Pow::~Pow() [513]
                0.00    0.00       1/28          UnaryMinus::~UnaryMinus() [492]
                0.00    0.00       1/28          Inverse::~Inverse() [590]
                0.00    0.00       1/28          LogDet::~LogDet() [575]
                0.00    0.00       1/28          Mexp::~Mexp() [527]
                0.00    0.00       1/28          Add::~Add() [501]
                0.00    0.00       1/28          Max::~Max() [507]
                0.00    0.00       1/28          Probit::~Probit() [579]
                0.00    0.00       1/28          InProd::~InProd() [573]
                0.00    0.00       1/28          Mean::~Mean() [525]
                0.00    0.00       1/28          SD::~SD() [499]
                0.00    0.00       1/28          ICLogLog::~ICLogLog() [596]
                0.00    0.00       1/28          Min::~Min() [509]
                0.00    0.00       1/28          Sqrt::~Sqrt() [529]
                0.00    0.00       1/28          CLogLog::~CLogLog() [582]
                0.00    0.00       1/28          ILogit::~ILogit() [571]
                0.00    0.00       1/28          Multiply::~Multiply() [598]
                0.00    0.00       1/28          Step::~Step() [531]
                0.00    0.00       1/28          Divide::~Divide() [567]
                0.00    0.00       1/28          Subtract::~Subtract() [600]
                0.00    0.00       1/28          Equals::~Equals() [569]
                0.00    0.00       1/28          Log::~Log() [505]
                0.00    0.00       1/28          Sum::~Sum() [515]
                0.00    0.00       1/28          Exp::~Exp() [503]
                0.00    0.00       1/28          LogFact::~LogFact() [592]
[386]    0.0    0.00    0.00      28         Function::~Function() [386]
-----------------------------------------------
                0.00    0.00      25/25          yyparse() [487]
[387]    0.0    0.00    0.00      25         ParseTree::setOperator(Operator) [387]
-----------------------------------------------
                0.00    0.00       1/24          LogGam::LogGam() [576]
                0.00    0.00       1/24          Logit::Logit() [548]
                0.00    0.00       1/24          Pow::Pow() [512]
                0.00    0.00       1/24          UnaryMinus::UnaryMinus() [491]
                0.00    0.00       1/24          LogDet::LogDet() [574]
                0.00    0.00       1/24          Add::Add() [500]
                0.00    0.00       1/24          Probit::Probit() [578]
                0.00    0.00       1/24          InProd::InProd() [572]
                0.00    0.00       1/24          Mean::Mean() [524]
                0.00    0.00       1/24          SD::SD() [498]
                0.00    0.00       1/24          Sqrt::Sqrt() [528]
                0.00    0.00       1/24          CLogLog::CLogLog() [581]
                0.00    0.00       1/24          Multiply::Multiply() [597]
                0.00    0.00       1/24          Step::Step() [530]
                0.00    0.00       1/24          Divide::Divide() [566]
                0.00    0.00       1/24          Subtract::Subtract() [599]
                0.00    0.00       1/24          Equals::Equals() [568]
                0.00    0.00       1/24          Log::Log() [504]
                0.00    0.00       1/24          Sum::Sum() [514]
                0.00    0.00       1/24          LogFact::LogFact() [591]
                0.00    0.00       4/24          InverseLinkFunc::InverseLinkFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [425]
[388]    0.0    0.00    0.00      24         ScalarFunc::ScalarFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [388]
                0.00    0.00      24/28          Function::Function(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [385]
-----------------------------------------------
                0.00    0.00       1/23          DDirch::DDirch() [554]
                0.00    0.00       1/23          DMNorm::DMNorm() [562]
                0.00    0.00       1/23          DMulti::DMulti() [564]
                0.00    0.00       1/23          DWish::DWish() [546]
                0.00    0.00       2/23          DistDiscrete::DistDiscrete(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [443]
                0.00    0.00       5/23          DistFinite::DistFinite(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [422]
                0.00    0.00      12/23          DistReal::DistReal(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int, Support, int, int) [397]
[389]    0.0    0.00    0.00      23         Distribution::Distribution(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [389]
-----------------------------------------------
                0.00    0.00       1/23          DBern::~DBern() [533]
                0.00    0.00       1/23          DBeta::~DBeta() [535]
                0.00    0.00       1/23          DBin::~DBin() [517]
                0.00    0.00       1/23          DCat::~DCat() [519]
                0.00    0.00       1/23          DChisq::~DChisq() [553]
                0.00    0.00       1/23          DDexp::~DDexp() [537]
                0.00    0.00       1/23          DDirch::~DDirch() [555]
                0.00    0.00       1/23          DExp::~DExp() [521]
                0.00    0.00       1/23          DGamma::~DGamma() [557]
                0.00    0.00       1/23          DLnorm::~DLnorm() [559]
                0.00    0.00       1/23          DLogis::~DLogis() [561]
                0.00    0.00       1/23          DMNorm::~DMNorm() [563]
                0.00    0.00       1/23          DMulti::~DMulti() [565]
                0.00    0.00       1/23          DNegBin::~DNegBin() [588]
                0.00    0.00       1/23          DNorm::~DNorm() [539]
                0.00    0.00       1/23          DPar::~DPar() [523]
                0.00    0.00       1/23          DPois::~DPois() [541]
                0.00    0.00       1/23          DT::~DT() [497]
                0.00    0.00       1/23          DUnif::~DUnif() [543]
                0.00    0.00       1/23          DWeib::~DWeib() [545]
                0.00    0.00       1/23          DWish::~DWish() [547]
                0.00    0.00       1/23          DMState::~DMState() [586]
                0.00    0.00       1/23          DInterval::~DInterval() [602]
[390]    0.0    0.00    0.00      23         Distribution::~Distribution() [390]
-----------------------------------------------
                0.00    0.00      23/23          DistTab::insert(Distribution const*) [278]
[391]    0.0    0.00    0.00      23         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::lower_bound(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [391]
-----------------------------------------------
                0.00    0.00      23/23          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> const&) [280]
[392]    0.0    0.00    0.00      23         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::_M_create_node(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> const&) [392]
-----------------------------------------------
                0.00    0.00      23/23          DistTab::insert(Distribution const*) [278]
[393]    0.0    0.00    0.00      23         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [393]
-----------------------------------------------
                0.00    0.00      22/22          yyparse() [487]
[394]    0.0    0.00    0.00      22         setParameters(ParseTree*, ParseTree*) [394]
                0.00    0.00      22/77          ParseTree** std::fill_n<ParseTree**, unsigned int, ParseTree*>(ParseTree**, unsigned int, ParseTree* const&) [379]
                0.00    0.00      22/116         ParseTree::setParameters(std::vector<ParseTree*, std::allocator<ParseTree*> > const&) [374]
-----------------------------------------------
                0.00    0.00      21/21          init_tables() [211]
[395]    0.0    0.00    0.00      21         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::lower_bound(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [395]
-----------------------------------------------
                0.00    0.00      21/21          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> const&) [284]
[396]    0.0    0.00    0.00      21         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::_M_create_node(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> const&) [396]
-----------------------------------------------
                0.00    0.00       1/12          DBeta::DBeta() [534]
                0.00    0.00       1/12          DChisq::DChisq() [552]
                0.00    0.00       1/12          DDexp::DDexp() [536]
                0.00    0.00       1/12          DExp::DExp() [520]
                0.00    0.00       1/12          DGamma::DGamma() [556]
                0.00    0.00       1/12          DLnorm::DLnorm() [558]
                0.00    0.00       1/12          DLogis::DLogis() [560]
                0.00    0.00       1/12          DNorm::DNorm() [538]
                0.00    0.00       1/12          DPar::DPar() [522]
                0.00    0.00       1/12          DT::DT() [496]
                0.00    0.00       1/12          DUnif::DUnif() [542]
                0.00    0.00       1/12          DWeib::DWeib() [544]
[397]    0.0    0.00    0.00      12         DistReal::DistReal(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int, Support, int, int) [397]
                0.00    0.00      12/23          Distribution::Distribution(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [389]
-----------------------------------------------
                0.00    0.00      12/12          SymTab::addVariable(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, Index const&) [266]
[398]    0.0    0.00    0.00      12         NodeArray::setName(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [398]
-----------------------------------------------
                0.00    0.00      12/12          SymTab::getNodes(std::vector<Node*, std::allocator<Node*> >&) [255]
[399]    0.0    0.00    0.00      12         NodeArray::graph() const [399]
-----------------------------------------------
                0.00    0.00      12/12          GibbsFactory::makeSampler(std::set<StochasticNode*, std::less<StochasticNode*>, std::allocator<StochasticNode*> >&, std::vector<Sampler*, std::allocator<Sampler*> >&) const [29]
[400]    0.0    0.00    0.00      12         std::vector<Sampler*, std::allocator<Sampler*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, Sampler* const&) [400]
-----------------------------------------------
                0.00    0.00      12/12          SymTab::addVariable(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, Index const&) [266]
[401]    0.0    0.00    0.00      12         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::lower_bound(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [401]
-----------------------------------------------
                0.00    0.00      12/12          std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> const&) [287]
[402]    0.0    0.00    0.00      12         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::_M_create_node(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> const&) [402]
-----------------------------------------------
                0.00    0.00      12/12          SymTab::addVariable(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, Index const&) [266]
[403]    0.0    0.00    0.00      12         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [403]
-----------------------------------------------
                0.00    0.00      11/11          zzparse() [2]
[404]    0.0    0.00    0.00      11         setParameters(ParseTree*, ParseTree*) [404]
                0.00    0.00      11/77          ParseTree** std::fill_n<ParseTree**, unsigned int, ParseTree*>(ParseTree**, unsigned int, ParseTree* const&) [379]
                0.00    0.00      11/116         ParseTree::setParameters(std::vector<ParseTree*, std::allocator<ParseTree*> > const&) [374]
-----------------------------------------------
                0.00    0.00       9/9           zzlex() [333]
[405]    0.0    0.00    0.00       9         yy_get_next_buffer() [405]
                0.00    0.00       2/9           zz_load_buffer_state() [406]
                0.00    0.00       2/2           zzrestart(_IO_FILE*) [442]
-----------------------------------------------
                0.00    0.00       1/9           zzlex() [333]
                0.00    0.00       2/9           yy_get_next_buffer() [405]
                0.00    0.00       2/9           zz_init_buffer(yy_buffer_state*, _IO_FILE*) [420]
                0.00    0.00       4/9           zz_switch_to_buffer(yy_buffer_state*) [424]
[406]    0.0    0.00    0.00       9         zz_load_buffer_state() [406]
-----------------------------------------------
                0.00    0.00       8/8           zzparse() [2]
[407]    0.0    0.00    0.00       8         setName(ParseTree*, std::basic_string<char, std::char_traits<char>, std::allocator<char> >*) [407]
                0.00    0.00       8/89          ParseTree::setName(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [377]
-----------------------------------------------
                0.00    0.00       8/8           Compiler::traverseTree(ParseTree const*, void (Compiler::*)(ParseTree const*), void (Compiler::*)(ParseTree const*)) [37]
[408]    0.0    0.00    0.00       8         CounterTab::popCounter() [408]
-----------------------------------------------
                0.00    0.00       8/8           Compiler::traverseTree(ParseTree const*, void (Compiler::*)(ParseTree const*), void (Compiler::*)(ParseTree const*)) [37]
[409]    0.0    0.00    0.00       8         Counter::reset() [409]
-----------------------------------------------
                0.00    0.00       8/8           CounterTab::pushCounter(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, Range const&) [293]
[410]    0.0    0.00    0.00       8         Counter::Counter(long, long) [410]
-----------------------------------------------
                0.00    0.00       8/8           ConjugateFactory::ConjugateFactory() [289]
[411]    0.0    0.00    0.00       8         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::lower_bound(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [411]
-----------------------------------------------
                0.00    0.00       8/8           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> const&) [290]
[412]    0.0    0.00    0.00       8         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::_M_create_node(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> const&) [412]
-----------------------------------------------
                0.00    0.00       8/8           readRData(std::vector<ParseTree*, std::allocator<ParseTree*> > const*, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >&) [249]
[413]    0.0    0.00    0.00       8         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [413]
-----------------------------------------------
                0.00    0.00       7/7           zzlex() [333]
[414]    0.0    0.00    0.00       7         yy_get_previous_state() [414]
-----------------------------------------------
                0.00    0.00       7/7           Model::~Model() [259]
[415]    0.0    0.00    0.00       7         SliceSampler::~SliceSampler() [415]
                0.00    0.00       7/1936        Sampler::~Sampler() [365]
-----------------------------------------------
                0.00    0.00       6/6           zz_create_buffer(_IO_FILE*, int) [429]
[416]    0.0    0.00    0.00       6         yy_flex_alloc(unsigned int) [416]
-----------------------------------------------
                0.00    0.00       6/6           init_tables() [211]
[417]    0.0    0.00    0.00       6         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::lower_bound(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [417]
-----------------------------------------------
                0.00    0.00       6/6           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> const&) [292]
[418]    0.0    0.00    0.00       6         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::_M_create_node(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> const&) [418]
-----------------------------------------------
                0.00    0.00       5/5           zzparse() [2]
[419]    0.0    0.00    0.00       5         setParameters(ParseTree*, std::vector<ParseTree*, std::allocator<ParseTree*> >*) [419]
                0.00    0.00       5/116         ParseTree::setParameters(std::vector<ParseTree*, std::allocator<ParseTree*> > const&) [374]
-----------------------------------------------
                0.00    0.00       2/5           zzrestart(_IO_FILE*) [442]
                0.00    0.00       3/5           zz_create_buffer(_IO_FILE*, int) [429]
[420]    0.0    0.00    0.00       5         zz_init_buffer(yy_buffer_state*, _IO_FILE*) [420]
                0.00    0.00       5/5           zz_flush_buffer(yy_buffer_state*) [421]
                0.00    0.00       2/9           zz_load_buffer_state() [406]
-----------------------------------------------
                0.00    0.00       5/5           zz_init_buffer(yy_buffer_state*, _IO_FILE*) [420]
[421]    0.0    0.00    0.00       5         zz_flush_buffer(yy_buffer_state*) [421]
-----------------------------------------------
                0.00    0.00       1/5           DBern::DBern() [532]
                0.00    0.00       1/5           DBin::DBin() [516]
                0.00    0.00       1/5           DCat::DCat() [518]
                0.00    0.00       1/5           DMState::DMState() [585]
                0.00    0.00       1/5           DInterval::DInterval() [601]
[422]    0.0    0.00    0.00       5         DistFinite::DistFinite(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [422]
                0.00    0.00       5/23          Distribution::Distribution(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [389]
-----------------------------------------------
                0.00    0.00       2/4           zz_delete_buffer(yy_buffer_state*) [439]
                0.00    0.00       2/4           return_to_main_buffer() [440]
[423]    0.0    0.00    0.00       4         yy_flex_free(void*) [423]
-----------------------------------------------
                0.00    0.00       2/4           open_data_buffer(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const*) [438]
                0.00    0.00       2/4           return_to_main_buffer() [440]
[424]    0.0    0.00    0.00       4         zz_switch_to_buffer(yy_buffer_state*) [424]
                0.00    0.00       4/9           zz_load_buffer_state() [406]
-----------------------------------------------
                0.00    0.00       1/4           Phi::Phi() [510]
                0.00    0.00       1/4           ICLogLog::ICLogLog() [595]
                0.00    0.00       1/4           ILogit::ILogit() [570]
                0.00    0.00       1/4           Exp::Exp() [502]
[425]    0.0    0.00    0.00       4         InverseLinkFunc::InverseLinkFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [425]
                0.00    0.00       4/24          ScalarFunc::ScalarFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [388]
-----------------------------------------------
                0.00    0.00       4/4           FuncTab::insert(InverseLinkFunc const*) [276]
[426]    0.0    0.00    0.00       4         InverseLinkFunc::linkName() const [426]
-----------------------------------------------
                0.00    0.00       4/4           getDist(StochasticNode const*) [210]
[427]    0.0    0.00    0.00       4         std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [427]
-----------------------------------------------
                0.00    0.00       4/4           std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>*, std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > > >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> const&) [444]
[428]    0.0    0.00    0.00       4         __gnu_cxx::__normal_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>*, std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > > > std::__uninitialized_copy_aux<__gnu_cxx::__normal_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>*, std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > > >, __gnu_cxx::__normal_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>*, std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > > > >(__gnu_cxx::__normal_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>*, std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > > >, __gnu_cxx::__normal_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>*, std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > > >, __gnu_cxx::__normal_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>*, std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > > >, __false_type) [428]
-----------------------------------------------
                0.00    0.00       1/3           zzlex() [333]
                0.00    0.00       2/3           open_data_buffer(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const*) [438]
[429]    0.0    0.00    0.00       3         zz_create_buffer(_IO_FILE*, int) [429]
                0.00    0.00       6/6           yy_flex_alloc(unsigned int) [416]
                0.00    0.00       3/5           zz_init_buffer(yy_buffer_state*, _IO_FILE*) [420]
-----------------------------------------------
                0.00    0.00       3/3           yylex() [372]
[430]    0.0    0.00    0.00       3         yy_get_next_buffer() [430]
                0.00    0.00       1/3           yy_load_buffer_state() [431]
                0.00    0.00       1/1           yyrestart(_IO_FILE*) [488]
-----------------------------------------------
                0.00    0.00       1/3           yylex() [372]
                0.00    0.00       1/3           yy_get_next_buffer() [430]
                0.00    0.00       1/3           yy_init_buffer(yy_buffer_state*, _IO_FILE*) [436]
[431]    0.0    0.00    0.00       3         yy_load_buffer_state() [431]
-----------------------------------------------
                0.00    0.00       1/3           Console::initialize() [27]
                0.00    0.00       2/3           Console::compile(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, unsigned int) [35]
[432]    0.0    0.00    0.00       3         Model::graph() [432]
-----------------------------------------------
                0.00    0.00       1/3           Console::compile(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, unsigned int) [35]
                0.00    0.00       1/3           Console::initialize() [27]
                0.00    0.00       1/3           Compiler::Compiler(Graph&, SymTab&, FuncTab const&, DistTab const&, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&) [594]
[433]    0.0    0.00    0.00       3         Graph::size() const [433]
-----------------------------------------------
                0.00    0.00       3/3           Console::initialize() [27]
[434]    0.0    0.00    0.00       3         std::vector<SamplerFactory const*, std::allocator<SamplerFactory const*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<SamplerFactory const**, std::vector<SamplerFactory const*, std::allocator<SamplerFactory const*> > >, SamplerFactory const* const&) [434]
-----------------------------------------------
                0.00    0.00       2/2           yy_create_buffer(_IO_FILE*, int) [467]
[435]    0.0    0.00    0.00       2         yy_flex_alloc(unsigned int) [435]
-----------------------------------------------
                0.00    0.00       1/2           yyrestart(_IO_FILE*) [488]
                0.00    0.00       1/2           yy_create_buffer(_IO_FILE*, int) [467]
[436]    0.0    0.00    0.00       2         yy_init_buffer(yy_buffer_state*, _IO_FILE*) [436]
                0.00    0.00       2/2           yy_flush_buffer(yy_buffer_state*) [437]
                0.00    0.00       1/3           yy_load_buffer_state() [431]
-----------------------------------------------
                0.00    0.00       2/2           yy_init_buffer(yy_buffer_state*, _IO_FILE*) [436]
[437]    0.0    0.00    0.00       2         yy_flush_buffer(yy_buffer_state*) [437]
-----------------------------------------------
                0.00    0.00       2/2           zzparse() [2]
[438]    0.0    0.00    0.00       2         open_data_buffer(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const*) [438]
                0.00    0.00       2/3           zz_create_buffer(_IO_FILE*, int) [429]
                0.00    0.00       2/4           zz_switch_to_buffer(yy_buffer_state*) [424]
-----------------------------------------------
                0.00    0.00       2/2           return_to_main_buffer() [440]
[439]    0.0    0.00    0.00       2         zz_delete_buffer(yy_buffer_state*) [439]
                0.00    0.00       2/4           yy_flex_free(void*) [423]
-----------------------------------------------
                0.00    0.00       2/2           zzlex() [333]
[440]    0.0    0.00    0.00       2         return_to_main_buffer() [440]
                0.00    0.00       2/4           yy_flex_free(void*) [423]
                0.00    0.00       2/2           zz_delete_buffer(yy_buffer_state*) [439]
                0.00    0.00       2/4           zz_switch_to_buffer(yy_buffer_state*) [424]
-----------------------------------------------
                0.00    0.00       2/2           yylex() [372]
[441]    0.0    0.00    0.00       2         yy_get_previous_state() [441]
-----------------------------------------------
                0.00    0.00       2/2           yy_get_next_buffer() [405]
[442]    0.0    0.00    0.00       2         zzrestart(_IO_FILE*) [442]
                0.00    0.00       2/5           zz_init_buffer(yy_buffer_state*, _IO_FILE*) [420]
-----------------------------------------------
                0.00    0.00       1/2           DNegBin::DNegBin() [587]
                0.00    0.00       1/2           DPois::DPois() [540]
[443]    0.0    0.00    0.00       2         DistDiscrete::DistDiscrete(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [443]
                0.00    0.00       2/23          Distribution::Distribution(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [389]
-----------------------------------------------
                0.00    0.00       2/2           CounterTab::pushCounter(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, Range const&) [293]
[444]    0.0    0.00    0.00       2         std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>*, std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > > >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> const&) [444]
                0.00    0.00       4/4           __gnu_cxx::__normal_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>*, std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > > > std::__uninitialized_copy_aux<__gnu_cxx::__normal_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>*, std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > > >, __gnu_cxx::__normal_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>*, std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > > > >(__gnu_cxx::__normal_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>*, std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > > >, __gnu_cxx::__normal_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>*, std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > > >, __gnu_cxx::__normal_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>*, std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > > >, __false_type) [428]
-----------------------------------------------
                                  32             std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >*) [445]
                0.00    0.00       2/2           FuncTab::~FuncTab() [271]
[445]    0.0    0.00    0.00       2+32      std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >*) [445]
                                  32             std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >*) [445]
-----------------------------------------------
                0.00    0.00       1/1           __do_global_ctors_aux [1225]
[446]    0.0    0.00    0.00       1         global constructors keyed to JAGS_NA [446]
                0.00    0.00       1/1           __static_initialization_and_destruction_0(int, int) [478]
-----------------------------------------------
                0.00    0.00       1/1           __do_global_ctors_aux [1225]
[447]    0.0    0.00    0.00       1         global constructors keyed to _Z7getDistPK14StochasticNode [447]
                0.00    0.00       1/1           __static_initialization_and_destruction_0(int, int) [485]
-----------------------------------------------
                0.00    0.00       1/1           __do_global_ctors_aux [1225]
[448]    0.0    0.00    0.00       1         global constructors keyed to _Z9MatrixExpPdPKdid [448]
                0.00    0.00       1/1           __static_initialization_and_destruction_0(int, int) [481]
-----------------------------------------------
                0.00    0.00       1/1           __do_global_ctors_aux [1225]
[449]    0.0    0.00    0.00       1         global constructors keyed to _Z9readRDataPKSt6vectorIP9ParseTreeSaIS1_EERSt3mapISs6SArraySt4lessISsESaISt4pairIKSsS7_EEE [449]
                0.00    0.00       1/1           __static_initialization_and_destruction_0(int, int) [470]
-----------------------------------------------
                0.00    0.00       1/1           __do_global_ctors_aux [1225]
[450]    0.0    0.00    0.00       1         global constructors keyed to _ZN11LogicalNodeC2EPK8FunctionRK5Index [450]
                0.00    0.00       1/1           __static_initialization_and_destruction_0(int, int) [483]
-----------------------------------------------
                0.00    0.00       1/1           __do_global_ctors_aux [1225]
[451]    0.0    0.00    0.00       1         global constructors keyed to _ZN11MixtureNodeC2EP4NodeRKSt6vectorISt4pairIlS1_ESaIS4_EE [451]
                0.00    0.00       1/1           __static_initialization_and_destruction_0(int, int) [482]
-----------------------------------------------
                0.00    0.00       1/1           __do_global_ctors_aux [1225]
[452]    0.0    0.00    0.00       1         global constructors keyed to _ZN11SubSetIndexC2Ev [452]
                0.00    0.00       1/1           __static_initialization_and_destruction_0(int, int) [484]
-----------------------------------------------
                0.00    0.00       1/1           __do_global_ctors_aux [1225]
[453]    0.0    0.00    0.00       1         global constructors keyed to _ZN12TraceMonitorC2EP4Nodelli [453]
                0.00    0.00       1/1           __static_initialization_and_destruction_0(int, int) [477]
-----------------------------------------------
                0.00    0.00       1/1           __do_global_ctors_aux [1225]
[454]    0.0    0.00    0.00       1         global constructors keyed to _ZN18ConjugateDirichletC2EP14StochasticNode [454]
                0.00    0.00       1/1           __static_initialization_and_destruction_0(int, int) [486]
-----------------------------------------------
                0.00    0.00       1/1           __do_global_ctors_aux [1225]
[455]    0.0    0.00    0.00       1         global constructors keyed to _ZN5ModelC2Ev [455]
                0.00    0.00       1/1           __static_initialization_and_destruction_0(int, int) [476]
-----------------------------------------------
                0.00    0.00       1/1           __do_global_ctors_aux [1225]
[456]    0.0    0.00    0.00       1         global constructors keyed to _ZN6SymTabC2Ev [456]
                0.00    0.00       1/1           __static_initialization_and_destruction_0(int, int) [474]
-----------------------------------------------
                0.00    0.00       1/1           __do_global_ctors_aux [1225]
[457]    0.0    0.00    0.00       1         global constructors keyed to _ZN7ConsoleC2ERSoS0_ [457]
                0.00    0.00       1/1           __static_initialization_and_destruction_0(int, int) [471]
-----------------------------------------------
                0.00    0.00       1/1           __do_global_ctors_aux [1225]
[458]    0.0    0.00    0.00       1         global constructors keyed to _ZN7DMStateC2Ev [458]
                0.00    0.00       1/1           __static_initialization_and_destruction_0(int, int) [480]
-----------------------------------------------
                0.00    0.00       1/1           __do_global_ctors_aux [1225]
[459]    0.0    0.00    0.00       1         global constructors keyed to _ZN7SamplerC2ERKSt6vectorIP14StochasticNodeSaIS2_EE [459]
                0.00    0.00       1/1           __static_initialization_and_destruction_0(int, int) [479]
-----------------------------------------------
                0.00    0.00       1/1           __do_global_ctors_aux [1225]
[460]    0.0    0.00    0.00       1         global constructors keyed to _ZN8Compiler18constantExpressionEPK9ParseTreeRd [460]
                0.00    0.00       1/1           __static_initialization_and_destruction_0(int, int) [473]
-----------------------------------------------
                0.00    0.00       1/1           __do_global_ctors_aux [1225]
[461]    0.0    0.00    0.00       1         global constructors keyed to _ZN9NodeArrayC2ERK5Index [461]
                0.00    0.00       1/1           __static_initialization_and_destruction_0(int, int) [475]
-----------------------------------------------
                0.00    0.00       1/1           __do_global_ctors_aux [1225]
[462]    0.0    0.00    0.00       1         global constructors keyed to _data_table [462]
                0.00    0.00       1/1           __static_initialization_and_destruction_0(int, int) [468]
-----------------------------------------------
                0.00    0.00       1/1           __do_global_ctors_aux [1225]
[463]    0.0    0.00    0.00       1         global constructors keyed to yydebug [463]
                0.00    0.00       1/1           __static_initialization_and_destruction_0(int, int) [472]
-----------------------------------------------
                0.00    0.00       1/1           __do_global_ctors_aux [1225]
[464]    0.0    0.00    0.00       1         global constructors keyed to zzleng [464]
                0.00    0.00       1/1           __static_initialization_and_destruction_0(int, int) [469]
-----------------------------------------------
                0.00    0.00       1/1           Console::checkModel(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [583]
[465]    0.0    0.00    0.00       1         parse_bugs(_IO_FILE*, std::vector<ParseTree*, std::allocator<ParseTree*> >**, ParseTree**) [465]
                0.00    0.00       1/1           yyparse() [487]
-----------------------------------------------
                0.00    0.00       1/1           zzparse() [2]
[466]    0.0    0.00    0.00       1         setParameters(ParseTree*, ParseTree*, ParseTree*) [466]
                0.00    0.00       2/141         std::vector<ParseTree*, std::allocator<ParseTree*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<ParseTree**, std::vector<ParseTree*, std::allocator<ParseTree*> > >, ParseTree* const&) [373]
                0.00    0.00       1/116         ParseTree::setParameters(std::vector<ParseTree*, std::allocator<ParseTree*> > const&) [374]
-----------------------------------------------
                0.00    0.00       1/1           yylex() [372]
[467]    0.0    0.00    0.00       1         yy_create_buffer(_IO_FILE*, int) [467]
                0.00    0.00       2/2           yy_flex_alloc(unsigned int) [435]
                0.00    0.00       1/2           yy_init_buffer(yy_buffer_state*, _IO_FILE*) [436]
-----------------------------------------------
                0.00    0.00       1/1           global constructors keyed to _data_table [462]
[468]    0.0    0.00    0.00       1         __static_initialization_and_destruction_0(int, int) [468]
-----------------------------------------------
                0.00    0.00       1/1           global constructors keyed to zzleng [464]
[469]    0.0    0.00    0.00       1         __static_initialization_and_destruction_0(int, int) [469]
-----------------------------------------------
                0.00    0.00       1/1           global constructors keyed to _Z9readRDataPKSt6vectorIP9ParseTreeSaIS1_EERSt3mapISs6SArraySt4lessISsESaISt4pairIKSsS7_EEE [449]
[470]    0.0    0.00    0.00       1         __static_initialization_and_destruction_0(int, int) [470]
-----------------------------------------------
                0.00    0.00       1/1           global constructors keyed to _ZN7ConsoleC2ERSoS0_ [457]
[471]    0.0    0.00    0.00       1         __static_initialization_and_destruction_0(int, int) [471]
-----------------------------------------------
                0.00    0.00       1/1           global constructors keyed to yydebug [463]
[472]    0.0    0.00    0.00       1         __static_initialization_and_destruction_0(int, int) [472]
-----------------------------------------------
                0.00    0.00       1/1           global constructors keyed to _ZN8Compiler18constantExpressionEPK9ParseTreeRd [460]
[473]    0.0    0.00    0.00       1         __static_initialization_and_destruction_0(int, int) [473]
-----------------------------------------------
                0.00    0.00       1/1           global constructors keyed to _ZN6SymTabC2Ev [456]
[474]    0.0    0.00    0.00       1         __static_initialization_and_destruction_0(int, int) [474]
-----------------------------------------------
                0.00    0.00       1/1           global constructors keyed to _ZN9NodeArrayC2ERK5Index [461]
[475]    0.0    0.00    0.00       1         __static_initialization_and_destruction_0(int, int) [475]
-----------------------------------------------
                0.00    0.00       1/1           global constructors keyed to _ZN5ModelC2Ev [455]
[476]    0.0    0.00    0.00       1         __static_initialization_and_destruction_0(int, int) [476]
-----------------------------------------------
                0.00    0.00       1/1           global constructors keyed to _ZN12TraceMonitorC2EP4Nodelli [453]
[477]    0.0    0.00    0.00       1         __static_initialization_and_destruction_0(int, int) [477]
-----------------------------------------------
                0.00    0.00       1/1           global constructors keyed to JAGS_NA [446]
[478]    0.0    0.00    0.00       1         __static_initialization_and_destruction_0(int, int) [478]
-----------------------------------------------
                0.00    0.00       1/1           global constructors keyed to _ZN7SamplerC2ERKSt6vectorIP14StochasticNodeSaIS2_EE [459]
[479]    0.0    0.00    0.00       1         __static_initialization_and_destruction_0(int, int) [479]
-----------------------------------------------
                0.00    0.00       1/1           global constructors keyed to _ZN7DMStateC2Ev [458]
[480]    0.0    0.00    0.00       1         __static_initialization_and_destruction_0(int, int) [480]
-----------------------------------------------
                0.00    0.00       1/1           global constructors keyed to _Z9MatrixExpPdPKdid [448]
[481]    0.0    0.00    0.00       1         __static_initialization_and_destruction_0(int, int) [481]
-----------------------------------------------
                0.00    0.00       1/1           global constructors keyed to _ZN11MixtureNodeC2EP4NodeRKSt6vectorISt4pairIlS1_ESaIS4_EE [451]
[482]    0.0    0.00    0.00       1         __static_initialization_and_destruction_0(int, int) [482]
-----------------------------------------------
                0.00    0.00       1/1           global constructors keyed to _ZN11LogicalNodeC2EPK8FunctionRK5Index [450]
[483]    0.0    0.00    0.00       1         __static_initialization_and_destruction_0(int, int) [483]
-----------------------------------------------
                0.00    0.00       1/1           global constructors keyed to _ZN11SubSetIndexC2Ev [452]
[484]    0.0    0.00    0.00       1         __static_initialization_and_destruction_0(int, int) [484]
-----------------------------------------------
                0.00    0.00       1/1           global constructors keyed to _Z7getDistPK14StochasticNode [447]
[485]    0.0    0.00    0.00       1         __static_initialization_and_destruction_0(int, int) [485]
-----------------------------------------------
                0.00    0.00       1/1           global constructors keyed to _ZN18ConjugateDirichletC2EP14StochasticNode [454]
[486]    0.0    0.00    0.00       1         __static_initialization_and_destruction_0(int, int) [486]
-----------------------------------------------
                0.00    0.00       1/1           parse_bugs(_IO_FILE*, std::vector<ParseTree*, std::allocator<ParseTree*> >**, ParseTree**) [465]
[487]    0.0    0.00    0.00       1         yyparse() [487]
                0.00    0.00     286/286         yylex() [372]
                0.00    0.00     171/6330        ParseTree::ParseTree(TreeClass) [345]
                0.00    0.00      81/81          setName(ParseTree*, std::basic_string<char, std::char_traits<char>, std::allocator<char> >*) [378]
                0.00    0.00      49/49          setParameters(ParseTree*, std::vector<ParseTree*, std::allocator<ParseTree*> >*) [380]
                0.00    0.00      43/141         std::vector<ParseTree*, std::allocator<ParseTree*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<ParseTree**, std::vector<ParseTree*, std::allocator<ParseTree*> > >, ParseTree* const&) [373]
                0.00    0.00      37/77          ParseTree** std::fill_n<ParseTree**, unsigned int, ParseTree*>(ParseTree**, unsigned int, ParseTree* const&) [379]
                0.00    0.00      28/28          setParameters(ParseTree*, ParseTree*, ParseTree*) [384]
                0.00    0.00      27/6169        ParseTree::setValue(double) [346]
                0.00    0.00      25/25          ParseTree::setOperator(Operator) [387]
                0.00    0.00      22/22          setParameters(ParseTree*, ParseTree*) [394]
-----------------------------------------------
                0.00    0.00       1/1           yy_get_next_buffer() [430]
[488]    0.0    0.00    0.00       1         yyrestart(_IO_FILE*) [488]
                0.00    0.00       1/2           yy_init_buffer(yy_buffer_state*, _IO_FILE*) [436]
-----------------------------------------------
                0.00    0.00       1/1           Compiler::Compiler(Graph&, SymTab&, FuncTab const&, DistTab const&, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&) [594]
[489]    0.0    0.00    0.00       1         CounterTab::CounterTab() [489]
-----------------------------------------------
                0.00    0.00       1/1           Console::compile(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, unsigned int) [35]
[490]    0.0    0.00    0.00       1         CounterTab::~CounterTab() [490]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::FuncTab() [262]
[491]    0.0    0.00    0.00       1         UnaryMinus::UnaryMinus() [491]
                0.00    0.00       1/24          ScalarFunc::ScalarFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [388]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::~FuncTab() [271]
[492]    0.0    0.00    0.00       1         UnaryMinus::~UnaryMinus() [492]
                0.00    0.00       1/28          Function::~Function() [386]
-----------------------------------------------
                0.00    0.00       1/1           Console::initialize() [27]
[493]    0.0    0.00    0.00       1         SliceFactory::~SliceFactory() [493]
-----------------------------------------------
                0.00    0.00       1/1           Console::initialize() [27]
[494]    0.0    0.00    0.00       1         FiniteFactory::~FiniteFactory() [494]
-----------------------------------------------
                0.00    0.00       1/1           Console::initialize() [27]
[495]    0.0    0.00    0.00       1         ConjugateFactory::~ConjugateFactory() [495]
                0.00    0.00       1/1           std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >*) [608]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::DistTab() [281]
[496]    0.0    0.00    0.00       1         DT::DT() [496]
                0.00    0.00       1/12          DistReal::DistReal(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int, Support, int, int) [397]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::~DistTab() [272]
[497]    0.0    0.00    0.00       1         DT::~DT() [497]
                0.00    0.00       1/23          Distribution::~Distribution() [390]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::FuncTab() [262]
[498]    0.0    0.00    0.00       1         SD::SD() [498]
                0.00    0.00       1/24          ScalarFunc::ScalarFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [388]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::~FuncTab() [271]
[499]    0.0    0.00    0.00       1         SD::~SD() [499]
                0.00    0.00       1/28          Function::~Function() [386]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::FuncTab() [262]
[500]    0.0    0.00    0.00       1         Add::Add() [500]
                0.00    0.00       1/24          ScalarFunc::ScalarFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [388]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::~FuncTab() [271]
[501]    0.0    0.00    0.00       1         Add::~Add() [501]
                0.00    0.00       1/28          Function::~Function() [386]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::FuncTab() [262]
[502]    0.0    0.00    0.00       1         Exp::Exp() [502]
                0.00    0.00       1/4           InverseLinkFunc::InverseLinkFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [425]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::~FuncTab() [271]
[503]    0.0    0.00    0.00       1         Exp::~Exp() [503]
                0.00    0.00       1/28          Function::~Function() [386]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::FuncTab() [262]
[504]    0.0    0.00    0.00       1         Log::Log() [504]
                0.00    0.00       1/24          ScalarFunc::ScalarFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [388]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::~FuncTab() [271]
[505]    0.0    0.00    0.00       1         Log::~Log() [505]
                0.00    0.00       1/28          Function::~Function() [386]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::FuncTab() [262]
[506]    0.0    0.00    0.00       1         Max::Max() [506]
                0.00    0.00       1/28          Function::Function(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [385]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::~FuncTab() [271]
[507]    0.0    0.00    0.00       1         Max::~Max() [507]
                0.00    0.00       1/28          Function::~Function() [386]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::FuncTab() [262]
[508]    0.0    0.00    0.00       1         Min::Min() [508]
                0.00    0.00       1/28          Function::Function(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [385]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::~FuncTab() [271]
[509]    0.0    0.00    0.00       1         Min::~Min() [509]
                0.00    0.00       1/28          Function::~Function() [386]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::FuncTab() [262]
[510]    0.0    0.00    0.00       1         Phi::Phi() [510]
                0.00    0.00       1/4           InverseLinkFunc::InverseLinkFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [425]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::~FuncTab() [271]
[511]    0.0    0.00    0.00       1         Phi::~Phi() [511]
                0.00    0.00       1/28          Function::~Function() [386]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::FuncTab() [262]
[512]    0.0    0.00    0.00       1         Pow::Pow() [512]
                0.00    0.00       1/24          ScalarFunc::ScalarFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [388]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::~FuncTab() [271]
[513]    0.0    0.00    0.00       1         Pow::~Pow() [513]
                0.00    0.00       1/28          Function::~Function() [386]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::FuncTab() [262]
[514]    0.0    0.00    0.00       1         Sum::Sum() [514]
                0.00    0.00       1/24          ScalarFunc::ScalarFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [388]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::~FuncTab() [271]
[515]    0.0    0.00    0.00       1         Sum::~Sum() [515]
                0.00    0.00       1/28          Function::~Function() [386]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::DistTab() [281]
[516]    0.0    0.00    0.00       1         DBin::DBin() [516]
                0.00    0.00       1/5           DistFinite::DistFinite(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [422]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::~DistTab() [272]
[517]    0.0    0.00    0.00       1         DBin::~DBin() [517]
                0.00    0.00       1/23          Distribution::~Distribution() [390]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::DistTab() [281]
[518]    0.0    0.00    0.00       1         DCat::DCat() [518]
                0.00    0.00       1/5           DistFinite::DistFinite(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [422]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::~DistTab() [272]
[519]    0.0    0.00    0.00       1         DCat::~DCat() [519]
                0.00    0.00       1/23          Distribution::~Distribution() [390]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::DistTab() [281]
[520]    0.0    0.00    0.00       1         DExp::DExp() [520]
                0.00    0.00       1/12          DistReal::DistReal(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int, Support, int, int) [397]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::~DistTab() [272]
[521]    0.0    0.00    0.00       1         DExp::~DExp() [521]
                0.00    0.00       1/23          Distribution::~Distribution() [390]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::DistTab() [281]
[522]    0.0    0.00    0.00       1         DPar::DPar() [522]
                0.00    0.00       1/12          DistReal::DistReal(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int, Support, int, int) [397]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::~DistTab() [272]
[523]    0.0    0.00    0.00       1         DPar::~DPar() [523]
                0.00    0.00       1/23          Distribution::~Distribution() [390]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::FuncTab() [262]
[524]    0.0    0.00    0.00       1         Mean::Mean() [524]
                0.00    0.00       1/24          ScalarFunc::ScalarFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [388]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::~FuncTab() [271]
[525]    0.0    0.00    0.00       1         Mean::~Mean() [525]
                0.00    0.00       1/28          Function::~Function() [386]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::FuncTab() [262]
[526]    0.0    0.00    0.00       1         Mexp::Mexp() [526]
                0.00    0.00       1/28          Function::Function(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [385]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::~FuncTab() [271]
[527]    0.0    0.00    0.00       1         Mexp::~Mexp() [527]
                0.00    0.00       1/28          Function::~Function() [386]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::FuncTab() [262]
[528]    0.0    0.00    0.00       1         Sqrt::Sqrt() [528]
                0.00    0.00       1/24          ScalarFunc::ScalarFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [388]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::~FuncTab() [271]
[529]    0.0    0.00    0.00       1         Sqrt::~Sqrt() [529]
                0.00    0.00       1/28          Function::~Function() [386]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::FuncTab() [262]
[530]    0.0    0.00    0.00       1         Step::Step() [530]
                0.00    0.00       1/24          ScalarFunc::ScalarFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [388]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::~FuncTab() [271]
[531]    0.0    0.00    0.00       1         Step::~Step() [531]
                0.00    0.00       1/28          Function::~Function() [386]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::DistTab() [281]
[532]    0.0    0.00    0.00       1         DBern::DBern() [532]
                0.00    0.00       1/5           DistFinite::DistFinite(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [422]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::~DistTab() [272]
[533]    0.0    0.00    0.00       1         DBern::~DBern() [533]
                0.00    0.00       1/23          Distribution::~Distribution() [390]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::DistTab() [281]
[534]    0.0    0.00    0.00       1         DBeta::DBeta() [534]
                0.00    0.00       1/12          DistReal::DistReal(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int, Support, int, int) [397]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::~DistTab() [272]
[535]    0.0    0.00    0.00       1         DBeta::~DBeta() [535]
                0.00    0.00       1/23          Distribution::~Distribution() [390]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::DistTab() [281]
[536]    0.0    0.00    0.00       1         DDexp::DDexp() [536]
                0.00    0.00       1/12          DistReal::DistReal(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int, Support, int, int) [397]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::~DistTab() [272]
[537]    0.0    0.00    0.00       1         DDexp::~DDexp() [537]
                0.00    0.00       1/23          Distribution::~Distribution() [390]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::DistTab() [281]
[538]    0.0    0.00    0.00       1         DNorm::DNorm() [538]
                0.00    0.00       1/12          DistReal::DistReal(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int, Support, int, int) [397]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::~DistTab() [272]
[539]    0.0    0.00    0.00       1         DNorm::~DNorm() [539]
                0.00    0.00       1/23          Distribution::~Distribution() [390]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::DistTab() [281]
[540]    0.0    0.00    0.00       1         DPois::DPois() [540]
                0.00    0.00       1/2           DistDiscrete::DistDiscrete(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [443]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::~DistTab() [272]
[541]    0.0    0.00    0.00       1         DPois::~DPois() [541]
                0.00    0.00       1/23          Distribution::~Distribution() [390]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::DistTab() [281]
[542]    0.0    0.00    0.00       1         DUnif::DUnif() [542]
                0.00    0.00       1/12          DistReal::DistReal(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int, Support, int, int) [397]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::~DistTab() [272]
[543]    0.0    0.00    0.00       1         DUnif::~DUnif() [543]
                0.00    0.00       1/23          Distribution::~Distribution() [390]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::DistTab() [281]
[544]    0.0    0.00    0.00       1         DWeib::DWeib() [544]
                0.00    0.00       1/12          DistReal::DistReal(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int, Support, int, int) [397]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::~DistTab() [272]
[545]    0.0    0.00    0.00       1         DWeib::~DWeib() [545]
                0.00    0.00       1/23          Distribution::~Distribution() [390]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::DistTab() [281]
[546]    0.0    0.00    0.00       1         DWish::DWish() [546]
                0.00    0.00       1/23          Distribution::Distribution(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [389]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::~DistTab() [272]
[547]    0.0    0.00    0.00       1         DWish::~DWish() [547]
                0.00    0.00       1/23          Distribution::~Distribution() [390]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::FuncTab() [262]
[548]    0.0    0.00    0.00       1         Logit::Logit() [548]
                0.00    0.00       1/24          ScalarFunc::ScalarFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [388]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::~FuncTab() [271]
[549]    0.0    0.00    0.00       1         Logit::~Logit() [549]
                0.00    0.00       1/28          Function::~Function() [386]
-----------------------------------------------
                0.00    0.00       1/1           Console::update(long) [4]
[550]    0.0    0.00    0.00       1         Model::isInitialized() [550]
-----------------------------------------------
                0.00    0.00       1/1           Console::checkModel(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [583]
[551]    0.0    0.00    0.00       1         Model::Model() [551]
                0.00    0.00       1/3891        Graph::Graph() [358]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::DistTab() [281]
[552]    0.0    0.00    0.00       1         DChisq::DChisq() [552]
                0.00    0.00       1/12          DistReal::DistReal(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int, Support, int, int) [397]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::~DistTab() [272]
[553]    0.0    0.00    0.00       1         DChisq::~DChisq() [553]
                0.00    0.00       1/23          Distribution::~Distribution() [390]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::DistTab() [281]
[554]    0.0    0.00    0.00       1         DDirch::DDirch() [554]
                0.00    0.00       1/23          Distribution::Distribution(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [389]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::~DistTab() [272]
[555]    0.0    0.00    0.00       1         DDirch::~DDirch() [555]
                0.00    0.00       1/23          Distribution::~Distribution() [390]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::DistTab() [281]
[556]    0.0    0.00    0.00       1         DGamma::DGamma() [556]
                0.00    0.00       1/12          DistReal::DistReal(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int, Support, int, int) [397]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::~DistTab() [272]
[557]    0.0    0.00    0.00       1         DGamma::~DGamma() [557]
                0.00    0.00       1/23          Distribution::~Distribution() [390]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::DistTab() [281]
[558]    0.0    0.00    0.00       1         DLnorm::DLnorm() [558]
                0.00    0.00       1/12          DistReal::DistReal(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int, Support, int, int) [397]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::~DistTab() [272]
[559]    0.0    0.00    0.00       1         DLnorm::~DLnorm() [559]
                0.00    0.00       1/23          Distribution::~Distribution() [390]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::DistTab() [281]
[560]    0.0    0.00    0.00       1         DLogis::DLogis() [560]
                0.00    0.00       1/12          DistReal::DistReal(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int, Support, int, int) [397]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::~DistTab() [272]
[561]    0.0    0.00    0.00       1         DLogis::~DLogis() [561]
                0.00    0.00       1/23          Distribution::~Distribution() [390]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::DistTab() [281]
[562]    0.0    0.00    0.00       1         DMNorm::DMNorm() [562]
                0.00    0.00       1/23          Distribution::Distribution(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [389]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::~DistTab() [272]
[563]    0.0    0.00    0.00       1         DMNorm::~DMNorm() [563]
                0.00    0.00       1/23          Distribution::~Distribution() [390]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::DistTab() [281]
[564]    0.0    0.00    0.00       1         DMulti::DMulti() [564]
                0.00    0.00       1/23          Distribution::Distribution(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [389]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::~DistTab() [272]
[565]    0.0    0.00    0.00       1         DMulti::~DMulti() [565]
                0.00    0.00       1/23          Distribution::~Distribution() [390]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::FuncTab() [262]
[566]    0.0    0.00    0.00       1         Divide::Divide() [566]
                0.00    0.00       1/24          ScalarFunc::ScalarFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [388]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::~FuncTab() [271]
[567]    0.0    0.00    0.00       1         Divide::~Divide() [567]
                0.00    0.00       1/28          Function::~Function() [386]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::FuncTab() [262]
[568]    0.0    0.00    0.00       1         Equals::Equals() [568]
                0.00    0.00       1/24          ScalarFunc::ScalarFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [388]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::~FuncTab() [271]
[569]    0.0    0.00    0.00       1         Equals::~Equals() [569]
                0.00    0.00       1/28          Function::~Function() [386]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::FuncTab() [262]
[570]    0.0    0.00    0.00       1         ILogit::ILogit() [570]
                0.00    0.00       1/4           InverseLinkFunc::InverseLinkFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [425]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::~FuncTab() [271]
[571]    0.0    0.00    0.00       1         ILogit::~ILogit() [571]
                0.00    0.00       1/28          Function::~Function() [386]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::FuncTab() [262]
[572]    0.0    0.00    0.00       1         InProd::InProd() [572]
                0.00    0.00       1/24          ScalarFunc::ScalarFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [388]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::~FuncTab() [271]
[573]    0.0    0.00    0.00       1         InProd::~InProd() [573]
                0.00    0.00       1/28          Function::~Function() [386]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::FuncTab() [262]
[574]    0.0    0.00    0.00       1         LogDet::LogDet() [574]
                0.00    0.00       1/24          ScalarFunc::ScalarFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [388]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::~FuncTab() [271]
[575]    0.0    0.00    0.00       1         LogDet::~LogDet() [575]
                0.00    0.00       1/28          Function::~Function() [386]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::FuncTab() [262]
[576]    0.0    0.00    0.00       1         LogGam::LogGam() [576]
                0.00    0.00       1/24          ScalarFunc::ScalarFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [388]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::~FuncTab() [271]
[577]    0.0    0.00    0.00       1         LogGam::~LogGam() [577]
                0.00    0.00       1/28          Function::~Function() [386]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::FuncTab() [262]
[578]    0.0    0.00    0.00       1         Probit::Probit() [578]
                0.00    0.00       1/24          ScalarFunc::ScalarFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [388]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::~FuncTab() [271]
[579]    0.0    0.00    0.00       1         Probit::~Probit() [579]
                0.00    0.00       1/28          Function::~Function() [386]
-----------------------------------------------
                0.00    0.00       1/1           Console::Console(std::basic_ostream<char, std::char_traits<char> >&, std::basic_ostream<char, std::char_traits<char> >&) [260]
[580]    0.0    0.00    0.00       1         SymTab::SymTab() [580]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::FuncTab() [262]
[581]    0.0    0.00    0.00       1         CLogLog::CLogLog() [581]
                0.00    0.00       1/24          ScalarFunc::ScalarFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [388]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::~FuncTab() [271]
[582]    0.0    0.00    0.00       1         CLogLog::~CLogLog() [582]
                0.00    0.00       1/28          Function::~Function() [386]
-----------------------------------------------
                0.00    0.00       1/1           zzparse() [2]
[583]    0.0    0.00    0.00       1         Console::checkModel(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [583]
                0.00    0.00       1/1           Model::Model() [551]
                0.00    0.00       1/1           parse_bugs(_IO_FILE*, std::vector<ParseTree*, std::allocator<ParseTree*> >**, ParseTree**) [465]
-----------------------------------------------
                0.00    0.00       1/1           main [1]
[584]    0.0    0.00    0.00       1         Console::setSeed(unsigned int) [584]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::DistTab() [281]
[585]    0.0    0.00    0.00       1         DMState::DMState() [585]
                0.00    0.00       1/5           DistFinite::DistFinite(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [422]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::~DistTab() [272]
[586]    0.0    0.00    0.00       1         DMState::~DMState() [586]
                0.00    0.00       1/23          Distribution::~Distribution() [390]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::DistTab() [281]
[587]    0.0    0.00    0.00       1         DNegBin::DNegBin() [587]
                0.00    0.00       1/2           DistDiscrete::DistDiscrete(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [443]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::~DistTab() [272]
[588]    0.0    0.00    0.00       1         DNegBin::~DNegBin() [588]
                0.00    0.00       1/23          Distribution::~Distribution() [390]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::FuncTab() [262]
[589]    0.0    0.00    0.00       1         Inverse::Inverse() [589]
                0.00    0.00       1/28          Function::Function(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [385]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::~FuncTab() [271]
[590]    0.0    0.00    0.00       1         Inverse::~Inverse() [590]
                0.00    0.00       1/28          Function::~Function() [386]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::FuncTab() [262]
[591]    0.0    0.00    0.00       1         LogFact::LogFact() [591]
                0.00    0.00       1/24          ScalarFunc::ScalarFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [388]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::~FuncTab() [271]
[592]    0.0    0.00    0.00       1         LogFact::~LogFact() [592]
                0.00    0.00       1/28          Function::~Function() [386]
-----------------------------------------------
                0.00    0.00       1/1           Compiler::writeRelations(ParseTree const*) [36]
[593]    0.0    0.00    0.00       1         Compiler::resolveAliases() [593]
-----------------------------------------------
                0.00    0.00       1/1           Console::compile(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, unsigned int) [35]
[594]    0.0    0.00    0.00       1         Compiler::Compiler(Graph&, SymTab&, FuncTab const&, DistTab const&, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&) [594]
                0.00    0.00       1/1           CounterTab::CounterTab() [489]
                0.00    0.00       1/3891        Graph::Graph() [358]
                0.00    0.00       1/3           Graph::size() const [433]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::FuncTab() [262]
[595]    0.0    0.00    0.00       1         ICLogLog::ICLogLog() [595]
                0.00    0.00       1/4           InverseLinkFunc::InverseLinkFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [425]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::~FuncTab() [271]
[596]    0.0    0.00    0.00       1         ICLogLog::~ICLogLog() [596]
                0.00    0.00       1/28          Function::~Function() [386]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::FuncTab() [262]
[597]    0.0    0.00    0.00       1         Multiply::Multiply() [597]
                0.00    0.00       1/24          ScalarFunc::ScalarFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [388]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::~FuncTab() [271]
[598]    0.0    0.00    0.00       1         Multiply::~Multiply() [598]
                0.00    0.00       1/28          Function::~Function() [386]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::FuncTab() [262]
[599]    0.0    0.00    0.00       1         Subtract::Subtract() [599]
                0.00    0.00       1/24          ScalarFunc::ScalarFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [388]
-----------------------------------------------
                0.00    0.00       1/1           FuncTab::~FuncTab() [271]
[600]    0.0    0.00    0.00       1         Subtract::~Subtract() [600]
                0.00    0.00       1/28          Function::~Function() [386]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::DistTab() [281]
[601]    0.0    0.00    0.00       1         DInterval::DInterval() [601]
                0.00    0.00       1/5           DistFinite::DistFinite(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [422]
-----------------------------------------------
                0.00    0.00       1/1           DistTab::~DistTab() [272]
[602]    0.0    0.00    0.00       1         DInterval::~DInterval() [602]
                0.00    0.00       1/23          Distribution::~Distribution() [390]
-----------------------------------------------
                0.00    0.00       1/1           Compiler::collectNodes() [142]
[603]    0.0    0.00    0.00       1         LogicalFactory::graph() const [603]
-----------------------------------------------
                0.00    0.00       1/1           Model::~Model() [259]
[604]    0.0    0.00    0.00       1         std::_List_base<TraceMonitor*, std::allocator<TraceMonitor*> >::__clear() [604]
-----------------------------------------------
                0.00    0.00       1/1           Console::compile(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, unsigned int) [35]
[605]    0.0    0.00    0.00       1         std::_List_base<NodeAlias*, std::allocator<NodeAlias*> >::__clear() [605]
-----------------------------------------------
                                   6             std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >*) [606]
                0.00    0.00       1/1           __tcf_1 [1249]
[606]    0.0    0.00    0.00       1+6       std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >*) [606]
                                   6             std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >*) [606]
-----------------------------------------------
                                  21             std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >*) [607]
                0.00    0.00       1/1           __tcf_0 [1246]
[607]    0.0    0.00    0.00       1+21      std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >*) [607]
                                  21             std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >*) [607]
-----------------------------------------------
                                   8             std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >*) [608]
                0.00    0.00       1/1           ConjugateFactory::~ConjugateFactory() [495]
[608]    0.0    0.00    0.00       1+8       std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >*) [608]
                                   8             std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >*) [608]
-----------------------------------------------
                                  23             std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >*) [609]
                0.00    0.00       1/1           DistTab::~DistTab() [272]
[609]    0.0    0.00    0.00       1+23      std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >*) [609]
                                  23             std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >*) [609]
-----------------------------------------------
                                  12             std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >*) [610]
                0.00    0.00       1/1           Console::~Console() [256]
[610]    0.0    0.00    0.00       1+12      std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >*) [610]
                                  12             std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >*) [610]
-----------------------------------------------

 This table describes the call tree of the program, and was sorted by
 the total amount of time spent in each function and its children.

 Each entry in this table consists of several lines.  The line with the
 index number at the left hand margin lists the current function.
 The lines above it list the functions that called this function,
 and the lines below it list the functions this one called.
 This line lists:
     index	A unique number given to each element of the table.
		Index numbers are sorted numerically.
		The index number is printed next to every function name so
		it is easier to look up where the function in the table.

     % time	This is the percentage of the `total' time that was spent
		in this function and its children.  Note that due to
		different viewpoints, functions excluded by options, etc,
		these numbers will NOT add up to 100%.

     self	This is the total amount of time spent in this function.

     children	This is the total amount of time propagated into this
		function by its children.

     called	This is the number of times the function was called.
		If the function called itself recursively, the number
		only includes non-recursive calls, and is followed by
		a `+' and the number of recursive calls.

     name	The name of the current function.  The index number is
		printed after it.  If the function is a member of a
		cycle, the cycle number is printed between the
		function's name and the index number.


 For the function's parents, the fields have the following meanings:

     self	This is the amount of time that was propagated directly
		from the function into this parent.

     children	This is the amount of time that was propagated from
		the function's children into this parent.

     called	This is the number of times this parent called the
		function `/' the total number of times the function
		was called.  Recursive calls to the function are not
		included in the number after the `/'.

     name	This is the name of the parent.  The parent's index
		number is printed after it.  If the parent is a
		member of a cycle, the cycle number is printed between
		the name and the index number.

 If the parents of the function cannot be determined, the word
 `<spontaneous>' is printed in the `name' field, and all the other
 fields are blank.

 For the function's children, the fields have the following meanings:

     self	This is the amount of time that was propagated directly
		from the child into the function.

     children	This is the amount of time that was propagated from the
		child's children to the function.

     called	This is the number of times the function called
		this child `/' the total number of times the child
		was called.  Recursive calls by the child are not
		listed in the number after the `/'.

     name	This is the name of the child.  The child's index
		number is printed after it.  If the child is a
		member of a cycle, the cycle number is printed
		between the name and the index number.

 If there are any cycles (circles) in the call graph, there is an
 entry for the cycle-as-a-whole.  This entry shows who called the
 cycle (as parents) and the members of the cycle (as children.)
 The `+' recursive calls entry shows the number of function calls that
 were internal to the cycle, and the calls entry for each member shows,
 for that member, how many times it was called from other members of
 the cycle.


Index by function name

 [446] global constructors keyed to JAGS_NA [530] Step::Step() [58] Index::length() const
 [447] global constructors keyed to _Z7getDistPK14StochasticNode [531] Step::~Step() [326] Index::operator==(Index const&) const
 [448] global constructors keyed to _Z9MatrixExpPdPKdid [532] DBern::DBern() [23] Index::operator[](unsigned int) const
 [449] global constructors keyed to _Z9readRDataPKSt6vectorIP9ParseTreeSaIS1_EERSt3mapISs6SArraySt4lessISsESaISt4pairIKSsS7_EEE [533] DBern::~DBern() [330] Index::operator!=(Index const&) const
 [450] global constructors keyed to _ZN11LogicalNodeC2EPK8FunctionRK5Index [534] DBeta::DBeta() [22] Range::leftOffset(Index const&) const
 [451] global constructors keyed to _ZN11MixtureNodeC2EP4NodeRKSt6vectorISt4pairIlS1_ESaIS4_EE [535] DBeta::~DBeta() [143] Range::dim(bool) const
 [452] global constructors keyed to _ZN11SubSetIndexC2Ev [536] DDexp::DDexp() [203] Range::ndim(bool) const
 [453] global constructors keyed to _ZN12TraceMonitorC2EP4Nodelli [537] DDexp::~DDexp() [171] Range::lower() const
 [454] global constructors keyed to _ZN18ConjugateDirichletC2EP14StochasticNode [538] DNorm::DNorm() [212] Range::upper() const
 [455] global constructors keyed to _ZN5ModelC2Ev [539] DNorm::~DNorm() [204] Range::length() const
 [456] global constructors keyed to _ZN6SymTabC2Ev [540] DPois::DPois() [25] Range::contains(Index const&) const
 [457] global constructors keyed to _ZN7ConsoleC2ERSoS0_ [541] DPois::~DPois() [109] Range::contains(Range const&) const
 [458] global constructors keyed to _ZN7DMStateC2Ev [542] DUnif::DUnif() [335] Range::operator==(Range const&) const
 [459] global constructors keyed to _ZN7SamplerC2ERKSt6vectorIP14StochasticNodeSaIS2_EE [543] DUnif::~DUnif() [227] Divide::checkParameterValue(std::vector<SArray const*, std::allocator<SArray const*> > const&) const
 [460] global constructors keyed to _ZN8Compiler18constantExpressionEPK9ParseTreeRd [544] DWeib::DWeib() [350] Divide::evaluate(std::vector<SArray const*, std::allocator<SArray const*> > const&) const
 [461] global constructors keyed to _ZN9NodeArrayC2ERK5Index [545] DWeib::~DWeib() [15] ILogit::evaluate(std::vector<SArray const*, std::allocator<SArray const*> > const&) const
 [462] global constructors keyed to _data_table [546] DWish::DWish() [327] SArray::dim(bool) const
 [463] global constructors keyed to yydebug [547] DWish::~DWish() [334] SArray::range() const
 [464] global constructors keyed to zzleng [38] Graph::getSortedNodes(std::vector<Node*, std::allocator<Node*> >&) [40] SArray::length() const
 [129] isObserved(Node const*) [57] Graph::add(Node*)    [133] SArray::isFixed() const
 [465] parse_bugs(_IO_FILE*, std::vector<ParseTree*, std::allocator<ParseTree*> >**, ParseTree**) [90] Graph::remove(Node*) [66] SymTab::getVariable(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const
 [141] printRange(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, Range const&) [69] Graph::hasCycle() [351] Counter::atEnd() const
 [122] getFunction(ParseTree const*, FuncTab const&) [81] Graph::isClosed() [323] Counter::value() const
 [211] init_tables()         [358] Graph::Graph()        [168] DistTab::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const
 [316] asStochastic(Node*)    [62] Graph::~Graph()       [200] FuncTab::findInverse(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const
  [51] classifyNode(Node*, Graph&, Graph&) [181] Index::Index(Index const&) [130] FuncTab::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const
 [215] isStochastic(Node const*) [53] Index::Index(unsigned int) [101] Sampler::deterministicChildren() const
 [343] lowerDefault(Support) [217] Index::Index(Index const&) [185] Sampler::nodes() const
 [344] upperDefault(Support)  [95] Index::~Index()       [157] DistReal::lowerLimit(std::vector<SArray const*, std::allocator<SArray const*> > const&) const
 [423] yy_flex_free(void*)   [318] Index::~Index()       [235] DistReal::upperLimit(std::vector<SArray const*, std::allocator<SArray const*> > const&) const
  [86] getParameters(double&, double&, std::vector<SArray const*, std::allocator<SArray const*> > const&) [216] Index::operator=(Index const&) [45] DistReal::logLikelihood(SArray const&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const
 [192] leftIncrement(Index&, Index const&, Index const&, int) [55] Index::operator[](unsigned int) [295] DistReal::checkParameterDim(SArray const&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const
 [419] setParameters(ParseTree*, std::vector<ParseTree*, std::allocator<ParseTree*> >*) [548] Logit::Logit() [24] Function::checkParameterValue(std::vector<SArray const*, std::allocator<SArray const*> > const&) const
 [380] setParameters(ParseTree*, std::vector<ParseTree*, std::allocator<ParseTree*> >*) [549] Logit::~Logit() [331] Function::checkParameterLength(std::vector<SArray const*, std::allocator<SArray const*> > const&) const
 [404] setParameters(ParseTree*, ParseTree*) [52] Model::checkGraph() [225] Function::name() const
 [394] setParameters(ParseTree*, ParseTree*) [73] Model::initialize() [16] Multiply::evaluate(std::vector<SArray const*, std::allocator<SArray const*> > const&) const
 [466] setParameters(ParseTree*, ParseTree*, ParseTree*) [550] Model::isInitialized() [18] Subtract::evaluate(std::vector<SArray const*, std::allocator<SArray const*> > const&) const
 [384] setParameters(ParseTree*, ParseTree*, ParseTree*) [28] Model::chooseSamplers(std::vector<SamplerFactory const*, std::allocator<SamplerFactory const*> > const&) [107] NodeArray::rangeContainsSetNodes(Range const&) const
 [416] yy_flex_alloc(unsigned int) [432] Model::graph()   [63] NodeArray::get(Range const&) const
 [435] yy_flex_alloc(unsigned int) [3] Model::update(long) [336] NodeArray::name() const
  [72] findDescendant(Node*, Node*, Graph const*, GraphMarks&) [551] Model::Model() [399] NodeArray::graph() const
 [436] yy_init_buffer(yy_buffer_state*, _IO_FILE*) [259] Model::~Model() [315] NodeArray::range() const
 [420] zz_init_buffer(yy_buffer_state*, _IO_FILE*) [131] Range::Range(Index const&, Index const&) [180] ParseTree::parameters() const
 [319] asDeterministic(Node*) [158] Range::Range()       [223] ParseTree::getOperator() const
 [164] getDistribution(ParseTree const*, DistTab const&) [552] DChisq::DChisq() [183] ParseTree::name() const
 [317] isDeterministic(Node const*) [553] DChisq::~DChisq() [337] ParseTree::value() const
 [437] yy_flush_buffer(yy_buffer_state*) [554] DDirch::DDirch() [312] ParseTree::treeClass() const
 [421] zz_flush_buffer(yy_buffer_state*) [555] DDirch::~DDirch() [156] std::basic_stringbuf<char, std::char_traits<char>, std::allocator<char> >::str() const
 [438] open_data_buffer(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const*) [556] DGamma::DGamma() [77] std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::find(Range const&) const
 [467] yy_create_buffer(_IO_FILE*, int) [557] DGamma::~DGamma() [366] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const
 [429] zz_create_buffer(_IO_FILE*, int) [558] DLnorm::DLnorm() [188] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const
 [439] zz_delete_buffer(yy_buffer_state*) [559] DLnorm::~DLnorm() [121] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const
 [405] yy_get_next_buffer()  [560] DLogis::DLogis()       [43] std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::find(Node* const&) const
 [430] yy_get_next_buffer()  [561] DLogis::~DLogis()     [328] std::_Rb_tree<StochasticNode const*, StochasticNode const*, std::_Identity<StochasticNode const*>, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> >::find(StochasticNode const* const&) const
 [424] zz_switch_to_buffer(yy_buffer_state*) [562] DMNorm::DMNorm() [85] std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::find(Node const* const&) const
 [431] yy_load_buffer_state() [563] DMNorm::~DMNorm()    [348] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const
 [406] zz_load_buffer_state() [564] DMulti::DMulti()      [67] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const
 [440] return_to_main_buffer() [565] DMulti::~DMulti()   [338] std::allocator<Node*>::~allocator()
 [414] yy_get_previous_state() [566] Divide::Divide()    [166] char* std::basic_string<char, std::char_traits<char>, std::allocator<char> >::_S_construct<char*>(char*, char*, std::allocator<char> const&, std::forward_iterator_tag)
 [441] yy_get_previous_state() [567] Divide::~Divide()   [167] std::basic_string<char, std::char_traits<char>, std::allocator<char> >::basic_string<char*>(char*, char*, std::allocator<char> const&)
 [199] setConstantNameToValue(ConstantNode*) [568] Equals::Equals() [604] std::_List_base<TraceMonitor*, std::allocator<TraceMonitor*> >::__clear()
 [468] __static_initialization_and_destruction_0(int, int) [569] Equals::~Equals() [605] std::_List_base<NodeAlias*, std::allocator<NodeAlias*> >::__clear()
 [469] __static_initialization_and_destruction_0(int, int) [570] ILogit::ILogit() [139] std::_Vector_base<Node*, std::allocator<Node*> >::_Vector_base(unsigned int, std::allocator<Node*> const&)
 [470] __static_initialization_and_destruction_0(int, int) [571] ILogit::~ILogit() [352] std::__simple_alloc<Node*, std::__default_alloc_template<true, 0> >::allocate(unsigned int)
 [471] __static_initialization_and_destruction_0(int, int) [572] InProd::InProd() [325] std::basic_stringbuf<char, std::char_traits<char>, std::allocator<char> >::_M_really_sync(unsigned int, unsigned int)
 [472] __static_initialization_and_destruction_0(int, int) [573] InProd::~InProd() [169] std::basic_stringbuf<char, std::char_traits<char>, std::allocator<char> >::overflow(int)
 [473] __static_initialization_and_destruction_0(int, int) [574] LogDet::LogDet() [219] std::_Rb_tree_base_iterator::_M_decrement()
 [474] __static_initialization_and_destruction_0(int, int) [575] LogDet::~LogDet() [49] std::_Rb_tree_base_iterator::_M_increment()
 [475] __static_initialization_and_destruction_0(int, int) [576] LogGam::LogGam() [241] std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>::~pair()
 [476] __static_initialization_and_destruction_0(int, int) [577] LogGam::~LogGam() [124] std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >::~pair()
 [477] __static_initialization_and_destruction_0(int, int) [578] Probit::Probit() [339] std::vector<SubSetIndex, std::allocator<SubSetIndex> >::_M_insert_aux(__gnu_cxx::__normal_iterator<SubSetIndex*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, SubSetIndex const&)
 [478] __static_initialization_and_destruction_0(int, int) [579] Probit::~Probit() [357] std::vector<StochasticNode*, std::allocator<StochasticNode*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<StochasticNode**, std::vector<StochasticNode*, std::allocator<StochasticNode*> > >, StochasticNode* const&)
 [479] __static_initialization_and_destruction_0(int, int) [222] SArray::setFixed(bool) [342] std::vector<DeterministicNode*, std::allocator<DeterministicNode*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<DeterministicNode**, std::vector<DeterministicNode*, std::allocator<DeterministicNode*> > >, DeterministicNode* const&)
 [480] __static_initialization_and_destruction_0(int, int) [20] SArray::setValue(double const*, unsigned long) [218] std::vector<Node*, std::allocator<Node*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<Node**, std::vector<Node*, std::allocator<Node*> > >, Node* const&)
 [481] __static_initialization_and_destruction_0(int, int) [125] SArray::SArray(Index const&) [353] std::vector<Node*, std::allocator<Node*> >::~vector()
 [482] __static_initialization_and_destruction_0(int, int) [275] SArray::SArray(SArray const&) [400] std::vector<Sampler*, std::allocator<Sampler*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, Sampler* const&)
 [483] __static_initialization_and_destruction_0(int, int) [238] SArray::~SArray() [373] std::vector<ParseTree*, std::allocator<ParseTree*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<ParseTree**, std::vector<ParseTree*, std::allocator<ParseTree*> > >, ParseTree* const&)
 [484] __static_initialization_and_destruction_0(int, int) [266] SymTab::addVariable(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, Index const&) [375] ParseTree** std::vector<ParseTree*, std::allocator<ParseTree*> >::_M_allocate_and_copy<__gnu_cxx::__normal_iterator<ParseTree* const*, std::vector<ParseTree*, std::allocator<ParseTree*> > > >(unsigned int, __gnu_cxx::__normal_iterator<ParseTree* const*, std::vector<ParseTree*, std::allocator<ParseTree*> > >, __gnu_cxx::__normal_iterator<ParseTree* const*, std::vector<ParseTree*, std::allocator<ParseTree*> > >)
 [485] __static_initialization_and_destruction_0(int, int) [255] SymTab::getNodes(std::vector<Node*, std::allocator<Node*> >&) [376] std::vector<ParseTree*, std::allocator<ParseTree*> >::operator=(std::vector<ParseTree*, std::allocator<ParseTree*> > const&)
 [486] __static_initialization_and_destruction_0(int, int) [195] SymTab::writeData(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, bool) [434] std::vector<SamplerFactory const*, std::allocator<SamplerFactory const*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<SamplerFactory const**, std::vector<SamplerFactory const*, std::allocator<SamplerFactory const*> > >, SamplerFactory const* const&)
 [372] yylex()               [580] SymTab::SymTab()      [155] std::vector<SArray const*, std::allocator<SArray const*> >::_M_insert_aux(__gnu_cxx::__normal_iterator<SArray const**, std::vector<SArray const*, std::allocator<SArray const*> > >, SArray const* const&)
 [333] zzlex()               [581] CLogLog::CLogLog()    [444] std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>*, std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > > >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> const&)
 [187] asReal(Distribution const*) [582] CLogLog::~CLogLog() [189] std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > >::_M_insert_aux(__gnu_cxx::__normal_iterator<std::pair<long, Node*>*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > >, std::pair<long, Node*> const&)
 [210] getDist(StochasticNode const*) [583] Console::checkModel(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [108] std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::lower_bound(Range const&)
 [197] getLink(ParseTree const*, FuncTab const&) [27] Console::initialize() [274] std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::insert_unique(std::pair<Range const, Node*> const&)
 [407] setName(ParseTree*, std::basic_string<char, std::char_traits<char>, std::allocator<char> >*) [196] Console::setParameters(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, unsigned int) [194] std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<Range const, Node*>, std::pair<Range const, Node*>&, std::pair<Range const, Node*>*>, std::pair<Range const, Node*> const&)
 [378] setName(ParseTree*, std::basic_string<char, std::char_traits<char>, std::allocator<char> >*) [4] Console::update(long) [239] std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::_M_create_node(std::pair<Range const, Node*> const&)
 [487] yyparse()              [35] Console::compile(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, unsigned int) [207] std::_Rb_tree<Range, std::pair<Range const, Node*>, std::_Select1st<std::pair<Range const, Node*> >, ltrange, std::allocator<std::pair<Range const, Node*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<Range const, Node*> const&)
   [2] zzparse()             [584] Console::setSeed(unsigned int) [417] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::lower_bound(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
 [165] asFinite(Distribution const*) [260] Console::Console(std::basic_ostream<char, std::char_traits<char> >&, std::basic_ostream<char, std::char_traits<char> >&) [299] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> const&)
 [191] makeName(Function const*, std::vector<Node*, std::allocator<Node*> > const&) [256] Console::~Console() [291] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> const&)
 [322] asInteger(double)     [409] Counter::reset()      [418] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::_M_create_node(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> const&)
  [41] asInteger(double)     [354] Counter::increment()  [606] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >*)
 [349] asLogical(Node*)      [410] Counter::Counter(long, long) [292] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateOp> const&)
  [79] indexComp(Index const&, Index const&) [585] DMState::DMState() [395] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::lower_bound(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
  [71] rangeComp(Range const&, Range const&) [586] DMState::~DMState() [300] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> const&)
 [249] readRData(std::vector<ParseTree*, std::allocator<ParseTree*> > const*, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >&) [587] DNegBin::DNegBin() [283] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> const&)
 [488] yyrestart(_IO_FILE*)  [588] DNegBin::~DNegBin()   [396] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::_M_create_node(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> const&)
 [442] zzrestart(_IO_FILE*)  [278] DistTab::insert(Distribution const*) [427] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
 [408] CounterTab::popCounter() [281] DistTab::DistTab() [607] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >*)
 [293] CounterTab::pushCounter(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, Range const&) [272] DistTab::~DistTab() [284] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, ConjugateDist> const&)
 [489] CounterTab::CounterTab() [276] FuncTab::insert(InverseLinkFunc const*) [411] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::lower_bound(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
 [490] CounterTab::~CounterTab() [264] FuncTab::insert(Function const*) [301] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> const&)
 [422] DistFinite::DistFinite(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [262] FuncTab::FuncTab() [288] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> const&)
  [50] GraphMarks::mark(Node const*) [271] FuncTab::~FuncTab() [412] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::_M_create_node(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> const&)
  [94] GraphMarks::mark(Node const*, int) [589] Inverse::Inverse() [608] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >*)
  [89] GraphMarks::GraphMarks(Graph const&) [590] Inverse::~Inverse() [290] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, bool (*)(StochasticNode const*)> const&)
 [135] GraphMarks::~GraphMarks() [591] LogFact::LogFact() [391] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::lower_bound(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
  [19] OffsetNode::forwardSample() [592] LogFact::~LogFact() [302] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> const&)
 [178] OffsetNode::OffsetNode(Range const&, std::vector<SubSetIndex, std::allocator<SubSetIndex> > const&) [30] Sampler::classifyChildren(std::set<StochasticNode const*, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> > const&, std::vector<StochasticNode*, std::allocator<StochasticNode*> >&, std::vector<DeterministicNode*, std::allocator<DeterministicNode*> >&) [279] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> const&)
 [159] OffsetNode::~OffsetNode() [7] Sampler::logFullConditional() [392] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::_M_create_node(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> const&)
 [388] ScalarFunc::ScalarFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [32] Sampler::Sampler(std::vector<StochasticNode*, std::allocator<StochasticNode*> > const&) [393] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
 [491] UnaryMinus::UnaryMinus() [365] Sampler::~Sampler() [609] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >*)
 [492] UnaryMinus::~UnaryMinus() [74] Compiler::VarGetNode(ParseTree const*) [280] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Distribution const*> const&)
 [103] LogicalNode::initialize() [261] Compiler::CounterRange(ParseTree const*) [381] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::lower_bound(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
  [10] LogicalNode::forwardSample() [142] Compiler::collectNodes() [297] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> const&)
 [112] LogicalNode::setParameters(std::vector<Node*, std::allocator<Node*> > const&) [37] Compiler::traverseTree(ParseTree const*, void (Compiler::*)(ParseTree const*), void (Compiler::*)(ParseTree const*)) [270] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> const&)
 [144] LogicalNode::LogicalNode(Function const*, Index const&) [146] Compiler::fillConstants() [382] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::_M_create_node(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> const&)
 [113] LogicalNode::~LogicalNode() [87] Compiler::getSubSetNode(ParseTree const*) [383] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
  [13] MixtureNode::forwardSample() [80] Compiler::getMixtureNode(ParseTree const*) [445] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >*)
 [150] MixtureNode::MixtureNode(Node*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > const&) [593] Compiler::resolveAliases() [273] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, Function const*> const&)
 [160] MixtureNode::~MixtureNode() [36] Compiler::writeRelations(ParseTree const*) [240] std::_Rb_tree<StochasticNode*, StochasticNode*, std::_Identity<StochasticNode*>, std::less<StochasticNode*>, std::allocator<StochasticNode*> >::insert_unique(StochasticNode* const&)
 [201] SubSetIndex::checkLimits(std::vector<SubSetIndex, std::allocator<SubSetIndex> > const&, std::vector<SubSetIndex, std::allocator<SubSetIndex> > const&) [61] Compiler::VarGetParameter(ParseTree const*) [367] std::_Rb_tree<StochasticNode*, StochasticNode*, std::_Identity<StochasticNode*>, std::less<StochasticNode*>, std::allocator<StochasticNode*> >::_M_create_node(StochasticNode* const&)
 [258] SubSetIndex::SubSetIndex(Node*) [59] Compiler::allocateLogical(ParseTree const*) [247] std::_Rb_tree<StochasticNode*, StochasticNode*, std::_Identity<StochasticNode*>, std::less<StochasticNode*>, std::allocator<StochasticNode*> >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, StochasticNode* const&)
 [355] SubSetIndex::SubSetIndex() [320] Compiler::indexExpression(ParseTree const*, long&) [140] std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::lower_bound(Node* const&)
 [179] ConstantNode::ConstantNode(double) [205] Compiler::makeSubsetIndex(ParseTree const*, std::vector<SubSetIndex, std::allocator<SubSetIndex> >&, Index const&) [170] std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::upper_bound(Node* const&)
 [132] ConstantNode::~ConstantNode() [263] Compiler::declareVariables(std::vector<ParseTree*, std::allocator<ParseTree*> > const&) [75] std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::insert_unique(Node* const&)
 [443] DistDiscrete::DistDiscrete(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [60] Compiler::allocateStochastic(ParseTree const*) [213] std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::_M_create_node(Node* const&)
 [389] Distribution::Distribution(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [161] Compiler::constantExpression(ParseTree const*, double&) [88] std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::erase(Node* const&)
 [390] Distribution::~Distribution() [206] Compiler::writeValuesToGraph(std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&, bool) [127] std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::erase(std::_Rb_tree_iterator<Node*, Node*&, Node**>, std::_Rb_tree_iterator<Node*, Node*&, Node**>)
 [232] GibbsSampler::classifyChildren(StochasticNode const*, std::vector<StochasticNode*, std::allocator<StochasticNode*> >&, std::vector<DeterministicNode*, std::allocator<DeterministicNode*> >&) [82] Compiler::VariableSubsetRange(ParseTree const*) [110] std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::_M_erase(std::_Rb_tree_node<Node*>*)
 [114] GibbsSampler::node()   [54] Compiler::getLogicalParameter(ParseTree const*) [104] std::_Rb_tree<Node*, Node*, std::_Identity<Node*>, std::less<Node*>, std::allocator<Node*> >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, Node* const&)
   [6] GibbsSampler::setValue(double const*, long) [47] Compiler::setLogicalParameters(ParseTree const*) [245] std::_Rb_tree<StochasticNode const*, StochasticNode const*, std::_Identity<StochasticNode const*>, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> >::insert_unique(StochasticNode const* const&)
  [31] GibbsSampler::GibbsSampler(StochasticNode*) [46] Compiler::setStochasticParameters(ParseTree const*) [363] std::_Rb_tree<StochasticNode const*, StochasticNode const*, std::_Identity<StochasticNode const*>, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> >::_M_create_node(StochasticNode const* const&)
 [493] SliceFactory::~SliceFactory() [193] Compiler::getLogicalParameterVector(ParseTree const*, std::vector<Node*, std::allocator<Node*> >&) [364] std::_Rb_tree<StochasticNode const*, StochasticNode const*, std::_Identity<StochasticNode const*>, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> >::_M_erase(std::_Rb_tree_node<StochasticNode const*>*)
  [21] SliceSampler::update() [254] Compiler::Param(ParseTree const*) [246] std::_Rb_tree<StochasticNode const*, StochasticNode const*, std::_Identity<StochasticNode const*>, std::less<StochasticNode const*>, std::allocator<StochasticNode const*> >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, StochasticNode const* const&)
 [267] SliceSampler::canSample(StochasticNode const*) [116] Compiler::getRange(std::vector<ParseTree*, std::allocator<ParseTree*> > const&, Range const&, Range&) [145] std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::lower_bound(Node const* const&)
 [208] SliceSampler::SliceSampler(StochasticNode*, double, long) [594] Compiler::Compiler(Graph&, SymTab&, FuncTab const&, DistTab const&, std::map<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, SArray, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > > const&) [120] std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::insert_unique(std::pair<Node const* const, int> const&)
 [415] SliceSampler::~SliceSampler() [397] DistReal::DistReal(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int, Support, int, int) [128] std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::insert_unique(std::_Rb_tree_iterator<std::pair<Node const* const, int>, std::pair<Node const* const, int>&, std::pair<Node const* const, int>*>, std::pair<Node const* const, int> const&)
 [494] FiniteFactory::~FiniteFactory() [385] Function::Function(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, unsigned int) [184] std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::_M_create_node(std::pair<Node const* const, int> const&)
   [5] FiniteSampler::update() [386] Function::~Function() [48] std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::find(Node const* const&)
 [236] FiniteSampler::canSample(StochasticNode const*) [595] ICLogLog::ICLogLog() [134] std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::_M_erase(std::_Rb_tree_node<std::pair<Node const* const, int> >*)
  [33] FiniteSampler::FiniteSampler(StochasticNode*) [596] ICLogLog::~ICLogLog() [126] std::_Rb_tree<Node const*, std::pair<Node const* const, int>, std::_Select1st<std::pair<Node const* const, int> >, std::less<Node const*>, std::allocator<std::pair<Node const* const, int> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<Node const* const, int> const&)
 [369] FiniteSampler::~FiniteSampler() [597] Multiply::Multiply() [177] std::_Rb_tree<SArray const*, SArray const*, std::_Identity<SArray const*>, std::less<SArray const*>, std::allocator<SArray const*> >::insert_unique(SArray const* const&)
  [64] LogicalFactory::getLogicalNode(Function const*, std::vector<Node*, std::allocator<Node*> > const&) [598] Multiply::~Multiply() [224] std::_Rb_tree<SArray const*, SArray const*, std::_Identity<SArray const*>, std::less<SArray const*>, std::allocator<SArray const*> >::_M_create_node(SArray const* const&)
   [8] StochasticNode::logDensity() [599] Subtract::Subtract() [190] std::_Rb_tree<SArray const*, SArray const*, std::_Identity<SArray const*>, std::less<SArray const*>, std::allocator<SArray const*> >::_M_erase(std::_Rb_tree_node<SArray const*>*)
 [251] StochasticNode::forwardSample() [600] Subtract::~Subtract() [202] std::_Rb_tree<SArray const*, SArray const*, std::_Identity<SArray const*>, std::less<SArray const*>, std::allocator<SArray const*> >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, SArray const* const&)
 [148] StochasticNode::setParameters(std::vector<Node*, std::allocator<Node*> > const&) [601] DInterval::DInterval() [277] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> const&)
 [175] StochasticNode::StochasticNode(Distribution const*, Index const&) [602] DInterval::~DInterval() [286] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::_M_create_node(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> const&)
 [137] ConjugateNormal::canSample(StochasticNode const*) [56] NodeArray::set(Node*, Range const&) [413] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
 [425] InverseLinkFunc::InverseLinkFunc(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&, std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [398] NodeArray::setName(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [296] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >*)
 [289] ConjugateFactory::ConjugateFactory() [172] NodeArray::setValue(SArray const&, bool) [282] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, SArray> const&)
 [495] ConjugateFactory::~ConjugateFactory() [84] NodeArray::getSubset(Range const&) [401] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::lower_bound(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
  [92] DeterministicNode::initialize() [269] NodeArray::NodeArray(Index const&) [303] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::insert_unique(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> const&)
 [138] DeterministicNode::DeterministicNode(Index const&) [387] ParseTree::setOperator(Operator) [285] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>&, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>*>, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> const&)
 [174] LeftRangeIterator::LeftRangeIterator(Range const&) [374] ParseTree::setParameters(std::vector<ParseTree*, std::allocator<ParseTree*> > const&) [402] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::_M_create_node(std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> const&)
 [162] LeftRangeIterator::operator++() [377] ParseTree::setName(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [403] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::find(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&)
 [496] DT::DT()              [346] ParseTree::setValue(double) [610] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::_M_erase(std::_Rb_tree_node<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >*)
 [497] DT::~DT()             [345] ParseTree::ParseTree(TreeClass) [287] std::_Rb_tree<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*>, std::_Select1st<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> >, std::less<std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> > const, NodeArray*> const&)
 [498] SD::SD()              [182] ltlogical::operator()(std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >) [123] std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::lower_bound(std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const&)
 [499] SD::~SD()             [154] CounterTab::getCounter(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) const [294] std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::insert_unique(std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> const&)
 [500] Add::Add()            [252] DistFinite::randomSample(SArray&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [198] std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>&, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>*>, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> const&)
 [501] Add::~Add()             [9] DistFinite::logLikelihood(SArray const&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [244] std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::_M_create_node(std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> const&)
 [502] Exp::Exp()            [248] ScalarFunc::dim(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [118] std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::find(std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const&)
 [503] Exp::~Exp()           [242] ScalarFunc::checkDim(SArray const&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [228] std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::_M_erase(std::_Rb_tree_node<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >*)
 [504] Log::Log()             [11] ScalarFunc::evaluate(SArray&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [231] std::_Rb_tree<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > >, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*>, std::_Select1st<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> >, ltlogical, std::allocator<std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<std::pair<Function const*, std::vector<Node*, std::allocator<Node*> > > const, LogicalNode*> const&)
 [505] Log::~Log()           [371] UnaryMinus::evaluate(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [340] std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::lower_bound(long const&)
 [506] Max::Max()            [220] SubSetIndex::node() const [243] std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::insert_unique(std::pair<long const, Node*> const&)
 [507] Max::~Max()            [26] SubSetIndex::value() const [233] std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::insert_unique(std::_Rb_tree_iterator<std::pair<long const, Node*>, std::pair<long const, Node*>&, std::pair<long const, Node*>*>, std::pair<long const, Node*> const&)
 [508] Min::Min()             [96] Distribution::lowerBound(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [341] std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::_M_create_node(std::pair<long const, Node*> const&)
 [509] Min::~Min()           [186] Distribution::upperBound(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [14] std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::find(long const&)
 [510] Phi::Phi()            [226] Distribution::checkParameterLength(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [359] std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::_M_erase(std::_Rb_tree_node<std::pair<long const, Node*> >*)
 [511] Phi::~Phi()           [361] Distribution::name() const [234] std::_Rb_tree<long, std::pair<long const, Node*>, std::_Select1st<std::pair<long const, Node*> >, std::less<long>, std::allocator<std::pair<long const, Node*> > >::_M_insert(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*, std::pair<long const, Node*> const&)
 [512] Pow::Pow()             [29] GibbsFactory::makeSampler(std::set<StochasticNode*, std::less<StochasticNode*>, std::allocator<StochasticNode*> >&, std::vector<Sampler*, std::allocator<Sampler*> >&) const [149] void std::__push_heap<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, Sampler*, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, int, Sampler*, less_sampler)
 [513] Pow::~Pow()           [209] SliceFactory::makeGibbsSampler(StochasticNode*) const [100] void std::partial_sort<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler)
 [514] Sum::Sum()            [268] SliceFactory::canSample(StochasticNode const*) const [99] void std::__adjust_heap<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, Sampler*, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, int, Sampler*, less_sampler)
 [515] Sum::~Sum()            [34] FiniteFactory::makeGibbsSampler(StochasticNode*) const [257] void std::__insertion_sort<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler)
 [516] DBin::DBin()          [237] FiniteFactory::canSample(StochasticNode const*) const [68] void std::__introsort_loop<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, int, less_sampler)
 [517] DBin::~DBin()         [603] LogicalFactory::graph() const [97] std::_Rb_tree_rebalance(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&)
 [518] DCat::DCat()          [115] StochasticNode::parameters() const [153] std::_Rb_tree_rotate_left(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&)
 [519] DCat::~DCat()          [39] StochasticNode::distribution() const [324] std::_Rb_tree_rotate_right(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&)
 [520] DExp::DExp()          [426] InverseLinkFunc::linkName() const [93] __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > > std::__unguarded_partition<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, Sampler*, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, Sampler*, less_sampler)
 [521] DExp::~DExp()         [136] ConjugateFactory::canSample(StochasticNode const*) const [229] void std::__final_insertion_sort<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler)
 [522] DPar::DPar()          [173] LeftRangeIterator::atEnd() const [332] __gnu_cxx::__normal_iterator<SubSetIndex*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > > std::__uninitialized_copy_aux<__gnu_cxx::__normal_iterator<SubSetIndex*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, __gnu_cxx::__normal_iterator<SubSetIndex*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > > >(__gnu_cxx::__normal_iterator<SubSetIndex*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, __gnu_cxx::__normal_iterator<SubSetIndex*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, __gnu_cxx::__normal_iterator<SubSetIndex*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, __false_type)
 [523] DPar::~DPar()          [17] Add::evaluate(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [360] SubSetIndex* std::__uninitialized_copy_aux<__gnu_cxx::__normal_iterator<SubSetIndex const*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, SubSetIndex*>(__gnu_cxx::__normal_iterator<SubSetIndex const*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, __gnu_cxx::__normal_iterator<SubSetIndex const*, std::vector<SubSetIndex, std::allocator<SubSetIndex> > >, SubSetIndex*, __false_type)
 [524] Mean::Mean()          [356] Exp::evaluate(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [428] __gnu_cxx::__normal_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>*, std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > > > std::__uninitialized_copy_aux<__gnu_cxx::__normal_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>*, std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > > >, __gnu_cxx::__normal_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>*, std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > > > >(__gnu_cxx::__normal_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>*, std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > > >, __gnu_cxx::__normal_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>*, std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > > >, __gnu_cxx::__normal_iterator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>*, std::vector<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*>, std::allocator<std::pair<std::basic_string<char, std::char_traits<char>, std::allocator<char> >, Counter*> > > >, __false_type)
 [525] Mean::~Mean()          [78] Node::hasDescendant(bool (*)(Node const*)) const [221] __gnu_cxx::__normal_iterator<std::pair<long, Node*>*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > > std::__uninitialized_copy_aux<__gnu_cxx::__normal_iterator<std::pair<long, Node*>*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > >, __gnu_cxx::__normal_iterator<std::pair<long, Node*>*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > > >(__gnu_cxx::__normal_iterator<std::pair<long, Node*>*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > >, __gnu_cxx::__normal_iterator<std::pair<long, Node*>*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > >, __gnu_cxx::__normal_iterator<std::pair<long, Node*>*, std::vector<std::pair<long, Node*>, std::allocator<std::pair<long, Node*> > > >, __false_type)
 [526] Mexp::Mexp()          [321] Node::name() const    [230] void std::__unguarded_linear_insert<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, Sampler*, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, Sampler*, less_sampler)
 [527] Mexp::~Mexp()         [313] Node::parents() const [163] std::_Rb_tree_rebalance_for_erase(std::_Rb_tree_node_base*, std::_Rb_tree_node_base*&, std::_Rb_tree_node_base*&, std::_Rb_tree_node_base*&)
  [91] Node::initialize()    [314] Node::children() const [368] StochasticNode** std::fill_n<StochasticNode**, unsigned int, StochasticNode*>(StochasticNode**, unsigned int, StochasticNode* const&)
 [117] Node::canInitialize() [151] DBern::lowerLimit(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [379] ParseTree** std::fill_n<ParseTree**, unsigned int, ParseTree*>(ParseTree**, unsigned int, ParseTree* const&)
  [98] Node::isInitialized() [152] DBern::upperLimit(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [347] SArray const** std::fill_n<SArray const**, unsigned int, SArray const*>(SArray const**, unsigned int, SArray const* const&)
 [214] Node::ref()           [370] DBern::randomSample(std::vector<SArray const*, std::allocator<SArray const*> > const&) const [253] Sampler* const& std::__median<Sampler*, less_sampler>(Sampler* const&, Sampler* const&, Sampler* const&, less_sampler)
  [65] Node::unref()          [12] DBern::logLikelihood(long, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [147] void std::make_heap<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler)
  [83] Node::unlink()        [250] DBern::checkParameterDim(SArray const&, std::vector<SArray const*, std::allocator<SArray const*> > const&) const [119] void std::sort_heap<__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler>(__gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, __gnu_cxx::__normal_iterator<Sampler**, std::vector<Sampler*, std::allocator<Sampler*> > >, less_sampler)
 [329] Node::setName(std::basic_string<char, std::char_traits<char>, std::allocator<char> > const&) [106] DNorm::d(double, std::vector<SArray const*, std::allocator<SArray const*> > const&, bool) const [305] yywrap
 [105] Node::addParent(Node*) [70] DUnif::d(double, std::vector<SArray const*, std::allocator<SArray const*> > const&, bool) const [304] zzwrap
 [111] Node::Node(Index const&) [433] Graph::size() const [102] <cycle 1>
  [76] Node::~Node()         [362] Graph::nodes() const   [44] <cycle 2>
 [528] Sqrt::Sqrt()           [42] Graph::contains(Node*) const
 [529] Sqrt::~Sqrt()         [176] Graph::getNodes(std::vector<Node*, std::allocator<Node*> >&) const