当前位置: 首页>>代码示例>>C++>>正文


C++ TracePointVector::reserve方法代码示例

本文整理汇总了C++中TracePointVector::reserve方法的典型用法代码示例。如果您正苦于以下问题:C++ TracePointVector::reserve方法的具体用法?C++ TracePointVector::reserve怎么用?C++ TracePointVector::reserve使用的例子?那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在TracePointVector的用法示例。


在下文中一共展示了TracePointVector::reserve方法的4个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的C++代码示例。

示例1: begin

void
Trace::GetPoints(TracePointVector &v, unsigned min_time,
                 const GeoPoint &location, fixed min_distance) const
{
  /* skip the trace points that are before min_time */
  Trace::const_iterator i = begin(), end = this->end();
  unsigned skipped = 0;
  while (true) {
    if (i == end)
      /* nothing left */
      return;

    if (i->GetTime() >= min_time)
      /* found the first point that is within range */
      break;

    ++i;
    ++skipped;
  }

  assert(skipped < size());

  v.reserve(size() - skipped);
  const unsigned range = ProjectRange(location, min_distance);
  const unsigned sq_range = range * range;
  do {
    v.push_back(*i);
    i.NextSquareRange(sq_range, end);
  } while (i != end);
}
开发者ID:damianob,项目名称:xcsoar,代码行数:30,代码来源:Trace.cpp

示例2: end

void
Trace::GetPoints(TracePointVector& iov) const
{
  iov.clear();
  iov.reserve(size());
  std::copy(begin(), end(), std::back_inserter(iov));
}
开发者ID:damianob,项目名称:xcsoar,代码行数:7,代码来源:Trace.cpp

示例3:

void 
OLCLeague::copy_solution(TracePointVector &vec) const
{
  vec.clear();
  vec.reserve(5);
  if (solution_found) {
    for (unsigned i = 0; i < 5; ++i)
      vec.push_back(best_solution[i]);
  }
}
开发者ID:galippi,项目名称:xcsoar,代码行数:10,代码来源:OLCLeague.cpp

示例4:

void
OLCDijkstra::copy_solution(TracePointVector &vec)
{
  vec.clear();
  if (solution_found) {
    vec.reserve(num_stages);
    for (unsigned i = 0; i < num_stages; ++i)
      vec.push_back(best_solution[i]);
  }
}
开发者ID:Plantain,项目名称:XCSoar,代码行数:10,代码来源:OLCDijkstra.cpp


注:本文中的TracePointVector::reserve方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。