Java生成UUID

        UUID含义是通用唯一识别码 (Universally Unique Identifier),这 是一个软件建构的标准,也是被开源软件基金会 (Open Software Foundation, OSF) 的组织在分布式计算环境 (Distributed Computing Environment, DCE) 领域的一部份。UUID 的目的,是让分布式系统中的所有元素,都能有唯一的辨识资讯,而不需要透过中央控制端来做辨识资讯的指定。如此一来,每个人都可以建立不与其它人冲突的 UUID。在这样的情况下,就不需考虑数据库建立时的名称重复问题。目前最广泛应用的 UUID,即是微软的 Microsoft's Globally Unique Identifiers (GUIDs),而其他重要的应用,则有 Linux ext2/ext3 档案系统、LUKS 加密分割区、GNOME、KDE、Mac OS X 等等。

以下是具体生成UUID的例子:

import java.util.UUID;  

public class UUIDGenerator {  
    public UUIDGenerator() {  
    }  
  
    public static String getUUID() {
        UUID uuid = UUID.randomUUID();
        String str = uuid.toString();
        // 去掉"-"符号
        String temp = str.substring(0, 8) + str.substring(9, 13) + str.substring(14, 18) 
        		+ str.substring(19, 23) + str.substring(24);
        return str+","+temp;
    }
    //获得指定数量的UUID
    public static String[] getUUID(int number) {
        if (number < 1) {
            return null;
        }
        String[] ss = new String[number];
        for (int i = 0; i < number; i++) {
            ss[i] = getUUID();
        }
        return ss;
    }  
  
    public static void main(String[] args) {  
        String[] ss = getUUID(10);  
        for (int i = 0; i < ss.length; i++) {  
            System.out.println("ss["+i+"]====="+ss[i]);  
        }  
    }  
}

结果:
ss[0]=====f6d1836d-1e3e-4d77-ab7c-54e177e689e5,f6d1836d1e3e4d77ab7c54e177e689e5
ss[1]=====8f122f82-d5dd-41df-826f-c83aa82bf1d2,8f122f82d5dd41df826fc83aa82bf1d2
ss[2]=====f7544ca0-c229-497f-973d-08743c8b54df,f7544ca0c229497f973d08743c8b54df
ss[3]=====54fbda9b-bb7e-46d5-8d07-21d69efe9ad7,54fbda9bbb7e46d58d0721d69efe9ad7
ss[4]=====1fc0ea43-b4f4-4aeb-b863-80dceec4c7e6,1fc0ea43b4f44aebb86380dceec4c7e6
ss[5]=====0051eecf-0168-43b1-86b3-442688989288,0051eecf016843b186b3442688989288
ss[6]=====d80a7016-14de-4f65-98da-435a062bd538,d80a701614de4f6598da435a062bd538
ss[7]=====16918380-c94c-4fbe-90f6-b3dbe2f31000,16918380c94c4fbe90f6b3dbe2f31000
ss[8]=====3f9a0bc1-fe4d-48fd-9d6a-da82630f9fbf,3f9a0bc1fe4d48fd9d6ada82630f9fbf
ss[9]=====0afa93eb-a89a-47d2-9590-4d3f194febe9,0afa93eba89a47d295904d3f194febe9
        可以看出,UUID 是指在一台机器上生成的数字,它保证对在同一时空中的所有机器都是唯一的。通常平台会提供生成的API。按照开放软件基金会(OSF)制定的标准计算,用到了以太网卡地址、纳秒级时间、芯片ID码和许多可能的数字
  UUID由以下几部分的组合:
  (1)当前日期和时间,UUID的第一个部分与时间有关,如果你在生成一个UUID之后,过几秒又生成一个UUID,则第一个部分不同,其余相同。
  (2)时钟序列
  (3)全局唯一的IEEE机器识别号,如果有网卡,从网卡MAC地址获得,没有网卡以其他方式获得。
  UUID的唯一缺陷在于生成的结果串会比较长。关于UUID这个标准使用最普遍的是微软的GUID(Globals Unique Identifiers)。在ColdFusion中可以用CreateUUID()函数很简单的生成UUID,其格式为:xxxxxxxx-xxxx- xxxx-xxxxxxxxxxxxxxxx(8-4-4-16),其中每个 x 是 0-9 或 a-f 范围内的一个十六进制的数字。而标准的UUID格式为:xxxxxxxx-xxxx-xxxx-xxxxxx-xxxxxxxxxx (8-4-4-4-12),可以从cflib 下载CreateGUID() UDF进行转换。
  使用UUID的好处在分布式的软件系统中(比如:DCE/RPC, COM+,CORBA)就能体现出来,它能保证每个节点所生成的标识都不会重复,并且随着WEB服务等整合技术的发展,UUID的优势将更加明显。根据使用的特定机制,UUID不仅需要保证是彼此不相同的,或者最少也是与公元3400年之前其他任何生成的通用惟一标识符有非常大的区别。
  通用惟一标识符还可以用来指向大多数的可能的物体。微软和其他一些软件公司都倾向使用全球惟一标识符(GUID),这也是通用惟一标识符的一种类型,可用来指向组建对象模块对象和其他的软件组件。第一个通用惟一标识符是在网罗计算机系统(NCS)中创建,并且随后成为开放软件基金会(OSF)的分布式计算环境(DCE)的组件。

以上内容转载自:http://blog.csdn.net/carefree31441/article/details/3998553


uuid 长度处理

import java.io.FileWriter;
import java.io.IOException;
import java.util.HashMap;
import java.util.Map;
import java.util.UUID;

/**
 * @description: <br/>
 * @package test.AA.java
 * @author YangPu
 * @date 2016年11月3日 下午3:38:34
 */
public class AA {

    private static final String fileName = "D:/out.txt";

    private static final String[] chars = { // <br>
            "0", "1", "2", "3", "4", "5", "6", "7", "8", "9", // <br>
            "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", // <br>
            "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", // <br>
            "u", "v", "w", "x", "y", "z", "A", "B", "C", "D", // <br>
            "E", "F", "G", "H", "I", "J", "K", "L", "M", "N", // <br>
            "O", "P", "Q", "R", "S", "T", "U", "V", "W", "X", // <br>
            "Y", "Z", "a1", "a2" // <br>
    };

    // 统计UUID的长度变化范围
    public static void main(String[] args) throws InterruptedException {
        int time = 1 * 10000 * 1;
        for (int j = 0; j < 15; j++) {
            Map<Integer, Integer> sum = new HashMap<>();
            Map<String, Integer> sumStr = new HashMap<>();
            for (int ii = 0; ii < time; ii++) {
                String uuid = uuid(j);
                int sbLength = uuid.length();
                String sb = uuid.substring(0, 1);
                if (sum.get(Integer.valueOf(sbLength)) != null) {
                    int v = sum.get(Integer.valueOf(sbLength)).intValue();
                    v++;
                    sum.put(Integer.valueOf(sbLength), v);
                } else {
                    sum.put(Integer.valueOf(sbLength), 1);
                }
                if (sumStr.get(sb) != null) {
                    int v = sumStr.get(sb).intValue();
                    v++;
                    sumStr.put(sb, v);
                } else {
                    sumStr.put(sb, 1);
                }
            }
            write("j:" + j);
            for (Integer in : sum.keySet()) {
                write(in + ":" + sum.get(in));
                // System.out.println(in + ":" + sum.get(in));
            }
        }
    }

    /**
     * @description: 生成UUID<br/>
     *               可以确定开头字母来区别业务<br/>
     *               num16:必须是0--15以内的数字<br/>
     *               @param:num16:<br/>
     *               00-->>"0", "1", "2", "3",<br/>
     *               01-->>"4", "5", "6", "7",<br/>
     *               02-->>"8", "9", "a", "b",<br/>
     *               03-->>"c", "d", "e", "f",<br/>
     *               04-->>"g", "h", "i", "j",<br/>
     *               05-->>"k", "l", "m", "n",<br/>
     *               06-->>"o", "p", "q", "r",<br/>
     *               07-->>"s", "t", "u", "v",<br/>
     *               08-->>"w", "x", "y", "z",<br/>
     *               09-->>"A", "B", "C", "D",<br/>
     *               10-->>"E", "F", "G", "H",<br/>
     *               11-->>"I", "J", "K", "L",<br/>
     *               12-->>"M", "N", "O", "P",<br/>
     *               13-->>"Q", "R", "S", "T",<br/>
     *               14-->>"U", "V", "W", "X",<br/>
     */
    public static String uuid(int num16) {
        if (num16 < 0 || num16 > 15) {
            num16 = 0;
        }
        StringBuilder sb = new StringBuilder();
        String pre = Integer.toHexString(num16);
        String uid = pre + UUID.randomUUID().toString().replaceAll("-", "");
        int length = uid.length();
        // 将16进制数转换成64进制数
        // 2的4次方转化成2的6次方的数据
        // bcb da5 f41 172 4bc 28b 920 b1c 5f4 422 6e
        // 3位转2位
        int i = 0;
        for (; i < length; i = i + 3) {
            // 16进制数转化成10进制数
            int end = i + 3;
            if (end >= length) {
                end = length;
            }
            int t = Integer.parseInt(uid.substring(i, end), 16);
            // 10进制数转化成64进制数
            sb.append(chars[t / 64]);// 第一个数据
            sb.append(chars[t % 64]);// 第二个数据
        }
        // write(sb.toString().substring(0, 1) + "----" + sb.toString());
        write(sb);
        // System.out.println(sb);
        return sb.toString();
    }

    public static void write(Object out) {
        if (out == null) {
            return;
        }
        try {
            // 打开一个写文件器,构造函数中的第二个参数true表示以追加形式写文件
            FileWriter writer = new FileWriter(fileName, true);
            writer.write(out.toString() + "\n");
            writer.close();
        } catch (IOException e) {
            // TODO Auto-generated catch block
            e.printStackTrace();
        }
    }
}
运行代码会在D盘中生成out.txt文件,内容如下:
1XG6g0rfV5uo57vpNEvE4f
0hQXkufT9aXX00ZF0UcYqp
1zVt11eDhcaUa2QekcJEWdE
3C27deVa1h4cbTJPAXXIgBE
0fF4UvtpB4695fswmw68lg
2SvWeEOAp9WVcEpXWOuX8B
0U7eE1kyF7iqI0XP59iqxY
0hsS1rzP10jVa2RjSzo6g1d
2tSeCGCvB2ja1mAt0PjYjn
。。。。。。
以上内容来自:http://blog.csdn.net/want_water_fish/article/details/67638195


JAVA生成短8位UUID

短8位UUID思想其实借鉴微博短域名的生成方式,但是其重复概率过高,而且每次生成4个,需要随即选取一个。
本算法利用62个可打印字符,通过随机生成32位UUID,由于UUID都为十六进制,所以将UUID分成8组,每4个为一组,然后通过模62操作,结果作为索引取出字符,
这样重复率大大降低。

import java.util.UUID;

public class hui {
	public static String[] chars = new String[] { "a", "b", "c", "d", "e", "f",
        "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s",
        "t", "u", "v", "w", "x", "y", "z", "0", "1", "2", "3", "4", "5",
        "6", "7", "8", "9", "A", "B", "C", "D", "E", "F", "G", "H", "I",
        "J", "K", "L", "M", "N", "O", "P", "Q", "R", "S", "T", "U", "V",
        "W", "X", "Y", "Z" };


	public static String generateShortUuid() {
	StringBuffer shortBuffer = new StringBuffer();
	String uuid = UUID.randomUUID().toString().replace("-", "");
	for (int i = 0; i < 8; i++) {
		String str = uuid.substring(i * 4, i * 4 + 4);
		int x = Integer.parseInt(str, 16); //16进制字符串转10进制int型
		shortBuffer.append(chars[x % 0x3E]);
	}
	System.out.println(shortBuffer.toString());
	return shortBuffer.toString();
	}
	public static void main(String args[]){
		generateShortUuid();
	}
}
运行这个代码会随机生成一个8位的UUID,如我的运行结果为:cgsnjhN9


以上内容来自http://www.oschina.net/code/snippet_1431757_50945,在评论区有人编写了测试重复率有多大的代码,感觉不错就粘贴了下来:

import java.util.HashSet;
import java.util.Set;
import java.util.UUID;

public class SerialNo {

	public static String[] chars = new String[] { "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m",
		"n", "o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z", "0", "1", "2", "3", "4", "5", "6", "7",
		"8", "9", "A", "B", "C", "D", "E", "F", "G", "H", "I", "J", "K", "L", "M", "N", "O", "P", "Q", "R", "S",
		"T", "U", "V", "W", "X", "Y", "Z" };

	public static String generateShortUuid() {
		StringBuffer shortBuffer = new StringBuffer();
		String uuid = UUID.randomUUID().toString().replace("-", "");
		for (int i = 0; i < 8; i++) {
			String str = uuid.substring(i * 4, i * 4 + 4);
			int x = Integer.parseInt(str, 16);
			shortBuffer.append(chars[x % 0x3E]);
		}
		return shortBuffer.toString();
	}

	/**
	 * @title main
	 * @date 2015-10-14 下午3:05:17
	 * @since 2015-10-14
	 * @version v1.0.0
	 * @param args
	 * @throws InterruptedException 
	 */
	public static void main(String[] args) throws InterruptedException {
		final int num = 1000000; // 1,000,000
		final Set<String> rs_set = new HashSet<String>();

		new Thread(new Runnable() { 
			@Override
			public void run() {
				Set<String> set = new HashSet<String>();
				for (int i = 0; i < num; i++) {
					set.add(SerialNo.generateShortUuid());
				}
				System.out.println(Thread.currentThread().getName() + "Rs_Count:" + set.size() 
						+ " &Repeated Count:" + (num - set.size()));
				rs_set.addAll(set);
			}
		}).start();
		new Thread(new Runnable() { 
			@Override
			public void run() {
				Set<String> set = new HashSet<String>();
				for (int i = 0; i < num; i++) {
					set.add(SerialNo.generateShortUuid());
				}
				System.out.println(Thread.currentThread().getName() + "Rs_Count:" + set.size() 
						+ " &Repeated Count:" + (num - set.size()));
				rs_set.addAll(set);
			}
		}).start();
		new Thread(new Runnable() { 
			@Override
			public void run() {
				Set<String> set = new HashSet<String>();
				for (int i = 0; i < num; i++) {
					set.add(SerialNo.generateShortUuid());
				}
				System.out.println(Thread.currentThread().getName() + "Rs_Count:" + set.size() 
						+ " &Repeated Count:" + (num - set.size()));
				rs_set.addAll(set);
			}
		}).start();
		new Thread(new Runnable() { 
			@Override
			public void run() {
				Set<String> set = new HashSet<String>();
				for (int i = 0; i < num; i++) {
					set.add(SerialNo.generateShortUuid());
				}
				System.out.println(Thread.currentThread().getName() + "Rs_Count:" + set.size() 
						+ " &Repeated Count:" + (num - set.size()));
				rs_set.addAll(set);
			}
		}).start();

		Thread.sleep(1000 * 60 * 3);
		System.out.println("Final Release RS||" + "Rs_Count:" + rs_set.size() 
				+ " &Repeated Count:" + ((num * 4) - rs_set.size()));
	}
}

我的运行结果是(运行这个程序即使结果已经打出程序也没有退出,我感觉他的代码还有需要完善的地方,有时间再看看吧):

Thread-1Rs_Count:1000000 &Repeated Count:0
Thread-2Rs_Count:1000000 &Repeated Count:0
Thread-0Rs_Count:1000000 &Repeated Count:0
Thread-3Rs_Count:1000000 &Repeated Count:0
Final Release RS||Rs_Count:276429 &Repeated Count:3723571

  • 0
    点赞
  • 3
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值