forked from sogou/workflow
-
Notifications
You must be signed in to change notification settings - Fork 0
/
WFAlgoTaskFactory.h
145 lines (117 loc) · 4.03 KB
/
WFAlgoTaskFactory.h
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
144
/*
Copyright (c) 2019 Sogou, Inc.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
Author: Xie Han ([email protected])
*/
#ifndef _WFALGOTASKFACTORY_H_
#define _WFALGOTASKFACTORY_H_
#include <utility>
#include <string>
#include <vector>
#include "WFTask.h"
#include "MapReduce.h"
namespace algorithm
{
template<typename T>
struct SortInput
{
T *first;
T *last;
};
template<typename T>
using SortOutput = SortInput<T>;
template<typename T>
struct MergeInput
{
T *first1;
T *last1;
T *first2;
T *last2;
T *d_first;
};
template<typename T>
struct MergeOutput
{
T *first;
T *last;
};
template<typename KEY = std::string, typename VAL = std::string>
using ReduceInput = std::vector<std::pair<KEY, VAL>>;
template<typename KEY = std::string, typename VAL = std::string>
using ReduceOutput = std::vector<std::pair<KEY, VAL>>;
} /* namespace algorithm */
template<typename T>
using WFSortTask = WFThreadTask<algorithm::SortInput<T>,
algorithm::SortOutput<T>>;
template<typename T>
using sort_callback_t = std::function<void (WFSortTask<T> *)>;
template<typename T>
using WFMergeTask = WFThreadTask<algorithm::MergeInput<T>,
algorithm::MergeOutput<T>>;
template<typename T>
using merge_callback_t = std::function<void (WFMergeTask<T> *)>;
template<typename KEY = std::string, typename VAL = std::string>
using WFReduceTask = WFThreadTask<algorithm::ReduceInput<KEY, VAL>,
algorithm::ReduceOutput<KEY, VAL>>;
template<typename KEY = std::string, typename VAL = std::string>
using reduce_callback_t = std::function<void (WFReduceTask<KEY, VAL> *)>;
class WFAlgoTaskFactory
{
public:
template<typename T, class CB = sort_callback_t<T>>
static WFSortTask<T> *create_sort_task(const std::string& queue_name,
T *first, T *last,
CB callback);
template<typename T, class CMP, class CB = sort_callback_t<T>>
static WFSortTask<T> *create_sort_task(const std::string& queue_name,
T *first, T *last,
CMP compare,
CB callback);
template<typename T, class CB = merge_callback_t<T>>
static WFMergeTask<T> *create_merge_task(const std::string& queue_name,
T *first1, T *last1,
T *first2, T *last2,
T *d_first,
CB callback);
template<typename T, class CMP, class CB = merge_callback_t<T>>
static WFMergeTask<T> *create_merge_task(const std::string& queue_name,
T *first1, T *last1,
T *first2, T *last2,
T *d_first,
CMP compare,
CB callback);
template<typename T, class CB = sort_callback_t<T>>
static WFSortTask<T> *create_psort_task(const std::string& queue_name,
T *first, T *last,
CB callback);
template<typename T, class CMP, class CB = sort_callback_t<T>>
static WFSortTask<T> *create_psort_task(const std::string& queue_name,
T *first, T *last,
CMP compare,
CB callback);
template<typename KEY = std::string, typename VAL = std::string,
class RED = algorithm::reduce_function_t<KEY, VAL>,
class CB = reduce_callback_t<KEY, VAL>>
static WFReduceTask<KEY, VAL> *
create_reduce_task(const std::string& queue_name,
RED reduce,
CB callback);
template<typename KEY = std::string, typename VAL = std::string,
class RED = algorithm::reduce_function_t<KEY, VAL>,
class CB = reduce_callback_t<KEY, VAL>>
static WFReduceTask<KEY, VAL> *
create_reduce_task(const std::string& queue_name,
algorithm::ReduceInput<KEY, VAL> input,
RED reduce,
CB callback);
};
#include "WFAlgoTaskFactory.inl"
#endif