Teuchos_MatrixMarket_split.cpp

// @HEADER
// ***********************************************************************
//
//          Tpetra: Templated Linear Algebra Services Package
//                 Copyright (2008) Sandia Corporation
//
// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
// the U.S. Government retains certain rights in this software.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// 1. Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//
// 2. 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.
//
// 3. Neither the name of the Corporation nor the names of the
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "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 SANDIA CORPORATION OR THE
// 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.
//
// Questions? Contact Michael A. Heroux (maherou@sandia.gov)
//
// ************************************************************************
// @HEADER

#include "Teuchos_MatrixMarket_split.hpp"
#include <algorithm>
#include <cctype> // tolower
#include <utility> // std::pair


namespace Teuchos {
  namespace MatrixMarket {
    namespace details {

      std::string
      trim (const std::string& in)
      {
        size_t start = in.find_first_not_of(" \t");
        size_t end = in.find_last_not_of(" \t");
        if (start == std::string::npos)
          return std::string("");
        else
          return in.substr (start, end-start+1);
      }

      std::string
      lowercase (const std::string& in)
      {
        std::string out (in);
        std::transform (in.begin(), in.end(), out.begin(), tolower);
        return out;
      }

      std::string
      trim_and_lowercase (const std::string& in)
      {
        std::string out = trim (in);
        std::string out2 (out);
        std::transform (out.begin(), out.end(), out2.begin(), tolower);
        return out2;
      }

      static bool
      endToken (const std::pair<size_t, size_t>& range)
      {
        return range.first == std::string::npos && range.second == std::string::npos;
      }

      static std::pair<size_t, size_t>
      nextToken (const std::string& str,
                 const std::string& delimiters,
                 const size_t start,
                 const size_t size)
      {
        using std::make_pair;
        using std::string;

        if (start >= size)
          return make_pair (string::npos, string::npos);

        // First index of a non-delimiter character
        const size_t first = str.find_first_not_of (delimiters, start);
        if (first == string::npos)
          // There are only delimiter characters left
          return make_pair (string::npos, string::npos);
        else if (first == size-1)
          // There's only one non-delimiter character left
          return make_pair (first, 1);
        else
          { // Next index of a delimiter character
            // Search for the next delimiting token from "first" (instead of
            // "start+1" as originally coded and commented out below.)
            // const size_t next = str.find_first_of (delimiters, start+1);
            const size_t next = str.find_first_of (delimiters, first);
            return make_pair (first, next - first);
          }
      }

      std::vector<std::string>
      split (const std::string& str, const std::string& delimiters, const size_t start)
      {
        size_t curStart = start;
        size_t size = str.size();
        std::vector<std::string> tokens;
        while (true) {
          std::pair<size_t, size_t> token = nextToken (str, delimiters, curStart, size);
          if (endToken (token)) {
            break;
          }
          tokens.push_back (str.substr (token.first, token.second));
          curStart = token.first + token.second;
        }
        return tokens;
      }
    } // namespace details
  } // namespace MatrixMarket
} // namespace Teuchos