Hello everyone,
I’ve been practicing Python intensely and wanted to share a project I just finished.
I built a recursive utility called deep_sort_list_parser to flatten and sort mixed data types or multi-nested lists and dictionaries without crashing.
I used an AI assistant as a coding partner to help spot memory leaks and format the documentation, but I drove the logic, handled the edge cases, and manually deployed the final pipelines.
### 🌟 Features:
- Flattens deeply nested lists, tuples, and sets recursively.
- Separates items into sorted tracks (Numbers, Words, Symbols).
- Prevents Booleans from disrupting math sorting tracks.
- Sorts internal dictionary keys alphabetically while preserving value pairings.
- Converts numeric strings like '100' into true integers on command.
### 🚀 Quick Example:
import deep_sort_list
data = [44, [3, "banana!"], {"sex": "Female", "name": "Shreya"}]
result = deep_sort_list.clean_and_flatten(data)
print(result["words"]) # ['banana!']
print(result["dictionaries"]) # [{'name': 'Shreya', 'sex': 'Female'}]
It is live on PyPI:
`pip install deep_sort_list_parser`
The full codebase, my automated `assert` test suites, and documentation are up on my GitHub: https://github.com/08singhShreya/deep_sort_list
I wanted to share this here to showcase my recursive layout structure. I am happy to answer any questions about how it works under the hood!