宸ュ叿闆嗘垚鈥斺旂紪璇戝櫒闆嗘垚渚嬪瓙錛圝ava銆丅orland C++銆乂isual C++銆両nno Setup銆乶sis錛?br>鍦?#8220;宸ュ叿→鍙傛暟閫夋嫨→鐢ㄦ埛宸ュ叿”閫夐」欏佃緗紝璁劇疆姝ラ
鈶?璁劇疆緇勫悕縐幫紝榪欓噷涔熷彲浠ヤ笉璁劇疆
鈶?鍗曞嚮“娣誨姞宸ュ叿→搴旂敤紼嬪簭”鎸夐挳騫惰繘琛屽涓嬭緗?br>鈶?鍚勭綾諱技"$(FilePath)"鐨勫弬鏁板彲浠ュ湪鏂囨湰妗嗗彸渚х殑綆ご涓嬫媺鑿滃崟涓幏鍙栵紝鍏蜂綋鍚箟濡備笅
鍙傛暟 鎻忚堪
$(FilePath) 鏂囦歡璺緞錛堟枃浠跺叏鍚嶏紝鍚洰褰曞拰鏂囦歡鍚嶏級
$(FileDir) 鏂囦歡鐩綍錛堜笉甯︽枃浠跺悕錛?br>$(FileName) 鏂囦歡鍚嶏紙涓嶅甫鐩綍錛?br>$(FileNameNoExt) 涓嶅甫鎵╁睍鍚嶇殑鏂囦歡鍚嶏紙涓嶅甫鐩綍錛?br>$(FileExt) 鎵╁睍鍚嶏紙褰撳墠鏂囦歡錛?br>$(ProjectName) 宸ョ▼鍚嶇О錛堝綋鍓嶅伐紼嬪悕錛?br>$(CurLine) 褰撳墠琛屽彿錛堝厜鏍囦綅緗鐨勮鍙鳳級
$(CurCol) 褰撳墠鍒楀彿錛堝厜鏍囦綅緗鐨勫垪鍙鳳級
$(CurSel) 褰撳墠鏂囨湰錛堟彃鍏ュ綋鍓嶉夊畾鏂囨湰錛?br>$(CurWord) 褰撳墠鍗曡瘝錛堟彃鍏ュ綋鍓嶅崟璇嶏級
$(WindowList) 鏄劇ず褰撳墠紿楀彛鍒楄〃騫墮夋嫨鐗瑰畾鏂囦歡
渚嬪瓙 1. Java 緙栬瘧鍣?/p>
鑿滃崟鏂囨湰錛欽ava 緙栬瘧鍣?br>鍛戒護錛歝:\java\bin\javac.exe
鍙傛暟錛?$(FilePath)"
鍒濆鐩綍錛?(FileDir)
鎹曡幏杈撳嚭錛氬紑鍚?/p>
瑕佽繍琛屽凡緙栬瘧鐨?Java 綾繪枃浠訛紝浣犲彲浠ヨ繘琛屽涓嬭緗細
鑿滃崟鏂囨湰錛欽ava
鍛戒護錛歝:\java\bin\java.exe
鍙傛暟錛?(FileNameNoExt)
鍒濆鐩綍錛?(FileDir)
“鍛戒護”閮ㄥ垎搴斿綋鏇挎崲涓哄疄闄呯殑 Java 瑙i噴鍣ㄧ殑璺緞銆?/p>
渚嬪瓙 2. Borland C++
鑿滃崟鏂囨湰錛欱orland C
鍛戒護錛歝:\bc\bin\bcc32.exe
鍙傛暟錛?Ic:\bc\include -Lc:\bc\lib -n$(FileDir) $(FilePath)
鍒濆鐩綍錛歝:\bc\bin
鎹曡幏杈撳嚭錛氬紑鍚?/p>
渚嬪瓙 3. Visual C++
鑿滃崟鏂囨湰錛歏isual C++
鍛戒護錛歝:\msdev\vc98\bin\cl.exe
鍙傛暟錛?$(FilePath)"
鍒濆鐩綍錛?(FileDir)
鎹曡幏杈撳嚭錛氬紑鍚?/p>
渚嬪瓙 4. Inno Setup
鑿滃崟鏂囨湰錛氱紪璇?Inno
鍛戒護錛欳:\Program Files\Inno Setup 4\Compil32.exe”
鍙傛暟錛?cc $(FileName)
鍒濆鐩綍錛?(FileDir)
鎹曡幏杈撳嚭錛氬紑鍚?/p>
渚嬪瓙 5. nsis
鑿滃崟鏂囨湰錛氱紪璇?nsis
鍛戒護錛欳:\NSIS\makensis.exe
鍙傛暟錛?(FileName)
鍒濆鐩綍錛?(FileDir)
鎹曡幏杈撳嚭錛氬紑鍚?/p>
渚嬪瓙 6. C#
鑿滃崟鏂囨湰錛氱紪璇?C#
鍛戒護錛欳:\WINDOWS\Microsoft.NET\Framework\v1.0.3705\csc.exe
鍙傛暟錛?(FileName)
鍒濆鐩綍錛?(FileDir)
鎹曡幏杈撳嚭錛氬紑鍚?/p>
鍦ㄤ笂闈㈣緗腑錛屽湪鍛戒護閮ㄥ垎錛屽繀欏諱嬌鐢ㄧ郴緇熶腑鍚勮嚜緙栬瘧鍣ㄧ殑緇濆璺緞銆?/p>
璁劇疆瀹屾瘯鍚庯紝浣犲彲浠ュ湪“宸ュ叿”鑿滃崟榪愯瀵瑰簲宸ュ叿浜嗭紝榪愯緇撴灉浼氭樉紺哄湪搴曢儴鐨勮緭鍑虹獥鍙o紝浣犱篃鍙互閫氳繃蹇嵎閿?Ctrl + 0-9) 榪愯錛屾垨鑰呮槸閫氳繃“鐢ㄦ埛宸ュ叿鏍?#8221;鐨勫揩鎹鋒寜閽繍琛屻?/p>
瑕佽繍琛屽凡緙栬瘧鐨?*.exe 鏂囦歡錛屼綘鍙互榪涜濡備笅璁劇疆錛堟鏃跺彲鎵ц鏂囦歡闇瑕佸拰緙栬瘧鏂囦歡鍚屽悕錛夛細
鑿滃崟鏂囨湰錛歊un
鍛戒護錛?(FileNameNoExt)
鍙傛暟錛?br>鍒濆鐩綍錛?(FileDir)
鍘熸枃绔犲湴鍧:http://www.cppblog.com/shyli/archive/2006/12/17/16531.aspx
public class BasicSort {
//閫夋嫨鎺掑簭
public static void selectionSort(int[] number) {
for(int i = 0; i < number.length - 1; i++) {
int m = i;
for(int j = i + 1; j < number.length; j++)
if(number[j] < number[m])
m = j;
if(i != m)
swap(number, i, m);
}
}
//鎻掑叆鎺掑簭
public static void injectionSort(int[] number) {
for(int j = 1; j < number.length; j++) {
int tmp = number[j];
int i = j - 1;
while(tmp < number[i]) {
number[i+1] = number[i];
i--;
if(i == -1)
break;
}
number[i+1] = tmp;
}
}
//鍐掓場鎺掑簭
public static void bubbleSort(int[] number) {
boolean flag = true;
for(int i = 0; i < number.length-1 && flag; i++) {
flag = false;
for(int j = 0; j < number.length-i-1; j++) {
if(number[j+1] < number[j]) {
swap(number, j+1, j);
flag = true;
}
}
}
}
private static void swap(int[] number, int i, int j) {
int t;
t = number[i];
number[i] = number[j];
number[j] = t;
}
}