1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
|
/*
* SonarQube
* Copyright (C) 2009-2016 SonarSource SA
* mailto:contact AT sonarsource DOT com
*
* This program 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 3 of the License, or (at your option) any later version.
*
* This program 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.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program; if not, write to the Free Software Foundation,
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
import _ from 'underscore';
import Backbone from 'backbone';
export default Backbone.Model.extend({
idAttribute: 'uuid',
defaults () {
return {
exist: true,
hasSource: false,
hasCoverage: false,
hasDuplications: false,
hasSCM: false,
canSeeCode: true
};
},
key () {
return this.get('key');
},
addMeta (meta) {
const source = this.get('source');
let metaIdx = 0;
let metaLine = meta[metaIdx];
source.forEach(line => {
while (metaLine != null && line.line > metaLine.line) {
metaLine = meta[++metaIdx];
}
if (metaLine != null && line.line === metaLine.line) {
_.extend(line, metaLine);
metaLine = meta[++metaIdx];
}
});
this.set({ source });
},
addDuplications (duplications) {
const source = this.get('source');
if (source != null) {
source.forEach(line => {
const lineDuplications = [];
duplications.forEach((d, i) => {
let duplicated = false;
d.blocks.forEach(b => {
if (b._ref === '1') {
const lineFrom = b.from;
const lineTo = b.from + b.size - 1;
if (line.line >= lineFrom && line.line <= lineTo) {
duplicated = true;
}
}
});
lineDuplications.push(duplicated ? i + 1 : false);
});
line.duplications = lineDuplications;
});
}
this.set({ source });
},
checkIfHasDuplications () {
const source = this.get('source');
let hasDuplications = false;
if (source != null) {
source.forEach(line => {
if (line.duplicated) {
hasDuplications = true;
}
});
}
this.set({ hasDuplications });
},
hasCoverage (source) {
return _.some(source, line => line.coverageStatus != null);
}
});
|
