QUIC - (no behavior change) s/NULL/nullptr/g in .../quic/...

net/quic/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_QUIC_UTILS_H_
 #define NET_QUIC_QUIC_UTILS_H_
 
 #include "net/base/int128.h"
@@ skipping 16 matching lines @@
   // 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* data, int len);
 
   // 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-NULL and a match is found then the index of that
+  // 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 |v| in little-endian form to |out|.
   static void SerializeUint128(uint128 v, uint8* out);
@@ skipping 42 matching lines @@
 // Utility function that returns an IOVector object wrapped around |str|.
 inline IOVector MakeIOVector(base::StringPiece str) {
   IOVector iov;
   iov.Append(const_cast<char*>(str.data()), str.size());
   return iov;
 }
 
 }  // namespace net
 
 #endif  // NET_QUIC_QUIC_UTILS_H_