├── .github └── workflows │ ├── lint.yml │ └── tests.yml ├── .gitignore ├── .golangci.yml ├── LICENSE ├── Makefile ├── README.md ├── go.mod ├── go.sum ├── img ├── benchmark-21.png ├── benchmark-255.png ├── benchmark-36.png └── benchmark-8.png ├── nanoid.go └── nanoid_test.go /.github/workflows/lint.yml: -------------------------------------------------------------------------------- 1 | name: lint 2 | on: 3 | push: 4 | tags: 5 | - v* 6 | branches: 7 | - master 8 | - main 9 | pull_request: 10 | permissions: 11 | contents: read 12 | # Optional: allow read access to pull request. Use with `only-new-issues` option. 13 | # pull-requests: read 14 | jobs: 15 | golangci: 16 | name: lint 17 | runs-on: ubuntu-latest 18 | steps: 19 | - uses: actions/setup-go@v3 20 | with: 21 | go-version: 1.18.3 22 | - uses: actions/checkout@v3 23 | - name: golangci-lint 24 | uses: golangci/golangci-lint-action@v3 25 | with: 26 | # Optional: version of golangci-lint to use in form of v1.2 or v1.2.3 or `latest` to use the latest version 27 | version: latest 28 | 29 | # Optional: working directory, useful for monorepos 30 | # working-directory: somedir 31 | 32 | # Optional: golangci-lint command line arguments. 33 | # args: --issues-exit-code=0 34 | 35 | # Optional: show only new issues if it's a pull request. The default value is `false`. 36 | # only-new-issues: true 37 | 38 | # Optional: if set to true then the all caching functionality will be complete disabled, 39 | # takes precedence over all other caching options. 40 | # skip-cache: true 41 | 42 | # Optional: if set to true then the action don't cache or restore ~/go/pkg. 43 | # skip-pkg-cache: true 44 | 45 | # Optional: if set to true then the action don't cache or restore ~/.cache/go-build. 46 | # skip-build-cache: true -------------------------------------------------------------------------------- /.github/workflows/tests.yml: -------------------------------------------------------------------------------- 1 | name: tests 2 | on: [push] 3 | jobs: 4 | test: 5 | name: test 6 | runs-on: ubuntu-latest 7 | steps: 8 | - uses: actions/setup-go@v2 9 | with: 10 | go-version: 1.22.3 11 | - uses: actions/checkout@v2 12 | - name: test 13 | run: make test -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | .vscode 2 | *.prof 3 | *.test.exe -------------------------------------------------------------------------------- /.golangci.yml: -------------------------------------------------------------------------------- 1 | issues: 2 | exclude: 3 | - "value of `crand.Read` is not checked" -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /Makefile: -------------------------------------------------------------------------------- 1 | init: # Download (testing) dependencies 2 | go mod download 3 | 4 | test: init # Run tests 5 | go test -v -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # **go-nanoid** 2 | 3 | [![Build Status](https://github.com/jaevor/go-nanoid/workflows/tests/badge.svg)](https://github.com/jaevor/go-nanoid/actions) 4 | [![Build Status](https://github.com/jaevor/go-nanoid/workflows/lint/badge.svg)](https://github.com/jaevor/go-nanoid/actions) 5 | [![GitHub Issues](https://img.shields.io/github/issues/jaevor/go-nanoid.svg)](https://github.com/jaevor/go-nanoid/issues) 6 | [![Go Version](https://img.shields.io/github/go-mod/go-version/jaevor/go-nanoid?label=Go)](https://github.com/jaevor/go-nanoid/blob/master/go.mod) 7 | [![Go Ref](https://pkg.go.dev/badge/github.com/jaevor/go-nanoid)](https://pkg.go.dev/github.com/jaevor/go-nanoid) 8 | 9 | [This module](https://pkg.go.dev/github.com/jaevor/go-nanoid) is a Go 10 | implementation of [ai/nanoid](https://github.com/ai/nanoid). 11 | 12 | ``` 13 | go get github.com/jaevor/go-nanoid 14 | ``` 15 | 16 | ```go 17 | import ( 18 | "log" 19 | "github.com/jaevor/go-nanoid" 20 | ) 21 | 22 | func main() { 23 | gen, err := nanoid.Canonic() 24 | if err != nil { 25 | panic(err) 26 | } 27 | 28 | id1 := gen() 29 | log.Printf("ID 1: %s", id1) // eLySUP3NTA48paA9mLK3V 30 | 31 | // Makes sense to use CustomASCII since 0-9 is ASCII. 32 | decenaryID, err := nanoid.CustomASCII("0123456789", 12) 33 | if err != nil { 34 | panic(err) 35 | } 36 | 37 | id2 := decenaryID() 38 | log.Printf("ID 2: %s", id2) // 817411560404 39 | } 40 | ``` 41 | 42 | # Note 43 | 44 | This module's functions use an internal buffered slice of random bytes, and thus 45 | also a mutex. This slight (but constant) overhead of memory per generator allows 46 | it to be very efficient, but may not be ideal if you are only generating an ID 47 | every now and then. 48 | 49 | # Security 50 | 51 | - [Comparison of Nano ID and UUID (V4)](https://github.com/ai/nanoid/blob/main/README.md#comparison-with-uuid) 52 | - [NanoID collision calculator](https://zelark.github.io/nano-id-cc/) 53 | - [More](https://github.com/ai/nanoid/blob/main/README.md) 54 | 55 | ## Benchmarks 56 | 57 | All benchmarks & tests are in [nanoid_test.go](./nanoid_test.go). 58 | 59 | These are all benchmarks of `nanoid.Standard(#)` 60 | 61 | | # of characters & # of IDs | benchmark screenshot | 62 | | -------------------------- | --------------------------------- | 63 | | 8, ~21,800,000 | | 64 | | 21, ~16,400,000 | | 65 | | 36, ~11,500,000 | | 66 | | 255, ~2,500,000 | | 67 | 68 | ## Credits & references 69 | 70 | - [Original reference](https://github.com/ai/nanoid) 71 | - [Older Go implementation of NanoID](https://github.com/matoous/go-nanoid) 72 | 73 | ## License 74 | 75 | [GNU General Public License v3.0](./LICENSE) 76 | -------------------------------------------------------------------------------- /go.mod: -------------------------------------------------------------------------------- 1 | module github.com/jaevor/go-nanoid 2 | 3 | go 1.22 4 | 5 | require github.com/stretchr/testify v1.2.2 6 | 7 | require ( 8 | github.com/davecgh/go-spew v1.1.1 // indirect 9 | github.com/pmezard/go-difflib v1.0.0 // indirect 10 | ) 11 | -------------------------------------------------------------------------------- /go.sum: -------------------------------------------------------------------------------- 1 | github.com/davecgh/go-spew v1.1.1 h1:vj9j/u1bqnvCEfJOwUhtlOARqs3+rkHYY13jYWTU97c= 2 | github.com/davecgh/go-spew v1.1.1/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38= 3 | github.com/pmezard/go-difflib v1.0.0 h1:4DBwDE0NGyQoBHbLQYPwSUPoCMWR5BEzIk/f1lZbAQM= 4 | github.com/pmezard/go-difflib v1.0.0/go.mod h1:iKH77koFhYxTK1pcRnkKkqfTogsbg7gZNVY4sRDYZ/4= 5 | github.com/stretchr/testify v1.2.2 h1:bSDNvY7ZPG5RlJ8otE/7V6gMiyenm9RtJ7IUVIAoJ1w= 6 | github.com/stretchr/testify v1.2.2/go.mod h1:a8OnRcib4nhh0OaRAV+Yts87kKdq0PP7pXfy6kDkUVs= 7 | -------------------------------------------------------------------------------- /img/benchmark-21.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/jaevor/go-nanoid/46eb13dd85ad615abca4eabdd4c31878bf6d04b6/img/benchmark-21.png -------------------------------------------------------------------------------- /img/benchmark-255.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/jaevor/go-nanoid/46eb13dd85ad615abca4eabdd4c31878bf6d04b6/img/benchmark-255.png -------------------------------------------------------------------------------- /img/benchmark-36.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/jaevor/go-nanoid/46eb13dd85ad615abca4eabdd4c31878bf6d04b6/img/benchmark-36.png -------------------------------------------------------------------------------- /img/benchmark-8.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/jaevor/go-nanoid/46eb13dd85ad615abca4eabdd4c31878bf6d04b6/img/benchmark-8.png -------------------------------------------------------------------------------- /nanoid.go: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright 2024 jaevor. 3 | License can be found in the LICENSE file. 4 | 5 | Original reference: https://github.com/ai/nanoid 6 | */ 7 | 8 | package nanoid 9 | 10 | import ( 11 | crand "crypto/rand" 12 | "errors" 13 | "math/bits" 14 | "sync" 15 | "unicode" 16 | ) 17 | 18 | type generator = func() string 19 | 20 | // `A-Za-z0-9_-`. 21 | var standardAlphabet = [64]byte{ 22 | 'A', 'B', 'C', 'D', 'E', 23 | 'F', 'G', 'H', 'I', 'J', 24 | 'K', 'L', 'M', 'N', 'O', 25 | 'P', 'Q', 'R', 'S', 'T', 26 | 'U', 'V', 'W', 'X', 'Y', 27 | 'Z', 'a', 'b', 'c', 'd', 28 | 'e', 'f', 'g', 'h', 'i', 29 | 'j', 'k', 'l', 'm', 'n', 30 | 'o', 'p', 'q', 'r', 's', 31 | 't', 'u', 'v', 'w', 'x', 32 | 'y', 'z', '0', '1', '2', 33 | '3', '4', '5', '6', '7', 34 | '8', '9', '-', '_', 35 | } 36 | 37 | /* 38 | Returns a mutexed buffered NanoID generator. 39 | 40 | Errors if length is not within 2-255 (incl). 41 | */ 42 | func Standard(length int) (generator, error) { 43 | if invalidLength(length) { 44 | return nil, ErrInvalidLength 45 | } 46 | 47 | // Multiplying to increase the 'buffer' so that .Read() 48 | // has to be called less which is more efficient in the 49 | // longrun but requires more memory. 50 | size := length * length * 7 51 | // b holds the random crypto bytes. 52 | b := make([]byte, size) 53 | crand.Read(b) 54 | 55 | offset := 0 56 | 57 | // The standard alphabet is ASCII which goes up to 128 so we use bytes instead of runes. 58 | id := make([]byte, length) 59 | 60 | var mu sync.Mutex 61 | 62 | return func() string { 63 | mu.Lock() 64 | defer mu.Unlock() 65 | 66 | // Refill if all the bytes have been used. 67 | if offset == size { 68 | crand.Read(b) 69 | offset = 0 70 | } 71 | 72 | for i := 0; i < length; i++ { 73 | /* 74 | "It is incorrect to use bytes exceeding the alphabet size. 75 | The following mask reduces the random byte in the 0-255 value 76 | range to the 0-63 value range. Therefore, adding hacks such 77 | as empty string fallback or magic numbers is unneccessary because 78 | the bitmask trims bytes down to the alphabet size (64)." 79 | */ 80 | id[i] = standardAlphabet[b[i+offset]&63] 81 | } 82 | 83 | offset += length 84 | 85 | return string(id) 86 | }, nil 87 | } 88 | 89 | /* 90 | Returns a standard NanoID generator with canonic length (21) 91 | 92 | i.e., nanoid.Standard(21) 93 | */ 94 | func Canonic() (generator, error) { 95 | return Standard(21) 96 | } 97 | 98 | /* 99 | Deprecated; use nanoid.CustomUnicode. 100 | */ 101 | func Custom(alphabet string, length int) (generator, error) { 102 | return CustomUnicode(alphabet, length) 103 | } 104 | 105 | /* 106 | Returns a mutexed buffered NanoID generator which uses a custom alphabet that can contain non-ASCII (unicode). 107 | 108 | Uses more memory by supporting unicode. 109 | For ASCII-only, use nanoid.CustomASCII. 110 | 111 | Errors if length is within 2-255 (incl). 112 | */ 113 | func CustomUnicode(alphabet string, length int) (generator, error) { 114 | if invalidLength(length) { 115 | return nil, ErrInvalidLength 116 | } 117 | 118 | alphabetLen := len(alphabet) 119 | // Runes to support unicode. 120 | runes := []rune(alphabet) 121 | 122 | // Because the custom alphabet is not guaranteed to have 123 | // 64 chars to utilise, we have to calculate a suitable mask. 124 | x := uint32(alphabetLen) - 1 125 | clz := bits.LeadingZeros32(x | 1) 126 | mask := (2 << (31 - clz)) - 1 127 | step := (length / 5) * 8 128 | 129 | b := make([]byte, step) 130 | id := make([]rune, length) 131 | 132 | j, idx := 0, 0 133 | 134 | var mu sync.Mutex 135 | 136 | return func() string { 137 | mu.Lock() 138 | defer mu.Unlock() 139 | 140 | for { 141 | crand.Read(b) 142 | for i := 0; i < step; i++ { 143 | idx = int(b[i]) & mask 144 | if idx < alphabetLen { 145 | id[j] = runes[idx] 146 | j++ 147 | if j == length { 148 | j = 0 149 | return string(id) 150 | } 151 | } 152 | } 153 | } 154 | }, nil 155 | } 156 | 157 | // MustCustomASCII is a wrapper around CustomASCII but panics if any initialization error occurs. 158 | func MustCustomASCII(alphabet string, length int) generator { 159 | g, err := CustomASCII(alphabet, length) 160 | if err != nil { 161 | panic(err.Error()) 162 | } 163 | return g 164 | } 165 | 166 | /* 167 | Returns a Nano ID generator which uses a custom ASCII alphabet. 168 | 169 | Uses less memory than CustomUnicode by only supporting ASCII. 170 | For unicode support use nanoid.CustomUnicode. 171 | 172 | Errors if alphabet is not valid ASCII or if length is not within 2-255 (incl). 173 | */ 174 | func CustomASCII(alphabet string, length int) (generator, error) { 175 | if invalidLength(length) { 176 | return nil, ErrInvalidLength 177 | } 178 | 179 | alphabetLen := len(alphabet) 180 | 181 | for i := 0; i < alphabetLen; i++ { 182 | if alphabet[i] > unicode.MaxASCII { 183 | return nil, errors.New("not valid ascii") 184 | } 185 | } 186 | 187 | ab := []byte(alphabet) 188 | 189 | x := uint32(alphabetLen) - 1 190 | clz := bits.LeadingZeros32(x | 1) 191 | mask := (2 << (31 - clz)) - 1 192 | step := (length / 5) * 8 193 | 194 | b := make([]byte, step) 195 | id := make([]byte, length) 196 | 197 | j, idx := 0, 0 198 | 199 | var mu sync.Mutex 200 | 201 | return func() string { 202 | mu.Lock() 203 | defer mu.Unlock() 204 | 205 | for { 206 | crand.Read(b) 207 | for i := 0; i < step; i++ { 208 | idx = int(b[i]) & mask 209 | if idx < alphabetLen { 210 | id[j] = ab[idx] 211 | j++ 212 | if j == length { 213 | j = 0 214 | return string(id) 215 | } 216 | } 217 | } 218 | } 219 | }, nil 220 | } 221 | 222 | /* 223 | Returns a mutexed buffered NanoID generator that uses an alphabet of subset ASCII characters 40-126 inclusive. 224 | 225 | Errors if length is not within 2-255 (incl). 226 | */ 227 | func ASCII(length int) (generator, error) { 228 | // NOTE: there is likely a more efficient approach possible, given that we know it must be clamped to 40..126. 229 | return CustomASCII("()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~", length) 230 | } 231 | 232 | var ErrInvalidLength = errors.New("nanoid: length for ID is invalid (must be within 2-255)") 233 | 234 | func invalidLength(length int) bool { 235 | return length < 2 || length > 255 236 | } 237 | -------------------------------------------------------------------------------- /nanoid_test.go: -------------------------------------------------------------------------------- 1 | // Tests & benchmarks 2 | package nanoid_test 3 | 4 | import ( 5 | "testing" 6 | 7 | "github.com/jaevor/go-nanoid" 8 | "github.com/stretchr/testify/assert" 9 | "github.com/stretchr/testify/require" 10 | ) 11 | 12 | func TestStandard(t *testing.T) { 13 | t.Run("general", func(t *testing.T) { 14 | f, err := nanoid.Standard(21) 15 | assert.NoError(t, err, "should be no error") 16 | id := f() 17 | assert.Len(t, id, 21, "should return the same length as the ID specified length") 18 | t.Log(id) 19 | }) 20 | 21 | t.Run("negative ID length", func(t *testing.T) { 22 | _, err := nanoid.Standard(-1) 23 | assert.Error(t, err, "should error if passed ID length is negative") 24 | }) 25 | 26 | t.Run("invalid length (256)", func(t *testing.T) { 27 | _, err := nanoid.Standard(256) 28 | assert.Error(t, err, "should error if length > 255") 29 | }) 30 | 31 | t.Run("invalid length (1)", func(t *testing.T) { 32 | _, err := nanoid.Standard(1) 33 | assert.Error(t, err, "should error if length < 2") 34 | }) 35 | } 36 | 37 | func TestCustom(t *testing.T) { 38 | t.Run("general", func(t *testing.T) { 39 | f, err := nanoid.CustomASCII("abcdef", 21) 40 | assert.NoError(t, err, "should be no error") 41 | id := f() 42 | assert.Len(t, id, 21, "should return the same length as the ID specified length") 43 | t.Log(id) 44 | }) 45 | } 46 | 47 | func TestFlatDistribution(t *testing.T) { 48 | tries := 1_000_000 49 | 50 | t.Run("(flat dist) custom ascii (decenary)", func(t *testing.T) { 51 | set := "0123456789" 52 | length := len(set) // 10 53 | hits := make(map[rune]int) 54 | 55 | f, err := nanoid.CustomASCII(set, length) 56 | if err != nil { 57 | panic(err) 58 | } 59 | 60 | for range tries { 61 | id := f() 62 | for _, r := range id { 63 | hits[r]++ 64 | } 65 | } 66 | 67 | for _, count := range hits { 68 | require.InEpsilon(t, tries, count, 0.01, "should have flat distribution") 69 | } 70 | }) 71 | 72 | t.Run("(flat dist) ascii (40-126)", func(t *testing.T) { 73 | length := 86 // 126 - 40 = 86 74 | hits := make(map[rune]int) 75 | 76 | f, err := nanoid.ASCII(length) 77 | if err != nil { 78 | panic(err) 79 | } 80 | 81 | for range tries { 82 | id := f() 83 | for _, r := range id { 84 | hits[r]++ 85 | } 86 | } 87 | 88 | for _, count := range hits { 89 | // NOTE: this thing is reaching actuals of like 0.010882, 0.014744, 0.010944, sometimes up to 0.125. 90 | // so I don't know what the deal is; it is getting very close to 0.01, so I 91 | // have raised the requirement from 0.01 to 0.015 for this test. 92 | // That is an increase of 0.005. I am no statistician but this seems negligible. 93 | require.InEpsilon(t, tries, count, 0.015, "should have flat distribution") 94 | } 95 | }) 96 | } 97 | 98 | func TestCollisions(t *testing.T) { 99 | tries := 500_000 100 | 101 | used := make(map[string]bool) 102 | f, err := nanoid.Standard(8) 103 | if err != nil { 104 | panic(err) 105 | } 106 | 107 | for i := 0; i < tries; i++ { 108 | id := f() 109 | require.False(t, used[id], "should not be any colliding IDs") 110 | used[id] = true 111 | } 112 | } 113 | 114 | func Benchmark8NanoID(b *testing.B) { 115 | f, err := nanoid.Standard(8) 116 | if err != nil { 117 | panic(err) 118 | } 119 | 120 | for n := 0; n < b.N; n++ { 121 | f() 122 | } 123 | } 124 | 125 | func Benchmark21NanoID(b *testing.B) { 126 | f, err := nanoid.Standard(21) 127 | if err != nil { 128 | panic(err) 129 | } 130 | 131 | for n := 0; n < b.N; n++ { 132 | f() 133 | } 134 | } 135 | 136 | func Benchmark36NanoID(b *testing.B) { 137 | f, err := nanoid.Standard(36) 138 | if err != nil { 139 | panic(err) 140 | } 141 | 142 | for n := 0; n < b.N; n++ { 143 | f() 144 | } 145 | } 146 | 147 | func Benchmark255NanoID(b *testing.B) { 148 | f, err := nanoid.Standard(255) 149 | if err != nil { 150 | panic(err) 151 | } 152 | 153 | for n := 0; n < b.N; n++ { 154 | f() 155 | } 156 | } 157 | 158 | func BenchmarkCustomUnicodeNanoID(b *testing.B) { 159 | f, err := nanoid.CustomASCII("°Ô‘š±?¿⾃ⶃⵏ⟎⸸ⵌ", 8) 160 | if err != nil { 161 | panic(err) 162 | } 163 | 164 | for n := 0; n < b.N; n++ { 165 | f() 166 | } 167 | } 168 | 169 | func BenchmarkCustomASCIINanoID(b *testing.B) { 170 | f, err := nanoid.CustomASCII("0123456789", 8) 171 | if err != nil { 172 | panic(err) 173 | } 174 | 175 | for n := 0; n < b.N; n++ { 176 | f() 177 | } 178 | } 179 | 180 | func BenchmarkASCIINanoID(b *testing.B) { 181 | f, err := nanoid.ASCII(21) 182 | if err != nil { 183 | panic(err) 184 | } 185 | 186 | for n := 0; n < b.N; n++ { 187 | f() 188 | } 189 | } 190 | --------------------------------------------------------------------------------