dataset.hpp 5.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148
  1. /**
  2. * @file
  3. * @author Caleb Fangmeier <caleb@fangmeier.tech>
  4. * @version 0.1
  5. *
  6. * @section LICENSE
  7. *
  8. *
  9. * MIT License
  10. *
  11. * Copyright (c) 2017 Caleb Fangmeier
  12. *
  13. * Permission is hereby granted, free of charge, to any person obtaining a copy
  14. * of this software and associated documentation files (the "Software"), to deal
  15. * in the Software without restriction, including without limitation the rights
  16. * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  17. * copies of the Software, and to permit persons to whom the Software is
  18. * furnished to do so, subject to the following conditions:
  19. *
  20. * The above copyright notice and this permission notice shall be included in all
  21. * copies or substantial portions of the Software.
  22. *
  23. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  24. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  25. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  26. * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  27. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  28. * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  29. * SOFTWARE.
  30. */
  31. #ifndef dataset_hpp
  32. #define dataset_hpp
  33. #include <iostream>
  34. #include "value.hpp"
  35. #include "container.hpp"
  36. #include "log.hpp"
  37. namespace fv{
  38. typedef std::map<std::string, GenContainer*> ContainerSet;
  39. /*
  40. * A DataSet is a generic source of data that is used to populate
  41. * ObservedValues. For each ObservedValue, it is recommened that the DataSet
  42. * have a field whose value is updated when the load_next() method is called. A
  43. * pointer to this value is then passed during the creation of the
  44. * ObservedValue. It is important, therefore, that the location in memory of
  45. * the data not change from event to event.
  46. */
  47. class DataSet{
  48. private:
  49. void summary(){
  50. INFO(GenValue::summary());
  51. INFO(GenFunction::summary());
  52. }
  53. Value<int>* current_event_number;
  54. protected:
  55. ContainerSet containers;
  56. virtual bool load_next() = 0;
  57. virtual int get_events() = 0;
  58. virtual int get_current_event() = 0;
  59. std::map<std::string,std::string> get_container_name_value_map(){
  60. std::map<std::string, std::string> value_map;
  61. for(auto container : containers)
  62. value_map[container.first] = container.second->get_value_name();
  63. return value_map;
  64. }
  65. std::map<std::string,std::string> get_function_name_impl_map(){
  66. std::map<std::string, std::string> impl_map;
  67. for(auto fn : GenFunction::function_registry)
  68. if (fn.second != nullptr){
  69. impl_map[fn.first] = GenFunction::format_code(fn.second->get_impl());
  70. }
  71. return impl_map;
  72. }
  73. public:
  74. DataSet(){
  75. auto& event_check = GenFunction::reg_func<int()>("event_number",
  76. FUNC(([ds=this](){
  77. return ds->get_current_event();
  78. })));
  79. current_event_number = new BoundValue<int>(event_check);
  80. }
  81. void process(bool silent=false){
  82. int events, current_event;
  83. summary();
  84. events = get_events();
  85. if (!silent) std::cout << std::endl;
  86. while( load_next() ){
  87. current_event = get_current_event();
  88. if (!silent) std::cout << "\rprocessing event: " << current_event+1 << "/" << events << std::flush;
  89. GenValue::reset();
  90. for(auto con : containers){
  91. con.second->fill();
  92. }
  93. }
  94. if (!silent) std::cout << " Finished!" << std::endl;
  95. }
  96. virtual void save_all(){
  97. for(auto container : containers)
  98. container.second->save();
  99. }
  100. template<typename C, typename... ArgTypes>
  101. C* register_container(ArgTypes... args){
  102. C* container = new C(args...);
  103. if (containers[container->get_name()] != nullptr){
  104. CRITICAL("Container with name \""+container->get_name()+"\" already exists.", -1);
  105. }
  106. containers[container->get_name()] = container;
  107. return container;
  108. }
  109. void cut_set(GenContainer* base_container, std::vector<std::pair<Value<bool>*, std::string>> filters){
  110. for(auto p : filters){
  111. Value<bool>* filter;
  112. std::string new_name;
  113. std::tie(filter, new_name) = p;
  114. if (containers[new_name] != nullptr){
  115. CRITICAL("Container with name \""<<new_name<<"\" already exists.", -1);
  116. }
  117. auto new_container = base_container->clone_as(new_name);
  118. new_container->add_filter(filter);
  119. containers[new_container->get_name()] = new_container;
  120. }
  121. }
  122. GenContainer* get_container(std::string container_name){
  123. GenContainer* c = containers[container_name];
  124. if (c == nullptr){
  125. CRITICAL("Request for container \"" << container_name << "\" failed. Doesn't exist.", -1);
  126. }
  127. return c;
  128. }
  129. Value<int>* get_current_event_number(){
  130. return current_event_number;
  131. }
  132. };
  133. }
  134. #endif // dataset_hpp