correspondence_sorting.h
Go to the documentation of this file.
00001 /*
00002  * Software License Agreement (BSD License)
00003  *
00004  *  Copyright (c) 2010, Willow Garage, Inc.
00005  *  All rights reserved.
00006  *
00007  *  Redistribution and use in source and binary forms, with or without
00008  *  modification, are permitted provided that the following conditions
00009  *  are met:
00010  *
00011  *   * Redistributions of source code must retain the above copyright
00012  *     notice, this list of conditions and the following disclaimer.
00013  *   * Redistributions in binary form must reproduce the above
00014  *     copyright notice, this list of conditions and the following
00015  *     disclaimer in the documentation and/or other materials provided
00016  *     with the distribution.
00017  *   * Neither the name of Willow Garage, Inc. nor the names of its
00018  *     contributors may be used to endorse or promote products derived
00019  *     from this software without specific prior written permission.
00020  *
00021  *  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
00022  *  "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
00023  *  LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
00024  *  FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
00025  *  COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
00026  *  INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
00027  *  BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
00028  *  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
00029  *  CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
00030  *  LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
00031  *  ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
00032  *  POSSIBILITY OF SUCH DAMAGE.
00033  *
00034  *
00035  */
00036 #ifndef PCL_REGISTRATION_CORRESPONDENCE_SORTING_H_
00037 #define PCL_REGISTRATION_CORRESPONDENCE_SORTING_H_
00038 
00039 #if defined __GNUC__
00040 #  pragma GCC system_header
00041 #endif
00042 
00043 #include <pcl/registration/correspondence_types.h>
00044 
00045 namespace pcl
00046 {
00047   namespace registration
00048   {
00053     struct sortCorrespondencesByQueryIndex : public std::binary_function<pcl::Correspondence, pcl::Correspondence, bool>
00054     {
00055       bool
00056       operator()( pcl::Correspondence a, pcl::Correspondence b)
00057       {
00058         return (a.index_query < b.index_query);
00059       }
00060     };
00061 
00066     struct sortCorrespondencesByMatchIndex : public std::binary_function<pcl::Correspondence, pcl::Correspondence, bool>
00067     {
00068       bool 
00069       operator()( pcl::Correspondence a, pcl::Correspondence b)
00070       {
00071         return (a.index_match < b.index_match);
00072       }
00073     };
00074 
00079     struct sortCorrespondencesByDistance : public std::binary_function<pcl::Correspondence, pcl::Correspondence, bool>
00080     {
00081       bool 
00082       operator()( pcl::Correspondence a, pcl::Correspondence b)
00083       {
00084         return (a.distance < b.distance);
00085       }
00086     };
00087 
00092     struct sortCorrespondencesByQueryIndexAndDistance : public std::binary_function<pcl::Correspondence, pcl::Correspondence, bool>
00093     {
00094       inline bool 
00095       operator()( pcl::Correspondence a, pcl::Correspondence b)
00096       {
00097         if (a.index_query < b.index_query)
00098           return (true);
00099         else if ( (a.index_query == b.index_query) && (a.distance < b.distance) )
00100           return (true);
00101         return (false);
00102       }
00103     };
00104 
00109     struct sortCorrespondencesByMatchIndexAndDistance : public std::binary_function<pcl::Correspondence, pcl::Correspondence, bool>
00110     {
00111       inline bool 
00112       operator()( pcl::Correspondence a, pcl::Correspondence b)
00113       {
00114         if (a.index_match < b.index_match)
00115           return (true);
00116         else if ( (a.index_match == b.index_match) && (a.distance < b.distance) )
00117           return (true);
00118         return (false);
00119       }
00120     };
00121 
00122   }
00123 }
00124 
00125 #endif /* PCL_REGISTRATION_CORRESPONDENCE_SORTING_H_ */


pcl
Author(s): Open Perception
autogenerated on Mon Oct 6 2014 03:14:46