@@ -151,7 +151,7 @@ class DetectionMAPOpKernel : public framework::OpKernel<T> {
151
151
152
152
for (int n = 0 ; n < batch_size; ++n) {
153
153
std::map<int , std::vector<Box>> boxes;
154
- for (int i = label_index[n]; i < label_index[n + 1 ]; ++i) {
154
+ for (size_t i = label_index[n]; i < label_index[n + 1 ]; ++i) {
155
155
Box box (labels (i, 2 ), labels (i, 3 ), labels (i, 4 ), labels (i, 5 ));
156
156
int label = labels (i, 0 );
157
157
auto is_difficult = labels (i, 1 );
@@ -167,7 +167,7 @@ class DetectionMAPOpKernel : public framework::OpKernel<T> {
167
167
auto detect_index = detect_lod[0 ];
168
168
for (int n = 0 ; n < batch_size; ++n) {
169
169
std::map<int , std::vector<std::pair<T, Box>>> boxes;
170
- for (int i = detect_index[n]; i < detect_index[n + 1 ]; ++i) {
170
+ for (size_t i = detect_index[n]; i < detect_index[n + 1 ]; ++i) {
171
171
Box box (detect (i, 2 ), detect (i, 3 ), detect (i, 4 ), detect (i, 5 ));
172
172
int label = detect (i, 0 );
173
173
auto score = detect (i, 1 );
@@ -269,8 +269,8 @@ class DetectionMAPOpKernel : public framework::OpKernel<T> {
269
269
std::map<int , std::vector<std::pair<T, int >>>& pos) {
270
270
const T* pos_data = pos_tensor.data <T>();
271
271
auto pos_data_lod = pos_tensor.lod ();
272
- for (int i = 0 ; i < pos_data_lod.size (); ++i) {
273
- for (int j = pos_data_lod[0 ][i]; j < pos_data_lod[0 ][i + 1 ]; ++j) {
272
+ for (size_t i = 0 ; i < pos_data_lod.size (); ++i) {
273
+ for (size_t j = pos_data_lod[0 ][i]; j < pos_data_lod[0 ][i + 1 ]; ++j) {
274
274
T score = pos_data[j * 2 ];
275
275
int flag = 1 ;
276
276
if (pos_data[j * 2 + 1 ] < kEPS ) flag = 0 ;
0 commit comments