每天学命令<get_property>Timing Path Properties

get_property 
var_name 
property 
[-clock clock_name ] 
[-view view_name ] 
[-quiet] 


介绍一下get_property命令里面的Timing Path property属性。命令的用法参考下面链接

【每天学命令<get_property>】

Timing Path Properties

arrival  返回指定timing path的arrival time

capture_clock_path  返回指定timing path的capture clock path,注意返回的是一个collection

capturing_clock 返回指定timing path的capture clock

capturing_clock_close_edge_time   返回指定timing path的capture clock close edge

capturing_clock_close_edge_type   返回指定timing path的capture clock close edge的类型,rise或者fall

capturing_clock_is_inverted  返回指定timing path的capture clock的起点和终点是否是相反的

capturing_clock_is_propagated  返回指定timing path的capture clock是否被propagated

capturing_clock_latency  返回指定timing path的capture clock latency

capturing_clock_open_edge_type  返回指定timing path的capture clock open edge

capturing_clock_pin  返回指定timing path的capture clock的pin名称

capturing_clock_source_arrival_time  返回指定timing path的capture clock path上root pin到达的时间

capturing_point 返回指定timing path的end point

capturing_point_is_level_sensitive  返回指定timing path的end point是否是电平敏感的

clock_path_end_point  返回指定timing path的capture clock path的last point

clock_uncertainty 返回指定timing path的clock uncertaint

  • 2
    点赞
  • 5
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
std::vector<std::vector<int>> LidarObjectSeg::Run(const pcl::PointCloud<pcl::PointXYZI>::Ptr &inCloud) const { if (inCloud->empty()) return {}; std::vector<std::array<double, 3>> gridPoints; GridParam gridParam = this->EstimateGridParam(inCloud, gridPoints); std::multimap<int, int> hashTable = this->UpdateHashTable(gridPoints, gridParam); std::vector<int> clusterIndices(inCloud->size(), -1); int curClusterIdx = 0; START_HOST_TIMING(ExtractClusters) for (std::size_t i = 0; i < inCloud->size(); ++i) { if (clusterIndices[i] >= 0) continue; const auto &curGridPoint = gridPoints[i]; std::vector<int> neighborIndices = this->GetNeighbors(curGridPoint, gridParam, hashTable); for (int neighborIdx : neighborIndices) { if (neighborIdx == i) continue; int curPointVoxelIdx = clusterIndices[i]; int neighborVoxelIdx = clusterIndices[neighborIdx]; if (curPointVoxelIdx >= 0 && neighborVoxelIdx >= 0) { if (curPointVoxelIdx != neighborVoxelIdx) this->MergeClusters(clusterIndices, curPointVoxelIdx, neighborVoxelIdx); } else { if (curPointVoxelIdx < 0) clusterIndices[i] = neighborVoxelIdx; else clusterIndices[neighborIdx] = curPointVoxelIdx; } } if (clusterIndices[i] < 0 && neighborIndices.size() >= numMinPoints_) { for (int neighborIdx : neighborIndices) { clusterIndices[neighborIdx] = curClusterIdx; } curClusterIdx++; } } STOP_HOST_TIMING(ExtractClusters) START_HOST_TIMING(GetAllClusters) std::vector<std::vector<int>> allClusters = this->GetAllClusters(clusterIndices); STOP_HOST_TIMING(GetAllClusters) PRINT_ALL_TIMING() return allClusters; }
最新发布
06-01

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值