// Copyright 2017 Google Inc. All Rights Reserved.

//

// Licensed under the Apache License, Version 2.0 (the "License");

// you may not use this file except in compliance with the License.

// You may obtain a copy of the License at

//

//     http://www.apache.org/licenses/LICENSE-2.0

//

// Unless required by applicable law or agreed to in writing, software

// distributed under the License is distributed on an "AS IS" BASIS,

// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.

// See the License for the specific language governing permissions and

// limitations under the License.

#ifndef NINJA_STRINGPIECE_UTIL_H_

#define NINJA_STRINGPIECE_UTIL_H_

#include <string>

#include <vector>

#include "string_piece.h"

std::vector<StringPiece> SplitStringPiece(StringPiece input, char sep);

std::string JoinStringPiece(const std::vector<StringPiece>& list, char sep);

inline char ToLowerASCII(char c) {

  return (c >= 'A' && c <= 'Z') ? (c + ('a' - 'A')) : c;

}

bool EqualsCaseInsensitiveASCII(StringPiece a, StringPiece b);

/// A comparator for StringPiece that can be used in

/// `std::map<std::string, V, StringPieceLess>` that will allow using a

/// StringPiece as a key.  Note that this compares elements of the

/// strings as `unsigned char`, which means that implementations that

/// have a signed `char` may give an unexpected (yet valid) ordering

/// when iterating through a `std::map` containing negative `char`s.

struct StringPieceLess {

  using is_transparent = void;

  bool operator()(StringPiece lhs, StringPiece rhs) const;

};

#endif  // NINJA_STRINGPIECE_UTIL_H_