Explore the intricacies of Java Collections in this 50-minute Devoxx conference talk by Raoul-Gabriel Urma and Richard Warburton. Dive into common developer errors, bugs, and performance issues related to popular data structures like HashMap. Discover proposed future changes to Java Collections and alternative options such as Immutable Persistent Collections. Learn about concurrent modification, collection factories, API improvements, and unmodifiable lists. Investigate advanced topics including Eclipse Collections, immutable persistent collections, and various data structures like Binary Trees and Bitmap Vectors. Gain insights into performance improvements, primitive specialized collections, and lazy initialization. Understand the differences between chaining and probing in HashMap implementations, and explore benchmarks comparing their performance. Benefit from the expertise of two accomplished speakers with extensive experience in Java programming, research, and technical writing.
Overview
Syllabus
Introduction
Collections in 2016
Agenda
Concurrent Modification
Check the Next
Collection Factories
CheckinAct
API Improvements
Collections
Unmodifiable Lists
Eclipse Collections
immutable persistent collections
Lisp
Cons List
Modifying Elements
Merging Elements
Binary Tree
Performance and Safety
Tri Data Structure
Bitmap Vector
Performance Improvements
Primitive Specialized Collections
Lazy Initialization
Hashmap Improvements
Hashmap Basics
Chaining vs Probing
Terminology Confusion
Open and Closed
Chaining
Winner
Benchmarks
Probe vs Chaining
Identity Based Keys
Conclusions
Wrap up
Questions
Taught by
Devoxx
