84 lines
3.4 KiB
C++
84 lines
3.4 KiB
C++
// Protocol Buffers - Google's data interchange format
|
|
// Copyright 2012 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.
|
|
|
|
// from google3/base/stringprintf.h
|
|
//
|
|
// Printf variants that place their output in a C++ string.
|
|
//
|
|
// Usage:
|
|
// string result = StringPrintf("%d %s\n", 10, "hello");
|
|
// SStringPrintf(&result, "%d %s\n", 10, "hello");
|
|
// StringAppendF(&result, "%d %s\n", 20, "there");
|
|
|
|
#ifndef GOOGLE_PROTOBUF_STUBS_STRINGPRINTF_H
|
|
#define GOOGLE_PROTOBUF_STUBS_STRINGPRINTF_H
|
|
|
|
#include <stdarg.h>
|
|
#include <string>
|
|
#include <vector>
|
|
|
|
#include <google/protobuf/stubs/common.h>
|
|
|
|
#include <google/protobuf/port_def.inc>
|
|
|
|
namespace google {
|
|
namespace protobuf {
|
|
|
|
// Return a C++ string
|
|
PROTOBUF_EXPORT extern string StringPrintf(const char* format, ...);
|
|
|
|
// Store result into a supplied string and return it
|
|
PROTOBUF_EXPORT extern const string& SStringPrintf(string* dst,
|
|
const char* format, ...);
|
|
|
|
// Append result to a supplied string
|
|
PROTOBUF_EXPORT extern void StringAppendF(string* dst, const char* format, ...);
|
|
|
|
// Lower-level routine that takes a va_list and appends to a specified
|
|
// string. All other routines are just convenience wrappers around it.
|
|
PROTOBUF_EXPORT extern void StringAppendV(string* dst, const char* format,
|
|
va_list ap);
|
|
|
|
// The max arguments supported by StringPrintfVector
|
|
PROTOBUF_EXPORT extern const int kStringPrintfVectorMaxArgs;
|
|
|
|
// You can use this version when all your arguments are strings, but
|
|
// you don't know how many arguments you'll have at compile time.
|
|
// StringPrintfVector will LOG(FATAL) if v.size() > kStringPrintfVectorMaxArgs
|
|
PROTOBUF_EXPORT extern string StringPrintfVector(const char* format,
|
|
const std::vector<string>& v);
|
|
|
|
} // namespace protobuf
|
|
} // namespace google
|
|
|
|
#include <google/protobuf/port_undef.inc>
|
|
|
|
#endif // GOOGLE_PROTOBUF_STUBS_STRINGPRINTF_H
|