b58438bdd4
- Added regex support to substirutions. - Fixed bug that prevented 1.9.4 from shipping with regexes. If the description is "aXXaaXXa", and the substitution is /XX/.../ then the first substitutions changes the length of the string to "a...aaXXa" and therefore invalidates the index for the second match, and makes this change: "a...a...Xa". The fix is to keep a running 'skew' count of the difference in 'from' and 'to' length, to adjust the match indexes. - Moved the helper deltaSubstitutions function into the Task object, which makes more sense. - Cleaned up output composition for CmdAdd. - Eliminated #ifdef FEATURE_REGEX. They are here to stay.
162 lines
4.5 KiB
C++
162 lines
4.5 KiB
C++
////////////////////////////////////////////////////////////////////////////////
|
|
// taskwarrior - a command line task list manager.
|
|
//
|
|
// Copyright 2006 - 2011, Paul Beckingham, Federico Hernandez.
|
|
// All rights reserved.
|
|
//
|
|
// This program is free software; you can redistribute it and/or modify it under
|
|
// the terms of the GNU General Public License as published by the Free Software
|
|
// Foundation; either version 2 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 General Public License for more
|
|
// details.
|
|
//
|
|
// You should have received a copy of the GNU General Public License along with
|
|
// this program; if not, write to the
|
|
//
|
|
// Free Software Foundation, Inc.,
|
|
// 51 Franklin Street, Fifth Floor,
|
|
// Boston, MA
|
|
// 02110-1301
|
|
// USA
|
|
//
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
#ifndef INCLUDED_MAIN
|
|
#define INCLUDED_MAIN
|
|
#define L10N // Localization complete.
|
|
|
|
#define FEATURE_NEW_ID 1 // Echoes back new id.
|
|
|
|
#include <string>
|
|
#include <vector>
|
|
#include <map>
|
|
#include <sys/types.h>
|
|
#include <Context.h>
|
|
#include <Date.h>
|
|
#include <Color.h>
|
|
#include <cmake.h>
|
|
|
|
// recur.cpp
|
|
void handleRecurrence ();
|
|
Date getNextRecurrence (Date&, std::string&);
|
|
bool generateDueDates (Task&, std::vector <Date>&);
|
|
void updateRecurrenceMask (std::vector <Task>&, Task&);
|
|
int getDueState (const std::string&);
|
|
bool nag (Task&);
|
|
|
|
// helpers.cpp
|
|
std::string getFullDescription (Task&, const std::string&);
|
|
std::string getDueDate (Task&, const std::string&);
|
|
std::string onProjectChange (Task&, bool scope = true);
|
|
std::string onProjectChange (Task&, Task&);
|
|
int deltaAppend (Task&);
|
|
int deltaPrepend (Task&);
|
|
int deltaDescription (Task&);
|
|
int deltaTags (Task&);
|
|
int deltaAttributes (Task&);
|
|
|
|
// rules.cpp
|
|
void initializeColorRules ();
|
|
void autoColorize (Task&, Color&);
|
|
std::string colorizeHeader (const std::string&);
|
|
std::string colorizeFootnote (const std::string&);
|
|
std::string colorizeDebug (const std::string&);
|
|
|
|
// dependency.cpp
|
|
bool dependencyIsBlocked (const Task&);
|
|
void dependencyGetBlocked (const Task&, std::vector <Task>&);
|
|
bool dependencyIsBlocking (const Task&);
|
|
void dependencyGetBlocking (const Task&, std::vector <Task>&);
|
|
bool dependencyIsCircular (const Task&);
|
|
void dependencyChainOnComplete (Task&);
|
|
void dependencyChainOnStart (Task&);
|
|
void dependencyChainOnModify (Task&, Task&);
|
|
|
|
// feedback.cpp
|
|
bool taskDiff (const Task&, const Task&);
|
|
std::string taskDifferences (const Task&, const Task&);
|
|
std::string taskInfoDifferences (const Task&, const Task&);
|
|
std::string renderAttribute (const std::string&, const std::string&);
|
|
std::string feedback (const Task&, const Task&);
|
|
|
|
// sort.cpp
|
|
void sort_tasks (std::vector <Task>&, std::vector <int>&, const std::string&);
|
|
|
|
// list template
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
template <class T> bool listDiff (const T& left, const T& right)
|
|
{
|
|
if (left.size () != right.size ())
|
|
return true;
|
|
|
|
for (unsigned int i = 0; i < left.size (); ++i)
|
|
if (left[i] != right[i])
|
|
return true;
|
|
|
|
return false;
|
|
}
|
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
template <class T> void listDiff (
|
|
const T& left, const T& right, T& leftOnly, T& rightOnly)
|
|
{
|
|
leftOnly.clear ();
|
|
rightOnly.clear ();
|
|
|
|
for (unsigned int l = 0; l < left.size (); ++l)
|
|
{
|
|
bool found = false;
|
|
for (unsigned int r = 0; r < right.size (); ++r)
|
|
{
|
|
if (left[l] == right[r])
|
|
{
|
|
found = true;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (!found)
|
|
leftOnly.push_back (left[l]);
|
|
}
|
|
|
|
for (unsigned int r = 0; r < right.size (); ++r)
|
|
{
|
|
bool found = false;
|
|
for (unsigned int l = 0; l < left.size (); ++l)
|
|
{
|
|
if (left[l] == right[r])
|
|
{
|
|
found = true;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (!found)
|
|
rightOnly.push_back (right[r]);
|
|
}
|
|
}
|
|
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
template <class T> void listIntersect (const T& left, const T& right, T& join)
|
|
{
|
|
join.clear ();
|
|
|
|
for (unsigned int l = 0; l < left.size (); ++l)
|
|
{
|
|
for (unsigned int r = 0; r < right.size (); ++r)
|
|
{
|
|
if (left[l] == right[r])
|
|
{
|
|
join.push_back (left[l]);
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
#endif
|
|
////////////////////////////////////////////////////////////////////////////////
|