- Page 1: Fortran 90 HandbookComplete ANSI /
- Page 5 and 6: AcknowledgmentsMaterial in the appe
- Page 7 and 8: Table of ContentsPreface. . . . . .
- Page 9 and 10: 6. Using Data . . . . . . . . . . .
- Page 11 and 12: 13. Intrinsic Procedures . . . . .
- Page 13 and 14: Sneak Preview 0This is Chapter 0. F
- Page 15 and 16: 0SUBROUTINE SWAP_INTEGERS (ARG_A, A
- Page 17 and 18: 0doubles its value, adds it to the
- Page 19 and 20: 0TYPE (EMPLOYEE) :: LARRY, MOE, CUR
- Page 21 and 22: 0FUNCTION D_CUBE_ROOT(X)DOUBLE PREC
- Page 23 and 24: 0Language ArchitectureEveryone reco
- Page 25 and 26: Introduction 1For a programming lan
- Page 27 and 28: 11.2 Why a New Standard?this versio
- Page 29 and 30: 11.3 Why Not Use Another Language?p
- Page 31 and 32: 11.5 Fortran 77 Compatibilitymade a
- Page 33 and 34: 11.8 The Fortran 90 Language Standa
- Page 35 and 36: 1program, provided the Fortran prog
- Page 37 and 38: 15. International Standards Organiz
- Page 39 and 40: Fortran Concepts and Terms 22.1 Sco
- Page 41 and 42: 2the main program and X in a subpro
- Page 43 and 44: 2SUBROUTINE TOTALCOMMON / CB / ITOT
- Page 45 and 46: 2would create a duplicate declarati
- Page 47 and 48: 22.1.2 Association2.2 Program Organ
- Page 49 and 50: 2interfaces. Module subprograms may
- Page 51 and 52: 22.3 Data Environmentmore apparent
- Page 53 and 54:
2COMPLEX (KIND = HIGH) XINTEGER (KI
- Page 55 and 56:
22.4 Program ExecutionThese are use
- Page 57 and 58:
2Pointers have both a definition st
- Page 59 and 60:
2Entity This is the general term us
- Page 61 and 62:
2and at most seven. Arrays may be u
- Page 64 and 65:
22.6 Summary of FormsThe forms of t
- Page 66 and 67:
2The forms of a specification state
- Page 68 and 69:
2READ format [ , input-item-list ]R
- Page 70 and 71:
2Table 2-1Requirements on statement
- Page 72 and 73:
2The module is new to Fortran with
- Page 74 and 75:
22.9.7 Dynamic DataThere are three
- Page 76 and 77:
264 Fortran 90 HandbookCopyright ©
- Page 78 and 79:
33.1 The Processor Character SetThe
- Page 80 and 81:
34. Except for the currency symbol
- Page 82 and 83:
3the slashes distinguish the value
- Page 84 and 85:
3Note, however, that the entity on
- Page 86 and 87:
3The lines within a program unit (e
- Page 88 and 89:
3ITER = ITER + 1! Begin the next it
- Page 90 and 91:
3LAWYERS = "Jones & Clay & &&Davis"
- Page 92 and 93:
33.3.1.3 Sample Program, Free Sourc
- Page 94 and 95:
3123456789.....--------------------
- Page 96 and 97:
33.6 Low-Level Syntax3.7 Summary4.
- Page 98 and 99:
3separating the statements. Blanks
- Page 100 and 101:
388 Fortran 90 HandbookCopyright ©
- Page 102 and 103:
4Each of these statements performs
- Page 104 and 105:
4steps that are required. The varia
- Page 106 and 107:
42. Complex. The Fortran 77 standar
- Page 108 and 109:
44.2 What Is Meant by “Type” in
- Page 110 and 111:
44.2.4 Forms for ConstantsThe langu
- Page 112 and 113:
4objects in COMMON statements, rest
- Page 114 and 115:
4where LONG and SHORT are named con
- Page 116 and 117:
4declares Y to have at least eight
- Page 118 and 119:
4such. If no kind parameter is spec
- Page 120 and 121:
44.3.4.4 Form for ConstantsThere ar
- Page 122 and 123:
44.4 Derived Types4.3.5.4 Form for
- Page 124 and 125:
4Special functions and subroutines
- Page 126 and 127:
411. An array component without the
- Page 128 and 129:
4Any object of type ABSTRACT will h
- Page 130 and 131:
4PROGRAM BUILD_MACHINEUSE SHOPTYPE
- Page 132 and 133:
44.4.2 Derived-Type ValuesThe set o
- Page 134 and 135:
42. The expressions must agree in n
- Page 136 and 137:
44.6 Array ConstructorsA constant e
- Page 138 and 139:
4Following are several examples of
- Page 140 and 141:
4Fortran 90 introduces two new idea
- Page 142 and 143:
4130 Fortran 90 HandbookCopyright
- Page 144 and 145:
5Settng valuesObject accessibility
- Page 146 and 147:
55.1 Type Declaration StatementsA t
- Page 148 and 149:
5INTEGER, PARAMETER :: SHORT = SELE
- Page 150 and 151:
5For example:• entity-orientedCOM
- Page 152 and 153:
54. If the length parameter has a n
- Page 154 and 155:
55.2 Implicit TypingEach variable,
- Page 156 and 157:
55.3 Array PropertiesAn array objec
- Page 158 and 159:
55.3.1.2 Assumed-Shape ArraysAn ass
- Page 160 and 161:
5REAL, ALLOCATABLE :: E (:)! alloca
- Page 162 and 163:
55.3.2 DIMENSION Attribute and Stat
- Page 164 and 165:
5Rules and restrictions:1. The arra
- Page 166 and 167:
55.4.2 TARGET Attribute and Stateme
- Page 168 and 169:
5the value will be “converted”
- Page 170 and 171:
5an allocatable arrayan object in a
- Page 172 and 173:
5In both forms ME is initialized us
- Page 174 and 175:
55.6.1 PUBLIC and PRIVATE Accessibi
- Page 176 and 177:
56. A module procedure that has an
- Page 178 and 179:
5INOUTINOUTRules and restrictions:1
- Page 180 and 181:
5CALL SORT_X (X = VECTOR_A). . .SUB
- Page 182 and 183:
5Rules and restrictions:1. A SAVE s
- Page 184 and 185:
5If a function returns an array or
- Page 186 and 187:
55.8 Automatic Data Objects• attr
- Page 188 and 189:
55.10 Storage AssociationIn general
- Page 190 and 191:
5Table 5-1Types and attributes and
- Page 192 and 193:
55. If an equivalence object is of
- Page 194 and 195:
5contain the same sequence of stora
- Page 196 and 197:
5A blank common block has the same
- Page 198 and 199:
5REAL B (5)EQUIVALENCE (A (2), B (1
- Page 200 and 201:
5• attribute-orientedINTEGER SCOR
- Page 202 and 203:
5Table 5-2Partial summary of allowa
- Page 204 and 205:
5• attribute-orientedREAL ORIGIN
- Page 206 and 207:
5SAVE. Local variables and data in
- Page 208 and 209:
55.11.5 EQUIVALENCEThe EQUIVALENCE
- Page 210 and 211:
6Variables generally have storage s
- Page 212 and 213:
6Rules and restrictions:1. Variable
- Page 214 and 215:
64. The first character of a parent
- Page 216 and 217:
6part-name ( section-subscript-list
- Page 218 and 219:
66.4.1 Array TerminologyAn array co
- Page 220 and 221:
6REAL A (10). . .A (2:5) = 1.0The p
- Page 222 and 223:
66. FOR_1990 (K) % PARTS (I) ! arra
- Page 224 and 225:
6INTEGER J(3)REAL A(30). . .J = (/
- Page 226 and 227:
6The position of an array element i
- Page 228 and 229:
6Undefined association statusDefine
- Page 230 and 231:
6X is not available for use in the
- Page 232 and 233:
6The form of the DEALLOCATE stateme
- Page 234 and 235:
64. the pointer is in blank common5
- Page 236 and 237:
6TYPE ADDRESS_BOOKINTEGER NO_ADDRES
- Page 238 and 239:
6The DEALLOCATE statement releases
- Page 240 and 241:
77.1 Introduction to Fortran 90 Exp
- Page 242 and 243:
7• as the variables in pointer as
- Page 244 and 245:
7A ** (-B) + 3.0 / C - C * (A + B)A
- Page 246 and 247:
77.2 Formation of ExpressionsAn exp
- Page 248 and 249:
7The first example results in the v
- Page 250 and 251:
7AA + BA + B / CA * (B + C) / D - F
- Page 252 and 253:
7to the subprogram but is specified
- Page 254 and 255:
7interpretation of the expression A
- Page 256 and 257:
7where a relational operator (R714)
- Page 258 and 259:
7Disjunct Expression. A disjunct ex
- Page 260 and 261:
7Note that the definition of an exp
- Page 262 and 263:
7general, form is second from the b
- Page 264 and 265:
7Table 7-2 Categories of operations
- Page 266 and 267:
7The intrinsic operations are divid
- Page 268 and 269:
7determines it as an explicit-shape
- Page 270 and 271:
7FCN (X) is a scalar of type intege
- Page 272 and 273:
7I4 I10 R6 R15 C6 C15integerexp=4ki
- Page 274 and 275:
7For example, consider the intrinsi
- Page 276 and 277:
7Example:REAL C (2:10, 11:12). . .C
- Page 278 and 279:
77.2.9 Special ExpressionsExpressio
- Page 280 and 281:
77.2.9.2 Initialization Expressions
- Page 282 and 283:
7Thus, initialization expressions m
- Page 285 and 286:
7GeneralRestrictedSpecificationInit
- Page 287 and 288:
7Table 7-6Kinds of expressions and
- Page 289 and 290:
7When an expression is interpreted,
- Page 291 and 292:
77.3.1.1 Interpretation of Numeric
- Page 293 and 294:
7The intrinsic logical operations p
- Page 295 and 296:
7match the operands in order, types
- Page 297 and 298:
7• the rearrangement of an expres
- Page 299 and 300:
7mathematically equivalent if they
- Page 301 and 302:
7These rules for equivalent evaluat
- Page 303 and 304:
7An assignment statement is a maske
- Page 305 and 306:
7Table 7-13Conversion performed on
- Page 307 and 308:
72. The dummy arguments to the subr
- Page 309 and 310:
7a. it must have the TARGET attribu
- Page 311 and 312:
7REAL XREAL, POINTER :: POINTER_FCN
- Page 313 and 314:
7The logical expression is evaluate
- Page 315 and 316:
78. An elemental function reference
- Page 317 and 318:
77.6.7 Expressions Resulting in Sca
- Page 319 and 320:
7ARRAY_PTR => Aafter the pointer as
- Page 321 and 322:
Controlling Execution 8A program pe
- Page 323 and 324:
8An executable construct consists o
- Page 325 and 326:
8execution, after which the IF cons
- Page 327 and 328:
8Is the logicalexpression in theIF
- Page 329 and 330:
8[ CASE DEFAULT [ case-construct-na
- Page 331 and 332:
8rules used in evaluating the equal
- Page 333 and 334:
88.5 The DO ConstructCASE (’YELLO
- Page 335 and 336:
8An example of a nonblock DO constr
- Page 337 and 338:
8LOOP: DO I = 1, NY (I) = A * X (I)
- Page 339 and 340:
88.5.3 Range of a DO ConstructThe r
- Page 341 and 342:
81. The DO variable is set to , the
- Page 343 and 344:
8Example:DOREAD *, DATAIF (DATA < 0
- Page 345 and 346:
82. If the CYCLE statement has a co
- Page 347 and 348:
88.6.2.1 Form of the GO TO Statemen
- Page 349 and 350:
8Normally, the statement has a labe
- Page 351 and 352:
82. The label must be the label of
- Page 353 and 354:
88.8 Summary8.8.1 IF ConstructIf th
- Page 355 and 356:
88.8.7 DO WHILE LoopDO I = 1, 100X
- Page 357 and 358:
Input and Output Processing 9Many p
- Page 359 and 360:
9properties are acquired or how the
- Page 361 and 362:
9one character representation in th
- Page 363 and 364:
9files is described in detail in Se
- Page 365 and 366:
9.Figure 9-7 A file positioned betw
- Page 367 and 368:
9file. If another read operation is
- Page 369 and 370:
9new file, this produces a file rep
- Page 371 and 372:
9by the operating system when reque
- Page 373 and 374:
9There are many additional rules de
- Page 375 and 376:
95. If a label or a variable with a
- Page 377 and 378:
9ERR= labeld. The variable given in
- Page 379 and 380:
93. The variable specified in the S
- Page 381 and 382:
9INTEGERA(100), V(10)! Suppose V’
- Page 383 and 384:
9Rules and restrictions:1. The inpu
- Page 385 and 386:
99.2.4 Unformatted Sequential Acces
- Page 387 and 388:
9end-of-record condition occurs. No
- Page 389 and 390:
9produce the single output record:T
- Page 391 and 392:
9Rules and restrictions:1. The form
- Page 393 and 394:
9Rules and restrictions:1. On input
- Page 395 and 396:
92. For the data transfer, values m
- Page 397 and 398:
9Rules and restrictions:1. The inpu
- Page 399 and 400:
9WRITE (FMT = *, UNIT = CHAR_VAR) X
- Page 401 and 402:
99.2.10 Printing of Formatted Recor
- Page 403 and 404:
99.3.1 Data TransferData are transf
- Page 405 and 406:
9completion of the input/output sta
- Page 407 and 408:
99.5 The OPEN StatementCALL END_PRO
- Page 409 and 410:
9POSITION = scalar-default-characte
- Page 411 and 412:
9[UNIT=] scalar integer expressionR
- Page 413 and 414:
92. If the DELIM= specifier is APOS
- Page 415 and 416:
9NOrequires that the input record c
- Page 417 and 418:
9SCRATCHindicates that an unnamed f
- Page 419 and 420:
9Rules:1. If an error condition occ
- Page 421 and 422:
9NAMED = scalar-default-logical-var
- Page 423 and 424:
9UNDEFINEDindicates the file is not
- Page 425 and 426:
92. The file name may refer to a fi
- Page 427 and 428:
9falseindicates the file or unit is
- Page 429 and 430:
9NOUNKNOWNindicates unformatted inp
- Page 431 and 432:
9The forms of the ENDFILE statement
- Page 433 and 434:
99.8.2 The BACKSPACE StatementExecu
- Page 435 and 436:
99.10 Summary9.10.1 Fortran FilesA
- Page 437 and 438:
99.10.12 Unformatted Sequential Acc
- Page 439 and 440:
Input and Output Editing 10Data usu
- Page 441 and 442:
10Table 10-2DescriptorABDEENESFGILO
- Page 443 and 444:
104. If the expression is an array
- Page 445 and 446:
103. Blanks may be used as follows:
- Page 447 and 448:
10where n and r are default integer
- Page 449 and 450:
10ii. on output, create an empty re
- Page 451 and 452:
10in the list is called an effectiv
- Page 453 and 454:
1010.5 File Positioning by Format C
- Page 455 and 456:
102. Negative values must have a ne
- Page 457 and 458:
1010.6.2 Real Editing3. If m is not
- Page 459 and 460:
106. The number may contain an E or
- Page 461 and 462:
10Table 10-4Forms for the exponent
- Page 463 and 464:
10Table 10-5Forms for the exponent
- Page 465 and 466:
10Examples:Internal valueOutput fie
- Page 467 and 468:
10produces the output:bb87.6bbbbbec
- Page 469 and 470:
102. If w is less than the length l
- Page 471 and 472:
104. The X descriptor always moves
- Page 473 and 474:
10Example: If ALTER, POSITION, and
- Page 475 and 476:
10produces:b1296.E-0210.9.6 Blanks
- Page 477 and 478:
1010.10 List-Directed FormattingLis
- Page 479 and 480:
10Examples are:"NICE DAY"(1.2, 5.66
- Page 481 and 482:
104. If a slash terminates input, t
- Page 483 and 484:
10Example:REAL :: TEMPERATURE = -7.
- Page 485 and 486:
103. If the processor supports uppe
- Page 487 and 488:
10(1.0,0.0)A01.0EN-32.2_QUAD2. Blan
- Page 489 and 490:
10results of the READ statement are
- Page 491 and 492:
1010.11.2.2 DELIM= Specifier for Ch
- Page 493 and 494:
1010.12.4 Data Edit DescriptorsTher
- Page 495 and 496:
Program Units 11There are several k
- Page 497 and 498:
11PROGRAM DRIVER. . .CALL MECHANIC
- Page 499 and 500:
1111.2.2 The Specification PartThe
- Page 501 and 502:
115. pointer statements, including
- Page 503 and 504:
11An internal procedure can be refe
- Page 505 and 506:
11HostHostTOTALInternal-1Internal-2
- Page 507 and 508:
11! X declared explicitly in intern
- Page 509 and 510:
11major practical advantage of inte
- Page 511 and 512:
11There is an even greater need in
- Page 513 and 514:
11The following is an example of a
- Page 515 and 516:
11using the module. A PUBLIC entity
- Page 517 and 518:
1111.6.4.3 Entities Accessible from
- Page 519 and 520:
11Such a name conflict is allowed i
- Page 521 and 522:
1111.6.5 Typical Applications of Mo
- Page 523 and 524:
11The module NEW_TYPE contains the
- Page 525 and 526:
11An input routine may be called us
- Page 527 and 528:
1111.7 Block Data Program UnitsA bl
- Page 529 and 530:
11PROGRAM SHUTTLE_SIMULATION. . . !
- Page 531 and 532:
11packaging data types along with n
- Page 533 and 534:
Using Procedures 12Procedures are v
- Page 535 and 536:
1212.1.1.1 SubroutinesA subroutine
- Page 537 and 538:
1212.1.1.8 Statement FunctionsState
- Page 539 and 540:
12argument for a dummy procedure mu
- Page 541 and 542:
123. host association4. use associa
- Page 543 and 544:
1212.2.1 Subroutine DefinitionThe f
- Page 545 and 546:
12actual argument; variables may be
- Page 547 and 548:
12USE POLAR_COORDINATESCOMPLEX :: C
- Page 549 and 550:
128. If there is no result clause,
- Page 551 and 552:
1212.3.3 Function ReferenceOne way
- Page 553 and 554:
1212.3.4 Statement FunctionsA state
- Page 555 and 556:
1212.4 Procedure-Related Statements
- Page 557 and 558:
12SUBROUTINE name-1 ( argument-list
- Page 559 and 560:
12dummy argument appears in the ENT
- Page 561 and 562:
12As shown in Figure 12-1, the fund
- Page 563 and 564:
12The most fundamental rule of argu
- Page 565 and 566:
12becomes the length of the actual
- Page 567 and 568:
12elements obtained by varying the
- Page 569 and 570:
12In the array element sequence ass
- Page 571 and 572:
12argument be supplied to the dummy
- Page 573 and 574:
12as may be an actual argument, but
- Page 575 and 576:
12In cases B and D in Figure 12-5,
- Page 577 and 578:
12arguments is when an optional arg
- Page 579 and 580:
124. A dummy argument not present m
- Page 581 and 582:
12rules follow; for further details
- Page 583 and 584:
12Prediction: Elemental references
- Page 585 and 586:
1212.6 Procedure InterfacesDummy pr
- Page 587 and 588:
12CALL EX (P=V, Q=W, R=X, S=Y, T=Z)
- Page 589 and 590:
12corresponding value of another da
- Page 591 and 592:
123. In all cases an interface body
- Page 593 and 594:
12Fortran 90 to allow users to defi
- Page 595 and 596:
1212.6.4 Defined OperatorsJust as g
- Page 597 and 598:
12intrinsic function” and the ope
- Page 599 and 600:
12In analogy with the discussion of
- Page 601 and 602:
1212.7.4 ENTRY StatementThe ENTRY s
- Page 603 and 604:
1212.7.12 RecursionExternal, module
- Page 605 and 606:
Intrinsic Procedures 13Intrinsic pr
- Page 607 and 608:
13functions (13.3), the array funct
- Page 609 and 610:
13wherei is the integer values is t
- Page 611 and 612:
13SELECTED_REAL_KIND returns the re
- Page 613 and 614:
13FunctionALLOCATEDLBOUNDSHAPESIZEU
- Page 615 and 616:
13FunctionValue returnedABSThe abso
- Page 617 and 618:
13FunctionALLANYCOUNTMAXVALMINVALPR
- Page 619 and 620:
13Table 13-1Function(Continued) Lis
- Page 621 and 622:
13Table 13-1Function(Continued) Lis
- Page 623 and 624:
13Table 13-1Function(Continued) Lis
- Page 625 and 626:
13Table 13-2(Continued) List of int
- Page 627 and 628:
1313.10 SummaryThere are 113 intrin
- Page 629 and 630:
Scope, Association, and Definition
- Page 631 and 632:
1414.1 The Use of NamesThus, the th
- Page 633 and 634:
14Some scoping units can contain ot
- Page 635 and 636:
14procedures, module procedures, in
- Page 637 and 638:
149. For each function and function
- Page 639 and 640:
143. nongeneric specific names of i
- Page 641 and 642:
145. If the procedure name appears
- Page 643 and 644:
14Executable programExternal progra
- Page 645 and 646:
14and the scoping unit of either an
- Page 647 and 648:
14A sequence of any number of conse
- Page 649 and 650:
14The EQUIVALENCE statement indicat
- Page 651 and 652:
14may cause certain associated or p
- Page 653 and 654:
14becomes defined and the real vari
- Page 655 and 656:
14e. The result variable of a funct
- Page 657 and 658:
Intrinsic ProceduresAThis appendix
- Page 659 and 660:
AA.3 ACOS (X)A.4 ADJUSTL (STRING)A.
- Page 661 and 662:
AA.8 ALL (MASK, DIM)Result Type and
- Page 663 and 664:
AA.10 ANINT (A, KIND)Optional Argum
- Page 665 and 666:
AA.13 ASSOCIATED (POINTER, TARGET)O
- Page 667 and 668:
AA.15 ATAN2 (Y, X)Description. Arct
- Page 669 and 670:
AA.18 CEILING (A)A.19 CHAR (I, KIND
- Page 671 and 672:
AA.21 CONJG (Z)Description. Conjuga
- Page 673 and 674:
AA.25 CSHIFT (ARRAY, SHIFT, DIM)Cas
- Page 675 and 676:
Awhere CC is the century, YY the ye
- Page 677 and 678:
ACase (iii):If A is of type complex
- Page 679 and 680:
AExamples.Case (i): DOT_PRODUCT ( (
- Page 681 and 682:
AExamples.Case (i):Case (ii):If V i
- Page 683 and 684:
AA.36 FLOOR (A)A.37 FRACTION (X)A.3
- Page 685 and 686:
AArguments.IJmust be of type intege
- Page 687 and 688:
AResult Value. The result has the v
- Page 689 and 690:
AResult Value.Case (i):Case (ii):If
- Page 691 and 692:
AA.49 ISHFT (I, SHIFT)The model for
- Page 693 and 694:
AArguments.ARRAYDIM (optional)may b
- Page 695 and 696:
AArguments.STRING_ASTRING_Bmust be
- Page 697 and 698:
Athe result is processor dependent.
- Page 699 and 700:
AResult Type, Type Parameter, and S
- Page 701 and 702:
AA.65 MAXLOC (ARRAY, MASK)Optional
- Page 703 and 704:
AResult Value.Case (i):Case (ii):Ca
- Page 705 and 706:
AA.69 MINEXPONENT (X)Description. R
- Page 707 and 708:
AArguments.ARRAYDIM (optional)MASK
- Page 709 and 710:
AArguments.APmust be of type intege
- Page 711 and 712:
AA.76 NINT (A, KIND)Example. NEARES
- Page 713 and 714:
AA.79 PRECISION (X)A.80 PRESENT (A)
- Page 715 and 716:
ADIM (optional)MASK (optional)must
- Page 717 and 718:
AClass. Subroutine.Arguments. There
- Page 719 and 720:
AA.87 REPEAT (STRING, NCOPIES)Examp
- Page 721 and 722:
AExample. RRSPACING (-3.0) has the
- Page 723 and 724:
AA.93 SELECTED_REAL_KIND (P, R)Exam
- Page 725 and 726:
AA.96 SIGN (A, B)Description. Absol
- Page 727 and 728:
AResult Value. The result has the v
- Page 729 and 730:
ADIM (optional)MASK (optional)must
- Page 731 and 732:
AA.105 TAN (X)Description. Tangent
- Page 733 and 734:
Apart of SOURCE. If D and E are sca
- Page 735 and 736:
AResult Value.Case (i):Case (ii):Fo
- Page 737 and 738:
AResult Type and Type Parameter. De
- Page 739 and 740:
Fortran 90 SyntaxBB.1 The Form of t
- Page 741 and 742:
BB.1.3 Alternative Syntax Symbol
- Page 743 and 744:
BB.1.9 ConstraintsThe BNF forms do
- Page 745 and 746:
Bor subroutine-subprogramR214 speci
- Page 747 and 748:
BR712 concat-op is //R714 rel-op is
- Page 749 and 750:
BConstraint: The same private-seque
- Page 751 and 752:
BConstraint: If the TARGET attribut
- Page 753 and 754:
BR527 pointer-stmt is POINTER [ ::
- Page 755 and 756:
BConstraint: A common-block-object
- Page 757 and 758:
BB.2.7 Expressions and AssignmentR7
- Page 759 and 760:
BConstraint:Constraint:In each assi
- Page 761 and 762:
BR830 outer-shared-do-construct is
- Page 763 and 764:
Bor REC = scalar-int-expror IOSTAT
- Page 765 and 766:
BConstraint:Constraint:or READWRITE
- Page 767 and 768:
BB.2.12 ProceduresR1106 end-module-
- Page 769 and 770:
BConstraint: If a function-name is
- Page 771 and 772:
BSymbol Defined in Referenced inact
- Page 773 and 774:
BSymbol Defined in Referenced incon
- Page 775 and 776:
BSymbol Defined in Referenced inexe
- Page 777 and 778:
BSymbol Defined in Referenced inio-
- Page 779 and 780:
BSymbol Defined in Referenced inpri
- Page 781 and 782:
BSymbol Defined in Referenced incas
- Page 783 and 784:
BSymbol Defined in Referenced in+ R
- Page 785 and 786:
BSymbol Defined in Referenced inCOM
- Page 787 and 788:
BSymbol Defined in Referenced inO R
- Page 789 and 790:
Decremental FeaturesCC.1 Deleted Fe
- Page 791 and 792:
CC.2.3 ASSIGN and Assigned GO TO St
- Page 793 and 794:
Index of ExamplesSymbols/ edit desc
- Page 795 and 796:
defined-type declaration 114defined
- Page 797 and 798:
384namelist input 471, 473, 476name
- Page 799 and 800:
WHERE statement 301WRITE statement
- Page 801 and 802:
IndexSymbols-IX, 771%IX, 770'IX, 77
- Page 803 and 804:
ANSIIX, 14ANY functionIX, 651apostr
- Page 805 and 806:
dataIX, 41default statusIX, 133DIME
- Page 807 and 808:
character typeIX, 108-110, 138-141c
- Page 809 and 810:
CONTINUE statementIX, 323, 336label
- Page 811 and 812:
digitIX, 769DIGITS functionIX, 665d
- Page 813 and 814:
end-function-stmtIX, 762end-if-stmt
- Page 815 and 816:
FFIX, 773F edit descriptorIX, 445,
- Page 817 and 818:
function-stmtIX, 763function-subpro
- Page 819 and 820:
unit numberIX, 414inquiry functionI
- Page 821 and 822:
labelfixed source formIX, 81free so
- Page 823 and 824:
genericIX, 580groupIX, 471number of
- Page 825 and 826:
or-opIX, 766or-operandIX, 766OUTIX,
- Page 827 and 828:
portableIX, 23standard-conformingIX
- Page 829 and 830:
SELECTED_INT_KIND functionIX,710SEL
- Page 831 and 832:
ENDFILEIX, 419, 421entityIX, 620ENT
- Page 833 and 834:
Fortran 90IX, 727low-levelIX, 69, 8
- Page 835:
variableIX, 47, 199-200, 238associa