├── .vscode └── settings.json ├── LICENSE ├── README.md ├── commonstock └── README.md ├── commonutils ├── README.md ├── checkmail │ ├── checkmail.go │ └── checkmail_test.go ├── utils.go └── utils_test.go ├── go.mod ├── go.sum └── main.go /.vscode/settings.json: -------------------------------------------------------------------------------- 1 | { 2 | "nuxt.isNuxtApp": false 3 | } -------------------------------------------------------------------------------- /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 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | 2 | # 公用函数库 3 | 4 | 日常积累的一些函数库，以及部分股票指标(MA、EMA、RSI、CCI、KDJ、OBV、BOLL、MACD)的实现 -------------------------------------------------------------------------------- /commonstock/README.md: -------------------------------------------------------------------------------- 1 | # 目录 2 | 3 | [TOC] 4 | 5 | 6 | 7 | 所有代码已转移至 [https://github.com/idoall/stockindicator](https://github.com/idoall/stockindicator) -------------------------------------------------------------------------------- /commonutils/README.md: -------------------------------------------------------------------------------- 1 | # 常用的 golang 公共库 2 | 3 | ## 其他代码的来源 4 | 5 | checkmail:https://github.com/badoux/checkmail -------------------------------------------------------------------------------- /commonutils/checkmail/checkmail.go: -------------------------------------------------------------------------------- 1 | package checkmail 2 | 3 | import ( 4 | "errors" 5 | "fmt" 6 | "net" 7 | "net/smtp" 8 | "regexp" 9 | "strings" 10 | "time" 11 | ) 12 | 13 | type SmtpError struct { 14 | Err error 15 | } 16 | 17 | func (e SmtpError) Error() string { 18 | return e.Err.Error() 19 | } 20 | 21 | func (e SmtpError) Code() string { 22 | return e.Err.Error()[0:3] 23 | } 24 | 25 | func NewSmtpError(err error) SmtpError { 26 | return SmtpError{ 27 | Err: err, 28 | } 29 | } 30 | 31 | const forceDisconnectAfter = time.Second * 5 32 | 33 | var ( 34 | ErrBadFormat = errors.New("invalid format") 35 | ErrUnresolvableHost = errors.New("unresolvable host") 36 | 37 | emailRegexp = regexp.MustCompile("^[a-zA-Z0-9.!#$%&'*+/=?^_`{|}~-]+@[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:\\.[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?)*$") 38 | ) 39 | 40 | func ValidateFormat(email string) error { 41 | if !emailRegexp.MatchString(email) { 42 | return ErrBadFormat 43 | } 44 | return nil 45 | } 46 | 47 | func ValidateHost(email string) error { 48 | _, host := split(email) 49 | mx, err := net.LookupMX(host) 50 | if err != nil { 51 | return ErrUnresolvableHost 52 | } 53 | 54 | client, err := DialTimeout(fmt.Sprintf("%s:%d", mx[0].Host, 25), forceDisconnectAfter) 55 | if err != nil { 56 | return NewSmtpError(err) 57 | } 58 | defer client.Close() 59 | 60 | err = client.Hello("checkmail.me") 61 | if err != nil { 62 | return NewSmtpError(err) 63 | } 64 | err = client.Mail("lansome-cowboy@gmail.com") 65 | if err != nil { 66 | return NewSmtpError(err) 67 | } 68 | err = client.Rcpt(email) 69 | if err != nil { 70 | return NewSmtpError(err) 71 | } 72 | return nil 73 | } 74 | 75 | // DialTimeout returns a new Client connected to an SMTP server at addr. 76 | // The addr must include a port, as in "mail.example.com:smtp". 77 | func DialTimeout(addr string, timeout time.Duration) (*smtp.Client, error) { 78 | conn, err := net.DialTimeout("tcp", addr, timeout) 79 | if err != nil { 80 | return nil, err 81 | } 82 | 83 | t := time.AfterFunc(timeout, func() { conn.Close() }) 84 | defer t.Stop() 85 | 86 | host, _, _ := net.SplitHostPort(addr) 87 | return smtp.NewClient(conn, host) 88 | } 89 | 90 | func split(email string) (account, host string) { 91 | i := strings.LastIndexByte(email, '@') 92 | account = email[:i] 93 | host = email[i+1:] 94 | return 95 | } 96 | -------------------------------------------------------------------------------- /commonutils/checkmail/checkmail_test.go: -------------------------------------------------------------------------------- 1 | package checkmail 2 | 3 | import ( 4 | "testing" 5 | ) 6 | 7 | var ( 8 | samples = []struct { 9 | mail string 10 | format bool 11 | account bool //host+user 12 | }{ 13 | {mail: "florian@carrere.cc", format: true, account: true}, 14 | {mail: "support@g2mail.com", format: true, account: false}, 15 | {mail: " florian@carrere.cc", format: false, account: false}, 16 | {mail: "florian@carrere.cc ", format: false, account: false}, 17 | {mail: "test@912-wrong-domain902.com", format: true, account: false}, 18 | {mail: "0932910-qsdcqozuioqkdmqpeidj8793@gmail.com", format: true, account: false}, 19 | {mail: "@gmail.com", format: false, account: false}, 20 | {mail: "test@gmail@gmail.com", format: false, account: false}, 21 | {mail: "test test@gmail.com", format: false, account: false}, 22 | {mail: " test@gmail.com", format: false, account: false}, 23 | {mail: "test@wrong domain.com", format: false, account: false}, 24 | {mail: "é&ààà@gmail.com", format: false, account: false}, 25 | {mail: "admin@busyboo.com", format: true, account: false}, 26 | {mail: "a@gmail.fi", format: true, account: false}, 27 | } 28 | ) 29 | 30 | func TestValidateHost(t *testing.T) { 31 | for _, s := range samples { 32 | if !s.format { 33 | continue 34 | } 35 | 36 | err := ValidateHost(s.mail) 37 | if err != nil && s.account == true { 38 | t.Errorf(`"%s" => unexpected error: "%v"`, s.mail, err) 39 | } 40 | if err == nil && s.account == false { 41 | t.Errorf(`"%s" => expected error`, s.mail) 42 | } 43 | } 44 | } 45 | 46 | func TestValidateFormat(t *testing.T) { 47 | for _, s := range samples { 48 | err := ValidateFormat(s.mail) 49 | if err != nil && s.format == true { 50 | t.Errorf(`"%s" => unexpected error: "%v"`, s.mail, err) 51 | } 52 | if err == nil && s.format == false { 53 | t.Errorf(`"%s" => expected error`, s.mail) 54 | } 55 | } 56 | } 57 | -------------------------------------------------------------------------------- /commonutils/utils.go: -------------------------------------------------------------------------------- 1 | package commonutils 2 | 3 | import ( 4 | "bytes" 5 | "crypto/hmac" 6 | "crypto/md5" 7 | "crypto/rand" 8 | "crypto/sha1" 9 | "crypto/sha256" 10 | "crypto/sha512" 11 | "encoding/base64" 12 | "encoding/csv" 13 | "encoding/hex" 14 | "encoding/json" 15 | "errors" 16 | "fmt" 17 | "hash" 18 | "io" 19 | "io/ioutil" 20 | "math" 21 | "net/http" 22 | "net/url" 23 | "os" 24 | "path/filepath" 25 | "reflect" 26 | "regexp" 27 | "runtime" 28 | "sort" 29 | "strconv" 30 | "strings" 31 | "time" 32 | 33 | "github.com/shopspring/decimal" 34 | ) 35 | 36 | // Const declarations for common.go operations 37 | const ( 38 | HashSHA1 = iota 39 | HashSHA256 40 | HashSHA512 41 | HashSHA512_384 42 | MD5New 43 | SatoshisPerBTC = 100000000 44 | SatoshisPerLTC = 100000000 45 | WeiPerEther = 1000000000000000000 46 | ) 47 | 48 | // NewHTTPClientWithTimeout initialises a new HTTP client with the specified 49 | // timeout duration 50 | func NewHTTPClientWithTimeout(t time.Duration) *http.Client { 51 | h := &http.Client{Timeout: t} 52 | return h 53 | } 54 | 55 | // GetRandomSalt returns a random salt 56 | func GetRandomSalt(input []byte, saltLen int) ([]byte, error) { 57 | if saltLen <= 0 { 58 | return nil, errors.New("salt length is too small") 59 | } 60 | salt := make([]byte, saltLen) 61 | if _, err := io.ReadFull(rand.Reader, salt); err != nil { 62 | return nil, err 63 | } 64 | 65 | var result []byte 66 | if input != nil { 67 | result = input 68 | } 69 | result = append(result, salt...) 70 | return result, nil 71 | } 72 | 73 | // GetMD5 returns a MD5 hash of a byte array 74 | func GetMD5(input []byte) []byte { 75 | hash := md5.New() 76 | hash.Write(input) 77 | return hash.Sum(nil) 78 | } 79 | 80 | // GetSHA512 returns a SHA512 hash of a byte array 81 | func GetSHA512(input []byte) []byte { 82 | sha := sha512.New() 83 | sha.Write(input) 84 | return sha.Sum(nil) 85 | } 86 | 87 | // GetSHA256 returns a SHA256 hash of a byte array 88 | func GetSHA256(input []byte) []byte { 89 | sha := sha256.New() 90 | sha.Write(input) 91 | return sha.Sum(nil) 92 | } 93 | 94 | // GetHMAC returns a keyed-hash message authentication code using the desired 95 | // hashtype 96 | func GetHMAC(hashType int, input, key []byte) []byte { 97 | var hash func() hash.Hash 98 | 99 | switch hashType { 100 | case HashSHA1: 101 | { 102 | hash = sha1.New 103 | } 104 | case HashSHA256: 105 | { 106 | hash = sha256.New 107 | } 108 | case HashSHA512: 109 | { 110 | hash = sha512.New 111 | } 112 | case HashSHA512_384: 113 | { 114 | hash = sha512.New384 115 | } 116 | case MD5New: 117 | { 118 | hash = md5.New 119 | } 120 | } 121 | 122 | // 使用给定的hash.Hash类型和密钥返回新的HMAC哈希 123 | hmac := hmac.New(hash, []byte(key)) 124 | hmac.Write(input) 125 | return hmac.Sum(nil) 126 | } 127 | 128 | // Sha1ToHex Sign signs provided payload and returns encoded string sum. 129 | func Sha1ToHex(data string) string { 130 | h := sha1.New() 131 | h.Write([]byte(data)) 132 | return hex.EncodeToString(h.Sum(nil)) 133 | } 134 | 135 | // HexEncodeToString takes in a hexadecimal byte array and returns a string 136 | func HexEncodeToString(input []byte) string { 137 | return hex.EncodeToString(input) 138 | } 139 | 140 | // HexDecodeToBytes takes in a hexadecimal string and returns a byte array 141 | func HexDecodeToBytes(input string) ([]byte, error) { 142 | return hex.DecodeString(input) 143 | } 144 | 145 | // ByteArrayToString returns a string 146 | func ByteArrayToString(input []byte) string { 147 | return fmt.Sprintf("%x", input) 148 | } 149 | 150 | // Base64Decode takes in a Base64 string and returns a byte array and an error 151 | func Base64Decode(input string) ([]byte, error) { 152 | result, err := base64.StdEncoding.DecodeString(input) 153 | if err != nil { 154 | return nil, err 155 | } 156 | return result, nil 157 | } 158 | 159 | // Base64Encode takes in a byte array then returns an encoded base64 string 160 | func Base64Encode(input []byte) string { 161 | return base64.StdEncoding.EncodeToString(input) 162 | } 163 | 164 | // StringSliceDifference concatenates slices together based on its index and 165 | // returns an individual string array 166 | func StringSliceDifference(slice1 []string, slice2 []string) []string { 167 | var diff []string 168 | for i := 0; i < 2; i++ { 169 | for _, s1 := range slice1 { 170 | found := false 171 | for _, s2 := range slice2 { 172 | if s1 == s2 { 173 | found = true 174 | break 175 | } 176 | } 177 | if !found { 178 | diff = append(diff, s1) 179 | } 180 | } 181 | if i == 0 { 182 | slice1, slice2 = slice2, slice1 183 | } 184 | } 185 | return diff 186 | } 187 | 188 | // StringContains checks a substring if it contains your input then returns a 189 | // bool 190 | func StringContains(input, substring string) bool { 191 | return strings.Contains(input, substring) 192 | } 193 | 194 | // StringDataContains checks the substring array with an input and returns a bool 195 | func StringDataContains(haystack []string, needle string) bool { 196 | data := strings.Join(haystack, ",") 197 | return strings.Contains(data, needle) 198 | } 199 | 200 | // StringDataCompare data checks the substring array with an input and returns a bool 201 | func StringDataCompare(haystack []string, needle string) bool { 202 | for x := range haystack { 203 | if haystack[x] == needle { 204 | return true 205 | } 206 | } 207 | return false 208 | } 209 | 210 | // TimeDataCompare data checks the substring array with an input and returns a bool 211 | func TimeDataCompare(haystack []time.Time, needle time.Time) bool { 212 | for x := range haystack { 213 | if haystack[x] == needle { 214 | return true 215 | } 216 | } 217 | return false 218 | } 219 | 220 | // IntDataCompare data checks the substring array with an input and returns a bool 221 | func IntDataCompare(haystack []int, needle int) bool { 222 | for x := range haystack { 223 | if haystack[x] == needle { 224 | return true 225 | } 226 | } 227 | return false 228 | } 229 | 230 | // Int64DataCompare data checks the substring array with an input and returns a bool 231 | func Int64DataCompare(haystack []int64, needle int64) bool { 232 | for x := range haystack { 233 | if haystack[x] == needle { 234 | return true 235 | } 236 | } 237 | return false 238 | } 239 | 240 | // StringDataCompareInsensitive data checks the substring array with an input and returns 241 | // a bool irrespective of lower or upper case strings 242 | func StringDataCompareInsensitive(haystack []string, needle string) bool { 243 | for x := range haystack { 244 | if strings.EqualFold(haystack[x], needle) { 245 | return true 246 | } 247 | } 248 | return false 249 | } 250 | 251 | // StringDataContainsInsensitive checks the substring array with an input and returns 252 | // a bool irrespective of lower or upper case strings 253 | func StringDataContainsInsensitive(haystack []string, needle string) bool { 254 | for _, data := range haystack { 255 | if strings.Contains(StringToUpper(data), StringToUpper(needle)) { 256 | return true 257 | } 258 | } 259 | return false 260 | } 261 | 262 | // StringDataCompareUpper data checks the substring array with an input and returns 263 | // a bool irrespective of lower or upper case strings 264 | func StringDataCompareUpper(haystack []string, needle string) bool { 265 | for x := range haystack { 266 | if StringToUpper(haystack[x]) == StringToUpper(needle) { 267 | return true 268 | } 269 | } 270 | return false 271 | } 272 | 273 | // StringDataContainsUpper checks the substring array with an input and returns 274 | // a bool irrespective of lower or upper case strings 275 | func StringDataContainsUpper(haystack []string, needle string) bool { 276 | for _, data := range haystack { 277 | if strings.Contains(StringToUpper(data), StringToUpper(needle)) { 278 | return true 279 | } 280 | } 281 | return false 282 | } 283 | 284 | // JoinStrings joins an array together with the required separator and returns 285 | // it as a string 286 | func JoinStrings(input []string, separator string) string { 287 | return strings.Join(input, separator) 288 | } 289 | 290 | // SplitStrings splits blocks of strings from string into a string array using 291 | // a separator ie "," or "_" 292 | func SplitStrings(input, separator string) []string { 293 | return strings.Split(input, separator) 294 | } 295 | 296 | // TrimString trims unwanted prefixes or postfixes 297 | func TrimString(input, cutset string) string { 298 | return strings.Trim(input, cutset) 299 | } 300 | 301 | // ReplaceString replaces a string with another 302 | // 返回将s中前n个不重叠old子串都替换为new的新字符串，如果n<0会替换所有old子串。 303 | func ReplaceString(input, old, new string, n int) string { 304 | return strings.Replace(input, old, new, n) 305 | } 306 | 307 | // StringToUpper changes strings to uppercase 308 | func StringToUpper(input string) string { 309 | return strings.ToUpper(input) 310 | } 311 | 312 | // StringToLower changes strings to lowercase 313 | func StringToLower(input string) string { 314 | return strings.ToLower(input) 315 | } 316 | 317 | // RoundFloat rounds your floating point number to the desired decimal place 318 | func RoundFloat(x float64, prec int) float64 { 319 | var rounder float64 320 | pow := math.Pow(10, float64(prec)) 321 | intermed := x * pow 322 | _, frac := math.Modf(intermed) 323 | intermed += .5 324 | x = .5 325 | if frac < 0.0 { 326 | x = -.5 327 | intermed-- 328 | } 329 | if frac >= x { 330 | rounder = math.Ceil(intermed) 331 | } else { 332 | rounder = math.Floor(intermed) 333 | } 334 | 335 | return rounder / pow 336 | } 337 | 338 | // IsEnabled takes in a boolean param and returns a string if it is enabled 339 | // or disabled 340 | func IsEnabled(isEnabled bool) string { 341 | if isEnabled { 342 | return "Enabled" 343 | } 344 | return "Disabled" 345 | } 346 | 347 | // IsValidCryptoAddress validates your cryptocurrency address string using the 348 | // regexp package // Validation issues occurring because "3" is contained in 349 | // litecoin and Bitcoin addresses - non-fatal 350 | func IsValidCryptoAddress(address, crypto string) (bool, error) { 351 | switch StringToLower(crypto) { 352 | case "btc": 353 | return regexp.MatchString("^[13][a-km-zA-HJ-NP-Z1-9]{25,34}$", address) 354 | case "ltc": 355 | return regexp.MatchString("^[L3M][a-km-zA-HJ-NP-Z1-9]{25,34}$", address) 356 | case "eth": 357 | return regexp.MatchString("^0x[a-km-z0-9]{40}$", address) 358 | default: 359 | return false, errors.New("Invalid crypto currency") 360 | } 361 | } 362 | 363 | // YesOrNo returns a boolean variable to check if input is "y" or "yes" 364 | func YesOrNo(input string) bool { 365 | if StringToLower(input) == "y" || StringToLower(input) == "yes" { 366 | return true 367 | } 368 | return false 369 | } 370 | 371 | // CalculateAmountWithFee returns a calculated fee included amount on fee 372 | func CalculateAmountWithFee(amount, fee float64) float64 { 373 | return amount + CalculateFee(amount, fee) 374 | } 375 | 376 | // CalculateFee returns a simple fee on amount 377 | func CalculateFee(amount, fee float64) float64 { 378 | return amount * (fee / 100) 379 | } 380 | 381 | // CalculatePercentageGainOrLoss returns the percentage rise over a certain 382 | // period 383 | func CalculatePercentageGainOrLoss(priceNow, priceThen float64) float64 { 384 | return (priceNow - priceThen) / priceThen * 100 385 | } 386 | 387 | // CalculatePercentageDifference returns the percentage of difference between 388 | // multiple time periods 389 | func CalculatePercentageDifference(amount, secondAmount float64) float64 { 390 | return (amount - secondAmount) / ((amount + secondAmount) / 2) * 100 391 | } 392 | 393 | // CalculateNetProfit returns net profit 394 | func CalculateNetProfit(amount, priceThen, priceNow, costs float64) float64 { 395 | return (priceNow * amount) - (priceThen * amount) - costs 396 | } 397 | 398 | // JSONEncode encodes structure data into JSON 399 | func JSONEncode(v interface{}) ([]byte, error) { 400 | return json.Marshal(v) 401 | } 402 | 403 | // JSONDecode decodes JSON data into a structure 404 | func JSONDecode(data []byte, to interface{}) error { 405 | if !StringContains(reflect.ValueOf(to).Type().String(), "*") { 406 | return errors.New("json decode error - memory address not supplied") 407 | } 408 | return json.Unmarshal(data, to) 409 | } 410 | 411 | // EncodeURLValues concatenates url values onto a url string and returns a 412 | // string 413 | func EncodeURLValues(url string, values url.Values) string { 414 | path := url 415 | if len(values) > 0 { 416 | path += "?" + values.Encode() 417 | } 418 | return path 419 | } 420 | 421 | // ExtractHost returns the hostname out of a string 422 | func ExtractHost(address string) string { 423 | host := SplitStrings(address, ":")[0] 424 | if host == "" { 425 | return "localhost" 426 | } 427 | return host 428 | } 429 | 430 | // ExtractPort returns the port name out of a string 431 | func ExtractPort(host string) int { 432 | portStr := SplitStrings(host, ":")[1] 433 | port, _ := strconv.Atoi(portStr) 434 | return port 435 | } 436 | 437 | // OutputCSV dumps data into a file as comma-separated values 438 | func OutputCSV(path string, data [][]string) error { 439 | _, err := ReadFile(path) 440 | if err != nil { 441 | errTwo := WriteFile(path, nil) 442 | if errTwo != nil { 443 | return errTwo 444 | } 445 | } 446 | 447 | file, err := os.Create(path) 448 | if err != nil { 449 | return err 450 | } 451 | 452 | writer := csv.NewWriter(file) 453 | 454 | err = writer.WriteAll(data) 455 | if err != nil { 456 | return err 457 | } 458 | 459 | writer.Flush() 460 | file.Close() 461 | return nil 462 | } 463 | 464 | func GetCaller() (filePath, fileName, funcName string, lineNum int) { 465 | var filePathName string 466 | var pc uintptr 467 | // Skip this function, and fetch the PC and file for its parent 468 | pc, filePathName, lineNum, _ = runtime.Caller(1) 469 | // Retrieve a Function object this functions parent 470 | functionObject := runtime.FuncForPC(pc) 471 | // Regex to extract just the function name (and not the module path) 472 | extractFnName := regexp.MustCompile(`^.*\.(.*)$`) 473 | funcName = extractFnName.ReplaceAllString(functionObject.Name(), "$1") 474 | filePath, fileName = filepath.Split(filePathName) 475 | return 476 | } 477 | 478 | // GetFuncName 获取调用方法的名称 479 | func GetFuncName() string { 480 | // Skip this function, and fetch the PC and file for its parent 481 | pc, _, _, _ := runtime.Caller(1) 482 | // Retrieve a Function object this functions parent 483 | functionObject := runtime.FuncForPC(pc) 484 | // Regex to extract just the function name (and not the module path) 485 | extractFnName := regexp.MustCompile(`^.*\.(.*)$`) 486 | return extractFnName.ReplaceAllString(functionObject.Name(), "$1") 487 | } 488 | 489 | // GetFuncLine 获取调用方法的行号 490 | func GetFuncLine() int { 491 | // Skip this function, and fetch the PC and file for its parent 492 | _, _, line, _ := runtime.Caller(1) 493 | return line 494 | } 495 | 496 | // UnixTimestampToTime returns time.time 497 | func UnixTimestampToTime(timeint64 int64) time.Time { 498 | return time.Unix(timeint64, 0) 499 | } 500 | 501 | // UnixTimestampStrToTime returns a time.time and an error 502 | func UnixTimestampStrToTime(timeStr string) (time.Time, error) { 503 | i, err := strconv.ParseInt(timeStr, 10, 64) 504 | if err != nil { 505 | return time.Time{}, err 506 | } 507 | 508 | return time.Unix(i, 0), nil 509 | } 510 | 511 | // CreateDir creates a directory based on the supplied parameter 512 | func CreateDir(dir string) error { 513 | _, err := os.Stat(dir) 514 | if !os.IsNotExist(err) { 515 | return nil 516 | } 517 | 518 | return os.MkdirAll(dir, 0770) 519 | } 520 | 521 | // ReadFile reads a file and returns read data as byte array. 522 | func ReadFile(path string) ([]byte, error) { 523 | file, err := ioutil.ReadFile(path) 524 | if err != nil { 525 | return nil, err 526 | } 527 | return file, nil 528 | } 529 | 530 | // WriteFile writes selected data to a file and returns an error 531 | func WriteFile(file string, data []byte) error { 532 | err := ioutil.WriteFile(file, data, 0644) 533 | if err != nil { 534 | return err 535 | } 536 | return nil 537 | } 538 | 539 | // PathExists 判断文件或文件夹是否存在的方法 540 | func PathExists(path string) bool { 541 | _, err := os.Stat(path) 542 | if err == nil { 543 | return true 544 | } 545 | if os.IsNotExist(err) { 546 | return false 547 | } 548 | return false 549 | } 550 | 551 | // RemoveFile removes a file 552 | func RemoveFile(file string) error { 553 | return os.Remove(file) 554 | } 555 | 556 | // GetURIPath returns the path of a URL given a URI 557 | func GetURIPath(uri string) string { 558 | urip, err := url.Parse(uri) 559 | if err != nil { 560 | return "" 561 | } 562 | if urip.RawQuery != "" { 563 | return fmt.Sprintf("%s?%s", urip.Path, urip.RawQuery) 564 | } 565 | return urip.Path 566 | } 567 | 568 | // GetExecutablePath returns the executables launch path 569 | func GetExecutablePath() (string, error) { 570 | ex, err := os.Executable() 571 | if err != nil { 572 | return "", err 573 | } 574 | return filepath.Dir(ex), nil 575 | } 576 | 577 | // GetOSPathSlash returns the slash used by the operating systems 578 | // file system 579 | func GetOSPathSlash() string { 580 | if runtime.GOOS == "windows" { 581 | return "\\" 582 | } 583 | return "/" 584 | } 585 | 586 | // FormatMapStringToString 将 map[string]interface{} 格式化成字符串 587 | // commonutils.FormatMapStringToString("买进补仓", logFileds) 588 | func FormatMapStringToString(msg string, fileds map[string]interface{}) string { 589 | 590 | //排序 591 | var keys []string 592 | for key := range fileds { 593 | keys = append(keys, key) 594 | } 595 | sort.Strings(keys) 596 | 597 | //字符串拼接 598 | var buf bytes.Buffer 599 | buf.WriteByte('[') 600 | buf.WriteString(msg) 601 | buf.WriteByte(']') 602 | for _, key := range keys { 603 | if buf.Len() > 0 { 604 | buf.WriteByte(' ') 605 | } 606 | buf.WriteString(key) 607 | buf.WriteByte('=') 608 | stringVal, ok := fileds[key].(string) 609 | if !ok { 610 | stringVal = fmt.Sprint(fileds[key]) 611 | } 612 | buf.WriteString(fmt.Sprintf("%q", stringVal)) 613 | } 614 | return buf.String() 615 | } 616 | 617 | // FormatDecimalString 格式化后的字符串 618 | // @param {[type]} this [description] 619 | // @return {[type]} [description] 620 | // formatDecimal_String("0.000163786", -6) //"0.000164" 621 | func FormatDecimalString(value float64, exp int32) string { 622 | return decimal.NewFromFloatWithExponent(value, exp).String() 623 | } 624 | 625 | // FormatDecimalFloat64 获取精度计算后的数量 626 | // 627 | // example 628 | // FormatDecimalFloat64(123.456, -2) // output: 123.46 629 | // FormatDecimalFloat64(-500,-2) // output: -500 630 | // FormatDecimalFloat64(1.1001, -2) // output: 1.1 631 | // FormatDecimalFloat64(1.454, -1) // output: 1.5 632 | func FormatDecimalFloat64(value float64, exp int32) float64 { 633 | var val, _ = decimal.NewFromFloatWithExponent(value, exp).Float64() 634 | return val 635 | } 636 | 637 | // FloatFromString format 638 | func FloatFromString(raw interface{}) (float64, error) { 639 | str, ok := raw.(string) 640 | if !ok { 641 | return 0, fmt.Errorf("unable to parse, value not string: %T", raw) 642 | } 643 | flt, err := strconv.ParseFloat(str, 64) 644 | if err != nil { 645 | return 0, fmt.Errorf("unable to parse, value not string: %T", raw) 646 | } 647 | return flt, nil 648 | } 649 | 650 | // FloatFromStringDontRound 不需要小数点四舍五入，直接取位数 651 | // 652 | // example 653 | // FloatFromStringDontRound(545, -2) // output: 500 654 | // FloatFromStringDontRound(-500,-2) // output: -500 655 | // FloatFromStringDontRound(1.1001, 2) // output: 1.1 656 | // FloatFromStringDontRound(1.454, 1) // output: 1.4 657 | func FloatFromStringDontRound(num float64, exp int32) float64 { 658 | var val, _ = decimal.NewFromFloat(num).RoundFloor(exp).Float64() 659 | return val 660 | } 661 | 662 | // Int32ToString format 663 | // 664 | // example 665 | // Int32ToString(123) // output: "123" 666 | // Int32ToString(-10) // output: "-10" 667 | func Int32ToString(n int32) string { 668 | return decimal.NewFromInt32(n).String() 669 | } 670 | 671 | // IntFromString format 672 | func IntFromString(raw interface{}) (int, error) { 673 | str, ok := raw.(string) 674 | if !ok { 675 | return 0, fmt.Errorf("unable to parse, value not string: %T", raw) 676 | } 677 | n, err := strconv.Atoi(str) 678 | if err != nil { 679 | return 0, fmt.Errorf("unable to parse as int: %T", raw) 680 | } 681 | return n, nil 682 | } 683 | 684 | // Int32FromString format 685 | func Int32FromString(raw interface{}) (int32, error) { 686 | str, ok := raw.(string) 687 | if !ok { 688 | return 0, fmt.Errorf("unable to parse, value not string: %T", raw) 689 | } 690 | n, err := strconv.Atoi(str) 691 | if err != nil { 692 | return 0, fmt.Errorf("unable to parse as int: %T", raw) 693 | } 694 | return int32(n), nil 695 | } 696 | 697 | // Int64FromString format 698 | func Int64FromString(raw interface{}) (int64, error) { 699 | str, ok := raw.(string) 700 | if !ok { 701 | return 0, fmt.Errorf("unable to parse, value not string: %T", raw) 702 | } 703 | n, err := strconv.ParseInt(str, 10, 64) 704 | if err != nil { 705 | return 0, fmt.Errorf("unable to parse as int: %T", raw) 706 | } 707 | return n, nil 708 | } 709 | 710 | // RecvWindow 格式化时间 711 | func RecvWindow(d time.Duration) int64 { 712 | return int64(d) / int64(time.Millisecond) 713 | } 714 | 715 | // TimeFromUnixTimestampFloat format 716 | func TimeFromUnixTimestampFloat(raw interface{}) (time.Time, error) { 717 | ts, ok := raw.(float64) 718 | if !ok { 719 | return time.Time{}, fmt.Errorf("unable to parse, value not int64: %T", raw) 720 | } 721 | return time.Unix(0, int64(ts)*int64(time.Millisecond)), nil 722 | } 723 | 724 | // UnixNesc 格式化时间 725 | // i := int64(1532246192000) 726 | // t := commonutils.TimeFromUnixNEscInt64(i) 727 | // fmt.Println(t.Format("2006-01-02 15:04:05")) //2018-07-22 15:56:32 728 | // fmt.Println(commonutils.UnixNesc(t)) // 1532246192000 729 | func UnixNesc(t time.Time) int64 { 730 | return t.UnixNano() / int64(time.Millisecond) 731 | } 732 | 733 | // TimeFromUnixNEscInt64 format 734 | // i := int64(1532246192000) 735 | // t := commonutils.TimeFromUnixEscInt64(i) 736 | // fmt.Println(t.Format("2006-01-02 15:04:05")) //2018-07-22 15:56:32 737 | func TimeFromUnixNEscInt64(i int64) time.Time { 738 | return time.Unix(0, int64(i)*int64(time.Millisecond)) 739 | } 740 | 741 | // TimeFromUnixEscInt64 format 742 | // i := int64(1530854162) 743 | // fmt.Println(TimeFromUnixNescInt64(i)) //2018-07-06 13:16:02 744 | func TimeFromUnixEscInt64(i int64) time.Time { 745 | //time.Unix(0, int64(i)*int64(time.Millisecond)) 746 | return time.Unix(i, 0) 747 | } 748 | 749 | // ReverseModelLineData 对数组进行反转到一个新数组 750 | // func ReverseModelLineData(s []*commonmodels.Kline) []*commonmodels.Kline { 751 | // _length := len(s) 752 | // var _tempArr []*commonmodels.Kline 753 | 754 | // for i := _length - 1; i >= 0; i-- { 755 | // _tempArr = append(_tempArr, s[i]) 756 | // } 757 | // return _tempArr 758 | // } 759 | -------------------------------------------------------------------------------- /commonutils/utils_test.go: -------------------------------------------------------------------------------- 1 | package commonutils 2 | 3 | import ( 4 | "bytes" 5 | "fmt" 6 | "net/url" 7 | "reflect" 8 | "testing" 9 | "time" 10 | ) 11 | 12 | func TestIsEnabled(t *testing.T) { 13 | t.Parallel() 14 | expected := "Enabled" 15 | actual := IsEnabled(true) 16 | if actual != expected { 17 | t.Errorf("Test failed. Expected %s. Actual %s", expected, actual) 18 | } 19 | 20 | expected = "Disabled" 21 | actual = IsEnabled(false) 22 | if actual != expected { 23 | t.Errorf("Test failed. Expected %s. Actual %s", expected, actual) 24 | } 25 | } 26 | 27 | func TestIsValidCryptoAddress(t *testing.T) { 28 | t.Parallel() 29 | 30 | b, err := IsValidCryptoAddress("1Mz7153HMuxXTuR2R1t78mGSdzaAtNbBWX", "bTC") 31 | if err != nil && !b { 32 | t.Errorf("Test Failed - Common IsValidCryptoAddress error: %s", err) 33 | } 34 | b, err = IsValidCryptoAddress("0Mz7153HMuxXTuR2R1t78mGSdzaAtNbBWX", "btc") 35 | if err == nil && b { 36 | t.Error("Test Failed - Common IsValidCryptoAddress error") 37 | } 38 | b, err = IsValidCryptoAddress("1Mz7153HMuxXTuR2R1t78mGSdzaAtNbBWX", "lTc") 39 | if err == nil && b { 40 | t.Error("Test Failed - Common IsValidCryptoAddress error") 41 | } 42 | b, err = IsValidCryptoAddress("3CDJNfdWX8m2NwuGUV3nhXHXEeLygMXoAj", "ltc") 43 | if err != nil && !b { 44 | t.Errorf("Test Failed - Common IsValidCryptoAddress error: %s", err) 45 | } 46 | b, err = IsValidCryptoAddress("NCDJNfdWX8m2NwuGUV3nhXHXEeLygMXoAj", "lTc") 47 | if err == nil && b { 48 | t.Error("Test Failed - Common IsValidCryptoAddress error") 49 | } 50 | b, err = IsValidCryptoAddress( 51 | "0xb794f5ea0ba39494ce839613fffba74279579268", 52 | "eth", 53 | ) 54 | if err != nil && b { 55 | t.Errorf("Test Failed - Common IsValidCryptoAddress error: %s", err) 56 | } 57 | b, err = IsValidCryptoAddress( 58 | "xxb794f5ea0ba39494ce839613fffba74279579268", 59 | "eTh", 60 | ) 61 | if err == nil && b { 62 | t.Error("Test Failed - Common IsValidCryptoAddress error") 63 | } 64 | b, err = IsValidCryptoAddress( 65 | "xxb794f5ea0ba39494ce839613fffba74279579268", 66 | "ding", 67 | ) 68 | if err == nil && b { 69 | t.Error("Test Failed - Common IsValidCryptoAddress error") 70 | } 71 | } 72 | 73 | func TestGetRandomSalt(t *testing.T) { 74 | t.Parallel() 75 | 76 | _, err := GetRandomSalt(nil, -1) 77 | if err == nil { 78 | t.Fatal("Test failed. Expected err on negative salt length") 79 | } 80 | 81 | salt, err := GetRandomSalt(nil, 10) 82 | if err != nil { 83 | t.Fatal(err) 84 | } 85 | 86 | if len(salt) != 10 { 87 | t.Fatal("Test failed. Expected salt of len=10") 88 | } 89 | 90 | salt, err = GetRandomSalt([]byte("RAWR"), 12) 91 | if err != nil { 92 | t.Fatal(err) 93 | } 94 | 95 | if len(salt) != 16 { 96 | t.Fatal("Test failed. Expected salt of len=16") 97 | } 98 | } 99 | 100 | func TestGetMD5(t *testing.T) { 101 | t.Parallel() 102 | var originalString = []byte("I am testing the MD5 function in common!") 103 | var expectedOutput = []byte("18fddf4a41ba90a7352765e62e7a8744") 104 | actualOutput := GetMD5(originalString) 105 | actualStr := HexEncodeToString(actualOutput) 106 | if !bytes.Equal(expectedOutput, []byte(actualStr)) { 107 | t.Errorf("Test failed. Expected '%s'. Actual '%s'", 108 | expectedOutput, []byte(actualStr)) 109 | } 110 | 111 | } 112 | 113 | func TestGetSHA512(t *testing.T) { 114 | t.Parallel() 115 | var originalString = []byte("I am testing the GetSHA512 function in common!") 116 | var expectedOutput = []byte( 117 | `a2273f492ea73fddc4f25c267b34b3b74998bd8a6301149e1e1c835678e3c0b90859fce22e4e7af33bde1711cbb924809aedf5d759d648d61774b7185c5dc02b`, 118 | ) 119 | actualOutput := GetSHA512(originalString) 120 | actualStr := HexEncodeToString(actualOutput) 121 | if !bytes.Equal(expectedOutput, []byte(actualStr)) { 122 | t.Errorf("Test failed. Expected '%x'. Actual '%x'", 123 | expectedOutput, []byte(actualStr)) 124 | } 125 | } 126 | 127 | func TestGetSHA256(t *testing.T) { 128 | t.Parallel() 129 | var originalString = []byte("I am testing the GetSHA256 function in common!") 130 | var expectedOutput = []byte( 131 | "0962813d7a9f739cdcb7f0c0be0c2a13bd630167e6e54468266e4af6b1ad9303", 132 | ) 133 | actualOutput := GetSHA256(originalString) 134 | actualStr := HexEncodeToString(actualOutput) 135 | if !bytes.Equal(expectedOutput, []byte(actualStr)) { 136 | t.Errorf("Test failed. Expected '%x'. Actual '%x'", expectedOutput, 137 | []byte(actualStr)) 138 | } 139 | } 140 | 141 | func TestGetHMAC(t *testing.T) { 142 | expectedSha1 := []byte{ 143 | 74, 253, 245, 154, 87, 168, 110, 182, 172, 101, 177, 49, 142, 2, 253, 165, 144 | 100, 66, 86, 246, 145 | } 146 | expectedsha256 := []byte{ 147 | 54, 68, 6, 12, 32, 158, 80, 22, 142, 8, 131, 111, 248, 145, 17, 202, 224, 148 | 59, 135, 206, 11, 170, 154, 197, 183, 28, 150, 79, 168, 105, 62, 102, 149 | } 150 | expectedsha512 := []byte{ 151 | 249, 212, 31, 38, 23, 3, 93, 220, 81, 209, 214, 112, 92, 75, 126, 40, 109, 152 | 95, 247, 182, 210, 54, 217, 224, 199, 252, 129, 226, 97, 201, 245, 220, 37, 153 | 201, 240, 15, 137, 236, 75, 6, 97, 12, 190, 31, 53, 153, 223, 17, 214, 11, 154 | 153, 203, 49, 29, 158, 217, 204, 93, 179, 109, 140, 216, 202, 71, 155 | } 156 | expectedsha512384 := []byte{ 157 | 121, 203, 109, 105, 178, 68, 179, 57, 21, 217, 76, 82, 94, 100, 210, 1, 55, 158 | 201, 8, 232, 194, 168, 165, 58, 192, 26, 193, 167, 254, 183, 172, 4, 189, 159 | 158, 158, 150, 173, 33, 119, 125, 94, 13, 125, 89, 241, 184, 166, 128, 160 | } 161 | 162 | sha1 := GetHMAC(HashSHA1, []byte("Hello,World"), []byte("1234")) 163 | if string(sha1) != string(expectedSha1) { 164 | t.Errorf("Test failed.Common GetHMAC error: Expected '%x'. Actual '%x'", 165 | expectedSha1, sha1, 166 | ) 167 | } 168 | sha256 := GetHMAC(HashSHA256, []byte("Hello,World"), []byte("1234")) 169 | if string(sha256) != string(expectedsha256) { 170 | t.Errorf("Test failed.Common GetHMAC error: Expected '%x'. Actual '%x'", 171 | expectedSha1, sha1, 172 | ) 173 | } 174 | sha512 := GetHMAC(HashSHA512, []byte("Hello,World"), []byte("1234")) 175 | if string(sha512) != string(expectedsha512) { 176 | t.Errorf("Test failed.Common GetHMAC error: Expected '%x'. Actual '%x'", 177 | expectedSha1, sha1, 178 | ) 179 | } 180 | sha512384 := GetHMAC(HashSHA512_384, []byte("Hello,World"), []byte("1234")) 181 | if string(sha512384) != string(expectedsha512384) { 182 | t.Errorf("Test failed.Common GetHMAC error: Expected '%x'. Actual '%x'", 183 | expectedSha1, sha1, 184 | ) 185 | } 186 | } 187 | 188 | func TestStringToLower(t *testing.T) { 189 | t.Parallel() 190 | upperCaseString := "HEY MAN" 191 | expectedResult := "hey man" 192 | actualResult := StringToLower(upperCaseString) 193 | if actualResult != expectedResult { 194 | t.Errorf("Test failed. Expected '%s'. Actual '%s'", 195 | expectedResult, actualResult) 196 | } 197 | } 198 | 199 | func TestStringToUpper(t *testing.T) { 200 | t.Parallel() 201 | upperCaseString := "hey man" 202 | expectedResult := "HEY MAN" 203 | actualResult := StringToUpper(upperCaseString) 204 | if actualResult != expectedResult { 205 | t.Errorf("Test failed. Expected '%s'. Actual '%s'", 206 | expectedResult, actualResult) 207 | } 208 | } 209 | 210 | func TestHexEncodeToString(t *testing.T) { 211 | t.Parallel() 212 | originalInput := []byte("string") 213 | expectedOutput := "737472696e67" 214 | actualResult := HexEncodeToString(originalInput) 215 | if actualResult != expectedOutput { 216 | t.Errorf("Test failed. Expected '%s'. Actual '%s'", 217 | expectedOutput, actualResult) 218 | } 219 | } 220 | 221 | func TestBase64Decode(t *testing.T) { 222 | t.Parallel() 223 | originalInput := "aGVsbG8=" 224 | expectedOutput := []byte("hello") 225 | actualResult, err := Base64Decode(originalInput) 226 | if !bytes.Equal(actualResult, expectedOutput) { 227 | t.Errorf("Test failed. Expected '%s'. Actual '%s'. Error: %s", 228 | expectedOutput, actualResult, err) 229 | } 230 | 231 | _, err = Base64Decode("-") 232 | if err == nil { 233 | t.Error("Test failed. Bad base64 string failed returned nil error") 234 | } 235 | } 236 | 237 | func TestBase64Encode(t *testing.T) { 238 | t.Parallel() 239 | originalInput := []byte("hello") 240 | expectedOutput := "aGVsbG8=" 241 | actualResult := Base64Encode(originalInput) 242 | if actualResult != expectedOutput { 243 | t.Errorf("Test failed. Expected '%s'. Actual '%s'", 244 | expectedOutput, actualResult) 245 | } 246 | } 247 | 248 | func TestStringSliceDifference(t *testing.T) { 249 | t.Parallel() 250 | originalInputOne := []string{"hello"} 251 | originalInputTwo := []string{"hello", "moto"} 252 | expectedOutput := []string{"hello moto"} 253 | actualResult := StringSliceDifference(originalInputOne, originalInputTwo) 254 | if reflect.DeepEqual(expectedOutput, actualResult) { 255 | t.Errorf("Test failed. Expected '%s'. Actual '%s'", 256 | expectedOutput, actualResult) 257 | } 258 | } 259 | 260 | func TestStringContains(t *testing.T) { 261 | t.Parallel() 262 | originalInput := "hello" 263 | originalInputSubstring := "he" 264 | expectedOutput := true 265 | actualResult := StringContains(originalInput, originalInputSubstring) 266 | if actualResult != expectedOutput { 267 | t.Errorf("Test failed. Expected '%v'. Actual '%v'", 268 | expectedOutput, actualResult) 269 | } 270 | } 271 | 272 | func TestStringDataContains(t *testing.T) { 273 | t.Parallel() 274 | originalHaystack := []string{"hello", "world", "USDT", "Contains", "string"} 275 | originalNeedle := "USD" 276 | anotherNeedle := "thing" 277 | expectedOutput := true 278 | expectedOutputTwo := false 279 | actualResult := StringDataContains(originalHaystack, originalNeedle) 280 | if actualResult != expectedOutput { 281 | t.Errorf("Test failed. Expected '%v'. Actual '%v'", 282 | expectedOutput, actualResult) 283 | } 284 | actualResult = StringDataContains(originalHaystack, anotherNeedle) 285 | if actualResult != expectedOutputTwo { 286 | t.Errorf("Test failed. Expected '%v'. Actual '%v'", 287 | expectedOutput, actualResult) 288 | } 289 | } 290 | 291 | func TestStringDataCompare(t *testing.T) { 292 | t.Parallel() 293 | originalHaystack := []string{"hello", "WoRld", "USDT", "Contains", "string"} 294 | originalNeedle := "WoRld" 295 | anotherNeedle := "USD" 296 | expectedOutput := true 297 | expectedOutputTwo := false 298 | actualResult := StringDataCompare(originalHaystack, originalNeedle) 299 | if actualResult != expectedOutput { 300 | t.Errorf("Test failed. Expected '%v'. Actual '%v'", 301 | expectedOutput, actualResult) 302 | } 303 | actualResult = StringDataCompare(originalHaystack, anotherNeedle) 304 | if actualResult != expectedOutputTwo { 305 | t.Errorf("Test failed. Expected '%v'. Actual '%v'", 306 | expectedOutput, actualResult) 307 | } 308 | } 309 | 310 | func TestStringDataCompareUpper(t *testing.T) { 311 | t.Parallel() 312 | originalHaystack := []string{"hello", "WoRld", "USDT", "Contains", "string"} 313 | originalNeedle := "WoRld" 314 | anotherNeedle := "WoRldD" 315 | expectedOutput := true 316 | expectedOutputTwo := false 317 | actualResult := StringDataCompareUpper(originalHaystack, originalNeedle) 318 | if actualResult != expectedOutput { 319 | t.Errorf("Test failed. Expected '%v'. Actual '%v'", 320 | expectedOutput, actualResult) 321 | } 322 | 323 | actualResult = StringDataCompareUpper(originalHaystack, anotherNeedle) 324 | if actualResult != expectedOutputTwo { 325 | t.Errorf("Test failed. Expected '%v'. Actual '%v'", 326 | expectedOutput, actualResult) 327 | } 328 | } 329 | 330 | func TestStringDataContainsUpper(t *testing.T) { 331 | t.Parallel() 332 | originalHaystack := []string{"bLa", "BrO", "sUp"} 333 | originalNeedle := "Bla" 334 | anotherNeedle := "ning" 335 | expectedOutput := true 336 | expectedOutputTwo := false 337 | actualResult := StringDataContainsUpper(originalHaystack, originalNeedle) 338 | if actualResult != expectedOutput { 339 | t.Errorf("Test failed. Expected '%v'. Actual '%v'", 340 | expectedOutput, actualResult) 341 | } 342 | actualResult = StringDataContainsUpper(originalHaystack, anotherNeedle) 343 | if actualResult != expectedOutputTwo { 344 | t.Errorf("Test failed. Expected '%v'. Actual '%v'", 345 | expectedOutput, actualResult) 346 | } 347 | } 348 | 349 | func TestJoinStrings(t *testing.T) { 350 | t.Parallel() 351 | originalInputOne := []string{"hello", "moto"} 352 | separator := "," 353 | expectedOutput := "hello,moto" 354 | actualResult := JoinStrings(originalInputOne, separator) 355 | if expectedOutput != actualResult { 356 | t.Errorf("Test failed. Expected '%s'. Actual '%s'", 357 | expectedOutput, actualResult) 358 | } 359 | } 360 | 361 | func TestSplitStrings(t *testing.T) { 362 | t.Parallel() 363 | originalInputOne := "hello,moto" 364 | separator := "," 365 | expectedOutput := []string{"hello", "moto"} 366 | actualResult := SplitStrings(originalInputOne, separator) 367 | if !reflect.DeepEqual(expectedOutput, actualResult) { 368 | t.Errorf("Test failed. Expected '%s'. Actual '%s'", 369 | expectedOutput, actualResult) 370 | } 371 | } 372 | 373 | func TestTrimString(t *testing.T) { 374 | t.Parallel() 375 | originalInput := "abcd" 376 | cutset := "ad" 377 | expectedOutput := "bc" 378 | actualResult := TrimString(originalInput, cutset) 379 | if expectedOutput != actualResult { 380 | t.Errorf("Test failed. Expected '%s'. Actual '%s'", 381 | expectedOutput, actualResult) 382 | } 383 | } 384 | 385 | // ReplaceString replaces a string with another 386 | func TestReplaceString(t *testing.T) { 387 | t.Parallel() 388 | currency := "BTC-USD" 389 | expectedOutput := "BTCUSD" 390 | 391 | actualResult := ReplaceString(currency, "-", "", -1) 392 | if expectedOutput != actualResult { 393 | t.Errorf( 394 | "Test failed. Expected '%s'. Actual '%s'", expectedOutput, actualResult, 395 | ) 396 | } 397 | 398 | currency = "BTC-USD--" 399 | actualResult = ReplaceString(currency, "-", "", 3) 400 | if expectedOutput != actualResult { 401 | t.Errorf( 402 | "Test failed. Expected '%s'. Actual '%s'", expectedOutput, actualResult, 403 | ) 404 | } 405 | } 406 | 407 | func TestRoundFloat(t *testing.T) { 408 | t.Parallel() 409 | // mapping of input vs expected result 410 | testTable := map[float64]float64{ 411 | 2.3232323: 2.32, 412 | -2.3232323: -2.32, 413 | } 414 | for testInput, expectedOutput := range testTable { 415 | actualOutput := RoundFloat(testInput, 2) 416 | if actualOutput != expectedOutput { 417 | t.Errorf("Test failed. RoundFloat Expected '%f'. Actual '%f'.", 418 | expectedOutput, actualOutput) 419 | } 420 | } 421 | } 422 | 423 | func TestYesOrNo(t *testing.T) { 424 | t.Parallel() 425 | if !YesOrNo("y") { 426 | t.Error("Test failed - Common YesOrNo Error.") 427 | } 428 | if !YesOrNo("yes") { 429 | t.Error("Test failed - Common YesOrNo Error.") 430 | } 431 | if YesOrNo("ding") { 432 | t.Error("Test failed - Common YesOrNo Error.") 433 | } 434 | } 435 | 436 | func TestCalculateFee(t *testing.T) { 437 | t.Parallel() 438 | originalInput := float64(1) 439 | fee := float64(1) 440 | expectedOutput := float64(0.01) 441 | actualResult := CalculateFee(originalInput, fee) 442 | if expectedOutput != actualResult { 443 | t.Errorf( 444 | "Test failed. Expected '%f'. Actual '%f'.", expectedOutput, actualResult) 445 | } 446 | } 447 | 448 | func TestCalculateAmountWithFee(t *testing.T) { 449 | t.Parallel() 450 | originalInput := float64(1) 451 | fee := float64(1) 452 | expectedOutput := float64(1.01) 453 | actualResult := CalculateAmountWithFee(originalInput, fee) 454 | if expectedOutput != actualResult { 455 | t.Errorf( 456 | "Test failed. Expected '%f'. Actual '%f'.", expectedOutput, actualResult) 457 | } 458 | } 459 | 460 | func TestCalculatePercentageGainOrLoss(t *testing.T) { 461 | t.Parallel() 462 | originalInput := float64(9300) 463 | secondInput := float64(9000) 464 | expectedOutput := 3.3333333333333335 465 | actualResult := CalculatePercentageGainOrLoss(originalInput, secondInput) 466 | if expectedOutput != actualResult { 467 | t.Errorf( 468 | "Test failed. Expected '%f'. Actual '%f'.", expectedOutput, actualResult) 469 | } 470 | } 471 | 472 | func TestCalculatePercentageDifference(t *testing.T) { 473 | t.Parallel() 474 | originalInput := float64(10) 475 | secondAmount := float64(5) 476 | expectedOutput := 66.66666666666666 477 | actualResult := CalculatePercentageDifference(originalInput, secondAmount) 478 | if expectedOutput != actualResult { 479 | t.Errorf( 480 | "Test failed. Expected '%f'. Actual '%f'.", expectedOutput, actualResult) 481 | } 482 | } 483 | 484 | func TestCalculateNetProfit(t *testing.T) { 485 | t.Parallel() 486 | amount := float64(5) 487 | priceThen := float64(1) 488 | priceNow := float64(10) 489 | costs := float64(1) 490 | expectedOutput := float64(44) 491 | actualResult := CalculateNetProfit(amount, priceThen, priceNow, costs) 492 | if expectedOutput != actualResult { 493 | t.Errorf( 494 | "Test failed. Expected '%f'. Actual '%f'.", expectedOutput, actualResult) 495 | } 496 | } 497 | 498 | func TestJSONEncode(t *testing.T) { 499 | type test struct { 500 | Status int `json:"status"` 501 | Data []struct { 502 | Address string `json:"address"` 503 | Balance float64 `json:"balance"` 504 | Nonce interface{} `json:"nonce"` 505 | Code string `json:"code"` 506 | Name interface{} `json:"name"` 507 | Storage interface{} `json:"storage"` 508 | FirstSeen interface{} `json:"firstSeen"` 509 | } `json:"data"` 510 | } 511 | expectOutputString := `{"status":0,"data":null}` 512 | v := test{} 513 | 514 | bitey, err := JSONEncode(v) 515 | if err != nil { 516 | t.Errorf("Test failed - common JSONEncode error: %s", err) 517 | } 518 | if string(bitey) != expectOutputString { 519 | t.Error("Test failed - common JSONEncode error") 520 | } 521 | _, err = JSONEncode("WigWham") 522 | if err != nil { 523 | t.Errorf("Test failed - common JSONEncode error: %s", err) 524 | } 525 | } 526 | 527 | func TestEncodeURLValues(t *testing.T) { 528 | urlstring := "https://www.test.com" 529 | expectedOutput := `https://www.test.com?env=TEST%2FDATABASE&format=json&q=SELECT+%2A+from+yahoo.finance.xchange+WHERE+pair+in+%28%22BTC%2CUSD%22%29` 530 | values := url.Values{} 531 | values.Set("q", fmt.Sprintf( 532 | "SELECT * from yahoo.finance.xchange WHERE pair in (\"%s\")", "BTC,USD"), 533 | ) 534 | values.Set("format", "json") 535 | values.Set("env", "TEST/DATABASE") 536 | 537 | output := EncodeURLValues(urlstring, values) 538 | if output != expectedOutput { 539 | t.Error("Test Failed - common EncodeURLValues error") 540 | } 541 | } 542 | 543 | func TestExtractHost(t *testing.T) { 544 | t.Parallel() 545 | address := "localhost:1337" 546 | addresstwo := ":1337" 547 | expectedOutput := "localhost" 548 | actualResult := ExtractHost(address) 549 | if expectedOutput != actualResult { 550 | t.Errorf( 551 | "Test failed. Expected '%s'. Actual '%s'.", expectedOutput, actualResult) 552 | } 553 | actualResultTwo := ExtractHost(addresstwo) 554 | if expectedOutput != actualResultTwo { 555 | t.Errorf( 556 | "Test failed. Expected '%s'. Actual '%s'.", expectedOutput, actualResult) 557 | } 558 | 559 | address = "192.168.1.100:1337" 560 | expectedOutput = "192.168.1.100" 561 | actualResult = ExtractHost(address) 562 | if expectedOutput != actualResult { 563 | t.Errorf( 564 | "Test failed. Expected '%s'. Actual '%s'.", expectedOutput, actualResult) 565 | } 566 | } 567 | 568 | func TestExtractPort(t *testing.T) { 569 | t.Parallel() 570 | address := "localhost:1337" 571 | expectedOutput := 1337 572 | actualResult := ExtractPort(address) 573 | if expectedOutput != actualResult { 574 | t.Errorf( 575 | "Test failed. Expected '%d'. Actual '%d'.", expectedOutput, actualResult) 576 | } 577 | } 578 | 579 | func TestOutputCSV(t *testing.T) { 580 | path := "../testdata/dump" 581 | data := [][]string{} 582 | rowOne := []string{"Appended", "to", "two", "dimensional", "array"} 583 | rowTwo := []string{"Appended", "to", "two", "dimensional", "array", "two"} 584 | data = append(data, rowOne) 585 | data = append(data, rowTwo) 586 | 587 | err := OutputCSV(path, data) 588 | if err != nil { 589 | t.Errorf("Test failed - common OutputCSV error: %s", err) 590 | } 591 | } 592 | 593 | func TestUnixTimestampToTime(t *testing.T) { 594 | t.Parallel() 595 | testTime := int64(1489439831) 596 | tm := time.Unix(testTime, 0) 597 | expectedOutput := "2017-03-13 21:17:11 +0000 UTC" 598 | actualResult := UnixTimestampToTime(testTime) 599 | if tm.String() != actualResult.String() { 600 | t.Errorf( 601 | "Test failed. Expected '%s'. Actual '%s'.", expectedOutput, actualResult) 602 | } 603 | } 604 | 605 | func TestUnixTimestampStrToTime(t *testing.T) { 606 | t.Parallel() 607 | testTime := "1489439831" 608 | incorrectTime := "DINGDONG" 609 | expectedOutput := "2017-03-13 21:17:11 +0000 UTC" 610 | actualResult, err := UnixTimestampStrToTime(testTime) 611 | if err != nil { 612 | t.Error(err) 613 | } 614 | if actualResult.UTC().String() != expectedOutput { 615 | t.Errorf( 616 | "Test failed. Expected '%s'. Actual '%s'.", expectedOutput, actualResult) 617 | } 618 | actualResult, err = UnixTimestampStrToTime(incorrectTime) 619 | if err == nil { 620 | t.Error("Test failed. Common UnixTimestampStrToTime error") 621 | } 622 | } 623 | 624 | func TestReadFile(t *testing.T) { 625 | pathCorrect := "../testdata/dump" 626 | pathIncorrect := "testdata/dump" 627 | 628 | _, err := ReadFile(pathCorrect) 629 | if err != nil { 630 | t.Errorf("Test failed - Common ReadFile error: %s", err) 631 | } 632 | _, err = ReadFile(pathIncorrect) 633 | if err == nil { 634 | t.Errorf("Test failed - Common ReadFile error") 635 | } 636 | } 637 | 638 | func TestWriteFile(t *testing.T) { 639 | path := "../testdata/writefiletest" 640 | err := WriteFile(path, nil) 641 | if err != nil { 642 | t.Errorf("Test failed. Common WriteFile error: %s", err) 643 | } 644 | _, err = ReadFile(path) 645 | if err != nil { 646 | t.Errorf("Test failed. Common WriteFile error: %s", err) 647 | } 648 | 649 | err = WriteFile("", nil) 650 | if err == nil { 651 | t.Error("Test failed. Common WriteFile allowed bad path") 652 | } 653 | } 654 | 655 | func TestRemoveFile(t *testing.T) { 656 | TestWriteFile(t) 657 | path := "../testdata/writefiletest" 658 | err := RemoveFile(path) 659 | if err != nil { 660 | t.Errorf("Test failed. Common RemoveFile error: %s", err) 661 | } 662 | 663 | TestOutputCSV(t) 664 | path = "../testdata/dump" 665 | err = RemoveFile(path) 666 | if err != nil { 667 | t.Errorf("Test failed. Common RemoveFile error: %s", err) 668 | } 669 | } 670 | 671 | func TestGetURIPath(t *testing.T) { 672 | t.Parallel() 673 | // mapping of input vs expected result 674 | testTable := map[string]string{ 675 | "https://api.pro.coinbase.com/accounts": "/accounts", 676 | "https://api.pro.coinbase.com/accounts?a=1&b=2": "/accounts?a=1&b=2", 677 | "http://www.google.com/accounts?!@#$%;^^": "", 678 | } 679 | for testInput, expectedOutput := range testTable { 680 | actualOutput := GetURIPath(testInput) 681 | if actualOutput != expectedOutput { 682 | t.Errorf("Test failed. Expected '%s'. Actual '%s'.", 683 | expectedOutput, actualOutput) 684 | } 685 | } 686 | } 687 | 688 | func TestUnixNesc(t *testing.T) { 689 | t.Parallel() 690 | i := int64(1532246192000) 691 | _time := TimeFromUnixNEscInt64(i) 692 | fmt.Println(_time.Format("2006-01-02 15:04:05")) //2018-07-22 15:56:32 693 | fmt.Println(UnixNesc(_time)) // 1532246192000 694 | } 695 | 696 | func TestTimeFromUnixNEscInt64(t *testing.T) { 697 | t.Parallel() 698 | i := int64(1530854162) 699 | fmt.Println(TimeFromUnixNEscInt64(i).Format("2006-01-02 15:04:05")) //2018-07-06 13:16:02 700 | } 701 | 702 | // RUN 703 | // go test -v ./commonutils -run TestFloatFromStringDontRound 704 | func TestFloatFromStringDontRound(t *testing.T) { 705 | t.Parallel() 706 | val := FloatFromStringDontRound(545, -2) // output: 500 707 | fmt.Printf("ret: %v, %T\n", val, val) 708 | 709 | val = FloatFromStringDontRound(-500, -2) // output: -500 710 | fmt.Printf("ret: %v, %T\n", val, val) 711 | 712 | val = FloatFromStringDontRound(1.1001, 2) // output: 1.1 713 | fmt.Printf("ret: %v, %T\n", val, val) 714 | 715 | val = FloatFromStringDontRound(1.454, 1) // output: 1.4 716 | fmt.Printf("ret: %v, %T\n", val, val) 717 | } 718 | 719 | // RUN 720 | // go test -v ./commonutils -run TestFormatDecimalFloat64 721 | func TestFormatDecimalFloat64(t *testing.T) { 722 | t.Parallel() 723 | val := FormatDecimalFloat64(123.456, -2) // output: 123.46 724 | fmt.Printf("ret: %v, %T\n", val, val) 725 | 726 | val = FormatDecimalFloat64(-500, -2) // output: -500 727 | fmt.Printf("ret: %v, %T\n", val, val) 728 | 729 | val = FormatDecimalFloat64(1.1001, -2) // output: 1.1 730 | fmt.Printf("ret: %v, %T\n", val, val) 731 | 732 | val = FormatDecimalFloat64(1.454, -1) // output: 1.5 733 | fmt.Printf("ret: %v, %T\n", val, val) 734 | } 735 | -------------------------------------------------------------------------------- /go.mod: -------------------------------------------------------------------------------- 1 | module github.com/idoall/TokenExchangeCommon/v2 2 | 3 | go 1.19 4 | 5 | require github.com/shopspring/decimal v1.3.1 6 | -------------------------------------------------------------------------------- /go.sum: -------------------------------------------------------------------------------- 1 | github.com/shopspring/decimal v1.3.1 h1:2Usl1nmF/WZucqkFZhnfFYxxxu8LG21F6nPQBE5gKV8= 2 | github.com/shopspring/decimal v1.3.1/go.mod h1:DKyhrW/HYNuLGql+MJL6WCR6knT2jwCFRcu2hWCYk4o= 3 | -------------------------------------------------------------------------------- /main.go: -------------------------------------------------------------------------------- 1 | package main 2 | 3 | func main() { 4 | 5 | } 6 | --------------------------------------------------------------------------------