Procedures

Left-adjust the character sequence represented by the string. The length of the character sequence remains unchanged.

Right-adjust the character sequence represented by the string. The length of the character sequence remains unchanged.

Sets the bits in set1 to the bitwise and of the original bits in set1 and set2. The sets must have the same number of bits otherwise the result is undefined. (Specification)

Sets the bits in set1 to the bitwise and of the original bits in set1 with the bitwise negation of set2. The sets must have the same number of bits otherwise the result is undefined.

arange creates a one-dimensional array of the integer/real type with fixed-spaced values of given spacing, within a given interval. (Specification)

(Specification)

Assign a character sequence to a string.

Used to define assignment for bitset_large. (Specification)

Returns an instance of type 'stringlist_index_type' representing backward index Specifications

Returns the number of bit positions in self.

Get uniform distribution cumulative distribution function (cdf) for integer, real and complex variables. (Specification)

Return the character sequence represented by the string.

Checks the value of a logical condition (Specification)

Remove trailing characters in set from string. If no character set is provided trailing whitespace is removed.

Pearson correlation of array elements (Specification)

Returns the number of times substring 'pattern' has appeared in the input string 'string' Specifications

Covariance of array elements (Specification)

Creates a diagonal array or extract the diagonal elements of an array (Specification)

Version experimental

First derivative Legendre polynomial

Check whether a string ends with substring or not

Creates a new bitset, new, from a range, start_pos to stop_pos, in bitset old. If start_pos is greater than stop_pos the new bitset is empty. If start_pos is less than zero or stop_pos is greater than bits(old)-1 then if status is present it has the value index_invalid_error and new is undefined, otherwise processing stops with an informative message. (Specification)

Constructs the identity matrix. (Specification)

Returns an instance of type 'stringlist_index_type' representing forward index Specifications

Finds the starting index of substring 'pattern' in the input 'string' Specifications

Computes Gauss-Legendre quadrature nodes and weights.

Computes Gauss-Legendre-Lobatto quadrature nodes and weights.

Returns the greatest common divisor of two integers (Specification)

Getter function to retrieve standard library version

Code in ASCII collating sequence.

Character-to-integer conversion function.

Position of a substring within a string.

Checks whether c is an ASCII letter (A .. Z, a .. z).

Checks whether c is a letter or a number (0 .. 9, a .. z, A .. Z).

Checks whether or not c is in the ASCII character set - i.e. in the range 0 .. 0x7F.

Checks whether or not c is a blank character. That includes the only the space and tab characters

Checks whether c is a control character.

Checks whether c is a digit (0 .. 9).

Checks whether or not c is a printable character other than the space character.

Checks whether c is a digit in base 16 (0 .. 9, A .. F, a .. f).

Checks whether c is a lowercase ASCII letter (a .. z).

Checks whether c is a digit in base 8 (0 .. 7).

Checks whether or not c is a printable character - including the space character.

Checks whether or not c is a punctuation character. That includes all ASCII characters which are not control characters, letters, digits, or whitespace.

Checks whether c is an uppercase ASCII letter (A .. Z).

Checks whether or not c is a whitespace character. That includes the space, tab, vertical tab, form feed, carriage return, and linefeed characters.

Legendre polynomial

Returns the length of the character sequence represented by the string.

Returns the length of the character sequence without trailing spaces represented by the string.

Lexically compare the order of two character sequences being greater equal, The left-hand side, the right-hand side or both character sequences can be represented by a string.

Lexically compare the order of two character sequences being greater, The left-hand side, the right-hand side or both character sequences can be represented by a string.

Create rank 1 array of linearly spaced elements If the number of elements is not specified, create an array with size 100. If n is a negative value, return an array with size 0. If n = 1, return an array whose only element is end (Specification)

Lexically compare the order of two character sequences being less equal, The left-hand side, the right-hand side or both character sequences can be represented by a string.

Lexically compare the order of two character sequences being less, The left-hand side, the right-hand side or both character sequences can be represented by a string.

Loads a 2D array from a text file (Specification)

Create rank 1 array of logarithmically spaced elements from basestart to baseend. If the number of elements is not specified, create an array with size 50. If n is a negative value, return an array with size 0. If n = 1, return an array whose only element is base**end. If no base is specified, logspace will default to using a base of 10

Mean of array elements (Specification)

Median of array elements (Specification)

Central moment of array elements (Specification)

Moves the allocated character scalar from 'from' to 'to' Specifications

Opens a file (Specification)

Concatenate two character sequences, the left-hand side, the right-hand side or both character sequences can be represented by a string.

Concatenates stringlist with the input entity Returns a new stringlist Specifications

Compare two character sequences for inequality, the left-hand side, the right-hand side or both character sequences can be represented by a string.

Compares stringlist for inequality with the input entity Returns a logical Specifications

Returns .true. if not all bits in set1 and set2 have the same value, .false. otherwise. The sets must have the same number of bits otherwise the result is undefined. (Specification)

Compare two character sequences for being less, the left-hand side, the right-hand side or both character sequences can be represented by a string.

Returns .true. if the bits in set1 and set2 differ and the highest order different bit is set to 0 in set1 and to 1 in set2, .false. otherwise. The sets must have the same number of bits otherwise the result is undefined. (Specification)

Compare two character sequences for being less than, the left-hand side, the right-hand side or both character sequences can be represented by a string.

Returns .true. if the bits in set1 and set2 are the same or the highest order different bit is set to 0 in set1 and to 1 in set2, .false. otherwise. The sets must have the same number of bits otherwise the result is undefined. (Specification)

Compare two character sequences for equality, the left-hand side, the right-hand side or both character sequences can be represented by a string.

Compares stringlist for equality with the input entity Returns a logical Specifications

Returns .true. if all bits in set1 and set2 have the same value, .false. otherwise. The sets must have the same number of bits otherwise the result is undefined. (Specification)

Compare two character sequences for being greater, the left-hand side, the right-hand side or both character sequences can be represented by a string.

Returns .true. if the bits in set1 and set2 differ and the highest order different bit is set to 1 in set1 and to 0 in set2, .false. otherwise. The sets must have the same number of bits otherwise the result is undefined. (Specification)

Compare two character sequences for being greater than, the left-hand side, the right-hand side or both character sequences can be represented by a string.

Returns .true. if the bits in set1 and set2 are the same or the highest order different bit is set to 1 in set1 and to 0 in set2, .false. otherwise. The sets must have the same number of bits otherwise the result is undefined. (Specification)

Fallback value for optional arguments (Specification)

Sets the bits in set1 to the bitwise or of the original bits in set1 and set2. The sets must have the same number of bits otherwise the result is undefined. (Specification)

The generic subroutine interface implementing the ORD_SORT algorithm, a translation to Fortran 2008, of the "Rust" sort algorithm found in slice.rs https://github.com/rust-lang/rust/blob/90eb44a5897c39e3dff9c7e48e3973671dcd9496/src/liballoc/slice.rs#L2159 ORD_SORT is a hybrid stable comparison algorithm combining merge sort, and insertion sort. (Specification)

Computes the outer product of two vectors, returning a rank-2 array (Specification)

Left pad the input string Specifications

Right pad the input string Specifications

Get uniform distribution probability density (pdf) for integer, real and complex variables. (Specification)

Version experimental

Read a character sequence from a connected unformatted unit into the string.

Read a character sequence from a connected unformatted unit into the string.

Repeats the character sequence hold by the string by the number of specified copies.

Replaces all the occurrences of substring 'pattern' in the input 'string' with the replacement 'replacement' Version: experimental

Reverses the character sequence hold by the input string

Reverse the character order in the input character variable (Specification)

Get uniformly distributed random variate for integer, real and complex variables. (Specification)

Saves a 2D array into a text file (Specification)

Scan a string for the presence of a set of characters. Scans a string for any of the characters in a set of characters.

(Specification)

Fisher-Yates shuffle algorithm for a rank one array of integer, real and complex variables. (Specification)

Integrates sampled values using Simpson's rule (Specification)

Integrates sampled values using trapezoidal rule weights for given abscissas (Specification)

Extracts characters from the input string to return a new string

The generic subroutine interface implementing the SORT algorithm, based on the introsort of David Musser. (Specification)

The generic subroutine interface implementing the SORT_INDEX algorithm, based on the "Rust" sort algorithm found in slice.rs https://github.com/rust-lang/rust/blob/90eb44a5897c39e3dff9c7e48e3973671dcd9496/src/liballoc/slice.rs#L2159 but modified to return an array of indices that would provide a stable sort of the rank one ARRAY input. (Specification)

Check whether a string starts with substring or not

Constructor for new string instances

Constructor for stringlist Returns an instance of type stringlist_type Specifications

Remove leading and trailing whitespace characters.

Returns the lowercase version of the character sequence hold by the input string

Convert character variable to lower case (Specification)

Returns the sentencecase version of the character sequence hold by the input string

Converts character sequence to sentence case (Specification)

Format or transfer other types as a string. (Specification)

Returns the titlecase version of the character sequence hold by the input string

Converts character sequence to title case (Specification)

Returns the uppercase version of the character sequence hold by the input string

Convert character variable to upper case (Specification)

Computes the trace of a matrix (Specification)

Integrates sampled values using trapezoidal rule (Specification)

Integrates sampled values using trapezoidal rule weights for given abscissas (Specification)

Returns the character sequence hold by the string without trailing spaces.

Variance of array elements (Specification)

Scan a string for the absence of a set of characters. Verifies that all the characters in string belong to the set of characters in set.

Write the character sequence hold by the string to a connected formatted unit.

Write the character sequence hold by the string to a connected unformatted unit.

Sets the bits in set1 to the bitwise xor of the original bits in set1 and set2. The sets must have the same number of bits otherwise the result is undefined. (Specification)