//////////////////////////////////////////////////////////////////////////////// // 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 // //////////////////////////////////////////////////////////////////////////////// #include #include #include "Context.h" #include "Table.h" #include "Date.h" #include "text.h" #include "util.h" #include "main.h" extern Context context; static std::map gsColor; static std::vector gsPrecedence; //////////////////////////////////////////////////////////////////////////////// void initializeColorRules () { gsColor.clear (); gsPrecedence.clear (); // Load all the configuration values, filter to only the ones that begin with // "color.", then store name/value in gsColor, and name in rules. std::vector rules; std::vector variables; context.config.all (variables); std::vector ::iterator v; for (v = variables.begin (); v != variables.end (); ++v) { if (v->substr (0, 6) == "color.") { Color c (context.config.get (*v)); gsColor[*v] = c; rules.push_back (*v); } } // Load the rule.precedence.color list, split it, then autocomplete against // the 'rules' vector loaded above. std::vector results; std::vector precedence; split (precedence, context.config.get ("rule.precedence.color"), ','); std::vector ::iterator p; for (p = precedence.begin (); p != precedence.end (); ++p) { // Add the leading "color." string. std::string rule = "color." + *p; autoComplete (rule, rules, results); std::vector ::iterator r; for (r = results.begin (); r != results.end (); ++r) gsPrecedence.push_back (*r); } } //////////////////////////////////////////////////////////////////////////////// static void colorizeBlocked (Task& task, const std::string& rule, Color& c) { if (gsColor[rule].nontrivial ()) if (dependencyIsBlocked (task)) c.blend (gsColor[rule]); } //////////////////////////////////////////////////////////////////////////////// static void colorizeTagged (Task& task, const std::string& rule, Color& c) { if (gsColor[rule].nontrivial ()) if (task.getTagCount ()) c.blend (gsColor[rule]); } //////////////////////////////////////////////////////////////////////////////// static void colorizePriorityL (Task& task, const std::string& rule, Color& c) { if (gsColor[rule].nontrivial ()) if (task.get ("priority") == "L") c.blend (gsColor[rule]); } //////////////////////////////////////////////////////////////////////////////// static void colorizePriorityM (Task& task, const std::string& rule, Color& c) { if (gsColor[rule].nontrivial ()) if (task.get ("priority") == "M") c.blend (gsColor[rule]); } //////////////////////////////////////////////////////////////////////////////// static void colorizePriorityH (Task& task, const std::string& rule, Color& c) { if (gsColor[rule].nontrivial ()) if (task.get ("priority") == "H") c.blend (gsColor[rule]); } //////////////////////////////////////////////////////////////////////////////// static void colorizePriorityNone (Task& task, const std::string& rule, Color& c) { if (gsColor[rule].nontrivial ()) if (task.get ("priority") == "") c.blend (gsColor[rule]); } //////////////////////////////////////////////////////////////////////////////// static void colorizeActive (Task& task, const std::string& rule, Color& c) { Task::status status = task.getStatus (); if (gsColor[rule].nontrivial () && status != Task::completed && status != Task::deleted && task.has ("start")) c.blend (gsColor[rule]); } //////////////////////////////////////////////////////////////////////////////// static void colorizeTag (Task& task, const std::string& rule, Color& c) { if (task.hasTag (rule.substr (10))) c.blend (gsColor[rule]); } //////////////////////////////////////////////////////////////////////////////// static void colorizeProject (Task& task, const std::string& rule, Color& c) { // Observe the case sensitivity setting. bool sensitive = context.config.getBoolean ("search.case.sensitive"); if (compare (task.get ("project"), rule.substr (14), sensitive)) c.blend (gsColor[rule]); } //////////////////////////////////////////////////////////////////////////////// static void colorizeProjectNone (Task& task, const std::string& rule, Color& c) { if (task.get ("project") == "") c.blend (gsColor[rule]); } //////////////////////////////////////////////////////////////////////////////// static void colorizeTagNone (Task& task, const std::string& rule, Color& c) { if (task.getTagCount () == 0) c.blend (gsColor[rule]); } //////////////////////////////////////////////////////////////////////////////// static void colorizeKeyword (Task& task, const std::string& rule, Color& c) { // Observe the case sensitivity setting. bool sensitive = context.config.getBoolean ("search.case.sensitive"); // The easiest thing to check is the description, because it is just one // attribute. if (find (task.get ("description"), rule.substr (14), sensitive) != std::string::npos) c.blend (gsColor[rule]); // Failing the description check, look at all annotations, returning on the // first match. else { Task::iterator it; for (it = task.begin (); it != task.end (); ++it) { if (it->first.substr (0, 11) == "annotation_" && find (it->second.value (), rule.substr (14), sensitive) != std::string::npos) { c.blend (gsColor[rule]); return; } } } } //////////////////////////////////////////////////////////////////////////////// static void colorizeDue (Task& task, const std::string& rule, Color& c) { Task::status status = task.getStatus (); if (task.has ("due") && status != Task::completed && status != Task::deleted) { if (getDueState (task.get ("due")) == 1) c.blend (gsColor[rule]); } } //////////////////////////////////////////////////////////////////////////////// static void colorizeDueToday (Task& task, const std::string& rule, Color& c) { Task::status status = task.getStatus (); if (task.has ("due") && status != Task::completed && status != Task::deleted) { if (getDueState (task.get ("due")) == 2) c.blend (gsColor[rule]); } } //////////////////////////////////////////////////////////////////////////////// static void colorizeOverdue (Task& task, const std::string& rule, Color& c) { Task::status status = task.getStatus (); if (task.has ("due") && status != Task::completed && status != Task::deleted) { if (getDueState (task.get ("due")) == 3) c.blend (gsColor[rule]); } } //////////////////////////////////////////////////////////////////////////////// static void colorizeRecurring (Task& task, const std::string& rule, Color& c) { if (gsColor[rule].nontrivial ()) if (task.has ("recur")) c.blend (gsColor[rule]); } //////////////////////////////////////////////////////////////////////////////// void autoColorize (Task& task, Color& c) { // The special tag 'nocolor' overrides all auto and specific colorization. if (task.hasTag ("nocolor")) { c = Color (); return; } // Note: c already contains colors specifically assigned via command. // Note: These rules form a hierarchy - the last rule is King, hence the // reverse iterator. std::vector ::reverse_iterator r; for (r = gsPrecedence.rbegin (); r != gsPrecedence.rend (); ++r) { if (*r == "color.blocked") colorizeBlocked (task, *r, c); else if (*r == "color.tagged") colorizeTagged (task, *r, c); else if (*r == "color.pri.L") colorizePriorityL (task, *r, c); else if (*r == "color.pri.M") colorizePriorityM (task, *r, c); else if (*r == "color.pri.H") colorizePriorityH (task, *r, c); else if (*r == "color.pri.none") colorizePriorityNone (task, *r, c); else if (*r == "color.active") colorizeActive (task, *r, c); else if (*r == "color.project.none") colorizeProjectNone (task, *r, c); else if (*r == "color.tag.none") colorizeTagNone (task, *r, c); else if (*r == "color.due") colorizeDue (task, *r, c); else if (*r == "color.due.today") colorizeDueToday (task, *r, c); else if (*r == "color.overdue") colorizeOverdue (task, *r, c); else if (*r == "color.recurring") colorizeRecurring (task, *r, c); // Wildcards else if (r->substr (0, 9) == "color.tag") colorizeTag (task, *r, c); else if (r->substr (0, 13) == "color.project") colorizeProject (task, *r, c); else if (r->substr (0, 13) == "color.keyword") colorizeKeyword (task, *r, c); } } //////////////////////////////////////////////////////////////////////////////// std::string colorizeHeader (const std::string& input) { if (gsColor["color.header"].nontrivial ()) return gsColor["color.header"].colorize (input); return input; } //////////////////////////////////////////////////////////////////////////////// std::string colorizeFootnote (const std::string& input) { if (gsColor["color.footnote"].nontrivial ()) return gsColor["color.footnote"].colorize (input); return input; } //////////////////////////////////////////////////////////////////////////////// std::string colorizeDebug (const std::string& input) { if (gsColor["color.debug"].nontrivial ()) return gsColor["color.debug"].colorize (input); return input; } ////////////////////////////////////////////////////////////////////////////////