src/Task/TaskStore.cpp

   1 /*
   2 Copyright_License {
   3
   4   XCSoar Glide Computer - http://www.xcsoar.org/
   5   Copyright (C) 2000-2013 The XCSoar Project
   6   A detailed list of copyright holders can be found in the file "AUTHORS".
   7
   8   This program is free software; you can redistribute it and/or
   9   modify it under the terms of the GNU General Public License
  10   as published by the Free Software Foundation; either version 2
  11   of the License, or (at your option) any later version.
  12
  13   This program is distributed in the hope that it will be useful,
  14   but WITHOUT ANY WARRANTY; without even the implied warranty of
  15   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  16   GNU General Public License for more details.
  17
  18   You should have received a copy of the GNU General Public License
  19   along with this program; if not, write to the Free Software
  20   Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
  21 }
  22 */
  23
  24 #include "Task/TaskStore.hpp"
  25 #include "Task/TaskFile.hpp"
  26 #include "Task/ProtectedTaskManager.hpp"
  27 #include "Engine/Task/Ordered/OrderedTask.hpp"
  28 #include "Components.hpp"
  29 #include "OS/FileUtil.hpp"
  30 #include "LocalPath.hpp"
  31 #include "Language/Language.hpp"
  32
  33 #include <cstdio>
  34 #include <algorithm>
  35 #include <memory>
  36
  37 class TaskFileVisitor: public File::Visitor
  38 {
  39 private:
  40   TaskStore::ItemVector &store;
  41
  42 public:
  43   TaskFileVisitor(TaskStore::ItemVector &_store):
  44     store(_store) {}
  45
  46   void Visit(const TCHAR *path, const TCHAR *base_name) {
  47     // Create a TaskFile instance to determine how many
  48     // tasks are inside of this task file
  49     std::unique_ptr<TaskFile> task_file(TaskFile::Create(path));
  50     if (!task_file)
  51       return;
  52
  53     // Count the tasks in the task file
  54     unsigned count = task_file->Count();
  55     // For each task in the task file
  56     for (unsigned i = 0; i < count; i++) {
  57       // Copy base name of the file into task name
  58       StaticString<256> name(base_name);
  59
  60       // If the task file holds more than one task
  61       const TCHAR *saved_name = task_file->GetName(i);
  62       if (saved_name != NULL) {
  63         name += _T(": ");
  64         name += saved_name;
  65       } else if (count > 1) {
  66         // .. append " - Task #[n]" suffix to the task name
  67         name.AppendFormat(_T(": %s #%d"), _("Task"), i + 1);
  68       }
  69
  70       // Add the task to the TaskStore
  71       store.emplace_back(path, name.empty() ? path : name, i);
  72     }
  73   }
  74 };
  75
  76 void
  77 TaskStore::Clear()
  78 {
  79   // clear entries first
  80   store.erase(store.begin(), store.end());
  81 }
  82
  83 void
  84 TaskStore::Scan(bool extra)
  85 {
  86   Clear();
  87
  88   // scan files
  89   TaskFileVisitor tfv(store);
  90   VisitDataFiles(_T("*.tsk"), tfv);
  91
  92   if (extra) {
  93     VisitDataFiles(_T("*.cup"), tfv);
  94     VisitDataFiles(_T("*.igc"), tfv);
  95   }
  96
  97   std::sort(store.begin(), store.end());
  98 }
  99
 100 TaskStore::Item::~Item()
 101 {
 102   if (!filename.empty())
 103     delete task;
 104 }
 105
 106 OrderedTask*
 107 TaskStore::Item::GetTask(const TaskBehaviour &task_behaviour)
 108 {
 109   if (task != NULL)
 110     return task;
 111
 112   if (valid)
 113     task = TaskFile::GetTask(filename.c_str(), task_behaviour,
 114                              &way_points, task_index);
 115
 116   if (task == NULL)
 117     valid = false;
 118
 119   return task;
 120 }
 121
 122 const TCHAR *
 123 TaskStore::GetName(unsigned index) const
 124 {
 125   return store[index].GetName();
 126 }
 127
 128 const TCHAR *
 129 TaskStore::GetPath(unsigned index) const
 130 {
 131   return store[index].GetPath();
 132 }
 133
 134 OrderedTask*
 135 TaskStore::GetTask(unsigned index, const TaskBehaviour &task_behaviour)
 136 {
 137   return store[index].GetTask(task_behaviour);
 138 }