{"categories":[{"label":"Python Modules","url":"https://skillfed.io/packages/category/software-development-libraries-python-modules/18"}],"enrichment":{"capability":"Provides doubly and singly linked list data structures as C extension modules for CPython, optimized for fast insertions and deletions in the middle of sequences.","skillfed_tags":["data-structure","c-extension","performance-oriented"],"use_cases":["Implementing algorithms that frequently insert or remove elements from the middle of a sequence, such as certain graph or simulation workloads.","Building data structures like queues or deques where you need efficient bidirectional traversal and modification.","Performance-critical code where collections.deque is a bottleneck for middle-of-sequence operations.","Educational purposes to understand linked list behavior and API design in CPython."],"what_it_does":"llist is a C extension module that implements linked list data structures\u2014specifically doubly linked lists (dllist) and singly linked lists (sllist)\u2014for CPython. It targets workloads where fast insertion and deletion in the middle of a sequence matter more than random access, offering potential speed advantages over collections.deque or standard Python lists for those specific operations.\n\nThe package has no runtime dependencies and is distributed under the MIT license. However, it requires compilation during installation, which means you need a C compiler and CPython development headers. The project is dormant: the last release was in 2021, though the repository remains on GitHub with occasional commits. This age raises questions about compatibility with modern Python versions and whether the performance claims still hold.","worth_installing":"No, unless you have a specific performance requirement for linked list operations that you've benchmarked against alternatives. The high install friction (C compilation required), dormant maintenance status (last release 2021), and lack of recent updates create risk for modern Python environments. The performance advantage over collections.deque is unverified on current Python versions. Consider collections.deque first unless you have concrete evidence this package solves a real bottleneck."},"id":"llist","links":{"html":"https://skillfed.io/packages/llist","md":"https://skillfed.io/packages/llist.md","pypi":"https://pypi.org/project/llist/"},"maintenance":{"status":"dormant"},"meta":{"latest_release":"2021-04-26","license_spdx":null,"license_treatment":"permissive","name":"llist","python_support":"unspecified","summary":"Linked list data structures for Python"},"popularity":{"monthly_downloads":136004,"position":11408,"tier":"top_15000"},"security":{"n_vulnerabilities":0},"version":"0.7.1"}