private double PointToAngle(Point AOrigin, Point APoint) { if (APoint.X == AOrigin.X) if (APoint.Y > AOrigin.Y) return Math.PI * 0.5f else return Math.PI * 1.5f else if (APoint.Y == AOrigin.Y) if (APoint.X > AOrigin.X) return 0 else return Math.PI else {
标签： AOrigin APoint Point PointToAngle
上传时间： 2013-12-18
上传用户：rocketrevenge
lena图像的分解将规范化后的图像的数据格式由适合显示图像的uint8格式转换为适合数值处理的double格式，再调用二维小波分解函数进行图像分解，最后为了清晰地显示分解图像的塔式结构，在图像的相应区域绘制若干分界线。
上传时间： 2016-10-31
上传用户：kristycreasy
double corner_pt[3]={10,10,10} char * edge_len[3]={"30","20","10"} tag_t blk_tag UF_MODL_create_block1(UF_NULLSIGN,corner_pt, edge_len,&blk_tag)
标签： 10 corner_pt edge_len blk_tag
上传时间： 2016-12-19
上传用户：chenbhdt
对double型的向int型转换的出错问题的校正
上传时间： 2014-01-10
上传用户：秦莞尔w
除零异常和捕获三种类型异常,int,char,double类型的异常.
上传时间： 2017-01-15
上传用户：515414293
public class CircleMenuCanvas extends Canvas implements Runnable{ double pi = Math.PI public final int MENURIGHT = 1 public final int MENULEFT = 0 Image menuImage[] = new Image[6] int []jiaodu = {330,30,90,150,210,270} String menuName[] = {"新游戏","继续游戏","游戏设置","高分榜","游戏帮助","退出游戏"} int x = getWidth()/2 int y = getHeight()/2 int count = 0 int local int index = 0 Font f boolean running = false /** * 构造方法 * */
标签： public CircleMenuCanvas implements Runnable
上传时间： 2014-01-08
上传用户：zhaoq123
综合2叉树及B+树优点的能根据增删改而分裂或合并的完整程序(现在以8bit(BYTE key)为关键字,可扩充到64bit的double为key,用户数据包现在以float ton表示,可扩充到任意结构struct)
上传时间： 2017-02-19
上传用户：498732662
Points in Euclidean space, implemented as double[].Includes simple geometric operations.Uses matrices a matrix is represented as an array of Pnts
标签： implemented operations Euclidean geometric
上传时间： 2014-01-05
上传用户：xiaoxiang
三次样条插值程序演示。在SplineDemoView.cpp文件中的函数BOOL CSplineDemoView::ZSpline3()和函数double Spline3(double)是实现三次样条插值算法的核心函数。用VC6.0编译运行后，在窗口上由左至右点击鼠标左键设置一些点，然后点击鼠标右键即绘出穿过这些点的三次样条插值曲线。
标签： double CSplineDemoView SplineDemoView ZSpline3
上传时间： 2014-01-03
上传用户：妄想演绎师
This is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe [1]. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries. See the details of the implementation at [2]: http://linux.thai.net/~thep/datrie/datrie.html Historically, this was first implemented as C++ classes in a library called midatrie [2], but later simplified and rewritten from scratch in C.
标签： implementation double-array representing structure
上传时间： 2013-12-10
上传用户：shinesyh
