Home > Articles > Programming > C/C++

Safety in Numbers: Introducing C++14's Binary Literals, Digit Separators, and Variable Templates

Danny Kalev highlights three new core features in C++14 that simplify the design and implementation of numeric apps. Binary literals such as 0b10101 enable you to parse binary numbers without the onus of converting them to decimal; the new digit separator improves code readability; and, finally, variable templates let you define parameterized constants instead of resorting to cumbersome static member functions.
Like this article? We recommend

C++14 isn't revolutionary, nor was it meant to be. It mostly consists of bug fixes and small conveniences that should please C++ programmers while improving the performance, reliability, and portability of new code. This article presents three new numeric-related features that have now made it into the standard: binary literals, the single quotation-mark (') digit separator, and variable templates.

Binary Literals

In addition to decimal values, C++ has always supported octal literals:

int fifteen= 017;// equivalent to 15 decimal

as well as hexadecimal values:

unsigned char ASCII_letter= 0xfc; //equivalent to 252 decimal

However, until recently, C++ didn't support binary literals such as 11111100; you had to convert them to one of the supported bases before using them in C++. This asymmetry between binary literals and literals in other bases has finally been rectified. You can now use binary literals directly in C++14 code like this:

int x= 0b11111100;
if (var==0b101)
switch (binliteral)
case 0B100:
case 0B101:

A binary literal begins with the prefix 0b or 0B followed by a sequence of one or more binary digits, namely 0 and 1. This syntax is borrowed from other languages such as D, Java, Perl, and Python, all of which support binary literals.

The type of a binary literal is int. You can use a binary literal wherever a constant integral value is expected:

enum class Bits //C++14
 CLEAR = 0b0,
 SET =0b1

At this point, I'll bet you want to ask whether the Standard Library supports binary literals as well. In other words:

  • Do iostream objects recognize the std::bin manipulator?
  • Will fstream objects know how to format binary literals when writing them to files?
  • Will stringstream objects know how to parse a string containing 0b1010, for example?

Regrettably, the answer to all of these questions is "No." Adding core-language support for binary literals consists of changing the parsing rules of C++ (a relatively trivial task). Adding Standard Library support is a complex and time-consuming chore that couldn't have been completed prior to the C++14 Final Committee Draft (FCD) milestone. Consequently, vendors are likely to ship Standard Library implementations that support binary literals voluntarily; I'm afraid an official ISO endorsement is unlikely before C++17.

Quotation Mark as Digit Separator

Quotation Mark as Digit Separator

Another long-awaited small convenience is a digit separator. Certain programming languages allow you to write numbers with separators to improve readability. Consider the following Ada snippet:

--an Ada statement with digit separators
My_Savings := My_Savings * 1_000_000.0;

An Ada compiler ignores the underscores when parsing the token 1_000_000.0. Several proposals suggested adding a similar feature to C++. However, the comma (,) and underscore (_) were ruled out because they might lead to parsing ambiguities. For example, if commas were allowed as digit separators, the following function call would be ambiguous:

func(10,0); //two arguments or 100?

An underscore might lead to similar parsing ambiguities:

int _100_; //not your typical variable name, yet valid
func(_100_); //is it a variable, or the literal 100?

Therefore, the standards committee decided to accept the single quotation mark as a digit separator:

//C++14. All of the following variables equal 1048576
long decval=1'048'576;  //groups of three digits
long hexval=0x10'0000;// four digits
long octval=00'04'00'00'00;//two digits
long binval=0b100'000000'000000'000000;//six digits

The original proposal for adding a single quotation mark as a digit separator for C++ is available online.

Variable Templates

Variable Templates

C++ programmers are used to only two types of templates, namely class templates and functions templates; it's hard to imagine why variable templates would be needed. However, when you examine some of the more prevalent C++ design idioms, including meta-functions and constexpr static member functions that merely return a const static data member, you realize that these are workarounds for parameterized constants. This line of reasoning led the C++ designers to introduce variable templates to C++14. (The original variable templates proposal is available online.) The canonical example uses the constant pi, whose actual type depends on the specialization used:

//C++14, a variable template
template<typename T>
  constexpr T pi = T(3.1415926535897932385);

You access pi as you would an ordinary template: pi<double>, pi <long double>, or pi<T>. A C++14 function template that calculates a circular area can use pi like this:

//C++14, a variable template in use
template<typename T>
T circular_area(T r) {
  return pi<T> * r * r;
double darea= circular_area(5.5);//uses pi<double>
float farea= circular_area(5.5f);//uses pi<float>

Template variables aren't confined to built-in types. They can be user-defined types as well, such as matrix<T>, complex<T>, and so on.



The C++14 FCD was approved at the Issaquah meeting in February 2014. (An up-to-date overview of the C++14 features is available online.) Surprisingly, several features that had made it into the Committee Draft and seemed like sure bets were eventually dropped from the FCD for various reasons. These include the std::dynarray container, runtime-sized arrays (also known as Variable Length Arrays in C parlance) and even a filesystem library. Adhering to the features-will-yield-to-schedule principle, it looks like C++14 will roll out on time, albeit with fewer features than originally expected.

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.


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.


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.


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.


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


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


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.


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.


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