package com.jszc.lottery.common.utils;
import java.text.SimpleDateFormat;
import java.util.Date;
/**
*
* 订单号生成工具,生成非重复订单号,理论上限1毫秒1000个,可扩展
*
*/
public class MakeOrderNumUtil {
/**
* 锁对象,可以为任意对象
*/
private static Object lockObj = "lockerOrder";
/**
* 订单号生成计数器
*/
private static long orderNumCount = 0L;
/**
* 每毫秒生成订单号数量最大值
*/
private int maxPerMSECSize = 1000;
/**
* 生成非重复订单号,理论上限1毫秒1000个
*/
public String makeOrderNum() {
// 最终生成的订单号
String finOrderNum = "";
synchronized (lockObj) {
// 取系统当前时间作为订单号变量前半部分,精确到毫秒
String nowDate = new SimpleDateFormat("HHmmssSSS").format(new Date());
// 计数器到最大值归零,可扩展更大,目前1毫秒处理峰值1000个,1秒100万
if (orderNumCount > maxPerMSECSize) {
orderNumCount = 0L;
}
// 组装订单号
String countStr = maxPerMSECSize + orderNumCount + "";
finOrderNum = nowDate + countStr.substring(1);
orderNumCount++;
}
return finOrderNum;
}
public static void main(String[] args) {
// 测试多线程调用订单号生成工具
try {
for (int i = 0; i < 200; i++) {
Thread t1 = new Thread(new Runnable() {
public void run() {
MakeOrderNumUtil makeOrder = new MakeOrderNumUtil();
String finOrderNum = makeOrder.makeOrderNum();
System.out.println(finOrderNum+"zss");
}
}, "at" + i);
t1.start();
Thread t2 = new Thread(new Runnable() {
public void run() {
MakeOrderNumUtil makeOrder = new MakeOrderNumUtil();
String finOrderNum = makeOrder.makeOrderNum();
System.out.println(finOrderNum+"zss" );
}
}, "bt" + i);
t2.start();
}
} catch (Exception e) {
e.printStackTrace();
}
}
}
生成订单号
猜你喜欢
转载自blog.csdn.net/zhengsaisai/article/details/80282601
今日推荐
周排行