Across
- 1. - Principle behind bounded wild cards
- 4. - Map method that solve varags issue of of
- 5. - Method works faster in Set than List
- 9. - Implements List as well as Queue
- 13. - Legacy class having same name as underlying data structure
- 14. - Utility method to get an Immutable List of repeated elements
- 15. - Container types have inverse relation to each other as the payload types
- 18. - Make collections homogeneous
- 19. - Internally this is Bit Fields
- 20. - Data structure behind every no duplicate, natural order collection
- 25. - ArrayList and LinkedList use 'containsAll' of this class
- 27. - Those who implemented this finds elements faster
- 29. - Little-c collection
- 30. - Use this collection interface to implement Stack
Down
- 2. - Get a range of elements from a List
- 3. - All rounder List that maintains insertion order.
- 6. - Arrays method to get an Immutable List from an array
- 7. - Method gives an Immutable with a single key-value pair
- 8. - Insertion order and no duplicates
- 10. - Implement this interface to get iterated by forEach loop
- 11. - Growable Array but get cloned on every update
- 12. - Home for static utilities for collection
- 16. - Map used in multithreading environment
- 17. - Class is a Set in some way, but not a Collection
- 21. - Garbage collection friendly HashMa
- 22. - Used to iterate a collection by hiding iterator and loop counter
- 23. - Queue method that behave like add but doesn't throw exception if full
- 24. - Ensure backward compatibility with Generics
- 26. - Misfeature in Arrays, Rectified in Parameterized Types
- 28. - Method removes all elements from queue and put in a collection