bitset test() in C++ STL

std::bit_xor in C++ with Examples

Last Updated : 01 May, 2020

The bit_xor is an inbuilt function in C++ which is used to perform bitwise_xor and return the result after applying the bitwise_xor operation on it's arguments. Header File:

#include <functional.h>

Template Class:

template <class T> struct bit_xor;

Parameters: It accepts a parameter T which is the type of the argument to be compared by the functional call. Note:

Objects of this class can be used on standard algorithms such as transform or accumulate.
Member functions ( 'operator()' ) returns the bit_xor of its arguments.

We must include the library 'functional' and 'algorithm' to use bit_xor and transform() respectively. Below is the illustration of bit_xor in C++: Problem 1:

CPP

// C++ program to illustrate bit_xor in C++

#include <algorithm>
#include <functional> // to include bit_xor
#include <iostream>
#include <iterator>
using namespace std;

int main()
{
    // declaring the values
    int A[] = { 1, 2, 3, 4, 5, 6 };
    int B[] = { 6, 7, 8, 4, 5, 0 };
    int n = 6;
    // defining result
    int result[n];

    // transform is used to apply bitwise_xor
    // on the arguments A and B
    transform(A, end(A), B,
              result, bit_xor<int>());

    // printing the resulting array
    cout << "A xor B = ";
    for (const int& answer : result)
        cout << ' ' << answer;

    return 0;
}

Output:

A xor B =  7 5 11 0 0 6

Program 2:

CPP

// C++ program to illustrate bit_xor in C++

#include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
using namespace std;

int main()
{
    // declaring the values
    int A[] = { 0, 0xff, 15, 22 };
    int B[] = { 1, 255, 0xfa, 0x16 };
    int n = 4;
    // defining result
    int result[n];

    // transform is used to apply bitwise_xor
    // on the arguments A and B
    transform(A, end(A), B,
              result, bit_xor<int>());

    // printing the resulting array
    cout << "A xor B = ";
    for (const int& answer : result)
        cout << ' ' << answer;

    return 0;
}

Output:

A xor B =  1 0 245 0

Reference: https://en.cppreference.com/w/cpp/utility/functional/bit_xor

bitset test() in C++ STL

harshit_chari

Improve

Article Tags :

Practice Tags :

CPP

Similar Reads

Binary literals in C++14 with Examples

In this article, we will discuss Binary literals in C++14. While writing programs which involve mathematical evaluations or various types of number, we usually like to specify each digit type with specific prefix i.e., For Hexadecimal number use the prefix '0x' and for Octal number use the prefix '0

Life cycle of Objects in C++ with Example

In Object Oriented Programming, Objects are the instances of a class which has its own state(variables) and behavior(methods). Every class has two special methods related with creation and destruction of object of a class- constructors and destructors. C++ Object Life Cycle: There are various steps

How to Create Stack of Bitset in C++?

In C++, a stack is a container adapter that provides a last-in, first-out (LIFO) type of data structure with two major operations, namely push and pop while Bitset is a container that can store N bits and provides constant-time operations to manipulate individual bits. In this article, we will learn

bitset test() in C++ STL

bitset::test() is an inbuilt function in C++ STL which tests whether the bit at a given index is set or not. Syntax: bitset_name.test(index) Parameters: The function accepts only a single mandatory parameter index which specifies the index at which the bit is set or not. Return Value: The function r

How to Set, Clear, and Toggle a Single Bit in C++?

In bit manipulation, setting a bit, clearing a bit, and toggling a single bit are basic operations. We can easily carry out these operations using the bitwise operators in C++. In this article, we will see how to set, clear, and toggle operations on the Kth bit. Example Input: N = 15, K = 0Output: S

Equal Sum and XOR of three Numbers

Given an integer N. The task is to count the numbers of pairs of integers A and B such that A + B + N = A ^ B ^ N and A and B are less than N.Examples: Input: N = 2 Output: 3 Explanation:- For N = 2 2 XOR 0 XOR 0 = 2+0+0 2 XOR 0 XOR 1 = 2+0+1 2 XOR 0 XOR 2 != 2+0+2 2 XOR 1 XOR 0 = 2+1+0 2 XOR 1 XOR

How to Use Bit Manipulation Methods in C++

Bit manipulation is a technique used for optimizing performance and memory usage in various programming scenarios. It is very useful from a Competitive Programming point of view. In this article, we will learn how we can use bit manipulation methods in C++ and provide examples to help you understand

Bitwise XOR of elements having odd frequency

Given an array arr[] of N elements, the task is to find the XOR of the elements which appear an odd number of times in the array.Examples: Input: arr[] = {1, 2, 1, 3, 3, 4, 2, 3, 1} Output: 6 Elements with odd frequencies are 1, 3 and 4. And (1 ^ 3 ^ 4) = 6 Input: arr[] = {2, 2, 7, 8, 7} Output: 8 N

bitset count() in C++ STL

bitset::count() is an inbuilt STL in C++ which returns the number of set bits in the binary representation of a number. Syntax: int count() Parameter: The function accepts no parameter. Return Value: The function returns the number of set bits. It returns the total number of ones or the number of se

Count of even set bits between XOR of two arrays

Given two arrays A[] and B[] having N and M positive elements respectively. The task is to count the number of elements in array A with even number of set bits in XOR for every element of array B. Examples: Input: A[] = { 4, 2, 15, 9, 8, 8 }, B[] = { 3, 4, 22 } Output: 2 4 4 Explanation: Binary repr