Commit 6ff7f275 authored by Yuri Chornoivan's avatar Yuri Chornoivan

Fix minor EBN issues

parent f011a9d8
Pipeline #11548 passed with stage
in 6 minutes and 43 seconds
......@@ -353,7 +353,7 @@ class CommentParserTest : public QObject
QVERIFY(line == correct);
QVERIFY(line.length() == correct.length());
//line with multiple comments wierd but legal c/c++
//line with multiple comments weird but legal c/c++
test = DefaultCommentParser();
line = QLatin1String(" int /*why?*/ i = 8 / 8 * 3;/* comment*/");
correct = QLatin1String(" int i = 8 / 8 * 3; ");
......
......@@ -230,7 +230,7 @@ class Diff3Line
const LineData* getLineData(e_SrcSelector src) const
{
Q_ASSERT(m_pDiffBufferInfo != nullptr);
//Use at here not [] to avoid using really wierd syntax
//Use at here not [] to avoid using really weird syntax
if(src == A && lineA.isValid()) return &m_pDiffBufferInfo->getLineData(src)->at(lineA);
if(src == B && lineB.isValid()) return &m_pDiffBufferInfo->getLineData(src)->at(lineB);
if(src == C && lineC.isValid()) return &m_pDiffBufferInfo->getLineData(src)->at(lineC);
......
......@@ -490,7 +490,7 @@ void GnuDiff::find_identical_ends(file_data filevec[])
/* If 1 < k, then (2**k - prime_offset[k]) is the largest prime less
than 2**k. This table is derived from Chris K. Caldwell's list
<http://www.utm.edu/research/primes/lists/2small/>. */
<https://www.utm.edu/research/primes/lists/2small/>. */
static unsigned char const prime_offset[] =
{
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment