Focus on the container class from the STL.
Latest General Articles
Explore the concepts behind constructors and destructors, along with their implementations in C++.
Vectors are one of the single most useful and most used objects in the STL. They are easy to use, and remove the burden of memory management from the user. It is possible to partially control memory usage by using functions like
reserve, but nothing is provided to free up excess memory. Users have come up with ways to trim a vector by hand, but with the advent of the new C++0x and its move semantics, the classic solution of copy-swaping has become excessively expensive. This article seeks to find a better solution.
Unquestionably, the most effective tool for a C++ programmer's productivity is the Standard library's rich collection of algorithms. In 2008, about 20 new algorithms were voted into the C++0x draft standard. These new algorithms let you among the rest copy n elements intuitively, perform set theory operations, and handle partitions conveniently. Find out how to use these algorithms to make your code more efficient and intuitive.
Classify a point respect to a plane polygon that can be concave (i.e. with some angle grater than 180 degrees). Good performance, excellent stability.
Linear Search based algorithm for Mth Lexicographic ordering of Mathematical Permutation and Combina
Algorithms to compute the M-th lexicographic ordering of a permutation or combination and the inverse problem of the rank of a given permutation or sequence.
Latest CodeGuru Developer Columns
With the addition of the C/C++ extension to Visual Studio Code, you might have what is needed in a small, cross-platform editor.
Learn to use LiteDB, is a simple, serverless, fast and lightweight, embedded .NET document database written in .NET C# managed code.
Discover four different ways to read your own application's metadata. Examples are in C# and VB.NET.
Onion Architecture addresses the challenges faced with 3-tier and n-tier architectures, and provides a solution for common problems.