Introduction to Text Manipulation

Text manipulation is a major part of most programs. Almost any program that does something useful with people or data has to deal with words, names, lines, and messages at some point. Whether a program reads a name, searches a document, or rearranges words, it has to store text and change it in useful ways.

Because this need shows up so often, C++ provides tools for working with text. This article introduces those basic tools so that later work with specific text operations has a clear foundation. The aim here is to build a mental picture of the pieces first: where text is stored, what helps you change it, and what helps you find things inside it.

To see why these tools matter, follow one piece of text through a small task. Suppose a program asks a user for a full name, stores it, checks whether it contains a particular word, and then rearranges the words before printing them. Each step depends on the text being held in a form the program can work with.

Notice that the example did not need any special knowledge of how characters sit in memory. It needed a way to hold the text, a way to search for part of it, and a way to change it. The rest of the article looks at the C++ tools that supply these abilities.

The string type is part of the C++ standard library, which means it is provided for you rather than something you must build yourself. Its main purpose is to simplify text manipulation. Instead of working with raw character arrays and the pointers that move through them, you work with a string object that the library provides.

The source contrasts two ways of handling text. The first is C-style manipulation of arrays of characters through pointers. The second is the string type from the standard library. The table below summarizes that contrast.

Where the string type helps you hold and handle text, regular expression matching helps you locate things inside it. The idea is to describe a pattern and then find where that pattern appears in a piece of text. You give the matcher a pattern and a text, and the matching process reports whether the pattern appears and where.

Read the diagram from top to bottom. The pattern and the text both go into the matching step. The result is either a match or no match. When a match is found, the program knows which parts of the text the pattern covered. This is the basic workflow behind searching text by description rather than by an exact copy of the characters.

The source notes that C++ provides regular expressions in a form similar to what is common in most modern languages. A programmer who has used regular expressions in another language will therefore find the core idea familiar, even though the details of C++ syntax are covered in later work.

The source states that both string and regex objects can use a variety of character types, and it gives Unicode as one example. This means the text handled by these objects is not restricted to one narrow set of characters. The character type is a choice that these objects can support in more than one form.

The diagram shows the central idea: a single family of string and regex objects can be used with more than one character type. The choice of character type is part of how the text is represented. The chapter introduces these types at the level of the big picture, so the important point for now is that the same kinds of text tools work across several character types rather than only one.