Does STL Method Chaining Preserve Evaluation Order in C ?
Does Chaining STL Methods in C Preserve Evaluation Order?
In Bjarne Stroustrup's "The C Programming Language" 4th edition, the following code snippet exemplifies method chaining:
<code class="cpp">void f2() { std::string s = "but I have heard it works even if you don't believe in it"; s.replace(0, 4, "").replace(s.find("even"), 4, "only").replace(s.find(" don't"), 6, ""); assert(s == "I have heard it works only if you believe in it"); }</code>
This code evaluates statements from left to right, altering the string s incrementally. However, the behavior of this expression is ambiguous depending on the compiler used:
- Clang: Evaluation follows the expected order, resulting in s as "I have heard it works only if you believe in it".
- GCC: The evaluation order is unpredictable, causing s to take on an incorrect value.
- Visual Studio: Similar to GCC, the evaluation is ambiguous, often producing the same incorrect result.
Unveiling the Unspecified Behavior
The code exhibits unspecified behavior because of the indeterminate order of evaluation of subexpressions, despite not invoking undefined behavior. The crux of the issue lies in the evaluation order of function arguments within chained function calls.
Specifically, for the following sub-expressions:
- s.find("even")
- s.find(" don't")
Their evaluation order is indeterminate with respect to:
- s.replace(0, 4, "")
This means that the find calls can be evaluated before or after the replace call, affecting the length of s and consequently altering the results of the find calls.
Illustration with Custom Find Function
To demonstrate this ambiguity, a modified version of the code uses a custom my_find function that reports the position of the search strings in each sub-expression evaluation:
<code class="cpp">std::string::size_type my_find(std::string s, const char *cs) { std::string::size_type pos = s.find(cs); std::cout << "position " << cs << " found: " << pos << std::endl; return pos; }</code>
Running this code with different compilers yields different results depending on the evaluation order:
- Clang: my_find is evaluated for "even" before it is evaluated for "don't," resulting in the correct output.
- GCC: my_find is evaluated for "don't" before it is evaluated for "even," leading to an incorrect result.
C 17 Changes
The C 17 standard (p0145r3) introduces refinements to the expression evaluation order rules to address this ambiguity. It strengthens the order of evaluation for postfix-expressions and their expression-list as follows:
- The postfix-expression is sequenced before each expression in the expression-list and any default argument.
This ensures that chained method calls evaluate in the expected order, resolving this undefined behavior in C 17.
The above is the detailed content of Does STL Method Chaining Preserve Evaluation Order in C ?. For more information, please follow other related articles on the PHP Chinese website!

Hot AI Tools

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Undress AI Tool
Undress images for free

Clothoff.io
AI clothes remover

AI Hentai Generator
Generate AI Hentai for free.

Hot Article

Hot Tools

Notepad++7.3.1
Easy-to-use and free code editor

SublimeText3 Chinese version
Chinese version, very easy to use

Zend Studio 13.0.1
Powerful PHP integrated development environment

Dreamweaver CS6
Visual web development tools

SublimeText3 Mac version
God-level code editing software (SublimeText3)

Hot Topics



C language data structure: The data representation of the tree and graph is a hierarchical data structure consisting of nodes. Each node contains a data element and a pointer to its child nodes. The binary tree is a special type of tree. Each node has at most two child nodes. The data represents structTreeNode{intdata;structTreeNode*left;structTreeNode*right;}; Operation creates a tree traversal tree (predecision, in-order, and later order) search tree insertion node deletes node graph is a collection of data structures, where elements are vertices, and they can be connected together through edges with right or unrighted data representing neighbors.

This article explains the C Standard Template Library (STL), focusing on its core components: containers, iterators, algorithms, and functors. It details how these interact to enable generic programming, improving code efficiency and readability t

This article details efficient STL algorithm usage in C . It emphasizes data structure choice (vectors vs. lists), algorithm complexity analysis (e.g., std::sort vs. std::partial_sort), iterator usage, and parallel execution. Common pitfalls like

This article details effective exception handling in C , covering try, catch, and throw mechanics. It emphasizes best practices like RAII, avoiding unnecessary catch blocks, and logging exceptions for robust code. The article also addresses perf

The truth about file operation problems: file opening failed: insufficient permissions, wrong paths, and file occupied. Data writing failed: the buffer is full, the file is not writable, and the disk space is insufficient. Other FAQs: slow file traversal, incorrect text file encoding, and binary file reading errors.

Article discusses effective use of rvalue references in C for move semantics, perfect forwarding, and resource management, highlighting best practices and performance improvements.(159 characters)

C 20 ranges enhance data manipulation with expressiveness, composability, and efficiency. They simplify complex transformations and integrate into existing codebases for better performance and maintainability.

The article discusses dynamic dispatch in C , its performance costs, and optimization strategies. It highlights scenarios where dynamic dispatch impacts performance and compares it with static dispatch, emphasizing trade-offs between performance and
