DownloadJulia implementation of Data structures.
Features
- Deque (implemented with an unrolled linked list)
- CircularDeque (based on a circular buffer)
- Accumulators and Counters (i.e. Multisets / Bags)
- Linked List and Mutable Linked List
- Sorted Dict, Sorted Multi-Dict and Sorted Set
- DiBitVector (in which each element can store two bits)
Project Samples
Categories
Data VisualizationLicense
MIT LicenseFollow DataStructures.jl
You Might Also Like
From improving customer experience through seamless sign-on to making MFA as easy as a click of a button – your login box must find the right balance between user convenience, privacy and security.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of DataStructures.jl!