chromium/third_party/protobuf/src/google/protobuf/stubs/stringpiece.cc

// Protocol Buffers - Google's data interchange format
// Copyright 2008 Google Inc.  All rights reserved.
// https://developers.google.com/protocol-buffers/
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
//     * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//     * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
//     * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#include <google/protobuf/stubs/stringpiece.h>

#include <string.h>
#include <algorithm>
#include <climits>
#include <string>
#include <ostream>

#include <google/protobuf/stubs/logging.h>

namespace google {
namespace protobuf {
namespace stringpiece_internal {

std::ostream& operator<<(std::ostream& o, StringPiece piece) { … }

void StringPiece::LogFatalSizeTooBig(size_t size, const char* details) { … }

void StringPiece::CopyToString(std::string* target) const { … }

void StringPiece::AppendToString(std::string* target) const { … }

bool StringPiece::Consume(StringPiece x) { … }

bool StringPiece::ConsumeFromEnd(StringPiece x) { … }

StringPiece::size_type StringPiece::copy(char* buf, size_type n,
                                         size_type pos) const { … }

bool StringPiece::contains(StringPiece s) const { … }

StringPiece::size_type StringPiece::find(StringPiece s, size_type pos) const { … }

StringPiece::size_type StringPiece::find(char c, size_type pos) const { … }

StringPiece::size_type StringPiece::rfind(StringPiece s, size_type pos) const { … }

// Search range is [0..pos] inclusive.  If pos == npos, search everything.
StringPiece::size_type StringPiece::rfind(char c, size_type pos) const { … }

// For each character in characters_wanted, sets the index corresponding
// to the ASCII code of that character to 1 in table.  This is used by
// the find_.*_of methods below to tell whether or not a character is in
// the lookup table in constant time.
// The argument `table' must be an array that is large enough to hold all
// the possible values of an unsigned char.  Thus it should be be declared
// as follows:
//   bool table[UCHAR_MAX + 1]
static inline void BuildLookupTable(StringPiece characters_wanted,
                                    bool* table) { … }

StringPiece::size_type StringPiece::find_first_of(StringPiece s,
                                                  size_type pos) const { … }

StringPiece::size_type StringPiece::find_first_not_of(StringPiece s,
                                                      size_type pos) const { … }

StringPiece::size_type StringPiece::find_first_not_of(char c,
                                                      size_type pos) const { … }

StringPiece::size_type StringPiece::find_last_of(StringPiece s,
                                                 size_type pos) const { … }

StringPiece::size_type StringPiece::find_last_not_of(StringPiece s,
                                                     size_type pos) const { … }

StringPiece::size_type StringPiece::find_last_not_of(char c,
                                                     size_type pos) const { … }

StringPiece StringPiece::substr(size_type pos, size_type n) const { … }

const StringPiece::size_type StringPiece::npos = …;

}  // namespace stringpiece_internal
}  // namespace protobuf
}  // namespace google