Collections Framework ni seti iliyounganishwa ya Java ya miingiliano na madarasa ya kuhifadhi na kuharisha vikundi vya vitu — List, Set, Map, Queue na kutekeleza kwao. Inatoa miundo ya data iliyoandaliwa, iliyojaribiwa vizuri ili kuzuia kusanganisha yako mwenyewe.
Collection
├── List — ordered, allows duplicates, indexed access
├── Set — no duplicates, models uniqueness
└── Queue — FIFO/priority ordering for processing
Map (separate hierarchy) — key→value pairs
List<String> list = new ArrayList<>(); // backed by an array — fast random access
list.add("a");
list.get(0); // index access — O(1)
list.contains("a"); // O(n) search
// LinkedList — fast insert/remove at ends, O(n) random access
ArrayList (inayoungwa na safu, kuandika kwa haraka) ni chaguo chaguo-msingi; LinkedList inaanguka vizuri kwa kuingiza mara kwa mara mwisho.
Set<String> set = new HashSet<>(); // O(1) add/contains, NO order
set.add("a");
set.add("a"); // ignored — duplicates not allowed
set.contains("a"); // O(1) — great for membership tests
// TreeSet — sorted order; LinkedHashSet — insertion order
HashSet inatoa uangalizi wa O(1) wa kipekee; TreeSet inabaki vipengele vilivyokamatia.
Map<String, Integer> map = new HashMap<>(); // O(1) get/put, no order
map.put("age", 30);
map.get("age"); // 30
map.getOrDefault("x", 0); // safe access with default
map.computeIfAbsent("list", k -> new ArrayList<>()); // handy for grouping
// TreeMap — sorted by key; LinkedHashMap — insertion order
HashMap ni zana kuu ya kutafuta O(1) inayolingana na ufunguo.
Need ordered + indexed + duplicates → ArrayList
Need uniqueness, fast lookup → HashSet
Need key→value, fast lookup → HashMap
Need sorted order → TreeSet / TreeMap
Need FIFO processing → ArrayDeque / LinkedList (Queue)
Need thread-safety → ConcurrentHashMap, etc.
ArrayList: get O(1), add-end O(1), contains/remove O(n)
HashMap/HashSet: get/put/contains O(1) average
TreeMap/TreeSet: O(log n) (sorted)
LinkedList: add/remove-ends O(1), get O(n)
Collections Framework ni kati ya sehemu zinazotumiwa sana za Java — takriban kila programu inakuhifadhi na kuharisha vikundi vya data nayo.
Kuchagua mkutano sahihi ni ujinga muhimu ambao unaadhimisha moja kwa moja usahihi na utendaji: ArrayList kwa data iliyoamriwa iliyoindeksia, HashSet kwa kipekee, HashMap kwa kutafuta haraka kulingana na ufunguo, na aina zilizosamarishwa/zinazoungana pale inapohitajika.
Kuelewa miingiliano (List/Set/Map/Queue), utekelezaji wao, na hasa sifa za utendaji (kutafuta O(1) HashMap dhidi ya kutafuta O(n) katika orodha) inakuwezesha kuchagua muundo sahihi badala ya kukamatia katika hiyo isiyo sahihi (sababu ya kawaida ya nambari nyingi za mwitu).
Ni ujinga wa msingi, wa vitendo kwa maendeleo ya Java ya kila siku.