{"id":32152,"date":"2025-10-18T09:41:00","date_gmt":"2025-10-18T06:41:00","guid":{"rendered":"https:\/\/fatihsoysal.com\/blog\/?p=32152"},"modified":"2025-10-18T09:41:00","modified_gmt":"2025-10-18T06:41:00","slug":"java-listiterator-koleksiyonlarda-daha-guclu-ve-esnek-dolasim","status":"publish","type":"post","link":"https:\/\/fatihsoysal.com\/blog\/java-listiterator-koleksiyonlarda-daha-guclu-ve-esnek-dolasim\/","title":{"rendered":"Java ListIterator: Koleksiyonlarda Daha G\u00fc\u00e7l\u00fc ve Esnek Dola\u015f\u0131m"},"content":{"rendered":"

<\/p>\n

Java ListIterator: Koleksiyonlarda Daha G\u00fc\u00e7l\u00fc ve Esnek Dola\u015f\u0131m<\/h2>\n

Giri\u015f<\/h2>\n

Java’da koleksiyonlar (Collections Framework), veri yap\u0131lar\u0131n\u0131 depolamak ve y\u00f6netmek i\u00e7in temel bir ara\u00e7 setidir. Bu koleksiyonlar \u00fczerinde dola\u015fmak, elemanlar\u0131 okumak, eklemek, silmek veya g\u00fcncellemek i\u00e7in \u00e7e\u015fitli mekanizmalar mevcuttur. Geleneksel for<\/code> d\u00f6ng\u00fcleri veya geli\u015fmi\u015f for-each<\/code> d\u00f6ng\u00fcs\u00fc bu i\u015flemlerin \u00e7o\u011funu basitle\u015ftirse de, belirli senaryolarda daha g\u00fc\u00e7l\u00fc ve esnek bir araca ihtiya\u00e7 duyulur. \u0130\u015fte tam bu noktada java.util.Iterator<\/code> ve onun daha geli\u015fmi\u015f bir t\u00fcrevi olan java.util.ListIterator<\/code> devreye girer.<\/p>\n

Iterator<\/code>, bir koleksiyon \u00fczerinde tek y\u00f6nl\u00fc (ileri do\u011fru) dola\u015f\u0131m yapmaya ve elemanlar\u0131 g\u00fcvenli bir \u015fekilde silmeye olanak tan\u0131r. Ancak, ListIterator<\/code>, yaln\u0131zca List<\/code> aray\u00fcz\u00fcn\u00fc uygulayan koleksiyonlar i\u00e7in tasarlanm\u0131\u015f olup, Iterator<\/code>‘\u0131n sundu\u011fu yeteneklere ek olarak \u00e7ift y\u00f6nl\u00fc dola\u015f\u0131m, eleman ekleme, de\u011fi\u015ftirme ve imlecin konumunu belirten indeks bilgisi gibi \u00f6nemli \u00f6zellikler sunar. Bu makale, ListIterator<\/code>‘\u0131n derinlemesine incelenmesini, temel metotlar\u0131n\u0131, \u00e7e\u015fitli kullan\u0131m senaryolar\u0131n\u0131, Iterator<\/code> ile farklar\u0131n\u0131 ve performans m\u00fclahazalar\u0131n\u0131 detayl\u0131 bir \u015fekilde ele alacakt\u0131r. Amac\u0131m\u0131z, Java geli\u015ftiricilerinin ListIterator<\/code>‘\u0131n g\u00fcc\u00fcn\u00fc tam olarak anlamalar\u0131na ve koleksiyon y\u00f6netimi g\u00f6revlerinde daha etkili olmalar\u0131na yard\u0131mc\u0131 olmakt\u0131r.<\/p>\n

ListIterator Nedir?<\/h2>\n

ListIterator<\/code>, Java Collections Framework’\u00fcnde java.util.List<\/code> aray\u00fcz\u00fcn\u00fc uygulayan koleksiyonlar (\u00f6rne\u011fin ArrayList<\/code>, LinkedList<\/code>, Vector<\/code>) \u00fczerinde gezinmek, elemanlar\u0131 eklemek, de\u011fi\u015ftirmek ve silmek i\u00e7in \u00f6zel olarak tasarlanm\u0131\u015f bir aray\u00fczd\u00fcr. java.util.Iterator<\/code> aray\u00fcz\u00fcnden t\u00fcremi\u015ftir, bu da Iterator<\/code>‘\u0131n t\u00fcm \u00f6zelliklerini miras ald\u0131\u011f\u0131 anlam\u0131na gelir. Ancak ListIterator<\/code>, Iterator<\/code>‘\u0131n tek y\u00f6nl\u00fc (ileri do\u011fru) ve s\u0131n\u0131rl\u0131 yeteneklerini a\u015farak, liste tabanl\u0131 koleksiyonlar i\u00e7in \u00e7ok daha zengin bir i\u015flevsellik seti sunar.<\/p>\n

ListIterator<\/code>‘\u0131 di\u011fer dola\u015f\u0131m mekanizmalar\u0131ndan ay\u0131ran en \u00f6nemli \u00f6zellikler \u015funlard\u0131r:<\/p>\n

1. \u00c7ift Y\u00f6nl\u00fc Dola\u015f\u0131m:<\/strong> Hem ileri (next()<\/code>) hem de geri (previous()<\/code>) y\u00f6nde elemanlar aras\u0131nda gezinme yetene\u011fi sunar. Bu, belirli bir eleman\u0131 bulduktan sonra hem sonraki hem de \u00f6nceki elemanlara kolayca eri\u015fim imkan\u0131 sa\u011flar.
\n2. Eleman Manip\u00fclasyonu:<\/strong> Dola\u015f\u0131m s\u0131ras\u0131nda koleksiyona yeni elemanlar ekleyebilir (add()<\/code>), mevcut elemanlar\u0131 de\u011fi\u015ftirebilir (set()<\/code>) veya kald\u0131rabilir (remove()<\/code>). Bu, for-each<\/code> d\u00f6ng\u00fcs\u00fc veya standart for<\/code> d\u00f6ng\u00fcs\u00fc ile do\u011frudan yap\u0131lamayan veya ConcurrentModificationException<\/code> riskini ta\u015f\u0131yan i\u015flemleri g\u00fcvenli bir \u015fekilde ger\u00e7ekle\u015ftirmeyi sa\u011flar.
\n3. \u0130ndeks Bilgisi:<\/strong> \u0130mlecin mevcut konumunu ve bir sonraki veya \u00f6nceki eleman\u0131n indeksini (nextIndex()<\/code>, previousIndex()<\/code>) d\u00f6nd\u00fcrebilir. Bu, elemanlar\u0131n liste i\u00e7indeki konumlar\u0131 hakk\u0131nda bilgi edinmek gerekti\u011finde olduk\u00e7a kullan\u0131\u015fl\u0131d\u0131r.<\/p>\n

ListIterator<\/code> nesnesi, bir List<\/code> implementasyonunun listIterator()<\/code> metodu \u00e7a\u011fr\u0131larak elde edilir. \u00d6rne\u011fin, ArrayList liste = new ArrayList<>(); ListIterator it = liste.listIterator();<\/code> \u015feklinde bir ListIterator<\/code> \u00f6rne\u011fi olu\u015fturulabilir. Ba\u015flang\u0131\u00e7ta imle\u00e7, listenin ilk eleman\u0131ndan \u00f6nce konumlan\u0131r.<\/p>\n

ListIterator’\u0131n Ana Metotlar\u0131<\/h2>\n

ListIterator<\/code> aray\u00fcz\u00fc, koleksiyonlar \u00fczerinde g\u00fc\u00e7l\u00fc ve esnek dola\u015f\u0131m ve manip\u00fclasyon sa\u011flamak i\u00e7in bir dizi metot sunar. Bu metotlar, Iterator<\/code> aray\u00fcz\u00fcnde bulunan temel metotlara ek olarak, List<\/code>‘e \u00f6zg\u00fc yetenekleri de kapsar.<\/p>\n

boolean hasNext()<\/code><\/h3>\n

Bu metot, imlecin ileri y\u00f6nde bir eleman\u0131 daha olup olmad\u0131\u011f\u0131n\u0131 kontrol eder. E\u011fer varsa true<\/code>, yoksa false<\/code> d\u00f6nd\u00fcr\u00fcr. Genellikle bir while<\/code> d\u00f6ng\u00fcs\u00fcn\u00fcn ko\u015fulu olarak kullan\u0131l\u0131rken, listenin sonuna kadar ileri do\u011fru dola\u015f\u0131m\u0131 sa\u011flar.<\/p>\n

E next()<\/code><\/h3>\n

Bu metot, listedeki bir sonraki eleman\u0131 d\u00f6nd\u00fcr\u00fcr ve imleci bir pozisyon ileriye ta\u015f\u0131r. E\u011fer ileri y\u00f6nde ba\u015fka eleman yoksa (hasNext()<\/code> metodu false<\/code> d\u00f6nd\u00fcr\u00fcyorsa) NoSuchElementException<\/code> f\u0131rlat\u0131r. Bu metot, remove()<\/code> ve set()<\/code> metotlar\u0131n\u0131n hangi eleman\u0131 etkileyece\u011fini belirler.<\/p>\n

import java.util.ArrayList;\nimport java.util.List;\nimport java.util.ListIterator;\n\npublic class ListIteratorOrnek1 {\n    public static void main(String[] args) {\n        List diller = new ArrayList<>();\n        diller.add(\"Java\");\n        diller.add(\"Python\");\n        diller.add(\"C++\");\n\n        ListIterator iterator = diller.listIterator();\n\n        System.out.println(\"\u0130leri Y\u00f6nde Dola\u015f\u0131m:\");\n        while (iterator.hasNext()) {\n            System.out.println(iterator.next());\n        }\n    }\n}<\/code><\/pre>\n
int nextIndex()<\/code><\/h3>\n
Bu metot, next()<\/code> metodu taraf\u0131ndan d\u00f6nd\u00fcr\u00fclecek olan eleman\u0131n indeksini d\u00f6nd\u00fcr\u00fcr. E\u011fer hasNext()<\/code> false<\/code> ise, listenin boyutunu d\u00f6nd\u00fcr\u00fcr. Bu metot, imlecin mant\u0131ksal konumunu anlamak i\u00e7in kullan\u0131\u015fl\u0131d\u0131r.<\/p>\n
boolean hasPrevious()<\/code><\/h3>\n
Bu metot, imlecin geri y\u00f6nde bir eleman\u0131 daha olup olmad\u0131\u011f\u0131n\u0131 kontrol eder. E\u011fer varsa true<\/code>, yoksa false<\/code> d\u00f6nd\u00fcr\u00fcr. previous()<\/code> metoduyla birlikte, listenin ba\u015f\u0131ndan sonuna veya sonundan ba\u015f\u0131na dola\u015f\u0131m i\u00e7in kullan\u0131l\u0131r.<\/p>\n
E previous()<\/code><\/h3>\n
Bu metot, listedeki bir \u00f6nceki eleman\u0131 d\u00f6nd\u00fcr\u00fcr ve imleci bir pozisyon geriye ta\u015f\u0131r. E\u011fer geri y\u00f6nde ba\u015fka eleman yoksa (hasPrevious()<\/code> metodu false<\/code> d\u00f6nd\u00fcr\u00fcyorsa) NoSuchElementException<\/code> f\u0131rlat\u0131r. remove()<\/code> ve set()<\/code> metotlar\u0131 \u00fczerinde de etkisi vard\u0131r.<\/p>\n
import java.util.ArrayList;\nimport java.util.List;\nimport java.util.ListIterator;\n\npublic class ListIteratorOrnek2 {\n    public static void main(String[] args) {\n        List diller = new ArrayList<>();\n        diller.add(\"Java\");\n        diller.add(\"Python\");\n        diller.add(\"C++\");\n\n        ListIterator iterator = diller.listIterator();\n\n        \/\/ \u00d6nce listenin sonuna git\n        while (iterator.hasNext()) {\n            iterator.next();\n        }\n\n        System.out.println(\"\\nGeri Y\u00f6nde Dola\u015f\u0131m:\");\n        while (iterator.hasPrevious()) {\n            System.out.println(iterator.previous());\n        }\n    }\n}<\/code><\/pre>\n
int previousIndex()<\/code><\/h3>\n
Bu metot, previous()<\/code> metodu taraf\u0131ndan d\u00f6nd\u00fcr\u00fclecek olan eleman\u0131n indeksini d\u00f6nd\u00fcr\u00fcr. E\u011fer hasPrevious()<\/code> false<\/code> ise, -1 d\u00f6nd\u00fcr\u00fcr. nextIndex()<\/code> gibi, imlecin konumunu indeks baz\u0131nda anlamak i\u00e7in faydal\u0131d\u0131r.<\/p>\n
void remove()<\/code><\/h3>\n
Bu metot, next()<\/code> veya previous()<\/code> metotlar\u0131 taraf\u0131ndan en son d\u00f6nd\u00fcr\u00fclen eleman\u0131 listeden kald\u0131r\u0131r. remove()<\/code> metodu, next()<\/code> veya previous()<\/code> \u00e7a\u011fr\u0131lmadan \u00f6nce veya add()<\/code> metodu \u00e7a\u011fr\u0131ld\u0131ktan sonra \u00e7a\u011fr\u0131l\u0131rsa IllegalStateException<\/code> f\u0131rlat\u0131r. Ayr\u0131ca, her next()<\/code> veya previous()<\/code> \u00e7a\u011fr\u0131s\u0131ndan sonra yaln\u0131zca bir kez remove()<\/code> \u00e7a\u011fr\u0131labilir. Bu metot, koleksiyonun yap\u0131s\u0131n\u0131 g\u00fcvenli bir \u015fekilde de\u011fi\u015ftirmenin ana yoludur.<\/p>\n
import java.util.ArrayList;\nimport java.util.List;\nimport java.util.ListIterator;\n\npublic class ListIteratorOrnek3 {\n    public static void main(String[] args) {\n        List diller = new ArrayList<>();\n        diller.add(\"Java\");\n        diller.add(\"Python\");\n        diller.add(\"C++\");\n        diller.add(\"JavaScript\");\n\n        ListIterator iterator = diller.listIterator();\n\n        System.out.println(\"\u00d6nceki liste: \" + diller);\n        while (iterator.hasNext()) {\n            String dil = iterator.next();\n            if (dil.equals(\"C++\")) {\n                iterator.remove(); \/\/ \"C++\" eleman\u0131n\u0131 listeden kald\u0131r\n            }\n        }\n        System.out.println(\"Sonraki liste (C++ kald\u0131r\u0131ld\u0131): \" + diller);\n    }\n}<\/code><\/pre>\n
void set(E e)<\/code><\/h3>\n
Bu metot, next()<\/code> veya previous()<\/code> metotlar\u0131 taraf\u0131ndan en son d\u00f6nd\u00fcr\u00fclen eleman\u0131, belirtilen yeni eleman (e<\/code>) ile de\u011fi\u015ftirir. remove()<\/code> metodu gibi, set()<\/code> de next()<\/code> veya previous()<\/code> \u00e7a\u011fr\u0131lmadan \u00f6nce veya add()<\/code> \u00e7a\u011fr\u0131ld\u0131ktan sonra \u00e7a\u011fr\u0131l\u0131rsa IllegalStateException<\/code> f\u0131rlat\u0131r. Her next()<\/code> veya previous()<\/code> \u00e7a\u011fr\u0131s\u0131ndan sonra yaln\u0131zca bir kez set()<\/code> \u00e7a\u011fr\u0131labilir. Bu metot, mevcut elemanlar\u0131 dola\u015f\u0131m s\u0131ras\u0131nda g\u00fcncellemek i\u00e7in kullan\u0131l\u0131r.<\/p>\n
import java.util.ArrayList;\nimport java.util.List;\nimport java.util.ListIterator;\n\npublic class ListIteratorOrnek4 {\n    public static void main(String[] args) {\n        List diller = new ArrayList<>();\n        diller.add(\"Java\");\n        diller.add(\"Python\");\n        diller.add(\"C++\");\n\n        ListIterator iterator = diller.listIterator();\n\n        System.out.println(\"\u00d6nceki liste: \" + diller);\n        while (iterator.hasNext()) {\n            String dil = iterator.next();\n            if (dil.equals(\"C++\")) {\n                iterator.set(\"C#\"); \/\/ \"C++\" yerine \"C#\" koy\n            }\n        }\n        System.out.println(\"Sonraki liste (C++ -> C#): \" + diller);\n    }\n}<\/code><\/pre>\n
void add(E e)<\/code><\/h3>\n
Bu metot, imlecin \u015fu anki konumuna, yani next()<\/code> taraf\u0131ndan d\u00f6nd\u00fcr\u00fclecek elemandan \u00f6nce veya previous()<\/code> taraf\u0131ndan d\u00f6nd\u00fcr\u00fclecek elemandan sonra, belirtilen eleman\u0131 (e<\/code>) ekler. Yeni eklenen eleman, next()<\/code> \u00e7a\u011fr\u0131l\u0131rsa atlan\u0131r, ancak previous()<\/code> \u00e7a\u011fr\u0131l\u0131rsa d\u00f6nd\u00fcr\u00fcl\u00fcr. Bu metot, listeye dinamik olarak eleman eklemek i\u00e7in kullan\u0131l\u0131r ve remove()<\/code> veya set()<\/code> metotlar\u0131n\u0131n aksine, bir next()<\/code> veya previous()<\/code> \u00e7a\u011fr\u0131s\u0131na ihtiya\u00e7 duymaz.<\/p>\n
import java.util.ArrayList;\nimport java.util.List;\nimport java.util.ListIterator;\n\npublic class ListIteratorOrnek5 {\n    public static void main(String[] args) {\n        List diller = new ArrayList<>();\n        diller.add(\"Java\");\n        diller.add(\"Python\");\n        diller.add(\"C++\");\n\n        ListIterator iterator = diller.listIterator();\n\n        System.out.println(\"\u00d6nceki liste: \" + diller);\n        while (iterator.hasNext()) {\n            String dil = iterator.next();\n            if (dil.equals(\"Python\")) {\n                iterator.add(\"JavaScript\"); \/\/ \"Python\"dan sonra \"JavaScript\" ekle\n            }\n        }\n        System.out.println(\"Sonraki liste (JavaScript eklendi): \" + diller);\n    }\n}<\/code><\/pre>\n
ListIterator ile Geli\u015fmi\u015f Kullan\u0131m Senaryolar\u0131<\/h2>\n
ListIterator<\/code>‘\u0131n sundu\u011fu \u00e7ift y\u00f6nl\u00fc dola\u015f\u0131m ve eleman manip\u00fclasyonu yetenekleri, onu bir\u00e7ok karma\u015f\u0131k liste i\u015fleme senaryosunda vazge\u00e7ilmez k\u0131lar. \u0130\u015fte baz\u0131 \u00f6rnekler:<\/p>\n
\u0130leriye ve Geriye Dola\u015f\u0131m<\/h3>\n
Bir listedeki t\u00fcm elemanlar\u0131 hem ileri hem de geri y\u00f6nde i\u015flememiz gerekti\u011finde ListIterator<\/code> idealdir. \u00d6rne\u011fin, bir liste eleman\u0131n\u0131 ileri do\u011fru tararken belirli bir elemana ula\u015f\u0131ld\u0131\u011f\u0131nda, o noktadan geri do\u011fru taramaya ba\u015flamak.<\/p>\n
import java.util.ArrayList;\nimport java.util.List;\nimport java.util.ListIterator;\n\npublic class ListIteratorSenaryo1 {\n    public static void main(String[] args) {\n        List sehirler = new ArrayList<>();\n        sehirler.add(\"Ankara\");\n        sehirler.add(\"\u0130stanbul\");\n        sehirler.add(\"\u0130zmir\");\n        sehirler.add(\"Bursa\");\n\n        ListIterator iterator = sehirler.listIterator();\n\n        System.out.println(\"\u0130leriye do\u011fru dola\u015f\u0131m:\");\n        while (iterator.hasNext()) {\n            String sehir = iterator.next();\n            System.out.println(\"Gidilen \u015fehir: \" + sehir + \" (Index: \" + iterator.previousIndex() + \")\");\n            if (sehir.equals(\"\u0130zmir\")) {\n                System.out.println(\"\u0130zmir bulundu! Geriye d\u00f6n\u00fcyoruz...\");\n                break; \/\/ \u0130zmir'i bulduktan sonra ileri dola\u015f\u0131m\u0131 durdur\n            }\n        }\n\n        System.out.println(\"\\nGeriye do\u011fru dola\u015f\u0131m (\u0130zmir'den itibaren):\");\n        while (iterator.hasPrevious()) {\n            String sehir = iterator.previous();\n            System.out.println(\"Geri gelinen \u015fehir: \" + sehir + \" (Index: \" + iterator.nextIndex() + \")\");\n        }\n    }\n}<\/code><\/pre>\n
Eleman Ekleme<\/h3>\n
Belirli bir ko\u015fula uyan bir elemandan sonra veya \u00f6nce listeye yeni elemanlar eklemek i\u00e7in add()<\/code> metodu kullan\u0131l\u0131r. Bu, for-each<\/code> d\u00f6ng\u00fcs\u00fc ile do\u011frudan yap\u0131lamaz ve ConcurrentModificationException<\/code>‘a yol a\u00e7abilir.<\/p>\n
import java.util.ArrayList;\nimport java.util.List;\nimport java.util.ListIterator;\n\npublic class ListIteratorSenaryo2 {\n    public static void main(String[] args) {\n        List meyveler = new ArrayList<>();\n        meyveler.add(\"Elma\");\n        meyveler.add(\"Armut\");\n        meyveler.add(\"Muz\");\n\n        ListIterator iterator = meyveler.listIterator();\n\n        System.out.println(\"Ba\u015flang\u0131\u00e7 listesi: \" + meyveler);\n        while (iterator.hasNext()) {\n            String meyve = iterator.next();\n            if (meyve.equals(\"Armut\")) {\n                iterator.add(\"\u00c7ilek\"); \/\/ Armut'tan sonra \u00c7ilek ekle\n            }\n        }\n        System.out.println(\"G\u00fcncel liste (\u00c7ilek eklendi): \" + meyveler);\n    }\n}<\/code><\/pre>\n
Eleman De\u011fi\u015ftirme<\/h3>\n
Dola\u015f\u0131m s\u0131ras\u0131nda belirli bir ko\u015fulu sa\u011flayan elemanlar\u0131 ba\u015fka bir elemanla de\u011fi\u015ftirmek i\u00e7in set()<\/code> metodu kullan\u0131l\u0131r.<\/p>\n
import java.util.ArrayList;\nimport java.util.List;\nimport java.util.ListIterator;\n\npublic class ListIteratorSenaryo3 {\n    public static void main(String[] args) {\n        List sayilar = new ArrayList<>();\n        sayilar.add(1);\n        sayilar.add(2);\n        sayilar.add(3);\n        sayilar.add(4);\n\n        ListIterator iterator = sayilar.listIterator();\n\n        System.out.println(\"Ba\u015flang\u0131\u00e7 listesi: \" + sayilar);\n        while (iterator.hasNext()) {\n            Integer sayi = iterator.next();\n            if (sayi % 2 == 0) { \/\/ \u00c7ift say\u0131lar\u0131 0 ile de\u011fi\u015ftir\n                iterator.set(0);\n            }\n        }\n        System.out.println(\"G\u00fcncel liste (\u00c7ift say\u0131lar de\u011fi\u015ftirildi): \" + sayilar);\n    }\n}<\/code><\/pre>\n
Eleman Silme<\/h3>\n
Belirli bir kritere uyan elemanlar\u0131 listeden g\u00fcvenli bir \u015fekilde kald\u0131rmak i\u00e7in remove()<\/code> metodu kullan\u0131l\u0131r.<\/p>\n
import java.util.ArrayList;\nimport java.util.List;\nimport java.util.ListIterator;\n\npublic class ListIteratorSenaryo4 {\n    public static void main(String[] args) {\n        List urunler = new ArrayList<>();\n        urunler.add(\"Laptop\");\n        urunler.add(\"Mouse\");\n        urunler.add(\"Klavye\");\n        urunler.add(\"Mouse\"); \/\/ Duplicate\n\n        ListIterator iterator = urunler.listIterator();\n\n        System.out.println(\"Ba\u015flang\u0131\u00e7 listesi: \" + urunler);\n        while (iterator.hasNext()) {\n            String urun = iterator.next();\n            if (urun.equals(\"Mouse\")) {\n                iterator.remove(); \/\/ \"Mouse\" elemanlar\u0131n\u0131 kald\u0131r\n            }\n        }\n        System.out.println(\"G\u00fcncel liste (Mouse kald\u0131r\u0131ld\u0131): \" + urunler);\n    }\n}<\/code><\/pre>\n
Listeyi Tersten Yazd\u0131rma<\/h3>\n
ListIterator<\/code>‘\u0131n previous()<\/code> metodunu kullanarak bir listeyi tersten yazd\u0131rmak olduk\u00e7a kolayd\u0131r. \u00d6nce imleci listenin sonuna ta\u015f\u0131r, sonra geri do\u011fru dola\u015farak elemanlar\u0131 yazd\u0131r\u0131r\u0131z.<\/p>\n
import java.util.ArrayList;\nimport java.util.List;\nimport java.util.ListIterator;\n\npublic class ListIteratorSenaryo5 {\n    public static void main(String[] args) {\n        List harfler = new ArrayList<>();\n        harfler.add(\"A\");\n        harfler.add(\"B\");\n        harfler.add(\"C\");\n        harfler.add(\"D\");\n\n        ListIterator iterator = harfler.listIterator();\n\n        \/\/ \u0130mleci listenin sonuna ta\u015f\u0131\n        while (iterator.hasNext()) {\n            iterator.next();\n        }\n\n        System.out.println(\"Listeyi tersten yazd\u0131rma:\");\n        while (iterator.hasPrevious()) {\n            System.out.println(iterator.previous());\n        }\n    }\n}<\/code><\/pre>\n
Iterator ve ListIterator Kar\u015f\u0131la\u015ft\u0131rmas\u0131<\/h2>\n
Iterator<\/code> ve ListIterator<\/code> her ikisi de Java koleksiyonlar\u0131 \u00fczerinde dola\u015f\u0131m sa\u011flamak i\u00e7in kullan\u0131l\u0131r, ancak yetenekleri ve kullan\u0131m alanlar\u0131 a\u00e7\u0131s\u0131ndan \u00f6nemli farkl\u0131l\u0131klar g\u00f6sterirler.<\/p>\n
| \u00d6zellik             | Iterator                               | ListIterator                             |
\n| :—————— | :————————————- | :————————————— |
\n| Koleksiyon Tipi<\/strong> | Collection<\/code> aray\u00fcz\u00fcn\u00fc uygulayan t\u00fcm koleksiyonlar (Set, List, Queue vb.) | Sadece List<\/code> aray\u00fcz\u00fcn\u00fc uygulayan koleksiyonlar (ArrayList, LinkedList vb.) |
\n| Dola\u015f\u0131m Y\u00f6n\u00fc<\/strong>    | Tek y\u00f6nl\u00fc (yaln\u0131zca ileri: hasNext()<\/code>, next()<\/code>) | \u00c7ift y\u00f6nl\u00fc (ileri ve geri: hasNext()<\/code>, next()<\/code>, hasPrevious()<\/code>, previous()<\/code>) |
\n| Eleman Ekleme<\/strong>   | Desteklemez (add()<\/code> metodu yok)        | Destekler (add(E e)<\/code> metodu var)        |
\n| Eleman De\u011fi\u015ftirme<\/strong> | Desteklemez (set()<\/code> metodu yok)        | Destekler (set(E e)<\/code> metodu var)        |
\n| Eleman Silme<\/strong>    | Destekler (remove()<\/code> metodu var)      | Destekler (remove()<\/code> metodu var)        |
\n| \u0130ndeks Bilgisi<\/strong>  | Sa\u011flamaz                               | Sa\u011flar (nextIndex()<\/code>, previousIndex()<\/code>) |
\n| Ba\u015flang\u0131\u00e7 Konumu<\/strong> | Her zaman listenin ba\u015f\u0131ndan ba\u015flar     | Belirtilen bir indeksten ba\u015flat\u0131labilir (list.listIterator(int index)<\/code>) |<\/p>\n
\u00d6zetle, genel bir koleksiyon \u00fczerinde yaln\u0131zca ileri do\u011fru dola\u015f\u0131m ve eleman silme yeterliyse Iterator<\/code> tercih edilir. Ancak, List<\/code> t\u00fcr\u00fcndeki bir koleksiyon \u00fczerinde daha karma\u015f\u0131k i\u015flemler (\u00e7ift y\u00f6nl\u00fc dola\u015f\u0131m, ekleme, de\u011fi\u015ftirme, indeks bilgisi alma) gerekiyorsa, ListIterator<\/code> \u00e7ok daha g\u00fc\u00e7l\u00fc ve uygun bir se\u00e7enektir.<\/p>\n
Avantajlar ve Dikkat Edilmesi Gerekenler<\/h2>\n
ListIterator<\/code>‘\u0131n sundu\u011fu yetenekler, Java koleksiyonlar\u0131 \u00fczerinde \u00e7al\u0131\u015f\u0131rken geli\u015ftiricilere \u00f6nemli avantajlar sa\u011flar, ancak baz\u0131 k\u0131s\u0131tlamalar\u0131 ve dikkat edilmesi gereken noktalar\u0131 da vard\u0131r.<\/p>\n
Avantajlar<\/h3>\n
*   Esneklik:<\/strong> \u00c7ift y\u00f6nl\u00fc dola\u015f\u0131m (ileri ve geri) sayesinde, listeler \u00fczerinde daha karma\u015f\u0131k ve dinamik i\u015flemler yapmak m\u00fcmk\u00fcnd\u00fcr. Bir eleman\u0131 bulduktan sonra hem ileri hem de geri y\u00f6nde i\u015flem yapma yetene\u011fi b\u00fcy\u00fck bir esneklik sunar.
\n*   G\u00fc\u00e7l\u00fc Manip\u00fclasyon:<\/strong> add()<\/code>, set()<\/code>, ve remove()<\/code> metotlar\u0131 sayesinde, koleksiyon elemanlar\u0131n\u0131 dola\u015f\u0131m s\u0131ras\u0131nda g\u00fcvenli ve do\u011frudan bir \u015fekilde ekleyebilir, de\u011fi\u015ftirebilir veya silebilirsiniz. Bu, for-each<\/code> d\u00f6ng\u00fcs\u00fc veya for<\/code> d\u00f6ng\u00fcs\u00fc ile d\u0131\u015far\u0131dan koleksiyonu de\u011fi\u015ftirmeye \u00e7al\u0131\u015f\u0131rken kar\u015f\u0131la\u015f\u0131lan ConcurrentModificationException<\/code> riskini ortadan kald\u0131r\u0131r.
\n*   \u0130ndeks Bilgisi:<\/strong> nextIndex()<\/code> ve previousIndex()<\/code> metotlar\u0131, imlecin ve elemanlar\u0131n liste i\u00e7indeki konumlar\u0131 hakk\u0131nda de\u011ferli indeks bilgileri sa\u011flar. Bu, belirli konum tabanl\u0131 i\u015flemler i\u00e7in \u00f6nemlidir.
\n*   Ba\u015flang\u0131\u00e7 Konumu:<\/strong> listIterator(int index)<\/code> metodu ile dola\u015f\u0131m\u0131 listenin herhangi bir noktas\u0131ndan ba\u015flatabilme yetene\u011fi, b\u00fcy\u00fck listelerde performans\u0131 art\u0131rabilir ve belirli bir alt b\u00f6l\u00fcm \u00fczerinde odaklanmay\u0131 kolayla\u015ft\u0131r\u0131r.<\/p>\n
Dikkat Edilmesi Gerekenler<\/h3>\n
*   Sadece List<\/code> T\u00fcrleri \u0130\u00e7in:<\/strong> ListIterator<\/code>, yaln\u0131zca java.util.List<\/code> aray\u00fcz\u00fcn\u00fc uygulayan koleksiyonlar i\u00e7in kullan\u0131labilir. Set<\/code> veya Queue<\/code> gibi di\u011fer koleksiyon t\u00fcrleri i\u00e7in kullan\u0131lamaz.
\n*   IllegalStateException<\/code>:<\/strong> remove()<\/code> veya set()<\/code> metotlar\u0131, next()<\/code> veya previous()<\/code> metotlar\u0131 \u00e7a\u011fr\u0131lmadan \u00f6nce veya add()<\/code> metodu \u00e7a\u011fr\u0131ld\u0131ktan sonra \u00e7a\u011fr\u0131l\u0131rsa IllegalStateException<\/code> f\u0131rlat\u0131r. Bu metotlar\u0131n her next()<\/code> veya previous()<\/code> \u00e7a\u011fr\u0131s\u0131ndan sonra yaln\u0131zca bir kez \u00e7a\u011fr\u0131labilece\u011fi unutulmamal\u0131d\u0131r.
\n*   ConcurrentModificationException<\/code> Riski:<\/strong> ListIterator<\/code> kendi add()<\/code>, remove()<\/code>, set()<\/code> metotlar\u0131n\u0131 kullanarak listeyi de\u011fi\u015ftirdi\u011finde bu hatadan ka\u00e7\u0131n\u0131l\u0131r. Ancak, ListIterator<\/code> olu\u015fturulduktan sonra, listenin kendisi ba\u015fka bir yolla (\u00f6rne\u011fin, list.add()<\/code>, list.remove()<\/code> veya ba\u015fka bir Iterator<\/code>\/ListIterator<\/code> \u00f6rne\u011fi arac\u0131l\u0131\u011f\u0131yla) yap\u0131sal olarak de\u011fi\u015ftirilirse, ListIterator<\/code>‘\u0131n sonraki next()<\/code>, previous()<\/code>, remove()<\/code>, set()<\/code> veya add()<\/code> \u00e7a\u011fr\u0131lar\u0131 ConcurrentModificationException<\/code> f\u0131rlatabilir. Bu, fail-fast (hata durumunda h\u0131zl\u0131ca durma) davran\u0131\u015f\u0131n\u0131n bir sonucudur.
\n*   Performans Farkl\u0131l\u0131klar\u0131:<\/strong> ListIterator<\/code>‘\u0131n performans\u0131, temel ald\u0131\u011f\u0131 List<\/code> implementasyonuna (\u00f6rne\u011fin ArrayList<\/code> veya LinkedList<\/code>) g\u00f6re de\u011fi\u015febilir. \u00d6zellikle add()<\/code> ve remove()<\/code> i\u015flemleri, ArrayList<\/code> i\u00e7in O(n) iken LinkedList<\/code> i\u00e7in O(1) olabilir.<\/p>\n
Performans ve ListIterator<\/h2>\n
ListIterator<\/code>‘\u0131n performans\u0131, temel ald\u0131\u011f\u0131 List<\/code> implementasyonuna g\u00f6re \u00f6nemli farkl\u0131l\u0131klar g\u00f6sterebilir. Java’daki en yayg\u0131n List<\/code> implementasyonlar\u0131 ArrayList<\/code> ve LinkedList<\/code>‘tir ve her birinin ListIterator<\/code> metotlar\u0131 \u00fczerindeki etkileri farkl\u0131d\u0131r.<\/p>\n
*   ArrayList<\/code> ile ListIterator:<\/strong>
\n    *   next()<\/code> ve previous()<\/code>: ArrayList<\/code> dahili olarak bir dizi kulland\u0131\u011f\u0131 i\u00e7in, elemanlara indeks \u00fczerinden do\u011frudan eri\u015fim O(1) zaman karma\u015f\u0131kl\u0131\u011f\u0131na sahiptir. ListIterator<\/code>‘\u0131n bu metotlar\u0131 da O(1) performans sunar, \u00e7\u00fcnk\u00fc sadece dahili bir indeks i\u015faret\u00e7isini g\u00fcncellerler.
\n    *   add(E e)<\/code>: Bir eleman eklemek, o noktadan sonraki t\u00fcm elemanlar\u0131n kayd\u0131r\u0131lmas\u0131n\u0131 gerektirece\u011finden O(n) zaman karma\u015f\u0131kl\u0131\u011f\u0131na sahiptir.
\n    *   remove()<\/code>: Bir eleman silmek de benzer \u015fekilde, silinen elemandan sonraki t\u00fcm elemanlar\u0131n kayd\u0131r\u0131lmas\u0131n\u0131 gerektirdi\u011finden O(n) zaman karma\u015f\u0131kl\u0131\u011f\u0131na sahiptir.
\n    *   set(E e)<\/code>: Mevcut bir eleman\u0131 de\u011fi\u015ftirmek, do\u011frudan indeks \u00fczerinden eri\u015fim oldu\u011fu i\u00e7in O(1) zaman karma\u015f\u0131kl\u0131\u011f\u0131na sahiptir.<\/p>\n
*   LinkedList<\/code> ile ListIterator:<\/strong>
\n    *   next()<\/code> ve previous()<\/code>: LinkedList<\/code> dahili olarak \u00e7ift ba\u011fl\u0131 bir liste yap\u0131s\u0131na sahiptir. ListIterator<\/code>, listenin mevcut d\u00fc\u011f\u00fcm\u00fcne bir referans tutar. Bu nedenle, next()<\/code> ve previous()<\/code> \u00e7a\u011fr\u0131lar\u0131 sadece bu referans\u0131 bir sonraki veya bir \u00f6nceki d\u00fc\u011f\u00fcme ta\u015f\u0131d\u0131\u011f\u0131ndan O(1) zaman karma\u015f\u0131kl\u0131\u011f\u0131na sahiptir.
\n    *   add(E e)<\/code>: Bir eleman eklemek, sadece mevcut d\u00fc\u011f\u00fcm\u00fcn ve yeni d\u00fc\u011f\u00fcm\u00fcn referanslar\u0131n\u0131 de\u011fi\u015ftirmeyi gerektirdi\u011finden O(1) zaman karma\u015f\u0131kl\u0131\u011f\u0131na sahiptir.
\n    *   remove()<\/code>: Bir eleman silmek de sadece ilgili d\u00fc\u011f\u00fcm\u00fcn referanslar\u0131n\u0131 de\u011fi\u015ftirmeyi gerektirdi\u011finden O(1) zaman karma\u015f\u0131kl\u0131\u011f\u0131na sahiptir.
\n    *   set(E e)<\/code>: Mevcut bir eleman\u0131n de\u011ferini de\u011fi\u015ftirmek, mevcut d\u00fc\u011f\u00fcme eri\u015fim O(1) oldu\u011fundan O(1) zaman karma\u015f\u0131kl\u0131\u011f\u0131na sahiptir.<\/p>\n
Sonu\u00e7:<\/strong> E\u011fer listenin ortas\u0131na s\u0131k s\u0131k eleman ekleme veya silme i\u015flemleri yapman\u0131z gerekiyorsa ve ListIterator<\/code> kullan\u0131yorsan\u0131z, LinkedList<\/code> genellikle ArrayList<\/code>‘ten daha iyi performans g\u00f6sterecektir. Ancak, sadece elemanlar \u00fczerinde dola\u015f\u0131m yap\u0131p okuma veya set()<\/code> ile de\u011fi\u015ftirme i\u015flemleri \u00e7o\u011funluktaysa, her iki liste t\u00fcr\u00fc de next()<\/code> ve previous()<\/code> i\u00e7in iyi performans sunar. ArrayList<\/code>, rastgele eri\u015fim (get(int index)<\/code>) i\u00e7in daha h\u0131zl\u0131d\u0131r, ancak ListIterator<\/code>‘\u0131n kendisi rastgele eri\u015fimden ziyade s\u0131ral\u0131 dola\u015f\u0131ma odaklan\u0131r.<\/p>\n
Sonu\u00e7<\/h2>\n
java.util.ListIterator<\/code>, Java Collections Framework’\u00fcnde List<\/code> aray\u00fcz\u00fcn\u00fc uygulayan koleksiyonlar i\u00e7in tasarlanm\u0131\u015f g\u00fc\u00e7l\u00fc ve esnek bir dola\u015f\u0131m ve manip\u00fclasyon arac\u0131d\u0131r. Iterator<\/code>‘\u0131n temel tek y\u00f6nl\u00fc dola\u015f\u0131m ve silme yeteneklerini a\u015farak, \u00e7ift y\u00f6nl\u00fc dola\u015f\u0131m, eleman ekleme, de\u011fi\u015ftirme ve indeks bilgisi sa\u011flama gibi kritik \u00f6zellikler sunar. Bu yetenekler, \u00f6zellikle dinamik liste manip\u00fclasyonlar\u0131, belirli bir noktadan hem ileri hem de geri y\u00f6nde gezinme veya liste elemanlar\u0131n\u0131 ko\u015fullu olarak g\u00fcncelleme gibi karma\u015f\u0131k senaryolarda ListIterator<\/code>‘\u0131 vazge\u00e7ilmez k\u0131lar.<\/p>\n
Makale boyunca ListIterator<\/code>‘\u0131n temel metotlar\u0131n\u0131 (hasNext()<\/code>, next()<\/code>, hasPrevious()<\/code>, previous()<\/code>, add()<\/code>, remove()<\/code>, set()<\/code>, nextIndex()<\/code>, previousIndex()<\/code>) detayl\u0131 \u00f6rneklerle inceledik. Ayr\u0131ca, Iterator<\/code> ile aras\u0131ndaki temel farklar\u0131 vurgulayarak, her birinin ne zaman tercih edilmesi gerekti\u011fini belirttik. ListIterator<\/code>‘\u0131n avantajlar\u0131, sa\u011flad\u0131\u011f\u0131 esneklik ve g\u00fcvenlik a\u00e7\u0131s\u0131ndan \u00f6nemliyken, IllegalStateException<\/code> ve ConcurrentModificationException<\/code> gibi potansiyel tuzaklara kar\u015f\u0131 dikkatli olunmas\u0131 gerekti\u011fi de belirtilmi\u015ftir. Performans m\u00fclahazalar\u0131 b\u00f6l\u00fcm\u00fcnde ise, ArrayList<\/code> ve LinkedList<\/code> gibi farkl\u0131 List<\/code> implementasyonlar\u0131 ile ListIterator<\/code> metotlar\u0131n\u0131n zaman karma\u015f\u0131kl\u0131klar\u0131 aras\u0131ndaki farklara de\u011finilmi\u015ftir.<\/p>\n
Sonu\u00e7 olarak, Java geli\u015ftiricileri, List<\/code> koleksiyonlar\u0131 \u00fczerinde ileri d\u00fczeyde kontrol ve manip\u00fclasyon gerektiren durumlarda ListIterator<\/code>‘\u0131 g\u00fcvenle kullanabilirler. Do\u011fru anla\u015f\u0131ld\u0131\u011f\u0131nda ve uyguland\u0131\u011f\u0131nda, ListIterator<\/code> kodunuzu daha temiz, daha verimli ve daha az hataya a\u00e7\u0131k hale getirecek g\u00fc\u00e7l\u00fc bir ara\u00e7t\u0131r.<\/p>\n
<\/body><\/p>\n","protected":false},"excerpt":{"rendered":"Java ListIterator: Koleksiyonlarda Daha G\u00fc\u00e7l\u00fc ve Esnek Dola\u015f\u0131m\nGiri\u015f\nJava’da koleksiyonlar (Collections Framework), veri yap\u0131lar\u0131n\u0131 depolam","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"csco_page_header_type":"","csco_page_load_nextpost":"","csco_page_subscribe_form":"","csco_page_contact_form":"","footnotes":""},"categories":[1408],"tags":[],"class_list":{"0":"post-32152","1":"post","2":"type-post","3":"status-publish","4":"format-standard","6":"category-java","7":"cs-entry","8":"cs-video-wrap"},"yoast_head":"\nJava ListIterator: Koleksiyonlarda Daha G\u00fc\u00e7l\u00fc ve Esnek Dola\u015f\u0131m - Kodlar\u0131n Gizemli D\u00fcnyas\u0131<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/fatihsoysal.com\/blog\/java-listiterator-koleksiyonlarda-daha-guclu-ve-esnek-dolasim\/\" \/>\n<meta property=\"og:locale\" content=\"tr_TR\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Java ListIterator: Koleksiyonlarda Daha G\u00fc\u00e7l\u00fc ve Esnek Dola\u015f\u0131m\" \/>\n<meta property=\"og:description\" content=\"Java ListIterator: Koleksiyonlarda Daha G\u00fc\u00e7l\u00fc ve Esnek Dola\u015f\u0131m Giri\u015f Java'da koleksiyonlar (Collections Framework), veri yap\u0131lar\u0131n\u0131 depolam\" \/>\n<meta property=\"og:url\" content=\"https:\/\/fatihsoysal.com\/blog\/java-listiterator-koleksiyonlarda-daha-guclu-ve-esnek-dolasim\/\" \/>\n<meta property=\"og:site_name\" content=\"Kodlar\u0131n Gizemli D\u00fcnyas\u0131\" \/>\n<meta property=\"article:published_time\" content=\"2025-10-18T06:41:00+00:00\" \/>\n<meta name=\"author\" content=\"Fatih Soysal\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Yazan:\" \/>\n\t<meta name=\"twitter:data1\" content=\"Fatih Soysal\" \/>\n\t<meta name=\"twitter:label2\" content=\"Tahmini okuma s\u00fcresi\" \/>\n\t<meta name=\"twitter:data2\" content=\"16 dakika\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/java-listiterator-koleksiyonlarda-daha-guclu-ve-esnek-dolasim\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/java-listiterator-koleksiyonlarda-daha-guclu-ve-esnek-dolasim\/\"},\"author\":{\"name\":\"Fatih Soysal\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"headline\":\"Java ListIterator: Koleksiyonlarda Daha G\u00fc\u00e7l\u00fc ve Esnek Dola\u015f\u0131m\",\"datePublished\":\"2025-10-18T06:41:00+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/java-listiterator-koleksiyonlarda-daha-guclu-ve-esnek-dolasim\/\"},\"wordCount\":2276,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"articleSection\":[\"Java\"],\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/fatihsoysal.com\/blog\/java-listiterator-koleksiyonlarda-daha-guclu-ve-esnek-dolasim\/#respond\"]}],\"copyrightYear\":\"2025\",\"copyrightHolder\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#organization\"}},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/java-listiterator-koleksiyonlarda-daha-guclu-ve-esnek-dolasim\/\",\"url\":\"https:\/\/fatihsoysal.com\/blog\/java-listiterator-koleksiyonlarda-daha-guclu-ve-esnek-dolasim\/\",\"name\":\"Java ListIterator: Koleksiyonlarda Daha G\u00fc\u00e7l\u00fc ve Esnek Dola\u015f\u0131m - Kodlar\u0131n Gizemli D\u00fcnyas\u0131\",\"isPartOf\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#website\"},\"datePublished\":\"2025-10-18T06:41:00+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/java-listiterator-koleksiyonlarda-daha-guclu-ve-esnek-dolasim\/#breadcrumb\"},\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/fatihsoysal.com\/blog\/java-listiterator-koleksiyonlarda-daha-guclu-ve-esnek-dolasim\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/java-listiterator-koleksiyonlarda-daha-guclu-ve-esnek-dolasim\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Anasayfa\",\"item\":\"https:\/\/fatihsoysal.com\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Java ListIterator: Koleksiyonlarda Daha G\u00fc\u00e7l\u00fc ve Esnek Dola\u015f\u0131m\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#website\",\"url\":\"https:\/\/fatihsoysal.com\/blog\/\",\"name\":\"Fatihsoysal.com\",\"description\":\"Blog - Yaz\u0131l\u0131m D\u00fcnyas\u0131 Tecr\u00fcbelerim\",\"publisher\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/fatihsoysal.com\/blog\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"tr\"},{\"@type\":[\"Person\",\"Organization\"],\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1\",\"name\":\"Fatih Soysal\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"tr\",\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/fatihsoysal.com\/blog\/wp-content\/uploads\/2024\/04\/cropped-replicate-prediction-3kgg1hgjn5rgp0cf0p5tr0jw7w-1.png\",\"contentUrl\":\"https:\/\/fatihsoysal.com\/blog\/wp-content\/uploads\/2024\/04\/cropped-replicate-prediction-3kgg1hgjn5rgp0cf0p5tr0jw7w-1.png\",\"width\":512,\"height\":512,\"caption\":\"Fatih Soysal\"},\"logo\":{\"@id\":\"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/image\/\"},\"description\":\"Kullan\u0131m ve kodlama m\u00fckemmeliyetini odak alan uygulamalar olu\u015fturma deneyimine sahip, profesyonel olarak 15+ y\u0131l \u00fczeri deneyime sahip bir yaz\u0131l\u0131m m\u00fchendisi.\",\"url\":\"https:\/\/fatihsoysal.com\/blog\/author\/fatihsoysal\/\"}]}<\/script>\n<!-- \/ Yoast SEO Premium plugin. -->","yoast_head_json":{"title":"Java ListIterator: Koleksiyonlarda Daha G\u00fc\u00e7l\u00fc ve Esnek Dola\u015f\u0131m - Kodlar\u0131n Gizemli D\u00fcnyas\u0131","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/fatihsoysal.com\/blog\/java-listiterator-koleksiyonlarda-daha-guclu-ve-esnek-dolasim\/","og_locale":"tr_TR","og_type":"article","og_title":"Java ListIterator: Koleksiyonlarda Daha G\u00fc\u00e7l\u00fc ve Esnek Dola\u015f\u0131m","og_description":"Java ListIterator: Koleksiyonlarda Daha G\u00fc\u00e7l\u00fc ve Esnek Dola\u015f\u0131m Giri\u015f Java'da koleksiyonlar (Collections Framework), veri yap\u0131lar\u0131n\u0131 depolam","og_url":"https:\/\/fatihsoysal.com\/blog\/java-listiterator-koleksiyonlarda-daha-guclu-ve-esnek-dolasim\/","og_site_name":"Kodlar\u0131n Gizemli D\u00fcnyas\u0131","article_published_time":"2025-10-18T06:41:00+00:00","author":"Fatih Soysal","twitter_card":"summary_large_image","twitter_misc":{"Yazan:":"Fatih Soysal","Tahmini okuma s\u00fcresi":"16 dakika"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/fatihsoysal.com\/blog\/java-listiterator-koleksiyonlarda-daha-guclu-ve-esnek-dolasim\/#article","isPartOf":{"@id":"https:\/\/fatihsoysal.com\/blog\/java-listiterator-koleksiyonlarda-daha-guclu-ve-esnek-dolasim\/"},"author":{"name":"Fatih Soysal","@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"headline":"Java ListIterator: Koleksiyonlarda Daha G\u00fc\u00e7l\u00fc ve Esnek Dola\u015f\u0131m","datePublished":"2025-10-18T06:41:00+00:00","mainEntityOfPage":{"@id":"https:\/\/fatihsoysal.com\/blog\/java-listiterator-koleksiyonlarda-daha-guclu-ve-esnek-dolasim\/"},"wordCount":2276,"commentCount":0,"publisher":{"@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"articleSection":["Java"],"inLanguage":"tr","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/fatihsoysal.com\/blog\/java-listiterator-koleksiyonlarda-daha-guclu-ve-esnek-dolasim\/#respond"]}],"copyrightYear":"2025","copyrightHolder":{"@id":"https:\/\/fatihsoysal.com\/blog\/#organization"}},{"@type":"WebPage","@id":"https:\/\/fatihsoysal.com\/blog\/java-listiterator-koleksiyonlarda-daha-guclu-ve-esnek-dolasim\/","url":"https:\/\/fatihsoysal.com\/blog\/java-listiterator-koleksiyonlarda-daha-guclu-ve-esnek-dolasim\/","name":"Java ListIterator: Koleksiyonlarda Daha G\u00fc\u00e7l\u00fc ve Esnek Dola\u015f\u0131m - Kodlar\u0131n Gizemli D\u00fcnyas\u0131","isPartOf":{"@id":"https:\/\/fatihsoysal.com\/blog\/#website"},"datePublished":"2025-10-18T06:41:00+00:00","breadcrumb":{"@id":"https:\/\/fatihsoysal.com\/blog\/java-listiterator-koleksiyonlarda-daha-guclu-ve-esnek-dolasim\/#breadcrumb"},"inLanguage":"tr","potentialAction":[{"@type":"ReadAction","target":["https:\/\/fatihsoysal.com\/blog\/java-listiterator-koleksiyonlarda-daha-guclu-ve-esnek-dolasim\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/fatihsoysal.com\/blog\/java-listiterator-koleksiyonlarda-daha-guclu-ve-esnek-dolasim\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Anasayfa","item":"https:\/\/fatihsoysal.com\/blog\/"},{"@type":"ListItem","position":2,"name":"Java ListIterator: Koleksiyonlarda Daha G\u00fc\u00e7l\u00fc ve Esnek Dola\u015f\u0131m"}]},{"@type":"WebSite","@id":"https:\/\/fatihsoysal.com\/blog\/#website","url":"https:\/\/fatihsoysal.com\/blog\/","name":"Fatihsoysal.com","description":"Blog - Yaz\u0131l\u0131m D\u00fcnyas\u0131 Tecr\u00fcbelerim","publisher":{"@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/fatihsoysal.com\/blog\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"tr"},{"@type":["Person","Organization"],"@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/002a254750921dcfd568a99e48240dd1","name":"Fatih Soysal","image":{"@type":"ImageObject","inLanguage":"tr","@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/image\/","url":"https:\/\/fatihsoysal.com\/blog\/wp-content\/uploads\/2024\/04\/cropped-replicate-prediction-3kgg1hgjn5rgp0cf0p5tr0jw7w-1.png","contentUrl":"https:\/\/fatihsoysal.com\/blog\/wp-content\/uploads\/2024\/04\/cropped-replicate-prediction-3kgg1hgjn5rgp0cf0p5tr0jw7w-1.png","width":512,"height":512,"caption":"Fatih Soysal"},"logo":{"@id":"https:\/\/fatihsoysal.com\/blog\/#\/schema\/person\/image\/"},"description":"Kullan\u0131m ve kodlama m\u00fckemmeliyetini odak alan uygulamalar olu\u015fturma deneyimine sahip, profesyonel olarak 15+ y\u0131l \u00fczeri deneyime sahip bir yaz\u0131l\u0131m m\u00fchendisi.","url":"https:\/\/fatihsoysal.com\/blog\/author\/fatihsoysal\/"}]}},"yoast_meta":{"yoast_wpseo_title":"","yoast_wpseo_metadesc":"","yoast_wpseo_canonical":""},"amp_enabled":true,"_links":{"self":[{"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/posts\/32152","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/comments?post=32152"}],"version-history":[{"count":1,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/posts\/32152\/revisions"}],"predecessor-version":[{"id":32153,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/posts\/32152\/revisions\/32153"}],"wp:attachment":[{"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/media?parent=32152"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/categories?post=32152"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/fatihsoysal.com\/blog\/wp-json\/wp\/v2\/tags?post=32152"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}