fixed C++ warning and python flake8 style

Author: liaopeiyuan

csrc/cpu/radius_cpu.cpp

@@ -15,8 +15,8 @@ torch::Tensor radius_cpu(torch::Tensor query, torch::Tensor support,
 
 	AT_DISPATCH_ALL_TYPES(query.scalar_type(), "radius_cpu", [&] {
 
-	auto data_q = query.DATA_PTR<scalar_t>();
-	auto data_s = support.DATA_PTR<scalar_t>();
+	auto data_q = query.data_ptr<scalar_t>();
+	auto data_s = support.data_ptr<scalar_t>();
 	std::vector<scalar_t> queries_stl = std::vector<scalar_t>(data_q,
 								   data_q + query.size(0)*query.size(1));
 	std::vector<scalar_t> supports_stl = std::vector<scalar_t>(data_s,
@@ -34,13 +34,7 @@ torch::Tensor radius_cpu(torch::Tensor query, torch::Tensor support,
 	out = torch::from_blob(neighbors_indices_ptr, {tsize, 2}, options=options);
 	out = out.t();
 
-	auto result = torch::zeros_like(out);
-
-	auto index = torch::tensor({0,1});
-
-	result.index_copy_(0, index, out);
-
-	return result;
+	return out.clone();
 }
 
 
@@ -49,7 +43,7 @@ void get_size_batch(const vector<long>& batch, vector<long>& res){
 	res.resize(batch[batch.size()-1]-batch[0]+1, 0);
 	long ind = batch[0];
 	long incr = 1;
-	for(int i=1; i < batch.size(); i++){
+	for(unsigned long i=1; i < batch.size(); i++){
 
 		if(batch[i] == ind)
 			incr++;
@@ -81,8 +75,7 @@ torch::Tensor batch_radius_cpu(torch::Tensor query,
 	auto options = torch::TensorOptions().dtype(torch::kLong).device(torch::kCPU);
 	int max_count = 0;
 
-	
-	AT_DISPATCH_ALL_TYPES(query.scalar_type(), "batch_radius_search", [&] {
+	AT_DISPATCH_ALL_TYPES(query.scalar_type(), "batch_radius_cpu", [&] {
 	auto data_q = query.data_ptr<scalar_t>();
 	auto data_s = support.data_ptr<scalar_t>();
 	std::vector<scalar_t> queries_stl = std::vector<scalar_t>(data_q,

csrc/cpu/utils/neighbors.cpp

@@ -127,20 +127,18 @@ int batch_nanoflann_neighbors (vector<scalar_t>& queries,
 // Initiate variables
 // ******************
 // indices
-	int i0 = 0;
+	size_t i0 = 0;
 
 // Square radius
 	const scalar_t r2 = static_cast<scalar_t>(radius*radius);
 
 	// Counting vector
-	int max_count = 0;
-	float d2;
-
+	size_t max_count = 0;
 
 	// batch index
-	long b = 0;
-	long sum_qb = 0;
-	long sum_sb = 0;
+	size_t b = 0;
+	size_t sum_qb = 0;
+	size_t sum_sb = 0;
 
 	float eps = 0.000001;
 	// Nanoflann related variables
@@ -173,16 +171,9 @@ int batch_nanoflann_neighbors (vector<scalar_t>& queries,
 	for (auto& p0 : query_pcd.pts){
 // Check if we changed batch
 
-		scalar_t query_pt[dim];
+		scalar_t* query_pt = new scalar_t[dim];
 		std::copy(p0.begin(), p0.end(), query_pt); 
 
-		/*
-		std::cout << "\n ========== \n";
-		for(int i=0; i < dim; i++)
-			std::cout << query_pt[i] << '\n';
-		std::cout << "\n ========== \n";
-		*/
-	
 		if (i0 == sum_qb + q_batches[b]){
 			sum_qb += q_batches[b];
 			sum_sb += s_batches[b];
@@ -218,7 +209,7 @@ int batch_nanoflann_neighbors (vector<scalar_t>& queries,
 	}
 // Reserve the memory
 
-	int size = 0; // total number of edges
+	size_t size = 0; // total number of edges
 	for (auto& inds_dists : all_inds_dists){
 		if(inds_dists.size() <= max_count)
 			size += inds_dists.size();
@@ -230,14 +221,14 @@ int batch_nanoflann_neighbors (vector<scalar_t>& queries,
 	sum_sb = 0;
 	sum_qb = 0;
 	b = 0;
-	int u = 0;
+	size_t u = 0;
 	for (auto& inds_dists : all_inds_dists){
 		if (i0 == sum_qb + q_batches[b]){
 			sum_qb += q_batches[b];
 			sum_sb += s_batches[b];
 			b++;
 		}
-		for (int j = 0; j < max_count; j++){
+		for (size_t j = 0; j < max_count; j++){
 			if (j < inds_dists.size()){
 				neighbors_indices[u] = inds_dists[j].first + sum_sb;
 				neighbors_indices[u + 1] = i0;