Julia 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)
Categories
Data VisualizationLicense
MIT LicenseFollow DataStructures.jl
Other Useful Business Software
$300 Free Credits for Your Google Cloud Projects
Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of DataStructures.jl!