diff/isec: reset hash/tree iter instead making new.

* lib.c (seq_iter_rewind): Use hash_reset and tree_reset
to rewind the existing iterator rather than allocating a new
one.

* tests/010/hash.tl: New file, covering uni, diff and isec for
hash tables.

* tests/010/tree.tl: New tests.

1 files changed, 2 insertions, 2 deletions

diff --git a/lib.c b/lib.c
index 6145c4f3..5419494e 100644
--- a/lib.c
+++ b/lib.c
@@ -740,10 +740,10 @@ static void seq_iter_rewind(seq_iter_t *it, val self)
       it->ui.index = 0;
       break;
     case SEQ_HASHLIKE:
-      it->ui.iter = hash_begin(it->inf.obj);
+      it->ui.iter = hash_reset(it->ui.iter, it->inf.obj);
       break;
     case SEQ_TREELIKE:
-      it->ui.iter = tree_begin(it->inf.obj);
+      it->ui.iter = tree_reset(it->ui.iter, it->inf.obj);
       break;
     default:
       break;