csullivan

csullivan

csullivan

csullivan

#include <iostream>
#include <vector>
#include <memory>
#include <cereal/archives/binary.hpp>
#include <cereal/types/vector.hpp>
#include <cereal/types/string.hpp>
#include <cereal/types/base_class.hpp>
#include <cereal/types/memory.hpp>
#include <cereal/access.hpp>

csullivan

#include <iostream>

class Base {
 public:
  Base() { ; }
  ~Base() { ; }
  
};

template <typename Derived>

csullivan

template<typename KeyType, typename ValueType>
class range_map {
public:
  range_map() { ; }
  range_map(std::initializer_list<std::pair<KeyType,ValueType>> list) {
    for (auto& pair : list) {
      keys.push_back(pair.first);
      values.push_back(pair.second);
    }
  }

csullivan

#include <iostream>
#include <string>
#include <vector>
#include <set>

class Base {  
};

template <typename T>

csullivan

template<typename ...Args>                                                                                                                                                                                                              
void hist(bool conditional, TRuntimeObjects& obj, Args&&... args) {                                                                                                                                                                     
  if (conditional) { obj.FillHistogram(std::forward<Args>(args)...); }                                                                                                                                                                  
} 

csullivan

S - Set of all nodes with no inbound connections (NodeType::Input)

-- Enumerating all paths
paths = {}

for each node n in S do
    visit(n,{}) 
    
function visit(node n, list l)
    if n is not in l then

csullivan

// Function template constraint (implicit or "ad-hoc")

template<typename T> requires 
requires (T a) {  a + a;  } &&
requires (T b) {  b * b;  } &&
requires (T c) { sqrt(c); }
T Magnitude(vector<T>&& vec) {
  T sum;
  for (auto& const i : vec) { sum += i*i; }
  return sqrt(sum);