You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
74 lines
2.1 KiB
74 lines
2.1 KiB
2 years ago
|
/*
|
||
|
|
* Copyright(C) 1999-2020 National Technology & Engineering Solutions
|
||
|
|
* of Sandia, LLC (NTESS). Under the terms of Contract DE-NA0003525 with
|
||
|
|
* NTESS, the U.S. Government retains certain rights in this software.
|
||
|
|
*
|
||
|
|
* See packages/seacas/LICENSE for details
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include "structs.h" // for scanlink
|
||
|
|
#include <stdio.h> // for NULL
|
||
|
|
|
||
|
|
/* Return minimum of vector over range */
|
||
|
|
void scanmin(double *vec, /* vector to scan */
|
||
|
|
int beg, int end, /* index range */
|
||
|
|
struct scanlink **scanlist /* pntr to list holding results of scan */
|
||
|
|
)
|
||
|
|
{
|
||
|
|
extern double DOUBLE_MAX;
|
||
|
|
struct scanlink *top;
|
||
|
|
struct scanlink *curlnk;
|
||
|
|
struct scanlink *prevlnk;
|
||
|
|
double val;
|
||
|
|
int i;
|
||
|
|
|
||
|
|
curlnk = *scanlist;
|
||
|
|
while (curlnk != NULL) {
|
||
|
|
curlnk->indx = 0;
|
||
|
|
curlnk->val = DOUBLE_MAX;
|
||
|
|
curlnk = curlnk->pntr;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Note: Uses current top link (which would need to be deleted anyway) each time
|
||
|
|
an insertion to the list is required. */
|
||
|
|
|
||
|
|
for (i = beg; i <= end; i++) {
|
||
|
|
/* consider each element for insertion */
|
||
|
|
top = *scanlist;
|
||
|
|
val = vec[i];
|
||
|
|
if (val < top->val) {
|
||
|
|
if (top->pntr == NULL) {
|
||
|
|
/* the list is only one long, so just replace */
|
||
|
|
top->val = val;
|
||
|
|
top->indx = i;
|
||
|
|
}
|
||
|
|
else {
|
||
|
|
/* beats top element; scan for insertion point */
|
||
|
|
if (val < (top->pntr)->val) {
|
||
|
|
/* 2nd link becomes list pntr; otherwise stays same */
|
||
|
|
*scanlist = top->pntr;
|
||
|
|
}
|
||
|
|
prevlnk = curlnk = top;
|
||
|
|
while ((val < curlnk->val) && (curlnk->pntr != NULL)) {
|
||
|
|
prevlnk = curlnk;
|
||
|
|
curlnk = curlnk->pntr;
|
||
|
|
}
|
||
|
|
if (val < curlnk->val) {
|
||
|
|
/* got to end of list; add top to bottom */
|
||
|
|
curlnk->pntr = top;
|
||
|
|
top->val = val;
|
||
|
|
top->indx = i;
|
||
|
|
top->pntr = NULL;
|
||
|
|
}
|
||
|
|
else {
|
||
|
|
/* stopped within list; insert top here */
|
||
|
|
prevlnk->pntr = top;
|
||
|
|
top->val = val;
|
||
|
|
top->indx = i;
|
||
|
|
top->pntr = curlnk;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|