Skip to content

Add files via upload #7699

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
Omartech312 wants to merge 1 commit into from
+44 −7
Closed

Add files via upload #7699

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
51 changes: 44 additions & 7 deletions src/frolladaptive.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -9,72 +9,109 @@
*/
void frolladaptivefun(rollfun_t rfun, unsigned int algo, const double *x, uint64_t nx, ans_t *ans, const int *k, double fill, bool narm, int hasnf, bool verbose) {
double tic = 0;
char rfunStr[7];
if (verbose)
{
//declare string var
tic = omp_get_wtime();
}
switch (rfun) {
case MEAN :
if(verbose)
snprintf(rfunStr, sizeof(rfunStr), "MEAN");
if (algo==0) {
frolladaptivemeanFast(x, nx, ans, k, fill, narm, hasnf, verbose);
} else if (algo==1) {
frolladaptivemeanExact(x, nx, ans, k, fill, narm, hasnf, verbose);
}
break;
case SUM :
if(verbose)
snprintf(rfunStr, sizeof(rfunStr), "SUM");
if (algo==0) {
frolladaptivesumFast(x, nx, ans, k, fill, narm, hasnf, verbose);
} else if (algo==1) {
frolladaptivesumExact(x, nx, ans, k, fill, narm, hasnf, verbose);
}
break;
case MAX :
if(verbose)
snprintf(rfunStr, sizeof(rfunStr), "MAX");
if (algo==0 && verbose) {
//frolladaptivemaxFast(x, nx, ans, k, fill, narm, hasnf, verbose); // frolladaptivemaxFast does not exists as of now
snprintf(end(ans->message[0]), 500, _("%s: algo %u not implemented, fall back to %u\n"), __func__, algo, (unsigned int) 1);
snprintf(end(ans->message[0]), 500, _("%s: algo fast not implemented, fall back to exact\n"), __func__);
algo = 1;
}
frolladaptivemaxExact(x, nx, ans, k, fill, narm, hasnf, verbose);
break;
case MIN :
if(verbose)
snprintf(rfunStr, sizeof(rfunStr), "MIN");
if (algo==0 && verbose) {
//frolladaptiveminFast(x, nx, ans, k, fill, narm, hasnf, verbose); // frolladaptiveminFast does not exists as of now
snprintf(end(ans->message[0]), 500, _("%s: algo %u not implemented, fall back to %u\n"), __func__, algo, (unsigned int) 1);
snprintf(end(ans->message[0]), 500, _("%s: algo fast not implemented, fall back to exact\n"), __func__);
algo = 1;
}
frolladaptiveminExact(x, nx, ans, k, fill, narm, hasnf, verbose);
break;
case PROD :
if(verbose)
snprintf(rfunStr, sizeof(rfunStr), "PROD");
if (algo==0 && verbose) {
//frolladaptiveprodFast(x, nx, ans, k, fill, narm, hasnf, verbose); // frolladaptiveprodFast does not exists as of now
snprintf(end(ans->message[0]), 500, _("%s: algo %u not implemented, fall back to %u\n"), __func__, algo, (unsigned int) 1);
snprintf(end(ans->message[0]), 500, _("%s: algo fast not implemented, fall back to exact\n"), __func__);
algo = 1;
}
frolladaptiveprodExact(x, nx, ans, k, fill, narm, hasnf, verbose);
break;
case MEDIAN :
if(verbose)
snprintf(rfunStr, sizeof(rfunStr), "MEDIAN");
if (algo==0 && verbose) {
//frolladaptivemedianFast(x, nx, ans, k, fill, narm, hasnf, verbose); // frolladaptivemedianFast does not exists as of now
snprintf(end(ans->message[0]), 500, _("%s: algo %u not implemented, fall back to %u\n"), __func__, algo, (unsigned int) 1);
snprintf(end(ans->message[0]), 500, _("%s: algo fast not implemented, fall back to exact\n"), __func__);
algo = 1;
}
frolladaptivemedianExact(x, nx, ans, k, fill, narm, hasnf, verbose);
break;
case VAR :
if(verbose)
snprintf(rfunStr, sizeof(rfunStr), "VAR");
if (algo==0 && verbose) {
//frolladaptivevarFast(x, nx, ans, k, fill, narm, hasnf, verbose); // frolladaptivevarFast does not exists as of now
snprintf(end(ans->message[0]), 500, _("%s: algo %u not implemented, fall back to %u\n"), __func__, algo, (unsigned int) 1);
snprintf(end(ans->message[0]), 500, _("%s: algo fast not implemented, fall back to exact\n"), __func__);
algo = 1;
}
frolladaptivevarExact(x, nx, ans, k, fill, narm, hasnf, verbose);
break;
case SD :
if(verbose)
snprintf(rfunStr, sizeof(rfunStr), "SD");
if (algo==0 && verbose) {
//frolladaptivesdFast(x, nx, ans, k, fill, narm, hasnf, verbose); // frolladaptivesdFast does not exists as of now
snprintf(end(ans->message[0]), 500, _("%s: algo %u not implemented, fall back to %u\n"), __func__, algo, (unsigned int) 1);
snprintf(end(ans->message[0]), 500, _("%s: algo fast not implemented, fall back to exact\n"), __func__);
algo = 1;
}
frolladaptivesdExact(x, nx, ans, k, fill, narm, hasnf, verbose);
break;
default: // # nocov
internal_error(__func__, "Unknown rfun value in frolladaptive: %d", rfun); // # nocov
}
if (verbose)
snprintf(end(ans->message[0]), 500, _("%s: processing fun %d algo %u took %.3fs\n"), __func__, rfun, algo, omp_get_wtime()-tic);
{
//prints final message stating rfun, algo and time.
if(algo==0)
{
snprintf(end(ans->message[0]), 500, _("%s: processing fun %s algo fast took %.3fs\n"), __func__, rfunStr, omp_get_wtime()-tic);
}
else
{
snprintf(end(ans->message[0]), 500, _("%s: processing fun %s algo exact took %.3fs\n"), __func__, rfunStr, omp_get_wtime()-tic);
}
}
}


#undef MEAN_WINDOW_STEP_VALUE
#define MEAN_WINDOW_STEP_VALUE \
if (wn>0) { \
Expand Down
Loading