From 03e37ec6d720bb5d416e98d6f6d9663086939e4d Mon Sep 17 00:00:00 2001
From: Thomas Helland <thomashelland90@gmail.com>
Date: Wed, 15 Apr 2015 23:08:19 +0200
Subject: [PATCH] util: Use set_foreach instead of rolling our own

This follows the same pattern as in the hash_table.

Reviewed-by: Jason Ekstrand <jason.ekstrand at intel.com>
---
 src/util/set.c | 8 ++------
 1 file changed, 2 insertions(+), 6 deletions(-)

diff --git a/src/util/set.c b/src/util/set.c
index 39250663954..d71f771807f 100644
--- a/src/util/set.c
+++ b/src/util/set.c
@@ -230,12 +230,8 @@ set_rehash(struct set *ht, unsigned new_size_index)
    ht->entries = 0;
    ht->deleted_entries = 0;
 
-   for (entry = old_ht.table;
-        entry != old_ht.table + old_ht.size;
-        entry++) {
-      if (entry_is_present(entry)) {
-         set_add(ht, entry->hash, entry->key);
-      }
+   set_foreach(&old_ht, entry) {
+      set_add(ht, entry->hash, entry->key);
    }
 
    ralloc_free(old_ht.table);
-- 
2.30.2