Lines Matching refs:Sample
77 Sample minimum,
78 Sample maximum,
131 void Histogram::AddSampleSet(const SampleSet& sample) {
132 sample_.Add(sample);
244 SampleSet sample;
254 !sample.Histogram::SampleSet::Deserialize(&iter, pickle)) {
298 render_histogram->AddSampleSet(sample);
305 // Methods for the validating a sample and a related histogram.
311 Sample previous_range = -1; // Bottom range is always 0.
331 // we'll catch a redundant count that doesn't match the sample count. We
356 Histogram::Sample Histogram::ranges(size_t i) const {
364 // Do a safe atomic snapshot of sample data.
366 void Histogram::SnapshotSample(SampleSet* sample) const {
368 *sample = sample_;
371 bool Histogram::HasConstructorArguments(Sample minimum,
372 Sample maximum,
390 Histogram::Histogram(const std::string& name, Sample minimum,
391 Sample maximum, size_t bucket_count)
440 Sample current = declared_min();
466 size_t Histogram::BucketIndex(Sample value) const {
518 // Update histogram data with new sample.
519 void Histogram::Accumulate(Sample value, Count count, size_t index) {
524 void Histogram::SetBucketRange(size_t i, Sample value) {
568 // need is a nice hash, that tends to depend on all the bits of the sample, with
571 uint32 Histogram::Crc32(uint32 sum, Histogram::Sample range) {
575 Histogram::Sample range;
576 unsigned char bytes[sizeof(Histogram::Sample)];
586 Histogram::Sample range;
587 uint16 ints[sizeof(Histogram::Sample) / 2];
589 DCHECK_EQ(sizeof(Histogram::Sample), sizeof(converter));
683 void Histogram::SampleSet::Accumulate(Sample value, Count count,
774 Sample minimum,
775 Sample maximum,
816 bucket_description_[descriptions[i].sample] = descriptions[i].description;
821 Sample minimum,
822 Sample maximum,
907 const std::vector<Sample>& custom_ranges,
944 const std::vector<Sample>& custom_ranges)
952 const std::vector<Sample>& custom_ranges) {
