From 2a4edf973fe21ba370318f0c509ea261f3e7b28d Mon Sep 17 00:00:00 2001
From: =?utf8?q?Marc=20Andr=C3=A9=20Tanner?= <mat@brain-dump.org>
Date: Mon, 2 Nov 2020 14:30:52 +0100
Subject: [PATCH] map: remove no longer used map_leaf function

---
 map.c | 13 -------------
 map.h |  5 -----
 2 files changed, 18 deletions(-)

diff --git a/map.c b/map.c
index c69bd70..f6e5c64 100644
--- a/map.c
+++ b/map.c
@@ -78,19 +78,6 @@ bool map_contains(const Map *map, const char *prefix)
 	return !map_empty(map_prefix(map, prefix));
 }
 
-static bool leaf(const char *key, void *value, void *data)
-{
-	int *nodes = data;
-	return (*nodes)++ < 1;
-}
-
-bool map_leaf(const Map *map, const char *prefix)
-{
-	int nodes = 0;
-	map_iterate(map_prefix(map, prefix), leaf, &nodes);
-	return nodes == 1;
-}
-
 bool map_put(Map *map, const char *k, const void *value)
 {
 	size_t len = strlen(k);
diff --git a/map.h b/map.h
index bfda118..54dd22b 100644
--- a/map.h
+++ b/map.h
@@ -35,11 +35,6 @@ void *map_closest(const Map*, const char *prefix);
  */
 bool map_contains(const Map*, const char *prefix);
 /**
- * Check whether the given prefix can be extended to exactly one map element.
- * True iff the prefix map contains exactly one element.
- */
-bool map_leaf(const Map*, const char *prefix);
-/**
  * Store a key value pair in the map.
  * @return False if we run out of memory (``errno = ENOMEM``), or if the key
  *         already appears in the map (``errno = EEXIST``).
-- 
2.11.4.GIT