Mercurial > hg > orthanc
view OrthancFramework/Sources/HttpServer/StringMatcher.cpp @ 5406:aaf7c49a9ddc am-http-compression
tentative to implement smart HTTP compression with detection of transfer syntax
author | Alain Mazy <am@osimis.io> |
---|---|
date | Sat, 04 Nov 2023 13:42:30 +0100 |
parents | 0ea402b4d901 |
children | 48b8dae6dc77 |
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) 2021-2023 Sebastien Jodogne, ICTEAM UCLouvain, Belgium * * This program is free software: you can redistribute it and/or * modify it under the terms of the GNU Lesser 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 * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this program. If not, see * <http://www.gnu.org/licenses/>. **/ #include "../PrecompiledHeaders.h" #include "StringMatcher.h" #include "../OrthancException.h" #include <boost/algorithm/searching/boyer_moore.hpp> //#include <boost/algorithm/searching/boyer_moore_horspool.hpp> //#include <boost/algorithm/searching/knuth_morris_pratt.hpp> namespace Orthanc { class StringMatcher::Search : public boost::noncopyable { private: typedef boost::algorithm::boyer_moore<Iterator> Algorithm; //typedef boost::algorithm::boyer_moore_horspool<std::string::const_iterator> Algorithm; Algorithm algorithm_; public: // WARNING - The lifetime of "pattern_" must be larger than // "search_", as the latter internally keeps a pointer to "pattern" (*) explicit Search(const std::string& pattern) : algorithm_(pattern.begin(), pattern.end()) { } Iterator Apply(Iterator start, Iterator end) const { #if BOOST_VERSION >= 106200 return algorithm_(start, end).first; #else return algorithm_(start, end); #endif } }; StringMatcher::StringMatcher(const std::string& pattern) : pattern_(pattern), valid_(false) { // WARNING - Don't use "pattern" (local variable, will be // destroyed once exiting the constructor) but "pattern_" // (variable member, will last as long as the algorithm), // otherwise lifetime is bad! (*) search_.reset(new Search(pattern_)); } const std::string& StringMatcher::GetPattern() const { return pattern_; } bool StringMatcher::IsValid() const { return valid_; } bool StringMatcher::Apply(Iterator start, Iterator end) { assert(search_.get() != NULL); matchBegin_ = search_->Apply(start, end); if (matchBegin_ == end) { valid_ = false; } else { matchEnd_ = matchBegin_ + pattern_.size(); assert(matchEnd_ <= end); valid_ = true; } return valid_; } bool StringMatcher::Apply(const std::string& corpus) { return Apply(corpus.begin(), corpus.end()); } StringMatcher::Iterator StringMatcher::GetMatchBegin() const { if (valid_) { return matchBegin_; } else { throw OrthancException(ErrorCode_BadSequenceOfCalls); } } StringMatcher::Iterator StringMatcher::GetMatchEnd() const { if (valid_) { return matchEnd_; } else { throw OrthancException(ErrorCode_BadSequenceOfCalls); } } const char* StringMatcher::GetPointerBegin() const { return &GetMatchBegin()[0]; } const char* StringMatcher::GetPointerEnd() const { return GetPointerBegin() + pattern_.size(); } }