/* 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 (xiehan@sogou-inc.com) */ #ifndef _WFALGOTASKFACTORY_H_ #define _WFALGOTASKFACTORY_H_ #include #include #include #include "WFTask.h" #include "MapReduce.h" namespace algorithm { template struct SortInput { T *first; T *last; }; template struct SortOutput { T *first; T *last; }; template struct MergeInput { T *first1; T *last1; T *first2; T *last2; T *d_first; }; template struct MergeOutput { T *first; T *last; }; template using ReduceInput = std::vector>; template using ReduceOutput = std::vector>; } /* namespace algorithm */ template using WFSortTask = WFThreadTask, algorithm::SortOutput>; template using sort_callback_t = std::function *)>; template using WFMergeTask = WFThreadTask, algorithm::MergeOutput>; template using merge_callback_t = std::function *)>; template using WFReduceTask = WFThreadTask, algorithm::ReduceOutput>; template using reduce_callback_t = std::function *)>; class WFAlgoTaskFactory { public: template> static WFSortTask *create_sort_task(const std::string& queue_name, T *first, T *last, CB callback); template> static WFSortTask *create_sort_task(const std::string& queue_name, T *first, T *last, CMP compare, CB callback); template> static WFMergeTask *create_merge_task(const std::string& queue_name, T *first1, T *last1, T *first2, T *last2, T *d_first, CB callback); template> static WFMergeTask *create_merge_task(const std::string& queue_name, T *first1, T *last1, T *first2, T *last2, T *d_first, CMP compare, CB callback); template> static WFSortTask *create_psort_task(const std::string& queue_name, T *first, T *last, CB callback); template> static WFSortTask *create_psort_task(const std::string& queue_name, T *first, T *last, CMP compare, CB callback); template, class CB = reduce_callback_t> static WFReduceTask * create_reduce_task(const std::string& queue_name, RED reduce, CB callback); template, class CB = reduce_callback_t> static WFReduceTask * create_reduce_task(const std::string& queue_name, algorithm::ReduceInput input, RED reduce, CB callback); }; #include "WFAlgoTaskFactory.inl" #endif