Additional methods for the TreElM module
Type | Visibility | Attributes | Name | Initial | |||
---|---|---|---|---|---|---|---|
integer, | private, | parameter | :: | InitialSize | = | 8 |
initial size of arrays, if size was 0 |
return the position of a value in 'me', which is an array with sorted entries. if the value was not found, - return 0 if nextifnotfound = .false. - return position at the end if nextifnotfound = .true.
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=long_k), | intent(in) | :: | me(:) |
array to search in |
||
integer(kind=long_k), | intent(in) | :: | val |
value to look for |
||
integer, | intent(in), | optional | :: | lower |
lower search limit |
|
integer, | intent(in), | optional | :: | upper |
upper search limit |
position of val in the sorted list, 0 if not found
append position should be only int type. Only the value should be long_k
append an entry at the end of the integer list If the first entry is zero, write into that one
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
type(tem_intList), | pointer | :: | firstEntry |
linked list of resulting elements building the neighbor |
||
integer(kind=int_k), | intent(in) | :: | entryPos |
Add that element |
append an entry at the end of the integer list If the first entry is zero, write into that one
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
type(tem_longList), | pointer | :: | firstEntry |
linked list of resulting elements building the neighbor |
||
integer(kind=long_k), | intent(in) | :: | entryPos |
Add that element |
append an entry to an allocatable array 1d with single integer If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=int_k), | intent(inout), | allocatable | :: | Array(:) |
array to append value to |
|
integer, | intent(in) | :: | Position |
position the value is appended to |
||
integer(kind=int_k), | intent(in) | :: | Value |
value to append |
append an entry to an allocatable array 1d with single integer If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=int_k), | intent(inout), | allocatable | :: | Array(:,:) |
array to append value to |
|
integer, | intent(in) | :: | Position1 | |||
integer, | intent(in) | :: | Position2 | |||
integer(kind=int_k), | intent(in) | :: | Value |
value to append |
append an entry to an allocatable array 1d with long integer If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=long_k), | intent(inout), | allocatable | :: | Array(:) |
array to append value to |
|
integer, | intent(in) | :: | Position |
position the value is appended to |
||
integer(kind=long_k), | intent(in) | :: | Value |
value to append |
append an entry to an allocatable array 1d with long integer If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=long_k), | intent(inout), | allocatable | :: | Array(:,:) |
array to append value to |
|
integer(kind=long_k), | intent(in) | :: | Position1 | |||
integer(kind=long_k), | intent(in) | :: | Position2 | |||
integer(kind=long_k), | intent(in) | :: | Value |
value to append |
append an entry to an allocatable array 1d with single precision If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
real(kind=single_k), | intent(inout), | allocatable | :: | Array(:) |
array to append value to |
|
integer, | intent(in) | :: | Position |
position the value is appended to |
||
real(kind=single_k), | intent(in) | :: | Value |
value to append |
append an entry to an allocatable array 1d with single precision If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
real(kind=single_k), | intent(inout), | allocatable | :: | Array(:,:) |
array to append value to |
|
integer, | intent(in) | :: | Position1 | |||
integer, | intent(in) | :: | Position2 | |||
real(kind=single_k), | intent(in) | :: | Value |
value to append |
append an entry to an allocatable array 1d with double precision If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
real(kind=rk), | intent(inout), | allocatable | :: | Array(:) |
array to append value to |
|
integer, | intent(in) | :: | Position |
position the value is appended to |
||
real(kind=rk), | intent(in) | :: | Value |
value to append |
append an entry to an allocatable array 1d with double precision If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
real(kind=rk), | intent(inout), | allocatable | :: | Array(:,:) |
array to append value to |
|
integer, | intent(in) | :: | Position1 | |||
integer, | intent(in) | :: | Position2 | |||
real(kind=rk), | intent(in) | :: | Value |
value to append |
append an entry to an allocatable array 1d with long integer If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=long_k), | intent(inout), | allocatable | :: | Array(:) |
array to append to |
|
integer(kind=long_k), | intent(in) | :: | ArrayToAppend(:) |
array to append |
append an entry at the end of the integer list If the first entry is zero, write into that one Check, if the current entry already exists Count, how many elements there are in the list
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
type(tem_intList), | pointer | :: | firstEntry |
linked list of resulting elements building the neighbor |
||
integer(kind=int_k), | intent(in) | :: | entryPos |
Add that element |
||
integer, | intent(inout) | :: | nItems |
how many items are in list |
||
logical, | intent(out), | optional | :: | added |
has the current item been added? |
append an entry at the end of the integer list If the first entry is zero, write into that one Check, if the current entry already exists Count, how many elements there are in the list
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
type(tem_longList), | pointer | :: | firstEntry |
linked list of resulting elements building the neighbor |
||
integer(kind=long_k), | intent(in) | :: | entryPos |
Add that element |
||
integer, | intent(inout) | :: | nItems |
how many items are in list |
||
logical, | intent(out), | optional | :: | added |
has the current item been added? |
append an entry to an allocatable array 1d with single integer at the end If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=int_k), | intent(inout), | allocatable | :: | Array(:) |
array to append value to |
|
integer(kind=int_k), | intent(in) | :: | Value |
The value to add as an entry in Array |
||
integer, | intent(inout) | :: | nElems |
Number of entries in the array (changes, if added = .true.) |
||
integer, | intent(out) | :: | Pos |
position the value was appended |
||
logical, | intent(out) | :: | Added |
new entry in array added? |
append an entry to an allocatable array 1d with single integer at the end If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=long_k), | intent(inout), | allocatable | :: | Array(:) |
array to append value to |
|
integer(kind=long_k), | intent(in) | :: | Value |
The value to add as an entry in Array |
||
integer, | intent(inout) | :: | nElems |
Number of entries in the array (changes, if added = .true.) |
||
integer, | intent(out) | :: | Pos |
position the value was appended |
||
logical, | intent(out) | :: | Added |
new entry in array added? |
append an entry to an allocatable array 1d with integer If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=int_k), | intent(inout), | allocatable | :: | Array(:) |
array to resize |
|
integer, | intent(in) | :: | Newsize |
new size of the array |
append an entry to an allocatable array 2d with integer If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=int_k), | intent(inout), | allocatable | :: | Array(:,:) |
array to resize |
|
integer, | intent(in) | :: | Newsize1 |
first new size |
||
integer, | intent(in) | :: | Newsize2 |
second new size |
append an entry to an allocatable array 1d with long integer If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=long_k), | intent(inout), | allocatable | :: | Array(:) |
array to resize |
|
integer, | intent(in) | :: | Newsize |
new size of the array |
append an entry to an allocatable array 2d with long integer If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=long_k), | intent(inout), | allocatable | :: | Array(:,:) |
array to resize |
|
integer, | intent(in) | :: | Newsize1 |
first new size |
||
integer, | intent(in) | :: | Newsize2 |
second new size |
append an entry to an allocatable array 1d with integer If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
real(kind=rk), | intent(inout), | allocatable | :: | Array(:) |
array to resize |
|
integer, | intent(in) | :: | Newsize |
new size of the array |
append an entry to an allocatable array 2d with integer If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
real(kind=rk), | intent(inout), | allocatable | :: | Array(:,:) |
array to resize |
|
integer, | intent(in) | :: | Newsize1 |
first new size |
||
integer, | intent(in) | :: | Newsize2 |
second new size |
Destroy complete list
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
type(tem_intList), | intent(inout), | pointer | :: | ElemList |
linked list of resulting elements building the neighbor |
Destroy complete list
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
type(tem_longList), | intent(inout), | pointer | :: | ElemList |
linked list of resulting elements building the neighbor |
returns the optional value, if present, or the default.
this convenience routine encapsulates the check for an optional argument.
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
logical, | optional | :: | value |
the optional value to check for |
||
logical | :: | default |
the default to use when the optional value is not present. |
the result
returns the optional value, if present, or the default.
this convenience routine encapsulates the check for an optional argument.
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer, | optional | :: | value |
the optional value to check for |
||
integer | :: | default |
the default to use when the optional value is not present. |
the result
returns the optional value, if present, or the default.
this convenience routine encapsulates the check for an optional argument.
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=long_k), | optional | :: | value |
the optional value to check for |
||
integer(kind=long_k) | :: | default |
the default to use when the optional value is not present. |
the result
returns the optional value, if present, or the default.
this convenience routine encapsulates the check for an optional argument.
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
real(kind=rk), | optional | :: | value |
the optional value to check for |
||
real(kind=rk) | :: | default |
the default to use when the optional value is not present. |
the result
returns the optional value, if present, or the default.
this convenience routine encapsulates the check for an optional argument.
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
character, | optional | :: | value |
the optional value to check for |
||
character | :: | default |
the default to use when the optional value is not present. |
the result
return the position of a value in 'me', which is an array with sorted entries. if the value was not found, - return 0 if nextifnotfound = .false. - return position at the end if nextifnotfound = .true.
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=int_k), | intent(in) | :: | me(:) |
array to search in |
||
integer(kind=int_k), | intent(in) | :: | val |
value to look for |
||
integer, | intent(in), | optional | :: | lower |
lower search limit |
|
integer, | intent(in), | optional | :: | upper |
upper search limit |
position of val in the sorted list, 0 if not found
linked list of integers
Type | Visibility | Attributes | Name | Initial | |||
---|---|---|---|---|---|---|---|
integer, | public | :: | elem | ||||
type(tem_intList), | public, | pointer | :: | next | => | null() |
linked list of long integers
Type | Visibility | Attributes | Name | Initial | |||
---|---|---|---|---|---|---|---|
integer(kind=long_k), | public | :: | elem | ||||
type(tem_longList), | public, | pointer | :: | next | => | null() |
Function to turn all upper case characters to lower case.
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
character(len=*) | :: | string |
string to be converted |
converted string
returns the optional value, if present, or the default.
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
logical, | optional | :: | value |
the optional value to check for |
||
logical | :: | default |
the default to use when the optional value is not present. |
the result
returns the optional value, if present, or the default.
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer, | optional | :: | value |
the optional value to check for |
||
integer | :: | default |
the default to use when the optional value is not present. |
the result
returns the optional value, if present, or the default.
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=long_k), | optional | :: | value |
the optional value to check for |
||
integer(kind=long_k) | :: | default |
the default to use when the optional value is not present. |
the result
returns the optional value, if present, or the default.
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
real(kind=rk), | optional | :: | value |
the optional value to check for |
||
real(kind=rk) | :: | default |
the default to use when the optional value is not present. |
the result
returns the optional value, if present, or the default.
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
character, | optional | :: | value |
the optional value to check for |
||
character | :: | default |
the default to use when the optional value is not present. |
the result
return the position of a value in 'me', which is an array with sorted entries. if the value was not found, - return 0 if nextifnotfound = .false. - return position at the end if nextifnotfound = .true.
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=long_k), | intent(in) | :: | me(:) |
array to search in |
||
integer(kind=long_k), | intent(in) | :: | val |
value to look for |
||
integer, | intent(in), | optional | :: | lower |
lower search limit |
|
integer, | intent(in), | optional | :: | upper |
upper search limit |
position of val in the sorted list, 0 if not found
return the position of a value in 'me', which is an array with sorted entries. if the value was not found, - return 0 if nextifnotfound = .false. - return position at the end if nextifnotfound = .true.
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=int_k), | intent(in) | :: | me(:) |
array to search in |
||
integer(kind=int_k), | intent(in) | :: | val |
value to look for |
||
integer, | intent(in), | optional | :: | lower |
lower search limit |
|
integer, | intent(in), | optional | :: | upper |
upper search limit |
position of val in the sorted list, 0 if not found
write out a message with the defined string+real content
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer, | intent(in) | :: | fUnit |
output unit |
||
integer, | intent(in), | optional | :: | before |
optional white lines before print |
|
integer, | intent(in), | optional | :: | after |
optional white lines after print |
|
logical, | intent(in), | optional | :: | toFile |
output goes to debug file |
|
character, | intent(in), | optional | :: | str |
String to be printed at the beginning of the spacer |
print an array to the debugunit
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=long_k), | intent(in) | :: | me(:) |
long array to write to debug file |
||
integer, | optional | :: | itemLength |
how many characters needs each item of the array to output |
||
character(len=*), | optional | :: | title |
Array title in debug output for easy identification in the file |
||
integer, | optional | :: | lineLength |
how long should the line be |
||
integer | :: | nUnit |
to which unit to output |
Read a file from a connected unit into a string.
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer, | intent(in) | :: | funit |
File unit to read, has to be opened sequential and formatted. |
||
character(len=*), | intent(out) | :: | string |
String to fill with the content of the file. |
||
integer, | intent(out) | :: | iError |
Error code: |
append an entry at the end of the integer list If the first entry is zero, write into that one Check, if the current entry already exists Count, how many elements there are in the list
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
type(tem_longList), | pointer | :: | firstEntry |
linked list of resulting elements building the neighbor |
||
integer(kind=long_k), | intent(in) | :: | entryPos |
Add that element |
||
integer, | intent(inout) | :: | nItems |
how many items are in list |
||
logical, | intent(out), | optional | :: | added |
has the current item been added? |
append an entry at the end of the integer list If the first entry is zero, write into that one
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
type(tem_longList), | pointer | :: | firstEntry |
linked list of resulting elements building the neighbor |
||
integer(kind=long_k), | intent(in) | :: | entryPos |
Add that element |
Destroy complete list
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
type(tem_longList), | intent(inout), | pointer | :: | ElemList |
linked list of resulting elements building the neighbor |
append an entry at the end of the integer list If the first entry is zero, write into that one Check, if the current entry already exists Count, how many elements there are in the list
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
type(tem_intList), | pointer | :: | firstEntry |
linked list of resulting elements building the neighbor |
||
integer(kind=int_k), | intent(in) | :: | entryPos |
Add that element |
||
integer, | intent(inout) | :: | nItems |
how many items are in list |
||
logical, | intent(out), | optional | :: | added |
has the current item been added? |
append an entry at the end of the integer list If the first entry is zero, write into that one
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
type(tem_intList), | pointer | :: | firstEntry |
linked list of resulting elements building the neighbor |
||
integer(kind=int_k), | intent(in) | :: | entryPos |
Add that element |
Destroy complete list
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
type(tem_intList), | intent(inout), | pointer | :: | ElemList |
linked list of resulting elements building the neighbor |
append an entry to an allocatable array 1d with long integer If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=long_k), | intent(inout), | allocatable | :: | Array(:) |
array to append to |
|
integer(kind=long_k), | intent(in) | :: | ArrayToAppend(:) |
array to append |
append an entry to an allocatable array 1d with long integer If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=long_k), | intent(inout), | allocatable | :: | Array(:) |
array to append value to |
|
integer, | intent(in) | :: | Position |
position the value is appended to |
||
integer(kind=long_k), | intent(in) | :: | Value |
value to append |
append an entry to an allocatable array 1d with long integer If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=long_k), | intent(inout), | allocatable | :: | Array(:,:) |
array to append value to |
|
integer(kind=long_k), | intent(in) | :: | Position1 | |||
integer(kind=long_k), | intent(in) | :: | Position2 | |||
integer(kind=long_k), | intent(in) | :: | Value |
value to append |
append an entry to an allocatable array 1d with single integer at the end If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=int_k), | intent(inout), | allocatable | :: | Array(:) |
array to append value to |
|
integer(kind=int_k), | intent(in) | :: | Value |
The value to add as an entry in Array |
||
integer, | intent(inout) | :: | nElems |
Number of entries in the array (changes, if added = .true.) |
||
integer, | intent(out) | :: | Pos |
position the value was appended |
||
logical, | intent(out) | :: | Added |
new entry in array added? |
append an entry to an allocatable array 1d with single integer at the end If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=long_k), | intent(inout), | allocatable | :: | Array(:) |
array to append value to |
|
integer(kind=long_k), | intent(in) | :: | Value |
The value to add as an entry in Array |
||
integer, | intent(inout) | :: | nElems |
Number of entries in the array (changes, if added = .true.) |
||
integer, | intent(out) | :: | Pos |
position the value was appended |
||
logical, | intent(out) | :: | Added |
new entry in array added? |
append an entry to an allocatable array 1d with single integer If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=int_k), | intent(inout), | allocatable | :: | Array(:) |
array to append value to |
|
integer, | intent(in) | :: | Position |
position the value is appended to |
||
integer(kind=int_k), | intent(in) | :: | Value |
value to append |
append an entry to an allocatable array 1d with single integer If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=int_k), | intent(inout), | allocatable | :: | Array(:,:) |
array to append value to |
|
integer, | intent(in) | :: | Position1 | |||
integer, | intent(in) | :: | Position2 | |||
integer(kind=int_k), | intent(in) | :: | Value |
value to append |
append an entry to an allocatable array 1d with single precision If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
real(kind=single_k), | intent(inout), | allocatable | :: | Array(:) |
array to append value to |
|
integer, | intent(in) | :: | Position |
position the value is appended to |
||
real(kind=single_k), | intent(in) | :: | Value |
value to append |
append an entry to an allocatable array 1d with single precision If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
real(kind=single_k), | intent(inout), | allocatable | :: | Array(:,:) |
array to append value to |
|
integer, | intent(in) | :: | Position1 | |||
integer, | intent(in) | :: | Position2 | |||
real(kind=single_k), | intent(in) | :: | Value |
value to append |
append an entry to an allocatable array 1d with double precision If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
real(kind=rk), | intent(inout), | allocatable | :: | Array(:) |
array to append value to |
|
integer, | intent(in) | :: | Position |
position the value is appended to |
||
real(kind=rk), | intent(in) | :: | Value |
value to append |
append an entry to an allocatable array 1d with double precision If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
real(kind=rk), | intent(inout), | allocatable | :: | Array(:,:) |
array to append value to |
|
integer, | intent(in) | :: | Position1 | |||
integer, | intent(in) | :: | Position2 | |||
real(kind=rk), | intent(in) | :: | Value |
value to append |
append an entry to an allocatable array 1d with integer If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=int_k), | intent(inout), | allocatable | :: | Array(:) |
array to resize |
|
integer, | intent(in) | :: | Newsize |
new size of the array |
append an entry to an allocatable array 2d with integer If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=int_k), | intent(inout), | allocatable | :: | Array(:,:) |
array to resize |
|
integer, | intent(in) | :: | Newsize1 |
first new size |
||
integer, | intent(in) | :: | Newsize2 |
second new size |
append an entry to an allocatable array 1d with long integer If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=long_k), | intent(inout), | allocatable | :: | Array(:) |
array to resize |
|
integer, | intent(in) | :: | Newsize |
new size of the array |
append an entry to an allocatable array 2d with long integer If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=long_k), | intent(inout), | allocatable | :: | Array(:,:) |
array to resize |
|
integer, | intent(in) | :: | Newsize1 |
first new size |
||
integer, | intent(in) | :: | Newsize2 |
second new size |
append an entry to an allocatable array 1d with integer If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
real(kind=rk), | intent(inout), | allocatable | :: | Array(:) |
array to resize |
|
integer, | intent(in) | :: | Newsize |
new size of the array |
append an entry to an allocatable array 2d with integer If the array is too small, reallocate with double size
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
real(kind=rk), | intent(inout), | allocatable | :: | Array(:,:) |
array to resize |
|
integer, | intent(in) | :: | Newsize1 |
first new size |
||
integer, | intent(in) | :: | Newsize2 |
second new size |