https://bugs.kde.org/show_bug.cgi?id=378442
--- Comment #7 from Petros <petross...@gmail.com> ---
(In reply to Kevin Funk from comment #6)
> Please provide an exact way to reproduce this: e.g. file contents
> before/after.
>
> Reduce the test case as much as possible.
Before...
// Each new term in the Fibonacci sequence is generated by adding the previous
two terms.
//By starting with 1 and 2, the first 10 terms will be:
//1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
//By considering the terms in the Fibonacci sequence whose values do not exceed
four million,
//find the sum of the even-valued terms
#include "headers/eul_2_facilities.h"
int main ( int argc, char** argv ) {
vector<int> v{0, 1};
return ( 0 );
}
After that, just remove *any* comment, with Background Parser enabled.
--
You are receiving this mail because:
You are watching all bug changes.
