import java.lang.reflect.Field;
import java.lang.reflect.Modifier;
import java.security.Permission;
import java.security.PermissionCollection;
import java.util.Map;
 
public class RemoveCryptographyRestrictions {
    private volatile static RemoveCryptographyRestrictions INSTANCE=null;
 
    public static void init() throws Exception {
        if(INSTANCE==null)
            synchronized (RemoveCryptographyRestrictions.class) {
                if(INSTANCE==null)
                    INSTANCE=new RemoveCryptographyRestrictions();
            }
    }
 
    private RemoveCryptographyRestrictions() throws Exception {
        Class<?> jceSecurity = getClazz("javax.crypto.JceSecurity");
        Class<?> cryptoPermissions = getClazz("javax.crypto.CryptoPermissions");
        Class<?> cryptoAllPermission = getClazz("javax.crypto.CryptoAllPermission");
        if(jceSecurity==null||cryptoPermissions==null||cryptoAllPermission==null)
            return;
        setFinalStaticValue(jceSecurity, "isRestricted", false);
        PermissionCollection defaultPolicy = getFieldValue(jceSecurity, "defaultPolicy",  null, PermissionCollection.class);
        Map<?, ?> map=getFieldValue(cryptoPermissions, "perms", defaultPolicy, Map.class);
        map.clear();
        Permission permission=getFieldValue(cryptoAllPermission, "INSTANCE", null, Permission.class);
        defaultPolicy.add(permission);
    }
 
    private Class<?> getClazz(String className) {
        Class<?> clazz=null;
        try {
            clazz=Class.forName(className);
        } catch (Exception e) {
        }
        return clazz;
    }
 
    private void setFinalStaticValue(Class<?> srcClazz, String fieldName, Object newValue) throws Exception {
        Field field=srcClazz.getDeclaredField(fieldName);
        field.setAccessible(true);
        Field modifiersField = Field.class.getDeclaredField("modifiers");
        modifiersField.setAccessible(true);
        modifiersField.setInt(field, field.getModifiers() & ~Modifier.FINAL);
        field.set(null, newValue);
    }
 
    private <T> T getFieldValue(Class<?> srcClazz, String fieldName, Object owner, Class<T> dstClazz) throws Exception {
        Field field=srcClazz.getDeclaredField(fieldName);
        field.setAccessible(true);
        return dstClazz.cast(field.get(owner));
    }
 
}

ct-ng menuconfig # 启动可视化界面，Load/modify Config文件
ct-ng build # 开始编译toolchains

/usr/libexec/mysqld, Version: 5.1.73-log (Source distribution). started WITH:
Tcp port: 4000  Unix socket: /var/lib/mysql/mysql.sock
Time                 Id Command    Argument
# Time: 140720  5:00:55
# User@Host: twx[twx] @ localhost []
# Query_time: 1.421887  Lock_time: 0.026132 Rows_sent: 232  Rows_examined: 279
USE wordpress;
SET timestamp=1405803655;
SELECT option_name, option_value FROM wp_options WHERE autoload = 'yes';

mysql> EXPLAIN SELECT option_name, option_value FROM wp_options WHERE autoload = 'yes';
+----+-------------+------------+------+---------------+------+---------+------+------+-------------+
| id | select_type | TABLE      | type | possible_keys | KEY  | key_len | ref  | rows | Extra       |
+----+-------------+------------+------+---------------+------+---------+------+------+-------------+
|  1 | SIMPLE      | wp_options | ALL  | NULL          | NULL | NULL    | NULL |  206 | USING WHERE |
+----+-------------+------------+------+---------------+------+---------+------+------+-------------+
1 row IN SET

ALTER TABLE `wp_options` ADD INDEX `autoload` USING BTREE (`autoload`) ;

mysql> EXPLAIN SELECT option_name, option_value FROM wp_options WHERE autoload = 'yes';
+----+-------------+------------+------+---------------+----------+---------+-------+------+-------------+
| id | select_type | TABLE      | type | possible_keys | KEY      | key_len | ref   | rows | Extra       |
+----+-------------+------------+------+---------------+----------+---------+-------+------+-------------+
|  1 | SIMPLE      | wp_options | ref  | autoload      | autoload | 62      | const |  119 | USING WHERE |
+----+-------------+------------+------+---------------+----------+---------+-------+------+-------------+
1 row IN SET

org.hibernate.AssertionFailure: Interceptor.onPrepareStatement() returned null or empty string.
	at org.hibernate.jdbc.AbstractBatcher.getSQL(AbstractBatcher.java:490)
	at org.hibernate.jdbc.AbstractBatcher.getPreparedStatement(AbstractBatcher.java:510)
	at org.hibernate.jdbc.AbstractBatcher.getPreparedStatement(AbstractBatcher.java:452)
	at org.hibernate.jdbc.AbstractBatcher.prepareQueryStatement(AbstractBatcher.java:161)
	at org.hibernate.loader.Loader.prepareQueryStatement(Loader.java:1700)
	at org.hibernate.loader.Loader.doQuery(Loader.java:801)
	at org.hibernate.loader.Loader.doQueryAndInitializeNonLazyCollections(Loader.java:274)
	at org.hibernate.loader.Loader.doList(Loader.java:2542)
	at org.hibernate.loader.Loader.listIgnoreQueryCache(Loader.java:2276)
	at org.hibernate.loader.Loader.list(Loader.java:2271)
	at org.hibernate.loader.custom.CustomLoader.list(CustomLoader.java:316)
	at org.hibernate.impl.SessionImpl.listCustomQuery(SessionImpl.java:1842)
	at org.hibernate.impl.AbstractSessionImpl.list(AbstractSessionImpl.java:165)
	at org.hibernate.impl.SQLQueryImpl.list(SQLQueryImpl.java:157)
	at org.hibernate.impl.AbstractQueryImpl.uniqueResult(AbstractQueryImpl.java:890)
	at com.yun.dba.exception.dao.ExceptionDaoImpl.countExceptionInfoByCondition(ExceptionDaoImpl.java:83)

public List<ExceptionInfo> getExceptionInfoByCondition(List<SearchSupport> searchList,
                            Integer targetType, Integer pageNo,
                            Integer pageSize) {
    ......
    if (targetType == TARGET_TYPE_CUSTINS || targetType == TARGET_TYPE_SPACE
            || targetType == TARGET_TYPE_DNS) {
        lastSql += " and ci.is_deleted=0 order by excp.gmt_created desc ";
        sql = makeSearchListToSql(searchList, GET_CUSTINS_BY_CONDITION, lastSql, false);
    } else if (targetType == TARGET_TYPE_HOST) {
        lastSql += " order by excp.gmt_created desc ";
        sql = makeSearchListToSql(searchList, GET_HOST_BY_CONDITION, lastSql, false);
    }
    ......
}

Integer a1 = 100;           //这是自动装箱  (编译器调用的是static Integer valueOf(int i))
Integer a2 = 100;
int b = new Integer(100);   //这是自动拆箱

public static Integer valueOf(int i) {
final int offset = 128;
    if (i >= -128 && i <= 127) { // must cache
        return IntegerCache.cache[i + offset];
    }
    return new Integer(i);
}

@RequestMapping(value = UrlPatternConsts.EXCEPTION_LIST, method = RequestMethod.GET)
public ModelAndView instancelist(HttpServletRequest request, ModelAndView mav,
                                 @PathVariable Integer targetType) {
    Integer page = 1;
    innerInstanceList(mav, page, targetType);
    return mav;
}

@RequestMapping(value = UrlPatternConsts.EXCEPTION_LIST, method = RequestMethod.GET)
public ModelAndView instancelist(HttpServletRequest request, ModelAndView mav,
                             @PathVariable Integer targetType) {
    Integer page = 1;
    Integer test=1;
    System.out.println("test\n");
    System.out.println(targetType==test);
    System.out.println(page==test);
    System.out.println("end test\n");
    innerInstanceList(mav, page, targetType);
    return mav;
}

test
false
true
end test

test
true
true
end test

java version "1.6.0_45"
Java(TM) SE Runtime Environment (build 1.6.0_45-b06)
Java HotSpot(TM) 64-Bit Server VM (build 20.45-b01, mixed mode)

java version "1.6.0_30"
OpenJDK Runtime Environment (IcedTea6 1.13.1) (rhel-3.1.13.1.el6_5-x86_64)
OpenJDK 64-Bit Server VM (build 23.25-b01, mixed mode)

javascript:(function(){var text=prompt('Search for:','');if(text==null || text.length==0)return;var spans=document.getElementsByClassName('labnol');if(spans){for(var i=0;i < spans.length;i++){spans[i].style.backgroundColor='transparent';}}function searchWithinNode(node,te,len){var pos,skip,spannode,middlebit,endbit,middleclone;skip=0;if(node.nodeType==3){pos=node.data.indexOf(te);if(pos>=0){spannode=document.createElement('span');spannode.setAttribute('class','labnol');spannode.style.backgroundColor='yellow';middlebit=node.splitText(pos);endbit=middlebit.splitText(len);middleclone=middlebit.cloneNode(true);spannode.appendChild(middleclone);middlebit.parentNode.replaceChild(spannode,middlebit);skip=1;}}else if(node.nodeType==1 && node.childNodes && node.tagName.toUpperCase()!='SCRIPT' && node.tagName.toUpperCase !='STYLE'){for(var child=0;child < node.childNodes.length;++child){child=child+searchWithinNode(node.childNodes[child],te,len);}}return skip;}searchWithinNode(document.body,text,text.length);})();

// 获得实体管理器
EntityManager em = ...
// 建立SQL查询
String getByFirstName = "SELECT * FROM contacts c WHERE c.first_name = ?1";
// 创建查询实例
Query query = em.createNativeQuery(getByFirstName, Contact.class);
// 设置查询参数
query.setParameter(1, "John");
// 获取结果
List contacts = query.getResultList();

// 获得实体管理器
EntityManager em = ...
// 建立JPQL查询
String getByFirstName = "SELECT c FROM Contact c WHERE c.firstName = :firstName";
// 创建查询实例
TypedQuery<Contact> query = em.createQuery(getByFirstName, Contact.class);
// 设置查询参数
query.setParameter("firstName", "John");
// 获取结果
List<Contact> contacts = query.getResultList();

// 获得实体管理器
EntityManager em = ...
// 获得Criteria建立器
CriteriaBuilder cb = em.getCriteriaBuilder();
// 建立Criteria查询
CriteriaQuery<Contact> query = cb.greateQuery(Contact.class);
// 创建查询Root
Root<Contact> root = query.from(Contact.class);
// 创建firstName的查询条件，使用静态元模型
Predicate firstNameIs = cb.equal(root.get(Contact_.firstName, "John"));
// 指定查询的where条件
query.where(firstNameIs);
// 创建查询并获取结果
TypedQuery<Contact> q = em.createQuery(query);
List<Contact> contacts = q.getResultList();

public List<com.yun.dba.check.view.HostResource> getHostResourceByCondition(List<SearchSupport> searchList,
                                                                           Integer pageNo,
                                                                           Integer pageSize,
                                                                           String orderString) {
return super
    .getByCondition(getSession().createCriteria(HostResource.class, "hr"), searchList,
        pageNo, pageSize)
    .addOrder(Order.desc(orderString))
    .setProjection(
        Projections
            .projectionList()
            .add(Projections.property("hr." + "id").as("id"))
            .add(Projections.property("hr." + "statDate").as("statDate"))
            .add(Projections.property("hr." + "gmtModified").as("gmtModified"))
            .add(Projections.property("hr." + "hostId").as("hostId"))
            .add(Projections.property("hr." + "region").as("region"))
            .add(Projections.property("hr." + "clusterName").as("clusterName"))
            .add(Projections.property("hr." + "ip").as("ip"))
            .add(Projections.property("hr." + "dbType").as("dbType"))
            .add(Projections.property("hr." + "groupName").as("groupName"))
            .add(Projections.property("hr." + "hostCreated").as("hostCreated"))
            .add(Projections.property("hr." + "hostAvail").as("hostAvail"))
            .add(Projections.property("hr." + "clusterAvail").as("clusterAvail"))
            .add(Projections.property("hr." + "memTotal").as("memTotal"))
            .add(Projections.property("hr." + "diskTotal").as("diskTotal"))
            .add(Projections.property("hr." + "activeInsCnt").as("activeInsCnt"))
            .add(Projections.property("hr." + "memSelled").as("memSelled"))
            .add(Projections.property("hr." + "diskSelled").as("diskSelled"))
            .add(Projections.property("hr." + "currInsCnt").as("currInsCnt"))
            .add(Projections.property("hr." + "diskCurr").as("diskCurr"))
            .add(Projections.property("hr." + "rssMem").as("rssMem"))
            .add(Projections.property("hr." + "dbVersion").as("dbVersion"))
            .add(
                Projections
                    .sqlProjection(
                        "round(mem_selled/mem_total*100,2) as memselledRate,round(disk_selled/disk_total*100,2) as diskselledRate,round(disk_curr/disk_total*100,2) as diskcurrRate",
                        new String[] { "memselledRate", "diskselledRate", "diskcurrRate" },
                        new Type[] { StandardBasicTypes.FLOAT, StandardBasicTypes.FLOAT,
                                StandardBasicTypes.FLOAT })))
    .setResultTransformer(
        new AliasToBeanResultTransformer(com.yun.dba.check.view.HostResource.class))
    .list();
}

public String toSqlString(Criteria criteria, CriteriaQuery criteriaQuery) 
throws HibernateException {
	String[] columns = criteriaQuery.getColumnsUsingProjection(criteria, propertyName);
	Type type = criteriaQuery.getTypeUsingProjection(criteria, propertyName);
	StringBuffer fragment = new StringBuffer();
	for ( int i=0; i<columns.length; i++ ) {
		SessionFactoryImplementor factory = criteriaQuery.getFactory();
		boolean lower = ignoreCase && type.sqlTypes( factory )[i]==Types.VARCHAR;
		if (lower) {
			fragment.append( factory.getDialect().getLowercaseFunction() )
				.append('(');
		}
		fragment.append( columns[i] );
		if (lower) fragment.append(')');
		fragment.append( ascending ? " asc" : " desc" );
		if ( i<columns.length-1 ) fragment.append(", ");
	}
	return fragment.toString();
}

import org.hibernate.criterion.Order;
import org.hibernate.criterion.CriteriaQuery;
import org.hibernate.Criteria;
import org.hibernate.HibernateException;
public class OrderBySqlFormula extends Order {
    private String sqlFormula;
    protected OrderBySqlFormula(String sqlFormula) {
        super(sqlFormula, true);
        this.sqlFormula = sqlFormula;
    }
    public String toString() {
        return sqlFormula;
    }
    public String toSqlString(Criteria criteria, CriteriaQuery criteriaQuery)
                                                                             throws HibernateException {
        return sqlFormula;
    }
    public static Order sqlFormula(String sqlFormula) {
        return new OrderBySqlFormula(sqlFormula);
    }
}

# deb cdrom:[Ubuntu 11.04 _Natty Narwhal_ - Release i386 (20110427.1)]/ natty main restricted
 
deb http://old-releases.ubuntu.com/ubuntu/ natty main restricted universe multiverse
deb http://old-releases.ubuntu.com/ubuntu/ natty-security main restricted universe multiverse
deb http://old-releases.ubuntu.com/ubuntu/ natty-updates main restricted universe multiverse
deb http://old-releases.ubuntu.com/ubuntu/ natty-proposed main restricted universe multiverse
deb http://old-releases.ubuntu.com/ubuntu/ natty-backports main restricted universe multiverse
# deb-src http://old-releases.ubuntu.com/ubuntu/ natty main restricted universe multiverse
# deb-src http://old-releases.ubuntu.com/ubuntu/ natty-security main restricted universe multiverse
# deb-src http://old-releases.ubuntu.com/ubuntu/ natty-updates main restricted universe multiverse
# deb-src http://old-releases.ubuntu.com/ubuntu/ natty-proposed main restricted universe multiverse
# deb-src http://old-releases.ubuntu.com/ubuntu/ natty-backports main restricted universe multiverse
 
## Uncomment the following two lines to add software from Canonical's
## 'partner' repository.
## This software is not part of Ubuntu, but is offered by Canonical and the
## respective vendors as a service to Ubuntu users.
deb http://archive.canonical.com/ubuntu natty partner
# deb-src http://archive.canonical.com/ubuntu natty partner
 
## This software is not part of Ubuntu, but is offered by third-party
## developers who want to ship their latest software.
deb http://extras.ubuntu.com/ubuntu oneiric main
# deb-src http://extras.ubuntu.com/ubuntu oneiric main

<?php 
function _wp23_get_related_posts() {//改动整个函数，匹配wordpress-23-related-posts-plugin插件的新接口
	global $wpdb, $post;
	if(!$post->ID){return;}
	$now = current_time('mysql', 1);
	$tags = wp_get_post_tags($post->ID);
 
	//print_r($tags);
 
	$taglist = "'" . str_replace("'",'',str_replace('"','',urldecode($tags[0]->term_id))). "'";
	$tagcount = count($tags);
	if ($tagcount > 1) {
		for ($i = 1; $i <= $tagcount; $i++) {
			$taglist = $taglist . ", '" . str_replace("'",'',str_replace('"','',urldecode($tags[$i]->term_id))) . "'";
		}
	}
 
	$wp_rp = get_option("wp_rp");//读取配置，这里读出的是数组
	$limit = $wp_rp['wp_rp_limit'];
	if ($limit) $limitclause = "LIMIT $limit";
	$exclude = $wp_rp['wp_rp_exclude'];
	if ( $exclude != '' ) {
	$excludeclause = "AND p.ID NOT IN (SELECT tr.object_id FROM $wpdb->term_relationships tr LEFT JOIN $wpdb->term_taxonomy tt ON tr.term_taxonomy_id = tt.term_taxonomy_id WHERE tt.taxonomy = 'category' AND tt.term_id REGEXP '[$exclude]')";
	}
 
	$q = "SELECT DISTINCT p.ID, p.post_title, p.post_date, p.comment_count, count(t_r.object_id) as cnt FROM $wpdb->term_taxonomy t_t, $wpdb->term_relationships t_r, $wpdb->posts p WHERE t_t.taxonomy ='post_tag' AND t_t.term_taxonomy_id = t_r.term_taxonomy_id AND t_r.object_id  = p.ID AND (t_t.term_id IN ($taglist)) AND p.ID != $post->ID AND p.post_status = 'publish' AND p.post_date_gmt < '$now' $excludeclause GROUP BY t_r.object_id ORDER BY cnt DESC, p.post_date_gmt DESC $limitclause;";
 
	//echo $q;
 
	$related_posts = $wpdb->get_results($q);
	$output = "";
 
	$wp23_RP_title = $wp_rp['wp_rp_title'];
	if(!$wp23_RP_title) $wp23_RP_title= __("Related Posts",'wp_related_posts');
 
	if (!$related_posts){
 
		$wp23_no_RP = $wp_rp['wp_no_rp'];
 
		if(!$wp23_no_RP || ($wp23_no_RP == "popularity" && !function_exists('akpc_most_popular'))) $wp23_no_RP = "text";
 
		$wp23_no_RP_text = $wp_rp['wp_no_rp_text'];
 
		if($wp23_no_RP == "text"){
			if(!$wp23_no_RP_text) $wp23_no_RP_text= __("No Related Posts",'wp_related_posts');//国际化字段之前错了，textdomain也写错了，下同
			$output  .= '<li>'.$wp23_no_RP_text .'</li>';
		}	else{
			if( function_exists('wp_random_posts') && $wp23_no_RP == "random"){
				if(!$wp23_no_RP_text) $wp23_no_RP_text= __("Random Posts",'wp_related_posts');
				$related_posts = wp_get_random_posts($limitclause);//修改调用函数接口
			}	elseif( function_exists('wp_most_commented_posts') && $wp23_no_RP == "commented"){
				if(!$wp23_no_RP_text) $wp23_no_RP_text= __("Most Commented Posts",'wp_related_posts');
				$related_posts = wp_get_most_commented_posts($limitclause);
			}	elseif( function_exists('wp_most_popular_posts') && $wp23_no_RP == "popularity"){
				if(!$wp23_no_RP_text) $wp23_no_RP_text= __("Most Popular Posts",'wp_related_posts');
				$related_posts = wp_get_most_popular_posts($limitclause);
			}else{
				return __("Something wrong",'wp_related_posts');;
			}
			$wp23_RP_title = $wp23_no_RP_text;
		}
	}
 
	foreach ($related_posts as $related_post ){
		$output .= '<li>';
 
		$show_date = $wp_rp['wp_rp_date'];
		if ($show_date){
			$dateformat = get_option('date_format');
			$output .=   mysql2date($dateformat, $related_post->post_date) . " -- ";
		}
 
		$output .=  '<a href="'._get_permalink($related_post->ID).'" title="'.wptexturize($related_post->post_title).'">'.wptexturize($related_post->post_title).'';
 
		$show_comments_count = $wp_rp['wp_rp_comments'];
		if ($show_comments_count){
			$output .=  " (" . $related_post->comment_count . ")";
		}
 
		$output .=  '</a></li>';
	}
 
 
	$output =  '<div id="infoblock"><h2>'.$wp23_RP_title .'</h2></div>'.'<div class="page"><ol id="pages">' . $output . '</ol></div>';
	return $output;
}
?>

<?php
/** 禁止评论内容自动添加链接，防止广告 */
remove_filter('comment_text', 'make_clickable', 9);
 
/** 禁止wp输出版本号 */
remove_action('wp_head', 'wp_generator');
function remove_wordpress_version() { return ''; } add_filter('the_generator', 'remove_wordpress_version');
 
/** 禁用正文中自作聪明地把英文标点转换成中文标点 */
remove_filter('the_content', 'wptexturize');
 
/** 在正文最后添加版权声明 */
function feed_copyright($content)
{
    if (is_single() or is_feed()) {
        $content .= '
<blockquote>';
        $content .= '
<div> 　&raquo; 转载请注明来源：<a title="' . get_bloginfo('name') . '" href="' . get_bloginfo('url') . '">' . get_bloginfo('name') . '</a> &raquo; <a rel="bookmark" title="' . get_the_title() . '" href="' . get_permalink() . '">《' . get_the_title() . '》</a></div>
 
';
        $content .= '</blockquote>
 
';
    }
    return $content;
}
add_filter('the_content', 'feed_copyright');
?>

[terence@centos system.d]$ nm-applet
 
** (nm-applet:4290): WARNING **:   request_name(): Could not acquire the NetworkManagerUserSettings service.
  Error: (9) Connection ":1.172" is not allowed to own the service "org.freedesktop.NetworkManagerUserSettings" due to security policies in the configuration file

<policy user="root">
        <allow own="org.freedesktop.NetworkManager"/>
        <allow own="org.freedesktop.NetworkManagerSystemSettings"/>
 
        <allow send_destination="org.freedesktop.NetworkManager"/>
        <allow send_destination="org.freedesktop.NetworkManagerSystemSettings"/>
 
        <allow send_destination="org.freedesktop.NetworkManager"
               send_interface="org.freedesktop.NetworkManager.PPP"/>
</policy>
<policy user="terence">
	<allow own="org.freedesktop.NetworkManager"/>
        <allow own="org.freedesktop.NetworkManagerSystemSettings"/>
 
        <allow send_destination="org.freedesktop.NetworkManager"/>
        <allow send_destination="org.freedesktop.NetworkManagerSystemSettings"/>
 
        <allow send_destination="org.freedesktop.NetworkManager"
               send_interface="org.freedesktop.NetworkManager.PPP"/>
</policy>

<policy user="root">
        <allow own="org.freedesktop.NetworkManagerUserSettings"/>
 
        <allow send_destination="org.freedesktop.NetworkManagerUserSettings"
               send_interface="org.freedesktop.NetworkManagerSettings"/>
 
        <allow send_destination="org.freedesktop.NetworkManagerUserSettings"
               send_interface="org.freedesktop.NetworkManagerSettings.Connection"/>
 
        <allow send_destination="org.freedesktop.NetworkManagerUserSettings"
               send_interface="org.freedesktop.DBus.Properties"/>
 
        <!-- Only root can get secrets -->
        <allow send_destination="org.freedesktop.NetworkManagerUserSettings"
               send_interface="org.freedesktop.NetworkManagerSettings.Connection.Secrets"/>
</policy>
<policy user="terence">
	<allow own="org.freedesktop.NetworkManagerUserSettings"/>
 
        <allow send_destination="org.freedesktop.NetworkManagerUserSettings"
               send_interface="org.freedesktop.NetworkManagerSettings"/>
 
        <allow send_destination="org.freedesktop.NetworkManagerUserSettings"
               send_interface="org.freedesktop.NetworkManagerSettings.Connection"/>
 
        <allow send_destination="org.freedesktop.NetworkManagerUserSettings"
               send_interface="org.freedesktop.DBus.Properties"/>
 
        <!-- Only root can get secrets -->
        <allow send_destination="org.freedesktop.NetworkManagerUserSettings"
               send_interface="org.freedesktop.NetworkManagerSettings.Connection.Secrets"/>
</policy>

gconftool-2 --recursive-unset /apps/panel

NameVirtualHost 11.22.33.44:443
 
<VirtualHost 11.22.33.44:443>
    ServerName 11.22.33.44
    <Location />
        Order allow,deny
        Deny from all
    </Location>
    SSLEngine on
    SSLProtocol all -SSLv2
    SSLCipherSuite ALL:!ADH:!EXPORT:!SSLv2:RC4+RSA:+HIGH:+MEDIUM
    SSLCertificateFile /etc/httpd/ssl.crt
    SSLCertificateKeyFile /etc/httpd/ssl.key
    SSLCertificateChainFile /etc/httpd/sub.class1.server.ca.pem
    SSLCACertificateFile /etc/httpd/ca.pem
</VirtualHost>
 
<VirtualHost 11.22.33.44:443>
    ServerName www.terence2008.info
    SSLEngine on
    SSLProtocol all -SSLv2
    SSLCipherSuite ALL:!ADH:!EXPORT:!SSLv2:RC4+RSA:+HIGH:+MEDIUM
    SSLCertificateFile /etc/httpd/ssl.crt
    SSLCertificateKeyFile /etc/httpd/ssl.key
    SSLCertificateChainFile /etc/httpd/sub.class1.server.ca.pem
    SSLCACertificateFile /etc/httpd/ca.pem
    RewriteEngine on
    RewriteRule ^(.*)$ https://terence2008.info/$1 [R=301,L]
</VirtualHost>
 
<VirtualHost 11.22.33.44:443>
    DocumentRoot "/var/www/html"
    ServerName terence2008.info
    SSLEngine on
    SSLProtocol all -SSLv2
    SSLCipherSuite ALL:!ADH:!EXPORT:!SSLv2:RC4+RSA:+HIGH:+MEDIUM
    SSLCertificateFile /etc/httpd/ssl.crt
    SSLCertificateKeyFile /etc/httpd/ssl.key
    SSLCertificateChainFile /etc/httpd/sub.class1.server.ca.pem
    SSLCACertificateFile /etc/httpd/ca.pem
</VirtualHost>

CREATE TABLE [dbo].[QQNumInfo] (
[ID] int NOT NULL IDENTITY(1,1) ,
[QQNum] int NOT NULL ,
[Nick] varchar(20) COLLATE Chinese_PRC_CI_AS NULL ,
[Age] int NULL ,
[Gender] int NULL ,
[QunNum] int NULL ,
[QunTitle] varchar(22) COLLATE Chinese_PRC_CI_AS NULL ,
[NotExist] char(1) COLLATE Chinese_PRC_CI_AS NULL ,
CONSTRAINT [PK_QQInfo] PRIMARY KEY ([ID])
)
ON [PRIMARY]
GO
 
CREATE INDEX [INDEX_QQNum] ON [dbo].[QQNumInfo]
([QQNum] ASC)
ON [PRIMARY]
GO
 
CREATE INDEX [INDEX_QunNum] ON [dbo].[QQNumInfo]
([QunNum] ASC)
ON [PRIMARY]
GO

ALTER PROCEDURE [dbo].[LookupQQNum] @QQ INT
AS
BEGIN
	SET NOCOUNT ON --防止在jdbc里无法返回结果集
	CREATE TABLE #tmp (
		[ID] INT NOT NULL IDENTITY(1,1) ,
		[QQNum] INT NOT NULL ,
		[Nick] VARCHAR(20) COLLATE Chinese_PRC_CI_AS NULL ,
		[Age] INT NULL ,
		[Gender] INT NULL ,
		[QunNum] INT NULL ,
		[QunTitle] VARCHAR(22) COLLATE Chinese_PRC_CI_AS NULL ,
		[NotExist] CHAR(1) COLLATE Chinese_PRC_CI_AS NULL
	)
	INSERT INTO #tmp SELECT QQNum,Nick,Age,Gender,QunNum,QunTitle,NotExist FROM QQNumInfo WHERE QQNum=@QQ
	IF exists(SELECT QQNum FROM #tmp)
	BEGIN
		DECLARE @IsNotExist CHAR(1)
		SELECT TOP 1 @IsNotExist=NotExist FROM #tmp
		IF @IsNotExist IS null
			SELECT ID,QQNum,Nick,Age,Gender,QunNum,QunTitle FROM #tmp
		ELSE
			SELECT ID,QQNum,NotExist FROM #tmp
	END
	ELSE
	BEGIN
		DECLARE @table_num INT
		DECLARE @database_num INT
		SET @table_num=2
		WHILE @table_num<=970
		BEGIN
			SET @database_num=(@table_num-1)/100+1
			EXEC (
				'insert into #tmp(QQNum,Nick,Age,Gender,QunNum) select QQNum,Nick,Age,Gender,QunNum from GroupData'
				+ @database_num + '.dbo.Group' + @table_num + ' where QQNum=' + @QQ
			)
			SET @table_num=@table_num+1
		END
		INSERT INTO #tmp(QQNum,Nick,Age,Gender,QunNum) SELECT QQNum,Nick,Age,Gender,QunNum FROM GroupData11.dbo.Group1001 WHERE QQNum=@QQ
		INSERT INTO #tmp(QQNum,Nick,Age,Gender,QunNum) SELECT QQNum,Nick,Age,Gender,QunNum FROM GroupData11.dbo.Group1002 WHERE QQNum=@QQ
		INSERT INTO #tmp(QQNum,Nick,Age,Gender,QunNum) SELECT QQNum,Nick,Age,Gender,QunNum FROM GroupData11.dbo.Group1003 WHERE QQNum=@QQ
		IF not exists(SELECT QQNum FROM #tmp)
		BEGIN
			INSERT INTO #tmp(QQNum,NotExist) VALUES(@QQ,'1')
			INSERT INTO QQNumInfo(QQNum,NotExist) VALUES(@QQ,'1')
			SELECT ID,QQNum,NotExist FROM #tmp
		END
		ELSE
		BEGIN
			DECLARE cursor_QunNum CURSOR FOR SELECT QunNum FROM #tmp
			DECLARE @temp INT
			DECLARE @QunList_Num INT
			DECLARE @QunInfo_Num INT
			OPEN cursor_QunNum
			FETCH NEXT FROM cursor_QunNum INTO @temp
			WHILE @@FETCH_STATUS=0
			BEGIN
				SET @QunList_Num=(@temp-1)/1000000+1
				SET @QunInfo_Num=(@QunList_Num-1)/10+1
				EXEC (
					'update #tmp set QunTitle=(select Title from QunInfo' + @QunInfo_Num + '.dbo.QunList'
					+ @QunList_Num + ' where QunNum=' + @temp + ') where QunNum=' + @temp
				)
				FETCH NEXT FROM cursor_QunNum INTO @temp
			END
			CLOSE cursor_QunNum
			INSERT INTO QQNumInfo(QQNum,Nick,Age,Gender,QunNum,QunTitle) SELECT QQNum,Nick,Age,Gender,QunNum,QunTitle FROM #tmp
			SELECT ID,QQNum,Nick,Age,Gender,QunNum,QunTitle FROM #tmp
		END
	END
END

--launcher.library
plugins/org.eclipse.equinox.launcher.win32.win32.x86_1.1.2.R36x_v20101222
-showsplash
org.eclipse.platform
--launcher.defaultAction
openFile
-product
org.eclipse.epp.package.java.product
--launcher.defaultAction
openFile
-startup
plugins/org.eclipse.equinox.launcher_1.1.1.R36x_v20101122_1400.jar
-vmargs
-Dosgi.requiredJavaVersion=1.5
-Xms768m
-Xmx768m
-XX:PermSize=384m
-XX:MaxPermSize=384m
-Xmn128m
-Xverify:none
-Xnoclassgc
-XX:+UseParNewGC
-XX:+UseConcMarkSweepGC
-XX:CMSInitiatingOccupancyFraction=85
-XX:ReservedCodeCacheSize=64m
-Duser.timezone=GMT+08

# cron - regular background program processing daemon
#
# cron is a standard UNIX program that runs user-specified programs at
 
# periodic scheduled times
 
description "regular background program processing daemon"
 
start on runlevel [2345]
stop on runlevel [!2345]
 
expect fork
 
respawn
 
exec cron

/etc/init
/etc/init.d
/etc/rc${runlevel}.d

rc.conf
rc-sysinit.conf
rcS.conf

exec /etc/init.d/rc $RUNLEVEL

cls
@echo off
cd /d %~dp0
regsvr32 /s PersonalBankMain.ocx
if %errorlevel% neq 0 echo 请使用右键--以管理员身份运行本脚本&pause>nul&exit
regsvr32 /s CMBEdit.dll
if "%PROCESSOR_ARCHITECTURE%" neq "x86" goto _64
goto _86
 
:_64
set vmbit=64
copy /y CertClient%vmbit%.dat "%WinDir%\SysWOW64\drivers\CertClient.dat"
copy /y CMBProtector%vmbit%.dat "%WinDir%\SysWOW64\drivers\CMBProtector.dat"
copy /y PBHttpComm.dll "%WinDir%\SysWOW64\"
copy /y PBFinanceMgr "%WinDir%\SysWOW64\"
sc create CMB8100 type= kernel start= auto binpath= "%WinDir%\SysWOW64\drivers\CertClient.dat" displayname= "CMB8100"
sc create CMBProtector type= kernel start= auto binpath= "%WinDir%\SysWOW64\drivers\CMBProtector.dat" displayname= "CMBProtector"
goto install
 
:_86
copy /y CertClient.dat "%WinDir%\System32\drivers\CertClient.dat"
copy /y CMBProtector.dat "%WinDir%\System32\drivers\CMBProtector.dat"
copy /y PBHttpComm.dll "%WinDir%\System32\"
copy /y PBFinanceMgr "%WinDir%\System32\"
sc create CMB8100 type= kernel start= auto binpath= "%WinDir%\System32\drivers\CertClient.dat" displayname= "CMB8100"
sc create CMBProtector type= kernel start= auto binpath= "%WinDir%\System32\drivers\CMBProtector.dat" displayname= "CMBProtector"
goto install
 
:install
net start CMB8100
net start CMBProtector
echo 安装完成！
pause

cls
@echo off
cd /d %~dp0
CMBPBUninstall.exe
regsvr32 /u /s PersonalBankMain.ocx
regsvr32 /u /s CMBEdit.dll
net stop CMB8100
if %errorlevel% neq 0 echo 已经卸载过或者没有以管理员身份运行本脚本&pause>nul&exit
sc delete CMB8100
net stop CMBProtector
sc delete CMBProtector
if "%PROCESSOR_ARCHITECTURE%" neq "x86" goto _64
goto _86
 
:_64
del /f /q "%WinDir%\SysWOW64\drivers\CertClient.dat"
del /f /q "%WinDir%\SysWOW64\drivers\CMBProtector.dat"
del /f /q "%WinDir%\SysWOW64\PBHttpComm.dll"
del /f /q "%WinDir%\SysWOW64\PBFinanceMgr"
reg delete "HKEY_LOCAL_MACHINE\SOFTWARE\Wow6432Node\CMB" /f
reg delete "HKEY_CLASSES_ROOT\VirtualStore\MACHINE\SOFTWARE\Wow6432Node\CMB" /f
reg delete "HKEY_CURRENT_USER\Software\Classes\VirtualStore\MACHINE\SOFTWARE\Wow6432Node\CMB" /f
goto uninstall
 
:_86
del /f /q "%WinDir%\System32\drivers\CertClient.dat"
del /f /q "%WinDir%\System32\drivers\CMBProtector.dat"
del /f /q "%WinDir%\System32\PBHttpComm.dll"
del /f /q "%WinDir%\System32\PBFinanceMgr"
reg delete "HKEY_LOCAL_MACHINE\SOFTWARE\CMB" /f
reg delete "HKEY_CLASSES_ROOT\VirtualStore\MACHINE\SOFTWARE\CMB" /f
reg delete "HKEY_CURRENT_USER\Software\Classes\VirtualStore\MACHINE\SOFTWARE\CMB" /f
goto uninstall
 
:uninstall
rmdir /s /q "%USERPROFILE%\CMB"
reg delete "HKEY_CURRENT_USER\SOFTWARE\CMB" /f
echo 卸载完成！
pause

#!/bin/bash
#!/bin/bash
#This is a ShellScript For Auto DB Backup
 
#Setting
#设置数据库名，数据库登录名，密码，备份路径，日志路径，数据文件位置，以及备份方式
#默认情况下备份方式是tar，还可以是mysqldump
#默认情况下，用root(空)登录mysql数据库，备份至/root/dbxxxxx.tar.gz
#mysqldump情况下，会重启httpd服务
DBName=db
DBUser=root
DBPasswd=
BackupPath=/root/
LogFile=/root/db.log
DBPath=/var/lib/mysql/
BackupMethod=mysqldump
#BackupMethod=tar
#Setting End
 
NewFile="$BackupPath"db$(date +%y%m%d).tar.gz
DumpFile=db$(date +%y%m%d).sql
OldFile="$BackupPath"db$(date +%y%m%d --date='30 days ago').tar.gz
 
echo "-------------------------------------------" >> $LogFile
echo $(date +"%y-%m-%d %H:%M:%S") >> $LogFile
echo "--------------------------" >> $LogFile
#Delete Old File
if [ -f $OldFile ]
then
 rm -f $OldFile >> $LogFile 2>&1
 echo "[$OldFile]Delete Old File Success!" >> $LogFile
else
 echo "[$OldFile]No Old Backup File!" >> $LogFile
fi
 
if [ -f $NewFile ]
then
 echo "[$NewFile]The Backup File is exists,Can't Backup!" >> $LogFile
else
 case $BackupMethod in
 mysqldump)
     cd $BackupPath
     service httpd stop >> $LogFile
     if [ -z $DBPasswd ]
     then
        mysqldump -u $DBUser --opt $DBName > $DumpFile
     else
        mysqldump -u $DBUser -p$DBPasswd --opt $DBName > $DumpFile
     fi
     tar czvf $NewFile $DumpFile >> $LogFile 2>&1
     echo "[$NewFile]Backup Success!" >> $LogFile
     rm -rf $DumpFile
     service httpd start >> $LogFile
     ;;
 *)
     /etc/init.d/mysqld stop >/dev/null 2>&1
     tar czvf $NewFile $DBPath$DBName >> $LogFile 2>&1
     /etc/init.d/mysqld start >/dev/null 2>&1
     echo "[$NewFile]Backup Success!" >> $LogFile
     ;;
 esac
fi
 
echo "-------------------------------------------" >> $LogFile

#!/bin/bash
#!/bin/bash
#This is a ShellScript For Web Files Backup
 
#Setting
#设置备份路径，日志路径，web文件位置
#默认情况下，备份至/root/webxxxxx.tar.gz
BackupPath=/root/
LogFile=/root/web.log
WebPath=/var/www/html/
#Setting End
 
NewFile="$BackupPath"web$(date +%y%m%d).tar.gz
OldFile="$BackupPath"web$(date +%y%m%d --date='30 days ago').tar.gz
 
echo "-------------------------------------------" >> $LogFile
echo $(date +"%y-%m-%d %H:%M:%S") >> $LogFile
echo "--------------------------" >> $LogFile
#Delete Old File
if [ -f $OldFile ]
then
 rm -f $OldFile >> $LogFile 2>&1
 echo "[$OldFile]Delete Old File Success!" >> $LogFile
else
 echo "[$OldFile]No Old Backup File!" >> $LogFile
fi
 
if [ -f $NewFile ]
then
 echo "[$NewFile]The Backup File is exists,Can't Backup!" >> $LogFile
else
 cd $WebPath
 tar czvf $NewFile . >> $LogFile 2>&1
 echo "[$NewFile]Backup Success!" >> $LogFile
fi
 
echo "-------------------------------------------" >> $LogFile

SHELL=/bin/bash
PATH=/sbin:/bin:/usr/sbin:/usr/bin
MAILTO=root
HOME=/
 
# For details see man 4 crontabs
 
# Example of job definition:
# .---------------- minute (0 - 59)
# |  .------------- hour (0 - 23)
# |  |  .---------- day of month (1 - 31)
# |  |  |  .------- month (1 - 12) OR jan,feb,mar,apr ...
# |  |  |  |  .---- day of week (0 - 6) (Sunday=0 or 7) OR sun,mon,tue,wed,thu,fri,sat
# |  |  |  |  |
# *  *  *  *  * user-name command to be executed
0 4 * * * root /root/dbbackup.sh
5 4 * * * root /root/webbackup.sh

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <windows.h>
 
#define ListSize 3000
#define TableSize ListSize*5/4
#define  NULLKEY  0
 
typedef int KeyType;
 
typedef struct
{
	KeyType key;
}RecordType;
 
typedef struct node
{
	KeyType key;
	struct node *lchild,*rchild;
}BSTNode,*BSTree;
 
typedef struct
{
    KeyType r[ListSize+1];
	int Length;
}RecordList;
 
typedef struct  //索引表结点
{
	int key;     //最大关键字域
	int link;    //指向本块第一个结点的位置
}Index;
 
typedef struct   //顺序表结点
{  
	int key;     //关键字域
}Dexlist;
 
typedef struct Node{	
	int data;
	struct Node *next;
}Node;
 
typedef RecordType HashTable[TableSize];
Dexlist dexlist[ListSize+1];
Index index[10];
RecordList list;
HashTable hashtable;
BSTree *bst;
Node **A;
 
int SeqSearch(RecordList l,KeyType k);
void InSort(RecordList *l,int length);
int BinSrch(RecordList l,KeyType k);
void InsertBST(BSTree *bst, KeyType x);
void CreateBST(BSTree *bst,RecordList list);
int SearchBST(BSTree bst,KeyType key);
int CreatIndex(Dexlist dl[],Index index[],RecordList list);
int IndexSearch(Dexlist r[],Index index[],int key);
int Hash(KeyType k);
void CreatHashTable(RecordList l,int SIZE);
int  HashSearch(HashTable ht, KeyType K,int SIZE);
void InitHash(Node **Q);
void InsertHash(Node **Q,int value);
int SearchHash(Node **Q,int value);
 
int CaseChoice(int choice,int x)
{
	int i,k=0,flag=0;
		bst=(BSTree *)malloc(sizeof(BSTree));
	if(choice==1)
	{
		k=SeqSearch(list,x);
		return k;
	}
	else if(choice==2)
	{
		InSort(&list,ListSize); 
		k=BinSrch(list,x);
		return k;
	}
	else if(choice==3)
	{
		CreateBST(bst,list);
		k=SearchBST(*bst,x);
		return k;
	}
	else if(choice==4)
	{
		flag=CreatIndex(dexlist,index,list);
		if(!flag) 
		{
			printf("\n\n对不起！索引表创建失败\n");
			exit(0);
		}
		k=IndexSearch(dexlist,index,x);
		return k;
	}
	else if(choice==5)
	{
		CreatHashTable(list,TableSize);
		k=HashSearch(hashtable,x,TableSize);
		return k;
	}
	else if(choice==6)
	{
		A=(Node **)malloc(sizeof(Node*)*10); //申请一个指针型数组A[n]
		InitHash(A);//初始化数组A
		for(i=1;i<=ListSize;i++)
			InsertHash(A,list.r[i]);//print_hash(A,n);
		k=SearchHash(A,x);
		return k;
	}
	else if(choice==7)
		exit(0);
	else
	{
		printf("\n    输入错误！\n");
		exit(0);
	}
 }
 
void main()
{
	int i,j,x,choice,k=0;
	list.Length=ListSize;
	srand((unsigned)time(NULL));
	double runtime;
	int T=0,F=0;
	int success[ListSize],fail[ListSize];
	long dwStart,dwEnd;
	do{
		printf("\n\n=========六种查找算法效率比较=========");//
		printf("\n\n	1. 顺序查找");
		printf("\n\n        2. 折半查找");
		printf("\n\n        3. 二叉树查找");
		printf("\n\n        4. 索引查找");
		printf("\n\n        5. 开地址法哈希查找(α=0.8)");
		printf("\n\n        6. 拉链法哈希查找");
		printf("\n\n        7. 退出\n");
		printf("\n======================================");
		printf("\n    请输入您的选择 (1,2,3,4,5,6,7)：");
		scanf("%d",&choice);
		for(i=0;i<ListSize;i++)
		{
			j=1+(unsigned)(10000.0*rand()/(RAND_MAX+1.0));
			list.r[i]=j;
		}
		bst=(BSTree *)malloc(sizeof(BSTree));
		srand((unsigned)time(NULL));
		for(i=0;i<ListSize;i++)
		{
			j=1+(unsigned)(10000.0*rand()/(RAND_MAX+1.0));
			x=j;
			k=CaseChoice(choice,x);
			if(k==0)
			{
				fail[F]=x;
				F++;
			}
			else
			{
				success[T]=x;
				T++;
			}
		}
 
		dwStart=GetTickCount();
		for(i=0;i<F;i++)
			k=CaseChoice(choice,fail[i]);
		dwEnd=GetTickCount();
		runtime=(double)(dwEnd-dwStart)/F;
		printf("\n     查找了%d个数的数组，该种查找算法的平均查找失败时间是：%lf ms\n",ListSize,runtime);
 
		dwStart=GetTickCount();
		for(i=0;i<T;i++)
			k=CaseChoice(choice,success[i]);
		dwEnd=GetTickCount();
		runtime=(double)(dwEnd-dwStart)/T;
		printf("\n     查找了%d个数的数组，该种查找算法的平均查找成功时间是：%lf ms\n\n",ListSize,runtime);
	}while(choice!=7);
}
 
 
int SeqSearch(RecordList l,KeyType k)
/*在顺序表l中顺序查找其关键字等于k的元素，若找到，则函数值为该元素在表中的位置，否则为0*/
{
	int i;
	l.r[0]=k;
	i=l.Length;
	while(l.r[i]!=k)
		i--;
	return(i);
}   //顺序查找
 
void InSort(RecordList *l,int length)
/* 对记录数组r做直接插入排序，length为数组中待排序记录的数目*///直接插入排序
{
	int i,j;
	for(i=2;i<=length;i++)
	{
		l->r[0]=l->r[i];//将待插入记录存放到监视哨r[0]中
		j=i-1;
		while(l->r[0]<l->r[j])/* 寻找插入位置 */
		{
			l->r[j+1]= l->r[j];
			j=j-1;
		}
		l->r[j+1]=l->r[0]; /*将待插入记录插入到已排序的序列中*/
	}
}   //插入排序
 
int BinSrch(RecordList l,KeyType k)
/*在有序表l中折半查找其关键字等于k的元素，若找到，则函数值为该元素在表中的位置*/
{
	int low,high,mid;
	low=1;
	high=l.Length;/*置区间初值*/
	while(low<=high)
	{
		mid=(low+high)/2;
		if(k==l.r[mid])
			return(mid);/*找到待查元素*/
		else
			if(k<l.r[mid])
				high=mid-1;/*未找到，则继续在前半区间进行查找*/
			else
				low=mid+1;/*继续在后半区间进行查找*/
	}
	return (0);
}   //折半查找
 
void InsertBST(BSTree *bst,KeyType x)
/*若在二叉排序树中不存在关键字等于key的元素，插入该元素*/
{
	BSTree s;
	if(*bst==NULL)/*递归结束条件*/
	{
		s=(BSTree)malloc(sizeof(BSTNode));/*申请新的结点s*/
		s->key=x;
		s->lchild=NULL; 
		s->rchild=NULL;
		*bst=s;
	}
	else 
		if(x<(*bst)->key)
			InsertBST(&((*bst)->lchild),x);/*将s插入左子树*/
		else
			if(x>(*bst)->key)
				InsertBST(&((*bst)->rchild), x); /*将s插入右子树*/
}
void CreateBST(BSTree *bst,RecordList list)
{
	int i;
	*bst = NULL;
	for(i=1;i<=ListSize;i++)
	{
		InsertBST(bst,list.r[i]);
	}
}
int SearchBST(BSTree bst,KeyType key)/*返回1成功，返回0失败*/
{
	BSTree q;
	q=bst;
	while(q)
	{
		if(q->key==key)
			return 1;
		if(q->key>key)
			q=q->lchild;
		else
			q=q->rchild;
	}
	return 0;
}   //二叉查找
 
int CreatIndex(Dexlist dexlist[],Index index[],RecordList list)
{
	int m,n,i;
	int number[10];
	for(i=1;i<=10;i++)
		index[i-1].key=1000*i;
	for(i=1;i<=10;i++)
		number[i-1]=0;
	index[0].link=1;
	for(m=1;m<=ListSize;m++)
	{
		i=0;
		while((list.r[m]>index[i].key)&&(i<10))
			i++;
		number[i]++;
	}
	for(n=1;n<10;n++)
		index[n].link=index[n-1].link+number[n-1];
 
    for(m=1;m<=ListSize;m++)
	{
		i=0;
		while((list.r[m]>index[i].key)&&(i<10))
			i++;
		n=index[i].link;
		dexlist[n].key=list.r[m];
		index[i].link++;
	}
	m--;
	if(m==ListSize)
		return 1;
	else
		return 0;
}
int IndexSearch(Dexlist r[],Index index[],int key)//key 为给定值，索引表为index[1]..index[b]    
{
	int i,j;
	i=0;
	while((key>index[i].key)&&(i<10))
		i++;
	if(i>=10)
	{
		return 0;
	}
	if(i>0)
		j=index[i-1].link;
	else
		j=index[0].link;
	while((j<ListSize)&&(key!=r[j].key)&&(r[j].key<=index[i].key))
			j++;
	if(key==r[j].key)
		return 1;
	else
		return 0;
}   //索引查找
 
int Hash(KeyType k)
{
	int h;
	h=k%(TableSize);
	return h;
}
void CreatHashTable(RecordList l,int SIZE)
{
	int i,j,hj,t;
	int p;
	for(i=0;i<SIZE;i++)
	{
		hashtable[i].key=NULLKEY;
	}
	for(i=1;i<=ListSize;i++)
	{
		fflush(stdin);
		p=l.r[i];
		j=Hash(p);
		if(hashtable[j].key==NULLKEY)
			hashtable[j].key=p;
		else
		{
			for(t=1;t<SIZE;t++)
			{
				hj=(j+t)%(SIZE);
				if(hashtable[hj].key==NULLKEY)
				{
					hashtable[hj].key=p;
					t=SIZE;
				}
			}
 
		}
	}
}
int HashSearch(HashTable ht, KeyType K,int SIZE)
{
	int h0;
	int i;
	int hi;
	h0=Hash(K);
	if(ht[h0].key==NULLKEY)
		return 0;
	else
		if(ht[h0].key==K)
			return 1;
		else/* 用线性探测再散列解决冲突 */
		{
			for(i=0;i<SIZE-1;i++)
			{
				hi=(h0+i)%SIZE;
				if(ht[hi].key==NULLKEY)
					return 0;
				else
					if(ht[hi].key==K)
						return 1;
			}
			return 0;
		}
}   //开地址法哈希查找
 
void InitHash(Node **A)
{
	int i;
	for(i=0;i<15;i++)
	{
		A[i]=(Node *)malloc(sizeof(Node));
		A[i]->data=0;
		A[i]->next=NULL;
	}
}
void InsertHash(Node **Q,int value)
{
	int key;
	Node *p,*q;
	key=value%15;
	if(Q[key]->next!=NULL)
	{
		p=Q[key]->next;
		while(p->next!=NULL)
			p=p->next;
		q=(Node *)malloc(sizeof(Node));
		q->data=value;
		q->next=NULL;
		p->next=q;
	}
	else
	{
		q=(Node *)malloc(sizeof(Node));
		q->data=value;
		q->next=NULL;
		Q[key]->next=q;
	}
}
int SearchHash(Node **Q,int value)
{
	int key;
	Node *p;
	key=value%15;
	if(Q[key]->next==NULL)
	return 0;
	else
	{
		p=Q[key]->next;
		while(p!=NULL)
		{
			if(p->data==value)
			return 1;
			p=p->next;
		}
		return 0;
	}
}     //拉链法哈希查找

#include<stdio.h>
#include<stdlib.h>
#include<time.h>
#include<windows.h>
#define MAX 100000
 
void InsSort(int r[],int length)
{
	int i,j;
	for (i=2;i<=length;i++)
	{
		r[0]=r[i];
		j=i-1;
		while(r[0]<r[j])
		{
			r[j+1]=r[j];
			j=j-1;
		}
		r[j+1]=r[0];
	}
}       //插入排序
 
void swap(int &x,int &y)
{
	int z;
	z=x;
	x=y;
	y=z;
}
int median3(int a[],int left,int right)
{
	int center=(left+right)/2;
	if(a[left]>a[center])
		swap(a[left],a[center]);
	if(a[left]>a[right])
		swap(a[left],a[right]);
	if(a[center]>a[right])
		swap(a[center],a[right]);
	swap(a[center],a[right-1]);
	return a[right-1];
}
void insertionsort(int a[],int n)
{
	int j,p;
	int tmp;
	for(p=1;p<=n;p++)
	{
		tmp=a[p];
		for(j=p;j>0&&a[j-1]>tmp;j--)
			a[j]=a[j-1];
		a[j]=tmp;
	}
}
void qsort(int a[],int left,int right)
{
	int i,j;
	int pivot;
	if(left+2<=right)
	{
		pivot=median3(a,left,right);
		i=left;j=right-1;
		for(;;)
		{
			while(a[++i]<pivot){}
			while(a[--j]>pivot){}
			if(i<j)
				swap(a[i],a[j]);
			else
				break;
		}
		swap(a[i],a[right-1]);
		qsort(a,left,i-1);
		qsort(a,i+1,right);
	}
	else
		insertionsort(a+left,right-left+1);
}
void quicksort(int a[],int n)
{
	qsort(a,0,n-1);
}      //快速排序
 
void BubbleSort(int r[],int length)
{
	int i,j,temp;
	for(j=length;j>0;j--)
		for(i=0;i<j-1;i++)
			if(r[i]>r[i+1])
			{
				temp=r[i];
				r[i]=r[i+1];
				r[i+1]=temp;
			}
}      //冒泡排序
 
void ShellInsert(int r[],int length,int delta)
{
	int i,j;
	for(i=1+delta;i<=length;i++)
		if(r[i]<r[i-delta])
		{
			r[0]=r[i];
			for(j=i-delta;j>0&&r[0]<r[j];j-=delta)
				r[j+delta]=r[j];
			r[j+delta]=r[0];
		}
}
void  ShellSort(int r[], int length, int delt[], int n)
{ 
	int i;
	for(i=0;i<=n-1;++i)
		ShellInsert(r,length,delt[i]);
}       //希尔排序
 
void SelectSort(int r[],int length)
{
	int i,j,k;
	int n;
	int x;
    n=length;
	for (i=1;i<=n-1;++i)
	{
		k=i;
		for(j=i+1;j<=n;++j)
			if(r[j]<r[k])
				k=j;
			if( k!=i)
			{
				x= r[i];
				r[i]=r[k];
				r[k]=x;
			}
	}
 
}        //简单选择排序
 
void sift(int r[],int k,int m)
{
	int t;
	int i,j;
	int x;
	int finished;
	t= r[k];
	x=r[k];
	i=k;
	j=2*i;
	finished=FALSE;
	while(j<=m&&!finished)
	{     
		if(j<m&&r[j]< r[j+1])
			j=j+1;
		if(x>=r[j])
			finished=TRUE;
		else 
		{
			r[i]=r[j];
			i=j;
			j=2*i;
		}
	}
	r[i] =t;
}
void crt_heap(int r[], int length)
{
	int i,n;
    n=length;
	for (i=n/2;i>=1;--i) 
		sift(r,i,n);
}
void HeapSort(int r[],int length)
{
	int i,n;
	int b;
	crt_heap(r,length);
	n= length;
	for (i=n;i>=2;--i)
	{
		b=r[1];
		r[1]=r[i];
		r[i]=b;
		sift(r,1,i-1);
	}
}       //堆排序
 
void merge(int a[],int tmparray[],int lpos,int rpos,int rightend)
{
	int i,leftend,numelements,tmppos;
	leftend=rpos-1;
	tmppos=lpos;
	numelements=rightend-lpos+1;
	while(lpos<=leftend && rpos<=rightend)
		if(a[lpos]<=a[rpos])
			tmparray[tmppos++]=a[lpos++];
		else
			tmparray[tmppos++]=a[rpos++];
		while(lpos<=leftend)
			tmparray[tmppos++]=a[lpos++];
		while(rpos<=rightend)
			tmparray[tmppos++]=a[rpos++];
		for(i=0;i<numelements;i++,rightend--)
			a[rightend]=tmparray[rightend];
}
void msort(int a[],int tmparray[],int left,int right)
{
	int center;
	if(left<right)
	{
		center=(left+right)/2;
		msort(a,tmparray,left,center);
		msort(a,tmparray,center+1,right);
		merge(a,tmparray,left,center+1,right);
	}
}
void mergesort(int a[],int n)
{
	int *tmparray;
	tmparray=(int*)malloc(n*sizeof(int));
	if(tmparray!=NULL)
	{
		msort(a,tmparray,0,n-1);
		free(tmparray);
	}
	else
		printf("no space for tmp array!");
}        //归并排序
 
void BInsertSort(int num[],int n)
{
	int length=n;
	int low,high,i,j,m;
	for(i=2;i<=length;i++)
	{
	   num[0]=num[i];
	   low=1;
	   high=i-1;
	   while(low<=high)
	   {
		   m=(low+high)/2;
			if(num[0]<num[m])
				high=m-1;
			else
				low=m+1;
	   }
	   for(j=i-1;j>=high+1;j--)
		   num[j+1]=num[j];
	   num[high+1]=num[0];
	}
}        //折半插入排序
 
void main()
{
	long dwStart,dwStop,runtime;
	int num[MAX],a[MAX],i,j;
	dwStart=GetTickCount();
	srand((unsigned)time(NULL));
	for(i=0;i<MAX;i++)
		num[i]=rand();	
	dwStop=GetTickCount();
	runtime=dwStop-dwStart;
	printf("生成%d个随机数运行了%ldms\n\n",MAX,runtime);
 
	printf("********平均排序时间********\n");
	for(i=0;i<MAX;i++)
		a[i]=num[i];
	dwStart=GetTickCount();
	InsSort(a,MAX);
	dwStop=GetTickCount();
	runtime=dwStop-dwStart;
	printf("使用插入排序运行了%ldms\n",runtime);
 
	for(i=0;i<MAX;i++)
		a[i]=num[i];
	dwStart=GetTickCount();
	quicksort(a,MAX);
	dwStop=GetTickCount();
	runtime=dwStop-dwStart;
	printf("使用快速排序运行了%ldms\n",runtime);
 
	for(i=0;i<MAX;i++)
		a[i]=num[i];
	dwStart=GetTickCount();
	BubbleSort(a,MAX);
	dwStop=GetTickCount();
	runtime=dwStop-dwStart;
	printf("使用冒泡排序运行了%ldms\n",runtime);
 
	int delt[10]={100,80,60,40,20,10,5,3,2,1};
	for(i=0;i<MAX;i++)
		a[i]=num[i];
	dwStart=GetTickCount();
	ShellSort(a,MAX,delt,10);
	dwStop=GetTickCount();
	runtime=dwStop-dwStart;
	printf("使用希尔排序运行了%ldms\n",runtime);
 
	for(i=0;i<MAX;i++)
		a[i]=num[i];
	dwStart=GetTickCount();
	SelectSort(a,MAX);
	dwStop=GetTickCount();
	runtime=dwStop-dwStart;
	printf("使用简单选择排序运行了%ldms\n",runtime);
 
	for(i=0;i<MAX;i++)
		a[i]=num[i];
	dwStart=GetTickCount();
	HeapSort(a,MAX);
	dwStop=GetTickCount();
	runtime=dwStop-dwStart;
	printf("使用堆排序运行了%ldms\n",runtime);
 
	for(i=0;i<MAX;i++)
		a[i]=num[i];
	dwStart=GetTickCount();
	mergesort(a,MAX);
	dwStop=GetTickCount();
	runtime=dwStop-dwStart;
	printf("使用归并排序运行了%ldms\n",runtime);
 
	for(i=0;i<MAX;i++)
		a[i]=num[i];
	dwStart=GetTickCount();
	BInsertSort(a,MAX);
	dwStop=GetTickCount();
	runtime=dwStop-dwStart;
	printf("使用折半插入排序运行了%ldms\n",runtime);
	printf("****************************\n\n");
 
	printf("******最好情况排序时间******\n");
	for(i=0;i<MAX;i++)
		a[i]=i;
	dwStart=GetTickCount();
	InsSort(a,MAX);
	dwStop=GetTickCount();
	runtime=dwStop-dwStart;
	printf("使用插入排序运行了%ldms\n",runtime);
 
	for(i=0;i<MAX;i++)
		a[i]=i;
	dwStart=GetTickCount();
	quicksort(a,MAX);
	dwStop=GetTickCount();
	runtime=dwStop-dwStart;
	printf("使用快速排序运行了%ldms\n",runtime);
 
	for(i=0;i<MAX;i++)
		a[i]=i;
	dwStart=GetTickCount();
	BubbleSort(a,MAX);
	dwStop=GetTickCount();
	runtime=dwStop-dwStart;
	printf("使用冒泡排序运行了%ldms\n",runtime);
 
	for(i=0;i<MAX;i++)
		a[i]=i;
	dwStart=GetTickCount();
	ShellSort(a,MAX,delt,10);
	dwStop=GetTickCount();
	runtime=dwStop-dwStart;
	printf("使用希尔排序运行了%ldms\n",runtime);
 
	for(i=0;i<MAX;i++)
		a[i]=i;
	dwStart=GetTickCount();
	SelectSort(a,MAX);
	dwStop=GetTickCount();
	runtime=dwStop-dwStart;
	printf("使用简单选择排序运行了%ldms\n",runtime);
 
	for(i=0;i<MAX;i++)
		a[i]=i;
	dwStart=GetTickCount();
	HeapSort(a,MAX);
	dwStop=GetTickCount();
	runtime=dwStop-dwStart;
	printf("使用堆排序运行了%ldms\n",runtime);
 
	for(i=0;i<MAX;i++)
		a[i]=i;
	dwStart=GetTickCount();
	mergesort(a,MAX);
	dwStop=GetTickCount();
	runtime=dwStop-dwStart;
	printf("使用归并排序运行了%ldms\n",runtime);
 
	for(i=0;i<MAX;i++)
		a[i]=i;
	dwStart=GetTickCount();
	BInsertSort(a,MAX);
	dwStop=GetTickCount();
	runtime=dwStop-dwStart;
	printf("使用折半插入排序运行了%ldms\n",runtime);
	printf("****************************\n\n");
 
	printf("******最坏情况排序时间******\n");
	for(i=MAX-1,j=0;i<=0,j<MAX;i--,j++)
		a[j]=i;
	dwStart=GetTickCount();
	InsSort(a,MAX);
	dwStop=GetTickCount();
	runtime=dwStop-dwStart;
	printf("使用插入排序运行了%ldms\n",runtime);
 
	for(i=MAX-1,j=0;i<=0,j<MAX;i--,j++)
		a[j]=i;
	dwStart=GetTickCount();
	quicksort(a,MAX);
	dwStop=GetTickCount();
	runtime=dwStop-dwStart;
	printf("使用快速排序运行了%ldms\n",runtime);
 
	for(i=MAX-1,j=0;i<=0,j<MAX;i--,j++)
		a[j]=i;
	dwStart=GetTickCount();
	BubbleSort(a,MAX);
	dwStop=GetTickCount();
	runtime=dwStop-dwStart;
	printf("使用冒泡排序运行了%ldms\n",runtime);
 
	for(i=MAX-1,j=0;i<=0,j<MAX;i--,j++)
		a[j]=i;
	dwStart=GetTickCount();
	ShellSort(a,MAX,delt,10);
	dwStop=GetTickCount();
	runtime=dwStop-dwStart;
	printf("使用希尔排序运行了%ldms\n",runtime);
 
	for(i=MAX-1,j=0;i<=0,j<MAX;i--,j++)
		a[j]=i;
	dwStart=GetTickCount();
	SelectSort(a,MAX);
	dwStop=GetTickCount();
	runtime=dwStop-dwStart;
	printf("使用简单选择排序运行了%ldms\n",runtime);
 
	for(i=MAX-1,j=0;i<=0,j<MAX;i--,j++)
		a[j]=i;
	dwStart=GetTickCount();
	HeapSort(a,MAX);
	dwStop=GetTickCount();
	runtime=dwStop-dwStart;
	printf("使用堆排序运行了%ldms\n",runtime);
 
	for(i=MAX-1,j=0;i<=0,j<MAX;i--,j++)
		a[j]=i;
	dwStart=GetTickCount();
	mergesort(a,MAX);
	dwStop=GetTickCount();
	runtime=dwStop-dwStart;
	printf("使用归并排序运行了%ldms\n",runtime);
 
	for(i=MAX-1,j=0;i<=0,j<MAX;i--,j++)
		a[j]=i;
	dwStart=GetTickCount();
	BInsertSort(a,MAX);
	dwStop=GetTickCount();
	runtime=dwStop-dwStart;
	printf("使用折半插入排序运行了%ldms\n",runtime);
	printf("****************************\n");
 
	printf("\n排序测试完成！");
	getchar();
}