Raymond Hettinger added the comment:
> So I think that this issue should be closed.
I agree with the respondents. Marking this one as closed.
--
nosy: +rhettinger
resolution: -> rejected
stage: -> resolved
status: open -> closed
___
Python track
Terry J. Reedy added the comment:
The opening claim (no linked list structures in Python) is flawed. Abstractly,
a linked list is a binary tree with right items of nodes restricted to being a
linked list or None. If the left items are restricted to being non-lists
values, then the linked li
Dennis Sweeney added the comment:
I'll add that for 98% of the use cases of a linked list (where you just want
fast access at the ends), you can use a `collections.deque` instead, and it
will be faster (fewer dereferences) and more memory-efficient (fewer pointers
to store).
In the remainin
Steven D'Aprano added the comment:
The class you have provided is awkward to use, random access is inefficient, it
is not compatible with lists or offer a sequence API, it's not subscriptable or
iterable, the API exposes an unnecessary "Proxy" class, and the API is more
like what I would exp
New submission from Sam Yan :
There has been no LinkedList data structure for Python. Therefore suggest
adding a LinkedList data structure.
--
components: C API
files: LinkedList.py
messages: 382557
nosy: SamUnimelb
priority: normal
severity: normal
status: open
title: Suggest to add a
