[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2024-08-06 UTC."],[[["\u003cp\u003eThe \u003ccode\u003eutil\u003c/code\u003e namespace in C++ provides a collection of utility classes for optimization and SAT (satisfiability) problems.\u003c/p\u003e\n"],["\u003cp\u003eThese classes offer functionalities such as knapsack solving, moving averages, subset sum calculations, model randomization, time limiting, and percentile computation.\u003c/p\u003e\n"],["\u003cp\u003eEach class within the \u003ccode\u003eutil\u003c/code\u003e namespace is designed to address a specific aspect of optimization or SAT problem-solving.\u003c/p\u003e\n"],["\u003cp\u003eDevelopers can leverage these utilities to enhance the efficiency and effectiveness of their optimization algorithms.\u003c/p\u003e\n"]]],["The provided C++ `util` reference documents seven classes. These classes provide functionalities for optimization and statistical analysis. Key actions include solving knapsack problems with `BasicKnapsackSolver`, calculating moving averages via `ExponentialMovingAverage`, computing averages incrementally with `IncrementalAverage`, and determining maximum subset sums using `MaxBoundedSubsetSum`. Other functionalities include randomly generating models (`ModelRandomGenerator`), managing shared time limits (`ModelSharedTimeLimit`), and calculating percentiles (`Percentile`).\n"],null,[]]
