GothenburgBitFactory/taskwarrior
1
0
Fork 0
mirror of https://github.com/GothenburgBitFactory/taskwarrior.git synced 2025-07-07 20:06:36 +02:00
Code Issues Projects Releases Packages Wiki Activity Actions 1

task cal modifications

Browse source
This commit is contained in:
Federico Hernandez 2009-06-25 03:03:08 +02:00
parent ed7a9273d0
commit b67b64ea00
1 changed files with 80 additions and 9 deletions
Download patch file Download diff file Expand all files Collapse all files

89
src/report.cpp
View file

@ -1530,30 +1530,101 @@ std::string handleReportCalendar ()
context.tdb.commit (); context.tdb.commit ();
context.tdb.unlock (); context.tdb.unlock ();
Date today;
bool getpendingdate = false;
int monthsToDisplay;
int mFrom;
int yFrom;
int mTo;
int yTo;
// Determine what to do
int numberOfArgs = context.args.size();
if (numberOfArgs == 1 ) {
// task cal
printf("Case 1\n");
monthsToDisplay = monthsPerLine;
mFrom = today.month();
yFrom = today.year();
}
else if (numberOfArgs == 2 ) {
if (context.args[1] == "y") {
// task cal y
printf("Case 2\n");
monthsToDisplay = 12;
mFrom = today.month();
yFrom = today.year();
}
else if (context.args[1] == "due") {
// task cal due
printf("Case 3\n");
monthsToDisplay = monthsPerLine;
getpendingdate = true;
}
else {
// task cal 2010
printf("Case 5\n");
monthsToDisplay = 12;
mFrom = 1;
yFrom = ::atoi( context.args[1].data());
}
}
else if (numberOfArgs == 3 ) {
if (context.args[2] == "y") {
// task cal due y
printf("Case 4\n");
monthsToDisplay = 12;
getpendingdate = true;
}
else {
// task cal 8 2010
printf("Case 6\n");
monthsToDisplay = monthsPerLine;
mFrom = ::atoi( context.args[1].data());
yFrom = ::atoi( context.args[2].data());
}
}
else if (numberOfArgs == 4 ) {
// task cal 8 2010 y
printf("Case 7\n");
monthsToDisplay = 12;
mFrom = ::atoi( context.args[1].data());
yFrom = ::atoi( context.args[2].data());
}
// Find the oldest pending due date. // Find the oldest pending due date.
Date oldest; Date oldest;
Date newest; printf("Number of tasks %i\n",tasks.size());
foreach (task, tasks) foreach (task, tasks)
{ {
printf("ID %i\n",task->id);
if (task->getStatus () == Task::pending) if (task->getStatus () == Task::pending)
{ {
if (task->has ("due")) if (task->has ("due"))
{ {
Date d (::atoi (task->get ("due").c_str ())); Date d (::atoi (task->get ("due").c_str ()));
if (d < oldest) oldest = d; if (d < oldest) oldest = d;
if (d > newest) newest = d;
} }
} }
} }
if (getpendingdate == true) {
mFrom = oldest.month();
yFrom = oldest.year();
}
// Iterate from oldest due month, year to newest month, year. mTo = mFrom + monthsToDisplay - 1;
Date today; yTo = yFrom;
int mFrom = oldest.month (); if (mTo > 12) {
int yFrom = oldest.year (); mTo -=12;
yTo++;
}
int mTo = newest.month (); printf("monthsToDisplay: %i\n",monthsToDisplay);
int yTo = newest.year (); printf("mFrom: %i\n",mFrom);
printf("yFrom: %i\n",yFrom);
printf("mTo: %i\n",mTo);
printf("yTo: %i\n",yTo);
std::stringstream out; std::stringstream out;
out << std::endl; out << std::endl;