Get rid of the unused Priority argument to QuicUtils::FindMutualTag. No behavior change.

net/quic/core/quic_utils.h

 // 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.
 //
 // Some helpers for quic.
 
 #ifndef NET_QUIC_CORE_QUIC_UTILS_H_
 #define NET_QUIC_CORE_QUIC_UTILS_H_
 
 #include <stddef.h>
@@ skipping 14 matching lines @@
 #define QUIC_ALIGNED(X) __declspec(align(X))
 #else
 #define QUIC_ALIGN_OF alignof
 #define QUIC_ALIGNED(X) __attribute__((aligned(X)))
 #endif  // _MSC_VER
 
 namespace net {
 
 class NET_EXPORT_PRIVATE QuicUtils {
  public:
-  enum Priority {
-    LOCAL_PRIORITY,
-    PEER_PRIORITY,
-  };
-
   // Returns the 64 bit FNV1a hash of the data.  See
   // http://www.isthe.com/chongo/tech/comp/fnv/index.html#FNV-param
   static uint64_t FNV1a_64_Hash(const char* data, int len);
 
   // returns the 128 bit FNV1a hash of the data.  See
   // http://www.isthe.com/chongo/tech/comp/fnv/index.html#FNV-param
   static uint128 FNV1a_128_Hash(const char* data1, int len1);
 
   // returns the 128 bit FNV1a hash of the two sequences of data.  See
   // http://www.isthe.com/chongo/tech/comp/fnv/index.html#FNV-param
   static uint128 FNV1a_128_Hash_Two(const char* data1,
                                     int len1,
                                     const char* data2,
                                     int len2);
 
   // FindMutualTag sets |out_result| to the first tag in the priority list that
   // is also in the other list and returns true. If there is no intersection it
   // returns false.
   //
-  // Which list has priority is determined by |priority|.
-  //
   // If |out_index| is non-nullptr and a match is found then the index of that
   // match in |their_tags| is written to |out_index|.
   static bool FindMutualTag(const QuicTagVector& our_tags,
                             const QuicTag* their_tags,
                             size_t num_their_tags,
-                            Priority priority,
                             QuicTag* out_result,
                             size_t* out_index);
 
   // SerializeUint128 writes the first 96 bits of |v| in little-endian form
   // to |out|.
   static void SerializeUint128Short(uint128 v, uint8_t* out);
 
   // Returns the name of the QuicRstStreamErrorCode as a char*
   static const char* StreamErrorToString(QuicRstStreamErrorCode error);
 
@@ skipping 74 matching lines @@
 inline QuicIOVector MakeIOVector(base::StringPiece str, struct iovec* iov) {
   iov->iov_base = const_cast<char*>(str.data());
   iov->iov_len = static_cast<size_t>(str.size());
   QuicIOVector quic_iov(iov, 1, str.size());
   return quic_iov;
 }
 
 }  // namespace net
 
 #endif  // NET_QUIC_CORE_QUIC_UTILS_H_