Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Extended API with functions for vector similarity based on KD-trees h… #2552

Closed
wants to merge 5 commits into from

Conversation

lucaderi
Copy link
Member

@lucaderi lucaderi commented Sep 8, 2024

Extended API with functions for vector similarity based on KD-trees https://en.wikipedia.org/wiki/K-d_tree

  • ndpi_kd_tree* ndpi_kd_create(u_int num_dimensions);
  • void ndpi_kd_free(ndpi_kd_tree *tree);
  • void ndpi_kd_clear(ndpi_kd_tree *tree);
  • bool ndpi_kd_insert(ndpi_kd_tree *tree, const double *data_vector, void *user_data);
  • ndpi_kd_tree_result *ndpi_kd_nearest(ndpi_kd_tree *tree, const double *data_vector);
  • u_int32_t ndpi_kd_num_results(ndpi_kd_tree_result *res);
  • bool ndpi_kd_result_end(ndpi_kd_tree_result *res);
  • double* ndpi_kd_result_get_item(ndpi_kd_tree_result *res, double **user_data);
  • bool ndpi_kd_result_next(ndpi_kd_tree_result *res);
  • void ndpi_kd_result_free(ndpi_kd_tree_result *res);
  • double ndpi_kd_distance(double *a1, double *b2, u_int num_dimensions);

Please sign (check) the below before submitting the Pull Request:

Link to the related issue:

…ttps://en.wikipedia.org/wiki/K-d_tree

ndpi_kd_tree* ndpi_kd_create(u_int num_dimensions);
void ndpi_kd_free(ndpi_kd_tree *tree);
void ndpi_kd_clear(ndpi_kd_tree *tree);
bool ndpi_kd_insert(ndpi_kd_tree *tree, const double *data_vector, void *user_data);
ndpi_kd_tree_result *ndpi_kd_nearest(ndpi_kd_tree *tree, const double *data_vector);
u_int32_t ndpi_kd_num_results(ndpi_kd_tree_result *res);
bool ndpi_kd_result_end(ndpi_kd_tree_result *res);
double* ndpi_kd_result_get_item(ndpi_kd_tree_result *res, double **user_data);
bool ndpi_kd_result_next(ndpi_kd_tree_result *res);
void ndpi_kd_result_free(ndpi_kd_tree_result *res);
double ndpi_kd_distance(double *a1, double *b2, u_int num_dimensions);
@lucaderi lucaderi closed this Sep 9, 2024
Copy link

sonarcloud bot commented Sep 9, 2024

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant