Introduction and History

Explore the concept of ranges in D, focusing on how they abstract data access through member functions like empty, front, and popFront. Understand container and algorithm definitions, and discover how D's ranges improve upon C++ iterators for flexible data processing.

We'll cover the following...

- Ranges
- History

Ranges

Ranges of algorithms over a great number of container types. Ranges emphasize how container elements are accessed, as opposed to how the containers are implemented.

Ranges are a very simple concept that is based on whether a type defines certain sets of member functions. We have already covered this concept in the foreach with structs and classes chapter: any type that provides the member functions empty, front, and popFront() can be used with the foreach loop. The set of those three member functions is ...

1.Introduction

2.Lifetimes, null Value and the is Operator

3.Type Conversions

4.Structs

5.Variable Number of Parameters

6.Function Overloading and Member Functions

7.Constructor and Other Special Functions

8.Operator Overloading

9.Introduction to Classes

10.Inheritance

11.The Object Class

12.Interfaces

13.destroy and scoped

14.Modules and Libraries

15.Encapsulation and Protection Attributes

16.UFCS, Properties and Contract Programming

17.Templates

18.Pragmas, alias and with

19.Pointers

20.Bit Operations

21.Conditional Compilation

22.Function Pointers, Delegates, and Lambdas

23.foreach with Structs and Classes

24.Unions, Labels, goto and Tuples

25.More Templates

26.More Functions

27.Mixins

28.Ranges

29.static foreach and Parallelism

30.Message Passing Concurrency

31.Data Sharing Concurrency

32.Fibers

33.Memory Management

34.User Defined Attributes (UDA) and Operator Precedence

35.Conclusion

Introduction and History

Ranges