32 const int *end = std::copy_if(verts.
begin(), verts.
end(), indices.
begin(), [&](
const int vert) {
33 return !hide_vert[vert];
47 node.all_verts().size() -
node.verts().size());
52 const int *end = std::copy_if(verts.
begin(), verts.
end(), indices.
begin(), [&](
const int vert) {
53 return !hide_vert[vert];
62 int &visible_unique_verts_num)
68 const int unique_verts_num =
node.verts().size();
70 visible_unique_verts_num = unique_verts_num;
76 const int vert = verts[i];
77 if (!hide_vert[vert]) {
78 indices[write_i++] = vert;
79 if (i < unique_verts_num) {
80 visible_unique_verts_num++;
96 for (
const int face : vert_to_face_map[vert]) {
97 if (hide_poly[face]) {
109 return hide_poly[face_index];
A BVH for high poly meshes.
#define BM_DISK_EDGE_NEXT(e, v)
#define BM_elem_flag_test(ele, hflag)
constexpr int64_t size() const
constexpr const T * end() const
constexpr IndexRange index_range() const
constexpr const T * begin() const
constexpr bool is_empty() const
void resize(const int64_t new_size)
Span< int > node_visible_all_verts(const bke::pbvh::MeshNode &node, const Span< bool > hide_vert, Vector< int > &indices, int &visible_unique_verts_num)
Span< int > node_visible_shared_verts(const bke::pbvh::MeshNode &node, const Span< bool > hide_vert, Vector< int > &indices)
Span< int > node_visible_verts(const bke::pbvh::MeshNode &node, const Span< bool > hide_vert, Vector< int, bke::pbvh::MESH_LEAF_LIMIT > &indices)
bool vert_all_faces_visible_get(const Span< bool > hide_poly, const GroupedSpan< int > vert_to_face_map, const int vert)
int BKE_subdiv_ccg_grid_to_face_index(const SubdivCCG &subdiv_ccg, const int grid_index)
bool BKE_pbvh_node_fully_hidden_get(const bke::pbvh::Node &node)
struct BMLoop * radial_next