src/TortoiseProc/BrowseRefsDlgFilter.cpp

   1 // TortoiseGit - a Windows shell extension for easy version control
   2
   3 // Copyright (C) 2018-2019 - TortoiseGit
   4
   5 // This program is free software; you can redistribute it and/or
   6 // modify it under the terms of the GNU General Public License
   7 // as published by the Free Software Foundation; either version 2
   8 // of the License, or (at your option) any later version.
   9
  10 // This program is distributed in the hope that it will be useful,
  11 // but WITHOUT ANY WARRANTY; without even the implied warranty of
  12 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  13 // GNU General Public License for more details.
  14
  15 // You should have received a copy of the GNU General Public License
  16 // along with this program; if not, write to the Free Software Foundation,
  17 // 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
  18 //
  19 #include "stdafx.h"
  20 #include "BrowseRefsDlgFilter.h"
  21 #include "BrowseRefsDlg.h"
  22 #include "GitLogListBase.h"
  23
  24 bool CBrowseRefsDlgFilter::operator()(const CShadowTree* pTree, const CString& ref) const
  25 {
  26         if (!IsFilterActive())
  27                 return CalculateFinalResult(true);
  28
  29         // we need to perform expensive string / pattern matching
  30         scratch.clear();
  31
  32         if (GetSelectedFilters() & LOGFILTER_REFNAME)
  33         {
  34                 scratch += ref;
  35                 scratch += L'\n';
  36         }
  37         if (GetSelectedFilters() & LOGFILTER_SUBJECT)
  38         {
  39                 scratch += pTree->m_csSubject;
  40                 scratch += L'\n';
  41         }
  42
  43         if (GetSelectedFilters() & LOGFILTER_AUTHORS)
  44         {
  45                 scratch += pTree->m_csAuthor;
  46                 scratch += L'\n';
  47         }
  48
  49         if (GetSelectedFilters() & LOGFILTER_REVS)
  50         {
  51                 scratch += pTree->m_csRefHash;
  52                 scratch += L'\n';
  53         }
  54
  55         return CalculateFinalResult(Match(scratch));
  56 }