30 .structure_type(StructureType::Field)
31 .propagate_references();
38 mask.foreach_index_optimized<
int>(
60 positions_field_(std::move(positions_field)),
61 group_field_(std::move(group_field)),
62 selection_field_(std::move(selection_field)),
70 if (!context.attributes()) {
74 const int domain_size = context.attributes()->domain_size(context.domain());
76 evaluator.
add(positions_field_);
77 evaluator.
add(group_field_);
100 if (!group_ids.is_single()) {
105 if (groups_num == 1) {
118 point_groups, groups_num, group_offset_data, indices_by_group_data, mask_to_cluster);
126 for (
const int group_i : range) {
127 const Span<int> group = indices_by_group[group_i];
135 for (
const int i : group) {
143 [&](
const IndexRange range) {
return group_offsets[range].
size(); }));
154 fn(positions_field_);
156 fn(selection_field_);
161 static constexpr int8_t id = 0;
163 hash.add(deep_hash_cache.
ensure(positions_field_));
164 hash.add(deep_hash_cache.
ensure(group_field_));
165 hash.add(deep_hash_cache.
ensure(selection_field_));
190 ntype.
ui_name =
"Cluster by Distance";
191 ntype.
ui_description =
"Group elements into integer IDs based on proximity of vector values";
#define NODE_CLASS_CONVERTER
#define NOD_REGISTER_NODE(REGISTER_FUNC)
MutableSpan< T > as_mutable_span()
void reinitialize(const int64_t new_size)
static IndexMask from_difference(const IndexMask &mask_a, const IndexMask &mask_b, LinearAllocator<> &memory)
static IndexMask from_intersection(const IndexMask &mask_a, const IndexMask &mask_b, LinearAllocator<> &memory)
constexpr IndexRange()=default
void provide_buffer(void *buffer, const int64_t size)
static VArray from_container(ContainerT container)
void set_selection(Field< bool > selection)
int add(GField field, GVArray *varray_ptr)
IndexMask get_evaluated_selection_as_mask() const
const GVArray & get_evaluated(const int field_index) const
static Field from_input(Args &&...args)
T extract_input(const UString identifier)
void set_output(const UString identifier, T &&value)
StructureType structure_type
float distance(float, float) RET
void fill_index_range(MutableSpan< T > span, const T start=0)
int group_ids_to_indices(Span< int > ids, const IndexMask &mask, MutableSpan< int > r_group_indices, Vector< int > *r_first_indices=nullptr)
std::optional< AttrDomain > try_detect_field_domain(const GeometryComponent &component, const fn::GField &field)
void node_register_type(bNodeType &ntype)
constexpr ParallelGrainSize grain_size(int grain_size)
void masked_fill(MutableSpan< T > data, const T &value, const IndexMask &mask)
int calc_duplicates(const KDTreeNew< T > &tree, typename T::base_type range, Span< int > visit_order, MutableSpan< int > duplicates)
static void node_declare(NodeDeclarationBuilder &b)
static void node_geo_exec(GeoNodeExecParams params)
static void set_no_cluster_value(MutableSpan< int > r_cluster_ids, const IndexMask &mask)
static void node_register()
constexpr int NO_CLUSTER_VALUE
GroupedSpan< int > build_groups_from_indices(Span< int > indices, int groups_num, Array< int > &offset_data, Array< int > &index_data)
void parallel_for(const IndexRange range, const int64_t grain_size, const Function &function, const TaskSizeHints &size_hints=detail::TaskSizeHints_Static(1))
auto accumulated_task_sizes(Fn &&fn)
BLI_assert(slot->slot_subtype.map==BMO_OP_SLOT_SUBTYPE_MAP_FLT)
@ NODE_DEFAULT_INPUT_POSITION_FIELD
VecBase< float, 3 > float3
void geo_node_type_base(bke::bNodeType *ntype, UString idname, const std::optional< int16_t > legacy_type)
std::string ui_description
NodeGeometryExecFunction geometry_node_execute
NodeDeclareFunction declare
UniqueHash ensure(const GFieldRef &field)
OffsetIndices< int > offsets