Add type-safe constructors to net::HashValue

net/base/hash_value.cc

 // Copyright (c) 2012 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 "net/base/hash_value.h"
 
 #include "base/base64.h"
 #include "base/logging.h"
 #include "base/sha1.h"
 #include "base/strings/string_split.h"
@@ skipping 13 matching lines @@
 
 
 bool SHA1HashValue::Equals(const SHA1HashValue& other) const {
   return memcmp(data, other.data, sizeof(data)) == 0;
 }
 
 bool SHA256HashValue::Equals(const SHA256HashValue& other) const {
   return memcmp(data, other.data, sizeof(data)) == 0;
 }
 
+HashValue::HashValue(const SHA1HashValue& hash) : HashValue(HASH_VALUE_SHA1) {
+  fingerprint.sha1 = hash;
+}
+
+HashValue::HashValue(const SHA256HashValue& hash)
+    : HashValue(HASH_VALUE_SHA256) {
+  fingerprint.sha256 = hash;
+}
+
 bool HashValue::Equals(const HashValue& other) const {
   if (tag != other.tag)
     return false;
   switch (tag) {
     case HASH_VALUE_SHA1:
       return fingerprint.sha1.Equals(other.fingerprint.sha1);
     case HASH_VALUE_SHA256:
       return fingerprint.sha256.Equals(other.fingerprint.sha256);
     default:
       NOTREACHED() << "Unknown HashValueTag " << tag;
@@ skipping 70 matching lines @@
 bool IsSHA1HashInSortedArray(const SHA1HashValue& hash,
                              const uint8_t* array,
                              size_t array_byte_len) {
   DCHECK_EQ(0u, array_byte_len % base::kSHA1Length);
   const size_t arraylen = array_byte_len / base::kSHA1Length;
   return NULL != bsearch(hash.data, array, arraylen, base::kSHA1Length,
                          CompareSHA1Hashes);
 }
 
 }  // namespace net