DbmNameFilter.cxx

Go to the documentation of this file.

// DbmNameFilter                                                      //
//                                                                    //
// Package: Dbm (Database Maintenance).                               //
//                                                                    //
// N. West 09/2002                                                    //
//                                                                    //
// Concept: Utility to manage a list of names as a filter.            //
//                                                                    //
// Purpose: To filter table names for export commands.                //
//                                                                    //

#include <ctype.h>
#include <fstream>

#include "DatabaseMaintenance/DbmNameFilter.h"
#include "LeakChecker/Lea.h"
#include "MessageService/MsgService.h"
#include "Util/UtilString.h"

ClassImp(DbmNameFilter)


//   Definition of static data members
//   *********************************

CVSID("$Id: DbmNameFilter.cxx,v 1.3 2004/03/24 12:57:28 west Exp $");

// Definition of member functions (alphabetical order)
// ***************************************************


//.....................................................................

DbmNameFilter::DbmNameFilter(const std::string& nameList)
{
//
//
//  Purpose:  Default constructor
//
//  Arguments
//    nameList  in    Comma separated list of names (see Specification)
//
//  Contact:   N. West
//
//  Specification:-
//  =============
//
//  o  Create a DbmNameFilter from a comma separated list of names.
//     Each name is of the form:-
//     
//       [!][name-string][*]
//     
//     !  Makes the name a veto.
//     *  Is a wildcard match.  Only permitted as last character.


  LEA_CTOR    //Leak Checker

  MSG("Dbm", Msg::kVerbose) << "Creating DbmNameFilter" << endl;

  bool ok = true;

  // Split list of names and process each.
  std::vector<std::string> names;
  UtilString::StringTok(names, nameList,",");

  std::vector<std::string>::iterator itr    = names.begin();
  std::vector<std::string>::iterator itrEnd = names.end();
  for (; itr != itrEnd; ++itr) {
    std::string& name = *itr;
    if ( name.size() == 0 ) {
      ok = false;
      MSG("Dbm", Msg::kError) << "List contains an empty element" 
                              << endl;
      continue;
    }

    // Check for veto name.
    bool type = true;
    if ( name[0] == '!' ) {
      type = false;
      name.erase(0,1);
    }

    // Check for illegal characters - must only be alphanumeric or _
    // with possible trailing *.
    int loc    = 0;
    int locMax =  name.size() -1;
    while (    loc <= locMax 
            && ( isalnum(name[loc]) ||  name[loc] == '_' )
           ) ++loc;
    if ( loc < locMax || ( loc == locMax & name[loc] != '*' ) ) {
      ok = false;
      MSG("Dbm", Msg::kError) << "List contains an illegal element: " 
                              << name << endl;
      continue;
    }

    // Record in list.
    fNameList[name] = type;
  }

  // Clear list if any error.
  if (! ok ) fNameList.clear();

}

//.....................................................................

DbmNameFilter::~DbmNameFilter() {
//
//
//  Purpose: Destructor
//
//  Contact:   N. West
//
//  Specification:-
//  =============
//
//  o  Destroy DbmNameFilter.


  LEA_DTOR    //Leak Checker

  MSG("Dbm", Msg::kVerbose) << "Destroying DbmNameFilter" << endl;

}

//.....................................................................

Int_t DbmNameFilter::BestMatch(const std::string& name,
                                Bool_t type) const {
//
//
//  Purpose:  Return the best (longest) match of type.
//
//  Arguments: 
//    name      in    The name to be matched.
//    type      in    The type of match (false for veto).
//    
//
//  Return:    The length of the longest match.
//
//  Contact:   N. West
//
//  Specification:-
//  =============
//
//  o Compare supplied name to the selected type in the namelist
//    and return the length of the longest match.

//  Program Notes:-
//  =============

//  Search the map backwards so that a longer name is found before
//  a wildcard match.

  typedef std::map<const std::string,
                   Bool_t>::const_reverse_iterator itr_t;
  itr_t itr    = fNameList.rbegin(); 
  itr_t itrEnd = fNameList.rend();

  for (; itr != itrEnd; ++itr)
    if (     itr->second == type
         && UtilString::cmp_wildcard(name,itr->first) == 0
       ) return itr->first.size();
  return 0;

}
//.....................................................................

Bool_t DbmNameFilter::Test(const std::string& name) const {
//
//
//  Purpose:  Compare name to filter.
//
//  Arguments: 
//    name    in    Name to be compared.
//
//  Return:    true if name passes filter.
//
//  Contact:   N. West

  //  See if the best match for the accept list is better 
  // (i.e. longer) than the veto list.  In the case of a tie,
  // the veto wins.

  return this->BestMatch(name,true) > this->BestMatch(name,false);

}

/*    Template for New Member Function

//.....................................................................

DbmNameFilter:: {
//
//
//  Purpose:  
//
//  Arguments: 
//    xxxxxxxxx    in    yyyyyy
//
//  Return:    
//
//  Contact:   N. West
//
//  Specification:-
//  =============
//
//  o 

//  Program Notes:-
//  =============

//  None.


}

*/

---