java uuid 19位_nutz中有没有生成19位长度的uuid

本文介绍了一个用于生成短UUID的Java类。该类通过特定算法将标准UUID缩短为更易管理和存储的形式,适用于资源受限的环境。文章展示了如何使用这个类来生成短UUID,并验证其唯一性。

package com.my.util;

import java.io.PrintStream;

import java.util.HashMap;

import java.util.HashSet;

import java.util.Map;

import java.util.Set;

import java.util.UUID;

public class ShortUUID

{

static final char[] jdField_a_of_type_ArrayOfChar = { '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', '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' };

static final Map jdField_a_of_type_JavaUtilMap = new HashMap();

private static final int jdField_a_of_type_Int = jdField_a_of_type_ArrayOfChar.length;

public static void main(String[] paramArrayOfString)

{

long l = 0L;

HashSet localHashSet = new HashSet();

for (;;)

{

l += 1L;

System.out.println(l);

String str = generate();

if (localHashSet.contains(str))

{

System.out.println(": " + str);

break;

}

localHashSet.add(str);

}

}

private static String a(long paramLong, int paramInt)

{

if ((paramInt < 2) || (paramInt > jdField_a_of_type_Int)) {

paramInt = 10;

}

if (paramInt == 10) {

return Long.toString(paramLong);

}

int i = 64;

char[] arrayOfChar = new char[65];

int j = paramLong < 0L ? 1 : 0;

if (j == 0) {}

for (paramLong = -paramLong; paramLong <= -paramInt; paramLong /= paramInt) {

arrayOfChar[(i--)] = jdField_a_of_type_ArrayOfChar[((int)-(paramLong % paramInt))];

}

arrayOfChar[i] = jdField_a_of_type_ArrayOfChar[((int)-paramLong)];

if (j != 0) {

arrayOfChar[(--i)] = '-';

}

return new String(arrayOfChar, i, 65 - i);

}

private static String b(long paramLong, int paramInt)

{

long l = 1L << paramInt * 4;

return a(l | paramLong & l - 1L, jdField_a_of_type_Int).substring(1);

}

public static String generate()

{

UUID localUUID = UUID.randomUUID();

StringBuilder localStringBuilder = new StringBuilder();

localStringBuilder.append(b(localUUID.getMostSignificantBits() >> 32, 8));

localStringBuilder.append(b(localUUID.getMostSignificantBits() >> 16, 4));

localStringBuilder.append(b(localUUID.getMostSignificantBits(), 4));

localStringBuilder.append(b(localUUID.getLeastSignificantBits() >> 48, 4));

localStringBuilder.append(b(localUUID.getLeastSignificantBits(), 12));

return localStringBuilder.toString();

}

static

{

for (int i = 0; i < jdField_a_of_type_ArrayOfChar.length; i++) {

jdField_a_of_type_JavaUtilMap.put(Character.valueOf(jdField_a_of_type_ArrayOfChar[i]), Integer.valueOf(i));

}

}

}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值