Method insert

agent/php5/utils/double_array_trie.h:307–397

  }

  size_t insert(const std::vector<node_t> &siblings)
  {
    if (error_ < 0)
      return 0;

    size_t begin = 0;
    size_t pos = _max((size_t)siblings[0].code + 1, next_check_pos_) - 1;
    size_t nonzero_num = 0;
    int first = 0;

    if (alloc_size_ <= pos)
      resize(pos + 1);

    while (true)
    {
    next:
      ++pos;

      if (alloc_size_ <= pos)
        resize(pos + 1);

      if (array_[pos].check)
      {
        ++nonzero_num;
        continue;
      }
      else if (!first)
      {
        next_check_pos_ = pos;
        first = 1;
      }

      begin = pos - siblings[0].code;
      if (alloc_size_ <= (begin + siblings[siblings.size() - 1].code))
        resize(static_cast<size_t>(alloc_size_ *
                                   _max(1.05, 1.0 * key_size_ / progress_)));

      if (used_[begin])
        continue;

      for (size_t i = 1; i < siblings.size(); ++i)
        if (array_[begin + siblings[i].code].check != 0)
          goto next;

      break;
    }

    if (1.0 * nonzero_num / (pos - next_check_pos_ + 1) >= 0.95)
      next_check_pos_ = pos;

    used_[begin] = 1;
    size_ = _max(size_, begin + static_cast<size_t>(siblings[siblings.size() - 1].code + 1));

    for (size_t i = 0; i < siblings.size(); ++i)
      array_[begin + siblings[i].code].check = begin;

    try
    {