binarySearch Interface

  1. m_searching.f90
  2. m_searching
  3. binarySearch

public interface binarySearch

Perform a binary search. See m_searching for more information on how to use this interface


Functions


Functions

public recursive function binarySearch_i1D(this, v, imin, imax) result(iout)

Search for the value i in an integer vector Assumes this is sorted!

Arguments

Type IntentOptional AttributesName
integer(kind=i32) :: this(:)

Vector to search within
integer(kind=i32) :: v

Number to find in the vector
integer(kind=i32) :: imin

Left integer
integer(kind=i32) :: imax

Right integer

Return Value integer(kind=i32)

Location of i in this. Returns -1 if not present

public recursive function binarySearch_id1D(this, v, imin, imax) result(iout)

Search for the value i in an integer vector Assumes this is sorted!

Arguments

Type IntentOptional AttributesName
integer(kind=i64) :: this(:)

Vector to search within
integer(kind=i64) :: v

Number to find in the vector
integer(kind=i32) :: imin

Left integer
integer(kind=i32) :: imax

Right integer

Return Value integer(kind=i32)

Location of i in this. Returns -1 if not present

public recursive function binarySearch_r1D(this, v, imin, imax) result(iout)

Search for the value i in an integer vector Assumes this is sorted!

Arguments

Type IntentOptional AttributesName
real(kind=r32) :: this(:)

Vector to search within
real(kind=r32) :: v

Number to find in the vector
integer(kind=i32) :: imin

Left integer
integer(kind=i32) :: imax

Right integer

Return Value integer(kind=i32)

Location of i in this. Returns -1 if not present

public recursive function binarySearch_d1D(this, v, imin, imax) result(iout)

Search for the value i in an integer vector Assumes this is sorted!

Arguments

Type IntentOptional AttributesName
real(kind=r64) :: this(:)

Vector to search within
real(kind=r64) :: v

Number to find in the vector
integer(kind=i32) :: imin

Left integer
integer(kind=i32) :: imax

Right integer

Return Value integer(kind=i32)

Location of i in this. Returns -1 if not present

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