Home Backend Development C++ Why Does Assigning to a Map Element in C Result in an Unexpected Size?

Why Does Assigning to a Map Element in C Result in an Unexpected Size?

Nov 01, 2024 am 08:36 AM

 Why Does Assigning to a Map Element in C   Result in an Unexpected Size?

Evaluation Order of Assignment Statements in C

A puzzling output can be obtained when assigning a value to a map:

<code class="cpp">map<int, int> mp;
printf("%d ", mp.size());
mp[10] = mp.size();
printf("%d\n", mp[10]);</code>
Copy after login

This code prints:

0 1
Copy after login

This result may seem counterintuitive, as one might expect the map size to be 1 after the assignment. However, the evaluation order of the assignment statement plays a crucial role here.

The left-hand side of the assignment mp[10] returns a reference to the underlying value of the map element. Simultaneously, this action creates a new value for the mp[10] element. Only after this operation is the right-hand side evaluated, using the newly calculated size of the map.

This behavior is not explicitly stated in the C standard but falls under unspecified behavior. A recent proposal, N4228, aims to refine the order of evaluation rules to specify such cases.

The relevant section of the draft C 11 standard (1.9) states that evaluations of subexpressions of individual expressions are generally unsequenced. However, function calls (such as operator [] and size()) are sequenced before the execution of the called function's body.

Therefore, the right operand of the assignment expression is sequenced after the left operand, resulting in the observed behavior. This means that the order of evaluation is as follows:

  1. Evaluate the right operand: mp.size()
  2. Create the value for the left operand: mp[10]
  3. Assign the value of the right operand to the left operand

An update to the C standard is expected to specify this behavior, making it clear that the right operand of an assignment expression is sequenced before the left operand.

The above is the detailed content of Why Does Assigning to a Map Element in C Result in an Unexpected Size?. For more information, please follow other related articles on the PHP Chinese website!

Statement of this Website
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn

Hot AI Tools

Undresser.AI Undress

Undresser.AI Undress

AI-powered app for creating realistic nude photos

AI Clothes Remover

AI Clothes Remover

Online AI tool for removing clothes from photos.

Undress AI Tool

Undress AI Tool

Undress images for free

Clothoff.io

Clothoff.io

AI clothes remover

AI Hentai Generator

AI Hentai Generator

Generate AI Hentai for free.

Hot Article

R.E.P.O. Energy Crystals Explained and What They Do (Yellow Crystal)
3 weeks ago By 尊渡假赌尊渡假赌尊渡假赌
R.E.P.O. Best Graphic Settings
3 weeks ago By 尊渡假赌尊渡假赌尊渡假赌
R.E.P.O. How to Fix Audio if You Can't Hear Anyone
3 weeks ago By 尊渡假赌尊渡假赌尊渡假赌
WWE 2K25: How To Unlock Everything In MyRise
3 weeks ago By 尊渡假赌尊渡假赌尊渡假赌

Hot Tools

Notepad++7.3.1

Notepad++7.3.1

Easy-to-use and free code editor

SublimeText3 Chinese version

SublimeText3 Chinese version

Chinese version, very easy to use

Zend Studio 13.0.1

Zend Studio 13.0.1

Powerful PHP integrated development environment

Dreamweaver CS6

Dreamweaver CS6

Visual web development tools

SublimeText3 Mac version

SublimeText3 Mac version

God-level code editing software (SublimeText3)

C language data structure: data representation and operation of trees and graphs C language data structure: data representation and operation of trees and graphs Apr 04, 2025 am 11:18 AM

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.

How does the C   Standard Template Library (STL) work? How does the C Standard Template Library (STL) work? Mar 12, 2025 pm 04:50 PM

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

How do I use algorithms from the STL (sort, find, transform, etc.) efficiently? How do I use algorithms from the STL (sort, find, transform, etc.) efficiently? Mar 12, 2025 pm 04:52 PM

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

How do I handle exceptions effectively in C  ? How do I handle exceptions effectively in C ? Mar 12, 2025 pm 04:56 PM

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

How do I use rvalue references effectively in C  ? How do I use rvalue references effectively in C ? Mar 18, 2025 pm 03:29 PM

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)

The truth behind the C language file operation problem The truth behind the C language file operation problem Apr 04, 2025 am 11:24 AM

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.

How do I use ranges in C  20 for more expressive data manipulation? How do I use ranges in C 20 for more expressive data manipulation? Mar 17, 2025 pm 12:58 PM

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.

How do I use move semantics in C   to improve performance? How do I use move semantics in C to improve performance? Mar 18, 2025 pm 03:27 PM

The article discusses using move semantics in C to enhance performance by avoiding unnecessary copying. It covers implementing move constructors and assignment operators, using std::move, and identifies key scenarios and pitfalls for effective appl

See all articles