I liked using glazedlist javadocs because their documentation had a simple O(n) notation for concrete implementations of datastructures
(ex : http://publicobject.com/glazedlists/glazedlists-1.8.0/api/ca/odell/glazedlists/BasicEventList.html )
I wonder if it would be possible to generalize this sort of thing into the doc tool, and maybe to infer the minimum complexity of a new piece of code (composition)?
I don't know if it is feasible
I liked using glazedlist javadocs because their documentation had a simple O(n) notation for concrete implementations of datastructures
(ex : http://publicobject.com/glazedlists/glazedlists-1.8.0/api/ca/odell/glazedlists/BasicEventList.html )
I wonder if it would be possible to generalize this sort of thing into the doc tool, and maybe to infer the minimum complexity of a new piece of code (composition)?
I don't know if it is feasible