1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
| #include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <numeric>
#include <optional>
#include <any>
#include <tuple>
#include <memory>
void sortVector(std::vector<int> &unsorted_list)
{
// use: srt
std::sort(unsorted_list.begin(), unsorted_list.end());
}
void printList(const std::vector<int> &input, const char *delimiter = " ")
{
// use: oit
std::copy(std::begin(input), std::end(input), std::ostream_iterator<int>{std::cout, delimiter});
// use: sto
std::cout << std::endl;
}
void printList(const std::string &input, const char *delimiter = " ")
{
// use: oit
std::copy(std::begin(input), std::end(input), std::ostream_iterator<char>{std::cout, delimiter});
// use: sto
std::cout << std::endl;
}
int main()
{
std::string greet{"Hello world!"};
// use: sto
std::cout << greet << std::endl;
// use: stv
std::vector<int> my_list{1, 5, 6, 3};
sortVector(my_list);
for (int item : my_list)
{
// use: sto
std::cout << item << ", ";
}
// use: sto
std::cout << std::endl;
// use: oit
std::copy(std::begin(my_list), std::end(my_list), std::ostream_iterator<int>{std::cout, " "});
greet.erase(0, greet.find_first_not_of("Hello \t\n\r"));
// use: lwr
std::transform(std::begin(greet), std::end(greet), std::begin(greet), [](char c)
{ return std::tolower(c); });
std::cout << std::endl;
// use: lwr -> another example
std::transform(std::begin(my_list), std::end(my_list), std::begin(my_list), [](int number)
{ return number * 2; });
for (int item : my_list)
{
// use: sto
std::cout << item << ", ";
}
// use: sto
std::cout << std::endl;
// use: erm
my_list.erase(std::remove(std::begin(my_list), std::end(my_list), 10), std::end(my_list));
std::cout << "After remove:" << std::endl;
for (int item : my_list)
{
// use: sto
std::cout << item << ", ";
}
// use: sto
std::cout << std::endl;
printList(my_list, " <-> ");
// use: acm
auto sum = std::accumulate(std::begin(my_list), std::end(my_list), 0);
// use: acl
auto product = std::accumulate(std::begin(my_list), std::end(my_list), 1, std::multiplies<int>());
// use: sto
std::cout << "sum: " << sum << ", product: " << product << std::endl;
// use: stv
std::vector<int> new_list = std::move(my_list);
// move content of my_list to new_list without copy of elements
// my_list not needed anymore
my_list.clear();
printList(new_list, " -> ");
// example for optional usage
std::optional<int> maybe{std::nullopt};
std::cout << maybe.has_value() << std::endl;
try
{
std::cout << maybe.value() << std::endl;
}
catch (const std::exception &e)
{
std::cout << "Exception caught: " << e.what() << std::endl;
}
std::cout << maybe.value_or(-1) << std::endl;
maybe = 5;
std::cout << maybe.has_value() << std::endl;
std::cout << maybe.value() << std::endl;
std::any myany = 7;
std::cout << myany.type().name() << ": " << myany.has_value() << " -> " << std::any_cast<int>(myany) << std::endl;
try
{
std::any_cast<double>(myany);
}
catch (const std::bad_any_cast &e)
{
std::cerr << e.what() << '\n';
}
myany = true;
std::cout << myany.type().name() << ": " << myany.has_value() << " -> " << std::any_cast<bool>(myany) << std::endl;
if (myany.type().name())
{
std::cout << "myany is boolean.\n";
}
myany.reset();
if (!myany.has_value())
{
std::cout << "myany has no value!\n";
}
// will be deprecated; using std::random -> random generator available as third parameter
// but "harmfull" if used
// use: shf
std::random_shuffle(std::begin(new_list), std::end(new_list));
printList(new_list, " <shuffled> ");
// use: rvr
std::reverse(std::begin(new_list), std::end(new_list));
printList(new_list, " <reverse> ");
// use: stv
std::vector<int> copyList(new_list.size());
// use: rvc
std::reverse_copy(std::begin(new_list), std::end(new_list), std::begin(copyList));
printList(copyList, " <copyList> ");
copyList.insert(std::begin(copyList), {1, 2, 3, 4});
printList(copyList, " <rotate> ");
// use: rte
std::rotate(std::begin(copyList), std::begin(copyList) + 2, std::end(copyList));
printList(copyList, " <rotate> ");
// use: stv
std::vector<int> rotate_list(copyList.size());
const auto pivot = std::find(std::begin(copyList), std::end(copyList), 4);
// use: rtc
std::ignore = std::rotate_copy(std::begin(copyList), pivot, std::end(copyList),
std::begin(rotate_list));
printList(rotate_list, " <rotate_copy> ");
// use: rtc
std::ignore = std::rotate_copy(std::begin(rotate_list), std::begin(rotate_list) + 2, std::end(rotate_list),
std::ostream_iterator<int>(std::cout));
// use: sto
std::cout << std::endl;
printList(rotate_list);
// use: sto
std::cout << "Hello Flush!\n"
<< std::flush;
// lambda function
auto compare = [rotate_list](const char &a, const char &b)
{
std::ignore = rotate_list.size(); // reading in as const by value
return a < b;
};
std::string s = "abc";
// use: srt
std::sort(s.begin(), s.end(), compare);
// coult also use for compare: std::greater<char>()
do
std::cout << s << ' ';
// use: nxp
while (std::next_permutation(s.begin(), s.end()));
// use: sto
std::cout << '\n';
// use: sto
std::cout << "current rotate_list\n";
printList(rotate_list);
// use: srt
std::sort(std::begin(rotate_list), std::end(rotate_list));
// use: sto
std::cout << "current rotate_list after sorting\n";
printList(rotate_list);
// use: uqe
const auto last_elem = std::unique(std::begin(rotate_list), std::end(rotate_list));
// use: sto
std::cout << "size: " << rotate_list.size() << std::endl;
rotate_list.erase(last_elem, rotate_list.end());
// use: sto
std::cout << "size: " << rotate_list.size() << std::endl;
// use: sto
std::cout << "current rotate_list after unique\n";
printList(rotate_list);
if (!rotate_list.empty())
{
std::cout << "value at beginning: " << *std::begin(rotate_list) << " <> " << rotate_list.at(0) << std::endl;
}
const int remove_value = 6;
// use: rmv
auto pos = std::remove(std::begin(rotate_list), std::end(rotate_list), remove_value);
rotate_list.erase(pos, rotate_list.end());
if (pos == std::end(rotate_list))
{
// use: sto
std::cout << remove_value << " was removed!\n";
}
printList(rotate_list, " <remove> ");
// use: rmi
pos = std::remove_if(std::begin(rotate_list), std::end(rotate_list), [](const int &value)
{ return value > remove_value; });
rotate_list.erase(pos, rotate_list.end());
if (pos == std::end(rotate_list))
{
// use: sto
std::cout << "Everything > " << remove_value << " was removed!\n";
}
printList(rotate_list, " <remove_if> ");
std::string remove_copy_var = "Hello Merhaba World!";
// std::string::npos <- used for "no position" or "not found"
if (remove_copy_var.find_first_not_of("Merhaba") != std::string::npos)
{
std::cout << "Merhaba found in string!\n";
}
// use: rmf
const auto pos_copy_if = std::remove_copy_if(std::begin(remove_copy_var), std::end(remove_copy_var),
std::begin(remove_copy_var), [](const char &input)
{ return input == 'a'; });
remove_copy_var.erase(pos_copy_if, remove_copy_var.end());
printList(remove_copy_var, "-");
std::string new_hello;
// use: rmc
std::remove_copy(std::begin(remove_copy_var), std::end(remove_copy_var),
std::back_inserter(new_hello), 'H');
// use: sto
std::cout << remove_copy_var.size() << std::endl;
// use: sto
std::cout << new_hello.size() << std::endl;
printList(new_hello, "-");
// use: tfm
std::transform(std::begin(new_hello), std::end(new_hello),
std::begin(new_hello), [](const char &input)
{ return std::toupper(input); });
printList(new_hello, " <transform> ");
// containers must have equal ranges
std::string lowercase_hello = "hello world!";
std::string uppercase_hello{};
// use: tfm
std::transform(std::begin(lowercase_hello), std::end(lowercase_hello), std::back_inserter(uppercase_hello), [](const char &input)
{ return std::toupper(input); });
printList(uppercase_hello, "");
printList(lowercase_hello, "");
// use: sto
std::cout << lowercase_hello.size() << "\n";
// use: sto
std::cout << uppercase_hello.size() << "\n";
// use: swr
std::swap_ranges(std::begin(lowercase_hello), std::begin(lowercase_hello) + 5, std::begin(uppercase_hello));
printList(lowercase_hello, "");
printList(uppercase_hello, "");
// use: swp
std::swap(lowercase_hello, uppercase_hello);
printList(uppercase_hello, " <now uppercase> ");
// use: rpl
std::replace(std::begin(lowercase_hello), std::end(lowercase_hello), 'l', 'X');
printList(lowercase_hello, " <replace> ");
// use: tfm
std::transform(
std::begin(lowercase_hello), std::end(lowercase_hello), std::begin(lowercase_hello), [](const char &input)
{ return (std::islower(input) ? std::toupper(input) : input); });
printList(lowercase_hello, " <all upper> ");
// use: rpi
std::replace_if(
std::begin(lowercase_hello), std::end(lowercase_hello), [](const char &input)
{ return std::islower(input); },
'X');
printList(lowercase_hello);
std::string my_copy(lowercase_hello.size(), ' ');
// use: rpc
std::replace_copy(std::begin(lowercase_hello), std::end(lowercase_hello), std::begin(my_copy), 'X', 'y');
printList(my_copy);
// use: rci
std::replace_copy_if(
std::begin(lowercase_hello), std::end(lowercase_hello),
std::begin(my_copy), [](const char &input)
{ return input != 'X'; },
'Z');
printList(my_copy);
std::string my_copy_backwards{};
my_copy_backwards.resize(my_copy.size());
// use: mvb
std::move_backward(std::begin(my_copy) + 2, std::end(my_copy), std::end(my_copy_backwards));
printList(my_copy_backwards);
// use: mov
std::move(std::begin(lowercase_hello), std::end(lowercase_hello), std::begin(my_copy));
printList(my_copy);
// use: ita
std::iota(std::begin(my_copy), std::end(my_copy), 'A');
printList(my_copy);
printList(rotate_list);
// use: gnr
std::generate(std::begin(rotate_list), std::end(rotate_list), [n = 3]() mutable
{ return n--; });
// using mutable the captured variable n is not a const anymore and writeable
// also possible:
// int n = 3
// std::generate(std::begin(rotate_list), std::end(rotate_list), [&n]()
// { return n--; });
// we do not really need an n out of generate here
printList(rotate_list);
// use: gnn
const int list_size = 7;
rotate_list.resize(list_size);
std::generate_n(std::begin(rotate_list), list_size, [n = 5]() mutable
{ return n--; });
printList(rotate_list);
// use: fln
std::fill_n(std::begin(rotate_list), std::abs(list_size - 3), 0);
printList(rotate_list);
// use: fil
std::fill(std::begin(rotate_list), std::end(rotate_list) - 5, 9);
printList(rotate_list);
printList(my_copy);
// use: cpy
std::copy(std::begin(uppercase_hello) + 2, std::end(uppercase_hello) - 2, std::begin(my_copy));
printList(my_copy);
// use: cpn
std::copy_n(std::begin(uppercase_hello), uppercase_hello.size() - 2, std::begin(my_copy));
printList(uppercase_hello);
printList(my_copy);
// use: cpi
std::copy_if(std::begin(uppercase_hello), std::end(uppercase_hello), std::begin(my_copy),
[](const char &input)
{
return std::islower(input);
});
printList(my_copy);
// use: cpb
std::copy_backward(std::begin(uppercase_hello), std::end(uppercase_hello), std::end(my_copy));
printList(my_copy);
// use: upb
std::vector<int> upper_bound_list = {3, 5, 7, 9, 1};
std::sort(std::begin(upper_bound_list), std::end(upper_bound_list));
printList(upper_bound_list);
auto upper = std::upper_bound(std::begin(upper_bound_list), std::end(upper_bound_list), 4);
if (upper != std::end(upper_bound_list))
{
const auto distance = std::distance(std::begin(upper_bound_list), upper);
std::cout << "Upper Bound: " << *upper << " at " << distance << std::endl;
}
else
{
std::cout << "Upper Bound not found" << std::endl;
}
// use: lwb
auto pos_lower_bound = std::lower_bound(std::begin(upper_bound_list), std::end(upper_bound_list), 2);
if (pos_lower_bound != std::end(upper_bound_list))
{
const auto distance = std::distance(std::begin(upper_bound_list), pos_lower_bound);
std::cout << "Lower Bound: " << *pos_lower_bound << " at " << distance << std::endl;
}
else
{
std::cout << "Lower Bound not found" << std::endl;
}
printList(rotate_list);
sortVector(rotate_list);
// use: ucp
std::unique_copy(std::begin(rotate_list), std::end(rotate_list),
std::ostream_iterator<int>(std::cout));
// if not sorted, duplicate entries possible with std::unique_copy
std::cout << "\n";
// use: stv
std::vector<int> rotate_list_union{};
rotate_list_union.resize(rotate_list.size());
// use: ucp
std::unique_copy(std::begin(rotate_list), std::end(rotate_list),
std::back_inserter(rotate_list_union));
printList(rotate_list_union);
// use: stu
std::ignore = std::set_union(std::begin(rotate_list), std::end(rotate_list),
std::begin(rotate_list_union), std::end(rotate_list_union), std::ostream_iterator<int>(std::cout));
// use: sto
std::cout << "\n";
printList(uppercase_hello);
// use: tfm
std::transform(std::begin(uppercase_hello), std::end(uppercase_hello),
std::begin(my_copy), [](const char &input)
{ return std::tolower(input); });
printList(my_copy);
// use: stn
std::ignore = std::set_intersection(std::begin(uppercase_hello), std::end(uppercase_hello),
std::begin(my_copy), std::end(my_copy), std::ostream_iterator<char>(std::cout));
std::cout << "\n";
// use: std
std::ignore = std::set_difference(std::begin(uppercase_hello), std::end(uppercase_hello),
std::begin(my_copy), std::end(my_copy), std::ostream_iterator<char>(std::cout));
std::cout << "\n";
int m;
// use: ssd
std::ignore = std::set_symmetric_difference(std::begin(uppercase_hello),
std::end(uppercase_hello), std::begin(my_copy), std::end(my_copy), std::ostream_iterator<char>(std::cout));
std::cout << "\n";
printList(uppercase_hello);
printList(my_copy);
// use: mrg
std::merge(std::begin(uppercase_hello), std::end(uppercase_hello),
std::begin(my_copy), std::end(my_copy), std::ostream_iterator<char>(std::cout));
std::cout << "\n";
// use: stv
std::vector<int> first = {3, 1, 7, 9, 5};
std::vector<int> second = {2, 6, 4, 10, 8};
sortVector(first);
sortVector(second);
std::vector<int> result(first.size() + second.size());
// copy first and second part to result
auto it = std::copy(std::begin(first), std::end(first), std::begin(result));
std::ignore = std::copy(std::begin(second), std::end(second), it);
// use: ipm
std::inplace_merge(std::begin(result), it, std::end(result));
printList(result);
first = {1, 2, 3, 4};
second = {3, 2, 4};
sortVector(second);
// use: inc
if (std::includes(std::begin(first), std::end(first),
std::begin(second), std::end(second)))
{
// use: sto
std::cout << "first includes second:" << std::endl;
}
else
{
// use: sto
std::cout << "first does NOT include second:" << std::endl;
}
printList(first);
printList(second);
sortVector(rotate_list_union);
printList(rotate_list_union);
// use: eqr
auto bounds = std::equal_range(std::begin(rotate_list_union), std::end(rotate_list_union), 0);
std::cout << "Range of elements equal to 0: ";
for (auto it = bounds.first; it != bounds.second; ++it)
{
std::cout << *it << " ";
}
std::cout << std::endl;
// use: bns
auto found = std::binary_search(std::begin(rotate_list_union), std::end(rotate_list_union), 1);
if (found)
{
std::cout << "found!" << std::endl;
}
// use: ajf adjacent_find
auto pos_adjacent_find = std::adjacent_find(std::begin(rotate_list_union), std::end(rotate_list_union));
if (pos_adjacent_find != std::end(rotate_list_union))
{
std::cout << "equal pair found: " << *pos_adjacent_find << " " << *pos_adjacent_find++ << std::endl;
}
std::vector<int> all_same{1, 1, 1, 1, 1, 1, 1};
printList(all_same);
// use: alo all_of
if (std::all_of(std::begin(all_same), std::end(all_same), [](const int &input)
{ return input == 1; }))
{
std::cout << "all number are same" << std::endl;
}
all_same.push_back(2);
// use: ano any_of
if (std::any_of(std::begin(all_same), std::end(all_same), [](const int &input)
{ return input > 1; }))
{
std::cout << "at least one element is > 1" << std::endl;
}
// use: cni count_if
all_same.push_back(3);
auto n = std::count_if(std::begin(all_same), std::end(all_same), [](const int &input)
{ return input > 1; });
std::cout << n << " elements are greate than 1" << std::endl;
// use: cnt count
n = std::count(std::begin(all_same), std::end(all_same), 1);
std::cout << n << " elements are equal to 1" << std::endl;
// use: stv
std::vector<int> all_same_equal(all_same.size(), 0);
// use: cpy
std::copy(std::begin(all_same), std::end(all_same), std::begin(all_same_equal));
all_same_equal.emplace_back(4);
printList(all_same);
printList(all_same_equal);
// use: eql equal
if (std::equal(std::begin(all_same_equal), std::end(all_same_equal), std::begin(all_same)))
{
std::cout << "all_same and all_same_equal have both equal content." << std::endl;
}
// Caution here:
if (std::equal(std::begin(all_same), std::end(all_same), std::begin(all_same_equal)))
{
std::cout << "all_same and all_same_equal have both equal content until size of all_same although last element of all_same_equal is different." << std::endl;
}
// use: ffo find_first_of
std::vector<int> find_me{1, 2, 3};
auto pos_find_first_of = std::find_first_of(std::begin(all_same), std::end(all_same),
std::begin(find_me), std::end(find_me));
if (pos_find_first_of != std::end(all_same))
{
std::cout << "I found ";
printList(find_me);
std::cout << " within ";
printList(all_same);
}
// use: fin find_if_not
auto pos_find_if_not = std::find_if_not(std::begin(all_same), std::end(all_same), [](const int &input)
{ return input == 1; });
if (pos_find_if_not != std::end(all_same))
{
auto distance = std::distance(std::begin(all_same), pos_find_if_not);
std::cout << "found not equl 1 at distance: " << distance << std::endl;
}
// use: fnd find
auto pos_find = std::find(std::begin(all_same), std::end(all_same), 3);
if (pos_find != std::end(all_same))
{
auto distance = std::distance(std::begin(all_same), pos_find);
std::cout << "found 3 at " << distance << std::endl;
}
// use: fne find_end
find_me = {1, 1, 1};
std::copy(std::begin(find_me), std::end(find_me), std::ostream_iterator<char>{std::cout, " <find_me> "});
auto pos_find_end = std::find_end(std::begin(all_same), std::end(all_same),
std::begin(find_me), std::end(find_me));
if (pos_find_end != std::end(all_same))
{
auto distance = std::distance(std::begin(all_same), pos_find_end);
std::cout << "last occurence of ";
printList(find_me);
std::cout << " at position " << distance << std::endl;
}
// use: fni find_if
auto pos_find_if = std::find_if(std::begin(all_same), std::end(all_same), [](const int &input)
{ return input > 1; });
if (pos_find_if != std::end(all_same))
{
auto distance = std::distance(std::begin(all_same), pos_find_if);
std::cout << "Greater 1 found at position " << distance << std::endl;
}
// use: fre for_each
std::for_each(std::begin(all_same), std::end(all_same), [](const int &input)
{ std::cout << (input * input) << " "; });
std::cout << std::endl;
// use: ihp is_heap
if (std::is_heap(std::begin(all_same), std::end(all_same)))
{
std::cout << "alls_same is in heap structure" << std::endl;
}
std::vector<int> heap = {11, 9, 8, 7, 6, 5, 4, 3, 2, 1};
bool isHeap = std::is_heap(heap.begin(), heap.end());
if (isHeap)
{
std::cout << "The container represents a valid heap." << std::endl;
}
// use: ihu is_heap_until
heap.at(1) = 12;
auto pos_is_heap_until = std::is_heap_until(std::begin(heap), std::end(heap));
if (pos_is_heap_until != std::end(heap))
{
auto distance = std::distance(std::begin(heap), pos_is_heap_until);
std::cout << "The container represents a valid heap until: " << distance << std::endl;
}
std::string permut{"abc"};
std::string permut_variant{"bca"};
// use: ipr is_permutation
if (std::is_permutation(std::begin(permut), std::end(permut), std::begin(permut_variant)))
{
std::cout << permut_variant << " is a permutation of " << permut << std::endl;
}
// use: ptn partition
std::vector<int> part{1, 5, 4, 2, 3, 5, 3, 7, 6, 2, 9};
printList(part);
auto part_point = std::partition(std::begin(part), std::end(part), [](const int &input)
{ return input >= 5; });
if (part_point != std::end(part))
{
std::cout << "partitioned!" << std::endl;
}
std::cout << "before partition point: " << std::endl;
for (auto it = std::begin(part); it != part_point; ++it)
{
std::cout << *it << " ";
}
std::cout << "\nafter partition point: " << std::endl;
for (auto it = part_point; it != std::end(part); ++it)
{
std::cout << *it << " ";
}
std::cout << std::endl;
// use: ppt partition_point
// assuming already partitioned list
printList(part);
auto pos_partition_point = std::partition_point(std::begin(part), std::end(part), [](const int &input)
{ return input >= 5; });
if (pos_partition_point != std::end(part))
{
auto distance = std::distance(std::begin(part), pos_partition_point);
std::cout << "partition point is at " << distance << std::endl;
}
// use: ptc partition_copy
std::vector<int> part_copy_first{};
std::vector<int> part_copy_second{};
std::partition_copy(std::begin(part), std::end(part),
std::back_inserter(part_copy_first), std::back_inserter(part_copy_second), [](const int &input)
{ return input >= 5; });
printList(part_copy_first);
printList(part_copy_second);
// use: ipt is_partitioned
if (!std::is_partitioned(std::begin(part), std::end(part), [](const int &input)
{ return input % 2 == 0; }))
{
std::cout << "part is NOT partitioned!" << std::endl;
}
// use: spt stable_partition
printList(part);
auto pos_stable_partition = std::stable_partition(std::begin(part), std::end(part), [](const int &input)
{ return input % 2 == 0; });
if (pos_stable_partition != std::end(part))
{
printList(part);
}
// use: ipt is_partitioned
if (std::is_partitioned(std::begin(part), std::end(part), [](const int &input)
{ return input % 2 == 0; }))
{
std::cout << "part now partitioned!" << std::endl;
}
// use: iss is_sorted
if (!std::is_sorted(std::begin(part), std::end(part)))
{
std::cout << "NOT sorted" << std::endl;
}
sortVector(part);
if (std::is_sorted(std::begin(part), std::end(part)))
{
std::cout << "sorted" << std::endl;
}
// use: isu is_sorted_until
auto pos_is_sorted_until = std::is_sorted_until(std::begin(part), std::end(part) - 4);
if (pos_is_sorted_until != std::end(part))
{
std::cout << "sorted at least until length " << part.size() - 4 << std::endl;
}
// use: lxc lexigraphical_compare -> fix provided
std::vector<int> smaller{1, 2, 3, 4};
std::vector<int> greater{2, 3, 4, 5};
auto is_less = std::lexicographical_compare(std::begin(smaller), std::end(smaller),
std::begin(greater), std::end(greater));
if (is_less)
{
printList(smaller);
std::cout << " is lexicographically smaller than" << std::endl;
printList(greater);
}
// use: mme minmax_element
auto minmax = std::minmax_element(std::begin(greater), std::end(greater));
std::cout << "min-max: " << *minmax.first << "-" << *minmax.second << std::endl;
// use: mne min_element
auto pos_min_element = std::min_element(std::begin(greater), std::end(greater));
std::cout << "min element: " << *pos_min_element << std::endl;
// use: msm mismatch
std::vector<int> mismatch{2, 3, 5, 5};
printList(greater);
printList(mismatch);
auto values = std::mismatch(std::begin(greater), std::end(greater), std::begin(mismatch));
if (values.first != std::end(greater))
{
auto distance = std::distance(std::begin(greater), values.first);
std::cout << "first mismatch " << *values.first << " at position " << distance << std::endl;
}
printList(greater);
// use: mxe max_element
auto pos_max_element = std::max_element(std::begin(greater), std::end(greater));
std::cout << "max element: " << *pos_max_element << std::endl;
// use: nno none_of
if (std::none_of(std::begin(greater), std::end(greater), [](const int &input)
{ return input < 1; }))
{
std::cout << "None of the elements is less than 1." << std::endl;
}
// use: srh search
auto pos_search = std::search(std::begin(first), std::end(first),
std::begin(second), std::end(second));
if (pos_search != std::end(first))
{
auto distance = std::distance(std::begin(first), pos_search);
printList(second);
std::cout << " found within ";
printList(first);
std::cout << " at position " << distance << std::endl;
}
// use: srn search_n
printList(part);
auto pos_search_n = std::search_n(std::begin(part), std::end(part), 2, 5);
if (pos_search_n != std::end(part))
{
auto distance = std::distance(std::begin(part), pos_search_n);
std::cout << "2 consecutive 5's found at " << distance << std::endl;
}
// use: mkh make_heap
// A heap is a binary tree-based data structure that satisfies the heap property,
// which states that for every node "i" in the heap, the value at "i" is greater
// than or equal to the values of its children.
printList(part);
std::make_heap(std::begin(part), std::end(part));
// within heap structure, min and max values can be accessed in O(k)
// time; pop_heap of max or minimum value in O(log n); sort heap in O(n log n)
// priority queue to pop out min or max values (process ids, etc)
printList(part);
// // use: phh push_heap
part.push_back(12);
part.push_back(9);
std::push_heap(std::begin(part), std::end(part));
printList(part);
std::make_heap(std::begin(part), std::end(part));
printList(part);
// // use: pph pop_heap
std::pop_heap(std::begin(part), std::end(part));
std::cout << "max value: " << part.back() << std::endl;
part.pop_back();
printList(part);
// use: nth nth_element
// usefull if just needed median
// or largest, smallest values without sorting whole list
// left are smaller or equal; right are greater than value at second arg position in
// std::nth_element
std::nth_element(std::begin(part), std::begin(part) + part.size() / 2, std::end(part));
std::cout << "median is " << *(std::begin(part) + part.size() / 2) << std::endl;
printList(part);
std::nth_element(std::begin(part), std::begin(part), std::end(part));
std::cout << "smallest element is " << *(std::begin(part)) << std::endl;
printList(part);
std::nth_element(std::begin(part), std::end(part) - 1, std::end(part));
std::cout << "largest element is " << *(std::end(part) - 1) << std::endl;
printList(part);
// be sure that part is a heap again
std::make_heap(std::begin(part), std::end(part));
printList(part);
// // use: sth sort_heap
std::sort_heap(std::begin(part), std::end(part));
printList(part);
std::random_shuffle(std::begin(part), std::end(part));
printList(part);
// use: pst partial_sort
// just guarantees that until std::begin(part) + 2 is sorted
// smaller or greater number after std::begin(part) + 2 can
// occur
std::partial_sort(std::begin(part), std::begin(part) + 4, std::end(part));
printList(part);
std::vector<int> part_copy(part.size());
// use: psc partial_sort_copy
std::partial_sort_copy(std::begin(part), std::end(part) - 3,
std::begin(part_copy), std::end(part_copy));
printList(part_copy);
printList(part);
// use: srt sort
std::sort(std::begin(part), std::end(part), std::greater_equal<int>());
printList(part);
// use: sts stable_sort
// same as stable but order within ranges is preserved
std::stable_sort(std::begin(part), std::end(part));
printList(part);
return 0;
}
|