view OrthancServer/Search/ListConstraint.cpp @ 2561:b2f57399b067

updated bibtex
author Sebastien Jodogne <s.jodogne@gmail.com>
date Fri, 04 May 2018 10:31:27 +0200
parents 878b59270859
children 8fd203510d8b 4e43e67f8ecf
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-2018 Osimis S.A., 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.
 *
 * In addition, as a special exception, the copyright holders of this
 * program give permission to link the code of its release with the
 * OpenSSL project's "OpenSSL" library (or with modified versions of it
 * that use the same license as the "OpenSSL" library), and distribute
 * the linked executables. You must obey the GNU General Public License
 * in all respects for all of the code used other than "OpenSSL". If you
 * modify file(s) with this exception, you may extend this exception to
 * your version of the file(s), but you are not obligated to do so. If
 * you do not wish to do so, delete this exception statement from your
 * version. If you delete this exception statement from all source files
 * in the program, then also delete it here.
 * 
 * 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/>.
 **/


#include "../PrecompiledHeadersServer.h"
#include "ListConstraint.h"


namespace Orthanc
{
  void ListConstraint::AddAllowedValue(const std::string& value)
  {
    if (isCaseSensitive_)
    {
      allowedValues_.insert(value);
    }
    else
    {
      allowedValues_.insert(Toolbox::ToUpperCaseWithAccents(value));
    }
  }


  void ListConstraint::Setup(LookupIdentifierQuery& lookup, 
                             const DicomTag& tag) const
  {
    LookupIdentifierQuery::Disjunction& target = lookup.AddDisjunction();

    for (std::set<std::string>::const_iterator
           it = allowedValues_.begin(); it != allowedValues_.end(); ++it)
    {
      target.Add(tag, IdentifierConstraintType_Equal, *it);
    }
  }


  bool ListConstraint::Match(const std::string& value) const
  {
    std::string s;
    
    if (isCaseSensitive_)
    {
      s = value;
    }
    else
    {
      s = Toolbox::ToUpperCaseWithAccents(value);
    }

    return allowedValues_.find(s) != allowedValues_.end();
  }


  std::string ListConstraint::Format() const
  {
    std::string s;

    for (std::set<std::string>::const_iterator
           it = allowedValues_.begin(); it != allowedValues_.end(); ++it)
    {
      if (!s.empty())
      {
        s += "\\";
      }

      s += *it;
    }

    return s;
  }
}