Method build_path

library/src/trans_table/trans_table_s.cpp:700–845

auto TransTableS::build_path(
  const int win_mask_[],
  const int win_order_set[],
  const int u_bound,
  const int l_bound,
  const char best_move_suit,
  const char best_move_rank,
  PosSearchSmall * node_ptr,
  bool& result) -> NodeCards *
{
  /* If result is TRUE, a new SOP has been created and build_path returns a
  pointer to it. If result is FALSE, an existing SOP is used and build_path
  returns a pointer to the SOP */

  bool found;
  WinCard * np, *p2, *nprev;
  NodeCards *p;

  np = node_ptr->pos_search_point_;
  nprev = nullptr;
  int suit = 0;

  /* If winning node has a card that equals the next winning card deduced
  from the position, then there already exists a (partial) path */

  if (np == nullptr)
  {
    /* There is no winning list created yet */
    /* Create winning nodes */
    p2 = &(win_cards_[win_set_size_]);
    add_win_set();
    p2->next_ = nullptr;
    p2->next_win_ = nullptr;
    p2->prev_win_ = nullptr;
    node_ptr->pos_search_point_ = p2;
    p2->win_mask_ = win_mask_[suit];
    p2->order_set_ = win_order_set[suit];
    p2->first_ = nullptr;
    np = p2;           /* Latest winning node */
    suit++;
    while (suit < DDS_SUITS)
    {
      p2 = &(win_cards_[win_set_size_]);
      add_win_set();
      np->next_win_ = p2;
      p2->prev_win_ = np;
      p2->next_ = nullptr;
      p2->next_win_ = nullptr;
      p2->win_mask_ = win_mask_[suit];
      p2->order_set_ = win_order_set[suit];
      p2->first_ = nullptr;
      np = p2;         /* Latest winning node */
      suit++;
    }
    p = &(node_cards_[node_set_size_]);
    add_node_set();
    np->first_ = p;
    result = true;