view OrthancServer/Sources/Database/Compatibility/DatabaseLookup.h @ 5735:0ca3e7c86b5d

doc
author Alain Mazy <am@orthanc.team>
date Mon, 29 Jul 2024 14:41:38 +0200
parents 68fc5af30c03
children 7030fa489669
line wrap: on
line source

/**
 * Orthanc - A Lightweight, RESTful DICOM Store
 * Copyright (C) 2012-2016 Sebastien Jodogne, Medical Physics
 * Department, University Hospital of Liege, Belgium
 * Copyright (C) 2017-2023 Osimis S.A., Belgium
 * Copyright (C) 2024-2024 Orthanc Team SRL, Belgium
 * Copyright (C) 2021-2024 Sebastien Jodogne, ICTEAM UCLouvain, Belgium
 *
 * This program is free software: you can redistribute it and/or
 * modify it under the terms of the GNU 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
 * General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program. If not, see <http://www.gnu.org/licenses/>.
 **/


#pragma once

#include "../IDatabaseWrapper.h"
#include "ILookupResources.h"

namespace Orthanc
{
  namespace Compatibility
  {
    class DatabaseLookup : public boost::noncopyable
    {
    private:
      IDatabaseWrapper::ITransaction&  transaction_;
      ILookupResources&  compatibility_;

    public:
      DatabaseLookup(IDatabaseWrapper::ITransaction& transaction,
                     ILookupResources& compatibility) :
        transaction_(transaction),
        compatibility_(compatibility)
      {
      }

      void ApplyLookupResources(std::list<std::string>& resourcesId,
                                std::list<std::string>* instancesId,
                                const DatabaseConstraints& lookup,
                                ResourceType queryLevel,
                                size_t limit);
    };
  }
}