diff options
author | Chris Davis <cd.rattan@gmail.com> | 2014-07-31 23:24:19 -0700 |
---|---|---|
committer | Michael Adam <obnox@samba.org> | 2014-10-01 14:32:09 +0200 |
commit | bcab659516382d5dc51b1558a895a9a26d81c6b8 (patch) | |
tree | 3fd5eedf3128d2731e114913388a0419ca237a90 /source3/utils/regedit_treeview.h | |
parent | 09245177a4031fb1a1319071e745f0df10b1ee53 (diff) | |
download | samba-bcab659516382d5dc51b1558a895a9a26d81c6b8.tar.gz |
regedit: search values and repeat search from cursor positions
Recovering the search position from the cursors is safer than retaining
a pointer to the last node, as the pointer will become invalid if the
user deletes the item or refreshes the cache.
Signed-off-by: Chris Davis <cd.rattan@gmail.com>
Reviewed-by: Andreas Schneider <asn@samba.org>
Reviewed-by: Michael Adam <obnox@samba.org>
Diffstat (limited to 'source3/utils/regedit_treeview.h')
-rw-r--r-- | source3/utils/regedit_treeview.h | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/source3/utils/regedit_treeview.h b/source3/utils/regedit_treeview.h index 919507f9e22..ba0cd0a8ae0 100644 --- a/source3/utils/regedit_treeview.h +++ b/source3/utils/regedit_treeview.h @@ -60,6 +60,7 @@ void tree_node_append(struct tree_node *left, struct tree_node *right); struct tree_node *tree_node_pop(struct tree_node **plist); struct tree_node *tree_node_first(struct tree_node *list); struct tree_node *tree_node_last(struct tree_node *list); +bool tree_node_next(struct tree_node **node, bool depth, WERROR *err); void tree_node_append_last(struct tree_node *list, struct tree_node *node); size_t tree_node_print_path(WINDOW *label, struct tree_node *node); const char **tree_node_get_path(TALLOC_CTX *ctx, struct tree_node *node); |