sort Interface

  1. m_sort.f90
  2. m_sort
  3. sort

public interface sort

Use an in-place introspection sort on an array of numbers

Example usage

program sortTest
use variableKind, only: i32, r64
use m_strings, only: str
use m_allocate, only: allocate
use m_random, only: rngInteger, rngNormal
use m_arrays, only: arange, isSorted
use m_sort, only: sort
real(r64),allocatable :: d1D(:)
integer(i32),allocatable :: i1D(:)
integer(i32) :: N

N = 10000
write(*,'(a)') 'In-place sort a 10000 length array of random double precision numbers'
call allocate(d1D,N)
call rngNormal(d1D)
call sort(d1D)
write(*,'(a)') 'Double array is sorted? '//str(isSorted(d1D))
write(*,'(a)') 'In-place sort a 10000 length array of random integers''
call allocate(i1D,N)
call rngInteger(i1D)
call sort(i1D)
write(*,'(a)') 'Integer array is sorted? '//str(isSorted(i1D))
end program

Called By

interface~~sort~~CalledByGraph interface~sort sort program~scaletest_coretran scaleTest_coretran program~scaletest_coretran->interface~sort proc~sorting_test sorting_test proc~sorting_test->interface~sort proc~select_test select_test proc~select_test->interface~sort program~test_coretran test_coretran program~test_coretran->proc~sorting_test program~test_coretran->proc~select_test
Help

Subroutines


Subroutines

public subroutine sort_i1D(this, stable)

Interfaced with sort

Arguments

Type IntentOptional AttributesName
integer(kind=i32) :: this(:)
logical, optional :: stable

public subroutine sort_id1D(this, stable)

Interfaced with sort

Arguments

Type IntentOptional AttributesName
integer(kind=i64) :: this(:)
logical, optional :: stable

public subroutine sort_r1D(this, stable)

Interfaced with sort

Arguments

Type IntentOptional AttributesName
real(kind=r32) :: this(:)
logical, optional :: stable

public subroutine sort_d1D(this, stable)

Interfaced with sort

Arguments

Type IntentOptional AttributesName
real(kind=r64) :: this(:)
logical, optional :: stable

All Procedures

allocate allocate_test appendString arange argInsertionsort argMedianOf3 argPartition argSelect argSort array1D_test binarySearch checkIsOpen closeFile compact compare compare_d1 copy copy_test countEntries crossproduct cumprod cumsum dArgDynamicArray dArgDynamicArray_test daysInMonth daysInYear dDynamicArray dDynamicArray_test deallocate debug debug_s deleteFile diff eMsg fastTwoDiff fastTwoSum fErr fileExists fileIO_test geometricMean getExtension getFileSize getNFileLines getRandomSeed hasExtension hasNentries iachar1D iArgDynamicArray iArgDynamicArray_test idArgDynamicArray idArgDynamicArray_test idDynamicArray idDynamicArray_test iDynamicArray iDynamicArray_test ind2sub indexing_test insertionsort integerBin intervalSearch isLeapYear isOpen isSorted isString KdTree KdTree_test lowerCase maths_test mean median medianOf3 mErr msg norm1 normI openBinaryFile openFile partition partition3way partition3way_d1D prependString Prng Prng_test ProgressBar project random_test rArgDynamicArray rArgDynamicArray_test rDynamicArray rDynamicArray_test read1Dble read1Integer readline readline reallocate reallocate_test removeComments repeat replacedelim rngExponential rngExponential_d1 rngExponential_d1D rngExponential_d2D rngExponential_d3D rngExponential_unscaled_d1 rngInteger rngInteger_i1 rngInteger_i1D rngInteger_i2D rngInteger_i3D rngNormal rngNormal_d1 rngNormal_d1D rngNormal_d2D rngNormal_d3D rngUniform rngUniform_d1 rngUniform_d1D rngUniform_d2D rngUniform_d3D rngUniform_xorshift rngWeibull rngWeibull_d1 rngWeibull_d1D rngWeibull_d2D rngWeibull_d3D secondsToHMS select select_test setPrng setPrng_withSeed setPrng_WOseed shuffle simpleSearch skipFileLines sort sorting_test std str strings_test sub2ind swap test tester time_test timeInSeconds timeToInteger trimExtension trimmedmean twoDiff twoSum upperCase variance wMsg writeline