Robot: Remove trailing spaces.

CPPLINT.cfg

@@ -2,9 +2,9 @@
 set noparent
 
 # Disable a warning about C++ features that were not in the original
-# C++11 specification (and so might not be well-supported).  
+# C++11 specification (and so might not be well-supported).
 filter=-build/c++11
 
-# Disable header_guard warning 
+# Disable header_guard warning
 # Consider using #pragma once instead
 filter=-build/header_guard

cyber/conf/example_sched_classic.conf

@@ -34,7 +34,7 @@ scheduler_conf {
         ]
       },{
         name: "group2"
-        processor_num: 16 
+        processor_num: 16
         affinity: "1to1"
         cpuset: "8-15,24-31"
         processor_policy: "SCHED_OTHER"

cyber/doxy-docs/build_doxy_sphinx.sh

 rm -rf xml/*
 doxygen Doxyfile
-rm -rf build/* 
+rm -rf build/*
 sphinx-build -b html -d build/doctrees source build/html

cyber/doxy-docs/source/api/cppapi.rst

@@ -5,7 +5,7 @@ Defined in ``cyber/node/node.h``
 
 .. doxygenclass:: apollo::cyber::Node
    :members:
-   :project: Cyber RT Documents 
+   :project: Cyber RT Documents
 
 
 cyber/node/reader_base.h

cyber/doxy-docs/source/index.rst

@@ -4,8 +4,8 @@ Introduction
 =============
 
 
-Apollo's Cyber RT is an open source runtime framework designed specifically 
-for autonomous driving scenarios. Based on a centralized computing model, 
+Apollo's Cyber RT is an open source runtime framework designed specifically
+for autonomous driving scenarios. Based on a centralized computing model,
 it is highly optimized for performance, latency, and data throughput.
 
 
@@ -20,7 +20,7 @@ it is highly optimized for performance, latency, and data throughput.
 .. toctree::
    :caption: TUTORIALS
    :maxdepth: 2
-   
+
    cyberrt_api_for_developers
    python_api_tutorial
    cyberrt_developer_tools

cyber/examples/timer_component_example/timer.dag

@@ -6,5 +6,5 @@ module_config {
             name : "timer"
             interval : 10
         }
-    }    
+    }
 }

docker/build/cyber.x86_64.dockerfile

@@ -44,18 +44,18 @@ RUN apt update -y && \
     libopenni-dev \
     libopenni2-0 \
     libopenni2-dev \
-    software-properties-common 
+    software-properties-common
     #rm -fr /var/lib/apt/lists/*
 
 #install gcc 4.8.5
-RUN rm -f /usr/bin/gcc 
-RUN ln -s /usr/bin/gcc-4.8 /etc/alternatives/gcc 
+RUN rm -f /usr/bin/gcc
+RUN ln -s /usr/bin/gcc-4.8 /etc/alternatives/gcc
 RUN ln -s /etc/alternatives/gcc /usr/bin/gcc
 RUN rm -f /usr/bin/g++
 RUN ln -s /usr/bin/g++-4.8 /etc/alternatives/g++
 RUN ln -s /etc/alternatives/g++ /usr/bin/g++
 
-# Run installer 
+# Run installer
 COPY installers /tmp/installers
 RUN bash /tmp/installers/install_bazel.sh
 RUN bash /tmp/installers/install_gflags_glog.sh
@@ -64,7 +64,7 @@ RUN bash /tmp/installers/install_bazel_packages.sh
 RUN bash /tmp/installers/install_google_styleguide.sh
 RUN bash /tmp/installers/install_osqp.sh
 
-# Add Bionic source    
+# Add Bionic source
 RUN echo "deb http://us.archive.ubuntu.com/ubuntu/ bionic main restricted" > /etc/apt/sources.list
 RUN echo "deb http://us.archive.ubuntu.com/ubuntu/ bionic-updates main restricted" >> /etc/apt/sources.list
 RUN echo "deb http://us.archive.ubuntu.com/ubuntu/ bionic universe" >> /etc/apt/sources.list
@@ -78,7 +78,7 @@ RUN echo "deb http://security.ubuntu.com/ubuntu bionic-security multiverse" >> /
 #add Trusty universe into apt source for Poco foundation 9
 RUN echo "deb http://dk.archive.ubuntu.com/ubuntu/ trusty main" >> /etc/apt/sources.list
 RUN echo "deb http://dk.archive.ubuntu.com/ubuntu/ trusty universe" >> /etc/apt/sources.list
-RUN apt update -y 
+RUN apt update -y
 RUN apt install -y --allow-downgrades \
     libboost-system1.54.0 \
     libboost-thread1.54.0 \
@@ -96,10 +96,10 @@ RUN apt install -y --allow-downgrades \
     libvtk6-dev \
     libvtk6.3 \
     vtk6 \
-    libpocofoundation9 
+    libpocofoundation9
 RUN rm -f /usr/lib/libPocoFoundation.so
 RUN ln -s /usr/lib/libPocoFoundation.so.9 /usr/lib/libPocoFoundation.so
-RUN ln -s /usr/lib/x86_64-linux-gnu/libboost_filesystem.so.1.54.0 /usr/lib/x86_64-linux-gnu/libboost_filesystem.so 
+RUN ln -s /usr/lib/x86_64-linux-gnu/libboost_filesystem.so.1.54.0 /usr/lib/x86_64-linux-gnu/libboost_filesystem.so
 RUN ln -s /usr/lib/x86_64-linux-gnu/libboost_iostreams.so.1.54.0 /usr/lib/x86_64-linux-gnu/libboost_iostreams.so
 RUN ln -s /usr/lib/x86_64-linux-gnu/libboost_date_time.so.1.65.1 /usr/lib/x86_64-linux-gnu/libboost_date_time.so
 RUN ln -s /usr/lib/x86_64-linux-gnu/libboost_regex.so.1.65.1 /usr/lib/x86_64-linux-gnu/libboost_regex.so
@@ -107,7 +107,7 @@ RUN ln -s /usr/lib/x86_64-linux-gnu/libboost_serialization.so.1.65.1 /usr/lib/x8
 RUN ln -s /usr/lib/x86_64-linux-gnu/libboost_signals.so.1.54.0 /usr/lib/x86_64-linux-gnu/libboost_signals.so
 RUN ln -s /usr/lib/x86_64-linux-gnu/libboost_system.so.1.54.0 /usr/lib/x86_64-linux-gnu/libboost_system.so
 RUN ln -s /usr/lib/x86_64-linux-gnu/libboost_thread.so.1.54.0 /usr/lib/x86_64-linux-gnu/libboost_thread.so
-RUN ln -s /usr/lib/x86_64-linux-gnu/libboost_wserialization.so.1.65.1 /usr/lib/x86_64-linux-gnu/libboost_wserialization.so 
+RUN ln -s /usr/lib/x86_64-linux-gnu/libboost_wserialization.so.1.65.1 /usr/lib/x86_64-linux-gnu/libboost_wserialization.so
 RUN ln -s /usr/lib/x86_64-linux-gnu/libboost_chrono.so.1.54.0 /usr/lib/x86_64-linux-gnu/libboost_chrono.so
 RUN ln -s /usr/lib/python2.7/dist-packages/vtk/libvtkRenderingPythonTkWidgets.x86_64-linux-gnu.so /usr/lib/x86_64-linux-gnu/libvtkRenderingPythonTkWidgets.so
 

docker/scripts/README.md

@@ -47,7 +47,7 @@ bash docker/scripts/dev_into.sh
 The scripts to build the dev-image are also available at docker/build.
 
 ```
-Note: 
+Note:
 Within the scripts in this directory, only standard tools that are expected to be available in most Linux distributions should be used (e.g., don't use realpath).
 ```
 

modules/bridge/README.md

@@ -2,4 +2,4 @@
 
 ## Introduction
   This module provides a way for other Apollo modules interactiving with process outside of Apollo by socket.
-  It includes sender and receiver components.  
+  It includes sender and receiver components.

modules/dreamview/frontend/dist/fonts/droid/README.txt

@@ -3,9 +3,9 @@ Copyright (C) 2008 The Android Open Source Project
 Licensed under the Apache License, Version 2.0 (the "License");
 you may not use this file except in compliance with the License.
 You may obtain a copy of the License at
-  
+
      http://www.apache.org/licenses/LICENSE-2.0
-  
+
 Unless required by applicable law or agreed to in writing, software
 distributed under the License is distributed on an "AS IS" BASIS,
 WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.

modules/map/relative_map/conf/relative_map_config.pb.txt

@@ -8,12 +8,12 @@ navigation_lane {
   min_lane_marker_quality: 0.49
   lane_source: OFFLINE_GENERATED
   max_len_from_navigation_line: 250.0
-  min_len_for_navigation_lane: 150.0 
-  max_len_for_navigation_lane: 250.0 
-  ratio_navigation_lane_len_to_speed: 8.0 
-  max_distance_to_navigation_line: 15.0 
-  min_view_range_to_use_lane_marker: 0.5 
-  min_lane_half_width: 1.5 
-  max_lane_half_width: 2.0 
+  min_len_for_navigation_lane: 150.0
+  max_len_for_navigation_lane: 250.0
+  ratio_navigation_lane_len_to_speed: 8.0
+  max_distance_to_navigation_line: 15.0
+  min_view_range_to_use_lane_marker: 0.5
+  min_lane_half_width: 1.5
+  max_lane_half_width: 2.0
   lane_marker_weight: 0.1
 }

modules/perception/camera/tools/obstacle_detection/params/onsemi_narrow_intrinsics.yaml

-header: 
+header:
   seq: 0
-  stamp: 
+  stamp:
     secs: 0
     nsecs:         0
   frame_id: ''
@@ -13,7 +13,7 @@ R: [1.0, 0.0, 0.0, 0.0, 1.0, 0.0, 0.0, 0.0, 1.0]
 P: [3959.330322265625, 0.0, 1006.3580938468367, 0.0, 0.0, 4047.7431640625, 739.5585368267493, 0.0, 0.0, 0.0, 1.0, 0.0]
 binning_x: 0
 binning_y: 0
-roi: 
+roi:
   x_offset: 0
   y_offset: 0
   height: 0

modules/perception/common/graph/hungarian_optimizer.inl

@@ -44,8 +44,8 @@ HungarianOptimizer<T>::HungarianOptimizer(int max_optimization_size)
   uncov_col_.reserve(max_optimization_size);
 }
 
-/* Find an assignment which maximizes the overall costs. 
- * Return an array of pairs of integers. Each pair (i, j) corresponds to 
+/* Find an assignment which maximizes the overall costs.
+ * Return an array of pairs of integers. Each pair (i, j) corresponds to
  * assigning agent i to task j. */
 template <typename T>
 void HungarianOptimizer<T>::Maximize(
@@ -61,8 +61,8 @@ void HungarianOptimizer<T>::Maximize(
   Minimize(assignments);
 }
 
-/* Find an assignment which minimizes the overall costs. 
- * Return an array of pairs of integers. Each pair (i, j) corresponds to 
+/* Find an assignment which minimizes the overall costs.
+ * Return an array of pairs of integers. Each pair (i, j) corresponds to
  * assigning agent i to task j. */
 template <typename T>
 void HungarianOptimizer<T>::Minimize(
@@ -88,8 +88,8 @@ void HungarianOptimizer<T>::OptimizationInit() {
   matrix_size_ = std::max(height_, width_);
   max_cost_ = 0;
 
-  /* generate the expanded cost matrix by adding extra 0s in order to make a 
-   * square matrix. Meanwhile, find the max cost in the matrix. It may be used 
+  /* generate the expanded cost matrix by adding extra 0s in order to make a
+   * square matrix. Meanwhile, find the max cost in the matrix. It may be used
    * later, if we want to maximizing rather than minimizing the overall costs.*/
   costs_.resize(matrix_size_, matrix_size_);
   for (size_t row = 0; row < matrix_size_; ++row) {
@@ -450,10 +450,10 @@ void HungarianOptimizer<T>::MakeAugmentingPath() {
    * and terminates if we reach a primed zero in a column with no star, our
    * path_ must either contain matrix_size_ or fewer stars (in which case the
    * loop iterates fewer than matrix_size_ times), or it contains more.  In
-   * that case, because (1) implies that there are fewer than matrix_size_ 
-   * stars, we must have visited at least one star more than once. Consider 
+   * that case, because (1) implies that there are fewer than matrix_size_
+   * stars, we must have visited at least one star more than once. Consider
    * the first such star that we visit more than once; it must have been reached
-   * immediately after visiting a prime in the same row.  By (2), this prime 
+   * immediately after visiting a prime in the same row.  By (2), this prime
    * is unique and so must have also been visited more than once.
    * Therefore, that prime must be in the same column as a star that has been
    * visited more than once, contradicting the assumption that we chose the
@@ -499,7 +499,7 @@ void HungarianOptimizer<T>::MakeAugmentingPath() {
 }
 
 /* Step 6:
- * Add the smallest uncovered value in the matrix to every element of each 
+ * Add the smallest uncovered value in the matrix to every element of each
  * covered row, and subtract it from every element of each uncovered column.
  * Return to Step 4 without altering any stars, primes, or covered lines. */
 template <typename T>

modules/perception/inference/inference_test_data/denseline_parser/deploy.prototxt

@@ -20,7 +20,7 @@ name: "lane line detection"
 #      road_num: 3
 #      center_line_mask_ratio: 0.3
 #      debug: false
-#      single_thread: false 
+#      single_thread: false
 #      label_height_reverse: true
 #  }
 #  image_data_param {
@@ -300,7 +300,7 @@ layer {
     param {
         lr_mult: 1
         decay_mult: 1
-    } 
+    }
     convolution_param {
         num_output: 64
         kernel_size: 3
@@ -348,7 +348,7 @@ layer {
     param {
         lr_mult: 1
         decay_mult: 1
-    } 
+    }
     convolution_param {
         num_output: 64
         kernel_size: 3
@@ -2259,13 +2259,13 @@ layer {
     param{
         lr_mult: 1
         decay_mult: 1
-    } 
+    }
     convolution_param {
       kernel_size: 2  # {{2 * factor _ factor % 2}}  2 * 2 _ 0
       stride: 2       # {{factor}}
-      num_output: 324 # {{C}} 
+      num_output: 324 # {{C}}
       pad: 0          # {{ceil((factor _ 1) / 2.)}} 2 _ 1 / 2
-      weight_filler: { type: "xavier" } 
+      weight_filler: { type: "xavier" }
     bias_term: false
     }
 }
@@ -2314,9 +2314,9 @@ layer {
     convolution_param {
       kernel_size: 2  # {{2 * factor _ factor % 2}}  2 * 2 _ 0
       stride: 2       # {{factor}}
-      num_output: 216 # {{C}} 
+      num_output: 216 # {{C}}
       pad: 0          # {{ceil((factor _ 1) / 2.)}} 2 _ 1 / 2
-      weight_filler: { type: "xavier" } 
+      weight_filler: { type: "xavier" }
       bias_term: false
     }
 }
@@ -2365,9 +2365,9 @@ layer {
     convolution_param {
       kernel_size: 2  # {{2 * factor _ factor % 2}}  2 * 2 _ 0
       stride: 2       # {{factor}}
-      num_output: 144 # {{C}} 
+      num_output: 144 # {{C}}
       pad: 0          # {{ceil((factor _ 1) / 2.)}} 2 _ 1 / 2
-      weight_filler: { type: "xavier" } 
+      weight_filler: { type: "xavier" }
       bias_term: false
     }
 }
@@ -2416,9 +2416,9 @@ layer {
     convolution_param {
       kernel_size: 2  # {{2 * factor _ factor % 2}}  2 * 2 _ 0
       stride: 2       # {{factor}}
-      num_output: 96 # {{C}} 
+      num_output: 96 # {{C}}
       pad: 0          # {{ceil((factor _ 1) / 2.)}} 2 _ 1 / 2
-      weight_filler: { type: "xavier" } 
+      weight_filler: { type: "xavier" }
       bias_term: false
     }
 }
@@ -2546,7 +2546,7 @@ layer {
 #    slice_point: 5
 #    slice_point: 7
 #  }
-#  
+#
 #}
 #
 #
@@ -2570,12 +2570,12 @@ layer {
 #  bottom: "label_lane"
 #  top: "label_center"
 #  top: "label_cx"
-#  top: "label_left_right" 
-#  top: "label_ignore" #road type 
+#  top: "label_left_right"
+#  top: "label_ignore" #road type
 #  slice_param {
 #      axis: 1
 #      slice_point: 1
-#      slice_point: 2 
+#      slice_point: 2
 #      slice_point: 4
 #    }
 #}

modules/perception/inference/operators/roipooling_layer.cu

@@ -19,13 +19,13 @@ committed.
 LICENSE
 
 Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions are met: 
+modification, are permitted provided that the following conditions are met:
 
 1. Redistributions of source code must retain the above copyright notice, this
-   list of conditions and the following disclaimer. 
+   list of conditions and the following disclaimer.
 2. Redistributions in binary form must reproduce the above copyright notice,
    this list of conditions and the following disclaimer in the documentation
-   and/or other materials provided with the distribution. 
+   and/or other materials provided with the distribution.
 
 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
 ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED

modules/prediction/conf/prediction_conf.pb.txt

@@ -20,7 +20,7 @@ obstacle_conf {
   predictor_type: FREE_MOVE_PREDICTOR
 }
 obstacle_conf {
-  obstacle_type: BICYCLE 
+  obstacle_type: BICYCLE
   obstacle_status: ON_LANE
   evaluator_type: CYCLIST_KEEP_LANE_EVALUATOR
   predictor_type: LANE_SEQUENCE_PREDICTOR

modules/prediction/conf/prediction_navi_conf.pb.txt

@@ -14,7 +14,7 @@ obstacle_conf {
   predictor_type: FREE_MOVE_PREDICTOR
 }
 obstacle_conf {
-  obstacle_type: BICYCLE 
+  obstacle_type: BICYCLE
   obstacle_status: ON_LANE
   evaluator_type: COST_EVALUATOR
   predictor_type: SINGLE_LANE_PREDICTOR

modules/prediction/testdata/adapter_conf.pb.txt

 config {
-  type: PERCEPTION_OBSTACLES 
+  type: PERCEPTION_OBSTACLES
   mode: RECEIVE_ONLY
   message_history_limit: 1
 }

scripts/recover_gcc.sh

-sudo update-alternatives --remove-all gcc 
+sudo update-alternatives --remove-all gcc
 sudo update-alternatives --remove-all g++
 
 sudo update-alternatives --install /usr/bin/gcc gcc /usr/bin/gcc-4.8 50