📄 idset.h
字号:
/*A fast and simple stretch-minimizing mesh parameterization C++ codeCopyright:(c) Shin Yoshizawa, 2004E-mail: shin.yoshizawa@mpi-sb.mpg.deURL: http://www.mpi-sb.mpg.de/~shinAffiliation: Max-Planck-Institut fuer Informatik: Computer Graphics Group Stuhlsatzenhausweg 85, 66123 Saarbruecken, Germany Phone +49 681 9325-408 Fax +49 681 9325-499 All right is reserved by Shin Yoshizawa.This C++ sources are allowed for only primary user of research and educational purposes. Don't use secondary: copy, distribution, diversion, business purpose, and etc.. */class IDSet{ public: IDSet(){} virtual ~IDSet(){} void IDSet::AppendVF(int,IDList *); int IDSet::SearchI(int dID,IDList *dIHead,IDList *dITail); void IDSet::AppendI(int dID,IDList *dIHead,IDList *dITail,int nowID,int *dnum); void IDSet::AppendVFSort(int dID,IDList *dIHead,IDList *dITail); void IDSet::AppendIF(int dID,IDList *dIHead,IDList *dITail,int nowID,int *dnum); void IDSet::AppendISort(int dID,IDList *dIHead,IDList *dITail,int nowID,int *dnum); void IDSet::AppendISort(int dID,IDList *dIHead,IDList *dITail); void IDSet::AppendPolarI(int dID,PolarList *dITail,double dx,double dy); void IDSet::AppendPolarI(int dID,PolarList *dITail,double dx,double dy,double dz,double cotw); void IDSet::AppendPolarIRL(int dID,PolarList *dITail,double dr,double dthta,double dlambda,int tR,int tL,int nextP); void IDSet::CleanNeighborLPolar(PolarList **,PolarList **,int ); void IDSet::CleanNeighbor(IDList*,IDList*); void IDSet::CleanNeighborPolar(PolarList*,PolarList*); void IDSet::CleanNeighborLL(IDList **,IDList **,int ,int *); void IDSet::CleanNeighborL(IDList **,IDList **,int ); void IDSet::Clean(IDList **dFHead,IDList **dFTail,int numberSV,int *dneighborN); private: IDSet(const IDSet& rhs); const IDSet &operator=(const IDSet& rhs);};
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -