DeSR Dependency Parser

ixe/conf/PatternSet.h

/*
**  IXE C++ Library
**  ixe/conf/PatternSet.h
**  ----------------------------------------------------------------------
**  Copyright (c) 2000  Ideare SpA.
**  Copyright (c) 2000  Giuseppe Attardi (attardi@di.unipi.it).
**  ----------------------------------------------------------------------
**
**  This file is part of DeSR.
**
**  DeSR is free software; you can redistribute it and/or modify it
**  under the terms of the GNU General Public License, version 3,
**  as published by the Free Software Foundation.
**
**  DeSR 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/>.
**  ----------------------------------------------------------------------
*/

#ifndef IXE_PatternSet_H
#define IXE_PatternSet_H

// Settings
#include "platform.h"

// standard
#include <algorithm>                    /* for find_if() */
#include <fnmatch.h>                    /* for fnmatch(3) */

#ifdef HAVE_EXT_HASH_MAP_SET
#include <ext/hash_set>
#if defined(__GNUC__) && __GNUC__ > 2
using __gnu_cxx::hash_set;
#endif
#else
#include <hash_set>
# ifdef _MSC_VER
using stdext::hash_set;
# else
using std::hash_set;
# endif
#endif

// local
#include "text/strings.h"

using namespace IXE::Text;

namespace IXE {

// in hash_set use equal_to() from text/string.h

class PatternSet : public hash_set<char const*>
{
public:
  typedef hash_set<char const*> Set;
  typedef Set::key_type         key_type;
  typedef Set::value_type       value_type;
  typedef Set::iterator         iterator;
  typedef Set::const_iterator   const_iterator;

  //
  // find() must be overridden to use our own comparison function.
  //
  iterator find(char const* file_name) {
    return std::find_if(begin(), end(), pattern_match(file_name));
  }
  const_iterator find(char const* file_name) const {
    return std::find_if(begin(), end(), pattern_match(file_name));
  }

  bool matches(char const* file_name) const {
    return find(file_name) != end();
  }

  void insert(value_type const& n) { Set::insert(::strdup(n)); }

  void insert(value_type const& s, size_t n) { Set::insert(strndup(s, n)); }

private:
  class pattern_match : public 
  std::unary_function<value_type const&, bool> {
  public:
    pattern_match(char const* file_name) :
      file_name(file_name) { }
    bool operator ()(value_type const& pattern) const {
      return !::fnmatch(pattern, file_name, 0);
    }
  private:
    char const* const file_name;
  };
};

} // namespace IXE

#endif  /* IXE_PatternSet_H */

 

Copyright © 2005-2007 G. Attardi. Generated on 13 Aug 2009 by doxygen 1.5.7.1.