@@ -205,7 +205,7 @@ is mapped to a set bit, and `.false.` is mapped to an unset bit.
205
205
#### Example
206
206
207
207
``` fortran
208
- {!src/examples /bitsets/example_bitsets_assignment.f90!}
208
+ {!example /bitsets/example_bitsets_assignment.f90!}
209
209
```
210
210
211
211
### Table of the non-member comparison operations
@@ -259,7 +259,7 @@ otherwise it is `.false.`.
259
259
#### Example
260
260
261
261
``` fortran
262
- {!src/examples /bitsets/example_bitsets_all.f90!}
262
+ {!example /bitsets/example_bitsets_all.f90!}
263
263
```
264
264
265
265
### ` and ` - bitwise ` and ` of the bits of two bitsets
@@ -296,7 +296,7 @@ number of bits as `set1`.
296
296
#### Example
297
297
298
298
``` fortran
299
- {!src/examples /bitsets/example_bitsets_and.f90!}
299
+ {!example /bitsets/example_bitsets_and.f90!}
300
300
```
301
301
302
302
### ` and_not ` - Bitwise ` and ` of one bitset with the negation of another
@@ -334,7 +334,7 @@ number of bits as `set1`, otherwise the result is undefined.
334
334
#### Example
335
335
336
336
``` fortran
337
- {!src/examples /bitsets/example_bitsets_and_not.f90!}
337
+ {!example /bitsets/example_bitsets_and_not.f90!}
338
338
```
339
339
340
340
### ` any ` - determine whether any bits are set
@@ -368,7 +368,7 @@ is `.false.`.
368
368
#### Example
369
369
370
370
``` fortran
371
- {!src/examples /bitsets/example_bitsets_any.f90!}
371
+ {!example /bitsets/example_bitsets_any.f90!}
372
372
```
373
373
374
374
### ` bit_count ` - return the number of bits that are set
@@ -402,7 +402,7 @@ equal to the number of bits that are set in `self`.
402
402
#### Example
403
403
404
404
``` fortran
405
- {!src/examples /bitsets/example_bitsets_bit_count.f90!}
405
+ {!example /bitsets/example_bitsets_bit_count.f90!}
406
406
```
407
407
408
408
#### ` bits ` - returns the number of bits
@@ -436,7 +436,7 @@ the number of defined bits in `self`.
436
436
#### Example
437
437
438
438
``` fortran
439
- {!src/examples /bitsets/example_bitsets_bits.f90!}
439
+ {!example /bitsets/example_bitsets_bits.f90!}
440
440
```
441
441
442
442
### ` clear ` - clears a sequence of one or more bits
@@ -487,7 +487,7 @@ an `intent(in)` argument.
487
487
#### Example
488
488
489
489
``` fortran
490
- {!src/examples /bitsets/example_bitsets_clear.f90!}
490
+ {!example /bitsets/example_bitsets_clear.f90!}
491
491
```
492
492
493
493
### ` extract ` - create a new bitset from a range in an old bitset
@@ -538,7 +538,7 @@ an `intent(out)` argument. If present it shall have one of the values:
538
538
#### Example
539
539
540
540
``` fortran
541
- {!src/examples /bitsets/example_bitsets_extract.f90!}
541
+ {!example /bitsets/example_bitsets_extract.f90!}
542
542
```
543
543
544
544
### ` flip ` - flip the values of a sequence of one or more bits
@@ -590,7 +590,7 @@ an `intent(in)` argument.
590
590
#### Example
591
591
592
592
``` fortran
593
- {!src/examples /bitsets/example_bitsets_flip.f90!}
593
+ {!example /bitsets/example_bitsets_flip.f90!}
594
594
```
595
595
596
596
### ` from_string ` - initializes a bitset from a binary literal
@@ -640,7 +640,7 @@ codes:
640
640
#### Example
641
641
642
642
``` fortran
643
- {!src/examples /bitsets/example_bitsets_from_string.f90!}
643
+ {!example /bitsets/example_bitsets_from_string.f90!}
644
644
```
645
645
646
646
### ` init ` - ` bitset_type ` initialization routines
@@ -689,7 +689,7 @@ stop code. It can have any of the following error codes:
689
689
#### Example
690
690
691
691
``` fortran
692
- {!src/examples /bitsets/example_bitsets_init.f90!}
692
+ {!example /bitsets/example_bitsets_init.f90!}
693
693
```
694
694
695
695
### ` input ` - reads a bitset from an unformatted file
@@ -742,7 +742,7 @@ values for this `status` are:
742
742
#### Example
743
743
744
744
``` fortran
745
- {!src/examples /bitsets/example_bitsets_input.f90!}
745
+ {!example /bitsets/example_bitsets_input.f90!}
746
746
```
747
747
748
748
### ` none ` - determines whether no bits are set
@@ -777,7 +777,7 @@ The result is `.true.` if no bits in `self` are set, otherwise it is
777
777
#### Example
778
778
779
779
``` fortran
780
- {!src/examples /bitsets/example_bitsets_none.f90!}
780
+ {!example /bitsets/example_bitsets_none.f90!}
781
781
```
782
782
783
783
### ` not ` - Performs the logical complement on a bitset
@@ -807,7 +807,7 @@ complement of their values on input.
807
807
#### Example
808
808
809
809
``` fortran
810
- {!src/examples /bitsets/example_bitsets_not.f90!}
810
+ {!example /bitsets/example_bitsets_not.f90!}
811
811
```
812
812
813
813
### ` or ` - Bitwise OR of the bits of two bitsets
@@ -844,7 +844,7 @@ otherwise the results are undefined.
844
844
#### Example
845
845
846
846
``` fortran
847
- {!src/examples /bitsets/example_bitsets_or.f90!}
847
+ {!example /bitsets/example_bitsets_or.f90!}
848
848
```
849
849
850
850
### ` output ` - Writes a binary representation of a bitset to a file
@@ -887,7 +887,7 @@ code. The two code values have the meaning:
887
887
#### Example
888
888
889
889
``` fortran
890
- {!src/examples /bitsets/example_bitsets_output.f90!}
890
+ {!example /bitsets/example_bitsets_output.f90!}
891
891
```
892
892
893
893
### ` read_bitset ` - initializes ` self ` with the value of a * bitset_literal*
@@ -968,7 +968,7 @@ as its error code. The possible error codes are:
968
968
#### Example
969
969
970
970
``` fortran
971
- {!src/examples /bitsets/example_bitsets_read_bitset.f90!}
971
+ {!example /bitsets/example_bitsets_read_bitset.f90!}
972
972
```
973
973
974
974
### ` set ` - sets a sequence of one or more bits to 1
@@ -1022,7 +1022,7 @@ Elemental subroutine
1022
1022
#### Example
1023
1023
1024
1024
``` fortran
1025
- {!src/examples /bitsets/example_bitsets_set.f90!}
1025
+ {!example /bitsets/example_bitsets_set.f90!}
1026
1026
```
1027
1027
1028
1028
### ` test ` - determine whether a bit is set
@@ -1062,7 +1062,7 @@ otherwise it is `.false.`. If `pos` is outside the range
1062
1062
#### Example
1063
1063
1064
1064
``` fortran
1065
- {!src/examples /bitsets/example_bitsets_test.f90!}
1065
+ {!example /bitsets/example_bitsets_test.f90!}
1066
1066
```
1067
1067
1068
1068
### ` to_string ` - represent a bitset as a binary literal
@@ -1106,7 +1106,7 @@ the stop code. The values have the following meanings:
1106
1106
#### Example
1107
1107
1108
1108
``` fortran
1109
- {!src/examples /bitsets/example_bitsets_to_string.f90!}
1109
+ {!example /bitsets/example_bitsets_to_string.f90!}
1110
1110
```
1111
1111
1112
1112
### ` value ` - determine the value of a bit
@@ -1145,7 +1145,7 @@ is zero.
1145
1145
#### Example
1146
1146
1147
1147
``` fortran
1148
- {!src/examples /bitsets/example_bitsets_value.f90!}
1148
+ {!example /bitsets/example_bitsets_value.f90!}
1149
1149
```
1150
1150
1151
1151
### ` write_bitset ` - writes a * bitset-literal*
@@ -1212,7 +1212,7 @@ the following error code values:
1212
1212
#### Example
1213
1213
1214
1214
``` fortran
1215
- {!src/examples /bitsets/example_bitsets_write_bitset.f90!}
1215
+ {!example /bitsets/example_bitsets_write_bitset.f90!}
1216
1216
```
1217
1217
1218
1218
### ` xor ` - bitwise exclusive ` or `
@@ -1249,7 +1249,7 @@ samee number of bits, otherwise the result is undefined.
1249
1249
#### Example
1250
1250
1251
1251
``` fortran
1252
- {!src/examples /bitsets/example_bitsets_xor.f90!}
1252
+ {!example /bitsets/example_bitsets_xor.f90!}
1253
1253
```
1254
1254
1255
1255
## Specification of the ` stdlib_bitsets ` operators
@@ -1295,7 +1295,7 @@ to the same value, otherwise the result is `.false.`.
1295
1295
#### Example
1296
1296
1297
1297
``` fortran
1298
- {!src/examples /bitsets/example_bitsets_equality.f90!}
1298
+ {!example /bitsets/example_bitsets_equality.f90!}
1299
1299
```
1300
1300
1301
1301
### ` /= ` - compare two bitsets to determine whether any bits differ in value
@@ -1339,7 +1339,7 @@ the result is `.false.`.
1339
1339
#### Example
1340
1340
1341
1341
``` fortran
1342
- {!src/examples /bitsets/example_bitsets_inequality.f90!}
1342
+ {!example /bitsets/example_bitsets_inequality.f90!}
1343
1343
```
1344
1344
1345
1345
### ` >= ` - compare two bitsets to determine whether the first is greater than or equal to the second
@@ -1386,7 +1386,7 @@ or the highest order different bit is set to 1 in `set1` and to 0 in
1386
1386
#### Example
1387
1387
1388
1388
``` fortran
1389
- {!src/examples /bitsets/example_bitsets_ge.f90!}
1389
+ {!example /bitsets/example_bitsets_ge.f90!}
1390
1390
```
1391
1391
1392
1392
### ` > ` - compare two bitsets to determine whether the first is greater than the other
@@ -1433,7 +1433,7 @@ highest order different bit is set to 1 in `set1` and to 0 in `set2`,
1433
1433
#### Example
1434
1434
1435
1435
``` fortran
1436
- {!src/examples /bitsets/example_bitsets_gt.f90!}
1436
+ {!example /bitsets/example_bitsets_gt.f90!}
1437
1437
```
1438
1438
1439
1439
### ` <= ` - compare two bitsets to determine whether the first is less than or equal to the other
@@ -1480,7 +1480,7 @@ or the highest order different bit is set to 0 in `set1` and to 1 in
1480
1480
#### Example
1481
1481
1482
1482
``` fortran
1483
- {!src/examples /bitsets/example_bitsets_le.f90!}
1483
+ {!example /bitsets/example_bitsets_le.f90!}
1484
1484
```
1485
1485
1486
1486
### ` < ` - compare two bitsets to determine whether the first is less than the other
@@ -1527,5 +1527,5 @@ highest order different bit is set to 0 in `set1` and to 1 in `set2`,
1527
1527
#### Example
1528
1528
1529
1529
``` fortran
1530
- {!src/examples /bitsets/example_bitsets_lt.f90!}
1530
+ {!example /bitsets/example_bitsets_lt.f90!}
1531
1531
```
0 commit comments