Home > Store

The D Programming Language

Register your product to gain access to bonus material or receive a coupon.

The D Programming Language

Best Value Purchase

Book + eBook Bundle

  • Your Price: $53.99
  • List Price: $89.98
  • Includes EPUB, MOBI, and PDF
  • About eBook Formats
  • This eBook includes the following formats, accessible from your Account page after purchase:

    ePub EPUB The open industry format known for its reflowable content and usability on supported mobile devices.

    MOBI MOBI The eBook format compatible with the Amazon Kindle and Amazon Kindle applications.

    Adobe Reader PDF The popular standard, used most often with the free Adobe® Reader® software.

    This eBook requires no passwords or activation to read. We customize your eBook by discreetly watermarking it with your name, making it uniquely yours.

More Purchase Options

Book

  • Your Price: $39.99
  • List Price: $49.99
  • Usually ships in 24 hours.

eBook (Watermarked)

  • Your Price: $31.99
  • List Price: $39.99
  • Includes EPUB, MOBI, and PDF
  • About eBook Formats
  • This eBook includes the following formats, accessible from your Account page after purchase:

    ePub EPUB The open industry format known for its reflowable content and usability on supported mobile devices.

    MOBI MOBI The eBook format compatible with the Amazon Kindle and Amazon Kindle applications.

    Adobe Reader PDF The popular standard, used most often with the free Adobe® Reader® software.

    This eBook requires no passwords or activation to read. We customize your eBook by discreetly watermarking it with your name, making it uniquely yours.

Description

  • Copyright 2010
  • Dimensions: 7" x 9-1/8"
  • Pages: 496
  • Edition: 1st
  • Book
  • ISBN-10: 0-321-63536-1
  • ISBN-13: 978-0-321-63536-5

“To the best of my knowledge, D offers an unprecedentedly adroit integration of several powerful programming paradigms: imperative, object-oriented, functional, and meta.”
—From the Foreword by Walter Bright

“This is a book by a skilled author describing an interesting programming language. I’m sure you’ll find the read rewarding.”
—From the Foreword by Scott Meyers

D is a programming language built to help programmers address the challenges of modern software development. It does so by fostering modules interconnected through precise interfaces, a federation of tightly integrated programming paradigms, language-enforced thread isolation, modular type safety, an efficient memory model, and more.

The D Programming Language is an authoritative and comprehensive introduction to D. Reflecting the author’s signature style, the writing is casual and conversational, but never at the expense of focus and pre­cision. It covers all aspects of the language (such as expressions, statements, types, functions, contracts, and modules), but it is much more than an enumeration of features.

Inside the book you will find

  • In-depth explanations, with idiomatic examples, for all language features
  • How feature groups support major programming paradigms
  • Rationale and best-use advice for each major feature
  • Discussion of cross-cutting issues, such as error handling, contract programming, and concurrency
  • Tables, figures, and “cheat sheets” that serve as a handy quick reference for day-to-day problem solving with D

Written for the working programmer, The D Programming Language not only introduces the D language—it presents a compendium of good practices and idioms to help both your coding with D and your coding in general.

Sample Content

Online Sample Chapter

Concurrency in the D Programming Language

Excerpt

"D"iving Into the D Programming Language

Sample Pages

Download the sample pages (includes Chapter 13 and Index)

Table of Contents

Foreword by Walter Bright xv

Foreword by Scott Meyers xix

Preface xxiii

Chapter 1: “D”iving In 1

1.1 Numbers and Expressions 3

1.2 Statements 5

1.3 Function Basics 6

1.4 Arrays and Associative Arrays 7

1.5 Basic Data Structures 14

1.6 Interfaces and Classes 20

1.7 Values versus References 25

1.8 Summary 27

Chapter 2: Basic Types. Expressions 29

2.1 Symbols 30

2.2 Literals 32

2.3 Operators 42

2.4 Summary and Quick Reference 61

Chapter 3: Statements 65

3.1 The Expression Statement 65

3.2 The Compound Statement 66

3.3 The if Statement 67

3.4 The static if Statement 68

3.5 The switch Statement 71

3.6 The final switch Statement 72

3.7 Looping Statements 73

3.8 The goto Statement 78

3.9 The with Statement 80

3.10 The return Statement 81

3.11 The throw and try Statements 81

3.12 The mixin Statement 82

3.13 The scope Statement 84

3.14 The synchronized Statement 88

3.15 The asm Statement 89

3.16 Summary and Quick Reference 89

Chapter 4: Arrays, Associative Arrays, and Strings 93

4.1 Dynamic Arrays 93

4.2 Fixed-Size Arrays 107

4.3 Multidimensional Arrays 111

4.4 Associative Arrays 114

4.5 Strings 118

4.6 Arrays’ Maverick Cousin: The Pointer 124

4.7 Summary and Quick Reference 126

Chapter 5: Data and Functions. Functional Style 131

5.1 Writing and unittesting a Simple Function 131

5.2 Passing Conventions and Storage Classes 134

5.3 Type Parameters 138

5.4 Signature Constraints 140

5.5 Overloading 142

5.6 Higher-Order Functions. Function Literals 148

5.7 Nested Functions 150

5.8 Closures 152

5.9 Beyond Arrays. Ranges. Pseudo Members 154

5.10 Variadic Functions 159

5.11 Function Attributes 165

5.12 Compile-Time Evaluation 169

Chapter 6: Classes. Object-Oriented Style 175

6.1 Classes 175

6.2 Object Names Are References 177

6.3 It’s an Object’s Life 181

6.4 Methods and Inheritance 190

6.5 Class-Level Encapsulation with static Members 196

6.6 Curbing Extensibility with final Methods 197

6.7 Encapsulation 199

6.8 One Root to Rule Them All 203

6.9 Interfaces 212

6.10 Abstract Classes 218

6.11 Nested Classes 222

6.12 Multiple Inheritance 226

6.13 Multiple Subtyping 230

6.14 Parameterized Classes and Interfaces 233

6.15 Summary 237

Chapter 7: Other User-Defined Types 239

7.1 structs 240

7.2 unions 270

7.3 Enumerated Values 272

7.4 alias 276

7.5 Parameterized Scopes with template 278

7.6 Injecting Code with mixin templates 282

7.7 Summary and Reference 285

Chapter 8: Type Qualifiers 287

8.1 The immutable Qualifier 288

8.2 Composing with immutable 291

8.3 immutable Parameters and Methods 292

8.4 immutable Constructors 293

8.5 Conversions involving immutable 295

8.6 The const Qualifier 297

8.7 Interaction between const and immutable 298

8.8 Propagating a Qualifier from Parameter to Result 299

8.9 Summary 300

Chapter 9: Error Handling 301

9.1 throwing and catching 301

9.2 Types 302

9.3 finally clauses 306

9.4 nothrow Functions and the Special Nature of Throwable 307

9.5 Collateral Exceptions 307

9.6 Stack Unwinding and Exception-Safe Code 309

9.7 Uncaught Exceptions 312

Chapter 10: Contract Programming 313

10.1 Contracts 314

10.2 Assertions 316

10.3 Preconditions 317

10.4 Postconditions 319

10.5 Invariants 321

10.6 Skipping Contract Checks. Release Builds 324

10.7 Contracts: Not for Scrubbing Input 327

10.8 Contracts and Inheritance 329

10.9 Contracts in Interfaces 334

Chapter 11: Scaling Up 337

11.1 Packages and Modules 337

11.2 Safety 353

11.3 Module Constructors and Destructors 356

11.4 Documentation Comments 358

11.5 Interfacing with C and C++ 359

11.6 deprecated 359

11.7 version Declarations 360

11.8 debug Declarations 361

11.9 D’s Standard Library 361

Chapter 12: Operator Overloading 365

12.1 Overloading Operators 366

12.2 Overloading Unary Operators 367

12.3 Overloading Binary Operators 371

12.4 Overloading Comparison Operators 375

12.5 Overloading Assignment Operators 376

12.6 Overloading Indexing Operators 377

12.7 Overloading Slicing Operators 379

12.8 The $ Operator 379

12.9 Overloading foreach 380

12.10 Defining Overloaded Operators in Classes 383

12.11 And Now for Something Completely Different: opDispatch 384

12.12 Summary and Quick Reference 388

Chapter 13: Concurrency 391

13.1 Concurrentgate 392

13.2 A Brief History of Data Sharing 394

13.3 Look, Ma, No (Default) Sharing 397

13.4 Starting a Thread 399

13.5 Exchanging Messages between Threads  401

13.6 Pattern Matching with receive 403

13.7 File Copying—with a Twist 406

13.8 Thread Termination 407

13.9 Out-of-Band Communication 409

13.10 Mailbox Crowding 410

13.11 The shared Type Qualifier 411

13.12 Operations with shared Data and Their Effects 413

13.13 Lock-Based Synchronization with synchronized classes 414

13.14 Field Typing in synchronized classes 419

13.15 Deadlocks and the synchronized Statement 424

13.16 Lock-Free Coding with shared classes 426

13.17 Summary 431

Bibliography 433

Index 439

More Information

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