Home
last modified time | relevance | path

Searched refs:pNeighbor (Results 1 – 9 of 9) sorted by relevance

/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/base/io/
H A DioWriteBook.c754 pOrdered[Abc_ObjId(pNeighbor)]=1; in Io_NtkOrderingPads()
756 pNextTerm=pNeighbor; in Io_NtkOrderingPads()
782 Abc_Obj_t * pNet, * pNode, * pNeighbor; in Io_NtkBfsPads() local
805 assert( Abc_ObjIsNode(pNeighbor) || Abc_ObjIsTerm(pNeighbor) ); in Io_NtkBfsPads()
806 Vec_PtrRemove( vNeighbors, pNeighbor ); in Io_NtkBfsPads()
810 Abc_NodeSetTravIdCurrent( pNeighbor ); in Io_NtkBfsPads()
812 if( ((Abc_ObjIsPi(pNeighbor) || Abc_ObjIsPo(pNeighbor))) && !pOrdered[Abc_ObjId(pNeighbor)] ) in Io_NtkBfsPads()
817 if( Abc_ObjFanoutNum( pNeighbor ) ) in Io_NtkBfsPads()
819 pNet=Abc_ObjFanout0( pNeighbor ); in Io_NtkBfsPads()
826 if( Abc_ObjFaninNum( pNeighbor ) ) in Io_NtkBfsPads()
[all …]
/dports/math/saga/saga-8.1.3/saga-gis/src/saga_core/saga_api/
H A Dtin_elements.cpp115 bool CSG_TIN_Node::_Add_Neighbor(CSG_TIN_Node *pNeighbor) in _Add_Neighbor() argument
117 if( pNeighbor == this ) in _Add_Neighbor()
124 if( m_Neighbors[i] == pNeighbor ) in _Add_Neighbor()
131 m_Neighbors[m_nNeighbors++] = pNeighbor; in _Add_Neighbor()
160 CSG_TIN_Node *pNeighbor; in Get_Gradient() local
162 if( (pNeighbor = Get_Neighbor(iNeighbor)) != NULL ) in Get_Gradient()
164 dx = Get_X() - pNeighbor->Get_X(); in Get_Gradient()
165 dy = Get_Y() - pNeighbor->Get_Y(); in Get_Gradient()
166 dz = asDouble(iField) - pNeighbor->asDouble(iField); in Get_Gradient()
H A Dtin.h130 bool _Add_Neighbor (CSG_TIN_Node *pNeighbor);
/dports/math/cgal/CGAL-5.3/include/CGAL/
H A DAlpha_shape_2.h804 int Neigh_i = pNeighbor->index(pFace); in initialize_interval_edge_map()
813 find_interval(pNeighbor); in initialize_interval_edge_map()
835 if (!is_infinite(pNeighbor)) in initialize_interval_edge_map()
1353 Face_handle pNeighbor, fh; in traverse() local
1360 pNeighbor = fh->neighbor(i); in traverse()
1366 faces.push_back(pNeighbor); in traverse()
1561 pNeighbor = f->neighbor(i); in op_ostream() local
1562 i = pNeighbor->index(f); in op_ostream()
1563 f = pNeighbor; in op_ostream()
1664 i = pNeighbor->index(f); in op_ostream()
[all …]
H A DAlpha_shape_3.h1173 Cell_handle pCell, pNeighbor ; in initialize_alpha_facet_maps() local
1186 pNeighbor = pCell->neighbor(i); in initialize_alpha_facet_maps()
1187 iNeigh = pNeighbor->index(pCell); in initialize_alpha_facet_maps()
1192 NT alpha_Neighbor = pNeighbor->get_alpha(); in initialize_alpha_facet_maps()
1216 pNeighbor->set_facet_status(iNeigh,as); in initialize_alpha_facet_maps()
1749 Cell_handle pNeighbor; in traverse() local
1756 pNeighbor = pCell->neighbor(i); in traverse()
1757 CGAL_triangulation_assertion(pNeighbor != nullptr); in traverse()
1758 if (classify(pNeighbor, alpha) == INTERIOR){ in traverse()
1759 Data& data = marked_cell_set[pNeighbor]; in traverse()
[all …]
H A DFixed_alpha_shape_3.h849 Cell_handle pNeighbor = pCell->neighbor(i);
850 int iNeigh = pNeighbor->index(pCell);
859 if(!is_infinite(pNeighbor)){
860 if (pNeighbor->get_classification_type()==INTERIOR)
880 pNeighbor->set_facet_classification_type(iNeigh,status);
/dports/math/saga/saga-8.1.3/saga-gis/src/tools/tin/tin_tools/
H A DTIN_Flow_Trace.cpp212 CSG_TIN_Node *pNeighbor; in Trace() local
214 if( (pNeighbor = pPoint->Get_Neighbor(pPoint->asInt(m_iDir))) != NULL ) in Trace()
216 pNeighbor->Add_Value(m_iFlow, Area); in Trace()
218 Trace(pNeighbor, Area); in Trace()
/dports/math/cgal/CGAL-5.3/include/CGAL/Mesh_3/
H A DSizing_grid.h454 Node *pNeighbor = neighbor(pNode,index_neighbor); in flood() local
455 if(pNeighbor != nullptr && in flood()
456 pNeighbor->done() == false) in flood()
457 priority_queue.push(Candidate_size(pNeighbor,pNode->ref_node(),m_k)); in flood()
488 Node *pNeighbor = neighbor(pNode,index_neighbor); in init_pqueue() local
489 if(pNeighbor != nullptr && in init_pqueue()
490 pNeighbor->done() == false) in init_pqueue()
492 Candidate_size candidate(pNeighbor,pNode->ref_node(),m_k); in init_pqueue()
/dports/multimedia/libva-intel-hybrid-driver/intel-hybrid-driver-1.0.2/src/vp9hdec/
H A Dintel_hybrid_hostvld_vp9_parser.cpp2955 const PINT16 pNeighbor = ScanNbBandTrans.pNeighborTable; in Intel_HostvldVp9_ParseCoefficient() local
2963 …Pt = (1 + pMbInfo->TokenCache[pNeighbor[(CoeffIdx * VP9_MAX_NEIGHBORS) + 0]] + pMbInfo->TokenCache… in Intel_HostvldVp9_ParseCoefficient()
3009 …Pt = (1 + pMbInfo->TokenCache[pNeighbor[(CoeffIdx * VP9_MAX_NEIGHBORS) + 0]] + pMbInfo->TokenCache… in Intel_HostvldVp9_ParseCoefficient()