On Wed, 3 Dec 2025 at 12:15, 方晶晶 <20090187_at_[hidden]> wrote:

> We are discussing my proposal, which is an improvement proposal for C++
> STL linked lists. Please enter the proposal discussion as soon as possible.
> Thanks.
>


I've entered the discussion, and I think this code is garbage. Do you have
a response to that?

If that's the reference implementation, then the proposal is a complete
waste of time. None of it works. Literally nothing in the code you posted
works.

And even if it worked, the API appears to be unusable garbage too:

  list l;
  node<int> n(1);
  l.add(&n);

Why should users have to create a node to add something to the list, when
the implementation is going to allocate a new node anyway?

Why doesn't it support iterators?

How is your binarySearch function supposed to work if the list contains
heterogeneous types? If it doesn't contain heterogeneous types, why
wouldn't you just use std::list<T> instead?

This is a serious list for serious proposals, and your "reference
implementation" is a complete waste of time. Please don't waste our time.