|
|
|---|
|
|
|
|---|
Get an element of the nonempty set.
(head set) → *
For empty trees, returns
From a user perspective, this should likely be viewed as an arbitrary element of the set, to be used only in conjunction with left and right to fold over the set. Under the hood, this is the root element of the underlying tree, which will be the unique maximum value with respect to heap<.
Function:
(defun head$inline (set) (declare (xargs :guard (setp set))) (tree-head (sfix set)))