/*
+ * This file is part of the GROMACS molecular simulation package.
*
- * This source code is part of
+ * Copyright (c) 2011,2012,2013,2014, by the GROMACS development team, led by
+ * Mark Abraham, David van der Spoel, Berk Hess, and Erik Lindahl,
+ * and including many others, as listed in the AUTHORS file in the
+ * top-level source directory and at http://www.gromacs.org.
*
- * G R O M A C S
- *
- * GROningen MAchine for Chemical Simulations
+ * GROMACS is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public License
+ * as published by the Free Software Foundation; either version 2.1
+ * of the License, or (at your option) any later version.
*
- * Written by David van der Spoel, Erik Lindahl, Berk Hess, and others.
- * Copyright (c) 1991-2000, University of Groningen, The Netherlands.
- * Copyright (c) 2001-2009, The GROMACS development team,
- * check out http://www.gromacs.org for more information.
+ * GROMACS is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ * Lesser General Public License for more details.
*
- * This program is free software; you can redistribute it and/or
- * modify it under the terms of the GNU General Public License
- * as published by the Free Software Foundation; either version 2
- * of the License, or (at your option) any later version.
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with GROMACS; if not, see
+ * http://www.gnu.org/licenses, or write to the Free Software Foundation,
+ * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*
- * If you want to redistribute modifications, please consider that
- * scientific software is very special. Version control is crucial -
- * bugs must be traceable. We will be happy to consider code for
- * inclusion in the official distribution, but derived work must not
- * be called official GROMACS. Details are found in the README & COPYING
- * files - if they are missing, get the official version at www.gromacs.org.
+ * If you want to redistribute modifications to GROMACS, please
+ * consider that scientific software is very special. Version
+ * control is crucial - bugs must be traceable. We will be happy to
+ * consider code for inclusion in the official distribution, but
+ * derived work must not be called official GROMACS. Details are found
+ * in the README & COPYING files - if they are missing, get the
+ * official version at http://www.gromacs.org.
*
* To help us fund GROMACS development, we humbly ask that you cite
- * the papers on the package - you can find them in the top README file.
- *
- * For more info, check our website at http://www.gromacs.org
+ * the research papers on the package. Check out http://www.gromacs.org.
*/
/*! \internal \file
* \brief
* Implements functions and classes in stringutil.h.
*
- * \author Teemu Murtola <teemu.murtola@cbr.su.se>
+ * \author Teemu Murtola <teemu.murtola@gmail.com>
* \ingroup module_utility
*/
+#include "gmxpre.h"
+
#include "stringutil.h"
#include <cctype>
-#include <cstdio>
#include <cstdarg>
+#include <cstdio>
#include <cstring>
#include <algorithm>
return str;
}
+std::string stripString(const std::string &str)
+{
+ std::string::const_iterator start = str.begin();
+ std::string::const_iterator end = str.end();
+ while (start != end && std::isspace(*start))
+ {
+ ++start;
+ }
+ while (start != end && std::isspace(*(end - 1)))
+ {
+ --end;
+ }
+ return std::string(start, end);
+}
+
std::string formatString(const char *fmt, ...)
{
- va_list ap;
- char staticBuf[1024];
- int length = 1024;
+ va_list ap;
+ char staticBuf[1024];
+ int length = 1024;
std::vector<char> dynamicBuf;
- char *buf = staticBuf;
+ char *buf = staticBuf;
// TODO: There may be a better way of doing this on Windows, Microsoft
// provides their own way of doing things...
}
}
+std::vector<std::string> splitString(const std::string &str)
+{
+ std::vector<std::string> result;
+ std::string::const_iterator currPos = str.begin();
+ const std::string::const_iterator end = str.end();
+ while (currPos != end)
+ {
+ while (currPos != end && std::isspace(*currPos))
+ {
+ ++currPos;
+ }
+ const std::string::const_iterator startPos = currPos;
+ while (currPos != end && !std::isspace(*currPos))
+ {
+ ++currPos;
+ }
+ if (startPos != end)
+ {
+ result.push_back(std::string(startPos, currPos));
+ }
+ }
+ return result;
+}
+
std::string concatenateStrings(const char *const *sarray, size_t count)
{
std::string result;
namespace
{
+/*! \brief
+ * Helper function to identify word boundaries for replaceAllWords().
+ *
+ * \returns `true` if the character is considered part of a word.
+ *
+ * \ingroup module_utility
+ */
+bool isWordChar(char c)
+{
+ return std::isalnum(c) || c == '-' || c == '_';
+}
+
/*! \brief
* Common implementation for string replacement functions.
*
* \param[in] bWholeWords Whether to only consider matches to whole words.
* \returns \p input with all occurrences of \p from replaced with \p to.
* \throws std::bad_alloc if out of memory.
+ *
+ * \ingroup module_utility
*/
std::string
replaceInternal(const std::string &input, const char *from, const char *to,
{
GMX_RELEASE_ASSERT(from != NULL && to != NULL,
"Replacement strings must not be NULL");
- size_t matchLength = std::strlen(from);
+ size_t matchLength = std::strlen(from);
std::string result;
- size_t inputPos = 0;
- size_t matchPos = input.find(from);
+ size_t inputPos = 0;
+ size_t matchPos = input.find(from);
while (matchPos < input.length())
{
size_t matchEnd = matchPos + matchLength;
if (bWholeWords)
{
- if (!((matchPos == 0 || !std::isalnum(input[matchPos-1]))
- && (matchEnd == input.length() || !std::isalnum(input[matchEnd]))))
+ if (!((matchPos == 0 || !isWordChar(input[matchPos-1]))
+ && (matchEnd == input.length() || !isWordChar(input[matchEnd]))))
{
matchPos = input.find(from, matchPos + 1);
continue;
return result;
}
-} // namespace
+} // namespace
std::string
replaceAll(const std::string &input, const char *from, const char *to)
return replaceInternal(input, from, to, false);
}
+std::string
+replaceAll(const std::string &input, const std::string &from,
+ const std::string &to)
+{
+ return replaceInternal(input, from.c_str(), to.c_str(), false);
+}
+
std::string
replaceAllWords(const std::string &input, const char *from, const char *to)
{
return replaceInternal(input, from, to, true);
}
+std::string
+replaceAllWords(const std::string &input, const std::string &from,
+ const std::string &to)
+{
+ return replaceInternal(input, from.c_str(), to.c_str(), true);
+}
+
/********************************************************************
* TextLineWrapperSettings
TextLineWrapper::findNextLine(const char *input, size_t lineStart) const
{
size_t inputLength = std::strlen(input);
- bool bFirstLine = (lineStart == 0 || input[lineStart - 1] == '\n');
+ bool bFirstLine = (lineStart == 0 || input[lineStart - 1] == '\n');
// Ignore leading whitespace if necessary.
if (!bFirstLine || settings_.bStripLeadingWhitespace_)
{
}
}
- int indent = (bFirstLine ? settings_.firstLineIndent() : settings_.indent());
+ int indent = (bFirstLine ? settings_.firstLineIndent() : settings_.indent());
size_t lastAllowedBreakPoint
= (settings_.lineLength() > 0
? std::min(lineStart + settings_.lineLength() - indent, inputLength)
do
{
const char *nextBreakPtr = std::strpbrk(input + lineEnd, " \n");
- size_t nextBreak
+ size_t nextBreak
= (nextBreakPtr != NULL ? nextBreakPtr - input : inputLength);
if (nextBreak > lastAllowedBreakPoint && lineEnd > lineStart)
{
size_t lineStart, size_t lineEnd) const
{
size_t inputLength = input.length();
- bool bFirstLine = (lineStart == 0 || input[lineStart - 1] == '\n');
+ bool bFirstLine = (lineStart == 0 || input[lineStart - 1] == '\n');
// Strip leading whitespace if necessary.
if (!bFirstLine || settings_.bStripLeadingWhitespace_)
{
return std::string();
}
}
- int indent = (bFirstLine ? settings_.firstLineIndent() : settings_.indent());
+ int indent = (bFirstLine ? settings_.firstLineIndent() : settings_.indent());
bool bContinuation = (lineEnd < inputLength && input[lineEnd - 1] != '\n');
// Strip trailing whitespace.
while (lineEnd > lineStart && std::isspace(input[lineEnd - 1]))
--lineEnd;
}
- size_t lineLength = lineEnd - lineStart;
+ size_t lineLength = lineEnd - lineStart;
std::string result(indent, ' ');
result.append(input, lineStart, lineLength);
if (bContinuation && settings_.continuationChar_ != '\0')
TextLineWrapper::wrapToString(const std::string &input) const
{
std::string result;
- size_t lineStart = 0;
- size_t length = input.length();
+ size_t lineStart = 0;
+ size_t length = input.length();
while (lineStart < length)
{
size_t nextLineStart = findNextLine(input, lineStart);
TextLineWrapper::wrapToVector(const std::string &input) const
{
std::vector<std::string> result;
- size_t lineStart = 0;
- size_t length = input.length();
+ size_t lineStart = 0;
+ size_t length = input.length();
while (lineStart < length)
{
size_t nextLineStart = findNextLine(input, lineStart);
biod.pnpi.spb.ru / alexxy / gromacs.git / blobdiff