Home > Articles

Operators

This chapter is from the book

This chapter is from the book

Bit-Wise Operators

Remember the discussion about data types and memory from Chapter 2, "Keywords, Data Types, and Variables," in which you learned that computers think in terms of 1s and 0s, and that data types really only define the grouping and interpretation of these 1s and 0s. These 1s and 0s can be traced back to the underlying hardware implementation of computers and the principals of electrical engineering. At the very rudimentary levels of computer architecture, decisions have to be made based on two signals and whether or not they have a charge. Figure 3.1 shows this graphically.

Figure 3.1Figure 3.1 Electrical engineering decision circuit.

Figure 3.1 shows that a circuit makes its decision as to whether or not to send a charged signal based on the two input signals. Specific rules inside the circuit define whether the signal is charged (1) or not charged (0). These decisions can be summarized by a truth table. A truth table lists all the possible values and the required result. In the case of two signals that can be charged (1) or not charged (0), there are four possible combinations, as shown in Table 3.2.

Table 3.2 Truth Table Components

Signal A

Signal B

Result

0

0

0

1

0

0

0

0

0

1

1

1


Table 3.2 tells you that if you have no charge on Signal A (0) and a charge on signal B (1), do not send a charge (0) (second row). But if you have a charge on signal A (1) and a charge on signal B (1), send a charge (the last row).

The operators covered thus far in this chapter have been manipulating the interpreted values of these bits (for example, if a was an int with the value 10, a + 1 is equal to 11), but there are some things that can be done directly with those 1s and 0s. Java provides a set of bit-wise operators that looks at each bit in two variables, performs a comparison, and returns the result. The nature of the operator is defined by its truth table.

For the examples in this section, consider the following two bytes:

byte a = 10;
byte b = 6;

Recall from Chapter 2 that the bits for these values are

a = 0000 1010
b = 0000 0110

The bit-wise operators are going to define rules in the form of truth tables to apply to these two values for the purpose of building a result. The general form of a bit-wise operation is

result = operandA bit-wise-operator operandB

The valid bit-wise operators are shown in Table 3.3.

Table 3.3 Bit-Wise Operators

Operator

Description

&

AND

|

OR

^

XOR (Exclusive OR)

~

NOT


AND

The AND operator (&) defines a bit-wise comparison between two variables according to the truth table shown in Table 3.4.

Table 3.4 AND Bit-Wise Operator

Signal A

Signal B

Result

0

0

0

0

1

0

1

0

0

1

1

1


The AND operator specifies that both Signals A and B must be charged for the result to be charged. Therefore, AND-ing the bytes 10 and 6 results in 2, as follows:

a = 0000 1010 (10)
b = 0000 0110 (6)
  ---- ----
r = 0000 0010 (2)

OR

The OR operator (|) defines a bit-wise comparison between two variables, according to the truth table shown in Table 3.5.

Table 3.5 OR Bit-Wise Operator

Signal A

Signal B

Result

0

0

0

0

1

1

1

0

1

1

1

1


The OR operator specifies that the result is charged if either Signals A or B are charged. Therefore, OR-ing the bytes 10 and 6 results in 14, as follows:

a = 0000 1010 (10)
b = 0000 0110 (6)
  ---- ----
r = 0000 1110 (14)

Exclusive OR

The Exclusive OR (XOR) operator (^) defines a bit-wise comparison between two variables according to the truth table shown in Table 3.6.

Table 3.6 XOR Bit-Wise Operator

Signal A

Signal B

Result

0

0

0

0

1

1

1

0

1

1

1

0


The XOR operator specifies that the result is charged if Signal A or B is charged, but Signal A and B aren't both charged. It is called exclusive because it is charged only if one of the two is charged. Therefore, XOR-ing the bytes 10 and 6 results in 12, as follows:

a = 0000 1010 (10)
b = 0000 0110 (6)
  ---- ----
r = 0000 1100 (12)

NOT Operator

The NOT operator (~), also referred to as the bit-wise complement, flips the values of all the charges. If a bit is set to 1, it changes it to 0; if a bit is 0 it changes to 1.

Practical Application

At this point you are probably telling yourself that this is a neat thing you can do, but asking yourself the inevitable question: "Who cares!?"

The primary use for bit-wise operations originated in the data compression and communication applications. The problem was that you needed to either store or transmit the state of several different things. In the past, data storage was not as cheap as it is today and communication mechanisms were not over T3 or even a cable modem, but more like speeds of 1200 or 300 baud. To give you an idea about the difference in speed, cable modem and DSL companies tout that they achieve speeds about 20 times faster than 56K modems, but 56K modems are about 45 times faster than 1200-baud modems, and 180 times faster than 300-baud modems. So early communications were 3600 times slower than your cable modem. Thus, there was the need to compact data as much as possible!

If you have 8 different states to send to someone, you can simply assign a bit in a byte to each of the 8 states: 1 is defined to be true and 0 false (or on/off, and so on). Consider reporting the state of 8 different factory devices where devices 0 and 3 are active:

Device byte: 0000 1001 (9)

To determine whether device 3 is active, a Boolean expression can be determined with the following statement:

boolean is3Active = ( deviceByte & 8 ) == 8;

AND-ing the deviceByte (0000 1001) with the number 8 (0000 1000) returns 8, as the first bit is 0 (1 & 0 = 0), and using the equality operator it can be compared to 8 to see if that bit is set.

You should understand how bit-wise operators work (they are covered in Java certification exams) and, depending on what area of Java programming you delve into, you might use them in the future.

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.

Overview


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information


To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.

Surveys

Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.

Newsletters

If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information


Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.

Security


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.

Children


This site is not directed to children under the age of 13.

Marketing


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information


If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.

Choice/Opt-out


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information


Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents


California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure


Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.

Links


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact


Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice


We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020