Demonstrate bitwise complement : complement « Operators statements « C++ Tutorial

Home
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 » complement 
3.11.2.Demonstrate bitwise complement
#include <iostream>
using std::cout;

#include <iomanip>
using std::endl;
using std::setw;

void displayBitsunsigned );

int main()
{
   unsigned number1;
   unsigned number2;
   unsigned mask;
   unsigned setBits;

   number1 = 21845;
   cout << "\nThe one's complement of\n";
   displayBitsnumber1 );
   cout << "is" << endl;
   displayBits~number1 );


   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 displayBitsunsigned value ) {
   const int SHIFT = * sizeofunsigned 1;
   const unsigned MASK = << SHIFT;

   cout << setw10 << value << " = ";

   for unsigned i = 1; i <= SHIFT + 1; i++ ) {
      cout << value & MASK ? '1' '0' );
      value <<= 1;

      if i  == )
         cout << ' ';
   }

   cout << endl;
}
The one's complement of
     21845 = 00000000 00000000 01010101 01010101
is
4294945450 = 11111111 11111111 10101010 10101010
3.11.complement
3.11.1.The complement of the number
3.11.2.Demonstrate bitwise complement
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.