]]>
floor鏄湴鏉?br>鐢ㄨ礋鏁拌瘯璇曞氨鐭ラ亾浜唦~~
]]>
涓鑸漢閮界敤鐨勬槸澹版槑寮忎簨鍔＄殑鏂瑰紡錛屼篃灝辨槸鐢ㄧ殑鏄疶ransactionProxyFactoryBean榪欎釜錛屼絾鏄敤榪欎釜鍚庡畠鍙兘閽堝涓涓猼arget鏉ヨ繘琛?浜嬪姟綆＄悊錛?br>鎵浠ユ垜鐢ㄤ簡鑷姩浠ｇ悊鏂瑰紡榪涜浜嬪姟鐨刡ean create銆傚亣濡傛湁澶氫釜鏂規(guī)硶鐩歌瘑鐨刴anager鏃跺氨鍙互鐢ㄨ繖涓簡銆?br>
spring閰嶇疆鏂囦歡濡備笅
<bean id="matchNameInterceptor" class="org.springframework.transaction.interceptor.NameMatchTransactionAttributeSource"> //閫氳繃鍚嶇О鏉ヨ繘琛屽尮閰嶏紝浠ュ強transactiondefinition <property name="properties"> <props> <prop key="get*">PROPAGATION_REQUIRED,readOnly</prop> <prop key="find*">PROPAGATION_REQUIRED,readOnly</prop> <prop key="load*">PROPAGATION_REQUIRED,readOnly</prop> <prop key="insert*">PROPAGATION_REQUIRED</prop> </props> </property> </bean> <bean id="transactionInterceptor" class="org.springframework.transaction.interceptor.TransactionInterceptor"> //浜嬪姟鐨?nbsp;interceptor <property name="transactionManager" ref="transactionManager"/> <property name="transactionAttributeSource" ref="matchNameInterceptor"/> </bean> <bean id="autoProxyCreator" class="org.springframework.aop.framework.autoproxy.BeanNameAutoProxyCreator"> //鏈鍏抽敭鐨剘~鑷姩瀵規(guī)墍鍒楄〃鐨刡ean榪涜瑁呴厤, <property name="interceptorNames"> <list> <idref local="transactionInterceptor"/> //灝唅nterceptor 鍜宐ean鑱斿悎璧鋒潵 鎵闇瑕佽閰嶇殑interceptor 錛屼篃鍙互鏄叾浠栫殑interceptor </list> </property> <property name="beanNames"> <list> <idref local="iThreadManager"/> //榪欓噷涓洪渶瑕佽閰嶇殑bean 鐨刲ist <idref local="iUserManager"/> </list> </property> </bean>鏈変笉瀵圭殑鍦版柟锝炴榪庡悇浣嶅ぇ澶ф寚鏁?/p>
]]>
void bubbleSort(int v[],int len){
for (;len>0;len--)
for (int i=0;i<len;i++)
if(v[i]>v[i+1])swap(v[i],v[i+1]);
}
//bubblesort----------------------------------------------------------------------------
//selection sort---------------------------------------------------------------------
void selectionSort(int v[],int len){
int k,j,i;
for (j=0;k=j,j<=len;j++)
{
for (i=j;i<=len;i++)
if(v[k]>v[i])k=i;
if(k!=j)
swap(v[k],v[j]);
}
}
//selection sort---------------------------------------------------------------------
]]>
void Swap( int&, int&);
void quickSort(int *R,int low,int high);
int partition(int *R,int i,int j);
void swap(int& x,int& y)
{
int iTemp=x;
x=y;
y=iTemp;
}
int partition(int v[],int i,int j)
{
int tempSave=v[i];
while(i<j)
{
while(v[j]>=tempSave && i<j)
j--;
swap(v[i],v[j]);
while(v[i]<=tempSave && i<j)
i++;
swap(v[i],v[j]);
}
return i;
}
void quickSort(int v[],int low ,int high)
{
int tempPos;
if (low<high)
{
tempPos=partition(v,low,high);
quickSort(v,low,tempPos-1);
quickSort(v,tempPos+1,high);
}
}
void main()
{
int i;
int R[11]={-1,7,12,3,5,8,6,2,9,14,11};
for(i=0;i<=10;i++)
cout << R[i] << endl ;
quickSort(R,1,10);
for(i=0;i<=10;i++)
cout << R[i] << endl ;
}
]]>
]]>
]]>
]]>