data tree BUGFIX change how hash matching is performed
Hash matching now works strictly based on
hashes meaning that leaves/any nodes values are not
compared by the val_equal hash table callback.
Fixes #1148
diff --git a/src/tree_data.h b/src/tree_data.h
index 7f40cc7..9991eec 100644
--- a/src/tree_data.h
+++ b/src/tree_data.h
@@ -1168,7 +1168,7 @@
size_t name_len, const char *key_or_value, size_t val_len, struct lyd_node **match);
/**
- * @brief Search in the given siblings (NOT recursively) for the first target instance.
+ * @brief Search in the given siblings (NOT recursively) for the first target instance with the same value.
* Uses hashes - should be used whenever possible for best performance.
*
* @param[in] siblings Siblings to search in including preceding and succeeding nodes.
@@ -1181,7 +1181,7 @@
LY_ERR lyd_find_sibling_first(const struct lyd_node *siblings, const struct lyd_node *target, struct lyd_node **match);
/**
- * @brief Search in the given siblings for all target instances.
+ * @brief Search in the given siblings for all target instances with the same value.
* Uses hashes - should be used whenever possible for best performance.
*
* @param[in] siblings Siblings to search in including preceding and succeeding nodes.