newCTFE a "funny" bug

H. S. Teoh hsteoh at quickfur.ath.cx
Wed Jan 30 17:53:27 UTC 2019


On Wed, Jan 30, 2019 at 10:35:40AM -0700, David Gileadi via Digitalmars-d wrote:
> On 1/30/19 10:00 AM, Bastiaan Veelo wrote:
> > On Tuesday, 29 January 2019 at 22:02:11 UTC, sarn wrote:
> > > On Tuesday, 29 January 2019 at 20:13:12 UTC, Stefan Koch wrote:
> > > > Though it should be noted that about 40% of complexity in
> > > > newCTFE is entirely for oop support, another 40% being
> > > > delegates!
> > > 
> > > This makes me wonder where the next 40% of complexity is. :)
> > 
> > Because D has a total complexity rate of 120%? ;)
> 
> Hmm, if we claim a high number for D then C++ will start getting a
> complexity complex.

"Complexity complex" sounds like an apt description of C++. :-D

We may divide overall complexity by the number of cleanly-designed,
orthogonal features to get an estimate of the complexity each language
feature brings.  In the case of C++, I fear it may end up being
infinity.  :-P


T

-- 
Some days you win; most days you lose.


More information about the Digitalmars-d mailing list