@@ -85,7 +85,7 @@ static inline void GetMaxScoreIndex(
85
85
std::stable_sort (sorted_indices->begin (), sorted_indices->end (),
86
86
SortScorePairDescend<int >);
87
87
// Keep top_k scores if needed.
88
- if (top_k > -1 && top_k < sorted_indices->size ()) {
88
+ if (top_k > -1 && top_k < static_cast < int >( sorted_indices->size () )) {
89
89
sorted_indices->resize (top_k);
90
90
}
91
91
}
@@ -151,7 +151,7 @@ class MultiClassNMSKernel : public framework::OpKernel<T> {
151
151
while (sorted_indices.size () != 0 ) {
152
152
const int idx = sorted_indices.front ().second ;
153
153
bool keep = true ;
154
- for (int k = 0 ; k < selected_indices->size (); ++k) {
154
+ for (size_t k = 0 ; k < selected_indices->size (); ++k) {
155
155
if (keep) {
156
156
const int kept_idx = (*selected_indices)[k];
157
157
T overlap = JaccardOverlap<T>(bbox_data + idx * box_size,
@@ -201,7 +201,7 @@ class MultiClassNMSKernel : public framework::OpKernel<T> {
201
201
int label = it.first ;
202
202
const T* sdata = scores_data + label * predict_dim;
203
203
const std::vector<int >& label_indices = it.second ;
204
- for (int j = 0 ; j < label_indices.size (); ++j) {
204
+ for (size_t j = 0 ; j < label_indices.size (); ++j) {
205
205
int idx = label_indices[j];
206
206
PADDLE_ENFORCE_LT (idx, predict_dim);
207
207
score_index_pairs.push_back (
@@ -215,7 +215,7 @@ class MultiClassNMSKernel : public framework::OpKernel<T> {
215
215
216
216
// Store the new indices.
217
217
std::map<int , std::vector<int >> new_indices;
218
- for (int j = 0 ; j < score_index_pairs.size (); ++j) {
218
+ for (size_t j = 0 ; j < score_index_pairs.size (); ++j) {
219
219
int label = score_index_pairs[j].second .first ;
220
220
int idx = score_index_pairs[j].second .second ;
221
221
new_indices[label].push_back (idx);
@@ -238,7 +238,7 @@ class MultiClassNMSKernel : public framework::OpKernel<T> {
238
238
int label = it.first ;
239
239
const T* sdata = scores_data + label * predict_dim;
240
240
const std::vector<int >& indices = it.second ;
241
- for (int j = 0 ; j < indices.size (); ++j) {
241
+ for (size_t j = 0 ; j < indices.size (); ++j) {
242
242
int idx = indices[j];
243
243
const T* bdata = bboxes_data + idx * kBBoxSize ;
244
244
odata[count * kOutputDim ] = label; // label
0 commit comments