Demonstrate bitwise | : bitwise OR « Operators statements

Demonstrate bitwise | : bitwise OR « Operators statements « C++ Tutorial

1.	Language Basics
2.	Data Types
3.	Operators statements
4.	Array
5.	Development
6.	Exceptions
7.	Function
8.	Structure
9.	Class
10.	Operator Overloading
11.	Pointer
12.	File Stream
13.	template
14.	STL Introduction
15.	string
16.	vector
17.	list
18.	bitset
19.	set multiset
20.	valarray
21.	queue stack
22.	deque
23.	map multimap
24.	STL Algorithms Modifying sequence operations
25.	STL Algorithms Non modifying sequence operations
26.	STL Algorithms Binary search
27.	STL Algorithms Sorting
28.	STL Algorithms Merge
29.	STL Algorithms Min Max
30.	STL Algorithms Iterator
31.	STL Algorithms Heap
32.	STL Algorithms Helper

C / ANSI-C

C Tutorial

C++

Visual C++ .NET

C++ Tutorial » Operators statements » bitwise OR

3.10.2.Demonstrate bitwise |

#include <iostream>

using std::cout;



#include <iomanip>

using std::endl;

using std::setw;



void displayBits( unsigned );



int main()

{

   unsigned number1;

   unsigned number2;

   unsigned mask;

   unsigned setBits;



   

   

   number1 = 15;

   setBits = 241;

   cout << "\nThe result of combining the following\n";

   displayBits( number1 );

   displayBits( setBits );

   cout << "using the bitwise inclusive OR operator | is\n";

   displayBits( number1 | setBits );



   return 0;

}



//Quote from

//C++ How to Program (5th Edition) (How to Program) (Paperback)

//by Harvey & Paul) Deitel & Associates 



//Publisher: Prentice Hall; 5 edition (January 5, 2005)

//Language: English

//ISBN-10: 0131857576

//ISBN-13: 978-0131857575



void displayBits( unsigned value ) {

   const int SHIFT = 8 * sizeof( unsigned ) - 1;

   const unsigned MASK = 1 << SHIFT;



   cout << setw( 10 ) << value << " = ";



   for ( unsigned i = 1; i <= SHIFT + 1; i++ ) {

      cout << ( value & MASK ? '1' : '0' );

      value <<= 1;



      if ( i % 8 == 0 )

         cout << ' ';

   }



   cout << endl;

}

The result of combining the following
        15 = 00000000 00000000 00000000 00001111
       241 = 00000000 00000000 00000000 11110001
using the bitwise inclusive OR operator | is
       255 = 00000000 00000000 00000000 11111111

3.10.bitwise OR
	3.10.1.	Lowercase letters using bitwise OR.
	3.10.2.	Demonstrate bitwise \|

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.