Permalink
Browse files

Misc. typos

Super trivial typos
Some are in qtools/ which I know is a 3rd party dependency but as we know is now obsolete upstream. I reckon it wouldn't be much of an issue to merge neverthless
Tacked on several more commits
  • Loading branch information...
luzpaz
luzpaz committed Dec 23, 2017
1 parent 4f45bd2 commit 9fd7f3aeb4c2e78bda669bf4ef6fff1c12c062a4
@@ -1,6 +1,6 @@
.TH DOXYPARSE "1" "DATE" "doxyparse VERSION" "User Commands"
.SH NAME
doxyparse \- parse and dumps informations about the code
doxyparse \- parse and dumps information about the code
.SH SYNOPSIS
.B doxyparse
[\fIsource file\fR...]
@@ -126,7 +126,7 @@ static void printModule(std::string module) {
printf(" %s:\n", module.c_str());
}
static void printClassInformation(std::string information) {
printf(" informations: %s\n", information.c_str());
printf(" information: %s\n", information.c_str());
}
static void printInheritance(std::string base_class) {
printf(" inherits: %s\n", base_class.c_str());
View
@@ -381,7 +381,7 @@ void QDataStream::setByteOrder( int bo )
\fn void QDataStream::setVersion( int v )
Sets the version number of the data serialization format.
In order to accomodate for new functionality, the datastream
In order to accommodate for new functionality, the datastream
serialization format of some Qt classes has changed in some versions of
Qt. If you want to read data that was created by an earlier version of
Qt, or write data that can be read by a program that was compiled with
View
@@ -52,7 +52,7 @@
The key is used for inserting and looking up an item. QDict has
\l QString keys, which are Unicode strings. If you want to use
non-Unicode, plain 8-bit \c char* keys, use the QAsciiDict template.
A QDict has the same performace as a QAsciiDict.
A QDict has the same performance as a QAsciiDict.
The dictionary has very fast insertion and lookup.
View
@@ -13670,7 +13670,7 @@ QString &QString::replace( uint index, uint len, const QString &s )
/*!
Replaces \a len characters starting at position \a index by
\a slen units ot QChar data from \a s, and returns a reference to the string.
\a slen units to QChar data from \a s, and returns a reference to the string.
\sa insert(), remove()
*/
View
@@ -488,7 +488,7 @@ static bool try_locale_list( const char * const locale[], const char * lang )
}
// For the probably_koi8_locales we have to look. the standard says
// these are 8859-5, but almsot all Russion users uses KOI8-R and
// these are 8859-5, but almost all Russian users uses KOI8-R and
// incorrectly set $LANG to ru_RU. We'll check tolower() to see what
// tolower() thinks ru_RU means.
View
@@ -139,7 +139,7 @@
In addition you can search items in the list with the find() function. It exists in a const
and a non const version. It starts searching from the beginning of the list, but another
flavor of the find() function allows you to specify where searching should start.
If you just want to know wether a certain item is at least once in the list, then you
If you just want to know whether a certain item is at least once in the list, then you
can use the contains() function.
Since QValueList is value based there is no need to care about deleting elements in the
@@ -201,7 +201,7 @@
of this list become invalidated. Since QValueList is highly tuned for performance
you wont see warnings if you use invalid iterators,
because it is impossible for
an iterator to check wether it is valid or not.
an iterator to check whether it is valid or not.
*/
/*!
@@ -258,16 +258,16 @@
/*!
\fn const T& QValueList::operator[] ( uint i ) const
Returns a const reference to the item with index \e i in the list.
It is up to you to check wether this item really exists. You can do that easily
with the count() function. However this operator does not check wether \e i
It is up to you to check whether this item really exists. You can do that easily
with the count() function. However this operator does not check whether \e i
is in range and will deliver undefined results if it does not exist.
*/
/*!
\fn T& QValueList::operator[] ( uint i )
Returns a reference to the item with index \e i in the list.
It is up to you to check wether this item really exists. You can do that easily
with the count() function. However this operator does not check wether \e i
It is up to you to check whether this item really exists. You can do that easily
with the count() function. However this operator does not check whether \e i
is in range and will deliver undefined results if it does not exist.
In contrast to the const operator[] you may manipulate the value returned by this
operator.
@@ -566,7 +566,7 @@
QValueList is highly optimized for performance and memory usage.
On the other hand that means that you have to be a bit more careful
by what you are doing. QValueList does not know about all its iterators
and the iterators dont even know to which list they belong. That makes
and the iterators don't even know to which list they belong. That makes
things fast and slim but a bit dangerous because it is up to you to make
sure that iterators you are using are still valid. QListIterator will be able
to give warnings while QValueListIterator may end up in an undefined state.
@@ -627,31 +627,31 @@
\fn QValueListIterator<T>& QValueListIterator::operator++()
Prefix ++ makes the succeeding item current and returns
an iterator pointing to the new current item.
The iterator can not check wether it reached the end of the list. Incrementing
The iterator can not check whether it reached the end of the list. Incrementing
the iterator as returned by end() causes undefined results.
*/
/*!
\fn QValueListIterator<T> QValueListIterator::operator++(int)
Postfix ++ makes the succeeding item current and returns
an iterator pointing to the new current item.
The iterator can not check wether it reached the end of the list. Incrementing
The iterator can not check whether it reached the end of the list. Incrementing
the iterator as returned by end() causes undefined results.
*/
/*!
\fn QValueListIterator<T>& QValueListIterator::operator--()
Prefix -- makes the previous item current and returns
an iterator pointing to the new current item.
The iterator can not check wether it reached the beginning of the list. Decrementing
The iterator can not check whether it reached the beginning of the list. Decrementing
the iterator as returned by begin() causes undefined results.
*/
/*!
\fn QValueListIterator<T> QValueListIterator::operator--(int)
Postfix -- makes the previous item current and returns
an iterator pointing to the new current item.
The iterator can not check wether it reached the beginning of the list. Decrementing
The iterator can not check whether it reached the beginning of the list. Decrementing
the iterator as returned by begin() causes undefined results.
*/
@@ -680,7 +680,7 @@
list. It does not allow to modify the values of the list since this would
break the const semantics.
For more informations on QValueList iterators see QValueListIterator.
For more information on QValueList iterators see QValueListIterator.
\sa QValueListIterator, QValueList
*/
@@ -733,31 +733,31 @@
\fn QValueListConstIterator<T>& QValueListConstIterator::operator++()
Prefix ++ makes the succeeding item current and returns
an iterator pointing to the new current item.
The iterator can not check wether it reached the end of the list. Incrementing
The iterator can not check whether it reached the end of the list. Incrementing
the iterator as returned by end() causes undefined results.
*/
/*!
\fn QValueListConstIterator<T> QValueListConstIterator::operator++(int)
Postfix ++ makes the succeeding item current and returns
an iterator pointing to the new current item.
The iterator can not check wether it reached the end of the list. Incrementing
The iterator can not check whether it reached the end of the list. Incrementing
the iterator as returned by end() causes undefined results.
*/
/*!
\fn QValueListConstIterator<T>& QValueListConstIterator::operator--()
Prefix -- makes the previous item current and returns
an iterator pointing to the new current item.
The iterator can not check wether it reached the beginning of the list. Decrementing
The iterator can not check whether it reached the beginning of the list. Decrementing
the iterator as returned by begin() causes undefined results.
*/
/*!
\fn QValueListConstIterator<T> QValueListConstIterator::operator--(int)
Postfix -- makes the previous item current and returns
an iterator pointing to the new current item.
The iterator can not check wether it reached the beginning of the list. Decrementing
The iterator can not check whether it reached the beginning of the list. Decrementing
the iterator as returned by begin() causes undefined results.
*/
@@ -67,7 +67,7 @@ class QWaitConditionPrivate
code = pthread_cond_wait(&cond, &mutex);
if (code == 0 && wakeups == 0)
{
// many vendors warn of spurios wakeups from
// many vendors warn of spurious wakeups from
// pthread_cond_wait(), especially after signal delivery,
// even though POSIX doesn't allow for it... sigh
continue;
View
@@ -44,7 +44,7 @@
// NOT REVISED
// Error strings for the XML reader
#define XMLERR_OK "no error occured"
#define XMLERR_OK "no error occurred"
#define XMLERR_TAGMISMATCH "tag mismatch"
#define XMLERR_UNEXPECTEDEOF "unexpected end of file"
#define XMLERR_FINISHEDPARSINGWHILENOTEOF "parsing is finished but end of file is not reached"
@@ -226,28 +226,28 @@ QString QXmlParseException::message() const
return msg;
}
/*!
Returns the column number the error occured.
Returns the column number the error occurred.
*/
int QXmlParseException::columnNumber() const
{
return column;
}
/*!
Returns the line number the error occured.
Returns the line number the error occurred.
*/
int QXmlParseException::lineNumber() const
{
return line;
}
/*!
Returns the public identifier the error occured.
Returns the public identifier the error occurred.
*/
QString QXmlParseException::publicId() const
{
return pub;
}
/*!
Returns the system identifier the error occured.
Returns the system identifier the error occurred.
*/
QString QXmlParseException::systemId() const
{
@@ -403,7 +403,7 @@ void QXmlNamespaceSupport::splitName( const QString& qname,
and looking it up among the prefixes currently declared.
First parameter is the raw XML 1.0 name to be processed. The second parameter
is a flag wheter the name is the name of an attribute (TRUE) or not (FALSE).
is a flag whether the name is the name of an attribute (TRUE) or not (FALSE).
The return values will be stored in the last two parameters as follows:
<ul>
@@ -1079,7 +1079,7 @@ void QXmlInputSource::readInput( QByteArray& rawData )
\fn bool QXmlErrorHandler::error( const QXmlParseException& exception )
A reader might use this function to report a recoverable error. A recoverable
error corresponds to the definiton of "error" in section 1.2 of the XML 1.0
error corresponds to the definition of "error" in section 1.2 of the XML 1.0
specification.
The reader must continue to provide normal parsing events after invoking this
@@ -5652,7 +5652,7 @@ bool QXmlSimpleReader::parseNmtoken()
head stands on the first character after the reference.
charDataRead is set to FALSE if the reference must be parsed. The
charachter(s) which the reference mapped to are inserted at the reference
character(s) which the reference mapped to are inserted at the reference
position. The head stands on the first character of the replacement).
*/
bool QXmlSimpleReader::parseReference( bool &charDataRead, EntityRecognitionContext context )
@@ -5943,7 +5943,7 @@ bool QXmlSimpleReader::processReference( bool &charDataRead, EntityRecognitionCo
}
} else {
// "Unparsed"
// ### notify for "Occurs as Attribute Value" missing (but this is no refence, anyway)
// ### notify for "Occurs as Attribute Value" missing (but this is no reference, anyway)
// Forbidden
d->error = XMLERR_UNPARSEDENTITYREFERENCE;
charDataRead = FALSE;
View
@@ -286,7 +286,7 @@ void CiteDict::generatePage() const
thisDir.remove(citeListFile);
thisDir.remove(doxygenBstFile);
thisDir.remove(bib2xhtmlFile);
// we might try to remove too many files as empty files didn't get a coresponding new file
// we might try to remove too many files as empty files didn't get a corresponding new file
// but the remove function does not emit an error for it and we don't catch the error return
// so no problem.
for (unsigned int j = 1; j <= citeDataList.count(); j++)
View
@@ -158,7 +158,7 @@ class ClassDefImpl
/* user defined member groups */
MemberGroupSDict *memberGroupSDict;
/*! Is this an abstact class? */
/*! Is this an abstract class? */
bool isAbstract;
/*! Is the class part of an unnamed namespace? */
View
@@ -667,7 +667,7 @@ void replaceComment(int offset);
}
}
}
/* Python an VHDL share CComment, so special attention for ending commments is required */
/* Python an VHDL share CComment, so special attention for ending comments is required */
<CComment>"\n"/[ \t]*"#" {
if (g_lang!=SrcLangExt_VHDL)
{
View
@@ -1593,7 +1593,7 @@ RCSTAG "$"{ID}":"[^\n$]+"$"
/* --------- handle arguments of the file/dir/example command ------------ */
<FileDocArg1>{DOCNL} { // no file name specfied
<FileDocArg1>{DOCNL} { // no file name specified
if (*yytext=='\n') yyLineNr++;
addOutput('\n');
BEGIN( Comment );
View
@@ -51,7 +51,7 @@ bool CondParser::parse(const char *fileName,int lineNr,const char *expr)
#if 0
// check for garbage at the end of the expression
// an expression ends with a character '\0' and token_type = delimeter
// an expression ends with a character '\0' and token_type = delimiter
if (m_tokenType!=DELIMITER || !m_token.isEmpty())
{
if (m_tokenType == DELIMITER)
@@ -84,7 +84,7 @@ bool CondParser::parse(const char *fileName,int lineNr,const char *expr)
/**
* checks if the given char c is a delimeter
* checks if the given char c is a delimiter
* minus is checked apart, can be unary minus
*/
static bool isDelimiter(const char c)
@@ -155,7 +155,7 @@ void CondParser::getToken()
return;
}
// check for operators (delimeters)
// check for operators (delimiters)
if (isDelimiter(*m_e))
{
m_tokenType = DELIMITER;
View
@@ -1644,7 +1644,7 @@ to disable this feature.
path to the <a href="http://clang.llvm.org/docs/HowToSetupToolingForLLVM.html">
compilation database</a> used when the files were built. This is equivalent to
specifying the "-p" option to a clang tool, such as clang-check. These options
will then be pased to the parser.
will then be passed to the parser.
@note The availability of this option depends on whether or not doxygen
was generated with the `-Duse-libclang=ON` option for CMake.
View
@@ -63,7 +63,7 @@ def transformDocs(doc):
doc = re.sub('<a +href="([^"]*)" *>([^<]*)</a>', '\\2 (see: \\1)', doc)
# LaTeX name as formula -> LaTeX
doc = doc.replace("\\f$\\mbox{\\LaTeX}\\f$", "LaTeX")
# Other forula's (now just 2) so explicitely mentioned.
# Other formula's (now just 2) so explicitly mentioned.
doc = doc.replace("\\f$2^{(16+\\mbox{LOOKUP\\_CACHE\\_SIZE})}\\f$",
"2^(16+LOOKUP_CACHE_SIZE)")
doc = doc.replace("\\f$2^{16} = 65536\\f$", "2^16=65536")
View
@@ -1400,7 +1400,7 @@ class DefinitionContext
inst.addProperty("isLinkable",&DefinitionContext::isLinkable);
//%% bool isLinkableInProject: can the symbol be linked within this project?
inst.addProperty("isLinkableInProject",&DefinitionContext::isLinkableInProject);
//%% int dynSectionId: identifier that can be used for collapsable sections
//%% int dynSectionId: identifier that can be used for collapsible sections
inst.addProperty("dynSectionId",&DefinitionContext::dynSectionId);
//%% string language: the programming language in which the symbol is written
inst.addProperty("language",&DefinitionContext::language);
View
@@ -8403,7 +8403,7 @@ static void flushUnresolvedRelations()
// This is needed before resolving the inheritance relations, since
// it would otherwise not find the inheritance relation
// for C in the example below, as B::I was already found to be unresolvable
// (which is correct if you igore the inheritance relation between A and B).
// (which is correct if you ignore the inheritance relation between A and B).
//
// class A { class I {} };
// class B : public A {};
View
@@ -1,6 +1,6 @@
/******************************************************************************
*
* Parser for syntax hightlighting and references for Fortran90 F subset
* Parser for syntax highlighting and references for Fortran90 F subset
*
* Copyright (C) by Anke Visser
* based on the work of Dimitri van Heesch.
Oops, something went wrong.

0 comments on commit 9fd7f3a

Please sign in to comment.