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 <vector> 20 #include <memory> 21 #include <string> 22 #include "ops/primitive_c.h" 23 #include "abstract/abstract_value.h" 24 #include "utils/check_convert_utils.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 MS_CORE_API TopK : public PrimitiveC { 32 public: 33 /// \brief Constructor. PrimitiveC(k_name)34 explicit TopK(const std::string &k_name = kNameTopK) : PrimitiveC(k_name) { 35 InitIOName({"input", "k"}, {"values", "indices"}); 36 } 37 /// \brief Destructor. 38 ~TopK() = default; 39 MS_DECLARE_PARENT(TopK, PrimitiveC); 40 /// \brief Init. Refer to the parameters of Python API @ref mindspore.ops.TopK for the inputs. 41 void Init(const bool sorted = false); 42 /// \brief Set sorted. 43 void set_sorted(const bool sorted); 44 /// \brief Get sorted. 45 /// 46 /// \return sorted. 47 bool get_sorted() const; 48 }; 49 AbstractBasePtr TopKInfer(const abstract::AnalysisEnginePtr &, const PrimitivePtr &primitive, 50 const std::vector<AbstractBasePtr> &input_args); 51 using PrimTopKPtr = std::shared_ptr<TopK>; 52 } // namespace ops 53 } // namespace mindspore 54 55 #endif // MINDSPORE_CORE_OPS_TOPK_H_ 56