ParaMonte Fortran 2.0.0
Parallel Monte Carlo and Machine Learning Library
See the latest version documentation. |
This module contains procedures and generic interfaces for checking if a complex
number is lexicographically comparable to another complex
number of the same kind.
More...
Data Types | |
interface | operator(<) |
Generate and return .true. if the real and imaginary components of the input complex argument val1 are lexicographically less than the corresponding components of the input complex argument val2 . More... | |
interface | operator(<=) |
Generate and return .true. if the real and imaginary components of the input complex argument val1 are lexicographically less than or equal to the corresponding components of the input complex argument val2 . More... | |
interface | operator(>) |
Generate and return .true. if the real and imaginary components of the input complex argument val1 are lexicographically more than the corresponding components of the input complex argument val2 . More... | |
interface | operator(>=) |
Generate and return .true. if the real and imaginary components of the input complex argument val1 are lexicographically more than or equal to the corresponding components of the input complex argument val2 . More... | |
Variables | |
character(*, SK), parameter | MODULE_NAME = "@pm_complexCompareLex" |
This module contains procedures and generic interfaces for checking if a complex
number is lexicographically comparable to another complex
number of the same kind.
The two components of complex numbers are compared lexically.
For example, (1.,2.) < (1.,1.)
evaluates to .false.
while (1.,2.) < (2.,0.)
evaluates to .true.
.
A lexicographical comparison is the kind of comparison generally used to sort words alphabetically in dictionaries.
It involves comparing sequentially the elements that have the same position in both ranges against each other until one element is not equivalent to the other.
The result of comparing these first non-matching elements is the result of the lexicographical comparison.
Final Remarks ⛓
If you believe this algorithm or its documentation can be improved, we appreciate your contribution and help to edit this page's documentation and source file on GitHub.
For details on the naming abbreviations, see this page.
For details on the naming conventions, see this page.
This software is distributed under the MIT license with additional terms outlined below.
This software is available to the public under a highly permissive license.
Help us justify its continued development and maintenance by acknowledging its benefit to society, distributing it, and contributing to it.
character(*,SK), parameter pm_complexCompareLex::MODULE_NAME = "@pm_complexCompareLex" |
Definition at line 51 of file pm_complexCompareLex.F90.