mask_list.hpp

Go to the documentation of this file.
00001 /*********************************************************************/
00002 // dar - disk archive - a backup/restoration program
00003 // Copyright (C) 2002-2052 Denis Corbin
00004 //
00005 // This program is free software; you can redistribute it and/or
00006 // modify it under the terms of the GNU General Public License
00007 // as published by the Free Software Foundation; either version 2
00008 // of the License, or (at your option) any later version.
00009 //
00010 // This program is distributed in the hope that it will be useful,
00011 // but WITHOUT ANY WARRANTY; without even the implied warranty of
00012 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
00013 // GNU General Public License for more details.
00014 //
00015 // You should have received a copy of the GNU General Public License
00016 // along with this program; if not, write to the Free Software
00017 // Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
00018 //
00019 // to contact the author : dar.linux@free.fr
00020 /*********************************************************************/
00021 // $Id: mask_list.hpp,v 1.1.2.2 2008/02/02 14:10:50 edrusb Rel $
00022 //
00023 /*********************************************************************/
00024 
00030 
00031 #ifndef MASK_LIST_HPP
00032 #define MASK_LIST_HPP
00033 
00034 #include "../my_config.h"
00035 
00036 #include "mask.hpp"
00037 
00038 namespace libdar
00039 {
00040 
00043 
00045 
00049 
00050     class mask_list : public mask
00051     {
00052     public:
00053 
00055 
00061         mask_list(const std::string & filename_list_st, bool case_sensit, const path & prefix, bool include);
00062 
00064         bool is_covered(const std::string & expression) const;
00066         mask *clone() const { return new mask_list(*this); };
00067 
00069         U_I size() const { return contenu.size(); };
00070 
00071     private:
00072 
00073             // we need to change to lexicographical order relation ship for the '/' character be the most lower of all. This way
00074             // the first entry listed from a set a file sharing the same first characters will be the one corresponding
00075             // to the directory with this common prefix.
00076 
00077         class my_char
00078         {
00079         public:
00080             my_char() { val = 0; };
00081             my_char(const char x) : val(x) {};
00082             bool operator < (const my_char & x) const
00083             {
00084                 if(val == '/')
00085                     if(x.val == '/')
00086                         return false;
00087                     else
00088                         return true;
00089                 else
00090                     if(x.val == '/')
00091                         return false;
00092                     else
00093                         return val < x.val;
00094             };
00095 
00096             operator char() const
00097             {
00098                 return val;
00099             };
00100 
00101         private:
00102             char val;
00103         };
00104 
00105         std::vector <std::basic_string<my_char> > contenu;
00106         U_I taille;
00107         bool case_s;
00108         bool including;   // mask is used for including files (not for excluding files)
00109 
00110         std::list<std::basic_string<my_char> > convert_list_string_char(const std::list<std::string> & src) const;
00111         std::basic_string<my_char> convert_string_char(const std::string & src) const;
00112         std::string convert_string_my_char(const std::basic_string<my_char> & src) const;
00113     };
00114 
00116 
00117 } // end of namespace
00118 
00119 #endif

Generated on Wed Jul 2 12:57:56 2008 for Disk ARchive by  doxygen 1.5.6