How do I specify a pointer to an overloaded function?

by

You can use static_cast<>() to specify which f to use according to the function signature implied by the function pointer type:

// Uses the void f(char c); overload
std::for_each(s.begin(), s.end(), static_cast<void (*)(char)>(&f));
// Uses the void f(int i); overload
std::for_each(s.begin(), s.end(), static_cast<void (*)(int)>(&f));

Or, you can also do this:

// The compiler will figure out which f to use according to
// the function pointer declaration.
void (*fpc)(char) = &f;
std::for_each(s.begin(), s.end(), fpc); // Uses the void f(char c); overload
void (*fpi)(int) = &f;
std::for_each(s.begin(), s.end(), fpi); // Uses the void f(int i); overload

If f is a member function, then you need to use mem_fun, or for your case, use the solution presented in this Dr. Dobb’s article.

More Related Contents:

  1. What’s the difference between “STL” and “C++ Standard Library”?
  2. Why is it wrong to use std::auto_ptr with standard containers?
  3. std::endl is of unknown type when overloading operator
  4. Writing your own STL Container
  5. Why does the C++ STL not provide any “tree” containers?
  6. Using local classes with STL algorithms
  7. Why doesn’t std::queue::pop return value.?
  8. what happens when you modify an element of an std::set?
  9. What’s faster, iterating an STL vector with vector::iterator or with at()?
  10. How to remove all the occurrences of a char in c++ string
  11. Copy map values to vector in STL [duplicate]
  12. std::map, pointer to map key value, is this possible?
  13. Cleaning up an STL list/vector of pointers
  14. What is the past-the-end iterator in STL C++?
  15. Efficiency of the STL priority_queue
  16. Capturing a time in milliseconds
  17. Performance of qsort vs std::sort?
  18. How does C++ STL unordered_map resolve collisions?
  19. How do I erase elements from STL containers?
  20. What happens when you call data() on a std::vector?
  21. Are const_iterators faster?
  22. STL analogue in Fortran
  23. Why the libc++ std::vector internally keeps three pointers instead of one pointer and two sizes?
  24. Visual c++ “for each” portability
  25. Is stl vector concurrent read thread-safe?
  26. Why can’t I replace std::map with std::unordered_map
  27. what does `using std::swap` inside the body of a class method implementation mean?
  28. error for hash function of pair of ints
  29. STL algorithms: Why no additional interface for containers (additional to iterator pairs)?
  30. Why does (i|o)fstream take a const char* parameter for a file name?

Leave a Comment