No CODE TAGS [ c o d e] ... [ / c o d e ] without spaces. -- jim mcnamara
output of this program mean.c: In function ‘main’:
mean.c:11: error: array size missing in ‘x’
mean.c:17: warning: passing argument 1 of ‘_IO_getc’ from incompatible pointer type
mean.c:17: error: incompatible types in assignment
Last edited by jim mcnamara; 11-13-2008 at 12:22 PM..
Reason: add code tags
Hi I have fakebook.csv as following:
F1(current date) F2(popularity) F3(name of book) F4(release date of book)
2006-06-21,6860,"Harry Potter",2006-12-31
2006-06-22,,"Harry Potter",2006-12-31
2006-06-23,7120,"Harry Potter",2006-12-31
2006-06-24,,"Harry Potter",2006-12-31... (0 Replies)
Hello,
I'm hoping to get some help on calculating an average time from a list of times (hour:minute:second).
Here's what my list looks like right now, it will grow (I can get the full date or change the formatting of this as well):
07:55:31
09:42:00
08:09:02
09:15:23
09:27:45
09:49:26... (4 Replies)
I want to calculate the average line by line of some files with several lines on them, the files are identical, just want to average the 3rd columns of those files.:wall:
Example file:
File 1
001 0.046 0.667267
001 0.047 0.672028
001 0.048 0.656025
001 0.049 ... (2 Replies)
I have an awk script that gives the following output:
Average end-to-end transmission delay 2.7 to 5.7 is 0.635392 seconds
Average end-to-end transmission delay 2.1 to 5.1 is 0.66272 seconds
Average end-to-end transmission delay 2.1 to 5.1 is 0.691712 seconds
Average end-to-end transmission... (4 Replies)
Hello dears,
I have a log file with records like below and want to get a average of one column based on the search of one specific keyword.
2015-02-07 08:15:28 10.102.51.100 10.112.55.101 "kevin.c" POST ... (2 Replies)
Gents,
Please i will to get the distance and azimut from 2 coordinates:
Usig excel formula i get the correct values, but i will like to do it using awk.
Example
A 35089.0 50345.016 9 75 1 2101774 77 70 79 483911.6 2380106.9 137.4 1 1 6 1
A 35089.0 50345.01620 75... (8 Replies)
My old school way is a one liner. And will search for average from SAR, to get the data receive rate. But, I dont think it is practical or accurate,. Because it calculates to off peak hours. I am planning to change it. My cron runs every 30 mins. When my cron runs, and my time is 14:47pm,, it will... (1 Reply)
Discussion started by: invinzin21
1 Replies
LEARN ABOUT NETBSD
remquo
REMAINDER(3) BSD Library Functions Manual REMAINDER(3)NAME
remainder, remainderf, remquo, remquof -- remainder functions
LIBRARY
Math Library (libm, -lm)
SYNOPSIS
#include <math.h>
double
remainder(double x, double y);
float
remainderf(float x, float y);
double
remquo(double x, double y, int *quo);
float
remquof(float x, float y, int *quo);
DESCRIPTION
Provided that y != 0 , the remainder() and remainderf() functions calculate the floating-point remainder r of
r = x - ny,
where n is the integral value nearest to the exact value of x / y. If
| n - x / y | = 1/2 ,
the value n is chosen to be even. Consequently, the remainder is computed exactly and | r | <= | y | / 2 .
Also the remquo() and remquof() functions calculate the remainder as described above. But these additionally use quo to store a value whose
sign is the sign of x / y and whose magnitude is congruent modulo 2^k to the magnitude of the integral quotient of x / y, where k is an
implementation-defined integer greater than or equal to 3.
The rationale of the remquo() family of functions relates to situations where only few bits of the quotient are required. The exact repre-
sentation of the quotient may not be meaningful when x is large in magnitude compared to y.
RETURN VALUES
The functions return the remainder independent of the rounding mode. If y is zero , NaN is returned and a domain error occurs. A domain
error occurs and a NaN is returned also when x is infinite but y is not a NaN. If either x or y is NaN, a NaN is always returned.
SEE ALSO div(3), fast_remainder32(3), fmod(3), math(3)STANDARDS
The described functions conform to ISO/IEC 9899:1999 (``ISO C99'').
BSD September 18, 2011 BSD