• 设为首页
  • 点击收藏
  • 手机版
    手机扫一扫访问
    迪恩网络手机版
  • 关注官方公众号
    微信扫一扫关注
    公众号
登陆 注册

C++ pts函数代码示例

原作者: [db:作者] 来自: [db:来源] 收藏 邀请

本文整理汇总了C++中pts函数的典型用法代码示例。如果您正苦于以下问题：C++ pts函数的具体用法？C++ pts怎么用？C++ pts使用的例子？那么恭喜您, 这里精选的函数代码示例或许可以为您提供帮助。



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

示例1: pts

/*
 *  returns a roboop spline given the joint space via points and total duration
 */
Spl_path* TrajectoryController::createSpline(vector<ColumnVector>& jsPoints,
		double duration) {

	int size = jsPoints.size();
	if (size < 5) {
		return NULL;
	}

	//One row for time + 6 for each joint
	//TODO: ?? + 2 for adding the start and stop positions extra to keep the spline smooth
	Matrix pts(7, size);

	for (int i = 0; i < size; i++) {
		double time = 0.999 * (duration * i) / (size - 1);
		ColumnVector p = jsPoints.at(i);

		int index = i + 1;
		pts(1, index) = time;
		pts.SubMatrix(2, 7, index, index) = p;
	}
	cout << pts << endl;

	Spl_path* sp = new Spl_path(pts);
	return sp;
}
开发者ID:harshmdeshpande，项目名称:LWIM_Control_System，代码行数:28，代码来源:TrajectoryController.cpp


示例2: 

std::unique_ptr<SceneGraph::Node> AddChain::synchronize(
    std::unique_ptr<SceneGraph::Node> n) {
  if (pts().size() == 0) {
    return nullptr;
  }

  if (m_state & DirtyState::Points) {
    n = std::make_unique<Node>(pts());
    m_state ^= DirtyState::Points;
  }

  Node* node = static_cast<Node*>(n.get());
  if (m_state & DirtyState::MousePos) {
    node->setLastPoint(m_mousePos);
    m_state ^= DirtyState::MousePos;
  }

  if (m_state & DirtyState::Finished) {
    n = nullptr;

    m_pts.clear();
    m_state ^= DirtyState::Finished;
  }

  return n;
}
开发者ID:lemourin，项目名称:GameEngine，代码行数:26，代码来源:AddChain.cpp


示例3: ParameterIDBeamIntegration

XC::MidDistanceBeamIntegration::MidDistanceBeamIntegration(int nIP,const Vector &pt)
  : ParameterIDBeamIntegration(BEAM_INTEGRATION_TAG_MidDistance,pt)
  {

    for(int i = 0; i < nIP; i++)
      {
        int key = i;
        for(int j = i+1; j < nIP; j++)
          {
            if(pts(j) < pts(key))
              {
	        key = j;
	        std::cerr << "MidDistanceBeamIntegration::MidDistanceBeamIntegration -- point are not sorted; sort before calling constructor" << std::endl;
              }
          }
        //double temp = pts(i);
        //pts(i) = pts(key);
        //pts(key) = temp;
      }

    Vector mids(nIP-1);

    for(int i = 0; i < nIP-1; i++)
      {
        mids(i) = 0.5*(pts(i)+pts(i+1));
      }

    wts(0) = mids(0);
    wts(nIP-1) = 1.0-mids(nIP-2);
    for(int i = 1; i < nIP-1; i++)
      { wts(i) = mids(i)-mids(i-1); }
  }
开发者ID:lcpt，项目名称:xc，代码行数:32，代码来源:MidDistanceBeamIntegration.cpp


示例4: error

int Dmc_method::allocateIntermediateVariables(System * sys,
                                              Wavefunction_data * wfdata) {
  if(wf) delete wf;
  wf=NULL;
  if(sample) delete sample;
  sample=NULL;
  nelectrons=sys->nelectrons(0)+sys->nelectrons(1);
  wfdata->generateWavefunction(wf);
  sys->generateSample(sample);
  sample->attachObserver(wf);
  nwf=wf->nfunc();

  if(wf->nfunc() >1) 
    error("DMC doesn't support more than one guiding wave function");

  guidingwf=new Primary;

  pts.Resize(nconfig);
  for(int i=0; i < nconfig; i++) {
    pts(i).age.Resize(nelectrons);
    pts(i).age=0;
  }
  
  average_var.Resize(avg_words.size());
  average_var=NULL;
  for(int i=0; i< average_var.GetDim(0); i++) { 
    allocate(avg_words[i], sys, wfdata, average_var(i));
  }
  

  return 1;
}
开发者ID:WagnerGroup，项目名称:PK_ExperimentalMainline，代码行数:32，代码来源:Dmc_method.cpp


示例5: dump

void SkIntersectionHelper::dump() const {
    SkDPoint::Dump(pts()[0]);
    SkDPoint::Dump(pts()[1]);
    if (verb() >= SkPath::kQuad_Verb) {
        SkDPoint::Dump(pts()[2]);
    }
    if (verb() >= SkPath::kCubic_Verb) {
        SkDPoint::Dump(pts()[3]);
    }
}
开发者ID:llluiop，项目名称:skia，代码行数:10，代码来源:PathOpsDebug.cpp


示例6: assert

bool TrainExample::isEqual(const ParseTree & pt) const
{    
    assert(pts().size() >= 2);

    const ParseInfo * p = pts()[0].rootNode()->parseInfo(&pts()[0]);
    const ParseInfo * p1 = pt.rootNode()->parseInfo(&pt);

    assert(p);
    assert(p1);

    return (pts()[0].dataId() == pt.dataId()) &&
           (p->c_ == p1->c_) && (p->l_ == p1->l_) &&
            (p->x_ == p1->x_) && (p->y_ == p1->y_ );
}
开发者ID:LHY20，项目名称:AOGDetector，代码行数:14，代码来源:ParseTree.cpp


示例7: hex_5elem_inline

    void hex_5elem_inline()
    {
      libMesh::Point origin = libMesh::Point(0,0.5,0.5);

      // end points
      std::vector<libMesh::Point> pts(5);
      pts[0] = libMesh::Point(5.0,0.5,0.5);    // right
      pts[1] = libMesh::Point(3.75,0.0,0.25);  // front
      pts[2] = libMesh::Point(1.25,0.77,1.0);  // top
      pts[3] = libMesh::Point(2.22,1.0,0.667); // back
      pts[4] = libMesh::Point(0.38,0.57,0.0);  // bottom

      // exit_elem IDs
      std::vector<unsigned int> exit_ids(5);
      exit_ids[0] = 4;
      exit_ids[1] = 3;
      exit_ids[2] = 1;
      exit_ids[3] = 2;
      exit_ids[4] = 0;

      std::string hex8_string = this->mesh_3D("HEX8",5.0,1.0,1.0,5,1,1);
      std::string hex27_string = this->mesh_3D("HEX27",5.0,1.0,1.0,5,1,1);

      this->run_test_with_mesh_from_file(origin,pts,exit_ids,hex8_string);
      this->run_test_with_mesh_from_file(origin,pts,exit_ids,hex27_string);
    }
开发者ID:grinsfem，项目名称:grins，代码行数:26，代码来源:rayfire_test_3d.C


示例8: pts

void MapCarObject::DrawObject(const QRect & rBox, QPainter * pDC, MapObjectState eState) const
{
	short iHeading;
	float cos0, sin0;
	QPoint ptCenter;
	QPointArray pts(3);

	if (m_pCar == NULL)
		return;

	m_pCar->m_mutexUpdate.lock();
	iHeading = m_pCar->GetCurrentDirection();
	m_pCar->m_mutexUpdate.unlock();

	ptCenter = rBox.center();
	cos0 = cosf(iHeading * RADIANSPERCENTIDEGREE);
	sin0 = sinf(iHeading * RADIANSPERCENTIDEGREE);

	pts[0] = ptCenter + QPoint((int)round(MAPCAROBJECT_CIRCLE_RADIUS*sin0), (int)round(-MAPCAROBJECT_CIRCLE_RADIUS*cos0));
	pts[1] = ptCenter + QPoint((int)round((MAPCAROBJECT_ARROW_WIDTH/2)*cos0-(MAPCAROBJECT_ARROW_LENGTH-MAPCAROBJECT_CIRCLE_RADIUS)*sin0), (int)round((MAPCAROBJECT_ARROW_LENGTH-MAPCAROBJECT_CIRCLE_RADIUS)*cos0+(MAPCAROBJECT_ARROW_WIDTH/2)*sin0));
	pts[2] = ptCenter + QPoint((int)round(-(MAPCAROBJECT_ARROW_WIDTH/2)*cos0-(MAPCAROBJECT_ARROW_LENGTH-MAPCAROBJECT_CIRCLE_RADIUS)*sin0), (int)round((MAPCAROBJECT_ARROW_LENGTH-MAPCAROBJECT_CIRCLE_RADIUS)*cos0-(MAPCAROBJECT_ARROW_WIDTH/2)*sin0));

	pDC->setPen(QPen(m_clrDraw, eState & MapObjectStateCurrent ? 2 : 0));
	pDC->drawLine(pts[0], pts[1]);
	pDC->drawLine(pts[0], pts[2]);
	if (!(eState & MapObjectStateInactive))
		pDC->drawEllipse((int)round(ptCenter.x() - MAPCAROBJECT_CIRCLE_RADIUS), (int)round(ptCenter.y() - MAPCAROBJECT_CIRCLE_RADIUS), (int)round(2*MAPCAROBJECT_CIRCLE_RADIUS), (int)round(2*MAPCAROBJECT_CIRCLE_RADIUS));
	if (hasReceivedCurrentMsg())
	{
		QBrush brushOld = pDC->brush();
		pDC->setBrush(m_clrDraw);
		pDC->drawPolygon(pts);
		pDC->setBrush(brushOld);
	}
}
开发者ID:PennTao，项目名称:GrooveNet，代码行数:35，代码来源:CarModel.cpp


示例9: computeAngle

void ArrowLine::drawShape(QPainter &p)
{
    p.setPen(darkGray);
    QCanvasLine::drawShape(p);

    double angle = computeAngle(startPoint().x(),
                                startPoint().y(),
                                endPoint().x(),
                                endPoint().y());
    QPointArray pts(3);

    QWMatrix m;
    int x, y;
    m.rotate(angle);
    m.map(-5, -2, &x, &y);
    pts.setPoint(0, x, y);
    m.map(-5, 2, &x, &y);
    pts.setPoint(1, x, y);
    m.map(0, 0, &x, &y);
    pts.setPoint(2, x, y);

    pts.translate(endPoint().x(), endPoint().y());

    p.setBrush(QColor(darkGray));
    p.drawPolygon(pts);
}
开发者ID:BackupTheBerlios，项目名称:poa，代码行数:26，代码来源:scheduledialog.cpp


示例10: EG_VTKSP

void PolyMolecule::createPolyData(vtkPolyData *poly_data)
{
  int N = m_Nodes.size();
  EG_VTKSP(vtkPoints, points);
  points->SetNumberOfPoints(N);
  for (int i = 0; i < N; ++i) {
    vec3_t x = getXNode(i);
    points->SetPoint(i, x.data());
  }
  poly_data->Allocate(m_Faces.size());
  poly_data->SetPoints(points);
  for (int i = 0; i < m_Faces.size(); ++i) {
    QVector<vtkIdType> pts(m_Faces[i].size());
    for (int j = 0; j < m_Faces[i].size(); ++j) {
      pts[j] = m_Faces[i][j];
    }
    if (pts.size() == 3) {
      poly_data->InsertNextCell(VTK_TRIANGLE, pts.size(), pts.data());
    } else if (pts.size() == 4) {
      poly_data->InsertNextCell(VTK_QUAD, pts.size(), pts.data());
    } else {
      poly_data->InsertNextCell(VTK_POLYGON, pts.size(), pts.data());
    }
  }
}
开发者ID:danbarrynz，项目名称:engrid，代码行数:25，代码来源:polymolecule.cpp


示例11: fit_BB

/**
 * @function fit_BB
 * @brief 
 */
void fit_BB( std::vector<pcl::PointCloud<pcl::PointXYZRGBA>::Ptr > _clusters ) {
    
    double dim[3]; Eigen::Isometry3d Tf;

    for( int i = 0; i < _clusters.size(); ++i ) {
	printf("\t * Fitting box for cluster %d \n", i );

	pcl::PointCloud<pcl::PointXYZ>::Ptr p( new pcl::PointCloud<pcl::PointXYZ>() );
	p->points.resize( _clusters[i]->points.size() );
	for(int j = 0; j < _clusters[i]->points.size(); ++j ) {
	    p->points[j].x = _clusters[i]->points[j].x;
	    p->points[j].y = _clusters[i]->points[j].y;
	    p->points[j].z = _clusters[i]->points[j].z;
	}
	p->width = 1; p->height = p->points.size();

	// Get Bounding Box
	pointcloudToBB( p, dim, Tf );
	// Store (cube)
	pcl::PointCloud<pcl::PointXYZ>::Ptr pts( new pcl::PointCloud<pcl::PointXYZ>() );
	pcl::PointCloud<pcl::PointXYZ>::Ptr final( new pcl::PointCloud<pcl::PointXYZ>() );

	pts = sampleSQ_uniform( dim[0]/2, dim[1]/2, dim[2]/2, 0.1, 0.1 );
	pcl::transformPointCloud( *pts, *final, Tf.matrix() );

	char name[50];
	sprintf( name, "bb_%d.pcd", i);
	pcl::io::savePCDFileASCII(name, *final );
    }


}
开发者ID:ana-GT，项目名称:golems，代码行数:36，代码来源:crichton_eye_v2.cpp


示例12: hex_27elem_3x3x3

    void hex_27elem_3x3x3()
    {
      libMesh::Point origin = libMesh::Point(0.0,1.5,1.5);

       // end points
      std::vector<libMesh::Point> pts(5);
      pts[0] = libMesh::Point(3.0,1.5,1.5);     // right
      pts[1] = libMesh::Point(1.875,0.0,2.584); // front
      pts[2] = libMesh::Point(1.1,2.67,3.0);    // top
      pts[3] = libMesh::Point(2.75,3.0,0.25);   // back
      pts[4] = libMesh::Point(2.23,2.59,0.0);   // bottom

      // exit_elem IDs
      std::vector<unsigned int> exit_ids(5);
      exit_ids[0] = 14;
      exit_ids[1] = 19;
      exit_ids[2] = 25;
      exit_ids[3] = 8;
      exit_ids[4] = 8;

      std::string hex8_string = this->mesh_3D("HEX8",3.0,3.0,3.0,3,3,3);
      std::string hex27_string = this->mesh_3D("HEX27",3.0,3.0,3.0,3,3,3);

      this->run_test_with_mesh_from_file(origin,pts,exit_ids,hex8_string);
      this->run_test_with_mesh_from_file(origin,pts,exit_ids,hex27_string);
    }
开发者ID:grinsfem，项目名称:grins，代码行数:26，代码来源:rayfire_test_3d.C


示例13: TEST

TEST(kdtree, DefaultConstructor)
{
    typedef double realScalarType;
    typedef point<realScalarType> pointType;
    typedef kdTree<pointType> kdTreeType;

    std::default_random_engine generator;

    std::normal_distribution<double> distribution(0.,1.0);

    const size_t numDims = 1;
    const size_t numPoints = 10;

    std::vector<pointType> pts(numPoints);


    for(size_t i=0;i<numPoints;++i)
    {
        std::vector<double> pv(numDims);
        for(size_t j=0;j<numDims;++j)
        {
            pv[j] = distribution(generator);
        }

        pointType pt(pv);

        pts[i] = pt;
    }

    kdTreeType kdtr(pts);
}
开发者ID:tbs1980，项目名称:simpleKDTree，代码行数:31，代码来源:kdTree.cpp


示例14: u

void NurbsCurveSP<T,N>::modOnlySurfCPby(int i, const HPoint_nD<T,N>& a) {
    Vector<T> u(2*deg_+3) ;
    Vector< Point_nD<T,N> > pts(2*deg_+3) ;

    int n=0;
    for(int j=i-deg_-1; j<=i+deg_+1; ++j) {
        if(j<0)
            continue ;
        if(j>=P.n())
            break ;
        u[n] = maxAt_[j] ;
        if( j == i) {
            pts[n].x() = a.x() ;
            pts[n].y() = a.y() ;
            pts[n].z() = a.z() ;
        }
        //else
        //  pts[n] = Point3D(0,0,0) ; pts is alredy set to 0,0,0
        ++n ;
    }

    u.resize(n) ;
    pts.resize(n) ;

    movePoint(u,pts) ;
}
开发者ID:raazui，项目名称:3D-Surface-Reconstruction，代码行数:26，代码来源:nurbs_sp.cpp


示例15: pts

visualization_msgs::MarkerArray OccupancyGrid::getVisualization(std::string type)
{
  visualization_msgs::MarkerArray ma;

  if(type.compare("bounds") == 0)
  {
    double dimx, dimy, dimz, originx, originy, originz;
    std::vector<geometry_msgs::Point> pts(10);
    getOrigin(originx, originy, originz);
    getWorldSize(dimx,dimy,dimz);
    pts[0].x = originx;      pts[0].y = originy;      pts[0].z = originz;
    pts[1].x = originx+dimx; pts[1].y = originy;      pts[1].z = originz;
    pts[2].x = originx+dimx; pts[2].y = originy+dimy; pts[2].z = originz;
    pts[3].x = originx;      pts[3].y = originy+dimy; pts[3].z = originz;
    pts[4].x = originx;      pts[4].y = originy;      pts[4].z = originz;
    pts[5].x = originx;      pts[5].y = originy;      pts[5].z = originz+dimz;
    pts[6].x = originx+dimx; pts[6].y = originy;      pts[6].z = originz+dimz;
    pts[7].x = originx+dimx; pts[7].y = originy+dimy; pts[7].z = originz+dimz;
    pts[8].x = originx;      pts[8].y = originy+dimy; pts[8].z = originz+dimz;
    pts[9].x = originx;      pts[9].y = originy;      pts[9].z = originz+dimz;

    ma.markers.resize(1);
    ma.markers[0] = viz::getLineMarker(pts, 0.05, 10, getReferenceFrame(), "collision_space_bounds", 0);
  }
  else if(type.compare("distance_field") == 0)
  {
    visualization_msgs::Marker m;
    // grid_->getIsoSurfaceMarkers(0.01, 0.03, getReferenceFrame(), ros::Time::now(),  Eigen::Affine3d::Identity(), m);
    //grid_->getIsoSurfaceMarkers(0.01, 0.08, getReferenceFrame(), ros::Time::now(), tf::Transform(tf::createIdentityQuaternion(), tf::Vector3(0,0,0)), m);
    grid_->getIsoSurfaceMarkers(0.01, 0.02, getReferenceFrame(), ros::Time::now(), m);
    m.color.a +=0.2;
    ma.markers.push_back(m);
  }
  else if(type.compare("occupied_voxels") == 0)
  {
    visualization_msgs::Marker marker;
    std::vector<geometry_msgs::Point> voxels;
    getOccupiedVoxels(voxels);
    marker.header.seq = 0;
    marker.header.stamp = ros::Time::now();
    marker.header.frame_id = getReferenceFrame();
    marker.ns = "occupied_voxels";
    marker.id = 1;
    marker.type = visualization_msgs::Marker::POINTS;
    marker.action = visualization_msgs::Marker::ADD;
    marker.lifetime = ros::Duration(0.0);
    marker.scale.x = grid_->getResolution() / 2.0;
    marker.scale.y = grid_->getResolution() / 2.0;
    marker.scale.z = grid_->getResolution() / 2.0;
    marker.color.r = 0.8;
    marker.color.g = 0.3;
    marker.color.b = 0.5;
    marker.color.a = 1;
    marker.points = voxels;
    ma.markers.push_back(marker);
  }
  else
    ROS_ERROR("No visualization found of type '%s'.", type.c_str());
  return ma;
}
开发者ID:bcohen，项目名称:sbpl_manipulation，代码行数:60，代码来源:occupancy_grid.cpp


示例16: pts

void QChain::cutCircle(Circle circle) {
  if (m_vertices.size() == 0) return;
  circle.setCenter(circle.pos());

  QPainterPath cr;
  cr.addEllipse(circle.x - circle.r, circle.y - circle.r, 2 * circle.r,
                2 * circle.r);

  QPolygonF polygon;
  for (QPointF p : m_vertices) polygon.append(p);
  QPainterPath chain;
  chain.addPolygon(polygon);

  if (!chain.intersects(cr)) return;

  chain = chain.subtracted(cr);

  for (const QPolygonF &poly : chain.toSubpathPolygons()) {
    std::vector<Vector2d> pts(poly.begin(), poly.end() - 1);

    if (std::fabs(Geometry::area(pts.begin(), pts.end())) > 5.f) {
      auto chain = std::make_unique<QChain>(world());
      chain->setVertices(std::vector<QPointF>(pts.begin(), pts.end()));
      chain->initializeLater(world());

      world()->itemSet()->addBody(std::move(chain));
    }
  }

  m_vertices.clear();
  destroyLater();
}
开发者ID:Hakiko，项目名称:GameEngine，代码行数:32，代码来源:QChain.cpp


示例17: quit

void Widget::showGnuplot(){
    Gnuplot gp;

    std::cout << "Press Ctrl-C to quit (closing gnuplot window doesn't quit)." << std::endl;

    gp << "set yrange [-1:1]\n";

    const int N = 1000;
    std::vector<double> pts(N);

    double theta = 0;
    while(1) {
        for(int i=0; i<N; i++) {
            double alpha = (double(i)/N-0.5) * 10;
            pts[i] = sin(alpha*8.0 + theta) * exp(-alpha*alpha/2.0);
        }

        gp << "plot '-' binary" << gp.binFmt1d(pts, "array") << "with lines notitle\n";
        gp.sendBinary1d(pts);
        gp.flush();

        theta += 0.2;
        myMath::mysleep(100);
    }
}
开发者ID:JuarezASF，项目名称:Code，代码行数:25，代码来源:widget.cpp


示例18: bool

unsigned int RemoveDuplicate::removeDuplicateTriangles(std::vector<unsigned int>& tris)
{
	int numT = (int)tris.size();

	std::map<Triangle, int, bool(*)(const Triangle&, const Triangle&)> pts(Triangleless);
	
	std::vector<unsigned int> trisNew; trisNew.reserve(numT);

	int cnt = 0;
	for(int i1 = 0; i1 < numT/3; i1++)
	{
		Triangle tri;
		tri.Idx0 = tris[3*i1+0];
		tri.Idx1 = tris[3*i1+1];
		tri.Idx2 = tris[3*i1+2];

		std::map<Triangle, int, bool(*)(const Triangle&, const Triangle&)>::iterator it = pts.find(tri);

		if(it == pts.end())
		{
			pts.insert(std::make_pair(tri, cnt));
			trisNew.push_back(tri.Idx0);
			trisNew.push_back(tri.Idx1);
			trisNew.push_back(tri.Idx2);
			cnt++;
		}
	}

	tris = std::vector<unsigned int>(trisNew.begin(), trisNew.end());

	std::cerr << "Removed " << numT/3-cnt << " duplicate triangles of " << numT/3 << " triangles" << std::endl;

	return cnt;
}
开发者ID:ZaneYang，项目名称:VoxelHashing，代码行数:34，代码来源:removeDuplicate.cpp


示例19: eval

    //===========================================================================
    void Eval1D3DSurf::eval(double u, double v, int n, Point der[]) const
    //===========================================================================
    {
        if (n == 0)
        {
	  der[0] = eval(u, v);
	  return;
        }

	vector<Point> pts((n+1)*(n+2)/2);
	sf_->point(pts, u, v, n);
	if (sf_->dimension() == 1)
	  {
	    der[0] = Point(u, v, pts[0][0]);
	    if (n >= 1)
	      {
		der[1] = Point(1, 0, pts[1][0]);
		der[2] = Point(0, 1, pts[2][0]);
		for (size_t ki=3; ki<pts.size(); ++ki)
		  der[ki] = Point(0, 0, pts[ki][0]);
	      }
	  }
	else
	  {
	    for (size_t ki=0; ki<pts.size(); ++ki)
	      der[ki] = pts[ki];
	  }
    }
开发者ID:SINTEF-Geometry，项目名称:GoTools，代码行数:29，代码来源:Eval1D3DSurf.C


示例20: pts

/*private static*/
TaggedLineString::CoordVectPtr
TaggedLineString::extractCoordinates(
		const std::vector<TaggedLineSegment*>& segs)
{
	CoordVectPtr pts(new CoordVect());

#if GEOS_DEBUG
	cerr << __FUNCTION__ << " segs.size: " << segs.size() << endl;
#endif

	std::size_t i=0, size=segs.size();

	assert(size);

	for (; i<size; i++)
	{
		TaggedLineSegment* seg = segs[i];
		assert(seg);
		pts->push_back(seg->p0);
	}

	// add last point
	pts->push_back(segs[size-1]->p1);

	return pts;
}
开发者ID:aaronr，项目名称:geos，代码行数:27，代码来源:TaggedLineString.cpp



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

鲜花
握手
雷人
路过
鸡蛋
该文章已有0人参与评论

请发表评论

全部评论

专题导读
More+
上一篇：
C++ ptu_classify_s函数代码示例发布时间：2022-05-30
下一篇：
C++ ptrhash_bp函数代码示例发布时间：2022-05-30
热门推荐
More+
热门话题
More+
阅读排行榜

扫描微信二维码

查看手机版网站

随时了解更新最新资讯

139-2527-9053

在线客服（服务时间 9:00～18:00）

在线QQ客服
地址：深圳市南山区西丽大学城创智工业园
电邮：jeky_zhao#qq.com
移动电话：139-2527-9053

Powered by 互联科技 X3.4© 2001-2213 极客世界.|Sitemap