view Framework/Loaders/IFetchingItemsSorter.h @ 1137:cc029987b6dc broker

improved cache key
author Sebastien Jodogne <s.jodogne@gmail.com>
date Wed, 06 Nov 2019 20:27:20 +0100
parents f7c236894c1a
children 2d8ab34c8c91
line wrap: on
line source

/**
 * Stone of Orthanc
 * Copyright (C) 2012-2016 Sebastien Jodogne, Medical Physics
 * Department, University Hospital of Liege, Belgium
 * Copyright (C) 2017-2019 Osimis S.A., Belgium
 *
 * This program is free software: you can redistribute it and/or
 * modify it under the terms of the GNU Affero General Public License
 * as published by the Free Software Foundation, either version 3 of
 * the License, or (at your option) any later version.
 *
 * This program 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
 * Affero General Public License for more details.
 * 
 * You should have received a copy of the GNU Affero General Public License
 * along with this program. If not, see <http://www.gnu.org/licenses/>.
 **/


#pragma once

#include <boost/noncopyable.hpp>
#include <vector>

namespace OrthancStone
{
  class IFetchingItemsSorter : public boost::noncopyable
  {
  public:
    class IFactory : public boost::noncopyable
    {
    public:
      virtual ~IFactory()
      {
      }

      virtual IFetchingItemsSorter* CreateSorter(unsigned int itemsCount) const = 0;
    };

    virtual ~IFetchingItemsSorter()
    {
    }

    virtual unsigned int GetItemsCount() const = 0;

    // Sort a set of items given the current item
    virtual void Sort(std::vector<unsigned int>& target,
                      unsigned int current) = 0;
  };
};