示例#1
0
文件: fft.hpp 项目: neapel/vexcl
 FFT(size_t length, fft::direction dir = fft::forward,
     const Planner &planner = Planner())
     : plan(current_context().queue(), std::vector<size_t>(1, length), std::vector<fft::direction>(1, dir), planner) {}
示例#2
0
文件: fft.hpp 项目: neapel/vexcl
 FFT(const std::initializer_list<size_t> &lengths,
     const std::initializer_list<fft::direction> &dirs,
     const Planner &planner = Planner())
     : plan(current_context().queue(), lengths, dirs, planner) {}
示例#3
0
文件: fft.hpp 项目: neapel/vexcl
 /// 1D constructor
 FFT(const std::vector<cl::CommandQueue> &queues,
     size_t length, fft::direction dir = fft::forward,
     const Planner &planner = Planner())
     : plan(queues, std::vector<size_t>(1, length), std::vector<fft::direction>(1, dir), planner) {}
示例#4
0
文件: fft.hpp 项目: neapel/vexcl
 FFT(const std::vector<cl::CommandQueue> &queues,
     const std::initializer_list<size_t> &lengths,
     const std::initializer_list<fft::direction> &dirs,
     const Planner &planner = Planner())
     : plan(queues, lengths, dirs, planner) {}
示例#5
0
文件: fft.hpp 项目: neapel/vexcl
 FFT(const std::initializer_list<size_t> &lengths, fft::direction dir = fft::forward,
     const Planner &planner = Planner())
     : plan(current_context().queue(), lengths, std::vector<fft::direction>(lengths.size(), dir), planner) {}
示例#6
0
文件: fft.hpp 项目: neapel/vexcl
 FFT(const std::vector<cl::CommandQueue> &queues,
     const std::initializer_list<size_t> &lengths, fft::direction dir = fft::forward,
     const Planner &planner = Planner())
     : plan(queues, lengths, std::vector<fft::direction>(lengths.size(), dir), planner) {}
示例#7
0
文件: fft.hpp 项目: neapel/vexcl
 FFT(const std::vector<size_t> &lengths,
     const std::vector<fft::direction> &dirs,
     const Planner &planner = Planner())
     : plan(current_context().queue(), lengths, dirs, planner) {}
示例#8
0
    TaskTask::TaskTask() : SequenceTask() {
#if BEHAVIAC_USE_HTN
        this->_planner = BEHAVIAC_NEW Planner();
#endif //BEHAVIAC_USE_HTN
    }