template <class citer> bool has_duplicates(citer, citer) const;
    

        bool operator == (const named_thing<Z> &other) const
        {
            return (name == other.name);
        }

}
// Expensive O(n2) duplicate search, but we can live with that.
template <class citer> bool explore_discoveries::has_duplicates(
    citer begin, citer end) const
{
    for (citer s = begin; s != end; ++s)
        for (citer z = s + 1; z != end; ++z)
            if (*s == *z)
                return (true);
    return (false);

    if (has_duplicates(coll.begin(), coll.end()))
    {
        mprf(stub, number_in_words(coll.size()).c_str());
        return;
    }

        mprf(stub, coll.size());

        mprf(stub, number_in_words(coll.size()).c_str());

    say_any(items, "Found %u items.");
    say_any(shops, "Found %u shops.");
    say_any(altars, "Found %u altars.");
    say_any(stairs, "Found %u stairs.");

    say_any(items, "Found %s items.");
    say_any(shops, "Found %s shops.");
    say_any(altars, "Found %s altars.");
    say_any(stairs, "Found %s stairs.");

/*
 *  File:       mapdef.cc
 *  Summary:    Support code for Crawl des files.
 *
 *  Modified for Crawl Reference by $Author: dshaligram $ on $Date: 2007-06-30T15:49:18.688054Z $
 */

#include <algorithm>

}
template <typename V>
void scramble(V &v)
{
    V temp(v);
    v.clear();
    while (!temp.empty())
    {
        int i = random2(temp.size());
        v.push_back(temp[i]);
        temp.erase(temp.begin() + i);
    }

    scramble(positions);

    std::random_shuffle(positions.begin(), positions.end(), random2);

    std::vector<std::string> shuffled;
    for (int i = 0, size = segs.size(); i < size; ++i)
    {
        const int sel = random2(segs.size());
        
        shuffled.push_back( segs[ sel ] );
        segs.erase( segs.begin() + sel );
    }
    return comma_separated_line(shuffled.begin(), shuffled.end(), "/", "/");

    std::random_shuffle(segs.begin(), segs.end(), random2);
    return comma_separated_line(segs.begin(), segs.end(), "/", "/");

        } 

        }

    case ')':
        mpr("Create which feature (by name)? ", MSGCH_PROMPT);
        get_input_line(specs, sizeof specs);
        if (*specs)
        {
            const dungeon_feature_type feat = dungeon_feature_by_name(specs);
            if (feat == DNGN_UNSEEN)
                canned_msg(MSG_OK);
            else
                grd(you.pos()) = feat;
        }
        break;