首页 > 其他分享 >有序uuid

有序uuid

时间:2023-10-08 14:34:35浏览次数:35  
标签:return uuid int private static value 有序 String

代码如下

package com.example.demo.ThreadDemo;
import java.net.InetAddress;
import java.util.Map;


public class UUIDUtil {

    private static String sep = "";

    private static final int IP;

    private static String formatedIP = "";

    private static final int JVM = (int) ( System.currentTimeMillis() >>> 8 );

    private static String formatedJVM = "";

    private static short counter = (short) 0;

    static {
        int ipadd;
        try {
            ipadd = toInt( InetAddress.getLocalHost().getAddress() );
        }
        catch (Exception e) {
            ipadd = 0;
        }
        IP = ipadd;
        formatedIP = format( getIP());
        formatedJVM = format( getJVM());
    }

    public static String getUUID() {
        return formatedIP + sep
                + formatedJVM + sep
                + format( getHiTime() ) + sep
                + format( getLoTime() ) + sep
                + format( getCount() );
    }

    private static String format(int intValue) {
        String formatted = Integer.toHexString( intValue );
        StringBuilder buf = new StringBuilder( "00000000" );
        buf.replace( 8 - formatted.length(), 8, formatted );
        return buf.toString();
    }

    private static String format(short shortValue) {
        String formatted = Integer.toHexString( shortValue );
        StringBuilder buf = new StringBuilder( "0000" );
        buf.replace( 4 - formatted.length(), 4, formatted );
        return buf.toString();
    }

    /**
     * Unique across JVMs on this machine (unless they load this class
     * in the same quater second - very unlikely)
     */
    private static int getJVM() {
        return JVM;
    }

    /**
     * Unique in a millisecond for this JVM instance (unless there
     * are > Short.MAX_VALUE instances created in a millisecond)
     */
    protected static short getCount() {
        synchronized(UUIDUtil.class) {
            if (counter<0) counter=0;
            return counter++;
        }
    }

    /**
     * Unique in a local network
     */
    private static int getIP() {
        return IP;
    }

    /**
     * Unique down to millisecond
     */
    private static short getHiTime() {
        return (short) ( System.currentTimeMillis() >>> 32 );
    }
    private static int getLoTime() {
        return (int) System.currentTimeMillis();
    }

    /**
     * Get the config value as a {@link String}
     *
     * @param name The config setting name.
     * @param values The map of config values
     *
     * @return The value, or null if not found
     */
    @SuppressWarnings("unused")
    private String getString(String name, Map<String, Object> values) {
        Object value = values.get( name );
        if ( value == null ) {
            return null;
        }
        if ( String.class.isInstance( value ) ) {
            return (String) value;
        }
        return value.toString();
    }

    /**
     * Custom algorithm used to generate an int from a series of bytes.
     * <p/>
     * NOTE : this is different than interpreting the incoming bytes as an int value!
     *
     * @param bytes The bytes to use in generating the int.
     *
     * @return The generated int.
     */
    private static int toInt(byte[] bytes) {
        int result = 0;
        for ( int i = 0; i < 4; i++ ) {
            result = ( result << 8 ) - Byte.MIN_VALUE + (int) bytes[i];
        }
        return result;
    }

    public static void main(String[] args) {
        System.err.println("1:=======" + UUIDUtil.getUUID() +"======"+ UUIDUtil.getUUID().length());
    }

}

 

 

虽然摘抄来自网上,但是还是总结下:前八位是ip的十六进制格式化的16进制,缺位补0,

                 第二个八位是时间戳右移八位的16进制,缺位补0

                 然后4位是时间戳无符号右移32位的16进制,缺位补0

                 第三个八位是时间戳取int最大值的16进制,缺位补0

                 最后4位是有锁本地count 其实可以用    AutmicInteger               

 

标签:return,uuid,int,private,static,value,有序,String
From: https://www.cnblogs.com/senjiang/p/17748974.html

相关文章

  • JDK 21新特性---有序集合
    概述在JDK21中,正式加入了序列集合的功能,新增了SequencedCollection,SequencedSet,SequencedMap接口,使得Java中的有序集合类可以按照统一的方法来进行集合的操作。架构图:三大接口SequencedCollectioninterfaceSequencedCollection<E>extendsCollection<E>{......
  • LeetCode 26 删除有序数组中的重复项
    LeetCode26删除有序数组中的重复项1.题目地址https://leetcode.cn/problems/remove-duplicates-from-sorted-array/description/?envType=study-plan-v2&envId=top-interview-1502.题解这道题由于要删除的是重复出现的元素,并且给定数组是单调递增的。那么我们......
  • LeetCode 88 合并两个有序数组
    LeetCode88合并两个有序数组1.题目地址https://leetcode.cn/problems/merge-sorted-array/description/?envType=study-plan-v2&envId=top-interview-1502.题解这道题跟归并排序的归并操作非常类似。(具体内容可以查看我的博客,这里不再赘述。)但是有一个需要注意......
  • c/c++获取uuid
    c/c++标准库中没有自带的uuid工具函数/类,可以使用三方库libuuid,boost,或者手工实现,如下:[zjh@hs-10-20-xxxlib]$sudoyuminstalllibuuid-devel[sudo]passwordforzjh:Loadedplugins:fastestmirror,langpacksLoadingmirrorspeedsfromcachedhostfilebase......
  • 向有序数组插入数据,数组依然是有序的
    数组降序的情况下插入数据依然是降序第1次推导publicclasstest{publicstaticvoidmain(String[]args){int[]ints={90,80,70};inttmp=85;//与第1个数比较时//[0][1][2][]if(tmp>ints[0]){/......
  • [LeetCode] 2251. 花期内花的数目 - 二分查找/有序数组
    Problem:2251.花期内花的数目思路看题目应该是一道比较经典的差分,本来准备拿差分数组做的,后来搂了一眼题解,发现用二分的方法更简单解题方法此题有一种很简便的方法,第i个人到达时间为people[i],所以我们不难找到在这个时间之前花期已经开始的花的数量,即v1=start<=people[i]......
  • uuid
    title:UUID简介tags:UUIDcategories:干垃圾keywords:UUIDdescription:UUID简介top:repost:hot:others:date:2020-01-2210:11:15{%notesuccessno-icon%}UUID简介(PHP为例)介绍名称:UniversallyUniqueIdentifier(通用唯一标识符)简介UUID是一串全球......
  • C语言双指针法解决-有序数组的平方
     力扣(LeetCode)官网-全球极客挚爱的技术成长平台/***Note:Thereturnedarraymustbemalloced,assumecallercallsfree().*/intcmp(constvoid*a,constvoid*b){return(*(int*)a)-(*(int*)b);}int*sortedSquares(int*nums,intnumsSize,......
  • leetcode21. 合并两个有序链表
    合并两个有序链表题目链接21.合并两个有序链表将两个升序链表合并为一个新的升序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。示例1:输入:l1=[1,2,4],l2=[1,3,4]输出:[1,1,2,3,4,4]示例2:输入:l1=[],l2=[]输出:[]示例3:输入:l1=[],l2=[0]输出:[0......
  • Leetcode刷题21.合并两个有序链表
    将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。  示例1:输入:l1=[1,2,4],l2=[1,3,4]输出:[1,1,2,3,4,4]示例2:输入:l1=[],l2=[]输出:[]示例3:输入:l1=[],l2=[0]输出:[0] 提示:两个链表的节点数目......