func (t *Tree[T]) Len(isV6 bool) int {
	count := 0
	t.DepthFirstWalk(isV6, func(k netip.Prefix, v T) bool {
		count++
		return false
	})
	return count
}

// WalkFn is used when walking the tree. Takes a
// key and value, returning if iteration should
// be terminated.
type WalkFn[T any] func(s netip.Prefix, v T) bool

// DepthFirstWalk is used to walk the tree of the corresponding IP family

				cidrsSet.Insert(cidr)
				cidrReady[cidr] = ready
			}
		}
	}

	// obtain the existing allocators and set the existing state
	treeSet := sets.New[string]()
	c.muTree.Lock()
	c.tree.DepthFirstWalk(c.ipFamily == api.IPv6Protocol, func(k netip.Prefix, v *Allocator) bool {
		v.ready.Store(cidrReady[k.String()])
		treeSet.Insert(k.String())
		return false
	})
	c.muTree.Unlock()