@@ -1340,7 +1340,7 @@ Procedures to report on the structure of the map:
1340
1340
* ` total_depth( map ) ` - Returns the total number of one's based
1341
1341
offsets of slot entries from their slot index
1342
1342
1343
- ### Specifications of the ` stdlib_hashmap_chaining ` procedures
1343
+ ### Specifications of the ` stdlib_hashmaps ` procedures
1344
1344
1345
1345
#### ` calls ` - Returns the number of calls on a hash map
1346
1346
@@ -1961,13 +1961,11 @@ generation of `inmap`, `other` is undefined.
1961
1961
integer(int_index) :: inmap
1962
1962
class(*), allocatable :: dummy
1963
1963
allocate( dummy, source=4.0 )
1964
- call init( map, &
1965
- fnv_1_hasher, &
1966
- slots_bits=10 )
1964
+ call map % init( fnv_1_hasher, slots_bits=10 )
1967
1965
call set( key, [ 5_int8, 7_int8, 4_int8, 13_int8 ] )
1968
1966
call set( other, dummy )
1969
- call map_entry( map, inmap, key, other )
1970
- call remove_entry( map, inmap )
1967
+ call map % map_entry( inmap, key, other )
1968
+ call map % remove_entry( inmap )
1971
1969
end program demo_remove_entry
1972
1970
```
1973
1971
@@ -2207,7 +2205,7 @@ the inverse table.
2207
2205
2208
2206
##### Syntax
2209
2207
2210
- ` result = [[stdlib_hashmaps:map % valid_index]]( map ) `
2208
+ ` result = [[stdlib_hashmaps:map % valid_index]]( inmap ) `
2211
2209
2212
2210
##### Class
2213
2211
@@ -2245,7 +2243,7 @@ table of `map` and `.false.` otherwise.
2245
2243
logocal :: valid
2246
2244
call map % init( fnv_1_hasher )
2247
2245
inmap = 10
2248
- valid = map % valid_index ( inmap)
2246
+ valid = map % valid_index ( inmap )
2249
2247
print *, "Initial index of 10 valid for empty map = ", valid
2250
2248
end program demo_valid_index
2251
2249
```
0 commit comments