func (da *Cedar) Status() (keys, nodes, size, capacity int) {
	for i := 0; i < da.Size; i++ {
		n := da.Array[i]
		if n.Check >= 0 {
			nodes++
			if n.Value >= 0 {
				keys++
			}
		}
	}
	return keys, nodes, da.Size, da.Capacity
}
func (da *Cedar) Status() (keys, nodes, size, capacity int) {
	for i := 0; i < da.Size; i++ {
		n := da.Array[i]
		if n.Check >= 0 {
			nodes++
			if n.Value >= 0 {
				keys++
			}
		}
	}
	return keys, nodes, da.Size, da.Capacity
}
func ( da * Cedar ) Status ( ) ( keys , nodes , size , capacity int ) { for i := 0 ; i < da . Size ; i ++ { n := da . Array [ i ] if n . Check >= 0 { nodes ++ if n . Value >= 0 { keys ++ } } } return keys , nodes , da . Size , da . Capacity }
// Status reports the following statistics of the cedar:
//	keys:		number of keys that are in the cedar,
//	nodes:		number of trie nodes (slots in the base array) has been taken,
//	size:			the size of the base array used by the cedar,
//	capacity:		the capicity of the base array used by the cedar.
Status reports the following statistics of the cedar : keys : number of keys that are in the cedar nodes : number of trie nodes ( slots in the base array ) has been taken size : the size of the base array used by the cedar capacity : the capicity of the base array used by the cedar .