cleaner solution

when coming back to C++ after coding quite a bit haskell and python I felt a need for a map function.

my first go at it ended in this:

template <typename O, typename I, typename func_p>
std::list<O> & map(func_p func, const std::list<I> & in, std::list<O> & out) {
    for(typename std::list<I>::const_iterator it = in.begin(); it != in.end(); ++it) {
        out.push_back(func(*it));
    }
    return out;
}

it's not really as good as I want it to be (forced std::list etc) but the only thing google found was weird implementation with some weird recursive-template lists. anyone got a better one?

also, lul wut textboard

>>1
http://en.wikipedia.org/wiki/Map_%28higher-order_function%29
In C++'s Standard Template Library, the map function is called transform.
http://www.cplusplus.com/reference/algorithm/transform.html
http://msdn.microsoft.com/en-us/library/391xya49.aspx

No exSEPPLESions.

sage

Well, there's std::transform, which is more general.

>>5
see
>>3

oh, guess im no googleninja after all. thanks anon.

10 Name: Anonymous 2011-02-03 0:24

11 Name: Anonymous 2011-02-18 13:50

<-- check 'em dubz

---

Don't change these.

Name:		Email:
Entire Thread Thread List

All trademarks and copyrights on this site are owned by their respective parties. All comments and posts are the responsibility of their own posters.
- Tinychan + 2ch Mode -