Collections Framework shine taƙarar Java ta jama'a da azuzuwan juna don adana da sarrafa ƴa-ƴa jikuku — List, Set, Map, Queue da abubuwan sa. Yana ba da tsarin bayani da jiya-jiya da aka gwada sosai, sabili har ba ka gina naka.
Collections Framework shine taƙarar Java ta jama'a da azuzuwan juna don adana da sarrafa ƴa-ƴa jikuku — List, Set, Map, Queue da abubuwan sa. Yana ba da tsarin bayani da jiya-jiya da aka gwada sosai, sabili har ba ka gina naka.
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 (bakinsa na array, mabilis indexed) shine zaɓi; LinkedList ya dace wa injects mabambaɓa na ƙarshen.
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 yana ba da gwaje O(1) musamman; TreeSet yana kiyaye abubuwa jajira.
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 shine ma'aikacin aiki don neman O(1) tushe-based.
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 shine ɗaya daga cikin sassan Java da ake amfani da su mafi yawa — kusan kowane shirin yana adana da sarrafa ƴa-ƴa bayani ɗashi.
Zaɓin daidaita tsabar tunani shine barkacin tsohon nuna damje ne da yake yi tasiri na kidadi a kan nema da fassara: ArrayList don bayani da aka tsara tare, HashSet don musamman, HashMap don neman keɓi sauri, da sarrafa daidai-daidai lokacin da aka buƙata.
fahimta jitoci (List/Set/Map/Queue), abubuwan sa, musamman jiyya fasallsu (neman O(1) HashMap vs neman O(n) jera) yana ba ka damar zaɓin jami'i da ya dace maimakon hankali ga jiya (gama-gama hadafin jiya sannu).
Italia gida gidaje, ilimin aiki don aikin Java a yau.
Ɗakin karatu na tambayoyin hira na IT tare da amsoshi cikakke — daga Junior zuwa Senior.
Ba da Gudummawa