Subject: [boost] [preprocessor] Computational complexity analysis
From: Lorenzo Caminiti (lorcaminiti_at_[hidden])
Date: 2010-03-20 13:43:17
Is there a computational complexity analysis of Boost.Preprocessor
data structures? This would be in terms of preprocessing time.
For example: Does BOOST_PP_SEQ_ELEM() run* in O(n)? Do
BOOST_PP_TUPLE_ELEM() and BOOST_PP_ARRAY_ELEM() run* in O(1)?
(*) "Run" within the preprocessor so maybe "expand" is a better term...
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk