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