91ph在线,国产一区二区三区免费,亚洲xxxxx电影

��h物_Amor — Fri, 16 Dec 2016 09:05:00 GMT

摘要: 需求描�q�ͼ�公司通过APP产品分��n出去的需求和��历是做了一个H5��面作�ؓ分��n的链接，通过APP分��n出去自然是没问题�Q�也是第一�ơ分享，之后通过微信打开H5��面后想再次分��n出去时候就变成了一个链接了�Q�而不是自己定制的卡片模式�Q�初�ơ分享后如下�Q�但是打开以后的H5��面再分享出��d��变成�q�个样子了：也就是说需要在H5��面做微信分享的相关工作�Q�JS-SDK上场了，首先看看JS-SDK的官方说明文档：https:/... 阅读全文

��h物_Amor 2016-12-16 17:05 发表评论

Array.sort()、Collections.sort()以及Comparable、Comparator学习�W�记

��h物_Amor — Mon, 29 Sep 2014 08:08:00 GMT

Arrays.sort(T[], Comparator < ? super T > c) �Ҏ(gu��)��用于对象数组按用戯��定义规则排序�?/span>

Collections.sort(List, Comparator < ? super T > c)�Ҏ(gu��)��用于对象集合按用戯��定义规则排序�?br />

Comparable用在对象本��n�Q�说明这个对象是可以被比较的�Q�也��是说可以被排序的。（String和Integer之所以可以比较大��，是因为它们都实现了Comparable接口�Q��ƈ实现了compareTo()�Ҏ(gu��)��Q��?/span>

Compator用在对象外，相当于定义了一个排序算法�?/span>

所以当对象本��n实现了Comparable接口�Q�那么Arrays.sort(T[])��可以了。同理Collections.sort(List)��可以了�?br />
�q�是代码来的直接�Q?br />

package com.zx.ww.comparable;

import java.util.Arrays;
import java.util.Comparator;

public class ComparatorTest {

    public static void main(String[] args) {
        Dog d1 = new Dog(2);

        Dog d2 = new Dog(1);

        Dog d3 = new Dog(3);

        Dog[] dogArray = {d1, d2, d3};

        printDogs(dogArray);

        Arrays.sort(dogArray, new DogSizeComparator());

        printDogs(dogArray);
    }

    public static void printDogs(Dog[] dogArray) {
        for (Dog dog : dogArray) {
            System.out.print(dog.size+" ");
        }
        System.out.println();
    }

}

class Dog{
    int size;
    public Dog(int size) {
        this.size = size;
    }
}

class DogSizeComparator implements Comparator<Dog> {
    @Override
    public int compare(Dog dog1, Dog dog2) {
        // TODO Auto-generated method stub
        return dog1.size - dog2.size;
    }
}

输出�l�果�Q?br />

2 1 3
1 2 3

�q�是对象数组用了Comparator的结果�?br />
下面看对象自�w�实��C��Comparable接口的方式：

/**
*
*/
package com.zx.ww.comparable;

import java.util.Arrays;

/**
* @author wuwei
* 2014�q?�?9�?br /> */
public class User implements Comparable<Object>{

    private int id;

    private String name;

    private int age;

    public User(int id, String name, int age) {
        this.id = id;
        this.name = name;
        this.age = age;
    }



    public int getId() {
        return id;
    }

    public void setId(int id) {
        this.id = id;
    }

    public String getName() {
        return name;
    }

    public void setName(String name) {
        this.name = name;
    }

    public int getAge() {
        return age;
    }

    public void setAge(int age) {
        this.age = age;
    }

    @Override
    public int compareTo(Object o) {
        // TODO Auto-generated method stub
        return this.age - ((User)o).getAge();
    }

    public static void main(String[] args) {
        User[] users = new User[] {new User(1,"zhangsan",28), new User(2,"lisi",25)};
        Arrays.sort(users);
        for (int i = 0; i < users.length; i++) {
            User user = users[i];
            System.out.println(user.getId()+" "+user.getAge());
        }
    }

}

输出�l�果�Q?br />

2 25
1 28

上述都是Arrays.sort()的应用方式，同理Collections.sort()一��L��实现�Q�代码如下，比较��单：

package com.zx.ww.comparable;

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;

public class CollectionSortTest {

    public static void main(String[] args) {
        List<String> list = new ArrayList<String>();
        list.add("ac");
        list.add("ab");
        list.add("aa");
        list.add("db");
        list.add("ca");

        for (String string : list) {
            System.out.print(string + " ");
        }
        System.out.println();
        Collections.sort(list);

        for (String string : list) {
            System.out.print(string + " ");
        }
        System.out.println();

        //对象A自��n实现Comparable接口
        List<A> aList = new ArrayList<A>();
        aList.add(new A("wuwei", 1));
        aList.add(new A("zhangsan", 3));
        aList.add(new A("lisi", 2));
        for (A a : aList) {
            System.out.print(a+" ");
        }
        System.out.println();
        Collections.sort(aList);
        for (A a : aList) {
            System.out.print(a+" ");
        }
        System.out.println();

        //重写Conparator接口�Ҏ(gu��)��
        List<B> bList = new ArrayList<B>();
        bList.add(new B("wuwei", 1));
        bList.add(new B("zhangsan", 3));
        bList.add(new B("lisi", 2));
        for (B b : bList) {
            System.out.print(b+" ");
        }
        System.out.println();
        Collections.sort(bList, new Comparator<B>() {

            @Override
            public int compare(B b1, B b2) {
                // TODO Auto-generated method stub
                return b1.getCount().compareTo(b2.getCount());
            }
        });
        for (B b : bList) {
            System.out.print(b+" ");
        }
        System.out.println();

    }


}

//对象A自��n实现Comparable接口
class A implements Comparable<A>{

    private String name;

    private Integer order;

    public A(String name, Integer order) {
        this.name = name;
        this.order = order;
    }

    public String getName() {
        return name;
    }

    public void setName(String name) {
        this.name = name;
    }

    public Integer getOrder() {
        return order;
    }

    public void setOrder(Integer order) {
        this.order = order;
    }

    public String toString() {
        return "name is " +name+" order is "+order;
    }

    @Override
    public int compareTo(A o) {
        // TODO Auto-generated method stub
        return this.order.compareTo(o.getOrder());
    }

}

class B{
    private String name;

    private Integer count;

    public B(String name, Integer count) {
        this.name = name;
        this.count = count;
    }

    public String getName() {
        return name;
    }

    public void setName(String name) {
        this.name = name;
    }

    public Integer getCount() {
        return count;
    }

    public void setCount(Integer count) {
        this.count = count;
    }

    public String toString() {
        return "name is "+name+" count is "+count;
    }
}

输出�l�果�Q?br />

ac ab aa db ca
aa ab ac ca db
name is wuwei order is 1 name is zhangsan order is 3 name is lisi order is 2
name is wuwei order is 1 name is lisi order is 2 name is zhangsan order is 3
name is wuwei count is 1 name is zhangsan count is 3 name is lisi count is 2
name is wuwei count is 1 name is lisi count is 2 name is zhangsan count is 3

��h物_Amor 2014-09-29 16:08 发表评论

快速、冒泡排序算法的性能比较

��h物_Amor — Thu, 25 Sep 2014 05:09:00 GMT

/**
*
*/
package com.zx.ww.arraysort;

import java.text.Collator;
import java.util.Arrays;
import java.util.Calendar;
import java.util.Comparator;
import java.util.Locale;

/**
* @author xue
* 2014�q?�?4�?br /> */
public class QuickSort {

    public static void main(String[] args) {
        for (int i = 0; i < 10; i++) {
            test();
        }
    }

    public static void test() {

        int len = 8000000;
        int[] array = new int[len];
        for (int i = 0; i < len; i++) {
            array[i] = (int)(Math.random()*10000);
        }

        Calendar cal_before = Calendar.getInstance();
        double before = cal_before.getTimeInMillis();
        System.out.println(cal_before.getTime());
        quickSort(array, 0, array.length-1);

        Calendar cal_after = Calendar.getInstance();
        double after = cal_after.getTimeInMillis();
        System.out.println(cal_after.getTime());


        double time = after-before;
        System.out.println("用时�Q?/span>" + time + "ms");
        System.out.println("==================================");

    }

    public static void quickSort(int[] array, int left, int right) {
        if(left < right) {
            int privot = getPrivot(array, left, right);
            quickSort(array, left, privot-1);
            quickSort(array, privot+1, right);
        }

    }


    //��数�l�划分�ؓ两个数组�Q�左边的数组都比中��uprivot��，双��的都比中轴privot�?/span>
    public static int getPrivot(int[] array, int left, int right) {

        int tmp = array[left];

        while(left < right) {

            while(left < right && array[right] >= tmp) {
                right--;
            }

            array[left] = array[right];

            while(left < right && array[left] <= tmp) {
                left++;
            }

            array[right] = array[left];

        }

        array[left] = tmp;

        return left;
    }

}

�q�行十次输出的结果：

Thu Sep 25 13:09:40 CST 2014
Thu Sep 25 13:09:41 CST 2014
用时�Q?/span>1613.0ms
==================================
Thu Sep 25 13:09:41 CST 2014
Thu Sep 25 13:09:43 CST 2014
用时�Q?/span>1614.0ms
==================================
Thu Sep 25 13:09:43 CST 2014
Thu Sep 25 13:09:45 CST 2014
用时�Q?/span>1691.0ms
==================================
Thu Sep 25 13:09:45 CST 2014
Thu Sep 25 13:09:47 CST 2014
用时�Q?/span>1622.0ms
==================================
Thu Sep 25 13:09:47 CST 2014
Thu Sep 25 13:09:48 CST 2014
用时�Q?/span>1621.0ms
==================================
Thu Sep 25 13:09:49 CST 2014
Thu Sep 25 13:09:50 CST 2014
用时�Q?/span>1615.0ms
==================================
Thu Sep 25 13:09:50 CST 2014
Thu Sep 25 13:09:52 CST 2014
用时�Q?/span>1614.0ms
==================================
Thu Sep 25 13:09:52 CST 2014
Thu Sep 25 13:09:54 CST 2014
用时�Q?/span>1632.0ms
==================================
Thu Sep 25 13:09:54 CST 2014
Thu Sep 25 13:09:55 CST 2014
用时�Q?/span>1614.0ms
==================================
Thu Sep 25 13:09:56 CST 2014
Thu Sep 25 13:09:57 CST 2014
用时�Q?/span>1614.0ms
==================================

上述是快速排序八百万条数据用时基本在1.6s左右�?br />
接下来看冒��排序�Q?br />

�q�行五次输出如下�l�果�Q?br />

Thu Sep 25 14:44:14 CST 2014
Thu Sep 25 14:44:23 CST 2014
��d��用时8822ms
==========================
Thu Sep 25 14:44:23 CST 2014
Thu Sep 25 14:44:32 CST 2014
��d��用时8829ms
==========================
Thu Sep 25 14:44:32 CST 2014
Thu Sep 25 14:44:41 CST 2014
��d��用时8915ms
==========================
Thu Sep 25 14:44:41 CST 2014
Thu Sep 25 14:44:50 CST 2014
��d��用时8748ms
==========================
Thu Sep 25 14:44:50 CST 2014
Thu Sep 25 14:44:58 CST 2014
��d��用时8529ms
==========================

冒��排序八万条数据用时接�q?s�?br />
需要注意的是快速排序是八百万条数据只用�?.6s左右�?br />

��h物_Amor 2014-09-25 13:09 发表评论

��h物_Amor — Wed, 24 Sep 2014 08:25:00 GMT

/**
*
*/
package com.infopatent.juangetljc.web.controller.util;

import java.lang.reflect.Field;
import java.text.Collator;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
import java.util.Locale;

/**
* @author xue
* 2014�q?�?4�?br /> */
public class SortListByBeanPropertyUtil {

    //�Ҏ(gu��)��集合里的Bean拥有的属性进行排�?/span>

    public static <T> void sort(List<T> list, final String sortProperty, final String sort) {

        if(list == null || sortProperty == null || "".equals(sortProperty) || list.isEmpty())
            return;

        Collections.sort(list, new Comparator<T>() {

            @Override
            public int compare(T t1, T t2) {
                Object o1 = new Object();
                Object o2 = new Object();
                try {
                    o1 = SortListByBeanPropertyUtil.getFieldValue(t1, sortProperty);
                    o2 = SortListByBeanPropertyUtil.getFieldValue(t2, sortProperty);

                } catch (Exception e) {
                    e.printStackTrace();
                }
                int result = 0;
                if(o1 == null) {
                    result = -1;
                }else if(o2 == null) {
                    result = 1;
                }else if(o1 instanceof String) {
                    result = Collator.getInstance(Locale.CHINESE).compare(o1, o2);
                }else{
                    result = ((Comparable)o1).compareTo(o2);
                }

                //是否降序排序
                if("desc".equalsIgnoreCase(sort)) {
                    result = 0-result;
                }

                return result;
            }

        });

    }

    //反射�Ҏ(gu��)��Q�反��出�c�d��
    public static Object getFieldValue(Object obj, String fieldName) throws Exception {
        //反射出对象类�?/span>
        Class cls = obj.getClass();
        //反射出类型字�D?/span>
        Field field = cls.getDeclaredField(fieldName);
        //获取属性是�Q�压制java对访问修饰符的检�?/span>
        field.setAccessible(true);
        //在对象obj上读取field属性的�?/span>
        Object val = field.get(obj);
        return val;

    }

}

��h物_Amor 2014-09-24 16:25 发表评论

��h物_Amor — Tue, 29 Jul 2014 07:07:00 GMT

因�ؓ��目框架hibernate里的hibernate.hbm2ddl.auto属性设�|��ؓcreate�Q��ؓ了��得开发�h员只��x��于实体类而不必去兛_��数据库设计。。。）�Q�所以我们每�ơ部�|�项目的时候都会把数据库生成的表全删除了然后根据实体类生成数据表，�q�样��需要在maven��目写一个测试类来初始化��目需要的一些基��数据�Q�如用户、权限、资源、字典等。因为maven在构建到特定的生命周期阶�D늚�时候会通过插�g来执行JUnit或者TestNG的测试用例，�q�个插�g��是maven-surefire-plugin�Q�这是需要配�|�的�Q�当然也可以��止��L��行测试类�Q�甚至禁止编译测试类�Q�，需要了解的请学习相关maven文档�Q�或者参考http://blog.csdn.net/sin90lzc/article/details/7543262�?br /> 考虑��C��q�因素，那么我就在src/test/java文�g夹下新徏一个测试类�Q�那么这个测试类��׃��在clean install时候会执行�Q�那么在�q�个时候执行数据初始化是合适的。因为初始化数据来自于sql脚本�Q�所以我得读取sql脚本的内容�ƈ解析成相关的sql语句通过java的jdbc执行sql语句。那��开始做吧。不多说�Q�上代码�Q?br />

  1 package com.infopatent.juangetljc.core;
  2
  3 import java.io.BufferedReader;
  4 import java.io.FileInputStream;
  5 import java.io.InputStream;
  6 import java.sql.Connection;
  7 import java.sql.DriverManager;
  8 import java.sql.SQLException;
  9 import java.sql.Statement;
10 import java.util.ArrayList;
11 import java.util.Arrays;
12 import java.util.List;
13
14 import org.junit.Test;
15
16 import junit.framework.TestCase;
17
18 public class InitDataTest extends TestCase {
19
20     private String url = "jdbc:mysql://localhost:3306/test?useUnicode=true&characterEncoding=UTF-8";
21     private String driver = "com.mysql.jdbc.Driver";
22     private String userName = "root";
23     private String password = "";
24     String filePathIn = "F://workspace/juange-tljc/juange-tljc-core/src/test/java/basedata.sql";
25
26     @Test
27     public void test() {
28
29         try {
30             execute(filePathIn);
31         } catch (Exception e) {
32             // TODO Auto-generated catch block
33             e.printStackTrace();
34         }
35     }
36
37     /*
38      * ��d��sql文�g,获取sql语句
39      * �q�回所有sql语句的list集合
40      * */
41     private List<String> loadSql(String sqlFile) throws Exception {
42         List<String> sqlList = new ArrayList<String>();
43         /*
44          * ��d��文�g的内容�ƈ写道StringBuffer中去
45          * */
46         InputStream sqlFileIn = new FileInputStream(sqlFile);
47         StringBuffer sqlSb = new StringBuffer();
48         byte[] buff = new byte[sqlFileIn.available()];
49         int byteRead = 0;
50         while((byteRead = sqlFileIn.read(buff)) != -1) {
51             sqlSb.append(new String(buff, 0, byteRead));
52         }
53         /*
54          * windows下换行是/r/n�Q�Linux下是/n�Q?br /> 55          * 此处需要根据导出的sql文�g�q�行具体的处理，我在处理的时�?br /> 56          * 也遇��C��很多的问题，如果我这个不行可以在�|�上找找别的解析�Ҏ(gu��)��
57          * */
58         String sqlArr[] = sqlSb.toString().split("(;\\s*\\rr\\n)|(;\\s*\\n)");
59         for(int i = 0; i<sqlArr.length; i++) {
60             String sql = sqlArr[i].replaceAll("--.*", "").trim();
61             if(!"".equals(sql)) {
62                 sqlList.add(sql);
63             }
64         }
65         return sqlList;
66
67     }
68
69     /*
70      * 传入文�g执行sql语句
71      *
72      * */
73     private void execute(String sqlFile) throws SQLException {
74         Statement stmt = null;
75         List<String> sqlList = new ArrayList<String>();
76         Connection conn = getConnection();
77         try {
78             sqlList = loadSql(sqlFile);
79             conn.setAutoCommit(false);
80             stmt = conn.createStatement();
81             for (String sql : sqlList) {
82                 System.out.println(sql);
83                 stmt.addBatch(sql);
84             }
85             int[] rows = stmt.executeBatch();
86             System.out.println("Row count:" + Arrays.toString(rows));
87             conn.commit();
88             System.out.println("数据更新成功");
89         } catch (Exception e) {
90             e.printStackTrace();
91             conn.rollback();
92         }finally{
93             stmt.close();
94             conn.close();
95         }
96
97     }
98
99     /*
100      * 获取sql�q�接
101      * */
102     private Connection getConnection(){
103         Connection conn = null;
104         try {
105             Class.forName(driver);
106             conn = DriverManager.getConnection(url, userName, password);
107             if(!conn.isClosed()) {
108                 System.out.println("数据库连接成�?");
109             }
110         } catch (Exception e) {
111             e.printStackTrace();
112         }
113         return conn;
114     }
115 }
116

在这个过�E�中遇到了很多的问题�Q�曾�l�一度��我陷入迷�p�状态中�Q�后来好好梳理了一下思�\�Q�一个一个的��L��查问题终于成功了~
首先在读取文件的时候，发现��d��的文件内�Ҏ(gu��)��C�是正常的不是�ؕ码，但是插入到数据库中就是�ؕ码，好吧�Q�我又遇��C��q�种问题�Q�我依次��查了我java文�g的编码，数据库的�~�码�Q�都讄��为utf-8�Q�url也加上编�?span style="color: #000000; ">"jdbc:mysql://localhost:3306/test?useUnicode=true&characterEncoding=UTF-8"�?/span>�l�果�q�是��q��Q�那��再看看mysql下的my.ini文�g中的�~�码讄��在[mysqld]节点下加上default-character-set=utf8�Q�如果没有就改�ؓutf8�Q�，�q�下�l�于不是��q��了。然后我开始maven clean install,��L��看数据库发现又出��C��q��的问题，真是折磨人啊�Q�我发现唯一不同的就是之前正常的插入数据是我在测试类下run as junit�Q�而现在用的是maven clean install�Q�刚接触maven完全不知道症�l�所在啊�Q�百度一下，发现maven构徏到特定的生命周期时候运行测试用例是依靠maven-surefire-plugin�q�个插�g的，而这个插件也需要指定字�W�集�~�码的，于是我在��目的pom.xml中加入了如下代码�Q�本来竟然没有！�Q�：

1 <build>
2         <plugins>
3             <plugin>
4                 <groupId>org.apache.maven.pluginsgroupId>
5                 <artifactId>maven-surefire-pluginartifactId>
6                 <version>2.7.2version>
7                 <configuration>
8                     <forkMode>onceforkMode>
9                     <argLine>-Dfile.encoding=UTF-8argLine>
10                     <systemProperties>
11                         <property>
12                                 <name>net.sourceforge.cobertura.datafilename>
13                                 <value>target/cobertura/cobertura.servalue>
14                         property>
15                     systemProperties>
16                 configuration>
17             plugin>
18         plugins>
19     build>

�q�个时候再去maven clean install,�l�于不�ؕ码了�Q�终于不��q��了！�׃��我四个小�Ӟ��长见识了�Q�此处记录自己遇到的问题以及如何解决�Q�希望对各位有帮助！

��h物_Amor 2014-07-29 15:07 发表评论