#multimap

[merjashourov]

What are the important topics in the C++ language?

C++ Introduction

C++ Basics

Features

Installation

cout, cin, end

Variable

Data types

Keywords

Operators

Identifiers

Expression

3. Control statement

If-else and it's type

Switch

Loop

Entry control

Exit control

Break statement

Continue statement

Goto statement

Comment statement

4. Function

Call by values and call by reference

Recursion

Storage classes

5. Array

Simple array

Multidimensional array

6. Pointer basic

Pointers

Refrences

Memory management

7. Object and Class

Object oriented programme introduction and benifites and concept

Object class

Constructor

Destructor

Static

Structure

Enumeration

Friend function

Math function

8. Inheritance

9. Polymorphism

10. Abstraction

11. Namespace

12. Strings

13. Exception

Exception handling

Try/catch

User defined

14. Templates

15. Signal handling

16. File and Stream

File and stream

getline()

17. int to string

18. STL (Standard Template Library)

STL components

Vector

Deque

List

Set

Stack

Queue

Priority queue

Map

Multimap

Betset

Algorithm

And many more

19. Iterators and it's concept

20. After above can go through to C++11 and C++17

[neelkamble]

Texturing Techniques for Realistic Characters: Insights from 80.LV

Accomplishing photorealistic surfaces for 3D characters stays one of the most difficult parts of character creation. On 80.LV, professionals' most recent insights shed light on a number of key techniques that are pushing the boundaries of realism in character texturing.

Layered Approach to Skin Texturing The texture of the skin is one of the most important aspects of creating characters with life. Multiple texture maps in a layered approach have emerged as the best method for producing convincing results. According to 3D artist Wooper, realistic skin typically employs four essential maps:

Color map

Displacement map

Specular map

Subsurface scattering (SSS) map

Leveraging High-Resolution Texture Resources

Numerous craftsmen are exploiting excellent surface assets to lay out areas of strength for a for their personality surfaces. Wooper specifically recommends beginning with Texturing XYZ multimaps, which offer extremely detailed skin textures captured from actual subjects[6]. A level of micro-detail that would take a lot of time to create manually is provided by these resources.

Projection and Refinement Workflow Projecting base textures onto the 3D model and then fine-tuning them to match the character is a common workflow. Programming like Mari is regularly utilized for this cycle, permitting craftsmen to project surfaces precisely and make restricted adjustments[6]. This method combines the customization required for unique characters with the efficiency of using pre-made textures.

Proper Shader Setup Is Critical The final step in achieving realism is setting up the shaders so they can correctly interpret the texture maps. As Wooper notes, understanding how delivering motors like Arnold process different surface guides is critical for accomplishing the ideal result[6]. This highlights the significance of specialized information close by imaginative expertise in current person finishing.

Conclusion

The bits of knowledge from 80.LV feature a complex way to deal with practical person finishing that consolidates excellent base surfaces, modern layering procedures, and cautious refinement. By taking on these techniques, craftsmen can make unquestionably similar computerized characters that push the limits of what's conceivable in 3D designs.

References:

Kessler, A. (2023) 80 Level Digest: Great resources on character design in games. https://80.lv/articles/80-level-digest-great-resources-on-character-design-in-games/.

[myprogrammingsolver]

Compare two back ends for a dictionary

The description provided for this problem: Compare two back ends for a dictionary, such as a binary tree and a hash table. For example, in the C++ standard library, std::multimap can be used to easily store a dictionary of key-value pairs in a balanced binary tree, while std::unordered_multimap can be used to store values in a hash table. Other structures such as a sorted array could also be used…

[mikeodden01]

Exploring the World of Education with World Maps Online | Washington

In today's diverse and interconnected world, understanding geography and cultures is crucial for students of all ages. At World Maps Online, we cater to the educational needs of classrooms ranging from elementary education to college level, offering an extensive range of educational pull-down maps and globes. Our mission is to provide high-quality educational resources that enhance the learning experience and make geography an engaging subject for students.

Educational Pull-Down Maps: Navigating the World in Classrooms

Our collection of educational pull-down maps is designed to meet the specific requirements of various classrooms. Whether you are teaching social studies, world cultures, or history, having a relevant and accurate map is essential. Our pull-down maps are available in a variety of formats, including individual maps, multimap sets, and special classroom packages. These maps are not just pieces of paper; they are gateways to exploring the world from the comfort of the classroom.

Digital Classroom Maps: Bringing Geography to the Digital Age

In addition to traditional pull-down maps, we offer digital classroom maps that bring the world into the digital age. These interactive maps provide students with a dynamic learning experience, allowing them to explore different regions, cultures, and historical events with just a click. Our digital maps are user-friendly, visually appealing, and packed with informative content, making learning both fun and educational.

A Wide Range of Choices to Suit Every Classroom

At World Maps Online, we understand that different classrooms have different needs. That's why we offer a diverse range of products to choose from:

US/World Spring Roller Combos: Perfect for classrooms that need comprehensive maps covering both the United States and the world.

Mounting Hardware: Essential accessories to ensure your maps are securely displayed in the classroom.

Multi-Map Pull-Down Combo Sets: Ideal for educators teaching multiple subjects or themes.

Language Maps: Explore the world in different languages with our Spanish and French language maps.

History Map Sets: Dive into the rich tapestry of world and U.S. history with our specialized map sets.

State Maps on Spring Roller: State-specific maps for a detailed understanding of the United States.

Classroom Map Rugs: Engage younger students with interactive and colorful map rugs.

Educational Map Posters: Decorate your classroom walls with visually appealing and informative map posters.

Student Desk Maps and Playground Map Stencils: Innovative tools to make learning geography hands-on and interactive.

Why Choose World Maps Online?

When it comes to educational maps and resources, World Maps Online stands out for several reasons:

Quality and Accuracy: Our maps are meticulously crafted to ensure accuracy and clarity, providing reliable educational tools for teachers and students.

Variety: We offer a wide variety of maps and globes to cater to diverse educational needs, ensuring that every classroom finds the perfect resource.

Educational Value: Our maps are not just decorative items; they are educational tools that promote active learning and enhance students' understanding of the world.

User-Friendly: Whether you choose traditional pull-down maps or digital maps, our products are designed to be user-friendly, making them accessible to both educators and students.

Every classroom that teaches social studies, world cultures, or history deserves the best educational resources. At World Maps Online, we are committed to providing top-quality maps and globes that enrich the learning experience and foster a deeper appreciation for the world we live in. Explore our extensive collection today at www.worldmapsonline.com and embark on a journey of discovery and knowledge.

[leafofkudzu]

Not technically late because I still had 1min to go, but squad for the NA half of the party is up! /sqjoin or /whisper Rettek for a squad invite if you get lost in the multimap aether!

Happy Springtime, everyone! The first Saturday of a new month fast approaches, which means it's time for another art party hosted by my guild, [VS] Verdant Shield! This time we'll be in a place every asura has been at least once - the Golemagical Institute!

For those who aren’t familiar with art parties, they’re a concept carried over from Final Fantasy XIV - in-game get-togethers for artists/writers/creatives of all types to hang out, chat, and create together! Get your favorite character/look together, head to the location, find someone that catches your eye, and create! Afterwards, everyone posts their creations in a shared tag (ours is #VSArtParty) so others can see, interact, and share! Tl;dr: the ‘goal’ of an art party isn’t to be drawn, but to draw others, and share with the community!

Time and /squadjoin information is under the cut, but will also be posted again via reblogs as the squads go up on the day of the party!

Location Information:

I wasn't kidding when I said every asura has been to the Golemagical Institute - it's the setting of the final fight of the tutorial instance, and is accessible out of the instance via the exact same asura gate, no mounts or funny business required!

Time & Squad Details:

As we always do, we’ll be having two parties - one on EU servers and one on NA ones - with an hour break in between. People tend to arrive early and/or jump between accounts as soon as the break comes up, so don’t be surprised to see tags and announcements going up ahead of schedule!

The first party will be on EU servers and begin at 9pm Central European Summer Time (aka 3pm Eastern Daylight Time or 5 hours before in-game reset). I’ll be hosting on my EU alt account, so to join either /squadjoin or whisper Paranomalous Plexxi for an invite.

The second party will be on NA servers and begin at 7pm Eastern Daylight Time (aka 1am Central European Summer Time or an hour before in-game reset). I’ll be hosting this one on my main account, so to join either /squadjoin or whisper Rettek for an invite.

Closing Words:

Sorry for the slight delay in doing up this announcement post - I spent longer than I should have mulling over locations only to realize there's been a perfect spot right in front of me the entire time. But we're here and the post is ready now, so everything's good! :P

I use this little section to say this every time, but it continues to be true so I'll continue to say it: thank you guys so much for coming out to these and making them such fun memorable times - you are what makes these parties what they are, and I hope everyone continues to enjoy themselves for long into the future! Take care of yourselves, and I'll see you all on Saturday! ♥

[amansingh10]

In C++, a multimap is similar to a map with the additional concept, where multiple elements possess the same keys. It is also not necessary that the key values and mapped values must be unique. The scenario is different in the case of multimaps. In a multimap, keys are always found in sorted order. This ordered property makes it difficult for competitive programmers to implement multimaps.

Moreover, multi maps are associative containers that are formed by combining key-value and mapped value, which is usually sorted or is in a specific order. Elements in multimap may sometimes have equivalent keys.

A multimap has key values, which are generally used to sort and uniquely identify elements, and the mapped values store the definitions or function related to this key. Some differences in the key and mapped value may exist, which later is grouped forming pairs by combining both.

[nosarabs]

Red Black Binary Tree Tree * t; t->insert(Imperial);

[antikittysocial]

multimap rugby real

so like

You know Plosive is just insane at Project Sekai

But then that raises the question

Is Aristo unnaturally good at some game??

Yes.

It's Tetris and you can not argue /silly

BHAHHAHAQYHAHAUHQHQHHQAHHFFHEUUHRYRJRHRHHH

what about the archery game in the olympics google doodle /silly

[elianaofshiverpeaks]

It’s almost over.

[isomorphismes]

Multimaps

Cartesian functions send {A}→{B} with exactly one tail a↦ per a∈{A} connecting to each head ↦b∈{B}.

In other words B has to be equal size or smaller than A.

This is true mapping rings to rings, groups to groups, sets to sets, vector spaces to vector spaces, ... it's just a property of arrows really.

When mathematicians want to talk about "one-to-many" (using the database lingo) or "multimaps" (some stupid word I heard on Wikipedia which absolutely nobody anywhere ever thought was a good term), though, they're not left outside.

If you've got a bundle of arrows ⇶ with tails from {a₀, a₁, a₂, a₃} ⇶ {b₁₄}, then that's a bundle of tails all heading to the same place. If you "grab them all by the head"

So when mathematicians want to talk about a multimap, they use a preimage ƒ⁻¹. Let's say the kernel for example--it's "everything that gets thrown in the trash"---so if multiple things get thrownin the trash, 

(linear subspace / quotient / ring morphism kernel)

So this is how they can associate a bunch of stuff, to one point. For example every point on a manifold gets a tangent space. Maybe this is a vector space for example--which is a lot bigger than just one point.

That would be a problem for 1-to-≥1 functions, so the mathematicians need to turn the arrows around. That's why they define the projection map π:E→B to send a ton of things e∈E onto that one point b∈B i.e. p∈M.

[stickykoalaartisan]

Can you Identify the most Frequently Stolen Cars in America.

You don’t want to rush your partner to move to your city or to feel comfortable with you moving to theirs if it is too early in the relationship. נערות ליווי בבת ים It depends on what type of relationship you have -- and what type of relationship you want. In the multimap return type approach, you don't need to define any additional data classes. If your parents are divorced, you might need even more time to play musical chairs. If things are going downhill, it might be time to pull out that "Plan B" you have tucked away in your clutch. First of all, you have to ask yourself, "Is it time?" Unfortunately, there's only one clear-cut answer to this question: It depends. First and foremost, make sure your folks know about him. At a wine bar for one drink and a quick "hello" or dinner at your house so everyone can really get to know each other better?

A quick "hello" at a coffee house or local bakery will do just fine. It might not be a good idea to introduce them to the new guy you just met at your girlfriend's house party last week. Twenty-five percent said when the other person says he or she loves you, while 8 percent said once they have met the parents. While it was simple enough to put on magic shoes and say "There's no place like home," the good witch lets Dorothy know that she wasn't told this secret sooner because she wouldn't have believed her. You can access the site while on the move and while relaxing at home. The chalet is furnished with the little things that make a home. Encourage him to talk about his background and share a little bit about himself (making sure to stay away from the pesky forbidden fruits). Stay away from subject matters that could potentially ignite the flames, like who's right?

20 March 2015. Retrieved 6 August 2019. As a related matter, U.S.-based sites and services that collect information from foreign children also are subject to COPPA. You don't need to host a family reunion, but it is courteous to make sure the essential players are involved. That's why you two need to have a dress code conversation before the doorbell rings. Once you figure out the timing, you need to establish the parameters around when the introductions take place. When you get to the spot, start with introductions and light conversation to get things warmed up. It's also OK to throw in some pop culture conversation about music and reality TV. Which current pop singer do you like most? Help guide the conversation to topics like sports, news and current events. Choose flattering photos, and make sure they're current. If you don't want to spend a lot of time together for the first meeting, make it short and sweet.

If you do go there, keep it friendly if you find that he's disagreeing with them a lot. Keep the conversation casual but informative. The more options you keep open, the higher your chances of meeting people that you’ll enjoy being around. Being able to build a life full of fond memories together and support each other’s personal and career goals are also things that are considered to be good about relationships. This will prevent dinner being shut down before the entrée is served. Wolves and humans developed a symbiotic relationship at first, whereby we'd help out with hunting so that together, we could bring down bigger game. How about an NBA or NFL game? Share a little bit of family information with him. Do you wear your tried and true little black dress or should you rock your new red slacks? Slacks and an oxford shirt? You don't want to spring him on them if they don't even know he exists. So You Want Him to Meet Your Parents? In turn, have a conversation with your parents ahead of time.

[coolravish]

Understanding vector, map and their uncommon implementation:Explanation with their Code

Hey guys,this is my first article on tumblr so suggestions are most welcomed, I thought of writing an article which contains precise explanation with precise code as i am not going to waste my time by speaking on why this is needed and all,So i begin my series of articles based on the responses i will be writing articles further on ds algo etc…Mainly i will try to cover implementation portion of it by using real problems as most of the sites lacks that information.In this article i am going to discuss on following topics:

Vector

Map

So lets explore and understand about them in simple words and in detail:

Vector:-Vector is basically a dynamic array.Now you might be wondering that what exactly we mean here by dynamic?

In a nutshell:-Dynamic means flexible,means size is not fixed.Like an array has constant/fixed size,so you may have question in your mind then what is the need of using vector.See it is useful in questions where we don’t have any idea about size and in array we cannot erase values at arbitrary position,whereas we can erase values in vector using vector erase function.

Now in programming it is believed that understanding the implementation part will help you in better way rather than wasting time on reading theory,

Implementation:

Vector Representation:-vector<int>v;vector<int>v(n),vector<int>v[n];

Now you saw that i wrote three representations,so what are the differences between them.

vector<int>v:-This represents that size of vector is not fixed here,it can change according to the situation. For eg-Initially size of vector is 0,and now if i did operation v.push_back(1),here push_back is used to insert value inside vector,so now size of vector will be 1,and similarly again i perform v.push_back(8),now size of vector is 8,and lets traverse the vector…so we will write for(i=0;i<v.size();i++){v[i]……}so now we can use it as an array…push_back inserts value at the end,like in above example v[0]=1,v[1]=8…Now i told you that we can erase values in vector..So if we want to erase value at desired position then apply v.erase(v.begin()+desired position).There are other ways of erasing also.

vector<int>v(n):-This is exactly same as int a[n].

vector<int>v[n]:-This means vector of vector,this one will better understand by example.

v[0].push_back(1);v[0].push_back(8);v[4].push_back(-1);

v[6].push_back(5);

So above we saw that v[0] is one vector and inside that one another vector is present of size 2 and its elements are 1 and 8 respectively.so if we want to traverse each element individually:-

for(i=0;i<v.size();i++)

{for(j=0;j<v[i].size();j++)

{

v[i][j]……//means whatever operation you want to perform can do…as v[i][j] is individual element like v[0][1]=8,its like 2d matrix.

}

}So above v.size()==3,as one is v[0],v[4],v[6],in nutshell we understand that inside one vector one other vector is present ,this is mainly used in graphs as when you will read about depth first search there you will get to know about adjacency list.

2)Map:-Very Powerful STL tool.

Lets understand map by example.Q)Say in a class we have marks of 10 students in maths exam-10,50,50,30,24,50,20,30,10,50…our question is that count no.of students corresponding to marks obtained?Means how many have scored 50,how many have scored 10 likewise……..

So if our question would have asked calculate frequency for 50 marks only then we could have solved it easily by running a loop and taking count of 50 marks students….but here we have to calculate frequency for each individual marks….so in cases like this our Map is helpful….

Implementation:

map<int,int>m1; This is representation of map.

for(i=0;i<n;i++){

m1[a[i]]++;

}

As you can see above m1[a[i]]++,so basically map is also an array which stores value in the form of key value pair…..here key is marks and value is count of students corresponding to that marks…like m1[50]=4,m1[24]=1 in above example likewise…..so you can see map is also an array but here index is not like array one,here we have one index as 24 ,one as 50 etc…and map stores index in sorted order so like when you will traverse map..then first of all m1[10] will come then m1[24] likewise…..

Now question comes how we will traverse the map?As for traversing the array,vector we have 0-index and in ordered form…so we simply run loop for(i=0;i<n;i++) and we can easily travel them ,but in the case of map as we saw that index was like 24,50,10,30 etc..and we don’t know them beforehand so how we will tackle them…..

For traversing map,set etc we use concept of iterator

What is iterator:In simple words we can say that it is a kind of pointer.Lets move on its implementation,Like here we will traverse map using iterator,its same as traversing array using simple for loop

Implementation:

map<int,int>::iterator it=m1.begin();

for(it=m1.begin();it!=m1.end();it++)

{

int k= it->first; //means it->first refers to map key which is 24,30,50 etc..

int r= it->second; //means it->second refers to map value that is m1[50] value,m1[24] value….say m1[50]=4…so it->first=50 and it->second =4..

cout<<No.of students k marks is r<<endl;

}

3. So we saw how to traverse map using iterator…and say if we want to find maximum number of students corresponding to one particular marks,then we will apply ….if(it->second>p){p=it->second;}….inside iterator loop we will use this condition….likewise anything we can do…And we will see more applications of map,set at the end after understanding pairs ,set etc……

Above one is known as ordered map as it stores unique keys…and all keys are in sorted manner….key refers to index in basic terms….Then we have unordered map which doesn’t store keys in sorted manner and then we have multimap which allows duplicating of keys,these two we will understand further in other articles..First we should be clear with basic implementation of map..Lets discuss one more final example to have better hold on implementation part of map…say we have string=”abaaabccaababa”

And our question of is maximum frequency of occurence of any substring of size 3.I hope you have idea about string and substring and if not then let me tell you in short…A substring of size 3 in above example can be-aba,aaa,baa,aab,bcc,cca,caa etc…means continuous characters of size 3 starting from any postion is substring …in simple words

Now lets move on implementation of this question….

map<string,int>m1; Here you might be wondering that why i wrote string as key,because we are going to take count of substring so key will be string and value is count so we wrote int as value…these things you need to keep in mind while implementing map.

for(i=0;i<n-2;i++)//n=s.size(),n-2 i guess you are clear as substring of size 3 so we need to take valid input or else error will be thrown…

{

m1[s.substr(i,3)]++;

}

So here in map we will have our map like m1[“aba”],m1[“caa”],m1[“baa”] likewise…..For maximum..lets traverse the loop

map<string,int>::iterator it=m1.begin();int p=0;

for(it=m1.begin();it!=m1.end();it++)

{

if(it->second>p)

{ p=it->second;

}

}

So answer of p will be 3 as m1[“aba”]=3…and one more thing if we are required to print substring then inside that if condition just add

string s1=it->first;

So we saw the basic implementation of map,then there is one more information map contains if we will write m1.size() it returns no. of unique keys our data contains,then we have this option also m1.erase(key),means if we write m1.erase(“aba”) then our m1[“aba”] …will be erased….and we can use one more function m1.find(“aba”)…lets see its implementation

map<string,int>::iterator it1 = m1.find(“aba”);

if(it1==m1.end())

{

//means key is not present }

else if(it1!=m1.end())

{

//means key is present

}

So using this m1.find() function we can check whether key is present or not,rest function you can study from this link…Like there is one function m1.upper_bound,lower_bound this all you can study from this link…

One thing i forgot to tell you that iterator can be written in other way also like

for(auto it:m1){}||for(auto it=m1.begin();it!=m1.end();it++)

Now you know we can travel map in reverse way also like as we know that we can travel array/vector in reverse manner using for(i=n-1;i≥0;i- -) similarly here we use for(auto it=m1.rbegin();it!=m1.rend();it- -)………

Then we can store map keys in descending order by using this function

map<int,int,greater<int>()>m1; Likewise there are many more operations which you will get to know while practicing.In my further articles i will try to cover some advanced implementation of maps by solving standardized questions,as i believe that by real problems we get better feel of any topic right?

3)Some Basic Thing but sometimes tricky

To understand this lets study about pairs first…

Pairs is also a kind of array where in value portion we can store two values…

Like say rishav has got 20 marks in maths and 30 marks in science,similarly rohit has got 15 marks in maths and 0 marks in science…so how we will store theses values

Implementation

pair<int,int>p1;

p1[0].first=20,p1[0].second=30;p1[1].first=15,p1[1].second=0;if 0-index is of rishav and 1-index is of rohit.

pairs we can use in many ways now lets look on deeper implementation of it….

vector<pair<pair<int,int>,int>>v;

So what this above representation implies….This means if we write

v.push_back({{20,30},40});({}is used for make_pair operation)

so v[0].first.first=20;

v[0].first.second=30;

v[1].second=40;

Likewise if we write

vector<pair<pair<int,int>,pair<int,int>>>v;

v.push_back({{20,0},{10,30}});

so in this way we can store value for above representation

which means v[0].first.first=20;

v[0].first.second=0;

v[1].second.first=10;

v[1].second.second=30;

so i guess you are getting some feeling by observing few examples above.

We can use pairs in map also like see.

map<pair<string,string>,int>m1;

m1.insert({{rohit,rishav},4});

m1[{rohit,rishav}]=4;

here key is {rohit,rishav} and value is 4.

map<int,vector<int>>m1;

what does this mean…

m1[1].push_back(4);

m1[1].push_back(-1);

m1[3].push_back(6);

m1[3].push_back(4);

so how we will traverse map in such case…

map<int,vector<int>>::iterator it=m1.begin();

for(it=m1.begin();it!=m1.end();it++)

{

for(j=0;j<it->second.size();j++)

{

if(it->second[j] ) //so this it->second[j] this term tells us the values present inside the vector like m1[1] contains -1,4 etc…..likewise…so in this way we can traverse the map…for this case

}

}

We can have many operations like this say

map<pair<int,int>,vector<int>>m1;

map<int,set<int>>m1;

map<int,multiset<int>>m1;

map<string,pair<string,int>>m1;

etc…..

Set/multiset we will discuss in further articles….

Suggestions are welcomed

[collapsedsquid]

9 bp you can run into multimapping issues and you might want to form a longer structure than that if you want base pairing, you're right 64 bp is too long though.

Do kind of wonder how they discovered this structure, how would you tell the difference between a barcode unique to each gene and a randomly evolving spacer?

Reading a reddit post from someone who alleges they sequenced aliens and some of it is "Ooh this person doesn't understand biology, they talked like there's no such things non-coding RNA" but then I remember that some actual biologists will forget that non-coding RNA exists too.

[tototavros]

prevented from committing atrocities on main due to haskell's generalizedness

I was trying to write

instance Functor f => MultiMap (a -> b) (f a) (f b) where mmap = fmap instance Applicative f => MultiMap (a -> b -> c) ((f a, f b)) (f c) where mmap f (fa, fb) = pure f fa fb

but i realized that my previous fundeps on MultiMap where getting in the way (since (f a, f b) unifies with Functor f => f a (because of the (a,) functor), but then also realized that (a -> b -> c) unifies with (a -> b) so it's really a damned if you do i think when trying to work on that level of polymorphic code

[elianaofshiverpeaks]

AB MM in a nutshell.

[cognitiveprogrammer]

Welcome to C++17 STL (The Standard Template Library) Video Series Using LEGO Blocks In this video, I'll explain what are STL Containers and Container Adapters which will cover 1. Sequence Containers (array, vector, deque, list & forward_list) 2. Associative Containers (map, multimap, set & multiset) 3. Adapters (Stack, Queue, Priority Queue) I've used LEGO blocks to explain all the above, hope you'll not only like the explanation but also understand the same Feel free to connect with me @ Twitter: https://twitter.com/CodesBay Facebook: https://www.facebook.com/CodesBay Instagram: https://www.instagram.com/CodesBay Github: https://github.com/CodesBay Pinterest: https://in.pinterest.com/CodesBay Tumblr:  https://CodesBay.tumblr.com Web: http://www.CodesBay.com #cpp #cplusplus #stl #template #lego #programming #library #boost #code #coding #linux #unix #ubuntu