Priority_Pair.h

Go to the documentation of this file.

#ifndef COMMA_PROJECT_PRIORITY_PAIR_H
#define COMMA_PROJECT_PRIORITY_PAIR_H
 
/*
 * CoMMA
 *
 * Copyright © 2024 ONERA
 *
 * Authors: Nicolas Lantos, Alberto Remigi, and Riccardo Milani
 * Contributors: Karim Anemiche
 *
 * This Source Code Form is subject to the terms of the Mozilla Public
 * License, v. 2.0. If a copy of the MPL was not distributed with this
 * file, You can obtain one at https://mozilla.org/MPL/2.0/.
 */
 
#include <utility>
 
namespace comma {
 
template<typename A, typename B>
class Priority_Pair {
private:
  std::pair<A, B> _p;
 
public:
  Priority_Pair() = default;
  ;
 
  Priority_Pair(const A &a, const B &b) :
    _p(a, b){};
 
  ~Priority_Pair() = default;
  ;
 
  // We accept to have a copy passed
  A first() const { return _p.first; }
 
  B second() const { return _p.second; }
 
  inline friend bool operator<(const Priority_Pair &a, const Priority_Pair &b) {
    if (a._p.first > b._p.first) return true;
    if (a._p.first < b._p.first) return false;
    /* a._p.first == b._p.first */
    return a._p.second < b._p.second;
  }
 
  inline friend bool operator==(
    const Priority_Pair &a, const Priority_Pair &b
  ) {
    return (a._p.first == b._p.first) && (a._p.second == b._p.second);
  }
};
 
}  // end namespace comma
 
#endif  // COMMA_PROJECT_PRIORITY_PAIR_H