Name | Modified | Size | Downloads / Week |
---|---|---|---|
Parent folder | |||
README | 2023-07-11 | 1.9 kB | |
hsortci.f | 2023-07-11 | 5.9 kB | |
suppress2.f90 | 2018-05-19 | 2.0 kB | |
suppress1.f90 | 2018-05-19 | 1.8 kB | |
searchlib.tar.gz | 2014-01-29 | 26.3 kB | |
Totals: 5 Items | 38.0 kB | 0 |
The searchlib collection contains a small number of 1-D search and sort utilities, along with some 2- and 3-space structured grid searching tools that are no longer recommended. For mesh searching, see the adt (Alternating Digital Tree) collection elsewhere. For nearest-data point(s) in k-space, see KDTREE elsewhere. asrch3d.f ! Essentially INTERVAL (below) applied to a 3-space curve bsrchr.f ! Binary search through a sorted list of reals hsortcc.f ! Heap sort of a character list and a second integer list hsortci.f ! Heap sort of a character list and a second integer list hsortii.f ! Heap sort of an integer list and a second integer list hsortiind.f ! HSORTII variant that doesn't overwrite the first list hsortri.f ! Heap sort of a list of reals and a second integer list hsortrr.f ! Heap sort of a list of reals and a second real list insertxy.f90 ! Insert (xin, yin) into x(:), y(:) where x(:) is ordered interval.f ! Interpolation search of a real list (ascending|descending) interval_i.f ! Variant of INTERVAL for an integer list merger.f ! Merge 2 real lists (one of which is sorted); uses INTERVAL merger2.f ! Variant of MERGER for pairs of (X, Y) arrays sorted in X ripple2d.f ! Search (1 block of) a 2-space structured grid; see adt ripple2p.f ! Variant of RIPPLE2D for (2,ni,nj) data; see adt ripple3d.f ! Search (1 block of) a 3-spc. structured vol. grid; see adt ripple_surf.f ! Search (1 block of) a 3-spc. structured srf. grid; see adt ssrchr.f ! Sequential search for real number in real list (unsorted?) suppress1.f90 ! Suppress duplicate abscissas from a sorted real array, in place suppress2.f90 ! Companion to SUPPRESS1, treating a related ordinate array too unique_ri.f90 ! Use with HSORTRI if duplicates may be present xsort.f ! Bubble sort analog of HSORTRI; heap sort is preferable