[:tr]Merhaba arkada\u015flar,<\/p>\n
Haftal\u0131k C++ kod \u00f6rneklerimize devam ediyoruz. Bu haftaki problemimiz std::vector<\/em> gibi konteynerlere (nedir arkada\u015f bu STL konteyner sevdas\u0131 yahu \ud83d\ude42 duyar gibiyim) bir yandan veri eklerken bir yandan da bunlar\u0131 s\u0131ral\u0131 tutabilir miyiz?<\/p>\n Bu probleme ge\u00e7meden \u00f6nce konteyner konusuna ufak bir e\u011filelim, \u00e7\u00fcnk\u00fc buradaki problemi \u00e7\u00f6zerken bir miktar de\u011finmemiz gerekecek. Bu s\u0131n\u0131flar\u0131n detaylar\u0131na girmeyece\u011fim ama merak edenler bu sayfaya<\/a><\/strong><\/span> g\u00f6z atabilirler. Burada her bir s\u0131n\u0131fa ili\u015fkin detayl\u0131 bilgi, performans ve servisler s\u0131ralanmaktad\u0131r.<\/p>\n STL g\u00fcnl\u00fck hayatta ihtiya\u00e7 duyabilece\u011fimiz veri yap\u0131lar\u0131na (queue, stack, linked list, vs) ili\u015fkin bir \u00e7ok konteyner s\u0131n\u0131f\u0131n\u0131 i\u00e7erisinde bar\u0131nd\u0131r\u0131yor. Genel olarak bunlar olduk\u00e7a h\u0131zl\u0131 ve verimli bir \u015fekilde ger\u00e7eklenmi\u015f durumda. Hepsi ortak aray\u00fczler sunuyorlar ve iyi bir \u015fekilde d\u00f6k\u00fcmante edilmi\u015f durumdalar. Genel olarak bu konteynerler d\u00f6rt ana gruba ayr\u0131l\u0131yor:<\/p>\n \u015eimdi gelelim problemimize elimizde s\u0131ral\u0131 konteynerler var (\u00f6r. vector<\/em>) ve ekledi\u011fimiz her eleman ile s\u0131ran\u0131n bozulmadan korunmas\u0131n\u0131 istiyoruz bunu kolay bir \u015fekilde nas\u0131l yapabiliriz?<\/p>\n \u0130lk y\u00f6ntem her ekleme sonras\u0131 “algorithm<\/em>” k\u00fct\u00fcphanesi taraf\u0131ndan sunulan sort()<\/em> metodunu kullanmak olabilir ki tahmin edece\u011finiz \u00fczere pek ucuz bir y\u00f6ntem olmayacakt\u0131r \ud83d\ude42 Neyse a\u015fa\u011f\u0131da \u00f6rnek bir vector<\/em> ilklendirelim ve bunu s\u0131ralayal\u0131m.<\/p>\n Evet s\u0131ral\u0131 eklemek i\u00e7in yine “algorithm<\/em>” k\u00fct\u00fcphanesinden bir metottan yard\u0131m alaca\u011f\u0131z. Bu metot lower_bound<\/strong><\/em>().\u00a0 A\u015fa\u011f\u0131da bu metodun tan\u0131m\u0131n\u0131 g\u00f6rebilirsiniz:<\/p>\n Metot k\u0131saca [First, Last) aral\u0131\u011f\u0131ndaki verilen val de\u011ferinden k\u00fc\u00e7\u00fck olmayan ilk eleman\u0131 i\u015faret eden iterator’\u00fc d\u00f6n\u00fcyor.<\/p>\n \u00d6rne\u011fin: {10, 20, 30, 40, 50} girdisi i\u00e7in 10 ve 50 aras\u0131nda 35 de\u011feri i\u00e7in bu metot 3 d\u00f6necek, 15 i\u00e7in ise 1 d\u00f6necek.<\/p>\n A\u015fa\u011f\u0131da bu metodun ve karde\u015finin (upper_bound<\/em>()) kullan\u0131ma ili\u015fkin \u00f6rnek bir kod ta g\u00f6rebilirsiniz:<\/p>\n \u015eimdi geldi s\u0131ra assolistimize (addSorted<\/strong><\/em>) \ud83d\ude42<\/p>\n addSorted<\/em>() metodu nas\u0131l \u00e7al\u0131\u015f\u0131yor? Asl\u0131nda b\u00fct\u00fcn espri lower_bound<\/em>() metodunda b\u00fct\u00fcn listeyi bu metoda ge\u00e7iriyoruz ve o da bize de\u011feri ekleyece\u011fimiz yeri d\u00f6n\u00fcyor. Daha sonra da vector s\u0131n\u0131f\u0131n\u0131n insert<\/em>() metodu ile eleman\u0131 ekliyoruz.<\/p>\n Tabi \u015fimdi bunu di\u011fer konteynerler de kullanamaz m\u0131y\u0131z diye sordu\u011funu duyar gibiyim. Elbette sevgili yaz\u0131l\u0131mperver dostum elbette. Bunun i\u00e7in “template” lar\u0131 kullanaca\u011f\u0131z. A\u015fa\u011f\u0131da daha jenerik addSorted<\/em>() metodumuz ve bunu list<\/em> ile olan kullan\u0131m\u0131n\u0131 bulabilirsin.<\/p>\n Bir sonraki haftal\u0131k C++ yaz\u0131mda g\u00f6r\u00fc\u015fmek \u00fczere.<\/p>\n Kendinize iyi bak\u0131n.[:en]Hello everybody,<\/p>\n We continue to our Weekly C++ posts. This week’s problem is to check if it is possible to keep the containers like std::vector sorted as inserting new elements. Well the short answer is yes!<\/p>\n Before delving into problem, let me briefly talk about containers as we need to mention the nature of containers while dealing with problem. I will not explain all details but if you are interested in details you can check this page out<\/a><\/strong><\/span>. You can find a summary of all classes and operations.<\/p>\n STL contains many data structures that you may need during developing your applications. Generally, these are optimized and efficient classes which are being used extensively in production code. Most of them have similar interfaces and very well documented. We can group these containers as follow:<\/p>\n Now lets go back to our problem. We have a sequential container (e.g. vector<\/em>) and we would like to keep it sorted with consequtive insertion operations. How can we achieve this?<\/p>\n Well, obviously the first method is to use the sort()\u00a0<\/em>method provided by “algorithm<\/em>” library which as you may guess will not be cheap \ud83d\ude42 Now, lets initialize a vector<\/em> and then sort it:<\/p>\n Well, to resolve this problem, we will employ another method from “algorithm<\/em>” library which is lower_bound<\/strong><\/em>() method.\u00a0 \u00a0You can find the signature of this method below:<\/p>\n Briefly this method returns the iterator that points the index of first element which is not less (which of course might be equal) than provided value in\u00a0given range of [First, Last) .<\/p>\n For instance, for provided {10, 20, 30, 40, 50} input and range of [10, 50] and 35 input value it will return 3 and for input value 15 it will return 1.<\/p>\n You can find an example usage of this method with its sister (upper_bound<\/em>()):<\/p>\n Finally, let’s define our method:\u00a0addSorted()<\/strong><\/em><\/p>\n how addSorted<\/em>() method works? In fact, lower_bound<\/em>() performs the most of the task that we need and return the place that we should add new element. Then what we need to do is simply call insert<\/em>() method of vector<\/em>.<\/p>\n Now you may wonder if we can utilize this method with other containers. Well, sure, as long as they are sequential container. To do so, we will get help from templates. Below you can find the generic version of addSorted<\/em>() method and example usage with list<\/em> container.<\/p>\n See you soon in another Weekly C++ post.[:]<\/p>\n","protected":false},"excerpt":{"rendered":" [:tr]Merhaba arkada\u015flar, Haftal\u0131k C++ kod \u00f6rneklerimize devam ediyoruz. Bu haftaki problemimiz std::vector gibi konteynerlere (nedir arkada\u015f bu STL konteyner sevdas\u0131 yahu \ud83d\ude42 duyar gibiyim) bir yandan veri eklerken bir yandan da bunlar\u0131 s\u0131ral\u0131 tutabilir miyiz? Bu probleme ge\u00e7meden \u00f6nce konteyner konusuna ufak bir e\u011filelim, \u00e7\u00fcnk\u00fc buradaki problemi \u00e7\u00f6zerken bir miktar de\u011finmemiz gerekecek. Bu s\u0131n\u0131flar\u0131n detaylar\u0131na… Continue reading \n
\n
\n
\n
\n
#include <iostream>\r\n#include <vector>\r\n#include <string>\r\n#include <algorithm>\r\n#include <iterator>\r\n#include <cassert>\r\nusing namespace std;\r\n\r\nvoid printContent(auto& container)\r\n{\r\n for (const auto &w : container) \r\n {\r\n cout << w << \" \";\r\n }\r\n cout << endl;\r\n}\r\n\r\nint main()\r\n{\r\n vector<string> v {\"selim\", \"rasim\", \"kaz\u0131m\", \"kutlu\", \"osman\", \"can\",\"ali\"};\r\n\r\n \/\/ is_sorted detaylari i\u00e7in https:\/\/en.cppreference.com\/w\/cpp\/algorithm\/is_sorted\r\n assert(false == is_sorted(begin(v), end(v))); \r\n sort(begin(v), end(v)); \r\n assert(true == is_sorted(begin(v), end(v)));\r\n\r\n return 0;\r\n}<\/pre>\ntemplate <class ForwardIterator, class T>\r\nForwardIterator lower_bound (ForwardIterator first, ForwardIterator last, const T& val);<\/pre>\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> v {10,20,30,30,20,10,10,20};\r\n\r\n \/\/ Once bir siralayalim \r\n sort (v.begin(), v.end()); \/\/ 10 10 10 20 20 20 30 30\r\n\r\n auto low = std::lower_bound (begin(v), end(v), 20); \/\/ ^\r\n auto up = std::upper_bound (begin(v), end(v), 20); \/\/ ^\r\n\r\n std::cout << \"lower_bound pozisyonu: \" << (low- begin(v)) << endl;\r\n std::cout << \"upper_bound pozisyonu: \" << (up - begin(v)) << endl;\r\n\r\n return 0;\r\n}<\/pre>\n#include <iostream>\r\n#include <vector>\r\n#include <string>\r\n#include <algorithm>\r\n#include <iterator>\r\n#include <cassert>\r\nusing namespace std;\r\n\r\nvoid printContent(auto& container)\r\n{\r\n for (const auto &w : container) \r\n {\r\n cout << w << \" \";\r\n }\r\n cout << endl;\r\n}\r\n\r\n\/\/ Assolistimiz\r\nvoid addSorted(vector<string> &v, const string &word)\r\n{\r\n const auto insertPos (lower_bound(begin(v), end(v), word));\r\n v.insert(insertPos, word);\r\n}\r\n\r\nint main()\r\n{\r\n vector<string> v {\"selim\", \"rasim\", \"kaz\u0131m\", \"kutlu\", \"osman\", \"can\",\"ali\"};\r\n\r\n printContent(v);\r\n \r\n \/\/ is_sorted detaylari i\u00e7in https:\/\/en.cppreference.com\/w\/cpp\/algorithm\/is_sorted\r\n assert(false == is_sorted(begin(v), end(v))); \r\n sort(begin(v), end(v)); \r\n assert(true == is_sorted(begin(v), end(v)));\r\n \r\n printContent(v);\r\n \r\n addSorted(v, \"fatih\");\r\n printContent(v);\r\n \r\n addSorted(v, \"ahmet\");\r\n printContent(v);\r\n \r\n addSorted(v, \"lale\");\r\n printContent(v);\r\n\r\n return 0;\r\n}<\/pre>\n#include <iostream>\r\n#include <list>\r\n#include <string>\r\n#include <algorithm>\r\n#include <iterator>\r\nusing namespace std;\r\n\r\nvoid printContent(auto& container)\r\n{\r\n for (const auto &w : container) \r\n {\r\n cout << w << \" \";\r\n }\r\n cout << endl;\r\n}\r\n\r\ntemplate <typename C, typename T>\r\nvoid addSorted(C &v, const T &item)\r\n{\r\n const auto insert_pos (lower_bound(begin(v), end(v), item));\r\n v.insert(insert_pos, item);\r\n}\r\n\r\nint main()\r\n{\r\n list<string> v;\r\n addSorted<list<string>, string>(v, \"deneme\");\r\n printContent(v);\r\n \r\n addSorted<list<string>, string>(v, \"fatih\");\r\n printContent(v);\r\n \r\n addSorted<list<string>, string>(v, \"ahmet\");\r\n printContent(v);\r\n \r\n addSorted<list<string>, string>(v, \"lale\");\r\n printContent(v);\r\n\r\n return 0;\r\n}<\/pre>\n\n
\n
\n
\n
\n
#include <iostream>\r\n#include <vector>\r\n#include <string>\r\n#include <algorithm>\r\n#include <iterator>\r\n#include <cassert>\r\nusing namespace std;\r\n\r\nvoid printContent(auto& container)\r\n{\r\n for (const auto &w : container) \r\n {\r\n cout << w << \" \";\r\n }\r\n cout << endl;\r\n}\r\n\r\nint main()\r\n{\r\n vector<string> v {\"selim\", \"rasim\", \"kaz\u0131m\", \"kutlu\", \"osman\", \"can\",\"ali\"};\r\n\r\n \/\/ For details of is_sorted check out: https:\/\/en.cppreference.com\/w\/cpp\/algorithm\/is_sorted\r\n assert(false == is_sorted(begin(v), end(v))); \r\n sort(begin(v), end(v)); \r\n assert(true == is_sorted(begin(v), end(v)));\r\n\r\n return 0;\r\n}<\/pre>\ntemplate <class ForwardIterator, class T>\r\nForwardIterator lower_bound (ForwardIterator first, ForwardIterator last, const T& val);<\/pre>\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> v {10,20,30,30,20,10,10,20};\r\n\r\n \/\/ First sort the input \r\n sort (v.begin(), v.end()); \/\/ 10 10 10 20 20 20 30 30\r\n\r\n auto low = std::lower_bound (begin(v), end(v), 20); \/\/ ^\r\n auto up = std::upper_bound (begin(v), end(v), 20); \/\/ ^\r\n\r\n std::cout << \"lower_bound index: \" << (low- begin(v)) << endl;\r\n std::cout << \"upper_bound index: \" << (up - begin(v)) << endl;\r\n\r\n return 0;\r\n}<\/pre>\n#include <iostream>\r\n#include <vector>\r\n#include <string>\r\n#include <algorithm>\r\n#include <iterator>\r\n#include <cassert>\r\nusing namespace std;\r\n\r\nvoid printContent(auto& container)\r\n{\r\n for (const auto &w : container) \r\n {\r\n cout << w << \" \";\r\n }\r\n cout << endl;\r\n}\r\n\r\n\/\/ Our method\r\nvoid addSorted(vector<string> &v, const string &word)\r\n{\r\n const auto insertPos (lower_bound(begin(v), end(v), word));\r\n v.insert(insertPos, word);\r\n}\r\n\r\nint main()\r\n{\r\n vector<string> v {\"selim\", \"rasim\", \"kaz\u0131m\", \"kutlu\", \"osman\", \"can\",\"ali\"};\r\n\r\n printContent(v);\r\n \r\n \/\/ For details of is_sorted check out https:\/\/en.cppreference.com\/w\/cpp\/algorithm\/is_sorted\r\n assert(false == is_sorted(begin(v), end(v))); \r\n sort(begin(v), end(v)); \r\n assert(true == is_sorted(begin(v), end(v)));\r\n \r\n printContent(v);\r\n \r\n addSorted(v, \"fatih\");\r\n printContent(v);\r\n \r\n addSorted(v, \"ahmet\");\r\n printContent(v);\r\n \r\n addSorted(v, \"lale\");\r\n printContent(v);\r\n\r\n return 0;\r\n}<\/pre>\n#include <iostream>\r\n#include <list>\r\n#include <string>\r\n#include <algorithm>\r\n#include <iterator>\r\nusing namespace std;\r\n\r\nvoid printContent(auto& container)\r\n{\r\n for (const auto &w : container) \r\n {\r\n cout << w << \" \";\r\n }\r\n cout << endl;\r\n}\r\n\r\ntemplate <typename C, typename T>\r\nvoid addSorted(C &v, const T &item)\r\n{\r\n const auto insert_pos (lower_bound(begin(v), end(v), item));\r\n v.insert(insert_pos, item);\r\n}\r\n\r\nint main()\r\n{\r\n list<string> v;\r\n addSorted<list<string>, string>(v, \"deneme\");\r\n printContent(v);\r\n \r\n addSorted<list<string>, string>(v, \"fatih\");\r\n printContent(v);\r\n \r\n addSorted<list<string>, string>(v, \"ahmet\");\r\n printContent(v);\r\n \r\n addSorted<list<string>, string>(v, \"lale\");\r\n printContent(v);\r\n\r\n return 0;\r\n}<\/pre>\n