Method Insert

include/tscore/Trie.h:142–185

template <typename T>
bool
Trie<T>::Insert(const char *key, T *value, int rank, int key_len /* = -1 */)
{
  _CheckArgs(key, key_len);

  Node *next_node;
  Node *curr_node = &m_root;
  int   i         = 0;

  while (true) {
    if (dbg_ctl_insert.on()) {
      Dbg(dbg_ctl_insert, "Visiting Node...");
      curr_node->Print(dbg_ctl_insert);
    }

    if (i == key_len) {
      break;
    }

    next_node = curr_node->GetChild(key[i]);
    if (!next_node) {
      while (i < key_len) {
        Dbg(dbg_ctl_insert, "Creating child node for char %c (%d)", key[i], key[i]);
        curr_node = curr_node->AllocateChild(key[i]);
        ++i;
      }
      break;
    }
    curr_node = next_node;
    ++i;
  }

  if (curr_node->occupied) {
    Dbg(dbg_ctl_insert, "Cannot insert duplicate!");
    return false;
  }

  curr_node->occupied = true;
  curr_node->value    = value;
  curr_node->rank     = rank;
  m_value_list.enqueue(curr_node->value);
  Dbg(dbg_ctl_insert, "inserted new element!");
  return true;
}

template <typename T>
T *