| I just thought that a method for tagging - for documentation and other purposes - might be useful. For example: (def queue ()
" Creates a queue. "
(t related enq deq qlen qlist enq-limit)
(list nil nil 0))
In the above case, (t related ...) serves a documentation purpose, specifically to document that (queue) is related to (enq ...) etc.Or for another case: (def median (ns)
" Computes the median of an unsorted list. "
(t type ns ('num))
((sort > ns) (truncate (/ (len ns) 2))))
The above would then effectively be similar to a (declaim ...) that ns is a list of 'num, useful for, say, optimizations.In any case, the only minimum requirement would be that (t ...) would validly return a "useless" value without any side-effects and cannot be redefined. Thoughts? |
