简体繁体 English

如何生成每个种子字符串都相同的uuid？

[英]How to generate uuid which will be the same for each seed string?

原文 2015-03-14 14:39:20 5 1 algorithm/ uuid/ boost-uuid

I am wondering how to get the same uuid by using the same seed string. 我想知道如何通过使用相同的种子字符串来获得相同的uuid。 Any idea? 任何想法？

1 个解决方案

I'm not familiar with boost-uuid, but I think that what you need is a name-based UUID generator (see RFC-4122 Section 4.3 ). 我不熟悉boost-uuid，但我认为您需要的是基于名称的UUID生成器（请参阅RFC-4122第4.3节）。 Read that section of the RFC to ensure it fits your requirements. 阅读RFC的那一部分，以确保它符合您的要求。

Googling a bit, I found that boost does support name-based UUIDs : 仔细搜索一下，我发现boost确实支持基于名称的UUID ：

用种子产生相同的迷宫 - Generate the same maze with a seed

为唯一的字符串种子生成唯一的 Long - generate unique Long for unique String seed

如何检查数组中哪个字符串是最长的，并且字符串的每个字母在 JavaScript 中都相同？ - How to check which string in an array is the longest one and each letter of the string is same in JavaScript?

如何从位于此字符串字符排列数量范围内的数字生成唯一字符串？ - How to generate unique string from number which lies in range of quantity of characters ' permutations in this string?

如何在C中解析十进制UUID字符串？ - How do I parse a decimal UUID string in C?

给定一个要拼接的索引数组，生成每个元素被移除的顺序 - Given an array of indicies to splice, generate the order in which each element was removed

如何为每个地址生成唯一编号？ - How to generate unique number for each address?

如何在每次调用函数时生成排列或 - how to generate permutation at each call of function or

给定一个字符串，如何生成所有可能的子字符串数组，其中每个子字符串最多包含N个字符，但不少于M个字符？ - Given a string, how to generate all possible arrays of substrings where each substring contains no more than N, but not less than M chars?

递归地生成字符串排列；每个字符出现n次 - Generate string permutations recursively; each character appears n times

暂无

暂无

声明:本站的技术帖子网页，遵循CC BY-SA 4.0协议，如果您需要转载，请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.

相关问题 用种子产生相同的迷宫 - Generate the same maze with a seed 为唯一的字符串种子生成唯一的 Long - generate unique Long for unique String seed 如何检查数组中哪个字符串是最长的，并且字符串的每个字母在 JavaScript 中都相同？ - How to check which string in an array is the longest one and each letter of the string is same in JavaScript? 如何从位于此字符串字符排列数量范围内的数字生成唯一字符串？ - How to generate unique string from number which lies in range of quantity of characters ' permutations in this string? 如何在C中解析十进制UUID字符串？ - How do I parse a decimal UUID string in C? 给定一个要拼接的索引数组，生成每个元素被移除的顺序 - Given an array of indicies to splice, generate the order in which each element was removed 如何为每个地址生成唯一编号？ - How to generate unique number for each address? 如何在每次调用函数时生成排列或 - how to generate permutation at each call of function or 给定一个字符串，如何生成所有可能的子字符串数组，其中每个子字符串最多包含N个字符，但不少于M个字符？ - Given a string, how to generate all possible arrays of substrings where each substring contains no more than N, but not less than M chars? 递归地生成字符串排列；每个字符出现n次 - Generate string permutations recursively; each character appears n times

相关标签

粤ICP备18138465号 © 2020-2024 STACKOOM.COM