26
26
$(DD Refers to the ability to execute regular D
27
27
functions at compile time rather than at run time.)
28
28
29
- $(DT code point) $(DD In Unicode terminology, a $(LUCKY code point)
29
+ $(DT $(LNAME2 code- point, Code Point) ) $(DD In Unicode terminology, a $(LUCKY code point)
30
30
is a logical character. The range of code points is $(D 0)
31
31
through $(D 0x10FFFF). Only $(D dchar)s can store code points
32
32
directly; arrays of $(D char) and $(D wchar) need to use the
58
58
one and only one call to free().
59
59
)
60
60
61
- $(DT Higher-order function ) $(DD A function that either accepts another
61
+ $(DT $(LNAME2 hof, Higher-Order Function) ) $(DD A function that either accepts another
62
62
function as a parameter, returns a function, or both.
63
63
)
64
64
65
+ $(DT $(LNAME2 ies, $(ACRONYM IES, Interpolated Expression Sequence)))
66
+ $(DD A $(DDSUBLINK spec/template, homogeneous_sequences, value sequence)
67
+ of interspersed string literals and expressions.
68
+ See $(LINK2 $(ROOT_DIR)spec/istring.html, spec).
69
+ )
70
+
65
71
$(DT $(LNAME2 ifti, $(ACRONYM IFTI, Implicit Function Template Instantiation)))
66
72
$(DD Refers to the ability to instantiate a template function
67
73
without having to explicitly pass in the types to the template.
68
74
Instead, the types are inferred automatically from the types of the
69
75
runtime arguments. See $(LINK2 spec/template.html#ifti, spec) for details.)
70
76
71
- $(DT Illegal)
77
+ $(DT $(LNAME2 illegal, Illegal) )
72
78
$(DD A code construct is illegal if it does not conform to the
73
79
D language specification.
74
80
This may be true even if the compiler or runtime fails to detect
75
81
the error.
76
82
)
77
83
78
- $(DT Input range) $(DD A type (i.e., a struct or a class) that
79
- defines the member functions empty, head , and next . Input ranges
84
+ $(DT $(LNAME2 input- range, Input Range) ) $(DD A type (i.e., a struct or a class) that
85
+ defines the member functions ` empty`, `front` , and `popFront` . Input ranges
80
86
are assumed to be strictly one-pass: there is no way to save the
81
- state of the iteration in a copy of the range. See also $(LINK2
82
- phobos/std_range.html,range).)
87
+ state of the iteration in a copy of the range. See also $(MREF std, range).)
83
88
84
- $(DT Implementation Defined Behavior)
89
+ $(DT $(LNAME2 implementation-defined, Implementation- Defined Behavior) )
85
90
$(DD This is variation in behavior of the D language in a manner
86
91
that is up to the implementor of the language.
87
92
An example of implementation defined behavior would be the size in
91
96
maximize the portability of code.
92
97
)
93
98
94
- $(DT $(LNAME2 lvalue, lvalue ))
99
+ $(DT $(LNAME2 lvalue, Lvalue ))
95
100
$(DD An lvalue is an abstract term referring to a value with an accessible
96
101
address (through e.g. the unary $(D &) operator). Typical examples of
97
102
lvalues include variables, constants introduced with `const` or `immutable`
@@ -173,7 +178,8 @@ void test()
173
178
instead of passing through two other instances.)
174
179
)
175
180
176
- $(DT $(LEGACY_LNAME2 narrow strings, narrow-strings, narrow strings)) $(DD All arrays
181
+ $(DT $(LEGACY_LNAME2 narrow strings, narrow-strings, Narrow Strings))
182
+ $(DD All arrays
177
183
that use $(D char), $(D wchar), and their qualified versions are
178
184
narrow strings. (Those include $(D string) and $(D
179
185
wstring)). Range-oriented functions in the standard library handle
@@ -203,11 +209,11 @@ void test()
203
209
delegate returning a Boolean result. Predicates can be nullary
204
210
(take no arguments), unary (take one argument), binary (take
205
211
two arguments), or n-ary (take n arguments). Usually
206
- predicates are mentioned within the context of higher-order
207
- functions, which accept predicates as parameters.
212
+ predicates are mentioned within the context of $(ALOCAL hof, higher-order
213
+ functions) , which accept predicates as parameters.
208
214
)
209
215
210
- $(DT $(LNAME2 qualifier-convertible, qualifier-convertible )) $(DD A type `T` is
216
+ $(DT $(LNAME2 qualifier-convertible, Qualifier-Convertible )) $(DD A type `T` is
211
217
qualifer-convertible to type `U` if and only if they only differ in qualifiers
212
218
and if a reference to `T` can be implicitly converted to a reference to `U` per
213
219
the $(LINK2 $(ROOT_DIR)spec/const3.html, language rules).)
@@ -224,7 +230,7 @@ void test()
224
230
$(DDSUBLINK spec/attribute, scope-class-var, $(D scope) storage class).
225
231
)
226
232
227
- $(DT $(LNAME2 rvalue, rvalue ))
233
+ $(DT $(LNAME2 rvalue, Rvalue ))
228
234
$(DD An rvalue is an abstract term referring to a value resulting from an
229
235
expression that has no accessible memory address. This lack of address is
230
236
only conceptual; the implementation has the liberty to store an rvalue in
0 commit comments