// fig06_07.cpp // Die-rolling program using an array instead of switch. //#include // C++20: This will be #include #include #include #include template void accumulate(std::array& histogram, double val, double lower, double upper){ double del {(upper-lower)/N}; for (int i{0}; i < N; i++){ if ( val > i*del && val < (i+1) * del ) histogram[i]++; } return; } int main() { // set up random-number generation std::random_device rd; // used to seed the default_random_engine std::default_random_engine engine{rd()}; // rd() produces a seed double upper_bound = 1; double lower_bound = 0; std::uniform_real_distribution randomReal{lower_bound, upper_bound}; constexpr size_t N{4}; double del {(upper_bound-lower_bound)/N}; std::array histogram{}; // roll die 60,000 times; use die value as frequency index for (int roll{1}; roll <= 6000; ++roll) { double val{ randomReal(engine)}; accumulate(histogram, val, lower_bound, upper_bound); } std::cout << " Histogram : \n"; // output each array element's value for (size_t face{1}; face < histogram.size(); ++face) { std::cout <<"Number of samples between " << lower_bound+face*del << " and " << lower_bound+(face+1)*del << " is " << histogram.at(face) << "\n"; } } /************************************************************************** * (C) Copyright 1992-2022 by Deitel & Associates, Inc. and * * Pearson Education, Inc. All Rights Reserved. * * * * DISCLAIMER: The authors and publisher of this book have used their * * best efforts in preparing the book. These efforts include the * * development, research, and testing of the theories and programs * * to determine their effectiveness. The authors and publisher make * * no warranty of any kind, expressed or implied, with regard to these * * programs or to the documentation contained in these books. The authors * * and publisher shall not be liable in any event for incidental or * * consequential damages in connection with, or arising out of, the * * furnishing, performance, or use of these programs. * **************************************************************************/