predictors: Remove resources marked as unused.

chrome/browser/predictors/resource_prefetch_predictor_test_util.cc

 // Copyright 2016 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "chrome/browser/predictors/resource_prefetch_predictor_test_util.h"
 
 #include <cmath>
 
 namespace {
 
@@ skipping 58 matching lines @@
                           bool accessed_network) {
   origin_stat->set_origin(origin);
   origin_stat->set_number_of_hits(number_of_hits);
   origin_stat->set_number_of_misses(number_of_misses);
   origin_stat->set_consecutive_misses(consecutive_misses);
   origin_stat->set_average_position(average_position);
   origin_stat->set_always_access_network(always_access_network);
   origin_stat->set_accessed_network(accessed_network);
 }
 
+void InitializeExperiment(precache::PrecacheManifest* manifest,
+                          uint32_t experiment_id,
+                          const std::vector<bool>& bitset) {
+  std::string binary_bitset;
+  for (size_t i = 0; i < (bitset.size() + 7) / 8; ++i) {

[Benoit L, 2017/04/14 08:26:56]

The most likely representation of vector<bool> is already exactly what you want,
but the bad, bad C++ standard doesn't mandate it (even though it mandates that
vector<bool> is special).
SAD!

[alexilin, 2017/04/14 09:55:22]

The world is not perfect. Especially, C++ world.
We will hope that there is no bugs, because we don't test testing code!

+    char c = 0;
+    for (size_t j = 0; j < 8; ++j) {
+      if (i * 8 + j < bitset.size() && bitset[i * 8 + j])
+        c |= (1 << j);
+    }
+    binary_bitset.push_back(c);
+  }
+
+  precache::PrecacheResourceSelection prs;
+  prs.set_bitset(binary_bitset);
+  (*manifest->mutable_experiments()
+        ->mutable_resources_by_experiment_group())[experiment_id] = prs;
+}
+
 PrefetchData CreatePrefetchData(const std::string& primary_key,
                                 uint64_t last_visit_time) {
   PrefetchData data;
   data.set_primary_key(primary_key);
   data.set_last_visit_time(last_visit_time);
   return data;
 }
 
 RedirectData CreateRedirectData(const std::string& primary_key,
                                 uint64_t last_visit_time) {
@@ skipping 246 matching lines @@
 
   return equal;
 }
 
 bool operator==(const PrecacheResource& lhs, const PrecacheResource& rhs) {
   return lhs.url() == rhs.url() &&
          AlmostEqual(lhs.weight_ratio(), rhs.weight_ratio());
 }
 
 }  // namespace precache