.. _program_listing_file__tmp_ws_src_rmf_task_rmf_task_include_rmf_task_BinaryPriorityScheme.hpp:

Program Listing for File BinaryPriorityScheme.hpp
=================================================

|exhale_lsh| :ref:`Return to documentation for file <file__tmp_ws_src_rmf_task_rmf_task_include_rmf_task_BinaryPriorityScheme.hpp>` (``/tmp/ws/src/rmf_task/rmf_task/include/rmf_task/BinaryPriorityScheme.hpp``)

.. |exhale_lsh| unicode:: U+021B0 .. UPWARDS ARROW WITH TIP LEFTWARDS

.. code-block:: cpp

   /*
    * Copyright (C) 2021 Open Source Robotics Foundation
    *
    * 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.
    * See the License for the specific language governing permissions and
    * limitations under the License.
    *
   */
   
   #ifndef RMF_TASK__BINARYPRIORITYSCHEME_HPP
   #define RMF_TASK__BINARYPRIORITYSCHEME_HPP
   
   #include <rmf_task/Priority.hpp>
   #include <rmf_task/CostCalculator.hpp>
   
   #include <memory>
   
   namespace rmf_task {
   
   //==============================================================================
   class BinaryPriorityScheme
   {
   public:
   
     static std::shared_ptr<Priority> make_low_priority();
     static std::shared_ptr<Priority> make_high_priority();
   
     static std::shared_ptr<CostCalculator> make_cost_calculator();
   };
   
   } // namespace rmf_task
   
   #endif // RMF_TASK__BINARYPRIORITYSCHEME_HPP