<rt id="c244s"></rt>
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
<button id="wio6a"></button>