Function have_same_coordinate

source/kernel.cpp:1146–1179

@brief: Given a list of sorted vertices which belong to a histogram bin, check that a particular component (x, y, or z) of their coordinates is not the same amongst two or more vertices */

    particular component (x, y, or z) of their coordinates is not the same amongst two or more vertices
    */
bool have_same_coordinate(
    const std::vector<std::pair<vd_t, vec3>>& bin_vertices_sorted,
    const int coordinate_index = 0 // 0 = x, 1 = y, 2 = z component
)
{
    // for each vertex, compare to all others in vector (compare by given component)
    bool is_duplicate = false;
    for (std::vector<std::pair<vd_t, vec3>>::const_iterator i = bin_vertices_sorted.begin(); i != bin_vertices_sorted.end(); ++i) {
        const vec3& vertex_i_coordinates = i->second;
        const double vertex_i_coordinate = vertex_i_coordinates[coordinate_index];
        bool vertex_i_coordinate_is_duplicate = false;

        for (std::vector<std::pair<vd_t, vec3>>::const_iterator j = bin_vertices_sorted.begin(); j != bin_vertices_sorted.end(); ++j) {
            if (j == i) {
                continue; // same vertex, skip
            }

            const vec3& vertex_j_coordinates = j->second;
            const double vertex_j_coordinate = vertex_j_coordinates[coordinate_index];
            vertex_i_coordinate_is_duplicate = (vertex_i_coordinate == vertex_j_coordinate);

            if (vertex_i_coordinate_is_duplicate) {
                is_duplicate = true;
                break;
            }
        }

        if (is_duplicate) {
            break;
        }
    }

    return is_duplicate;
}

// TODO: replace code parts that use "m0_ivtx_to_intersection_registry_entry" with calls to this
// function which is much cheaper