1 /** 2 * Copyright 2020 Huawei Technologies Co., Ltd 3 * 4 * Licensed under the Apache License, Version 2.0 (the "License"); 5 * you may not use this file except in compliance with the License. 6 * You may obtain a copy of the License at 7 * 8 * http://www.apache.org/licenses/LICENSE-2.0 9 * 10 * Unless required by applicable law or agreed to in writing, software 11 * distributed under the License is distributed on an "AS IS" BASIS, 12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 13 * See the License for the specific language governing permissions and 14 * limitations under the License. 15 */ 16 17 #ifndef MINDSPORE_CORE_OPS_TOPK_H_ 18 #define MINDSPORE_CORE_OPS_TOPK_H_ 19 #include <memory> 20 #include <string> 21 #include <vector> 22 23 #include "mindapi/base/types.h" 24 #include "ops/base_operator.h" 25 26 namespace mindspore { 27 namespace ops { 28 constexpr auto kNameTopK = "TopK"; 29 /// \brief Finds values and indices of the k largest entries along the last dimension. 30 /// Refer to Python API @ref mindspore.ops.TopK for more details. 31 class MIND_API TopK : public BaseOperator { 32 public: 33 MIND_API_BASE_MEMBER(TopK); 34 /// \brief Constructor. BaseOperator(k_name)35 explicit TopK(const std::string &k_name = kNameTopK) : BaseOperator(k_name) { 36 InitIOName({"input", "k"}, {"values", "indices"}); 37 } 38 /// \brief Init. Refer to the parameters of Python API @ref mindspore.ops.TopK for the inputs. 39 void Init(const bool sorted = false); 40 /// \brief Set sorted. 41 void set_sorted(const bool sorted); 42 /// \brief Get sorted. 43 /// 44 /// \return sorted. 45 bool get_sorted() const; 46 bool get_attr(const char *attr) const; 47 }; 48 MIND_API abstract::AbstractBasePtr TopKInfer(const abstract::AnalysisEnginePtr &, const PrimitivePtr &primitive, 49 const std::vector<abstract::AbstractBasePtr> &input_args); 50 } // namespace ops 51 } // namespace mindspore 52 53 #endif // MINDSPORE_CORE_OPS_TOPK_H_ 54