text: /* file: tree_traverse.h */
  /*******************************************************************************
  * Copyright 2014-2017 Intel Corporation
  * All Rights Reserved.
  *
  * If this  software was obtained  under the  Intel Simplified  Software License,
  * the following terms apply:
  *
  * The source code,  information  and material  ("Material") contained  herein is
  * owned by Intel Corporation or its  suppliers or licensors,  and  title to such
  * Material remains with Intel  Corporation or its  suppliers or  licensors.  The
  * Material  contains  proprietary  information  of  Intel or  its suppliers  and
  * licensors.  The Material is protected by  worldwide copyright  laws and treaty
  * provisions.  No part  of  the  Material   may  be  used,  copied,  reproduced,
  * modified, published,  uploaded, posted, transmitted,  distributed or disclosed
  * in any way without Intel's prior express written permission.  No license under
  * any patent,  copyright or other  intellectual property rights  in the Material
  * is granted to  or  conferred  upon  you,  either   expressly,  by implication,
  * inducement,  estoppel  or  otherwise.  Any  license   under such  intellectual
  * property rights must be express and approved by Intel in writing.
  *
  * Unless otherwise agreed by Intel in writing,  you may not remove or alter this
  * notice or  any  other  notice   embedded  in  Materials  by  Intel  or Intel's
  * suppliers or licensors in any way.
  *
  *
  * If this  software  was obtained  under the  Apache License,  Version  2.0 (the
  * "License"), the following terms apply:
  *
  * 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.
  *******************************************************************************/
  
  /*
  //++
  //  Implementation of the class defining the Decision tree classification model
  //--
  */
  
  #ifndef __TREE_CLASSIFIER_TRAVERSE__
  #define __TREE_CLASSIFIER_TRAVERSE__
  
  namespace daal
  {
  namespace algorithms
  {
  
  /**
   * @defgroup classification Classification
   * \brief Contains classes for work with the classification algorithms
   * @ingroup training_and_prediction
   */
  namespace classifier
  {
  
  /**
   * \brief Contains version 1.0 of the Intel(R) Data Analytics Acceleration Library (Intel(R) DAAL) interface.
   */
  namespace interface1
  {
  /**
   * @ingroup trees_classification
   * @{
   */
  
  /**
   * <a name="DAAL-CLASS-ALGORITHMS__CLASSIFIER__TREENODEVISITOR"></a>
   * \brief %Interface of abstract visitor used in tree traversal methods.
   *
   * \par References
   *      - \ref decision_forest::classification::interface1::Model "Model" class
   *      - \ref decision_tree::classification::interface1::Model "Model" class
   */
  class DAAL_EXPORT TreeNodeVisitor
  {
  public:
      virtual ~TreeNodeVisitor(){}
      /**
      *  This method is called by traversal method when a leaf node is visited.
      *  \param[in] level    Level in the tree where this node is located
      *  \param[in] response The value of response given by that node
      *  \return This method should return false to cancel further search and true otherwise
      */
      virtual bool onLeafNode(size_t level, size_t response) = 0;
      /**
      *  This method is called by traversal method when a split node is visited.
      *  \param[in] level        Index of the feature used in a split criteria
      *  \param[in] featureIndex Index of the feature used as a split criteria in this node
      *  \param[in] featureValue Feature value used as a split criteria in this node
      *  \return This method should return false to cancel further search and true otherwise
      */
      virtual bool onSplitNode(size_t level, size_t featureIndex, double featureValue) = 0;
  };
  
  } // namespace interface1
  
  using interface1::TreeNodeVisitor;
  
  /** @} */
  } // namespace classifier
  } // namespace algorithms
  } // namespace daal
  
  #endif
  