1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
|
////////////////////////////////////////////////////////////////////////////////
//
// Copyright 2010 - 2015, Göteborg Bit Factory.
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included
// in all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
// THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.
//
// http://www.opensource.org/licenses/mit-license.php
//
////////////////////////////////////////////////////////////////////////////////
#ifndef INCLUDED_TASKD
#define INCLUDED_TASKD
#include <vector>
#include <string>
#include <ConfigFile.h>
#include <Msg.h>
#include <Log.h>
#include <Directory.h>
#include <Database.h>
void command_init (Database&, const std::vector <std::string>&);
void command_config (Database&, const std::vector <std::string>&);
void command_status (Database&, const std::vector <std::string>&);
void command_help ( const std::vector <std::string>&);
void command_diag (Database&, const std::vector <std::string>&);
void command_server (Database&, const std::vector <std::string>&);
void command_add (Database&, const std::vector <std::string>&);
void command_remove (Database&, const std::vector <std::string>&);
void command_suspend (Database&, const std::vector <std::string>&);
void command_resume (Database&, const std::vector <std::string>&);
void command_client (Database&, const std::vector <std::string>&);
void command_validate (Database&, const std::vector <std::string>&);
// api.cpp
bool taskd_applyOverride (Config&, const std::string&);
void taskd_requireSetting (Config&, const std::string&);
void taskd_requireVersion (const Msg&, const std::string&);
void taskd_requireHeader (const Msg&, const std::string&, const std::string&);
bool taskd_at_least (const std::string&, const std::string&);
bool taskd_createDirectory (Directory&, bool);
bool taskd_sendMessage (Config&, const std::string&, const Msg&, Msg&);
void taskd_renderMap (const std::map <std::string, std::string>&, const std::string&, const std::string&);
bool taskd_is_org (const Directory&, const std::string&);
bool taskd_is_group (const Directory&, const std::string&, const std::string&);
bool taskd_is_user (const Directory&root, const std::string&, const std::string&);
std::string taskd_error (const int);
void taskd_staticInitialize ();
// 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
////////////////////////////////////////////////////////////////////////////////
|
