StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
text
Body
copied!<p>I don't see why you'd need the template method pattern.</p> <p>Why not just define those algorithms as functors that can be passed to your benchmarking function?</p> <pre><code>struct BinarySearch { // functor implementing a specific search algorithm template <typename iter_type> void operator()(iter_type first, iter_type last){ ....} }; template <typename data_type, typename search_type> void BenchmarkSearch(data_type& data, search_type search){ // general benchmarking/bookkeeping function // init timer search(data); // compute elapsed time } </code></pre> <p>and then call it like this:</p> <pre><code>int main(){ std::vector<int> vec; vec.push_back(43); vec.push_back(2); vec.push_back(8); vec.push_back(13); BenchmarkSearch(vec, BinarySearch()); BenchmarkSearch(vec, LinearSearch()); // assuming more search algorithms are defined BenchmarkSearch(vec, SomeOtherSearch(); } </code></pre> <p>Of course, another approach, which is a bit closer to what you initially wanted, could be to use <a href="http://en.wikipedia.org/wiki/Curiously_recurring_template_pattern" rel="nofollow noreferrer">CRTP</a> (A pretty clever pattern for emulating virtual functions at compile-time - and it works with static methods too):</p> <pre><code>template <typename T> struct SearchBase { // base class implementing general bookkeeping static void Search() { // do general bookkeeping, initialize timers, whatever you need T::Search(); // Call derived search function // Wrap up, do whatever bookkeeping is left } } struct LinearSearch : SearchBase<LinearSearch> // derived class implementing the specific search algorithms { static void Search(){ // Perform the actual search } }; </code></pre> <p>Then you can call the static functions:</p> <pre><code>SearchBase<LinearSearch>::Search(); SearchBase<BinarySearch>::Search(); SearchBase<SomeOtherSearch>::Search(); </code></pre> <p>As a final note, it might be worth mentioning that both of these approaches should carry zero overhead. Unlike anything involving virtual functions, the compiler is fully aware of which functions are called here, and can and will inline them, resulting in code that is just as efficient as if you'd hand-coded each case.</p>

Querying!

Guidance

An individual column

Larger individual text columns get their own page to allow for proper reading.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload