Effective C++ 38. Model "has-a or is-implemented-in-terms-of" through composition

set implementations typically incur an overhead of three pointers per element. When speed is more important than space, this is a reasonable design.

templat<class T>
class Set{
public:
    bool member(const T& item) const;
    void insert(const T& item);
    void remove(const T& item);
    std::size_t size() const;
private:
    std::list<T> rep;
};

template<typename T> 
bool Set<T>::member(cosnt T& item) const {
    return std::find(rep.begin(), rep.end(), item) != rep.end());
}

template<typename T>
void Set<T>::insert(const T& item) {
    if (!memer(item)) rep.push_back(item);
}

template<typename T>
void Set<T>::remove(const T& item) {
    typename std::list<T>::iterator it = std::find(rep.begin(), rep.end(), item);
    if (it != rep.end()) rep.erase(it);
}

template<typename T>
std::size_t Set<T>::size() const {
    return rep.size();
}