69 	data->records = calloc(size, sizeof(stats_record_t));  in stats_container_init()
70 	if (!data->records)  in stats_container_init()
84 	data->records[myindex] = rec;  in stats_container_append()
91 	    realloc(data->records, size * sizeof(stats_record_t));  in stats_container_resize()
94 	data->records = newrecords;  in stats_container_resize()
96 		memset(data->records + data->size, 0, size - data->size);  in stats_container_resize()
103 	free(data->records);  in stats_container_free()
110 	qsort(data->records, data->index + 1, sizeof(stats_record_t),  in stats_sort()
127 		sum += data->records[i].y;  in stats_stddev()
134 		delta = (data->records[i].y - avg);  in stats_stddev()
155 		sum += data->records[i].y;  in stats_avg()
171 	min = data->records[0].y;  in stats_min()
173 		if (data->records[i].y < min) {  in stats_min()
174 			min = data->records[i].y;  in stats_min()
190 	max = data->records[0].y;  in stats_max()
192 		if (data->records[i].y > max) {  in stats_max()
193 			max = data->records[i].y;  in stats_max()
238 		quantiles->quantiles[i - 2] = data->records[index].y;  in stats_quantiles_calc()
268 	min = max = data->records[0].y;  in stats_hist()
270 		y = data->records[i].y;  in stats_hist()
279 	hist->records[0].x = min;  in stats_hist()
281 		hist->records[i].x = min + i * width;  in stats_hist()
286 		y = data->records[i].y;  in stats_hist()
288 		hist->records[b].y++;  in stats_hist()
298 		x = hist->records[i].x;  in stats_hist_print()
301 			       hist->records[i + 1].x, hist->records[i].y);  in stats_hist_print()
303 			printf("[%ld,-) = %ld\n", x, hist->records[i].y);  in stats_hist_print()
338 		minx = maxx = data->records[0].x;  in stats_container_save()
339 		miny = maxy = data->records[0].y;  in stats_container_save()
341 			rec = &data->records[i];  in stats_container_save()