* Authors:
* Svetlana Shmidt <sshmidt at google.com>
**/
+
#include "distribution.h"
#include <errno.h>
return dist->total_sum / dist->tree[0].bucket_counter;
}
-int main() {
- double a[] = {3.0, 5.7, 6.7};
- distribution_t *p = distribution_new_custom(3, a);
- distribution_update(p, 2);
- distribution_update(p, 5);
- distribution_update(p, 7.5);
- distribution_update(p, 3.1);
- for (size_t i = 0; i < 7; i++) {
- printf("%f %f %lu\n", p->tree[i].minimum, p->tree[i].maximum, p->tree[i].bucket_counter);
- }
- printf("%f\n", distribution_average(p));
- printf("%f\n", distribution_percentile(p, 70));
- distribution_destroy(p);
-}
#include "collectd.h"
-#include "metric.h"
+#include "distribution.h"
#include "testing.h"
-int main(void) {
- printf("Hello World!");
+DEF_TEST(distribution_new_linear) {
+ distribution_t *d = distribution_new_linear(3, -1);
+ EXPECT_EQ_PTR(NULL, d);
+ return 0;
+}
+
+int main() {
+ RUN_TEST(distribution_new_linear);
+ END_TEST;
}