const std::vector<coord_def> &get_excludes() const
    {
        return excludes;
    }

static bool is_excluded(int x, int y)

static bool is_excluded(int x, int y, const std::vector<coord_def> &exc)

    for (int i = 0, count = curr_excludes.size(); i < count; ++i)

    for (int i = 0, count = exc.size(); i < count; ++i)

        const coord_def &c = curr_excludes[i];

        const coord_def &c = exc[i];

}
inline static bool is_excluded(const coord_def &c, 
                               const std::vector<coord_def> &exc)
{
    return is_excluded(c.x, c.y, exc);
}
inline static bool is_excluded(int x, int y)
{
    return is_excluded(x, y, curr_excludes);

    }
}
void update_excludes()
{
    // Sanity checks
    if (you.level_type == LEVEL_LABYRINTH || you.level_type == LEVEL_ABYSS)
        return;
    for (int i = curr_excludes.size() - 1; i >= 0; --i)
    {
        int x = curr_excludes[i].x,
            y = curr_excludes[i].y;
        if (!env.map[x - 1][y - 1])
            curr_excludes.erase( curr_excludes.begin() + i );

                                // This is actually the current position on cur,
                                // not necessarily a stair.

                                    coord_def &best_stair)

                                    coord_def &best_stair,
                                    const bool target_has_excludes )

    LevelInfo &li = travel_cache.get_level_info(cur);

        // Are we in an exclude? If so, bail out.
        if (is_excluded( stair, li.get_excludes() ))
            return (-1);

    LevelInfo &li = travel_cache.get_level_info(cur);

            if (target.pos.x == -1 && dest.id == target.id)

            //
            // We can also not use incomplete stair information if there are
            // excludes on the target level.
            if (target.pos.x == -1 && dest.id == target.id
                    && !target_has_excludes)

                    best_level_distance, best_stair);

                    best_level_distance, best_stair,
                    target_has_excludes);

    const LevelInfo &target_level = travel_cache.get_level_info( target.id );

                           best_level_distance, best_stair);

                           best_level_distance, best_stair,
                           !target_level.get_excludes().empty());

        if (current_dist == -1 || best_level_distance < current_dist)

        if (newlev.id != target.id 
                && (current_dist == -1 || best_level_distance < current_dist))

    // We need to update all stair information and distances on this level.
    update_excludes();

    else
        update_excludes();