The long-term asshole on this NG is the abysmal idiot
called the DooFuS.

Recently, this arrogant schmuck posted some drivel on
the C programming group comp.lang.c.

Oh my fucking god! One has to check this shit out to
even believe that it is possible.

The DooFuS wants to read a text file to determine its
length and then rewind and process from the beginning.

Holy godzilla mutherfuckers!

Hasn't this infinite idiot ever heard of GNU flex?

Even a C newbie would seriously consider pre-processing
the input file to get it into proper shape. But not
this insuperable dunce.

Ha, ha, ha, ha! I cannot even laugh for the inanity
of it all!

The moral of this utter joke, however, is blazingly
clear.

Any moron so totally inept in programming cannot ever
be admitted into a serious discussion of GNU/Linux.

IOW, let the DooFuS take his pathetic assessments to the
kindergarten for retards where they belong.

The DooFuS proves his own interminable stupidity.

The case is forever closed.

Lester Thorpe <lt@gnu.rocks> wrote at 21:15 this Friday (GMT):
> The long-term asshole on this NG is the abysmal idiot
> called the DooFuS.
>
> Recently, this arrogant schmuck posted some drivel on
> the C programming group comp.lang.c.
>
> Oh my fucking god! One has to check this shit out to
> even believe that it is possible.
>
> The DooFuS wants to read a text file to determine its
> length and then rewind and process from the beginning.
>
> Holy godzilla mutherfuckers!
>
> Hasn't this infinite idiot ever heard of GNU flex?
>
> Even a C newbie would seriously consider pre-processing
> the input file to get it into proper shape. But not
> this insuperable dunce.
>
> Ha, ha, ha, ha! I cannot even laugh for the inanity
> of it all!
>
> The moral of this utter joke, however, is blazingly
> clear.
>
> Any moron so totally inept in programming cannot ever
> be admitted into a serious discussion of GNU/Linux.
>
> IOW, let the DooFuS take his pathetic assessments to the
> kindergarten for retards where they belong.
>
> The DooFuS proves his own interminable stupidity.
>
> The case is forever closed.

Well, they could be trying to process an arbitrary file.
Also, I haven't really heard of GNU Flex, but if it's so useful, I might
try and learn it.
--
user <candycane> is generated from /dev/urandom

On Sat, 13 Jul 2024 14:10:03 -0000 (UTC), candycanearter07 wrote:

> Well, they could be trying to process an arbitrary file.
> Also, I haven't really heard of GNU Flex, but if it's so useful, I might
> try and learn it.

Careful. Start messing with flex and you might wind up dealing with
large, hairy bison.

On Sat, 13 Jul 2024 14:10:03 -0000 (UTC), candycanearter07 wrote:

>
> Well, they could be trying to process an arbitrary file.
>

Nope. If you read the idiotic DooFuS posts the imbecile wants
to read space separated (i.e. no LF) integers.

Only the retarded DooFuS could have produced such an inane
storage format.

But regardless, flex can rip through it in one pass. The fact
that the DooFuS missed that absolutely elementary point only
solidifies his reputation as a moronic programming dilettante.

Of course, the overall message is that the DooFuS, who advocates
Microslop, is continually shown to be digitally incompetent and
thus his opinions are utterly and totally worthless.

>
> Also, I haven't really heard of GNU Flex, but if it's so useful, I might
> try and learn it.
>

(F)lex has been around since the very beginning of programming.
Why have you not heard of it?

Most "programmers" today are not actually programmers.

On 13 Jul 2024 18:09:58 GMT, rbowman wrote:

>
> Careful. Start messing with flex and you might wind up dealing with
> large, hairy bison.
>

STFU blowman.

Why don't you regale us with your champion bison ropings at the rodeo.

After all, you've been everywhere and seen and done everything.

Ha, ha, ha, ha, ha, ha, ha, ha, ha, ha, ha, ha!

Fucking grandiose moron.

On 7/12/2024 5:15 PM, Lameass Larry Piet wrote:

> The DooFuS wants to read a text file to determine its
> length and then rewind and process from the beginning.

wtf are you babbling about now, numbnut?

You might be referring to my clc post 'Whaddaya think?'

But it's clear you didn't understand it. I wasn't concerned with the
'length of the file' (whatever that means). I was counting the number
of data points in the file so I could allocate memory, then rewind the
file and read them in.

idiot

> Holy godzilla mutherfuckers!
>
> Hasn't this infinite idiot ever heard of GNU flex?

Why tf would anyone EVER waste their time and use such GuhNoo crapware
just to read a set of numbers from a file? It's a few lines of simple code.

AND, even though my original file format is integers separated by spaces
(shown for compactness in the post), my code works unchanged if they're
separated by line-feeds.

double idiot

> Even a C newbie would seriously consider pre-processing
> the input file to get it into proper shape. But not
> this insuperable dunce.

Who needs to "pre-process" a set of integers?

triple idiot

> Any moron so totally inept in programming cannot ever
> be admitted into a serious discussion of GNU/Linux.

You labeled this double-time shit-code of yours "wonderfully perfect and
highly efficient":

/* free all strarray elements */
for(i = 0; i < rec_count; i++) {
free(data[i]->field1);
free(data[i]->field2);
free(data[i]->field3);
free(data[i]);
i++;
}

Who are you to talk about 'inept programming', asshole? You were
clearly having another one of your "C Programmer Extraordinaire" moments.

http://al.howardknight.net/?STYPE=msgid&MSGI=%3Crnelct0tjg%40news3.newsguy.com%3E

Here's the full population descriptive stats program (of which the file
import is an option).

It's very entertaining.

compile
$ gcc -Wall prog.c -o prog -lm

use
$ ./prog -option N|F
where option is:
-r generates N random numbers
-c generates consecutive numbers 1 to N
-o generates random numbers with outliers
-f read in dataset from file
N is 2+, or F is the file containing the integers

===================================================================
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <time.h>
int randNbr(int low, int high) {
    return (low + rand() / (RAND_MAX / (high - low + 1) + 1));
} int compareint (const void * a, const void * b)
{ if (*(int*)a > *(int*)b) return 1;
else if (*(int*)a < *(int*)b) return -1;
else return 0;
} int main(int argc, char *argv[])
{     if(argc < 3) {
printf("Missing argument:\n");
printf(" * enter an option -r -c -o or -f\n");
printf(" * enter a number greater than 2, or a file name\n");
exit(0);
    }
    int i = 0,N = 0;
    int *nums;
    if(strcmp(argv[1],"-f") != 0) {
N = atoi(argv[2]);
nums = malloc(N * sizeof(int));
    }
    if(strcmp(argv[1],"-r") == 0) {
srand(time(NULL));
for(i=0;i<N;i++) { nums[i] = randNbr(1,N*3); }

printf("%d Randoms between 1 and %d\n", N, 3*N);
printf("No commas : "); for(i=0;i<N;i++) { printf("%d ",
nums[i]); }
printf("\nWith commas: "); for(i=0;i<N;i++) { printf("%d,",
nums[i]); }
qsort(nums,N,sizeof(int),compareint);
printf("\nSorted : "); for(i=0;i<N;i++) { printf("%d ",
nums[i]); }
printf("\nSorted : "); for(i=0;i<N;i++) { printf("%d,",
nums[i]); }
    }
    if(strcmp(argv[1],"-o") == 0) {
srand(time(NULL));
nums[0] = 1; nums[1] = 3;
for(i=2;i<N-2;i++) { nums[i] = randNbr(100,N*30); }
nums[N-2] = 1000; nums[N-1] = 2000;

printf("%d Randoms with outliers\n", N);
printf("No commas : "); for(i=0;i<N;i++) { printf("%d ",
nums[i]); }
printf("\nWith commas: "); for(i=0;i<N;i++) { printf("%d,",
nums[i]); }
qsort(nums,N,sizeof(int),compareint);
printf("\nSorted : "); for(i=0;i<N;i++) { printf("%d ",
nums[i]); }
printf("\nSorted : "); for(i=0;i<N;i++) { printf("%d,",
nums[i]); }
    }
    if(strcmp(argv[1],"-c") == 0) {
for(i=0;i<N;i++) { nums[i] = i + 1; }

printf("%d Consecutive\n", N);
printf("No commas : "); for(i=0;i<N;i++) { printf("%d ",
nums[i]); }
printf("\nWith commas : "); for(i=0;i<N;i++) { printf("%d,",
nums[i]); }
    }
    if(strcmp(argv[1],"-f") == 0) {
nums = malloc(2 * sizeof(int));
FILE* datafile = fopen(argv[2], "r");
while(fscanf(datafile, "%d", &nums[N++]) == 1){
nums = realloc(nums, (N+1) * sizeof(int));
}
fclose (datafile);
N--;
printf("%d from file", N);
printf(" : "); for(i=0;i<N;i++) { printf("%d ", nums[i]); }
qsort(nums,N,sizeof(int),compareint);
printf("\nNo commas : "); for(i=0;i<N;i++) { printf("%d ",
nums[i]); }
printf("\nWith commas : "); for(i=0;i<N;i++) { printf("%d,",
nums[i]); }

    }
    double dmin = nums[0], dmax = nums[N-1];
    double sumN=0.0, median=0.0, Q1=0.0, Q2=0.0, Q3=0.0, IQR=0.0;
    double sqrdiffmean = 0.0, cubediffmean = 0.0, quaddiffmean = 0.0;
    double meanabsdev = 0.0, rootmeansqr = 0.0;
    char temp[15]="";
    for(i=0;i<N;i++) {sumN += nums[i];}
    double mean = sumN / (double)N;
    for(i = 0; i < N; i++)
    {
double diff = nums[i] - mean;
sqrdiffmean += diff * diff;
cubediffmean += diff * diff * diff;
quaddiffmean += diff * diff * diff * diff;
meanabsdev += fabs(diff);
rootmeansqr += nums[i] * nums[i];
    }
    double stddev = sqrt(sqrdiffmean/N);
    double kurtosis = quaddiffmean / (N * pow(sqrt(sqrdiffmean/N),4));
    if(N % 2 == 0) {
Q2 = median = (nums[(N/2)-1] + nums[N/2]) / 2.0;
i = N/2;
if(i % 2 == 0) {
Q1 = (nums[(i/2)-1] + nums[i/2]) / 2.0;
Q3 = (nums[i + ((i-1)/2)] + nums[i+(i/2)]) / 2.0;
}
else {
Q1 = nums[(i-1)/2];
Q3 = nums[i + ((i-1)/2)];
}
    }
    if(N % 2 != 0) {
Q2 = median = nums[(N-1)/2];
i = (N-1)/2;
if(i % 2 == 0) {
Q1 = (nums[(i/2)-1] + nums[i/2]) / 2.0;
Q3 = (nums[i + (i/2)] + nums[i + (i/2) + 1]) / 2.0;
}
else {
Q1 = nums[(i-1)/2];
Q3 = nums[i + ((i+1)/2)];
}
    }
    int occur = 0;
    char mode[250] = "";
    if(strcmp(argv[2],"-c") != 0) {
int *modecnt = calloc(dmax + 1, sizeof(int));
for(i = 0; i < N; i++) {
modecnt[nums[i]]++;
if(modecnt[nums[i]] > occur) {
occur = modecnt[nums[i]];
}
}
if (occur > 1) {
for(i = 0; i <= dmax; i++) {
if(modecnt[i] == occur) {
sprintf(temp,"%d ",i);
strncat(mode,temp,strlen(temp));
}
}
}
free(modecnt);
    }
    IQR = Q3 - Q1;
    char outliers[200]="";
    if (N > 3) {
double lo = Q1 - (1.5 * IQR);
double hi = Q3 + (1.5 * IQR);
if (dmin >= lo && dmax <= hi) {
strcat(outliers,"none (using IQR * 1.5 rule)");
}
if (dmin < lo || dmax > hi) {
for(i = 0; i < N; i++) {
double val = (double)nums[i];
if(val < lo || val > hi) {
sprintf(temp,"%.0f ",val);
printf("%d\n",(int)strlen(temp));
strncat(outliers, temp, strlen(temp));
}
}
strcat(outliers," (using IQR * 1.5 rule)");
}
outliers[strlen(outliers)] = '\0';
    }
    printf("\n--------------------------------------------------------------\n");
    printf("Minimum : %.0f\n", dmin);
    printf("Maximum : %.0f\n", dmax);
    printf("Range : %.0f\n", dmax - dmin);
    printf("Size N : %d\n" , N);
    printf("Sum N : %.0f\n", sumN);
    printf("Mean μ : %.2f\n", mean);
    printf("Median : %.1f\n", median);
    if(occur > 1) {
    printf("Mode(s) : %s (%d occurrences ea)\n", mode,occur);}
    else {
    printf("Mode(s) : na (no repeating values)\n");}
    printf("Std Dev σ : %.6f\n", stddev);
    printf("Variance σ^2 : %.6f\n", sqrdiffmean/N);
    printf("Mid Range : %.1f\n", (dmax + dmin)/2);
    printf("Quartiles");
    if(N > 3) {printf(" Q1: %.1f\n", Q1);}
    if(N < 4) {printf(" Q1: na\n");}
    printf(" Q2: %.1f (median)\n", Q2);
    if(N > 3) {printf(" Q3: %.1f\n", Q3);}
    if(N < 4) {printf(" Q3: na\n");}
    printf("IQR : %.1f (interquartile range)\n", IQR);
    if(N > 3) {printf("Outliers : %s\n", outliers);}
    if(N < 4) {printf("Outliers : na\n");}
    printf("Sum Squares SS : %.6f\n", sqrdiffmean);
    printf("MAD : %.6f (mean absolute deviation)\n",
meanabsdev / N);
    printf("Root Mean Sqr : %.6f\n", sqrt(rootmeansqr / N));
    printf("Std Error Mean : %.6f\n", stddev / sqrt(N));
    printf("Skewness γ1 : %.6f\n", cubediffmean / (N *
pow(sqrt(sqrdiffmean/N),3)));
    printf("Kurtosis β2 : %.6f\n", kurtosis);
    printf("Kurtosis Excess α4 : %.6f\n", kurtosis - 3);
    printf("CV : %.8f (coefficient of variation\n",
sqrt(sqrdiffmean/N) / mean);
    printf("RSD : %.6f%% (relative std deviation)\n",
100 * (sqrt(sqrdiffmean/N) / mean));
    printf("--------------------------------------------------------------\n");
    printf("Check results up to N=9999 against\n");
    printf("https://www.calculatorsoup.com/calculators/statistics/descriptivestatistics.php");
    printf("\n\n");
    free(nums);
    return 0;
}
Click here to read the complete article

Le 13-07-2024, DFS <nospam@dfs.com> a écrit :
>
> for(i = 0; i < rec_count; i++) {
> [/SNIP/]
> i++;
> }

That's a great one. Thanks for having pointed it.

--
Si vous avez du temps à perdre :
https://scarpet42.gitlab.io

rbowman wrote this copyrighted missive and expects royalties:

> On Sat, 13 Jul 2024 14:10:03 -0000 (UTC), candycanearter07 wrote:
>
>> Well, they could be trying to process an arbitrary file.
>> Also, I haven't really heard of GNU Flex, but if it's so useful, I might
>> try and learn it.
>
> Careful. Start messing with flex and you might wind up dealing with
> large, hairy bison.

I cloned a small MIDI-to-text project (something like midiconvert, IIRC) that
used flex, and greatly extended it, adding a C++ version. Flex is painful.
If I ever work on that app again, I'll write the parsers from scratch; I've
already got a lot code in another couple projects that parses the files.

--
You will remember something that you should not have forgotten.

On Sun, 14 Jul 2024 08:12:38 -0400, Chris Ahlstrom wrote:

>
> I cloned a small MIDI-to-text project (something like midiconvert, IIRC) that
> used flex,
>

?????????????

Flex is a lexer that operates on text data. A MIDI file contains binary
data.

I use these fine MIDI conversion tools:

https://www.fourmilab.ch/webtools/midicsv/

https://github.com/MarquisdeGeek/midilib

Neither of them uses flex.

But MIDI 2.0 has been out for a while already and I have seen
no FOSS programs that support it.

Lester Thorpe

SystemD: solves all the problems that you didn't know you had.

Chris Ahlstrom <OFeem1987@teleworm.us> wrote at 12:12 this Sunday (GMT):
> rbowman wrote this copyrighted missive and expects royalties:
>
>> On Sat, 13 Jul 2024 14:10:03 -0000 (UTC), candycanearter07 wrote:
>>
>>> Well, they could be trying to process an arbitrary file.
>>> Also, I haven't really heard of GNU Flex, but if it's so useful, I might
>>> try and learn it.
>>
>> Careful. Start messing with flex and you might wind up dealing with
>> large, hairy bison.
>
> I cloned a small MIDI-to-text project (something like midiconvert, IIRC) that
> used flex, and greatly extended it, adding a C++ version. Flex is painful.
> If I ever work on that app again, I'll write the parsers from scratch; I've
> already got a lot code in another couple projects that parses the files.

Interesting.. I'll keep that in mind.
--
user <candycane> is generated from /dev/urandom

DFS <nospam@dfs.com> wrote at 21:29 this Saturday (GMT):
> On 7/12/2024 5:15 PM, Lameass Larry Piet wrote:
>
>
>> The DooFuS wants to read a text file to determine its
>> length and then rewind and process from the beginning.
>
>
> wtf are you babbling about now, numbnut?
>
> You might be referring to my clc post 'Whaddaya think?'
>
> But it's clear you didn't understand it. I wasn't concerned with the
> 'length of the file' (whatever that means). I was counting the number
> of data points in the file so I could allocate memory, then rewind the
> file and read them in.
>
>
> idiot

Ohh

>> Holy godzilla mutherfuckers!
>>
>> Hasn't this infinite idiot ever heard of GNU flex?
>
> Why tf would anyone EVER waste their time and use such GuhNoo crapware
> just to read a set of numbers from a file? It's a few lines of simple code.
>
> AND, even though my original file format is integers separated by spaces
> (shown for compactness in the post), my code works unchanged if they're
> separated by line-feeds.
>
>
> double idiot

Does it work if the numbers are separated by alphabet chars?

>> Even a C newbie would seriously consider pre-processing
>> the input file to get it into proper shape. But not
>> this insuperable dunce.
>
> Who needs to "pre-process" a set of integers?
>
> triple idiot

How would you even pre-process that?

>> Any moron so totally inept in programming cannot ever
>> be admitted into a serious discussion of GNU/Linux.
>
> You labeled this double-time shit-code of yours "wonderfully perfect and
> highly efficient":
>
>
> /* free all strarray elements */
> for(i = 0; i < rec_count; i++) {
> free(data[i]->field1);
> free(data[i]->field2);
> free(data[i]->field3);
> free(data[i]);
> i++;
> }

To be fair, it is a fine way to free data structures like that. I know
I've used something like this before.

> Who are you to talk about 'inept programming', asshole? You were
> clearly having another one of your "C Programmer Extraordinaire" moments.
>
> http://al.howardknight.net/?STYPE=msgid&MSGI=%3Crnelct0tjg%40news3.newsguy.com%3E
>
>
>
>
>
> Here's the full population descriptive stats program (of which the file
> import is an option).
>
> It's very entertaining.
>
> compile
> $ gcc -Wall prog.c -o prog -lm
>
> use
> $ ./prog -option N|F
> where option is:
> -r generates N random numbers
> -c generates consecutive numbers 1 to N
> -o generates random numbers with outliers
> -f read in dataset from file
> N is 2+, or F is the file containing the integers
>
>===================================================================
> #include <stdlib.h>
> #include <stdio.h>
> #include <math.h>
> #include <string.h>
> #include <time.h>
> int randNbr(int low, int high) {
>     return (low + rand() / (RAND_MAX / (high - low + 1) + 1));
> }
> int compareint (const void * a, const void * b)
> {
> if (*(int*)a > *(int*)b) return 1;
> else if (*(int*)a < *(int*)b) return -1;
> else return 0;
> }

Why aren't you just using int pointer arguments here?

> int main(int argc, char *argv[])
> {
>     if(argc < 3) {
> printf("Missing argument:\n");
> printf(" * enter an option -r -c -o or -f\n");
> printf(" * enter a number greater than 2, or a file name\n");
> exit(0);
>     }
>     int i = 0,N = 0;
>     int *nums;
>     if(strcmp(argv[1],"-f") != 0) {
> N = atoi(argv[2]);
> nums = malloc(N * sizeof(int));
>     }
>     if(strcmp(argv[1],"-r") == 0) {
> srand(time(NULL));
> for(i=0;i<N;i++) { nums[i] = randNbr(1,N*3); }
>
> printf("%d Randoms between 1 and %d\n", N, 3*N);
> printf("No commas : "); for(i=0;i<N;i++) { printf("%d ",
> nums[i]); }
> printf("\nWith commas: "); for(i=0;i<N;i++) { printf("%d,",
> nums[i]); }
> qsort(nums,N,sizeof(int),compareint);
> printf("\nSorted : "); for(i=0;i<N;i++) { printf("%d ",
> nums[i]); }
> printf("\nSorted : "); for(i=0;i<N;i++) { printf("%d,",
> nums[i]); }
>     }
>     if(strcmp(argv[1],"-o") == 0) {
> srand(time(NULL));
> nums[0] = 1; nums[1] = 3;
> for(i=2;i<N-2;i++) { nums[i] = randNbr(100,N*30); }
> nums[N-2] = 1000; nums[N-1] = 2000;
>
> printf("%d Randoms with outliers\n", N);
> printf("No commas : "); for(i=0;i<N;i++) { printf("%d ",
> nums[i]); }
> printf("\nWith commas: "); for(i=0;i<N;i++) { printf("%d,",
> nums[i]); }
> qsort(nums,N,sizeof(int),compareint);
> printf("\nSorted : "); for(i=0;i<N;i++) { printf("%d ",
> nums[i]); }
> printf("\nSorted : "); for(i=0;i<N;i++) { printf("%d,",
> nums[i]); }
>     }
>     if(strcmp(argv[1],"-c") == 0) {
> for(i=0;i<N;i++) { nums[i] = i + 1; }
>
> printf("%d Consecutive\n", N);
> printf("No commas : "); for(i=0;i<N;i++) { printf("%d ",
> nums[i]); }
> printf("\nWith commas : "); for(i=0;i<N;i++) { printf("%d,",
> nums[i]); }
>     }
>     if(strcmp(argv[1],"-f") == 0) {
> nums = malloc(2 * sizeof(int));
> FILE* datafile = fopen(argv[2], "r");
> while(fscanf(datafile, "%d", &nums[N++]) == 1){
> nums = realloc(nums, (N+1) * sizeof(int));
> }
> fclose (datafile);
> N--;
> printf("%d from file", N);
> printf(" : "); for(i=0;i<N;i++) { printf("%d ", nums[i]); }
> qsort(nums,N,sizeof(int),compareint);
> printf("\nNo commas : "); for(i=0;i<N;i++) { printf("%d ",
> nums[i]); }
> printf("\nWith commas : "); for(i=0;i<N;i++) { printf("%d,",
> nums[i]); }
>
>     }
>     double dmin = nums[0], dmax = nums[N-1];
>     double sumN=0.0, median=0.0, Q1=0.0, Q2=0.0, Q3=0.0, IQR=0.0;
>     double sqrdiffmean = 0.0, cubediffmean = 0.0, quaddiffmean = 0.0;
>     double meanabsdev = 0.0, rootmeansqr = 0.0;
>     char temp[15]="";
>     for(i=0;i<N;i++) {sumN += nums[i];}
>     double mean = sumN / (double)N;
>     for(i = 0; i < N; i++)
>     {
> double diff = nums[i] - mean;
> sqrdiffmean += diff * diff;
> cubediffmean += diff * diff * diff;
> quaddiffmean += diff * diff * diff * diff;
> meanabsdev += fabs(diff);
> rootmeansqr += nums[i] * nums[i];
>     }
>     double stddev = sqrt(sqrdiffmean/N);
>     double kurtosis = quaddiffmean / (N * pow(sqrt(sqrdiffmean/N),4));
>     if(N % 2 == 0) {
> Q2 = median = (nums[(N/2)-1] + nums[N/2]) / 2.0;
> i = N/2;
> if(i % 2 == 0) {
> Q1 = (nums[(i/2)-1] + nums[i/2]) / 2.0;
> Q3 = (nums[i + ((i-1)/2)] + nums[i+(i/2)]) / 2.0;
> }
> else {
> Q1 = nums[(i-1)/2];
> Q3 = nums[i + ((i-1)/2)];
> }
>     }
>     if(N % 2 != 0) {
> Q2 = median = nums[(N-1)/2];
> i = (N-1)/2;
> if(i % 2 == 0) {
> Q1 = (nums[(i/2)-1] + nums[i/2]) / 2.0;
> Q3 = (nums[i + (i/2)] + nums[i + (i/2) + 1]) / 2.0;
> }
> else {
> Q1 = nums[(i-1)/2];
> Q3 = nums[i + ((i+1)/2)];
> }
>     }
>     int occur = 0;
>     char mode[250] = "";
>     if(strcmp(argv[2],"-c") != 0) {
> int *modecnt = calloc(dmax + 1, sizeof(int));
> for(i = 0; i < N; i++) {
> modecnt[nums[i]]++;
> if(modecnt[nums[i]] > occur) {
> occur = modecnt[nums[i]];
> }
> }
> if (occur > 1) {
> for(i = 0; i <= dmax; i++) {
> if(modecnt[i] == occur) {
> sprintf(temp,"%d ",i);
> strncat(mode,temp,strlen(temp));
> }
> }
> }
> free(modecnt);
>     }
>     IQR = Q3 - Q1;
>     char outliers[200]="";
>     if (N > 3) {
> double lo = Q1 - (1.5 * IQR);
> double hi = Q3 + (1.5 * IQR);
> if (dmin >= lo && dmax <= hi) {
> strcat(outliers,"none (using IQR * 1.5 rule)");
> }
> if (dmin < lo || dmax > hi) {
> for(i = 0; i < N; i++) {
> double val = (double)nums[i];
> if(val < lo || val > hi) {
> sprintf(temp,"%.0f ",val);
> printf("%d\n",(int)strlen(temp));
> strncat(outliers, temp, strlen(temp));
> }
> }
> strcat(outliers," (using IQR * 1.5 rule)");
> }
> outliers[strlen(outliers)] = '\0';
>     }
>     printf("\n--------------------------------------------------------------\n");
>     printf("Minimum : %.0f\n", dmin);
>     printf("Maximum : %.0f\n", dmax);
>     printf("Range : %.0f\n", dmax - dmin);
>     printf("Size N : %d\n" , N);
>     printf("Sum N : %.0f\n", sumN);
>     printf("Mean μ : %.2f\n", mean);
>     printf("Median : %.1f\n", median);
>     if(occur > 1) {
>     printf("Mode(s) : %s (%d occurrences ea)\n", mode,occur);}
>     else {
>     printf("Mode(s) : na (no repeating values)\n");}
>     printf("Std Dev σ : %.6f\n", stddev);
>     printf("Variance σ^2 : %.6f\n", sqrdiffmean/N);
>     printf("Mid Range : %.1f\n", (dmax + dmin)/2);
>     printf("Quartiles");
>     if(N > 3) {printf(" Q1: %.1f\n", Q1);}
>     if(N < 4) {printf(" Q1: na\n");}
>     printf(" Q2: %.1f (median)\n", Q2);
>     if(N > 3) {printf(" Q3: %.1f\n", Q3);}
>     if(N < 4) {printf(" Q3: na\n");}
>     printf("IQR : %.1f (interquartile range)\n", IQR);
>     if(N > 3) {printf("Outliers : %s\n", outliers);}
>     if(N < 4) {printf("Outliers : na\n");}
>     printf("Sum Squares SS : %.6f\n", sqrdiffmean);
>     printf("MAD : %.6f (mean absolute deviation)\n",
> meanabsdev / N);
>     printf("Root Mean Sqr : %.6f\n", sqrt(rootmeansqr / N));
>     printf("Std Error Mean : %.6f\n", stddev / sqrt(N));
>     printf("Skewness γ1 : %.6f\n", cubediffmean / (N *
> pow(sqrt(sqrdiffmean/N),3)));
>     printf("Kurtosis β2 : %.6f\n", kurtosis);
>     printf("Kurtosis Excess α4 : %.6f\n", kurtosis - 3);
>     printf("CV : %.8f (coefficient of variation\n",
> sqrt(sqrdiffmean/N) / mean);
>     printf("RSD : %.6f%% (relative std deviation)\n",
> 100 * (sqrt(sqrdiffmean/N) / mean));
>     printf("--------------------------------------------------------------\n");
>     printf("Check results up to N=9999 against\n");
>     printf("https://www.calculatorsoup.com/calculators/statistics/descriptivestatistics.php");
>     printf("\n\n");
>     free(nums);
>     return 0;
> }
>===============================================================================
>
> pwned

Lester Thorpe <lt@gnu.rocks> wrote at 20:17 this Saturday (GMT):
> On Sat, 13 Jul 2024 14:10:03 -0000 (UTC), candycanearter07 wrote:
>
>>
>> Well, they could be trying to process an arbitrary file.
>>
>
> Nope. If you read the idiotic DooFuS posts the imbecile wants
> to read space separated (i.e. no LF) integers.
>
> Only the retarded DooFuS could have produced such an inane
> storage format.
>
> But regardless, flex can rip through it in one pass. The fact
> that the DooFuS missed that absolutely elementary point only
> solidifies his reputation as a moronic programming dilettante.
>
> Of course, the overall message is that the DooFuS, who advocates
> Microslop, is continually shown to be digitally incompetent and
> thus his opinions are utterly and totally worthless.
>
>>
>> Also, I haven't really heard of GNU Flex, but if it's so useful, I might
>> try and learn it.
>>
>
> (F)lex has been around since the very beginning of programming.
> Why have you not heard of it?
>
> Most "programmers" today are not actually programmers.

It didn't come up, I guess.
--
user <candycane> is generated from /dev/urandom

Le 14-07-2024, candycanearter07 <candycanearter07@candycanearter07.nomail.afraid> a écrit :
> DFS <nospam@dfs.com> wrote at 21:29 this Saturday (GMT):
>> On 7/12/2024 5:15 PM, Lameass Larry Piet wrote:
>>
>> idiot
>
> Ohh

Yes, it's a long love story between them.

>>
>> /* free all strarray elements */
>> for(i = 0; i < rec_count; i++) {
>> free(data[i]->field1);
>> free(data[i]->field2);
>> free(data[i]->field3);
>> free(data[i]);
>> i++;
>> }
>
> To be fair, it is a fine way to free data structures like that. I know
> I've used something like this before.

I hope not. Either you change the indices inside the body of the loop or
in its declaration. You can get what you want either way. But changing
the value of "i" at the same time in the declaration and in the body is
only looking for trouble.

--
Si vous avez du temps à perdre :
https://scarpet42.gitlab.io

Stéphane CARPENTIER <sc@fiat-linux.fr> wrote at 15:49 this Sunday (GMT):
> Le 14-07-2024, candycanearter07 <candycanearter07@candycanearter07.nomail.afraid> a écrit :
>> DFS <nospam@dfs.com> wrote at 21:29 this Saturday (GMT):
>>> On 7/12/2024 5:15 PM, Lameass Larry Piet wrote:
>>>
>>> idiot
>>
>> Ohh
>
> Yes, it's a long love story between them.

lol

>>>
>>> /* free all strarray elements */
>>> for(i = 0; i < rec_count; i++) {
>>> free(data[i]->field1);
>>> free(data[i]->field2);
>>> free(data[i]->field3);
>>> free(data[i]);
>>> i++;
>>> }
>>
>> To be fair, it is a fine way to free data structures like that. I know
>> I've used something like this before.
>
> I hope not. Either you change the indices inside the body of the loop or
> in its declaration. You can get what you want either way. But changing
> the value of "i" at the same time in the declaration and in the body is
> only looking for trouble.

OH I didn't even notice that..yeah, that would miss every other entry.
Sorry
--
user <candycane> is generated from /dev/urandom

On 14 Jul 2024 15:49:29 GMT, Stéphane CARPENTIER wrote:

>>>
>>> /* free all strarray elements */
>>> for(i = 0; i < rec_count; i++) {
>>> free(data[i]->field1);
>>> free(data[i]->field2);
>>> free(data[i]->field3);
>>> free(data[i]);
>>> i++;
>>> }
>>
>> To be fair, it is a fine way to free data structures like that. I know
>> I've used something like this before.
>
> I hope not. Either you change the indices inside the body of the loop or
> in its declaration. You can get what you want either way. But changing
> the value of "i" at the same time in the declaration and in the body is
> only looking for trouble.
>

You are both a couple of saps. That ignoramus planted that line in the
code. In the original it is absent.

Like Trump he cheats. He cheats to cover up his character as a total
loser.

But, regardless, it makes absolutely no difference. Those lines are at
the program terminus and no memory has to be freed. Those lines
are just a formality and can be included or omitted.

But the genuinely stupid DooFuS cannot understand. He is a chump like
you two.

The genuinely stupid DooFuS was, is, and always will be a supremely
retarded dunce.

Lester Thorpe

SystemD: solving all the problems that you never knew you had.

On 7/14/2024 12:42 PM, Lameass Larry Pietraskiewicz wrote:

> On 14 Jul 2024 15:49:29 GMT, Stéphane CARPENTIER wrote:
>
>>>>
>>>> /* free all strarray elements */
>>>> for(i = 0; i < rec_count; i++) {
>>>> free(data[i]->field1);
>>>> free(data[i]->field2);
>>>> free(data[i]->field3);
>>>> free(data[i]);
>>>> i++;
>>>> }
>>>
>>> To be fair, it is a fine way to free data structures like that. I know
>>> I've used something like this before.
>>
>> I hope not. Either you change the indices inside the body of the loop or
>> in its declaration. You can get what you want either way. But changing
>> the value of "i" at the same time in the declaration and in the body is
>> only looking for trouble.
>>
>
> You are both a couple of saps. That ignoramus planted that line in the
> code. In the original it is absent.

Too bad you can't be fined for lying on Usenet.

http://al.howardknight.net/?STYPE=msgid&MSGI=%3Crnelct0tjg%40news3.newsguy.com%3E

You don't belong near software or programming.

On 7/14/2024 11:00 AM, candycanearter07 wrote:
> DFS <nospam@dfs.com> wrote at 21:29 this Saturday (GMT):
>> On 7/12/2024 5:15 PM, Lameass Larry Piet wrote:

>>> Holy godzilla mutherfuckers!
>>>
>>> Hasn't this infinite idiot ever heard of GNU flex?
>>
>> Why tf would anyone EVER waste their time and use such GuhNoo crapware
>> just to read a set of numbers from a file? It's a few lines of simple code.
>>
>> AND, even though my original file format is integers separated by spaces
>> (shown for compactness in the post), my code works unchanged if they're
>> separated by line-feeds.
>>
>>
>> double idiot
>
> Does it work if the numbers are separated by alphabet chars?

No. Just spaces or linefeeds.

>>> Even a C newbie would seriously consider pre-processing
>>> the input file to get it into proper shape. But not
>>> this insuperable dunce.
>>
>> Who needs to "pre-process" a set of integers?
>>
>> triple idiot
>
> How would you even pre-process that?

Feeb will find a way, then claim it's the "only way".

Since he apparently can't write 5 lines of code to import the data,
he'll claim 'GuhNoo flex' is required, and make a huge mess of everything.

Here on cola we've been dealing with his crazed bragging and
excuse-making and lack of programming skills for 9 years. So I'm
serious when I say don't pay attention to his idiocy.

If you have a C question, comp.lang.c is great. Those guys are absolute
masters.

>>> Any moron so totally inept in programming cannot ever
>>> be admitted into a serious discussion of GNU/Linux.
>>
>> You labeled this double-time shit-code of yours "wonderfully perfect and
>> highly efficient":
>>
>>
>> /* free all strarray elements */
>> for(i = 0; i < rec_count; i++) {
>> free(data[i]->field1);
>> free(data[i]->field2);
>> free(data[i]->field3);
>> free(data[i]);
>> i++;
>> }
>
> To be fair, it is a fine way to free data structures like that. I know
> I've used something like this before.

Take a close look. I doubt you used his inane technique.

He said it was 'perfect' but it really wasn't.

>> int compareint (const void * a, const void * b)
>> {
>> if (*(int*)a > *(int*)b) return 1;
>> else if (*(int*)a < *(int*)b) return -1;
>> else return 0;
>> }
>
> Why aren't you just using int pointer arguments here?

Cast to const void* is part of the qsort() prototype:

https://cplusplus.com/reference/cstdlib/qsort/
https://en.cppreference.com/w/c/algorithm/qsort

<snip code>

> looks pretty good!

Thanks. It was fun to keep at it until I got it right.

The results of my code should match the results at

https://www.calculatorsoup.com/calculators/statistics/descriptivestatistics.php

Give it a run if you have a minute, and see if you enjoy it. It was the
better part of 3 days to write it in C, then making a python port took
about 2 hours.

L Thorpe <lt666@sixsixsix.net> wrote:

>You are both a couple of saps.

You have some gall to say to that to either of them, weirdo.

--
Joel W. Crump

Amendment XIV
Section 1.

[...] No state shall make or enforce any law which shall
abridge the privileges or immunities of citizens of the
United States; nor shall any state deprive any person of
life, liberty, or property, without due process of law;
nor deny to any person within its jurisdiction the equal
protection of the laws.

Dobbs rewrites this, it is invalid precedent. States are
liable for denying needed abortions, e.g. TX.

On Sun, 14 Jul 2024 08:12:38 -0400, Chris Ahlstrom wrote:

> I cloned a small MIDI-to-text project (something like midiconvert, IIRC)
> that used flex, and greatly extended it, adding a C++ version. Flex is
> painful. If I ever work on that app again, I'll write the parsers from
> scratch; I've already got a lot code in another couple projects that
> parses the files.

We have some legacy code that parses a configuration file to allow
creating text reports. The configuration file is in a rather arcane sort
of language I guess you would call it. It starts with a file that is run
through flex to create an intermediate file that bison uses to create a .c
file. Even better the programmer used some very creative macros so there
really aren't any recognizable functions. The programmer had been a TA at
the university and people who had him said he was big on commenting code
but he didn't follow his own guidelines. Meaningful naming didn't happen
either; 'ary' is much easier to type than 'array'. Anymore than three
letters is a waste.

The theory was the clients or support could use the configuration files to
prepare reports without involving programming. The practice is a few
canned configurations were created and carefully copied from site to site.
If there is a need to make minor changes programming receives a 'Help!'
email.

So much for yaccs, bisons hairy or otherwise, flex, lex, and all their
relatives. I don't even remember what the hairy bison was, possible a port
of bison to AIX.

Le 14-07-2024, L Thorpe <lt666@sixsixsix.net> a écrit :
> On 14 Jul 2024 15:49:29 GMT, Stéphane CARPENTIER wrote:
>
>>>>
>>>> /* free all strarray elements */
>>>> for(i = 0; i < rec_count; i++) {
>>>> free(data[i]->field1);
>>>> free(data[i]->field2);
>>>> free(data[i]->field3);
>>>> free(data[i]);
>>>> i++;
>>>> }
>>>
>>> To be fair, it is a fine way to free data structures like that. I know
>>> I've used something like this before.
>>
>> I hope not. Either you change the indices inside the body of the loop or
>> in its declaration. You can get what you want either way. But changing
>> the value of "i" at the same time in the declaration and in the body is
>> only looking for trouble.
>
> You are both a couple of saps. That ignoramus planted that line in the
> code. In the original it is absent.

In fact, he provided a link toward the original post and it was
certainly not absent.

> Like Trump he cheats. He cheats to cover up his character as a total
> loser.

At least, you realize it's bad code.

> But, regardless, it makes absolutely no difference. Those lines are at
> the program terminus and no memory has to be freed. Those lines
> are just a formality and can be included or omitted.

Either the code is useful and you take care of it. Or it's useless and
you don't write it. It's just plain stupid to spend time writing bad
code.

--
Si vous avez du temps à perdre :
https://scarpet42.gitlab.io

On 14 Jul 2024 20:45:15 GMT, Stéphane CARPENTIER wrote:

>
> In fact, he provided a link toward the original post and it was
> certainly not absent.
>

You are a total fool.

The links of the DooFuS are totally worthless. He obviously
spoofed the header knowing that all idiots, like you, could
not notice.

The reality is that the DooFuS is an ignoramus retard that
could not out program a Girl Scout at summer camp.

As I indicated earlier, the DooFuS is a total phony with
a fat, arrogant mouth.

There are so many, many examples of this. But I have
got much, much better things to do than to search for the incompetence
of that idiot.

Lester Thorpe

SystemD: solving all the problems that you never knew you had.

On 7/14/2024 5:14 PM, Lying Larry Pietraskiewicz wrote:

> On 14 Jul 2024 20:45:15 GMT, Stéphane CARPENTIER wrote:
>
>>
>> In fact, he provided a link toward the original post and it was
>> certainly not absent.
>>
>
> You are a total fool.
>
> The links of the DooFuS are totally worthless. He obviously
> spoofed the header knowing that all idiots, like you, could
> not notice.

tsk tsk

This willingness to lie about your own post and your own program is
another example of why you're a failure at life.

DFS <nospam@dfs.com> wrote:
>On 7/14/2024 5:14 PM, Lying Larry Pietraskiewicz wrote:
>
>This willingness to lie about your own post and your own program is
>another example of why you're a failure at life.

Larry thinks he can talk loudly but he isn't saying anything, he's
only good at the mechanics of computing, like his wild claim to have
assaulted people's laptops at the WiFi hotspot, he takes all these
pictures and makes an ass of himself, publicly. You are an admitted
racist and yet you don't support Trump and you aren't this pretend
computer expert like Larry, I end up appreciating your contributions
and finding him to be offending because he goes negative on everyone,
just total arrogance, but I will let him imagine that COLA is so big
and important, because there is truth to it, and the OS wars are one
reason for it.

--
Joel W. Crump

Amendment XIV
Section 1.

[...] No state shall make or enforce any law which shall
abridge the privileges or immunities of citizens of the
United States; nor shall any state deprive any person of
life, liberty, or property, without due process of law;
nor deny to any person within its jurisdiction the equal
protection of the laws.

Dobbs rewrites this, it is invalid precedent. States are
liable for denying needed abortions, e.g. TX.

On 7/14/2024 6:24 PM, Joel wrote:
> DFS <nospam@dfs.com> wrote:
>> On 7/14/2024 5:14 PM, Lying Larry Pietraskiewicz wrote:
>>
>> This willingness to lie about your own post and your own program is
>> another example of why you're a failure at life.
>
>
> Larry thinks he can talk loudly but he isn't saying anything, he's
> only good at the mechanics of computing, like his wild claim to have
> assaulted people's laptops at the WiFi hotspot, he takes all these
> pictures and makes an ass of himself, publicly. You are an admitted
> racist

Negroids ruin everything they touch, everywhere they go.

> and yet you don't support Trump

Trump belongs in jail the rest of his life. I won't miss him when he's
gone, but I was sad/angry someone tried to kill him, just as I was
pissed at Jan 6. You want to believe America is above political
violence, and we mostly are, but it only takes one lowlife politician -
like Trump - to trigger people.

> and you aren't this pretend computer expert like Larry,

That's not all he claims to be.

------------------------------------------------------------------------
"_I_ am the pinnacle of intellectual and physical perfection.
GNU/Linux is, like me, perfect in every way."

"I am a highly sought after and highly paid consultant, and I
do it all with GNU/Linux (what else)."

"The DoD got their answer and I got my $50K." (for solving a couple
differential equations he claimed were related to hypersonic cruise
missiles)

"Holy fuck! I am only a single human being. The GIMP people want me to
implement netpbm HDR formats. The ImageMagick folks want me to
implement AI. Give this poor boy a fucking break! But I am a FOSS
person. I can do anything and everything and I can do it all extremely
well."

"HPC = High-Performance Computing and is the ONLY area of REAL
COMPUTING. Everything else is fashionable bullshit. GNU/Linux, in the
right hands (like mine), excels at HPC."

"I am heavily involved in virtually ALL AREAS of contemporary computing"

(heh! That last one is priceless. How deluded and self-important can
one twat be?)

left side of his mouth:
"A COMPETENT GNU/Linux user will NEVER have problems.

right side of his mouth:
"I have serious problems with GNU/Linux from time to time and it's
always a bit of a struggle trying to get things back on track."

left side of his mouth:
"I am a human being of upstanding moral character and integrity."

right side of his mouth:
"You and your whole fucking family lineage are a pack of genetic
inferiors. You all should voluntarily line up at the nearest
dog gassing chamber and help to clean up the gene pool."

When his bad code is exposed he gets desperate:
DFS spoofed the headers and added a line to my perfect code
------------------------------------------------------------------------

Endless lies and idiocy and dbl-talking like that. In fact, cola has
endured 9 solid years of his petulance and deranged screeching.

> I end up appreciating your contributions
> and finding him to be offending because he goes negative on everyone,
> just total arrogance, but I will let him imagine that COLA is so big
> and important, because there is truth to it, and the OS wars are one
> reason for it.

No woman and a lack of IT and financial success has made him angry and
insane.

Lester Thorpe wrote this copyrighted missive and expects royalties:

> On Sun, 14 Jul 2024 08:12:38 -0400, Chris Ahlstrom wrote:
>
>>
>> I cloned a small MIDI-to-text project (something like midiconvert, IIRC) that
>> used flex,
>>
>
> ?????????????
>
> Flex is a lexer that operates on text data. A MIDI file contains binary
> data.

Bytes are bytes.

> I use these fine MIDI conversion tools:
>
> https://www.fourmilab.ch/webtools/midicsv/
>
> https://github.com/MarquisdeGeek/midilib
>
> Neither of them uses flex.

Flex is a code generator.

> But MIDI 2.0 has been out for a while already and I have seen
> no FOSS programs that support it.

What hardware supports MIDI 2.0?

--
Rebellion lay in his way, and he found it.
-- William Shakespeare, "Henry IV"