OLD | NEW |
1 // Copyright 2014 The Chromium Authors. All rights reserved. | 1 // Copyright 2014 The Chromium Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #ifndef COMPONENTS_RAPPOR_RAPPOR_PARAMETERS_H_ | 5 #ifndef COMPONENTS_RAPPOR_RAPPOR_PARAMETERS_H_ |
6 #define COMPONENTS_RAPPOR_RAPPOR_PARAMETERS_H_ | 6 #define COMPONENTS_RAPPOR_RAPPOR_PARAMETERS_H_ |
7 | 7 |
8 #include <string> | 8 #include <string> |
9 | 9 |
10 namespace rappor { | 10 namespace rappor { |
11 | 11 |
12 enum Probability { | 12 enum Probability { |
13 PROBABILITY_75, // 75% | 13 PROBABILITY_75, // 75% |
14 PROBABILITY_50, // 50% | 14 PROBABILITY_50, // 50% |
15 PROBABILITY_25, // 25% | 15 PROBABILITY_25, // 25% |
16 }; | 16 }; |
17 | 17 |
| 18 |
| 19 // A metric is reported when it's reporting level is >= the reporting level |
| 20 // passed in to RapporService::Start() |
| 21 enum ReportingLevel { |
| 22 // No metrics are reported at this level. |
| 23 REPORTING_DISABLED = 0, |
| 24 // Metrics suitable for broader populations. |
| 25 COARSE_LEVEL, |
| 26 // Metrics suitable for UMA opt-in users. |
| 27 FINE_LEVEL, |
| 28 }; |
| 29 |
18 // An object describing a rappor metric and the parameters used to generate it. | 30 // An object describing a rappor metric and the parameters used to generate it. |
19 // | 31 // |
20 // For a full description of the rappor metrics, see | 32 // For a full description of the rappor metrics, see |
21 // http://www.chromium.org/developers/design-documents/rappor | 33 // http://www.chromium.org/developers/design-documents/rappor |
22 struct RapporParameters { | 34 struct RapporParameters { |
23 // Get a string representing the parameters, for DCHECK_EQ. | 35 // Get a string representing the parameters, for DCHECK_EQ. |
24 std::string ToString() const; | 36 std::string ToString() const; |
25 | 37 |
26 // The maximum number of cohorts we divide clients into. | 38 // The maximum number of cohorts we divide clients into. |
27 static const int kMaxCohorts; | 39 static const int kMaxCohorts; |
28 | 40 |
29 // The number of cohorts to divide the reports for this metric into. | 41 // The number of cohorts to divide the reports for this metric into. |
| 42 // This should divide kMaxCohorts evenly so that each cohort has an equal |
| 43 // probability of being assigned users. |
30 int num_cohorts; | 44 int num_cohorts; |
31 | 45 |
32 // The number of bytes stored in the Bloom filter. | 46 // The number of bytes stored in the Bloom filter. |
33 int bloom_filter_size_bytes; | 47 int bloom_filter_size_bytes; |
34 // The number of hash functions used in the Bloom filter. | 48 // The number of hash functions used in the Bloom filter. |
35 int bloom_filter_hash_function_count; | 49 int bloom_filter_hash_function_count; |
36 | 50 |
37 // The probability that a bit will be redacted with fake data. | 51 // The probability that a bit will be redacted with fake data. |
38 Probability fake_prob; | 52 Probability fake_prob; |
39 // The probability that a fake bit will be a one. | 53 // The probability that a fake bit will be a one. |
40 Probability fake_one_prob; | 54 Probability fake_one_prob; |
41 | 55 |
42 // The probability that a one bit in the redacted data reports as one. | 56 // The probability that a one bit in the redacted data reports as one. |
43 Probability one_coin_prob; | 57 Probability one_coin_prob; |
44 // The probability that a zero bit in the redacted data reports as one. | 58 // The probability that a zero bit in the redacted data reports as one. |
45 Probability zero_coin_prob; | 59 Probability zero_coin_prob; |
| 60 |
| 61 // The reporting level this metric is reported at. |
| 62 ReportingLevel reporting_level; |
46 }; | 63 }; |
47 | 64 |
48 } // namespace rappor | 65 } // namespace rappor |
49 | 66 |
50 #endif // COMPONENTS_RAPPOR_RAPPOR_PARAMETERS_H_ | 67 #endif // COMPONENTS_RAPPOR_RAPPOR_PARAMETERS_H_ |
OLD | NEW |