@@ -76,7 +76,6 @@ The names of program units and external procedures are *global*, and the
76
76
names of implied-DO variables have a scope of the statement that
77
77
contains them.
78
78
79
-
80
79
## Modules
81
80
82
81
Modules are used to package
@@ -255,10 +254,10 @@ An explicit interface is obligatory for
255
254
256
255
- optional and keyword arguments;
257
256
- ` pointer ` and ` target ` arguments (see
258
- [ Pointers] ( pointers ) );
257
+ [ Pointers] ( pointers.md ) );
259
258
- ` pointer ` function result;
260
259
- new-style array arguments and array functions
261
- ([ Array handling] ( array_handling ) ).
260
+ ([ Array handling] ( array_handling.md ) ).
262
261
263
262
It allows full checks at compile time between actual and dummy
264
263
arguments.
@@ -293,12 +292,12 @@ interface gamma
293
292
end interface
294
293
```
295
294
296
- We can use existing names, e.g. SIN , and the compiler sorts out the
295
+ We can use existing names, e.g. ` sin ` , and the compiler sorts out the
297
296
correct association.
298
297
299
298
We have already seen the use of interface blocks for defined operators
300
299
and assignment (see
301
- [ Modules] ( Modules ) ).
300
+ [ Modules] ( modules ) ).
302
301
303
302
## Recursion
304
303
@@ -355,7 +354,7 @@ Here, we note the `result` clause and termination test.
355
354
This is a feature for parallel computing.
356
355
357
356
In
358
- [ the ` forall ` statement and construct] ( forall-statement ) ,
357
+ [ the ` forall ` statement and construct] ( array_handling.md#the- forall-statement-and-construct ) ,
359
358
any side effects in a function can impede optimization on
360
359
a parallel processor the order of execution of the assignments could
361
360
affect the results. To control this situation, we add the ` pure ` keyword
0 commit comments