Generate and return .true. if either components of the input complex argument val1 is equal to the corresponding components of the input complex argument val2. More...

Detailed Description

Generate and return .true. if either components of the input complex argument val1 is equal to the corresponding components of the input complex argument val2.

Parameters

[in]	val1	: The input scalar, or array of the same rank and shape as `val2`, of type `complex` of kind any supported by the processor (e.g., CK, CK32, CK64, or CK128).
[in]	val2	: The input scalar, or array of the same rank and shape as `val1`, of the same type and kind as `val1`.

Returns: compares : The output object of type logical of default kind LK, and the higher rank of the two input arguments val1 and val2.

Possible calling interfaces ⛓

: use pm_complexCompareAny, only: operator(==)

use pm_kind, only: LK

complex(LK) :: compares

compares = val1 == val2

pm_complexCompareAny
This module contains procedures and generic interfaces for checking if either of the corresponding re...
Definition: pm_complexCompareAny.F90:35

pm_kind
This module defines the relevant Fortran kind type-parameters frequently used in the ParaMonte librar...
Definition: pm_kind.F90:268

pm_kind::LK
integer, parameter LK
The default logical kind in the ParaMonte library: kind(.true.) in Fortran, kind(....
Definition: pm_kind.F90:541

Remarks: The procedures under discussion are pure.; The procedures under discussion are elemental.

See also: operator(<)
operator(<=)
operator(.anyeq.)
operator(.anyneq.)
operator(>=)
operator(>)

Example usage ⛓

: 1program example

2

3 use pm_kind, only: SK

4 use pm_kind, only: CK ! All other kinds are also supported.

5 use pm_complexCompareAny, only: operator(.anyeq.)

6 use pm_distUnif, only: setUnifRand

7 use pm_io, only: display_type

8

9 implicit none

10

11 type(display_type) :: disp

12

13 disp = display_type(file = "main.out.F90")

14

15 call disp%skip()

16 call disp%show("!%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%")

17 call disp%show("!%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%")

18 call disp%show("! Verify if any `complex` components follow the relation.")

19 call disp%show("!%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%")

20 call disp%show("!%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%")

21 call disp%skip()

22

23 call disp%show("(+0._CK, +0._CK) .anyeq. (+0._CK, +0._CK)")

24 call disp%show( (+0._CK, +0._CK) .anyeq. (+0._CK, +0._CK) )

25 call disp%skip()

26

27 call disp%show("(+0._CK, +0._CK) .anyeq. (+1._CK, +0._CK)")

28 call disp%show( (+0._CK, +0._CK) .anyeq. (+1._CK, +0._CK) )

29 call disp%skip()

30

31 call disp%show("(+0._CK, +0._CK) .anyeq. (+0._CK, +1._CK)")

32 call disp%show( (+0._CK, +0._CK) .anyeq. (+0._CK, +1._CK) )

33 call disp%skip()

34

35 call disp%show("(+0._CK, +0._CK) .anyeq. (-1._CK, +0._CK)")

36 call disp%show( (+0._CK, +0._CK) .anyeq. (-1._CK, +0._CK) )

37 call disp%skip()

38

39 call disp%show("(+0._CK, +0._CK) .anyeq. (+0._CK, -1._CK)")

40 call disp%show( (+0._CK, +0._CK) .anyeq. (+0._CK, -1._CK) )

41 call disp%skip()

42

43 call disp%show("(+0._CK, +0._CK) .anyeq. (+1._CK, -1._CK)")

44 call disp%show( (+0._CK, +0._CK) .anyeq. (+1._CK, -1._CK) )

45 call disp%skip()

46

47 call disp%show("(+0._CK, +0._CK) .anyeq. (-1._CK, +1._CK)")

48 call disp%show( (+0._CK, +0._CK) .anyeq. (-1._CK, +1._CK) )

49 call disp%skip()

50

51 call disp%show("(+0._CK, +0._CK) .anyeq. (+1._CK, +1._CK)")

52 call disp%show( (+0._CK, +0._CK) .anyeq. (+1._CK, +1._CK) )

53 call disp%skip()

54

55 call disp%show("(+0._CK, +0._CK) .anyeq. [(+0._CK, +0._CK), (+1._CK, +0._CK), (+0._CK, +1._CK), (-1._CK, +0._CK), (+1._CK, -1._CK), (-1._CK, +1._CK), (-1._CK, -1._CK), (+1._CK, +1._CK)]")

56 call disp%show( (+0._CK, +0._CK) .anyeq. [(+0._CK, +0._CK), (+1._CK, +0._CK), (+0._CK, +1._CK), (-1._CK, +0._CK), (+1._CK, -1._CK), (-1._CK, +1._CK), (-1._CK, -1._CK), (+1._CK, +1._CK)] )

57 call disp%skip()

58

59end program example

pm_distUnif::setUnifRand
Return a uniform random scalar or contiguous array of arbitrary rank of randomly uniformly distribute...
Definition: pm_distUnif.F90:11083

pm_io::show
This is a generic method of the derived type display_type with pass attribute.
Definition: pm_io.F90:11726

pm_io::skip
This is a generic method of the derived type display_type with pass attribute.
Definition: pm_io.F90:11508

pm_distUnif
This module contains classes and procedures for computing various statistical quantities related to t...
Definition: pm_distUnif.F90:274

pm_io
This module contains classes and procedures for input/output (IO) or generic display operations on st...
Definition: pm_io.F90:252

pm_io::disp
type(display_type) disp
This is a scalar module variable an object of type display_type for general display.
Definition: pm_io.F90:11393

pm_kind::CK
integer, parameter CK
The default complex kind in the ParaMonte library: real64 in Fortran, c_double_complex in C-Fortran I...
Definition: pm_kind.F90:542

pm_kind::SK
integer, parameter SK
The default character kind in the ParaMonte library: kind("a") in Fortran, c_char in C-Fortran Intero...
Definition: pm_kind.F90:539

pm_io::display_type
Generate and return an object of type display_type.
Definition: pm_io.F90:10282

Example Unix compile command via Intel ifort compiler ⛓
1#!/usr/bin/env sh

2rm main.exe

3ifort -fpp -standard-semantics -O3 -Wl,-rpath,../../../lib -I../../../inc main.F90 ../../../lib/libparamonte* -o main.exe

4./main.exe

Example Windows Batch compile command via Intel ifort compiler ⛓
1del main.exe

2set PATH=..\..\..\lib;%PATH%

3ifort /fpp /standard-semantics /O3 /I:..\..\..\include main.F90 ..\..\..\lib\libparamonte*.lib /exe:main.exe

4main.exe

Example Unix / MinGW compile command via GNU gfortran compiler ⛓
1#!/usr/bin/env sh

2rm main.exe

3gfortran -cpp -ffree-line-length-none -O3 -Wl,-rpath,../../../lib -I../../../inc main.F90 ../../../lib/libparamonte* -o main.exe

4./main.exe

Example output ⛓
1

2!%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

3!%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

4! Verify if any `complex` components follow the relation.

5!%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

6!%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

7

8(+0._CK, +0._CK) .anyeq. (+0._CK, +0._CK)

9T

10

11(+0._CK, +0._CK) .anyeq. (+1._CK, +0._CK)

12T

13

14(+0._CK, +0._CK) .anyeq. (+0._CK, +1._CK)

15T

16

17(+0._CK, +0._CK) .anyeq. (-1._CK, +0._CK)

18T

19

20(+0._CK, +0._CK) .anyeq. (+0._CK, -1._CK)

21T

22

23(+0._CK, +0._CK) .anyeq. (+1._CK, -1._CK)

24F

25

26(+0._CK, +0._CK) .anyeq. (-1._CK, +1._CK)

27F

28

29(+0._CK, +0._CK) .anyeq. (+1._CK, +1._CK)

30F

31

32(+0._CK, +0._CK) .anyeq. [(+0._CK, +0._CK), (+1._CK, +0._CK), (+0._CK, +1._CK), (-1._CK, +0._CK), (+1._CK, -1._CK), (-1._CK, +1._CK), (-1._CK, -1._CK), (+1._CK, +1._CK)]

33T, T, T, T, F, F, F, F

34

35

Test:: test_pm_complexCompareAny

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.

If you use any parts or concepts from this library to any extent, please acknowledge the usage by citing the relevant publications of the ParaMonte library.
If you regenerate any parts/ideas from this library in a programming environment other than those currently supported by this ParaMonte library (i.e., other than C, C++, Fortran, MATLAB, Python, R), please also ask the end users to cite this original ParaMonte library.

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.

Copyright: Computational Data Science Lab

Author:: Amir Shahmoradi, September 1, 2017, 12:00 AM, Institute for Computational Engineering and Sciences (ICES), The University of Texas Austin

Definition at line 317 of file pm_complexCompareAny.F90.

The documentation for this interface was generated from the following file:

src/fortran/main/pm_complexCompareAny.F90