{"id":418,"date":"2018-07-19T18:06:31","date_gmt":"2018-07-19T18:06:31","guid":{"rendered":"http:\/\/www.yazilimperver.com\/?p=418"},"modified":"2018-07-26T14:30:18","modified_gmt":"2018-07-26T14:30:18","slug":"modern-c-6-lambda-ifadeleri","status":"publish","type":"post","link":"https:\/\/www.yazilimperver.com\/index.php\/2018\/07\/19\/modern-c-6-lambda-ifadeleri\/","title":{"rendered":"Modern C++ (6) : Lambda \u0130fadeleri"},"content":{"rendered":"

Evet arkada\u015flar, C++ yaz\u0131lar\u0131m\u0131za kald\u0131\u011f\u0131m\u0131z yerden devam ediyoruz.<\/p>\n

Lambda yaz\u0131m ile temel C++ 11 \u00f6zelliklerini tamamlam\u0131\u015f olaca\u011f\u0131z. Sonras\u0131nda belki STL i\u00e7in de bir yaz\u0131 yaz\u0131p, daha sonra C++ 14\/17\/20’e yelken a\u00e7abiliriz. Asl\u0131nda olduk\u00e7a geni\u015f konu, fakat ben bu yaz\u0131mda sizlere temel noktalar\u0131 aktarmaya \u00e7al\u0131\u015faca\u011f\u0131m. \u00d6ncelikle\u00a0 benim gibi bilgisayar bilimleri ile u\u011fra\u015fanlar\u0131m\u0131z Lambda denilince hemen akl\u0131n\u0131za Lambda calculus gelecektir ve bunlar aras\u0131nda bir ili\u015fki var m\u0131 diye de d\u00fc\u015f\u00fcnebilirsiniz. K\u0131sa cevap: bir Lisp kadar ilintili de\u011fil ama uzun cevap i\u00e7in a\u015fa\u011f\u0131daki sonu\u00e7lar\u0131 i\u00e7in google amcam\u0131za dan\u0131\u015fabiliriz<\/a>. Bu arada Lisp “Lambda Calculus” ‘\u0131n ger\u00e7ek anlamda bir ger\u00e7eklemesi ve dilin b\u00fct\u00fcn yap\u0131s\u0131 zaten jenerik programlamay\u0131 kolayla\u015ft\u0131rmaya y\u00f6nelik tasarlanm\u0131\u015ft\u0131r.<\/p>\n

Ayr\u0131ca “Lambda Calculus” ile ilgili de referanslar b\u00f6l\u00fcm\u00fcne bir ka\u00e7 kaynak ekliyorum [6]. Bu konuda daha derinlemesine bilgi almak isteyen arkada\u015flar\u0131m oraya y\u00f6nelebilirler.<\/p>\n

Lambda \u0130fadeleri<\/span><\/strong><\/h2>\n

Gelelim as\u0131l mevzumuza Lambda \u0130fadeleri<\/em>. Hepimiz yaz\u0131l\u0131m geli\u015ftirirken \u00e7e\u015fitli i\u015fler i\u00e7in k\u0131sa k\u0131sa metotlar ve fonksiyonlar yazma ihtiyac\u0131 duymu\u015fuzdur, hele de STL ile ha\u015f\u0131r ne\u015firseniz, \u00f6zellikle STL algoritma k\u00fct\u00fcphanesinde bu tarz kullan\u0131mlara \u00e7ok s\u0131k ihtiya\u00e7 duyars\u0131n\u0131z. Bunlar bir iki tane olunca s\u0131k\u0131nt\u0131 olmasa da, say\u0131lar\u0131 artt\u0131k\u00e7a hem kod bu tarz sat\u0131rlarla dolmakta, okunabilirlik azalmakta ve de bu kodlar\u0131n idamesi zorla\u015fmaktad\u0131r. \u0130\u015fte C++ 11 ile gelen Lambda ifadeleri ile art\u0131k:
\n– Kullan\u0131lacak olan fonksiyonlar ihtiya\u00e7 duyulan yerlerde tan\u0131mlayabilir,
\n– Yukar\u0131dan a\u015fa\u011f\u0131ya olan mant\u0131ksal ve do\u011fal ak\u0131\u015f\u0131 koruyabilir (fonksiyonlar genelde farkl\u0131 yerlerde tan\u0131mlan\u0131rlar, bu sebeple git geller okunabilirli\u011fi d\u00fc\u015f\u00fcrebiliyor. \u00d6zellikle tek seferlik),
\n– Mevcut kapsam i\u00e7erisindeki de\u011fi\u015fkenlere de eri\u015fim sunulabilmektedir.<\/p>\n

Lambda ifadelerini tan\u0131mlayacak olursak. Lambda ifadeleri k\u0131saca anonim fonksiyon<\/strong><\/em> olarak ifade edilebilir. Hatta baz\u0131 kaynaklar (cppreference) “Mevcut kapsamdaki de\u011fi\u015fkenleri
\nyakalayabilen isimsiz fonksiyon nesneleri olarak da tan\u0131mlar”. Bir di\u011fer deyi\u015fle, lambda ifadeleri asl\u0131nda \u00e7a\u011fr\u0131labilecek olan bir kod birimini ifade etmektedirler. C++’dan \u00f6nce asl\u0131nda Haskell, C#, Java gibi bir \u00e7ok dilde buna benzer, ihtiya\u00e7 duyulan yerde fonksiyon tan\u0131mlamas\u0131na olanak sa\u011flayan yap\u0131lar sunulmaktayd\u0131 (tam ya da daha geni\u015f bir liste i\u00e7in Wikipedia<\/a> ya alal\u0131m sizi).<\/p>\n

Merakl\u0131lar i\u00e7in lambdalar\u0131n alt\u0131nda yatan mekanizmay\u0131 (derleyici lambda ifadelerini nas\u0131l anlamland\u0131r\u0131yor veya arkada \u00fcretilen kod nedir, performansa bir etkisi var m\u0131 vs.) yaz\u0131m\u0131n sonuna ekledi\u011fim ayr\u0131 bir b\u00f6l\u00fcmde anlataca\u011f\u0131m.<\/p>\n

Lambda ifadelerinin genel \u015fablonu a\u015fa\u011f\u0131daki gibi \u00f6zetlenebilir. Burada * ile i\u015faretlenen k\u0131s\u0131mlar opsiyonel olan par\u00e7alard\u0131r.<\/p>\n

[ Yakalama Tan\u0131mlar\u0131 ] *(Parametreler) *mutable -> d\u00f6n\u00fc\u015f tipi*\r\n{\r\n     lambda i\u015flevi tan\u0131mlamas\u0131\r\n}<\/pre>\n
Detaylara inmeden \u00f6nce a\u015fa\u011f\u0131da basit baz\u0131 lambda tan\u0131mlamalar\u0131 ve bunlar\u0131n nas\u0131l \u00e7a\u011fr\u0131ld\u0131\u011f\u0131na ili\u015fkin bir ka\u00e7 \u00f6rnek sizlere aktaray\u0131m.<\/p>\n
#include <iostream>\r\nusing namespace std;\r\n \r\nint main()\r\n{\r\n    \/\/ Parametre almayan ve d\u00f6n\u00fc\u015f yapmayan bir lambda ifadesi\r\n    auto lambda = []() { cout << \"Lambda ifadesi i\u00e7eren kod!\" << endl; };\r\n    lambda();\r\n    \r\n    \/\/ Yukar\u0131daki ifade ile a\u015fa\u011f\u0131daki ifadeler tamamen ayn\u0131 i\u015fi yap\u0131yorlar\r\n    \/\/ auto lambda = [] { cout << Code within a lambda expression\" << endl; };\r\n    \/\/ auto lambda = [](void) { cout << Code within a lambda expression\" << endl; }; \r\n    \/\/ auto lambda = [](void) -> void { cout << \"Code within a lambda expression\" << endl; };\r\n   \r\n    \/\/ \u0130ki parametre alan bir lambda ifadesi \u00f6rne\u011fi\r\n    auto sum = [](int x, int y) { return x + y; };\r\n    cout << sum(5, 2) << endl;\r\n    \r\n    \/\/ Ayr\u0131ca lambda ifadelerini direk \u00e7a\u011fr\u0131ld\u0131\u011f\u0131 yerde de tan\u0131mlayabilirsiniz\r\n    cout << [](int x, int y) { return x + y; }(5, 2) << endl;\r\n}<\/pre>\n
Yukar\u0131da auto de\u011fi\u015fkenleri i\u00e7erisinde lambda ifadelerine ili\u015fkin i\u015faret\u00e7iler tutulmakta. Bir de STL’e ili\u015fkin \u00f6rne\u011fe bakal\u0131m hemen. \u00d6nce STL de mevcut durumda 5 ten b\u00fcy\u00fck say\u0131lar\u0131 nas\u0131l sayd\u0131raca\u011f\u0131m\u0131za bakal\u0131m:<\/p>\n
#include <iostream>\r\n#include <algorithm>\r\n#include <vector>\r\nusing namespace std;\r\n\/\/ Bunun yerine fonksiyon nesnesi de olu\u015fturabilirsiniz\r\nbool is_greater_than_5(int value)\r\n{\r\n      return (value > 5);\r\n}\r\n\r\nint main()\r\n{\r\n        vector<int> numbers { 1, 2, 3, 4, 5, 10, 15, 20, 25, 35, 45, 50 };\r\n\r\n        \/\/ Besten buyuk say\u0131lar\u0131 say\r\n        auto greater_than_5_count = count_if(numbers.begin(), numbers.end(), is_greater_than_5);\r\n\r\n        cout << \"5 ten buyuk sayi adeti: \" << greater_than_5_count << endl;\r\n}<\/pre>\n
\u015eimdi de ayn\u0131 i\u015fi lambdalar ile yapal\u0131m. Siz hangisi tercih edersiniz \ud83d\ude42<\/p>\n
#include <iostream>\r\n#include <algorithm>\r\n#include <vector>\r\nusing namespace std;\r\n\r\nint main()\r\n{\r\n       vector<int> numbers { 1, 2, 3, 4, 5, 10, 15, 20, 25, 35, 45, 50 }; \r\n\r\n       \/\/ Besten buyuk say\u0131lar\u0131 say\r\n       cout << \"5 ten buyuk sayi adeti: \" << count_if(numbers.begin(), numbers.end(), [](int x) { return (x > 5); })  << endl;\r\n}<\/pre>\n
\u015eimdi biraz daha derinlere inebiliriz. \u00d6nce lambdalar ile de\u011fi\u015fken yakalama mekanizmas\u0131na bakaca\u011f\u0131z daha sonra da parametre ge\u00e7irme ve d\u00f6n\u00fc\u015f mekanizmalar\u0131n\u0131 inceleyece\u011fiz. Bu arada lambda ifadelerinin arka plan\u0131 i\u00e7in ise son b\u00f6l\u00fcme ba\u015fvurabilirsiniz.<\/p>\n
Lambda ifadeleri ile de\u011fi\u015fken yakalama (“Variable Capture Mechanism”):<\/span><\/strong><\/h2>\n
Normal fonksiyonlardan farkl\u0131 olarak lambda ifadeleri, mevcut tan\u0131mland\u0131\u011f\u0131 blokta\/kapsamda (“scope”) tan\u0131mlanm\u0131\u015f olan de\u011fi\u015fkenlere de eri\u015fim sa\u011flayabilmektedir. Buna “Variable Capture Mechanism”<\/strong> di\u011fer bir ifade ile De\u011fi\u015fkenleri Yakalama Mekanizmas\u0131<\/em> diyebiliriz.<\/p>\n
Bu mekanizma ile a\u015fa\u011f\u0131daki \u015fekillerde de\u011fi\u015fkenleri yakalayabiliriz:
\n– De\u011fer\/Kopya yakalama<\/em> (“Capture by value”)
\n– Referans yakalama<\/em> (“Capture by reference”)
\n– Hem de\u011fer hem de referans yakalama<\/em> (“Capture by both value and reference (mixed capture) “)<\/p>\n
Detaylar\u0131n\u0131 \u00f6rnekler ile a\u015fa\u011f\u0131da anlataca\u011f\u0131m ama \u00f6zetleme ad\u0131na bu kullan\u0131mlara ili\u015fkin yaz\u0131m \u015fekillerinin \u00f6zetini a\u015fa\u011f\u0131da bulabilirsiniz:<\/p>\n
    \n
  1. [&]<\/strong> : tan\u0131mland\u0131\u011f\u0131 kapsam i\u00e7erisindeki b\u00fct\u00fcn de\u011fi\u015fkenlerin referanslar\u0131<\/em> <\/strong>yakalan\u0131r\/kullan\u0131labilir (capture all external variables by reference)<\/li>\n
  2. [=]<\/strong> : tan\u0131mland\u0131\u011f\u0131 kapsam i\u00e7erisindeki b\u00fct\u00fcn de\u011fi\u015fkenlerin<\/strong> kopyalar\u0131<\/strong><\/em> yakalan\u0131r\/kullan\u0131labilr (capture all external variables by value)<\/li>\n
  3. [a, &b]<\/strong> : a<\/strong> de\u011fi\u015fkeninin kopyas\u0131n\u0131, b<\/strong> de\u011fi\u015fkeninin de referans\u0131n\u0131 yakalar\/kullan\u0131r<\/li>\n
  4. []<\/strong> : herhangi bir ortam de\u011fi\u015fkeni yakalanmaz ve sadece lambda ifadeleri i\u00e7erisindeki yerel de\u011fi\u015fkenlere eri\u015fiminiz olur<\/li>\n<\/ol>\n
    \u015eimdi bu zamana kadar yazd\u0131klar\u0131m\u0131za ili\u015fkin yakama \u00f6rnekleri \u00fczerinden kullan\u0131mlar\u0131na bakal\u0131m.<\/p>\n
    int x=1, y=1, z=1;\r\n\r\n\/\/ 1. Ornek\r\n[ ] ( ) { cout << \u201cExample 1\u201d; } ( );\r\n\r\n\/\/ 2. Ornek\r\n[ ] ( ) { cout << x; } ();\r\n\r\n\/\/ 3. Ornek\r\n[x] ( ) { cout << x+1; } ();\r\n\r\n\/\/ 4. Ornek\r\n[=] ( ) { cout << x << y; } ();\r\n\r\n\/\/ 5. Ornek\r\nauto tmp = [ ] ( ) { cout << \"merhaba\"; } ();<\/pre>\n
    Yukar\u0131daki 1. \u00f6rnekte herhangi bir de\u011fi\u015fken yakalanmad\u0131\u011f\u0131 duruma \u00f6rnek (kullan\u0131m 4). 2. \u00f6rnek ise ge\u00e7erli bir tan\u0131mlama de\u011fil, \u00e7\u00fcnk\u00fc x<\/strong> de\u011fi\u015fkeni lambda ifadesine herhangi bir \u015fekilde ge\u00e7irilmemi\u015f. 3. \u00f6rnek bir \u00f6nceki \u00f6rne\u011fin ge\u00e7erli hali ve sadece kopyas\u0131n\u0131n ge\u00e7irildi\u011fi duruma \u00f6rnek te\u015fkil etmektedir. 4. \u00f6rnek de benzer \u015fekilde z<\/strong> d\u0131\u015f\u0131ndaki b\u00fct\u00fcn de\u011fi\u015fkenler lambda ifadesi i\u00e7erisine kopyalanarak ge\u00e7irilmekte. z<\/strong> kullan\u0131lmad\u0131\u011f\u0131 i\u00e7in ge\u00e7irilmemektedir. Son \u00f6rnek te ge\u00e7erli bir sat\u0131r de\u011fil. Neden sizce? Biraz d\u00fc\u015f\u00fcn\u00fcn sebebi yaz\u0131n\u0131n sonunda (ipucu di\u011fer sat\u0131rlardan fark\u0131 nedir “()” ne yapar).<\/p>\n
    \u015eimdi biraz da de\u011fi\u015fkenlerin referans olarak yakalanmas\u0131na ili\u015fkin bir ka\u00e7 \u00f6rnek inceleyelim.<\/p>\n
    int x=1, y=1, z=1;\r\n\r\n\/\/ B\u00fct\u00fcn de\u011fi\u015fkenler referans olarak ge\u00e7irilmekte\r\n[&] ( ) { cout << x << y << z; }( );\r\n\r\n\/\/ z referans olarak ge\u00e7irilmekte, di\u011ferlerinin kopyas\u0131 ge\u00e7irilmekte\r\n[=,&z] ( ) { z = x + y; }( );\r\n\r\n\/\/ x 'in kopyas\u0131 ge\u00e7irilmekte, di\u011ferleri referans olarak ge\u00e7irilmekte\r\n[&,x] ( ) { y = x; z = x; }( );<\/pre>\n
    Bu kullan\u0131mlar\u0131n yan\u0131nda lambda ifadelerini s\u0131n\u0131f metotlar\u0131 i\u00e7erisinde de kullanabilirsiniz. Fakat burada bir hususa dikkat etmeniz gerekiyor. Lambdalar\u0131n her bir i\u00e7in derleyici \u00f6zel ve ayr\u0131 bir s\u0131n\u0131f olu\u015fturmakta ve bu sebeple \u00e7al\u0131\u015fma zaman\u0131nda hepsinin kendi kapsamlar\u0131 oluyor. Bir di\u011fer ifade ile s\u0131n\u0131f metotlar\u0131 i\u00e7erisindeki lambda ifadeleri i\u00e7erisinde bulunduklar\u0131 s\u0131n\u0131f de\u011fi\u015fkenlerine ula\u015famazlar.\u00a0 Bunun i\u00e7in ilgili s\u0131n\u0131f\u0131n i\u015faret\u00e7isi “this”<\/em> ile ge\u00e7irilmesi gerekmektedir.\u00a0 Hemen bir \u00f6rnek ile inceleyelim:<\/p>\n
    class Filtreleyici\r\n{\r\npublic:\r\n   Filtreleyici(vector<int>& src) : mDataToFilter(src)\r\n   {\r\n   }\r\n   \r\n   void Filter()\r\n   {\r\n       remove_if(mDataToFilter.begin(), mDataToFilter.end(), \r\n                [this](int i){ return ( i < mFilterReference); });\r\n                \/\/ Asagidaki kullanim gecerli degil\r\n                \/\/ [](int i){ return ( i < mFilterReference); });\r\nprivate:\r\n    vector<int> mDataToFilter;\r\n    int mFilterReference;\r\n};<\/pre>\n
    Parametre Ge\u00e7irme ve D\u00f6n\u00fc\u015f De\u011ferleri:<\/span><\/strong><\/h2>\n
    Kapsam yakalama ve de\u011fi\u015fkenlerin lambda ifadelerine ge\u00e7irilmelerinden sonra lambda ifadelerine parametrelerin ge\u00e7irilmesi hususuna e\u011filelim. Daha \u00f6nce de bahsetti\u011fim gibi lambda ifadelerine normal fonksiyonlar gibi parametreler ge\u00e7irebiliyoruz. Lambda ifadeleri i\u00e7in de normal fonksiyonlara uygulanan parametre ge\u00e7irme kurallar\u0131 uygulanmakta. C++ 14 e kadar normal fonksiyonlardan farkl\u0131 olarak varsay\u0131lan parametre de\u011ferlerini lambdalarda kullanam\u0131yoruz, C++ 14 de bu k\u0131s\u0131tlama da ortadan kalkmakta. Lambda ifadelerindeki parantezlerde asl\u0131nda iste\u011fe ba\u011fl\u0131 e\u011fer herhangi bir parametre ge\u00e7irilmiyor ise “[] {}” tamamen ge\u00e7erli bir kullan\u0131m (hatta en basit kullan\u0131m diyebiliriz).<\/p>\n
    Lambda ifadelerinde normal fonksiyonlarda oldu\u011fu gibi de\u011ferler d\u00f6n\u00fclebilmektedir. Fonksiyonlardan farkl\u0131 olarak, lambdalarda d\u00f6n\u00fc\u015f de\u011ferleri direk ifade edilebilmeleri yan\u0131nda derleyici taraf\u0131ndan otomatik olarak da belirlenebiliyor. E\u011fer lambda tan\u0131mlamas\u0131 i\u00e7erisinde birden fazla d\u00f6n\u00fc\u015f ifadesi var ise ya da d\u00f6n\u00fc\u015f tipi \u00e7\u0131kar\u0131m\u0131nda bulunamayaca\u011f\u0131 durumlarda d\u00f6n\u00fc\u015f tipi de lambda ifadesinde belirtilmelidir.\u00a0 Ayr\u0131ca yaz\u0131lan kodta bir d\u00f6n\u00fc\u015f i\u015flemi “return deyimi” yok ise lambda i\u015flevin geri d\u00f6n\u00fc\u015f de\u011ferinin t\u00fcr\u00fc void kabul edilir.<\/p>\n
    Not olarak lambda ifadelerinde throw<\/strong> <\/em>kullan\u0131m\u0131 da m\u00fcmk\u00fcn (normal C++ standard\u0131nda throw kullan\u0131m\u0131 “depreceated” olarak i\u015faretlense de dilden tamamen hen\u00fcz \u00e7\u0131kar\u0131lmad\u0131).<\/p>\n
    \u015eimdi bu son hususlara ili\u015fkin \u00f6rnek kodlar\u0131 inceleyelim:<\/p>\n
    \/\/ \u0130ki tane kopyalama y\u00f6ntemi kullan\u0131larak parametreler ge\u00e7iriliyor\r\n\/\/ Bu durum i\u00e7in d\u00f6n\u00fc\u015f de\u011feri belirtmeye gerek yok (int olarak derleyici kendisi bu \u00e7\u0131kar\u0131mda bulunabilir)\r\n[ ] (int x, int y) {return x + y; } (1,2);\r\n\r\n\/\/ Hatal\u0131 ifade\r\n\/\/ \u0130lk parametre referans olarak ge\u00e7irilece\u011fi ifade edilmi\u015f ve bu rvalue parametreye sabit bir de\u011fer ge\u00e7irilmi\u015f\r\n[ ] (int &x, int y) {return x + y; } (1,2);\r\n\r\n\/\/ Lambda ifadesi ilk parametreyi sabit referans olarak al\u0131yor ikincinin ise kopyas\u0131n\u0131 al\u0131yor\r\n\/\/ Bu durumda da d\u00f6n\u00fc\u015f tipi belirtilmeli\r\n[ ] (const int &x, int y) -> int {int z = 3; return x + y + z; } (1,2);\r\n\r\n\/\/ Yerel de tan\u0131mlanm\u0131\u015f bir de\u011fi\u015fken referans olarak d\u00f6n\u00fclm\u00fc\u015f (tabi bu do\u011fru ve tercih edilen bir kullan\u0131m de\u011fil ;)\r\n[ ] (int x, int y) -> int& {int z = 0; return z; } (1,2);\r\n\r\nBirazda d\u00f6n\u00fc\u015f de\u011ferlerine ili\u015fkin \u00f6rnekleri inceleyelim:\r\n\/\/ A\u00e7\u0131k\u00e7a d\u00f6n\u00fc\u015f de\u011feri belirtildi\u011fi durum\r\nint p1 = [ ] (int x, int y) -> int {return x+y;} (1,2);\r\n\r\n\/\/ D\u00f6n\u00fc\u015f de\u011feri belirtilmeyen durumlar. Burada derleyici tipi belirliyor (int)\r\nint p2 = [ ] (int x, int y) -> {return x+y;}(1,2);\r\n\r\n\/\/ Derleme hatas\u0131. Belirtilen ve d\u00f6n\u00fclen tipler aras\u0131nda uyumsuzluk var\r\nint p4 = [ ] () -> int {return false;}();\r\n\r\n\/\/ Derleme hatas\u0131. Belirtilen kodtan d\u00f6n\u00fc\u015f de\u011ferinin belirlenmesi m\u00fcmk\u00fcn de\u011fil.\r\n\/\/ A\u00e7\u0131k\u00e7a tipinin ifade edilmesi gerekiyor\r\nint p5 = [ ] (int x) { if x > 5 return x; else return true;}(1);<\/pre>\n
    STL Kullan\u0131m:<\/span><\/strong><\/h2>\n
    Yukar\u0131da asl\u0131nda STL’e kullan\u0131ma ili\u015fkin bir ka\u00e7 \u00f6rnek vermeye \u00e7al\u0131\u015ft\u0131m. A\u015fa\u011f\u0131da \u00e7ok bilindik s\u0131ralama fonksiyonu i\u00e7in olan kullan\u0131ma bakal\u0131m:<\/p>\n
    \/\/ Klasik yakla\u015f\u0131m\r\nclass comparator\r\n{\r\n   public:\r\n     \r\n     bool operator() (int x, int y) const\r\n     {\r\n         return x > y;\r\n     }\r\n};\r\n\r\nsort (v.begin(), v.end(), comparator());\r\n\r\n\/\/ Lambda kullan\u0131m\u0131 ile gelen yeni yakla\u015f\u0131m\r\nsort(v.begin(), v.end(), [ ] (int x, int y) { return x > y;});\r\n<\/pre>\n
    Bu kullan\u0131m yan\u0131nda lambda ifadeleri \u015fablonlara (“template”) parametre olarak ta ge\u00e7irilebilirler. A\u015fa\u011f\u0131da buna ili\u015fkin bir \u00f6rnek kullan\u0131m g\u00f6rebilirsiniz:<\/p>\n
    #include <set>\r\n#include <functional>\r\n#include <iostream>\r\n\r\nint main()\r\n{\r\n    \/\/ recommended \r\n    std::set< int, std::function< bool(int,int) > > exampleSetWithLambda([] ( int x, int y ) { return x > y ; } ) ; \r\n    exampleSetWithLambda.insert(2);\r\n    exampleSetWithLambda.insert(1);\r\n    exampleSetWithLambda.insert(5);\r\n    \r\n    std::cout << \"Sirali:\" << std::endl;\r\n    for(auto item : exampleSetWithLambda)    \r\n    {\r\n        std:: cout << item << \" \";\r\n    }\r\n    \r\n     std::cout<< std::endl;\r\n    \r\n    std::set< int > exampleSetWithNoLambda; \r\n    exampleSetWithNoLambda.insert(2);\r\n    exampleSetWithNoLambda.insert(1);\r\n    exampleSetWithNoLambda.insert(5);\r\n    std::cout<< \"Sirasiz:\" << std::endl;\r\n    for(auto item : exampleSetWithNoLambda)    \r\n    {\r\n        std:: cout << item << \" \";\r\n    }\r\n}<\/pre>\n
    Bunlar\u0131n yan\u0131nda std::function kullanarak lambda lari metotlara da ge\u00e7irebilirsiniz.<\/p>\n
    C++ Lambda lar\u0131n\u0131n \u00c7al\u0131\u015fma Mekanizmas\u0131<\/span><\/strong><\/h2>\n
    Lambda’lar yaz\u0131m\u0131n ba\u015f\u0131nda da bahsetti\u011fim \u00fczere asl\u0131nda \u00e7a\u011fr\u0131labilir k\u00fc\u00e7\u00fck kod par\u00e7alar\u0131 olarak adland\u0131rabiliyor. Di\u011fer fonksiyonlardan farkl\u0131 olarak i\u00e7erisinde bulundu\u011fu kapsamda tan\u0131ml\u0131 olan de\u011fi\u015fkenlere eri\u015fim de sa\u011flayabilmekte. Peki mevcut mekanizmalardan fark\u0131 nedir? Yani normal fonksiyon, functor s\u0131n\u0131flar\u0131ndan ( operator() tan\u0131mlayan s\u0131n\u0131flar) ne fark\u0131 var? Bu ba\u015fl\u0131kta buna bakaca\u011f\u0131z.<\/p>\n
    Basit olarak asl\u0131nda siz bir lambda tan\u0131mlamas\u0131 yapt\u0131\u011f\u0131n\u0131z zaman, derleyici arka planda sizler i\u00e7in bir “functor” s\u0131n\u0131f\u0131 olu\u015fturuyor. Bu s\u0131n\u0131flar\u0131n her biri e\u015fsiz ve her tan\u0131mlama i\u00e7in ayr\u0131 ayr\u0131 olu\u015fturuluyor. \u00d6rne\u011fin:<\/p>\n
    [](X& elem) { elem.op(); }<\/pre>\n
    i\u00e7in derleyici:<\/p>\n
    class _DerleyiciTarafindanAtanmisIsim_\r\n{\r\npublic:\r\nvoid operator()(X& elem) const\r\n{\r\nelem.op();\r\n}\r\n};<\/pre>\n
    tan\u0131m\u0131 olu\u015fturuyor. Bu bir anlamda “syntatic sugar<\/em>” dedi\u011fimiz yani i\u015fimiz kolayla\u015ft\u0131ran bir mekanizma olarak d\u00fc\u015f\u00fcnebiliriz. \u015eimdi biraz daha derine inelim ve assembly kodlar\u0131n\u0131 kar\u015f\u0131la\u015ft\u0131ral\u0131m :).<\/p>\n
    \u00d6nce hi\u00e7 bir de\u011fi\u015fkenin yakalanmad\u0131\u011f\u0131 duruma bakal\u0131m. Bu arada bu kodlar (x86-64 gcc 8.2 derleyicisinden<\/strong><\/em> \u00e7\u0131kan kodlar).<\/p>\n
    int function (int a)\r\n{\r\n\u00a0 \u00a0 return a + 3;\r\n}\r\n\r\nclass Functor {\r\npublic:\r\nint operator()(int a)\r\n{\r\nreturn a + 3;\r\n}\r\n};\r\n\r\nint main()\r\n{\r\nauto lambda = [] (int a) { return a + 3; };\r\n\r\nFunctor functor;\r\n\r\nvolatile int y1 = function(5);\r\nvolatile int y2 = functor(5);\r\nvolatile int y3 = lambda(5);\r\n\r\nreturn 0;\r\n}<\/pre>\n
    Normal fonksiyon tan\u0131m\u0131 i\u00e7in a\u015fa\u011f\u0131daki gibi bir kod \u00fcretilmekte:<\/p>\n
    traditionalFunction(int):\r\npush rbp\r\nmov rbp, rsp\r\nmov DWORD PTR [rbp-4], edi\r\nmov eax, DWORD PTR [rbp-4]\r\nadd eax, 3\r\npop rbp\r\nret<\/pre>\n
    “Functor” i\u00e7in ise a\u015fa\u011f\u0131daki gibi kod \u00fcretilmekte:<\/p>\n
    Functor::operator()(int):\r\npush rbp\r\nmov rbp, rsp\r\nmov QWORD PTR [rbp-8], rdi\r\nmov DWORD PTR [rbp-12], esi\r\nmov eax, DWORD PTR [rbp-12]\r\nadd eax, 3\r\npop rbp\r\nret<\/pre>\n
    Lambda i\u00e7in ise a\u015fa\u011f\u0131daki gibi:<\/p>\n
    main::{lambda(int)#1}::operator()(int) const:\r\npush rbp\r\nmov rbp, rsp\r\nmov QWORD PTR [rbp-8], rdi\r\nmov DWORD PTR [rbp-12], esi\r\nmov eax, DWORD PTR [rbp-12]\r\nadd eax, 3\r\npop rbp\r\nret<\/pre>\n
    herhangi bir de\u011fi\u015fken yakalanmad\u0131\u011f\u0131 durumda g\u00f6r\u00fclece\u011fi \u00fczere “functor” ile lambda ifadelerine ili\u015fkin \u00fcretilen kod ayn\u0131. Standart metot ile ise ufak bir fark var.<\/p>\n
    \u015eimdi ortam de\u011fi\u015fkenlerini kopyalayarak yakalama durumunu inceleyelim. Bu durumda normal metotlar\u0131 kullanamayaca\u011f\u0131z. Sadece “functor” lar ile lambdalar\u0131 kar\u015f\u0131la\u015ft\u0131raca\u011f\u0131z.<\/p>\n
    class Functor\r\n{\r\npublic:\r\nFunctor(const int x)\r\n: m_x(x)\r\n{\r\n\r\n}\r\n\r\nint operator()(int a)\r\n{\r\nreturn a + m_x;\r\n}\r\n\r\nprivate:\r\nint m_x;\r\n};\r\n\r\nint main()\r\n{\r\nint x = 3;\r\n\r\nauto lambda = [=] (int a) { return a + x; };\r\nFunctor functor(x);\r\n\r\nvolatile int y1 = functor(5);\r\nvolatile int y2 = lambda(5);\r\n\r\nreturn 0;\r\n}<\/pre>\n
    Burada fonksiyon nesneleri i\u00e7in bizi ilgilendiren iki metot var. Bunlar yap\u0131c\u0131<\/em> ve () operat\u00f6r\u00fc<\/em>. \u015eimdi bunlar i\u00e7in
    \n\u00fcretilen kodlara bakal\u0131m:<\/p>\n
    Functor::Functor(int):\r\npush rbp\r\nmov rbp, rsp\r\nmov QWORD PTR [rbp-8], rdi\r\nmov DWORD PTR [rbp-12], esi\r\nmov rax, QWORD PTR [rbp-8]\r\nmov edx, DWORD PTR [rbp-12]\r\nmov DWORD PTR [rax], edx\r\nnop\r\npop rbp\r\nret<\/pre>\n
    Yap\u0131c\u0131ya ili\u015fkin kod k\u0131saca asl\u0131nda esi<\/em> yazmac\u0131 i\u00e7eri\u011fini rdi<\/em> yazmac\u0131 ile ifade edilen belle\u011fe kopyalamaya kar\u015f\u0131l\u0131k geliyor.
    \nBuna ge\u00e7irilen de\u011ferleri g\u00f6rmek i\u00e7in de main()<\/em> i\u00e7erisinde buna ili\u015fkin \u00fcretilen koda bakal\u0131m.<\/p>\n
    \/\/ int x = 3;\r\nmov DWORD PTR [rbp-4], 3\r\n\r\n\/\/ Functor functor(x);\r\nmov edx,DWORD PTR [rbp-0x4]\r\nlea rax,[rbp-0x20]\r\nmov esi,edx\r\nmov rdi,rax\r\ncall Functor::Functor(int)<\/pre>\n
    Buradan x’in rbp-0x4<\/em> yazmac\u0131nda sakland\u0131\u011f\u0131n\u0131 ve daha sonra dolayl\u0131 yoldan esi<\/em> yazmac\u0131na yaz\u0131ld\u0131\u011f\u0131n\u0131 g\u00f6r\u00fcyoruz. rbp-0x20<\/em> adresini rdi<\/em> at\u0131ld\u0131\u011f\u0131n\u0131 g\u00f6r\u00fcyoruz. lea<\/em> komutu ve sonras\u0131ndaki sat\u0131rlar ile bizim fonksiyon nesnemizi saklayan adres.<\/p>\n
    Functor::operator()(int):\r\n\/\/ int operator()(int a)\r\npush rbp\r\nmov rbp, rsp\r\nmov QWORD PTR [rbp-8], rdi\r\nmov DWORD PTR [rbp-12], esi\r\n\r\n\/\/ return a + m_x;\r\nmov rax, QWORD PTR [rbp-8]\r\nmov edx, DWORD PTR [rax]\r\nmov eax, DWORD PTR [rbp-12]\r\nadd eax, edx\r\npop rbp\r\nret\r\n<\/pre>\n
    As\u0131l () operat\u00f6r\u00fc<\/em> i\u00e7in \u00fcretilen kod ile yap\u0131c\u0131 i\u00e7in \u00fcretilen kod birbirine olduk\u00e7a benzemekte. En b\u00fcy\u00fck fark ise m_x<\/strong> in de\u011ferini okumak i\u00e7in \u00e7a\u011fr\u0131lan iki sat\u0131r komut.<\/p>\n
    \u015eimdi lambda ifadesi i\u00e7in \u00fcretilen koda bakal\u0131m:<\/p>\n
    main::{lambda(int)#1}::operator()(int) const:\r\npush rbp\r\nmov rbp, rsp\r\nmov QWORD PTR [rbp-8], rdi\r\nmov DWORD PTR [rbp-12], esi\r\nmov rax, QWORD PTR [rbp-8]\r\nmov edx, DWORD PTR [rax]\r\nmov eax, DWORD PTR [rbp-12]\r\nadd eax, edx\r\npop rbp\r\nret<\/pre>\n
    Bu kod par\u00e7as\u0131n\u0131n da fonksiyon nesne objesi i\u00e7in \u00fcretilen ile ayn\u0131 oldu\u011fu g\u00f6r\u00fclebilir. Burada tabi lambda ifadesinin olu\u015fturulmas\u0131na ili\u015fkin kodunun nerede oldu\u011fu sorulabilir.
    \nOnun i\u00e7in main<\/em> i\u00e7erisine bak\u0131yoruz:<\/p>\n
    mov eax, DWORD PTR [rbp-4]\r\nmov DWORD PTR [rbp-16], eax<\/pre>\n
    G\u00f6r\u00fclece\u011fi \u00fczere fonksiyon nesne objesinin yap\u0131c\u0131s\u0131 i\u00e7in \u00fcretilen kod, lambda i\u00e7in \u00fcretilen kodtan olduk\u00e7a fazla. Bunun da sebebi yap\u0131c\u0131 i\u00e7in olan olu\u015fturucu kodu normal \u00fcretilen kodun i\u00e7erisine g\u00f6m\u00fclmekte. Ortam de\u011fi\u015fkenlerinin referans olarak ge\u00e7irildi\u011fi durumda asl\u0131nda yukar\u0131dakine benzer tek fark de\u011fer yerine i\u015faret\u00e7ilerin ge\u00e7irilmesi.<\/p>\n
    Bu kullan\u0131mlara bakt\u0131\u011f\u0131m\u0131zda \u00f6zellikle fonksiyon nesneleri ile lambda ifadeleri birbirlerinin hemen hemen ayn\u0131s\u0131. Ana farkl\u0131l\u0131klar:
    \n– “functor” lar ve lambda ifadeleri fazladan bir this g\u00f6stergeci ge\u00e7iriyorlar (fazladan 8 byte),
    \n– Lambda ifadelerine ili\u015fkin yap\u0131c\u0131 kodlar\u0131 lambda ifadelerinin i\u00e7erisine yediriliyor ve bu sayede kopyalamaya ili\u015fkin fazladan olu\u015fturulan kod miktar\u0131 azalt\u0131lm\u0131\u015f oluyor.<\/p>\n
    Sonu\u00e7 olarak lambda ifadelerinin performans anlam\u0131nda bir y\u00fck getirmedi\u011fini ifade edebiliriz ([8] de daha detayl\u0131 bir performans kar\u015f\u0131la\u015ft\u0131rmas\u0131 g\u00f6rebilirsiniz).<\/p>\n
    Yine k\u0131sa dedik s\u00f6z\u00fc uzatt\u0131k \ud83d\ude42 olsun lambda ifadeleri olduk\u00e7a \u00f6nemli ve nispeten yeni bir kabiliyet, siz yaz\u0131l\u0131mperverlere faydas\u0131 olduysa ne ala \ud83d\ude42<\/p>\n
    Kaynaklar:<\/span><\/strong><\/h2>\n
      \n
    1. https:\/\/www.cprogramming.com\/c++11\/c++11-lambda-closures.html<\/li>\n
    2. https:\/\/www.geeksforgeeks.org\/lambda-expression-in-c\/<\/li>\n
    3. https:\/\/web.mst.edu\/~nmjxv3\/articles\/lambdas.html<\/li>\n
    4. https:\/\/blog.feabhas.com\/2014\/03\/demystifying-c-lambdas\/<\/li>\n
    5. https:\/\/www.wikiwand.com\/en\/Lambda_calculus<\/li>\n
    6. https:\/\/www.inf.fu-berlin.de\/lehre\/WS03\/alpi\/lambda.pdf<\/li>\n
    7. https:\/\/en.cppreference.com\/w\/cpp\/language\/lambda<\/li>\n
    8. https:\/\/vittorioromeo.info\/index\/blog\/passing_functions_to_functions.html<\/li>\n<\/ol>\n
      <\/p>","protected":false},"excerpt":{"rendered":"
      Evet arkada\u015flar, C++ yaz\u0131lar\u0131m\u0131za kald\u0131\u011f\u0131m\u0131z yerden devam ediyoruz. Lambda yaz\u0131m ile temel C++ 11 \u00f6zelliklerini tamamlam\u0131\u015f olaca\u011f\u0131z. Sonras\u0131nda belki STL i\u00e7in de bir yaz\u0131 yaz\u0131p, daha sonra C++ 14\/17\/20’e yelken a\u00e7abiliriz. Asl\u0131nda olduk\u00e7a geni\u015f konu, fakat ben bu yaz\u0131mda sizlere temel noktalar\u0131 aktarmaya \u00e7al\u0131\u015faca\u011f\u0131m. \u00d6ncelikle\u00a0 benim gibi bilgisayar bilimleri ile u\u011fra\u015fanlar\u0131m\u0131z Lambda denilince hemen akl\u0131n\u0131za… Continue reading →<\/span><\/a><\/p>\n","protected":false},"author":2,"featured_media":174,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"footnotes":""},"categories":[10,41],"tags":[13,47,46,139,42,48],"class_list":["post-418","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-c","category-modern-c","tag-c","tag-c-0x","tag-c-11","tag-lambda","tag-modern-c","tag-stl"],"yoast_head":"\nModern C++ (6) : Lambda \u0130fadeleri - Yaz\u0131l\u0131mperver'in 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:\/\/www.yazilimperver.com\/index.php\/2018\/07\/19\/modern-c-6-lambda-ifadeleri\/\" \/>\n<meta property=\"og:locale\" content=\"tr_TR\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"[:tr]Modern C++ (6) : Lambda \u0130fadeleri[:en]Modern C++ (6) : Lambda Expressions[:] - Yaz\u0131l\u0131mperver'in D\u00fcnyas\u0131\" \/>\n<meta property=\"og:description\" content=\"Evet arkada\u015flar, C++ yaz\u0131lar\u0131m\u0131za kald\u0131\u011f\u0131m\u0131z yerden devam ediyoruz. Lambda yaz\u0131m ile temel C++ 11 \u00f6zelliklerini tamamlam\u0131\u015f olaca\u011f\u0131z. Sonras\u0131nda belki STL i\u00e7in de bir yaz\u0131 yaz\u0131p, daha sonra C++ 14\/17\/20’e yelken a\u00e7abiliriz. Asl\u0131nda olduk\u00e7a geni\u015f konu, fakat ben bu yaz\u0131mda sizlere temel noktalar\u0131 aktarmaya \u00e7al\u0131\u015faca\u011f\u0131m. \u00d6ncelikle\u00a0 benim gibi bilgisayar bilimleri ile u\u011fra\u015fanlar\u0131m\u0131z Lambda denilince hemen akl\u0131n\u0131za... Continue reading →\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.yazilimperver.com\/index.php\/2018\/07\/19\/modern-c-6-lambda-ifadeleri\/\" \/>\n<meta property=\"og:site_name\" content=\"Yaz\u0131l\u0131mperver'in D\u00fcnyas\u0131\" \/>\n<meta property=\"article:published_time\" content=\"2018-07-19T18:06:31+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2018-07-26T14:30:18+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/www.yazilimperver.com\/wp-content\/uploads\/2017\/12\/FeaturedImage-e1580417052514.png\" \/>\n\t<meta property=\"og:image:width\" content=\"32\" \/>\n\t<meta property=\"og:image:height\" content=\"32\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/png\" \/>\n<meta name=\"author\" content=\"yaz\u0131l\u0131mperver\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Yazan:\" \/>\n\t<meta name=\"twitter:data1\" content=\"yaz\u0131l\u0131mperver\" \/>\n\t<meta name=\"twitter:label2\" content=\"Tahmini okuma s\u00fcresi\" \/>\n\t<meta name=\"twitter:data2\" content=\"31 dakika\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/www.yazilimperver.com\/index.php\/2018\/07\/19\/modern-c-6-lambda-ifadeleri\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/www.yazilimperver.com\/index.php\/2018\/07\/19\/modern-c-6-lambda-ifadeleri\/\"},\"author\":{\"name\":\"yaz\u0131l\u0131mperver\",\"@id\":\"https:\/\/www.yazilimperver.com\/#\/schema\/person\/6497f6de4df6ba469748b861a2b3fcdb\"},\"headline\":\"Modern C++ (6) : Lambda \u0130fadeleri\",\"datePublished\":\"2018-07-19T18:06:31+00:00\",\"dateModified\":\"2018-07-26T14:30:18+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/www.yazilimperver.com\/index.php\/2018\/07\/19\/modern-c-6-lambda-ifadeleri\/\"},\"wordCount\":3903,\"commentCount\":4,\"publisher\":{\"@id\":\"https:\/\/www.yazilimperver.com\/#\/schema\/person\/6497f6de4df6ba469748b861a2b3fcdb\"},\"keywords\":[\"c++\",\"C++ 0x\",\"C++ 11\",\"lambda\",\"Modern C++\",\"STL\"],\"articleSection\":[\"C++\",\"Modern C++\"],\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/www.yazilimperver.com\/index.php\/2018\/07\/19\/modern-c-6-lambda-ifadeleri\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/www.yazilimperver.com\/index.php\/2018\/07\/19\/modern-c-6-lambda-ifadeleri\/\",\"url\":\"https:\/\/www.yazilimperver.com\/index.php\/2018\/07\/19\/modern-c-6-lambda-ifadeleri\/\",\"name\":\"[:tr]Modern C++ (6) : Lambda \u0130fadeleri[:en]Modern C++ (6) : Lambda Expressions[:] - Yaz\u0131l\u0131mperver'in D\u00fcnyas\u0131\",\"isPartOf\":{\"@id\":\"https:\/\/www.yazilimperver.com\/#website\"},\"datePublished\":\"2018-07-19T18:06:31+00:00\",\"dateModified\":\"2018-07-26T14:30:18+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/www.yazilimperver.com\/index.php\/2018\/07\/19\/modern-c-6-lambda-ifadeleri\/#breadcrumb\"},\"inLanguage\":\"tr\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/www.yazilimperver.com\/index.php\/2018\/07\/19\/modern-c-6-lambda-ifadeleri\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/www.yazilimperver.com\/index.php\/2018\/07\/19\/modern-c-6-lambda-ifadeleri\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Ana sayfa\",\"item\":\"https:\/\/www.yazilimperver.com\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Modern C++ (6) : Lambda \u0130fadeleri\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/www.yazilimperver.com\/#website\",\"url\":\"https:\/\/www.yazilimperver.com\/\",\"name\":\"Yaz\u0131l\u0131mperver'in D\u00fcnyas\u0131\",\"description\":\"Payla\u015fmak g\u00fczeldir.\",\"publisher\":{\"@id\":\"https:\/\/www.yazilimperver.com\/#\/schema\/person\/6497f6de4df6ba469748b861a2b3fcdb\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/www.yazilimperver.com\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"tr\"},{\"@type\":[\"Person\",\"Organization\"],\"@id\":\"https:\/\/www.yazilimperver.com\/#\/schema\/person\/6497f6de4df6ba469748b861a2b3fcdb\",\"name\":\"yaz\u0131l\u0131mperver\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"tr\",\"@id\":\"https:\/\/www.yazilimperver.com\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/www.yazilimperver.com\/wp-content\/uploads\/2018\/04\/OnlyIcon-1-114x114.png\",\"contentUrl\":\"https:\/\/www.yazilimperver.com\/wp-content\/uploads\/2018\/04\/OnlyIcon-1-114x114.png\",\"caption\":\"yaz\u0131l\u0131mperver\"},\"logo\":{\"@id\":\"https:\/\/www.yazilimperver.com\/#\/schema\/person\/image\/\"}}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"[:tr]Modern C++ (6) : Lambda \u0130fadeleri[:en]Modern C++ (6) : Lambda Expressions[:] - Yaz\u0131l\u0131mperver'in 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:\/\/www.yazilimperver.com\/index.php\/2018\/07\/19\/modern-c-6-lambda-ifadeleri\/","og_locale":"tr_TR","og_type":"article","og_title":"[:tr]Modern C++ (6) : Lambda \u0130fadeleri[:en]Modern C++ (6) : Lambda Expressions[:] - Yaz\u0131l\u0131mperver'in D\u00fcnyas\u0131","og_description":"Evet arkada\u015flar, C++ yaz\u0131lar\u0131m\u0131za kald\u0131\u011f\u0131m\u0131z yerden devam ediyoruz. Lambda yaz\u0131m ile temel C++ 11 \u00f6zelliklerini tamamlam\u0131\u015f olaca\u011f\u0131z. Sonras\u0131nda belki STL i\u00e7in de bir yaz\u0131 yaz\u0131p, daha sonra C++ 14\/17\/20’e yelken a\u00e7abiliriz. Asl\u0131nda olduk\u00e7a geni\u015f konu, fakat ben bu yaz\u0131mda sizlere temel noktalar\u0131 aktarmaya \u00e7al\u0131\u015faca\u011f\u0131m. \u00d6ncelikle\u00a0 benim gibi bilgisayar bilimleri ile u\u011fra\u015fanlar\u0131m\u0131z Lambda denilince hemen akl\u0131n\u0131za... Continue reading →","og_url":"https:\/\/www.yazilimperver.com\/index.php\/2018\/07\/19\/modern-c-6-lambda-ifadeleri\/","og_site_name":"Yaz\u0131l\u0131mperver'in D\u00fcnyas\u0131","article_published_time":"2018-07-19T18:06:31+00:00","article_modified_time":"2018-07-26T14:30:18+00:00","og_image":[{"width":32,"height":32,"url":"https:\/\/www.yazilimperver.com\/wp-content\/uploads\/2017\/12\/FeaturedImage-e1580417052514.png","type":"image\/png"}],"author":"yaz\u0131l\u0131mperver","twitter_card":"summary_large_image","twitter_misc":{"Yazan:":"yaz\u0131l\u0131mperver","Tahmini okuma s\u00fcresi":"31 dakika"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/www.yazilimperver.com\/index.php\/2018\/07\/19\/modern-c-6-lambda-ifadeleri\/#article","isPartOf":{"@id":"https:\/\/www.yazilimperver.com\/index.php\/2018\/07\/19\/modern-c-6-lambda-ifadeleri\/"},"author":{"name":"yaz\u0131l\u0131mperver","@id":"https:\/\/www.yazilimperver.com\/#\/schema\/person\/6497f6de4df6ba469748b861a2b3fcdb"},"headline":"Modern C++ (6) : Lambda \u0130fadeleri","datePublished":"2018-07-19T18:06:31+00:00","dateModified":"2018-07-26T14:30:18+00:00","mainEntityOfPage":{"@id":"https:\/\/www.yazilimperver.com\/index.php\/2018\/07\/19\/modern-c-6-lambda-ifadeleri\/"},"wordCount":3903,"commentCount":4,"publisher":{"@id":"https:\/\/www.yazilimperver.com\/#\/schema\/person\/6497f6de4df6ba469748b861a2b3fcdb"},"keywords":["c++","C++ 0x","C++ 11","lambda","Modern C++","STL"],"articleSection":["C++","Modern C++"],"inLanguage":"tr","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/www.yazilimperver.com\/index.php\/2018\/07\/19\/modern-c-6-lambda-ifadeleri\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/www.yazilimperver.com\/index.php\/2018\/07\/19\/modern-c-6-lambda-ifadeleri\/","url":"https:\/\/www.yazilimperver.com\/index.php\/2018\/07\/19\/modern-c-6-lambda-ifadeleri\/","name":"[:tr]Modern C++ (6) : Lambda \u0130fadeleri[:en]Modern C++ (6) : Lambda Expressions[:] - Yaz\u0131l\u0131mperver'in D\u00fcnyas\u0131","isPartOf":{"@id":"https:\/\/www.yazilimperver.com\/#website"},"datePublished":"2018-07-19T18:06:31+00:00","dateModified":"2018-07-26T14:30:18+00:00","breadcrumb":{"@id":"https:\/\/www.yazilimperver.com\/index.php\/2018\/07\/19\/modern-c-6-lambda-ifadeleri\/#breadcrumb"},"inLanguage":"tr","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.yazilimperver.com\/index.php\/2018\/07\/19\/modern-c-6-lambda-ifadeleri\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/www.yazilimperver.com\/index.php\/2018\/07\/19\/modern-c-6-lambda-ifadeleri\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Ana sayfa","item":"https:\/\/www.yazilimperver.com\/"},{"@type":"ListItem","position":2,"name":"Modern C++ (6) : Lambda \u0130fadeleri"}]},{"@type":"WebSite","@id":"https:\/\/www.yazilimperver.com\/#website","url":"https:\/\/www.yazilimperver.com\/","name":"Yaz\u0131l\u0131mperver'in D\u00fcnyas\u0131","description":"Payla\u015fmak g\u00fczeldir.","publisher":{"@id":"https:\/\/www.yazilimperver.com\/#\/schema\/person\/6497f6de4df6ba469748b861a2b3fcdb"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/www.yazilimperver.com\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"tr"},{"@type":["Person","Organization"],"@id":"https:\/\/www.yazilimperver.com\/#\/schema\/person\/6497f6de4df6ba469748b861a2b3fcdb","name":"yaz\u0131l\u0131mperver","image":{"@type":"ImageObject","inLanguage":"tr","@id":"https:\/\/www.yazilimperver.com\/#\/schema\/person\/image\/","url":"https:\/\/www.yazilimperver.com\/wp-content\/uploads\/2018\/04\/OnlyIcon-1-114x114.png","contentUrl":"https:\/\/www.yazilimperver.com\/wp-content\/uploads\/2018\/04\/OnlyIcon-1-114x114.png","caption":"yaz\u0131l\u0131mperver"},"logo":{"@id":"https:\/\/www.yazilimperver.com\/#\/schema\/person\/image\/"}}]}},"_links":{"self":[{"href":"https:\/\/www.yazilimperver.com\/index.php\/wp-json\/wp\/v2\/posts\/418","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.yazilimperver.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.yazilimperver.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.yazilimperver.com\/index.php\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.yazilimperver.com\/index.php\/wp-json\/wp\/v2\/comments?post=418"}],"version-history":[{"count":16,"href":"https:\/\/www.yazilimperver.com\/index.php\/wp-json\/wp\/v2\/posts\/418\/revisions"}],"predecessor-version":[{"id":442,"href":"https:\/\/www.yazilimperver.com\/index.php\/wp-json\/wp\/v2\/posts\/418\/revisions\/442"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.yazilimperver.com\/index.php\/wp-json\/wp\/v2\/media\/174"}],"wp:attachment":[{"href":"https:\/\/www.yazilimperver.com\/index.php\/wp-json\/wp\/v2\/media?parent=418"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.yazilimperver.com\/index.php\/wp-json\/wp\/v2\/categories?post=418"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.yazilimperver.com\/index.php\/wp-json\/wp\/v2\/tags?post=418"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}