Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 72527
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 10, 20262026-05-10T20:03:31+00:00 2026-05-10T20:03:31+00:00

Is there any way of doing parallel assignment in C++? Currently, the below compiles

  • 0

Is there any way of doing parallel assignment in C++? Currently, the below compiles (with warnings)

#include <iostream>   int main() {    int a = 4;   int b = 5;   a, b = b, a;   std::cout << 'a: ' << a << endl             << 'b: ' << b << endl;    return 0; } 

and prints:

a: 4 b: 5 

What I’d like it to print … if it weren’t obvious, is:

a: 5 b: 4 

As in, say, ruby, or python.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. 2026-05-10T20:03:31+00:00Added an answer on May 10, 2026 at 8:03 pm

    That’s not possible. Your code example

    a, b = b, a; 

    is interpreted in the following way:

    a, (b = b), a 

    It does nothing. The comma operator makes it return the value of a (the right most operand). Because assignment binds tighter, b = b is in parens.

    The proper way doing this is just

    std::swap(a, b); 

    Boost includes a tuple class with which you can do

    tie(a, b) = make_tuple(b, a); 

    It internally creates a tuple of references to a and b, and then assigned to them a tuple of b and a.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Are there any other way of doing this query: SELECT CONCAT_WS( , strLname, strFname,
Is there any way to create the query parameters for doing a GET request
Is there any way to specify a width when doing :vsplit? Also, is there
I am doing 2^1000 and I am getting this: 1.07151e+301 Is there any way
is there any way of doing the following Unicorn.objects.or_filter(magical=True).or_filter(unicorn_length=15).or_filter(skin_color='White').or_filter(skin_color='Blue') where or_filter stands for an
Is there any way of doing something like this in haskell ? data Fruits
Is there any way of doing a 301 redirect such that the final destination
Is there any way to update cookies across folders in PHP? For example, consider
Is there any way to trigger a function that's called when the user types
:) Is there any way to create an index, and incrementing with a given

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.