The thing that makes SList useless is the O(n) removal. Nobody will ever use SList when they can write a replacement that has O(1) removal in 10 minutes.Do you mean something like indexed/sorted dictionary? It doesn't seem to be that easy to implement. Or some other data structure with O(1) removal?
On Wednesday, 27 June 2012 at 18:26:46 UTC, Steven Schveighoffer
wrote:
- Removing from SList (std.container)... Minas Mina
- Re: Removing from SList (std.container)... Tobias Pankrath
- Re: Removing from SList (std.container)... Minas Mina
- Re: Removing from SList (std.container).... Tobias Pankrath
- Re: Removing from SList (std.contain... Minas Mina
- Re: Removing from SList (std.container)... Steven Schveighoffer
- Re: Removing from SList (std.container)... Jonathan M Davis
- Re: Removing from SList (std.container)... Steven Schveighoffer
- Re: Removing from SList (std.container).... Roman D. Boiko
- Re: Removing from SList (std.contain... Timon Gehr
- Re: Removing from SList (std.co... Roman D. Boiko
- Re: Removing from SList (st... Roman D. Boiko
- Re: Removing from SList (std.contain... Steven Schveighoffer
- Re: Removing from SList (std.co... Roman D. Boiko
- Re: Removing from SList (st... Roman D. Boiko
- Re: Removing from SList... Steven Schveighoffer
- Re: Removing from SList... Roman D. Boiko
- Re: Removing from SList... Tobias Pankrath
- Re: Removing from SList... Roman D. Boiko