25 .structure_type(StructureType::Field)
26 .propagate_references()
29 .structure_type(StructureType::Field)
30 .propagate_references();
46 [&](
const int index) {
58 for (const int index : indices.slice(range)) {
59 r_indices[index] = find_nearest_non_self(tree, positions[index], index);
72 positions_field_(std::move(positions_field)),
73 group_field_(std::move(group_field))
80 if (!context.attributes()) {
83 const int domain_size = context.attributes()->domain_size(context.domain());
85 evaluator.
add(positions_field_);
86 evaluator.
add(group_field_);
97 const bool query_all =
mask.size() == domain_size;
99 if (group_ids.is_single()) {
114 group_ids_span,
IndexMask(domain_size), group_indices);
119 group_indices, groups_num, tree_offset_data, tree_index_data);
126 result.reinitialize(domain_size);
132 lookup_group_indices, groups_num, lookup_offset_data, lookup_index_data,
mask);
137 const int avg_tree_size = domain_size / groups_num;
138 const int grain_size = std::max(8192 / avg_tree_size, 1);
141 for (
const int group_index : range) {
144 const KDTreeNew<float3> tree(positions, tree_indices_by_group[group_index], tree_memory);
147 query_all ? tree.
tree_indices() : lookup_indices_by_group[group_index],
157 fn(positions_field_);
163 static constexpr int8_t id = 0;
165 hash.add(deep_hash_cache.
ensure(positions_field_));
166 hash.add(deep_hash_cache.
ensure(group_field_));
182 group_field_(std::move(group_field))
189 if (!context.attributes()) {
192 const int domain_size = context.attributes()->domain_size(context.domain());
193 if (domain_size == 1) {
198 evaluator.
add(group_field_);
208 mask.foreach_index([&](
const int i) {
210 group_span[i], [](
int *count) { *count = 1; }, [](
int *count) { (*count)++; });
213 mask.foreach_index([&](
const int i) {
result[i] = counts.
lookup(group_span[i]) > 1; });
224 static constexpr int8_t id = 0;
226 hash.add(deep_hash_cache.ensure(group_field_));
257 ntype.
ui_name =
"Index of Nearest";
259 "Find the nearest element in a group. Similar to the \"Sample Nearest\" node";
#define NODE_CLASS_CONVERTER
#define GEO_NODE_INDEX_OF_NEAREST
#define NOD_REGISTER_NODE(REGISTER_FUNC)
Span< T > as_span() const
MutableSpan< T > as_mutable_span()
Span< int > tree_indices() const
int find_nearest_filtered(const T &position, Filter &&filter, value_type *r_distance_sq=nullptr) const
void provide_buffer(void *buffer, const int64_t size)
const Value & lookup(const Key &key) const
auto add_or_modify(const Key &key, const CreateValueF &create_value, const ModifyValueF &modify_value) -> decltype(create_value(nullptr))
constexpr IndexRange index_range() const
static VArray from_single(T value, const int64_t size)
static VArray from_container(ContainerT container)
int add(GField field, GVArray *varray_ptr)
const GVArray & get_evaluated(const int field_index) const
static Field from_input(Args &&...args)
T extract_input(const UString identifier)
bool output_is_required(const UString identifier) const
void set_output(const UString identifier, T &&value)
StructureType structure_type
void gather(const GVArray &src, const IndexMask &indices, GMutableSpan dst, exec_mode::Mode mode=exec_mode::parallel)
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)
static void node_geo_exec(GeoNodeExecParams params)
static void node_declare(NodeDeclarationBuilder &b)
static void node_register()
static int find_nearest_non_self(const KDTreeNew< float3 > &tree, const float3 &position, const int index)
static void find_neighbors(const KDTreeNew< float3 > &tree, const Span< float3 > positions, const IndexMask &mask, MutableSpan< int > r_indices)
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))
@ 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
const char * enum_name_legacy
NodeDeclareFunction declare
UniqueHash ensure(const GFieldRef &field)