D Cookbook

Book Image

D Cookbook

By : Adam Ruppe

Book Image

D Cookbook

By: Adam Ruppe

Overview of this book

D Cookbook

Credits

Foreword

About the Author

About the Author

About the Reviewers

About the Reviewers

www.PacktPub.com

www.PacktPub.com

Preface

Free Chapter

Core Tasks

Installing the compiler and writing a "Hello World" program

Adding additional modules (files) to your program

Using external libraries

Building and processing arrays

Using associative arrays to translate input

Creating a user-defined vector type

Using a custom exception type

Understanding immutability

Slicing a string to get a substring

Creating a tree of classes

Phobos – The Standard Library

Phobos – The Standard Library

Performing type conversions

Finding the largest files in a directory

Creating a network client and server

Using Base64 to create a data URI

Generating random numbers

Normalizing a string and performing Unicode comparisons

Searching with regular expressions

Writing a digest utility

Using the std.zlib compression

Using the std.json module

Ranges

Using ranges when implementing an algorithm

Creating an input range

Creating an output range

Creating a higher-order range

Putting a range interface on a collection

Creating an input range over a tree structure

Using runtime polymorphic (class) ranges

Storing a range as a data member

Sorting ranges efficiently

Searching ranges

Using functional tools to query data

Integration

Calling the Windows API functions

Removing the Windows console

Making Linux system calls

Writing part of a C program in D

Interfacing with C++

Using structs to mimic the C++ object structure

Communicating with external processes

Communicating with a dynamic scripting language

Using Windows' COM

Resource Management

Resource Management

Avoiding the garbage collector

Making a reference-counted object

Manually managing class memory

Using scope guards to manage transactions

Creating an array replacement

Managing lent resources

Creating a NotNull struct

Using unique pointers

Using RAII and handling the limitations of class destructors

Wrapped Types

Creating a struct with reference semantics

Simulating inheritance with structs

Creating a ranged integer

Creating an opaque handle type

Creating a subtyped string for i18n

Forwarding methods with opDispatch

Creating a tagged dynamic type

Creating a structure with two views into the same data

Simulating multiple inheritance with mixin templates

Correctness Checking

Correctness Checking

Using assertions and exceptions

Using static asserts

Using template constraints and static if

Preventing memory corruption bugs with @safe

Leveraging const-correctness

Avoiding side effects of pure functions

Verifying object invariants and pre- and post-conditions

Unit testing your code

Documenting your code with Ddoc

Writing platform-specific code (versions) and per-client configuration modules

Reflection

Getting dynamic runtime type information

Getting a list of child classes

Determining whether a module is available

Getting a list of all methods or fields in a module or an object

Inspecting function overloads

Determining names, types, and default values of function parameters

Getting components of complex types

Using user-defined attributes

Implementing a custom lint-style check for virtual functions

Extending the runtime type information

Creating a command-line function caller

Code Generation

Code Generation

Creating user-defined literals

Parsing a domain-specific language

Generating data structures from text diagrams

Automating dynamic calls with multiple dispatch

Building a lookup table

Using string parameters to change functions

Wrapping instance methods

Using opDispatch to generate properties

Duck typing to a statically-defined interface

Multitasking

Passing messages with std.concurrency

Processing parallel data with std.parallelism

Creating new processes

Exploring thread-safe, single-locking singletons

Using asynchronous I/O

D for Kernel Coding

D for Kernel Coding

Running D on bare metal x86 with a stripped runtime

Adding interrupt handling to the bare metal x86 code

Web and GUI Programming

Web and GUI Programming

Creating a dynamic website with cgi.d

Creating a web API with web.d

Parsing and modifying an HTML page with dom.d

Accessing a SQL database

Sending an e-mail

Writing colored output to the console

Getting real-time input from the terminal

Working with image files

Creating a graphics window to show a TV static demo

Creating an OpenGL window

Addendum

Compiling D for ARM/Linux Raspberry Pi

Running D on bare metal ARM

Using the exponentiation operator

Getting a stack trace without throwing an exception

Finding more information about D

Index

Customer Reviews

5 star

0

4 star

0

3 star

0

2 star

0

1 star

0

Using ranges when implementing an algorithm

D code favors the use of ranges when implementing algorithms because ranges are a natural abstraction for operating on sequences of elements. We'll implement a function that takes a range and calculates the average of the values.

Getting ready

First, we need to sketch out our algorithm and determine what functions and types we'll need from the range. The algorithm should accept a range as generic as possible for element types that make sense for us, without sacrificing efficiency. Since our algorithm is taking an average value, the elements should be numeric. We'll also need to be able to iterate over each individual item. However, we don't need to know the length ahead of time (we can keep a count while calculating the sum); we don't need random access and we don't need to save our position. All we need to know is whether it is empty, the current item, and be able to advance the iteration. The result is we need an input range, nothing more. Other...