Skip to content

Commit 55fe002

Browse files
authored
Merge pull request #889 from Panquesito7/lgtm_fixes
fix: Various LGTM fixes
2 parents 26ffe8c + 0767af4 commit 55fe002

File tree

3 files changed

+8
-8
lines changed

3 files changed

+8
-8
lines changed

data_structures/binary_search_tree.cpp

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -14,17 +14,17 @@ struct node {
1414
node *right;
1515
};
1616

17-
struct queue {
17+
struct Queue {
1818
node *t[100];
1919
int front;
2020
int rear;
2121
};
2222

23-
queue q;
23+
Queue queue;
2424

25-
void enqueue(node *n) { q.t[q.rear++] = n; }
25+
void enqueue(node *n) { queue.t[queue.rear++] = n; }
2626

27-
node *dequeue() { return (q.t[q.front++]); }
27+
node *dequeue() { return (queue.t[queue.front++]); }
2828

2929
void Insert(node *n, int x) {
3030
if (x < n->val) {
@@ -123,8 +123,8 @@ void Post(node *n) {
123123
}
124124

125125
int main() {
126-
q.front = 0;
127-
q.rear = 0;
126+
queue.front = 0;
127+
queue.rear = 0;
128128
int value;
129129
int ch;
130130
node *root = new node;

math/realtime_stats.cpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -35,7 +35,7 @@ class stats_computer1 {
3535
n++;
3636
T tmp = x - K;
3737
Ex += tmp;
38-
Ex2 += tmp * tmp;
38+
Ex2 += static_cast<double>(tmp) * tmp;
3939
}
4040

4141
/** return sample mean computed till last sample */

sorting/bead_sort.cpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -14,7 +14,7 @@ void beadSort(int *a, int len) {
1414

1515
// allocating memory
1616
unsigned char *beads = new unsigned char[max * len];
17-
memset(beads, 0, max * len);
17+
memset(beads, 0, static_cast<size_t>(max) * len);
1818

1919
// mark the beads
2020
for (int i = 0; i < len; i++)

0 commit comments

Comments
 (0)