Rinex3NavFilterOperators.hpp

Go to the documentation of this file.

//==============================================================================
//
//  This file is part of GNSSTk, the ARL:UT GNSS Toolkit.
//
//  The GNSSTk is free software; you can redistribute it and/or modify
//  it under the terms of the GNU Lesser General Public License as published
//  by the Free Software Foundation; either version 3.0 of the License, or
//  any later version.
//
//  The GNSSTk is distributed in the hope that it will be useful,
//  but WITHOUT ANY WARRANTY; without even the implied warranty of
//  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
//  GNU Lesser General Public License for more details.
//
//  You should have received a copy of the GNU Lesser General Public
//  License along with GNSSTk; if not, write to the Free Software Foundation,
//  Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110, USA
//
//  This software was developed by Applied Research Laboratories at the
//  University of Texas at Austin.
//  Copyright 2004-2022, The Board of Regents of The University of Texas System
//
//==============================================================================
 
//==============================================================================
//
//  This software was developed by Applied Research Laboratories at the
//  University of Texas at Austin, under contract to an agency or agencies
//  within the U.S. Department of Defense. The U.S. Government retains all
//  rights to use, duplicate, distribute, disclose, or release this software.
//
//  Pursuant to DoD Directive 523024
//
//  DISTRIBUTION STATEMENT A: This software has been approved for public
//                            release, distribution is unlimited.
//
//==============================================================================
 
#ifndef GNSSTK_RINEX3NAVFILTEROPERATORS_HPP
#define GNSSTK_RINEX3NAVFILTEROPERATORS_HPP
 
#include <set>
#include <list>
#include <string>
 
#include "FileFilter.hpp"
#include "Rinex3NavData.hpp"
#include "Rinex3NavHeader.hpp"
#include "GPSWeekSecond.hpp"
#include <math.h>
 
namespace gnsstk
{
 
 
   struct Rinex3NavDataOperatorLessThanFull :
      public std::binary_function<Rinex3NavData, Rinex3NavData, bool>
   {
   public:
      Rinex3NavDataOperatorLessThanFull()
            : epsilon(1e-5)
      {}
 
      void setPrecision(int e)
      {
         epsilon = std::pow(10.0, -e);
      }
 
      bool operator()(const Rinex3NavData& l, const Rinex3NavData& r) const
      {
         GPSWeekSecond lXmitTime(l.weeknum, (double)l.xmitTime);
         GPSWeekSecond rXmitTime(r.weeknum, (double)r.xmitTime);
 
         if (lXmitTime < rXmitTime)
         {
            return true;
         }
         else if (lXmitTime == rXmitTime)
         {
               // compare the times and all data members
            if (l.time < r.time)
            {
               return true;
            }
            else if (r.time < l.time)
            {
               return false;
            }
            else if (l.sat < r.sat)
            {
               return true;
            }
            else if (r.sat < l.sat)
            {
               return false;
            }
            else
            {
               std::list<double>
                  llist = l.toList(),
                  rlist = r.toList();
 
               std::list<double>::iterator
                  litr = llist.begin(),
                  ritr = rlist.begin();
 
               while (litr != llist.end())
               {
                     // Compare the two values against each other,
                     // with an epsilon-sized slop.
                  double diff = *litr - *ritr;
                  double err = (*litr == 0 ? *ritr : (diff/(*litr)));
                  if (err > epsilon)
                  {
                     return true;
                  }
                  else if (err < -epsilon)
                  {
                     return false;
                  }
                  else
                  {
                     litr++;
                     ritr++;
                  }
               }
            }
         } // if (lXmitTime == rXmitTime)
         return false;
      }
   private:
      double epsilon;
   };
 
   struct Rinex3NavDataOperatorEqualsFull :
      public std::binary_function<Rinex3NavData, Rinex3NavData, bool>
   {
   public:
 
      bool operator()(const Rinex3NavData& l, const Rinex3NavData& r) const
      {
            // compare the times and all data members
         if (l.time != r.time)
            return false;
         else // if (l.time == r.time)
         {
            std::list<double>
               llist = l.toList(),
               rlist = r.toList();
 
            std::list<double>::iterator
               litr = llist.begin(),
               ritr = rlist.begin();
 
            while (litr != llist.end())
            {
               if (*litr != *ritr)
                  return false;
               litr++;
               ritr++;
            }
         }
 
         return true;
      }
   };
 
   struct Rinex3NavDataOperatorLessThanSimple :
      public std::binary_function<Rinex3NavData, Rinex3NavData, bool>
   {
   public:
 
      bool operator()(const Rinex3NavData& l, const Rinex3NavData& r) const
      {
         GPSWeekSecond lXmitTime(l.weeknum, static_cast<double>(l.xmitTime));
         GPSWeekSecond rXmitTime(r.weeknum, static_cast<double>(r.xmitTime));
         if (lXmitTime < rXmitTime)
            return true;
         return false;
      }
   };
 
   struct Rinex3NavHeaderTouchHeaderMerge :
      public std::unary_function<Rinex3NavHeader, bool>
   {
   public:
 
      Rinex3NavHeaderTouchHeaderMerge()
            : firstHeader(true)
      {}
 
      bool operator()(const Rinex3NavHeader& l)
      {
         if (firstHeader)
         {
            theHeader = l;
            firstHeader = false;
         }
         else
         {
            std::set<std::string> commentSet;
 
               // insert the comments to the set
               // and let the set take care of uniqueness
            copy(theHeader.commentList.begin(),
                 theHeader.commentList.end(),
                 inserter(commentSet, commentSet.begin()));
            copy(l.commentList.begin(),
                 l.commentList.end(),
                 inserter(commentSet, commentSet.begin()));
               // then copy the comments back into theHeader
            theHeader.commentList.clear();
            copy(commentSet.begin(), commentSet.end(),
                 inserter(theHeader.commentList,
                          theHeader.commentList.begin()));
         }
         return true;
      }
 
      bool firstHeader;
      Rinex3NavHeader theHeader;
   };
 
   struct Rinex3NavDataFilterPRN :
      public std::unary_function<Rinex3NavData, bool>
   {
   public:
 
      Rinex3NavDataFilterPRN(const std::list<long>& lst )
            :prnList(lst)
      {}
 
      bool operator()(const Rinex3NavData& l) const
      {
         long testValue = (long) l.PRNID;
         return find(prnList.begin(), prnList.end(), testValue )
            == prnList.end();
      }
 
   private:
 
      std::list<long> prnList;
 
   };
 
 
}
 
#endif // GNSSTK_RINEX3NAVFILTEROPERATORS_HPP