mirror of
https://github.com/duke-git/lancet.git
synced 2026-11-16 05:12:11 +08:00
Compare commits
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
eb9ad10f25 | ||
|
|
22316061d8 | ||
|
|
5774d0e95e | ||
|
|
9555cb2fc5 | ||
|
|
9b0a0caa75 | ||
|
|
ec11fdf345 | ||
|
|
172712df30 | ||
|
|
a296281408 | ||
|
|
f220ea4c3f | ||
|
|
129da3f2ed | ||
|
|
65806afc7d | ||
|
|
4db163b4b7 | ||
|
|
0f4f73fbba | ||
|
|
145959ee62 | ||
|
|
33a7e5bf6d | ||
|
|
99ed115de4 | ||
|
|
34c7e36d29 | ||
|
|
59cd9bd06f | ||
|
|
18e9bc9cda | ||
|
|
b282ada39e | ||
|
|
b40eea78c3 | ||
|
|
c701a35586 | ||
|
|
778bd2e14f | ||
|
|
86dc6c0019 | ||
|
|
417cf68bd8 | ||
|
|
cb45ef2d36 | ||
|
|
3811d3db8e | ||
|
|
e2524f4498 | ||
|
|
7c77aa00fb | ||
|
|
eb3b1e33d2 | ||
|
|
752f1ed63d | ||
|
|
5c04ffae97 | ||
|
|
f1db13387b | ||
|
|
be9b167a9b | ||
|
|
febd1030af | ||
|
|
fe4c81a677 | ||
|
|
8225b6d7d9 | ||
|
|
6ff2966d50 | ||
|
|
70b8fc764e | ||
|
|
f525703d9f | ||
|
|
be3bc0c43f | ||
|
|
9685357daf | ||
|
|
9a8b67ac85 | ||
|
|
19ccb13893 | ||
|
|
ef22b5b339 | ||
|
|
3b94ec1932 | ||
|
|
e49a01e725 | ||
|
|
13b7b1c61e | ||
|
|
227501958f | ||
|
|
835111c832 | ||
|
|
747dddee8b | ||
|
|
cf1b27a35a | ||
|
|
d2103346c4 | ||
|
|
ce3967b1d5 | ||
|
|
de682f2214 | ||
|
|
b252b415fa | ||
|
|
c0841d7be5 | ||
|
|
b3fd282b50 | ||
|
|
a1cebec9f2 | ||
|
|
88cf1600e8 | ||
|
|
0851b68b83 | ||
|
|
5c13fd4f2f | ||
|
|
889d0cc3d6 | ||
|
|
aa05027cab | ||
|
|
fabc3483ed | ||
|
|
30363242bb | ||
|
|
5d3964d81a | ||
|
|
6c3dc3e7d6 | ||
|
|
2a2e1ca551 | ||
|
|
e1821eed2c | ||
|
|
62f0a96d91 | ||
|
|
cbdc3971dd | ||
|
|
350450bb67 | ||
|
|
f407e51b24 | ||
|
|
3c6c3a14cf | ||
|
|
41bafdef92 | ||
|
|
fc624195c7 | ||
|
|
5b3a59e785 | ||
|
|
74abb2d3f1 | ||
|
|
3f12b34eea | ||
|
|
cd43004a91 | ||
|
|
3ac9461c00 | ||
|
|
309b07ae8a | ||
|
|
8fe56b6dc7 | ||
|
|
15a0dad0d8 | ||
|
|
93c777a418 | ||
|
|
5ff1c6578f | ||
|
|
7d4b9510a2 | ||
|
|
9f0ad2354a | ||
|
|
55b66dee99 | ||
|
|
4c64a16204 | ||
|
|
385e64cc52 | ||
|
|
be45a259db | ||
|
|
6f703fe577 | ||
|
|
cb8d93c499 | ||
|
|
ae1014c572 | ||
|
|
d5b9e67330 | ||
|
|
a81403766f | ||
|
|
6307d624cb | ||
|
|
2f9f8b3f3d | ||
|
|
db5d9407bb | ||
|
|
83c069e234 | ||
|
|
55ee000684 | ||
|
|
fc7f2509ca | ||
|
|
a97d27c32e | ||
|
|
c176ba378e | ||
|
|
a3a24fc381 | ||
|
|
9caf2ffb1c | ||
|
|
1a5c31fd02 | ||
|
|
c175b202de | ||
|
|
d818219672 | ||
|
|
539078e6b8 | ||
|
|
cdefbde9f5 | ||
|
|
1e57a743af | ||
|
|
7d4184a365 | ||
|
|
1b73483945 | ||
|
|
622aacaf44 | ||
|
|
e78ac65605 | ||
|
|
03f0d4d905 | ||
|
|
b2ae71c983 | ||
|
|
093f4a2286 | ||
|
|
f7ada6093c | ||
|
|
47e82aad39 | ||
|
|
9e813d236b | ||
|
|
72a23d2cb9 | ||
|
|
27667f8b3a | ||
|
|
0b5dc86d70 | ||
|
|
d88bba07dd | ||
|
|
d7f3354b98 | ||
|
|
f4dee28ebb | ||
|
|
c841a5b88c | ||
|
|
333038634b | ||
|
|
ef0fed23b2 | ||
|
|
1e0ee1fac1 | ||
|
|
4947327ed6 | ||
|
|
ceb706b874 | ||
|
|
3849337919 | ||
|
|
f4427b9fbc | ||
|
|
0ef45b533b | ||
|
|
169f280c9c | ||
|
|
e74126a0bd | ||
|
|
f7be4190f1 | ||
|
|
8089b71bfd | ||
|
|
5b9543255a | ||
|
|
bf859387f4 | ||
|
|
a8a92844f3 | ||
|
|
6dfdadd34e | ||
|
|
8120c4db78 | ||
|
|
0d0f213d36 | ||
|
|
41d4bbf0e3 | ||
|
|
fed1d5220e | ||
|
|
29a8318d6e | ||
|
|
3696213e5d | ||
|
|
90a3b87b67 | ||
|
|
a7b28ee864 | ||
|
|
f2823014f2 | ||
|
|
4181c42805 | ||
|
|
a09f5623d6 | ||
|
|
a9c75b081d | ||
|
|
db479ef1bc | ||
|
|
df8121fbbd | ||
|
|
0e7297cb97 | ||
|
|
2e619e48a3 | ||
|
|
3069acba4a | ||
|
|
fc43138a0e | ||
|
|
1e56e9964c | ||
|
|
f861e18bc3 | ||
|
|
e27df00fa8 | ||
|
|
23e61f1acf | ||
|
|
cb308f628c | ||
|
|
7653afa919 | ||
|
|
a0d97cf38e | ||
|
|
1f6bab467c | ||
|
|
2e5b9bc200 | ||
|
|
ab89f0aee1 | ||
|
|
1f64e02df4 | ||
|
|
d4b425e39c | ||
|
|
a1652c7523 | ||
|
|
ecafed511c | ||
|
|
4ffff0e3f3 | ||
|
|
8ebb8a028e | ||
|
|
995ffb799f | ||
|
|
3cd546d7f2 | ||
|
|
7fb49515ce | ||
|
|
8f3ea60636 | ||
|
|
58a37b7e8d | ||
|
|
6bd61460d3 | ||
|
|
05b85a2131 | ||
|
|
1eb793420e | ||
|
|
05f9854945 | ||
|
|
3be706e23f | ||
|
|
b5e7312353 | ||
|
|
95a894e53f | ||
|
|
8322951475 | ||
|
|
6b2c91b0f6 | ||
|
|
ec161f335d | ||
|
|
d1a8f37a71 | ||
|
|
a769257017 | ||
|
|
f3579fc142 | ||
|
|
de877e5278 | ||
|
|
08f14d2b08 | ||
|
|
0ed2b11ba1 | ||
|
|
643edc1468 | ||
|
|
e2ff83649a | ||
|
|
a7fecfc73b | ||
|
|
8bbae69175 | ||
|
|
840ea8f3c5 | ||
|
|
a4e89bd7c1 | ||
|
|
2015d36b08 | ||
|
|
921f218ef7 | ||
|
|
0a2cc9c928 | ||
|
|
ed93aae970 | ||
|
|
1671f7856a | ||
|
|
1008dd4956 | ||
|
|
a254ebdc8e | ||
|
|
0bc11001a4 | ||
|
|
85d98ad915 | ||
|
|
cb08613ac3 | ||
|
|
bad1b05224 | ||
|
|
527328739a | ||
|
|
213e2b4ead | ||
|
|
5d6ab72059 | ||
|
|
30eb2c72b0 | ||
|
|
adf18a2e47 | ||
|
|
f99a8ef3cf | ||
|
|
fcdf1d5839 | ||
|
|
ee0afed963 | ||
|
|
1d94896c9b | ||
|
|
69cf9bbcf0 | ||
|
|
2bbcb85286 | ||
|
|
e58c9b797b | ||
|
|
3e1ac5e0b5 | ||
|
|
8869e0440d | ||
|
|
69f9c74bcb | ||
|
|
84ebc7ce71 | ||
|
|
c745097749 | ||
|
|
ba75e58e5f | ||
|
|
7e85a0ed7d | ||
|
|
2268a0312f | ||
|
|
da84d95aa3 | ||
|
|
48244d6711 | ||
|
|
5e3337a52e | ||
|
|
c3372e18b1 | ||
|
|
90e5a0bfb2 | ||
|
|
93be25920f | ||
|
|
f9e5ec9096 | ||
|
|
601df5dc12 | ||
|
|
63216d9b1c | ||
|
|
c32a19868d | ||
|
|
71e914019b | ||
|
|
9824db0056 | ||
|
|
ba9188a29a | ||
|
|
8625fbd8d3 | ||
|
|
81b29baf30 | ||
|
|
5a38e34063 | ||
|
|
159168dd7b | ||
|
|
ec092a009a | ||
|
|
ca40b5d6c6 | ||
|
|
a6d39a3bba | ||
|
|
38148978cf | ||
|
|
3e8c3bd396 | ||
|
|
30971c1aab | ||
|
|
bc260277bc | ||
|
|
c0b200f846 | ||
|
|
305847993c | ||
|
|
f5d70728c3 | ||
|
|
c2a5335bc6 | ||
|
|
7b4e060f85 | ||
|
|
a360372aa9 | ||
|
|
7f78a6b11e | ||
|
|
5c53cb5867 | ||
|
|
f7e9d5dc47 | ||
|
|
5c580ed013 | ||
|
|
0f9764f41e | ||
|
|
0bc5f82554 | ||
|
|
e91965b013 | ||
|
|
483a286d8e | ||
|
|
3f8e306ced | ||
|
|
0b29f0520d | ||
|
|
8611ec0c10 | ||
|
|
286e10d189 | ||
|
|
3e7f94b03e | ||
|
|
356351896d | ||
|
|
9be124211e | ||
|
|
f467658481 | ||
|
|
5c9d0e396e | ||
|
|
8f74460c1b | ||
|
|
d5752499bf | ||
|
|
eb7cf76eae | ||
|
|
4af074d181 | ||
|
|
73fb8fefd2 | ||
|
|
9cf535055d | ||
|
|
8be7b3e396 | ||
|
|
dac706d700 | ||
|
|
2097277a7d | ||
|
|
95b516e278 | ||
|
|
ca373b00a7 | ||
|
|
a220220f09 | ||
|
|
aeef0418a4 | ||
|
|
9b7d8d7abf | ||
|
|
4d21e81263 | ||
|
|
ce2397422e | ||
|
|
4b3a62b36a | ||
|
|
e054680d20 | ||
|
|
5381842eec | ||
|
|
6e0498514c | ||
|
|
967e6a3493 | ||
|
|
5b24801e49 | ||
|
|
974ba525a6 | ||
|
|
f0235c40b6 | ||
|
|
712a215ea6 | ||
|
|
7893f828d3 | ||
|
|
53fa210f09 | ||
|
|
de9ee08be4 | ||
|
|
5381450bea | ||
|
|
6853d627f4 | ||
|
|
e461acdb72 | ||
|
|
2a796adf85 | ||
|
|
5e6e8d82a8 | ||
|
|
e9280b8c25 | ||
|
|
bb6f10a1fb | ||
|
|
33b4cffe60 | ||
|
|
2b765b49e0 | ||
|
|
004dbdc32e | ||
|
|
ab50e8120a | ||
|
|
73c97af7d8 | ||
|
|
5e8a065eaa | ||
|
|
aa74400607 | ||
|
|
a6eaaef563 | ||
|
|
1b31014f81 | ||
|
|
036847577d | ||
|
|
d21edd1cde | ||
|
|
c58c50327c | ||
|
|
9bfdc686f8 | ||
|
|
5ca8f6ef6f | ||
|
|
a54d4c79a0 | ||
|
|
f7b54986aa | ||
|
|
92fae4273b | ||
|
|
0d29f5437a | ||
|
|
e95d7c82cd | ||
|
|
e138043289 | ||
|
|
aabfcb7bde | ||
|
|
0b5e884371 | ||
|
|
3d1bd08434 | ||
|
|
a62ad71791 | ||
|
|
c02c4f813b | ||
|
|
235d2f2486 | ||
|
|
e9380a3d9f | ||
|
|
81d13c2f1a | ||
|
|
7290296849 | ||
|
|
8a8460a592 | ||
|
|
7a98c431d3 | ||
|
|
606d887230 | ||
|
|
473f9c9f3e | ||
|
|
9ff3d0e79c | ||
|
|
5db1d07d6d | ||
|
|
6c6d14828a | ||
|
|
0e1593c67b | ||
|
|
6c7f38d8b3 | ||
|
|
069812e0ee | ||
|
|
4a539a23c8 | ||
|
|
0b1dab0399 | ||
|
|
805e2543d0 | ||
|
|
a3d518da76 | ||
|
|
e3e2d8394c | ||
|
|
0eeaa06055 | ||
|
|
a43bc554ee | ||
|
|
aebab7c944 | ||
|
|
665bad4ca3 | ||
|
|
e4901e99e9 | ||
|
|
4277e8eca5 | ||
|
|
fdc93c8cc7 | ||
|
|
860a499f98 | ||
|
|
2e1c2276a5 | ||
|
|
d367397dab | ||
|
|
66fd8cf651 | ||
|
|
a6be1828b9 | ||
|
|
8f5d297572 | ||
|
|
a1a4fdc598 | ||
|
|
1610076d22 | ||
|
|
cacbf97223 | ||
|
|
cd156dba5f | ||
|
|
3a71a8697d | ||
|
|
c88fd3db86 | ||
|
|
27d19d1717 | ||
|
|
da24bae6b4 | ||
|
|
3cd9d6b68c | ||
|
|
874d09f331 | ||
|
|
fdf251ac98 | ||
|
|
7ec2533b7a | ||
|
|
9fd0603f4a | ||
|
|
9f7b416a8d | ||
|
|
bf4b2b5fd6 | ||
|
|
22af59565e | ||
|
|
f9e047f190 | ||
|
|
fa298b740d | ||
|
|
6d4fc981b6 | ||
|
|
4c21fe700c | ||
|
|
b7370e8ef8 | ||
|
|
38920e3be6 | ||
|
|
a630a7cda9 | ||
|
|
66dfd9c4fd | ||
|
|
be62aaac9b | ||
|
|
e0c9ccbce3 | ||
|
|
d2d1e5a055 | ||
|
|
bbc58c7e46 | ||
|
|
ac2ecceaec | ||
|
|
a06bb8ee6a | ||
|
|
27b5702fd3 | ||
|
|
b2c3fa0ab8 | ||
|
|
4afc838937 | ||
|
|
3482f80d1c | ||
|
|
565f2893b9 | ||
|
|
1b1b10d0ee | ||
|
|
c5c3888ffc | ||
|
|
11214986cc | ||
|
|
0bc7b83e59 | ||
|
|
6225418074 | ||
|
|
ddd265de78 | ||
|
|
80e48f06ca | ||
|
|
0b976e9a4c | ||
|
|
96320069f4 | ||
|
|
c5297ec329 | ||
|
|
aa4b61ff85 | ||
|
|
7dbd7002a3 | ||
|
|
a995db445a | ||
|
|
6e5b67bee7 | ||
|
|
52b8ea8166 | ||
|
|
6fe8a9efe7 | ||
|
|
dcef06e9da | ||
|
|
8f410bf9cb | ||
|
|
9cd6eb4ddf | ||
|
|
bf581162ee | ||
|
|
bd984fa378 | ||
|
|
d7f23e2dee | ||
|
|
3802c715c3 | ||
|
|
4b12173f24 | ||
|
|
31c618c187 | ||
|
|
6497b321b0 | ||
|
|
bda78201f5 | ||
|
|
0753ea2801 | ||
|
|
e25b53712b | ||
|
|
56c9327a86 | ||
|
|
11eb559998 | ||
|
|
61a612a06a | ||
|
|
2351ab4714 | ||
|
|
88eec858b4 | ||
|
|
14c37b5a5f | ||
|
|
ad8b1d424c | ||
|
|
a9f01d8a69 | ||
|
|
781b89d51a | ||
|
|
073c77e751 | ||
|
|
91a0d3077d | ||
|
|
17b34f8f19 | ||
|
|
8ff37f0eff | ||
|
|
f445ecbaf8 | ||
|
|
b698fec50f | ||
|
|
b38bb66b34 | ||
|
|
bdfdeaf496 | ||
|
|
172c44c07a | ||
|
|
534263eb08 | ||
|
|
a25b1ac7e3 | ||
|
|
d84f9777ea | ||
|
|
f9caaf8063 | ||
|
|
f198711d1c | ||
|
|
19378ca4d1 | ||
|
|
71c7733eb0 | ||
|
|
20786c360b | ||
|
|
51fafa110e | ||
|
|
07fc453b74 | ||
|
|
b309044981 | ||
|
|
541e6d4ea3 | ||
|
|
4037b96cc4 | ||
|
|
8e484c4a6f | ||
|
|
dd339563bc | ||
|
|
9567dcc57f | ||
|
|
de104ebeb6 | ||
|
|
eebd95395f | ||
|
|
56265647ff | ||
|
|
756da3719d | ||
|
|
f3008ac7c4 | ||
|
|
c6583d3b83 | ||
|
|
a3d7bac72e | ||
|
|
74b4d53514 | ||
|
|
a08afe0d77 | ||
|
|
ee680aa84c | ||
|
|
caa74064f0 | ||
|
|
abc94c0b26 | ||
|
|
86bcdce07b | ||
|
|
789f5d933d | ||
|
|
156fd2ef5d | ||
|
|
ea036b3a81 | ||
|
|
3daca8b331 | ||
|
|
21a952d2be | ||
|
|
03d331dfb6 | ||
|
|
ef79e1305e | ||
|
|
7c2670d019 | ||
|
|
31f64c0a98 | ||
|
|
28b8986cbe | ||
|
|
b4ff33ce80 | ||
|
|
25fa117712 | ||
|
|
0c9f539e3d | ||
|
|
05bd1afaa6 | ||
|
|
51cb665110 | ||
|
|
47c368e8f2 | ||
|
|
3127360b28 | ||
|
|
5b6def5ff0 | ||
|
|
33d99ad7d4 | ||
|
|
8bd31d39c3 | ||
|
|
a418549525 | ||
|
|
1f849efe1c | ||
|
|
8ad374bb21 | ||
|
|
a69d886565 | ||
|
|
cf58542b4a | ||
|
|
51f166d1d9 | ||
|
|
fbeb031b40 | ||
|
|
095cfc0aab | ||
|
|
e66ab154bc | ||
|
|
91bc1a512c | ||
|
|
8753255026 | ||
|
|
9cf1f13fec | ||
|
|
5d78bae4bb | ||
|
|
27777eecc0 | ||
|
|
1a7e0e8792 | ||
|
|
02b7aa8f33 | ||
|
|
f188d3d08f | ||
|
|
0c924b859e | ||
|
|
c5a5a07462 | ||
|
|
1ff5dd6df0 | ||
|
|
b5f86a488c | ||
|
|
1390b7a964 | ||
|
|
c3e28a9fc0 | ||
|
|
e924429d6e | ||
|
|
7079b1f704 | ||
|
|
40cad365c0 | ||
|
|
6386ab908d | ||
|
|
bb563724c7 | ||
|
|
72924d4486 | ||
|
|
231f8b04b4 | ||
|
|
daa932fee3 | ||
|
|
1b0691f1d5 | ||
|
|
0b6a00bd99 | ||
|
|
4ab98664bb | ||
|
|
31eb5f4d1f | ||
|
|
0ae5d17a06 | ||
|
|
4558d7a3c2 | ||
|
|
4715301240 | ||
|
|
1c58ee23f1 | ||
|
|
2a303d5e4b | ||
|
|
326e7881a6 | ||
|
|
31e8b12674 | ||
|
|
a0431d9435 | ||
|
|
0456b65cc7 | ||
|
|
989b4dd791 | ||
|
|
a76b02fbba | ||
|
|
2d7747738a | ||
|
|
fe0cb04137 | ||
|
|
fe0264f628 | ||
|
|
65396cee32 | ||
|
|
544702b460 | ||
|
|
d8936cdcb5 | ||
|
|
d4b97d6b20 | ||
|
|
5caa14c838 | ||
|
|
0d0848ac67 | ||
|
|
d5334f892f | ||
|
|
36ef5b3bd3 | ||
|
|
6f48b00c88 | ||
|
|
7b744c299e | ||
|
|
154ec56780 | ||
|
|
584aabdf62 | ||
|
|
1b754a6264 | ||
|
|
06a558d797 | ||
|
|
423779d3ff | ||
|
|
78c17a9e7b | ||
|
|
529b9317d0 | ||
|
|
dc838f645b | ||
|
|
7f559c4940 | ||
|
|
acb08dfd90 | ||
|
|
ffe46fd06d | ||
|
|
b419e46b9b | ||
|
|
8fbcdfd515 | ||
|
|
f03f48210c | ||
|
|
742944e2f0 | ||
|
|
c0b491ad78 | ||
|
|
e9abae2a92 | ||
|
|
8229de2f10 | ||
|
|
ab364744b6 | ||
|
|
17ff84fa1f | ||
|
|
bf50baa07d | ||
|
|
7d56da8108 | ||
|
|
16c2df711b | ||
|
|
015f8c3f5c | ||
|
|
ba25701d89 | ||
|
|
a0cb4bb266 | ||
|
|
d6ba7497f9 | ||
|
|
7da931e0a0 | ||
|
|
8f49078eb3 |
No files matched your search
@@ -0,0 +1,3 @@
|
|||||||
|
# These are supported funding model platforms
|
||||||
|
liberapay: Duke_Du
|
||||||
|
patreon: DukeDu
|
||||||
@@ -3,11 +3,11 @@ on:
|
|||||||
push:
|
push:
|
||||||
branches:
|
branches:
|
||||||
- main
|
- main
|
||||||
# - v2
|
- rc
|
||||||
pull_request:
|
pull_request:
|
||||||
branches:
|
branches:
|
||||||
- main
|
- main
|
||||||
# - v2
|
- rc
|
||||||
jobs:
|
jobs:
|
||||||
build:
|
build:
|
||||||
runs-on: ubuntu-latest
|
runs-on: ubuntu-latest
|
||||||
@@ -17,8 +17,10 @@ jobs:
|
|||||||
fetch-depth: 2
|
fetch-depth: 2
|
||||||
- uses: actions/setup-go@v2
|
- uses: actions/setup-go@v2
|
||||||
with:
|
with:
|
||||||
go-version: "1.18"
|
go-version: "1.20"
|
||||||
- name: Run coverage
|
- name: Run coverage
|
||||||
run: go test -v ./... -coverprofile=coverage.txt -covermode=atomic
|
run: go test -v ./... -coverprofile=coverage.txt -covermode=atomic
|
||||||
|
- name: Run govet
|
||||||
|
run: go vet -v ./...
|
||||||
- name: Upload coverage to Codecov
|
- name: Upload coverage to Codecov
|
||||||
run: bash <(curl -s https://codecov.io/bash)
|
run: bash <(curl -s https://codecov.io/bash)
|
||||||
+6
-2
@@ -6,6 +6,10 @@ fileutil/*.txt
|
|||||||
fileutil/*.zip
|
fileutil/*.zip
|
||||||
fileutil/*.link
|
fileutil/*.link
|
||||||
fileutil/unzip/*
|
fileutil/unzip/*
|
||||||
|
fileutil/tempdir/*
|
||||||
slice/testdata/*
|
slice/testdata/*
|
||||||
cryptor/*.pem
|
# cryptor/*.pem
|
||||||
test
|
test
|
||||||
|
docs/node_modules
|
||||||
|
docs/.vitepress/cache
|
||||||
|
docs/.vitepress/dist
|
||||||
@@ -0,0 +1,37 @@
|
|||||||
|
# Lancet Contribution Guide
|
||||||
|
|
||||||
|
Hi! Thank you for choosing Lancet.
|
||||||
|
|
||||||
|
Lancet is a powerful, efficient, and reusable util function library of go. It makes Go dev easier by taking the hassle out of working with concurrency, net, math, slice, string, etc.
|
||||||
|
|
||||||
|
We are excited that you are interested in contributing to lancet. Before submitting your contribution though, please make sure to take a moment and read through the following guidelines.
|
||||||
|
|
||||||
|
## Issue Guidelines
|
||||||
|
|
||||||
|
- Issues are exclusively for bug reports, feature requests and design-related topics. Other questions may be closed directly.
|
||||||
|
|
||||||
|
- Before submitting an issue, please check if similar problems have already been issued.
|
||||||
|
|
||||||
|
- Please specify which version of Lancet and Go you are using, and provide OS information. [Go Playground](https://go.dev/play/) is recommended to build a live demo so that your issue can be reproduced clearly.
|
||||||
|
|
||||||
|
## Pull Request Guidelines
|
||||||
|
|
||||||
|
- Fork this repository to your own account. Do not create branches here.
|
||||||
|
|
||||||
|
- Commit info should be formatted as `type(scope): info about commit`. eg. `fix(package): [scrollbar] fix xxx bug`.
|
||||||
|
|
||||||
|
1. type: type must be one of [chore, docs, feat, fix, refactor, release, test].
|
||||||
|
|
||||||
|
2. scope: scope must be one of [package, file, internal].
|
||||||
|
|
||||||
|
3. header: header must not be longer than 72 characters.
|
||||||
|
|
||||||
|
- Rebase before creating a PR to keep commit history clear.
|
||||||
|
|
||||||
|
- Before submitting a PR, please execute the unit test command: `go test -v ./...` to ensure that all unit test tasks should pass.
|
||||||
|
|
||||||
|
- Make sure PRs are created to `rc` branch instead of other branch.
|
||||||
|
|
||||||
|
- If your PR fixes a bug, please provide a description about the related bug.
|
||||||
|
|
||||||
|
- If the PR is for a new feature, make sure to complete the relevant documentation (/lancet/docs/en/api/packages).
|
||||||
@@ -0,0 +1,37 @@
|
|||||||
|
# Lancet 贡献指南
|
||||||
|
|
||||||
|
Hi! 首先感谢你使用 Lancet。
|
||||||
|
|
||||||
|
lancet(柳叶刀)是一个功能强大、全面、高效、可复用的go语言工具函数库。它消除了处理并发、网络、数学、切片、字符串等的麻烦,使 Go 开发变得更容易。
|
||||||
|
|
||||||
|
Lancet 的成长离不开大家的支持,如果你愿意为 Lancet 贡献代码或提供建议,请阅读以下内容。
|
||||||
|
|
||||||
|
## Issue 规范
|
||||||
|
|
||||||
|
- issue 仅用于提交 Bug 或 Feature 以及设计相关的内容,其它内容可能会被直接关闭。
|
||||||
|
|
||||||
|
- 在提交 issue 之前,请搜索相关内容是否已被提出。
|
||||||
|
|
||||||
|
- 请说明 Lancet 和 Go 的版本号,并提供操作系统信息。推荐使用 [Go Playground](https://go.dev/play/) 生成在线 demo,这能够更直观地重现问题。
|
||||||
|
|
||||||
|
## Pull Request 规范
|
||||||
|
|
||||||
|
- 请先 fork 一份到自己的项目下,不要直接在仓库下建分支。
|
||||||
|
|
||||||
|
- commit 信息要以 `type(scope): 描述信息` 的形式填写,例如 `fix(package): [scrollbar] fix xxx bug`。
|
||||||
|
|
||||||
|
1. type: 必须是 chore, docs, feat, fix, refactor, release, test 其中的一个。
|
||||||
|
|
||||||
|
2. scope: 必须是 package, file, internal 其中的一个。
|
||||||
|
|
||||||
|
3. header: 描述信息不要超过 72 个字符。
|
||||||
|
|
||||||
|
- 提交 PR 前请 rebase,确保 commit 记录的整洁。
|
||||||
|
|
||||||
|
- 提交 PR 前请执行单元测试命令:go test -v ./...,确保所有单元测试任务通过。
|
||||||
|
|
||||||
|
- 确保 PR 是提交到 `rc` 分支,而不是其他分支。
|
||||||
|
|
||||||
|
- 如果是修复 bug,请在 PR 中给出描述信息。
|
||||||
|
|
||||||
|
- 如果PR是新功能,确保完成相关文档(/lancet/docs/api/packages)。
|
||||||
+2261
-1373
File diff suppressed because it is too large.
Load diff
@@ -44,7 +44,7 @@ func (l *LRUCache[K, V]) Get(key K) (V, bool) {
|
|||||||
|
|
||||||
node, ok := l.cache[key]
|
node, ok := l.cache[key]
|
||||||
if ok {
|
if ok {
|
||||||
l.moveToHead(node)
|
l.moveToTail(node)
|
||||||
return node.value, true
|
return node.value, true
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -66,7 +66,7 @@ func (l *LRUCache[K, V]) Put(key K, value V) {
|
|||||||
}
|
}
|
||||||
} else {
|
} else {
|
||||||
node.value = value
|
node.value = value
|
||||||
l.moveToHead(node)
|
l.moveToTail(node)
|
||||||
}
|
}
|
||||||
l.length = len(l.cache)
|
l.length = len(l.cache)
|
||||||
}
|
}
|
||||||
@@ -77,9 +77,10 @@ func (l *LRUCache[K, V]) Delete(key K) bool {
|
|||||||
if ok {
|
if ok {
|
||||||
key := l.deleteNode(node)
|
key := l.deleteNode(node)
|
||||||
delete(l.cache, key)
|
delete(l.cache, key)
|
||||||
|
l.length = len(l.cache)
|
||||||
return true
|
return true
|
||||||
}
|
}
|
||||||
|
l.length = len(l.cache)
|
||||||
return false
|
return false
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -112,7 +113,7 @@ func (l *LRUCache[K, V]) deleteNode(node *lruNode[K, V]) K {
|
|||||||
return node.key
|
return node.key
|
||||||
}
|
}
|
||||||
|
|
||||||
func (l *LRUCache[K, V]) moveToHead(node *lruNode[K, V]) {
|
func (l *LRUCache[K, V]) moveToTail(node *lruNode[K, V]) {
|
||||||
if l.tail == node {
|
if l.tail == node {
|
||||||
return
|
return
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -7,7 +7,8 @@ import (
|
|||||||
)
|
)
|
||||||
|
|
||||||
func TestLRUCache(t *testing.T) {
|
func TestLRUCache(t *testing.T) {
|
||||||
asssert := internal.NewAssert(t, "TestLRUCache")
|
t.Parallel()
|
||||||
|
assert := internal.NewAssert(t, "TestLRUCache")
|
||||||
|
|
||||||
cache := NewLRUCache[int, int](3)
|
cache := NewLRUCache[int, int](3)
|
||||||
|
|
||||||
@@ -15,19 +16,43 @@ func TestLRUCache(t *testing.T) {
|
|||||||
cache.Put(2, 2)
|
cache.Put(2, 2)
|
||||||
cache.Put(3, 3)
|
cache.Put(3, 3)
|
||||||
|
|
||||||
asssert.Equal(3, cache.Len())
|
assert.Equal(3, cache.Len())
|
||||||
|
|
||||||
v, ok := cache.Get(1)
|
v, ok := cache.Get(1)
|
||||||
asssert.Equal(true, ok)
|
assert.Equal(true, ok)
|
||||||
asssert.Equal(1, v)
|
assert.Equal(1, v)
|
||||||
|
|
||||||
v, ok = cache.Get(2)
|
v, ok = cache.Get(2)
|
||||||
asssert.Equal(true, ok)
|
assert.Equal(true, ok)
|
||||||
asssert.Equal(2, v)
|
assert.Equal(2, v)
|
||||||
|
|
||||||
ok = cache.Delete(2)
|
ok = cache.Delete(2)
|
||||||
asssert.Equal(true, ok)
|
assert.Equal(true, ok)
|
||||||
|
|
||||||
_, ok = cache.Get(2)
|
_, ok = cache.Get(2)
|
||||||
asssert.Equal(false, ok)
|
assert.Equal(false, ok)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestLRUCacheDeleteLen(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
cache := NewLRUCache[int, int](3)
|
||||||
|
for key := 1; key <= 3; key++ {
|
||||||
|
cache.Put(key, key)
|
||||||
|
}
|
||||||
|
|
||||||
|
for _, key := range []int{2, 1, 3} {
|
||||||
|
before := cache.Len()
|
||||||
|
if !cache.Delete(key) {
|
||||||
|
t.Fatalf("Delete(%d) = false, want true", key)
|
||||||
|
}
|
||||||
|
if got := cache.Len(); got != before-1 {
|
||||||
|
t.Fatalf("Len() after Delete(%d) = %d, want %d", key, got, before-1)
|
||||||
|
}
|
||||||
|
if cache.Delete(key) {
|
||||||
|
t.Fatalf("Delete(%d) = true for a missing key", key)
|
||||||
|
}
|
||||||
|
if got := cache.Len(); got != before-1 {
|
||||||
|
t.Fatalf("Len() after missing Delete(%d) = %d, want %d", key, got, before-1)
|
||||||
|
}
|
||||||
|
}
|
||||||
}
|
}
|
||||||
+6
-3
@@ -4,7 +4,7 @@
|
|||||||
// Package algorithm contain some basic algorithm functions. eg. sort, search, list, linklist, stack, queue, tree, graph.
|
// Package algorithm contain some basic algorithm functions. eg. sort, search, list, linklist, stack, queue, tree, graph.
|
||||||
package algorithm
|
package algorithm
|
||||||
|
|
||||||
import "github.com/duke-git/lancet/v2/lancetconstraints"
|
import "github.com/duke-git/lancet/v2/constraints"
|
||||||
|
|
||||||
// Search algorithms see https://github.com/TheAlgorithms/Go/tree/master/search
|
// Search algorithms see https://github.com/TheAlgorithms/Go/tree/master/search
|
||||||
|
|
||||||
@@ -23,7 +23,7 @@ func LinearSearch[T any](slice []T, target T, equal func(a, b T) bool) int {
|
|||||||
// BinarySearch return the index of target within a sorted slice, use binary search (recursive call itself).
|
// BinarySearch return the index of target within a sorted slice, use binary search (recursive call itself).
|
||||||
// If not found return -1.
|
// If not found return -1.
|
||||||
// Play: https://go.dev/play/p/t6MeGiUSN47
|
// Play: https://go.dev/play/p/t6MeGiUSN47
|
||||||
func BinarySearch[T any](sortedSlice []T, target T, lowIndex, highIndex int, comparator lancetconstraints.Comparator) int {
|
func BinarySearch[T any](sortedSlice []T, target T, lowIndex, highIndex int, comparator constraints.Comparator) int {
|
||||||
if highIndex < lowIndex || len(sortedSlice) == 0 {
|
if highIndex < lowIndex || len(sortedSlice) == 0 {
|
||||||
return -1
|
return -1
|
||||||
}
|
}
|
||||||
@@ -44,7 +44,10 @@ func BinarySearch[T any](sortedSlice []T, target T, lowIndex, highIndex int, com
|
|||||||
// BinaryIterativeSearch return the index of target within a sorted slice, use binary search (no recursive).
|
// BinaryIterativeSearch return the index of target within a sorted slice, use binary search (no recursive).
|
||||||
// If not found return -1.
|
// If not found return -1.
|
||||||
// Play: https://go.dev/play/p/Anozfr8ZLH3
|
// Play: https://go.dev/play/p/Anozfr8ZLH3
|
||||||
func BinaryIterativeSearch[T any](sortedSlice []T, target T, lowIndex, highIndex int, comparator lancetconstraints.Comparator) int {
|
func BinaryIterativeSearch[T any](sortedSlice []T, target T, lowIndex, highIndex int, comparator constraints.Comparator) int {
|
||||||
|
if len(sortedSlice) == 0 {
|
||||||
|
return -1
|
||||||
|
}
|
||||||
startIndex := lowIndex
|
startIndex := lowIndex
|
||||||
endIndex := highIndex
|
endIndex := highIndex
|
||||||
|
|
||||||
|
|||||||
@@ -0,0 +1,11 @@
|
|||||||
|
package algorithm
|
||||||
|
|
||||||
|
import "testing"
|
||||||
|
|
||||||
|
func TestBinaryIterativeSearchEmpty(t *testing.T) {
|
||||||
|
for _, source := range [][]int{nil, {}} {
|
||||||
|
if got := BinaryIterativeSearch(source, 1, 0, 0, &intComparator{}); got != -1 {
|
||||||
|
t.Errorf("got %d, want -1", got)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
@@ -7,33 +7,35 @@ import (
|
|||||||
)
|
)
|
||||||
|
|
||||||
func TestLinearSearch(t *testing.T) {
|
func TestLinearSearch(t *testing.T) {
|
||||||
asssert := internal.NewAssert(t, "TestLinearSearch")
|
t.Parallel()
|
||||||
|
assert := internal.NewAssert(t, "TestLinearSearch")
|
||||||
|
|
||||||
numbers := []int{3, 4, 5, 3, 2, 1}
|
numbers := []int{3, 4, 5, 3, 2, 1}
|
||||||
equalFunc := func(a, b int) bool {
|
equalFunc := func(a, b int) bool {
|
||||||
return a == b
|
return a == b
|
||||||
}
|
}
|
||||||
|
|
||||||
asssert.Equal(0, LinearSearch(numbers, 3, equalFunc))
|
assert.Equal(0, LinearSearch(numbers, 3, equalFunc))
|
||||||
asssert.Equal(-1, LinearSearch(numbers, 6, equalFunc))
|
assert.Equal(-1, LinearSearch(numbers, 6, equalFunc))
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestBinarySearch(t *testing.T) {
|
func TestBinarySearch(t *testing.T) {
|
||||||
asssert := internal.NewAssert(t, "TestBinarySearch")
|
t.Parallel()
|
||||||
|
assert := internal.NewAssert(t, "TestBinarySearch")
|
||||||
|
|
||||||
sortedNumbers := []int{1, 2, 3, 4, 5, 6, 7, 8}
|
sortedNumbers := []int{1, 2, 3, 4, 5, 6, 7, 8}
|
||||||
comparator := &intComparator{}
|
comparator := &intComparator{}
|
||||||
|
|
||||||
asssert.Equal(4, BinarySearch(sortedNumbers, 5, 0, len(sortedNumbers)-1, comparator))
|
assert.Equal(4, BinarySearch(sortedNumbers, 5, 0, len(sortedNumbers)-1, comparator))
|
||||||
asssert.Equal(-1, BinarySearch(sortedNumbers, 9, 0, len(sortedNumbers)-1, comparator))
|
assert.Equal(-1, BinarySearch(sortedNumbers, 9, 0, len(sortedNumbers)-1, comparator))
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestBinaryIterativeSearch(t *testing.T) {
|
func TestBinaryIterativeSearch(t *testing.T) {
|
||||||
asssert := internal.NewAssert(t, "TestBinaryIterativeSearch")
|
assert := internal.NewAssert(t, "TestBinaryIterativeSearch")
|
||||||
|
|
||||||
sortedNumbers := []int{1, 2, 3, 4, 5, 6, 7, 8}
|
sortedNumbers := []int{1, 2, 3, 4, 5, 6, 7, 8}
|
||||||
comparator := &intComparator{}
|
comparator := &intComparator{}
|
||||||
|
|
||||||
asssert.Equal(4, BinaryIterativeSearch(sortedNumbers, 5, 0, len(sortedNumbers)-1, comparator))
|
assert.Equal(4, BinaryIterativeSearch(sortedNumbers, 5, 0, len(sortedNumbers)-1, comparator))
|
||||||
asssert.Equal(-1, BinaryIterativeSearch(sortedNumbers, 9, 0, len(sortedNumbers)-1, comparator))
|
assert.Equal(-1, BinaryIterativeSearch(sortedNumbers, 9, 0, len(sortedNumbers)-1, comparator))
|
||||||
}
|
}
|
||||||
+21
-15
@@ -3,24 +3,29 @@
|
|||||||
|
|
||||||
package algorithm
|
package algorithm
|
||||||
|
|
||||||
import "github.com/duke-git/lancet/v2/lancetconstraints"
|
import "github.com/duke-git/lancet/v2/constraints"
|
||||||
|
|
||||||
// BubbleSort applys the bubble sort algorithm to sort the collection, will change the original collection data.
|
// BubbleSort applys the bubble sort algorithm to sort the collection, will change the original collection data.
|
||||||
// Play: https://go.dev/play/p/GNdv7Jg2Taj
|
// Play: https://go.dev/play/p/GNdv7Jg2Taj
|
||||||
func BubbleSort[T any](slice []T, comparator lancetconstraints.Comparator) {
|
func BubbleSort[T any](slice []T, comparator constraints.Comparator) {
|
||||||
for i := 0; i < len(slice); i++ {
|
for i := 0; i < len(slice); i++ {
|
||||||
|
breakTag := false
|
||||||
for j := 0; j < len(slice)-1-i; j++ {
|
for j := 0; j < len(slice)-1-i; j++ {
|
||||||
isCurrGreatThanNext := comparator.Compare(slice[j], slice[j+1]) == 1
|
isCurrGreatThanNext := comparator.Compare(slice[j], slice[j+1]) == 1
|
||||||
if isCurrGreatThanNext {
|
if isCurrGreatThanNext {
|
||||||
swap(slice, j, j+1)
|
swap(slice, j, j+1)
|
||||||
|
breakTag = true
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
if !breakTag {
|
||||||
|
break
|
||||||
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// InsertionSort applys the insertion sort algorithm to sort the collection, will change the original collection data.
|
// InsertionSort applys the insertion sort algorithm to sort the collection, will change the original collection data.
|
||||||
// Play: https://go.dev/play/p/G5LJiWgJJW6
|
// Play: https://go.dev/play/p/G5LJiWgJJW6
|
||||||
func InsertionSort[T any](slice []T, comparator lancetconstraints.Comparator) {
|
func InsertionSort[T any](slice []T, comparator constraints.Comparator) {
|
||||||
for i := 0; i < len(slice); i++ {
|
for i := 0; i < len(slice); i++ {
|
||||||
for j := i; j > 0; j-- {
|
for j := i; j > 0; j-- {
|
||||||
isPreLessThanCurrent := comparator.Compare(slice[j], slice[j-1]) == -1
|
isPreLessThanCurrent := comparator.Compare(slice[j], slice[j-1]) == -1
|
||||||
@@ -35,7 +40,7 @@ func InsertionSort[T any](slice []T, comparator lancetconstraints.Comparator) {
|
|||||||
|
|
||||||
// SelectionSort applys the selection sort algorithm to sort the collection, will change the original collection data.
|
// SelectionSort applys the selection sort algorithm to sort the collection, will change the original collection data.
|
||||||
// Play: https://go.dev/play/p/oXovbkekayS
|
// Play: https://go.dev/play/p/oXovbkekayS
|
||||||
func SelectionSort[T any](slice []T, comparator lancetconstraints.Comparator) {
|
func SelectionSort[T any](slice []T, comparator constraints.Comparator) {
|
||||||
for i := 0; i < len(slice); i++ {
|
for i := 0; i < len(slice); i++ {
|
||||||
min := i
|
min := i
|
||||||
for j := i + 1; j < len(slice); j++ {
|
for j := i + 1; j < len(slice); j++ {
|
||||||
@@ -49,7 +54,7 @@ func SelectionSort[T any](slice []T, comparator lancetconstraints.Comparator) {
|
|||||||
|
|
||||||
// ShellSort applys the shell sort algorithm to sort the collection, will change the original collection data.
|
// ShellSort applys the shell sort algorithm to sort the collection, will change the original collection data.
|
||||||
// Play: https://go.dev/play/p/3ibkszpJEu3
|
// Play: https://go.dev/play/p/3ibkszpJEu3
|
||||||
func ShellSort[T any](slice []T, comparator lancetconstraints.Comparator) {
|
func ShellSort[T any](slice []T, comparator constraints.Comparator) {
|
||||||
size := len(slice)
|
size := len(slice)
|
||||||
|
|
||||||
gap := 1
|
gap := 1
|
||||||
@@ -69,11 +74,11 @@ func ShellSort[T any](slice []T, comparator lancetconstraints.Comparator) {
|
|||||||
|
|
||||||
// QuickSort quick sorting for slice, lowIndex is 0 and highIndex is len(slice)-1.
|
// QuickSort quick sorting for slice, lowIndex is 0 and highIndex is len(slice)-1.
|
||||||
// Play: https://go.dev/play/p/7Y7c1Elk3ax
|
// Play: https://go.dev/play/p/7Y7c1Elk3ax
|
||||||
func QuickSort[T any](slice []T, comparator lancetconstraints.Comparator) {
|
func QuickSort[T any](slice []T, comparator constraints.Comparator) {
|
||||||
quickSort(slice, 0, len(slice)-1, comparator)
|
quickSort(slice, 0, len(slice)-1, comparator)
|
||||||
}
|
}
|
||||||
|
|
||||||
func quickSort[T any](slice []T, lowIndex, highIndex int, comparator lancetconstraints.Comparator) {
|
func quickSort[T any](slice []T, lowIndex, highIndex int, comparator constraints.Comparator) {
|
||||||
if lowIndex < highIndex {
|
if lowIndex < highIndex {
|
||||||
p := partition(slice, lowIndex, highIndex, comparator)
|
p := partition(slice, lowIndex, highIndex, comparator)
|
||||||
quickSort(slice, lowIndex, p-1, comparator)
|
quickSort(slice, lowIndex, p-1, comparator)
|
||||||
@@ -82,7 +87,7 @@ func quickSort[T any](slice []T, lowIndex, highIndex int, comparator lancetconst
|
|||||||
}
|
}
|
||||||
|
|
||||||
// partition split slice into two parts
|
// partition split slice into two parts
|
||||||
func partition[T any](slice []T, lowIndex, highIndex int, comparator lancetconstraints.Comparator) int {
|
func partition[T any](slice []T, lowIndex, highIndex int, comparator constraints.Comparator) int {
|
||||||
p := slice[highIndex]
|
p := slice[highIndex]
|
||||||
i := lowIndex
|
i := lowIndex
|
||||||
for j := lowIndex; j < highIndex; j++ {
|
for j := lowIndex; j < highIndex; j++ {
|
||||||
@@ -99,7 +104,7 @@ func partition[T any](slice []T, lowIndex, highIndex int, comparator lancetconst
|
|||||||
|
|
||||||
// HeapSort applys the heap sort algorithm to sort the collection, will change the original collection data.
|
// HeapSort applys the heap sort algorithm to sort the collection, will change the original collection data.
|
||||||
// Play: https://go.dev/play/p/u6Iwa1VZS_f
|
// Play: https://go.dev/play/p/u6Iwa1VZS_f
|
||||||
func HeapSort[T any](slice []T, comparator lancetconstraints.Comparator) {
|
func HeapSort[T any](slice []T, comparator constraints.Comparator) {
|
||||||
size := len(slice)
|
size := len(slice)
|
||||||
|
|
||||||
for i := size/2 - 1; i >= 0; i-- {
|
for i := size/2 - 1; i >= 0; i-- {
|
||||||
@@ -111,7 +116,7 @@ func HeapSort[T any](slice []T, comparator lancetconstraints.Comparator) {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
func sift[T any](slice []T, lowIndex, highIndex int, comparator lancetconstraints.Comparator) {
|
func sift[T any](slice []T, lowIndex, highIndex int, comparator constraints.Comparator) {
|
||||||
i := lowIndex
|
i := lowIndex
|
||||||
j := 2*i + 1
|
j := 2*i + 1
|
||||||
|
|
||||||
@@ -133,11 +138,11 @@ func sift[T any](slice []T, lowIndex, highIndex int, comparator lancetconstraint
|
|||||||
|
|
||||||
// MergeSort applys the merge sort algorithm to sort the collection, will change the original collection data.
|
// MergeSort applys the merge sort algorithm to sort the collection, will change the original collection data.
|
||||||
// Play: https://go.dev/play/p/ydinn9YzUJn
|
// Play: https://go.dev/play/p/ydinn9YzUJn
|
||||||
func MergeSort[T any](slice []T, comparator lancetconstraints.Comparator) {
|
func MergeSort[T any](slice []T, comparator constraints.Comparator) {
|
||||||
mergeSort(slice, 0, len(slice)-1, comparator)
|
mergeSort(slice, 0, len(slice)-1, comparator)
|
||||||
}
|
}
|
||||||
|
|
||||||
func mergeSort[T any](slice []T, lowIndex, highIndex int, comparator lancetconstraints.Comparator) {
|
func mergeSort[T any](slice []T, lowIndex, highIndex int, comparator constraints.Comparator) {
|
||||||
if lowIndex < highIndex {
|
if lowIndex < highIndex {
|
||||||
mid := (lowIndex + highIndex) / 2
|
mid := (lowIndex + highIndex) / 2
|
||||||
mergeSort(slice, lowIndex, mid, comparator)
|
mergeSort(slice, lowIndex, mid, comparator)
|
||||||
@@ -146,7 +151,7 @@ func mergeSort[T any](slice []T, lowIndex, highIndex int, comparator lancetconst
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
func merge[T any](slice []T, lowIndex, midIndex, highIndex int, comparator lancetconstraints.Comparator) {
|
func merge[T any](slice []T, lowIndex, midIndex, highIndex int, comparator constraints.Comparator) {
|
||||||
i := lowIndex
|
i := lowIndex
|
||||||
j := midIndex + 1
|
j := midIndex + 1
|
||||||
temp := []T{}
|
temp := []T{}
|
||||||
@@ -175,7 +180,7 @@ func merge[T any](slice []T, lowIndex, midIndex, highIndex int, comparator lance
|
|||||||
|
|
||||||
// CountSort applys the count sort algorithm to sort the collection, don't change the original collection data.
|
// CountSort applys the count sort algorithm to sort the collection, don't change the original collection data.
|
||||||
// Play: https://go.dev/play/p/tB-Umgm0DrP
|
// Play: https://go.dev/play/p/tB-Umgm0DrP
|
||||||
func CountSort[T any](slice []T, comparator lancetconstraints.Comparator) []T {
|
func CountSort[T any](slice []T, comparator constraints.Comparator) []T {
|
||||||
size := len(slice)
|
size := len(slice)
|
||||||
out := make([]T, size)
|
out := make([]T, size)
|
||||||
|
|
||||||
@@ -183,7 +188,8 @@ func CountSort[T any](slice []T, comparator lancetconstraints.Comparator) []T {
|
|||||||
count := 0
|
count := 0
|
||||||
for j := 0; j < size; j++ {
|
for j := 0; j < size; j++ {
|
||||||
//slice[i] > slice[j]
|
//slice[i] > slice[j]
|
||||||
if comparator.Compare(slice[i], slice[j]) == 1 {
|
order := comparator.Compare(slice[i], slice[j])
|
||||||
|
if order == 1 || (order == 0 && j < i) {
|
||||||
count++
|
count++
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|||||||
+31
-19
@@ -16,7 +16,7 @@ type people struct {
|
|||||||
// PeopleAageComparator sort people slice by age field
|
// PeopleAageComparator sort people slice by age field
|
||||||
type peopleAgeComparator struct{}
|
type peopleAgeComparator struct{}
|
||||||
|
|
||||||
// Compare implements github.com/duke-git/lancet/v2/lancetconstraints/constraints.go/Comparator
|
// Compare implements github.com/duke-git/lancet/v2/constraints/constraints.go/Comparator
|
||||||
func (pc *peopleAgeComparator) Compare(v1 any, v2 any) int {
|
func (pc *peopleAgeComparator) Compare(v1 any, v2 any) int {
|
||||||
p1, _ := v1.(people)
|
p1, _ := v1.(people)
|
||||||
p2, _ := v2.(people)
|
p2, _ := v2.(people)
|
||||||
@@ -46,7 +46,8 @@ func (c *intComparator) Compare(v1 any, v2 any) int {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestBubbleSortForStructSlice(t *testing.T) {
|
func TestBubbleSortForStructSlice(t *testing.T) {
|
||||||
asssert := internal.NewAssert(t, "TestBubbleSortForStructSlice")
|
t.Parallel()
|
||||||
|
assert := internal.NewAssert(t, "TestBubbleSortForStructSlice")
|
||||||
|
|
||||||
peoples := []people{
|
peoples := []people{
|
||||||
{Name: "a", Age: 20},
|
{Name: "a", Age: 20},
|
||||||
@@ -61,21 +62,23 @@ func TestBubbleSortForStructSlice(t *testing.T) {
|
|||||||
expected := "[{d 8} {b 10} {c 17} {a 20} {e 28}]"
|
expected := "[{d 8} {b 10} {c 17} {a 20} {e 28}]"
|
||||||
actual := fmt.Sprintf("%v", peoples)
|
actual := fmt.Sprintf("%v", peoples)
|
||||||
|
|
||||||
asssert.Equal(expected, actual)
|
assert.Equal(expected, actual)
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestBubbleSortForIntSlice(t *testing.T) {
|
func TestBubbleSortForIntSlice(t *testing.T) {
|
||||||
asssert := internal.NewAssert(t, "TestBubbleSortForIntSlice")
|
t.Parallel()
|
||||||
|
assert := internal.NewAssert(t, "TestBubbleSortForIntSlice")
|
||||||
|
|
||||||
numbers := []int{2, 1, 5, 3, 6, 4}
|
numbers := []int{2, 1, 5, 3, 6, 4}
|
||||||
comparator := &intComparator{}
|
comparator := &intComparator{}
|
||||||
BubbleSort(numbers, comparator)
|
BubbleSort(numbers, comparator)
|
||||||
|
|
||||||
asssert.Equal([]int{1, 2, 3, 4, 5, 6}, numbers)
|
assert.Equal([]int{1, 2, 3, 4, 5, 6}, numbers)
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestInsertionSort(t *testing.T) {
|
func TestInsertionSort(t *testing.T) {
|
||||||
asssert := internal.NewAssert(t, "TestInsertionSort")
|
t.Parallel()
|
||||||
|
assert := internal.NewAssert(t, "TestInsertionSort")
|
||||||
|
|
||||||
peoples := []people{
|
peoples := []people{
|
||||||
{Name: "a", Age: 20},
|
{Name: "a", Age: 20},
|
||||||
@@ -90,11 +93,12 @@ func TestInsertionSort(t *testing.T) {
|
|||||||
expected := "[{d 8} {b 10} {c 17} {a 20} {e 28}]"
|
expected := "[{d 8} {b 10} {c 17} {a 20} {e 28}]"
|
||||||
actual := fmt.Sprintf("%v", peoples)
|
actual := fmt.Sprintf("%v", peoples)
|
||||||
|
|
||||||
asssert.Equal(expected, actual)
|
assert.Equal(expected, actual)
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestSelectionSort(t *testing.T) {
|
func TestSelectionSort(t *testing.T) {
|
||||||
asssert := internal.NewAssert(t, "TestSelectionSort")
|
t.Parallel()
|
||||||
|
assert := internal.NewAssert(t, "TestSelectionSort")
|
||||||
|
|
||||||
peoples := []people{
|
peoples := []people{
|
||||||
{Name: "a", Age: 20},
|
{Name: "a", Age: 20},
|
||||||
@@ -109,11 +113,12 @@ func TestSelectionSort(t *testing.T) {
|
|||||||
expected := "[{d 8} {b 10} {c 17} {a 20} {e 28}]"
|
expected := "[{d 8} {b 10} {c 17} {a 20} {e 28}]"
|
||||||
actual := fmt.Sprintf("%v", peoples)
|
actual := fmt.Sprintf("%v", peoples)
|
||||||
|
|
||||||
asssert.Equal(expected, actual)
|
assert.Equal(expected, actual)
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestShellSort(t *testing.T) {
|
func TestShellSort(t *testing.T) {
|
||||||
asssert := internal.NewAssert(t, "TestShellSort")
|
t.Parallel()
|
||||||
|
assert := internal.NewAssert(t, "TestShellSort")
|
||||||
|
|
||||||
peoples := []people{
|
peoples := []people{
|
||||||
{Name: "a", Age: 20},
|
{Name: "a", Age: 20},
|
||||||
@@ -128,11 +133,12 @@ func TestShellSort(t *testing.T) {
|
|||||||
expected := "[{d 8} {b 10} {c 17} {a 20} {e 28}]"
|
expected := "[{d 8} {b 10} {c 17} {a 20} {e 28}]"
|
||||||
actual := fmt.Sprintf("%v", peoples)
|
actual := fmt.Sprintf("%v", peoples)
|
||||||
|
|
||||||
asssert.Equal(expected, actual)
|
assert.Equal(expected, actual)
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestQuickSort(t *testing.T) {
|
func TestQuickSort(t *testing.T) {
|
||||||
asssert := internal.NewAssert(t, "TestQuickSort")
|
t.Parallel()
|
||||||
|
assert := internal.NewAssert(t, "TestQuickSort")
|
||||||
|
|
||||||
peoples := []people{
|
peoples := []people{
|
||||||
{Name: "a", Age: 20},
|
{Name: "a", Age: 20},
|
||||||
@@ -147,11 +153,12 @@ func TestQuickSort(t *testing.T) {
|
|||||||
expected := "[{d 8} {b 10} {c 17} {a 20} {e 28}]"
|
expected := "[{d 8} {b 10} {c 17} {a 20} {e 28}]"
|
||||||
actual := fmt.Sprintf("%v", peoples)
|
actual := fmt.Sprintf("%v", peoples)
|
||||||
|
|
||||||
asssert.Equal(expected, actual)
|
assert.Equal(expected, actual)
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestHeapSort(t *testing.T) {
|
func TestHeapSort(t *testing.T) {
|
||||||
asssert := internal.NewAssert(t, "TestHeapSort")
|
t.Parallel()
|
||||||
|
assert := internal.NewAssert(t, "TestHeapSort")
|
||||||
|
|
||||||
peoples := []people{
|
peoples := []people{
|
||||||
{Name: "a", Age: 20},
|
{Name: "a", Age: 20},
|
||||||
@@ -166,11 +173,12 @@ func TestHeapSort(t *testing.T) {
|
|||||||
expected := "[{d 8} {b 10} {c 17} {a 20} {e 28}]"
|
expected := "[{d 8} {b 10} {c 17} {a 20} {e 28}]"
|
||||||
actual := fmt.Sprintf("%v", peoples)
|
actual := fmt.Sprintf("%v", peoples)
|
||||||
|
|
||||||
asssert.Equal(expected, actual)
|
assert.Equal(expected, actual)
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestMergeSort(t *testing.T) {
|
func TestMergeSort(t *testing.T) {
|
||||||
asssert := internal.NewAssert(t, "TestMergeSort")
|
t.Parallel()
|
||||||
|
assert := internal.NewAssert(t, "TestMergeSort")
|
||||||
|
|
||||||
peoples := []people{
|
peoples := []people{
|
||||||
{Name: "a", Age: 20},
|
{Name: "a", Age: 20},
|
||||||
@@ -185,11 +193,15 @@ func TestMergeSort(t *testing.T) {
|
|||||||
expected := "[{d 8} {b 10} {c 17} {a 20} {e 28}]"
|
expected := "[{d 8} {b 10} {c 17} {a 20} {e 28}]"
|
||||||
actual := fmt.Sprintf("%v", peoples)
|
actual := fmt.Sprintf("%v", peoples)
|
||||||
|
|
||||||
asssert.Equal(expected, actual)
|
assert.Equal(expected, actual)
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestCountSort(t *testing.T) {
|
func TestCountSort(t *testing.T) {
|
||||||
asssert := internal.NewAssert(t, "TestCountSort")
|
t.Parallel()
|
||||||
|
assert := internal.NewAssert(t, "TestCountSort")
|
||||||
|
assert.Equal([]int{1, 2, 2}, CountSort([]int{2, 1, 2}, &intComparator{}))
|
||||||
|
assert.Equal([]people{{"young", 10}, {"first", 20}, {"second", 20}},
|
||||||
|
CountSort([]people{{"first", 20}, {"young", 10}, {"second", 20}}, &peopleAgeComparator{}))
|
||||||
|
|
||||||
peoples := []people{
|
peoples := []people{
|
||||||
{Name: "a", Age: 20},
|
{Name: "a", Age: 20},
|
||||||
@@ -204,5 +216,5 @@ func TestCountSort(t *testing.T) {
|
|||||||
expected := "[{d 8} {b 10} {c 17} {a 20} {e 28}]"
|
expected := "[{d 8} {b 10} {c 17} {a 20} {e 28}]"
|
||||||
actual := fmt.Sprintf("%v", sortedPeopleByAge)
|
actual := fmt.Sprintf("%v", sortedPeopleByAge)
|
||||||
|
|
||||||
asssert.Equal(expected, actual)
|
assert.Equal(expected, actual)
|
||||||
}
|
}
|
||||||
@@ -10,6 +10,8 @@ import (
|
|||||||
"time"
|
"time"
|
||||||
|
|
||||||
"github.com/duke-git/lancet/v2/convertor"
|
"github.com/duke-git/lancet/v2/convertor"
|
||||||
|
"github.com/duke-git/lancet/v2/mathutil"
|
||||||
|
"golang.org/x/exp/constraints"
|
||||||
)
|
)
|
||||||
|
|
||||||
// operator type
|
// operator type
|
||||||
@@ -62,3 +64,9 @@ func LessOrEqual(left, right any) bool {
|
|||||||
func GreaterOrEqual(left, right any) bool {
|
func GreaterOrEqual(left, right any) bool {
|
||||||
return compareValue(greaterOrEqual, left, right)
|
return compareValue(greaterOrEqual, left, right)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// InDelta checks if two values are equal or not within a delta.
|
||||||
|
// Play: https://go.dev/play/p/TuDdcNtMkjo
|
||||||
|
func InDelta[T constraints.Integer | constraints.Float](left, right T, delta float64) bool {
|
||||||
|
return float64(mathutil.Abs(left-right)) <= delta
|
||||||
|
}
|
||||||
@@ -168,3 +168,29 @@ func ExampleGreaterOrEqual() {
|
|||||||
// false
|
// false
|
||||||
// false
|
// false
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func ExampleInDelta() {
|
||||||
|
result1 := InDelta(1, 1, 0)
|
||||||
|
result2 := InDelta(1, 2, 0)
|
||||||
|
|
||||||
|
result3 := InDelta(2.0/3.0, 0.66667, 0.001)
|
||||||
|
result4 := InDelta(2.0/3.0, 0.0, 0.001)
|
||||||
|
|
||||||
|
result5 := InDelta(float64(74.96)-float64(20.48), 54.48, 0)
|
||||||
|
result6 := InDelta(float64(74.96)-float64(20.48), 54.48, 1e-14)
|
||||||
|
|
||||||
|
fmt.Println(result1)
|
||||||
|
fmt.Println(result2)
|
||||||
|
fmt.Println(result3)
|
||||||
|
fmt.Println(result4)
|
||||||
|
fmt.Println(result5)
|
||||||
|
fmt.Println(result6)
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// true
|
||||||
|
// false
|
||||||
|
// true
|
||||||
|
// false
|
||||||
|
// false
|
||||||
|
// true
|
||||||
|
}
|
||||||
+111
-143
@@ -3,6 +3,7 @@ package compare
|
|||||||
import (
|
import (
|
||||||
"bytes"
|
"bytes"
|
||||||
"encoding/json"
|
"encoding/json"
|
||||||
|
"math/big"
|
||||||
"reflect"
|
"reflect"
|
||||||
"time"
|
"time"
|
||||||
|
|
||||||
@@ -24,6 +25,13 @@ func compareValue(operator string, left, right any) bool {
|
|||||||
|
|
||||||
case reflect.Struct, reflect.Slice, reflect.Map:
|
case reflect.Struct, reflect.Slice, reflect.Map:
|
||||||
return compareRefValue(operator, left, right, leftType.Kind())
|
return compareRefValue(operator, left, right, leftType.Kind())
|
||||||
|
|
||||||
|
case reflect.Ptr:
|
||||||
|
if leftVal, ok := left.(*big.Int); ok {
|
||||||
|
if rightVal, ok := right.(*big.Int); ok {
|
||||||
|
return compareBigInt(operator, leftVal, rightVal)
|
||||||
|
}
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
return false
|
return false
|
||||||
@@ -70,7 +78,7 @@ func compareRefValue(operator string, leftObj, rightObj any, kind reflect.Kind)
|
|||||||
|
|
||||||
switch operator {
|
switch operator {
|
||||||
case equal:
|
case equal:
|
||||||
if bytes.Compare(bytesObj1, bytesObj2) == 0 {
|
if bytes.Equal(bytesObj1, bytesObj2) {
|
||||||
return true
|
return true
|
||||||
}
|
}
|
||||||
case lessThan:
|
case lessThan:
|
||||||
@@ -155,169 +163,129 @@ func compareBasicValue(operator string, leftValue, rightValue any) bool {
|
|||||||
}
|
}
|
||||||
|
|
||||||
switch leftVal := leftValue.(type) {
|
switch leftVal := leftValue.(type) {
|
||||||
case json.Number:
|
case int, uint, int8, uint8, int16, uint16, int32, uint32, int64, uint64:
|
||||||
if left, err := leftVal.Float64(); err == nil {
|
left, err := convertor.ToBigInt(leftValue)
|
||||||
switch rightVal := rightValue.(type) {
|
if err != nil {
|
||||||
case json.Number:
|
return false
|
||||||
if right, err := rightVal.Float64(); err == nil {
|
|
||||||
switch operator {
|
|
||||||
case equal:
|
|
||||||
if left == right {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
case lessThan:
|
|
||||||
if left < right {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
case greaterThan:
|
|
||||||
if left > right {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
case lessOrEqual:
|
|
||||||
if left <= right {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
case greaterOrEqual:
|
|
||||||
if left >= right {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
}
|
|
||||||
|
|
||||||
case float32, float64, int, uint, int8, uint8, int16, uint16, int32, uint32, int64, uint64:
|
|
||||||
right, err := convertor.ToFloat(rightValue)
|
|
||||||
if err != nil {
|
|
||||||
return false
|
|
||||||
}
|
|
||||||
switch operator {
|
|
||||||
case equal:
|
|
||||||
if left == right {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
case lessThan:
|
|
||||||
if left < right {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
case greaterThan:
|
|
||||||
if left > right {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
case lessOrEqual:
|
|
||||||
if left <= right {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
case greaterOrEqual:
|
|
||||||
if left >= right {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
}
|
}
|
||||||
|
|
||||||
case float32, float64, int, uint, int8, uint8, int16, uint16, int32, uint32, int64, uint64:
|
right, err := convertor.ToBigInt(rightValue)
|
||||||
|
if err != nil {
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
|
||||||
|
return compareBigInt(operator, left, right)
|
||||||
|
|
||||||
|
case float32, float64:
|
||||||
left, err := convertor.ToFloat(leftValue)
|
left, err := convertor.ToFloat(leftValue)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return false
|
return false
|
||||||
}
|
}
|
||||||
switch rightVal := rightValue.(type) {
|
right, err := convertor.ToFloat(rightValue)
|
||||||
case json.Number:
|
if err != nil {
|
||||||
if right, err := rightVal.Float64(); err == nil {
|
return false
|
||||||
switch operator {
|
|
||||||
case equal:
|
|
||||||
if left == right {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
case lessThan:
|
|
||||||
if left < right {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
case greaterThan:
|
|
||||||
if left > right {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
case lessOrEqual:
|
|
||||||
if left <= right {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
case greaterOrEqual:
|
|
||||||
if left >= right {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
case float32, float64, int, uint, int8, uint8, int16, uint16, int32, uint32, int64, uint64:
|
|
||||||
right, err := convertor.ToFloat(rightValue)
|
|
||||||
if err != nil {
|
|
||||||
return false
|
|
||||||
}
|
|
||||||
|
|
||||||
switch operator {
|
|
||||||
case equal:
|
|
||||||
if left == right {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
case lessThan:
|
|
||||||
if left < right {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
case greaterThan:
|
|
||||||
if left > right {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
case lessOrEqual:
|
|
||||||
if left <= right {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
case greaterOrEqual:
|
|
||||||
if left >= right {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
return compareFloats(operator, left, right)
|
||||||
|
|
||||||
case string:
|
case string:
|
||||||
left := leftVal
|
left := leftVal
|
||||||
switch right := rightValue.(type) {
|
switch right := rightValue.(type) {
|
||||||
case string:
|
case string:
|
||||||
switch operator {
|
return compareStrings(operator, left, right)
|
||||||
case equal:
|
|
||||||
if left == right {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
case lessThan:
|
|
||||||
if left < right {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
case greaterThan:
|
|
||||||
if left > right {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
case lessOrEqual:
|
|
||||||
if left <= right {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
case greaterOrEqual:
|
|
||||||
if left >= right {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
case bool:
|
case bool:
|
||||||
left := leftVal
|
left := leftVal
|
||||||
switch right := rightValue.(type) {
|
switch right := rightValue.(type) {
|
||||||
case bool:
|
case bool:
|
||||||
switch operator {
|
return compareBools(operator, left, right)
|
||||||
case equal:
|
|
||||||
if left == right {
|
|
||||||
return true
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
case json.Number:
|
||||||
|
if left, err := leftVal.Float64(); err == nil {
|
||||||
|
switch rightVal := rightValue.(type) {
|
||||||
|
case json.Number:
|
||||||
|
if right, err := rightVal.Float64(); err == nil {
|
||||||
|
return compareFloats(operator, left, right)
|
||||||
|
}
|
||||||
|
case float32, float64:
|
||||||
|
right, err := convertor.ToFloat(rightValue)
|
||||||
|
if err != nil {
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
return compareFloats(operator, left, right)
|
||||||
|
|
||||||
|
case int, uint, int8, uint8, int16, uint16, int32, uint32, int64, uint64:
|
||||||
|
right, err := convertor.ToBigInt(rightValue)
|
||||||
|
if err != nil {
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
left, err := convertor.ToBigInt(left)
|
||||||
|
return compareBigInt(operator, left, right)
|
||||||
|
}
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
return false
|
return false
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// compareBigInt compares two big.Int values based on the operator
|
||||||
|
func compareBigInt(operator string, left, right *big.Int) bool {
|
||||||
|
switch operator {
|
||||||
|
case equal:
|
||||||
|
return left.Cmp(right) == 0
|
||||||
|
case lessThan:
|
||||||
|
return left.Cmp(right) < 0
|
||||||
|
case greaterThan:
|
||||||
|
return left.Cmp(right) > 0
|
||||||
|
case lessOrEqual:
|
||||||
|
return left.Cmp(right) <= 0
|
||||||
|
case greaterOrEqual:
|
||||||
|
return left.Cmp(right) >= 0
|
||||||
|
}
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
|
||||||
|
// compareFloats compares two float64 values based on the operator
|
||||||
|
func compareFloats(operator string, left, right float64) bool {
|
||||||
|
switch operator {
|
||||||
|
case equal:
|
||||||
|
return left == right
|
||||||
|
case lessThan:
|
||||||
|
return left < right
|
||||||
|
case greaterThan:
|
||||||
|
return left > right
|
||||||
|
case lessOrEqual:
|
||||||
|
return left <= right
|
||||||
|
case greaterOrEqual:
|
||||||
|
return left >= right
|
||||||
|
}
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
|
||||||
|
// compareStrings compares two string values based on the operator
|
||||||
|
func compareStrings(operator string, left, right string) bool {
|
||||||
|
switch operator {
|
||||||
|
case equal:
|
||||||
|
return left == right
|
||||||
|
case lessThan:
|
||||||
|
return left < right
|
||||||
|
case greaterThan:
|
||||||
|
return left > right
|
||||||
|
case lessOrEqual:
|
||||||
|
return left <= right
|
||||||
|
case greaterOrEqual:
|
||||||
|
return left >= right
|
||||||
|
}
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
|
||||||
|
// compareBools compares two boolean values based on the operator
|
||||||
|
func compareBools(operator string, left, right bool) bool {
|
||||||
|
switch operator {
|
||||||
|
case equal:
|
||||||
|
return left == right
|
||||||
|
}
|
||||||
|
return false
|
||||||
|
}
|
||||||
+153
-84
@@ -1,6 +1,8 @@
|
|||||||
package compare
|
package compare
|
||||||
|
|
||||||
import (
|
import (
|
||||||
|
"encoding/json"
|
||||||
|
"math/big"
|
||||||
"testing"
|
"testing"
|
||||||
"time"
|
"time"
|
||||||
|
|
||||||
@@ -8,127 +10,194 @@ import (
|
|||||||
)
|
)
|
||||||
|
|
||||||
func TestEqual(t *testing.T) {
|
func TestEqual(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
assert := internal.NewAssert(t, "TestEqual")
|
assert := internal.NewAssert(t, "TestEqual")
|
||||||
|
|
||||||
assert.Equal(true, Equal(1, 1))
|
tests := []struct {
|
||||||
assert.Equal(true, Equal(int64(1), int64(1)))
|
left any
|
||||||
assert.Equal(true, Equal("a", "a"))
|
right any
|
||||||
assert.Equal(true, Equal(true, true))
|
want bool
|
||||||
assert.Equal(true, Equal([]int{1, 2, 3}, []int{1, 2, 3}))
|
|
||||||
assert.Equal(true, Equal(map[int]string{1: "a", 2: "b"}, map[int]string{1: "a", 2: "b"}))
|
|
||||||
|
|
||||||
assert.Equal(false, Equal(1, 2))
|
|
||||||
assert.Equal(false, Equal(1, int64(1)))
|
|
||||||
assert.Equal(false, Equal("a", "b"))
|
|
||||||
assert.Equal(false, Equal(true, false))
|
|
||||||
assert.Equal(false, Equal([]int{1, 2}, []int{1, 2, 3}))
|
|
||||||
assert.Equal(false, Equal(map[int]string{1: "a", 2: "b"}, map[int]string{1: "a"}))
|
|
||||||
|
|
||||||
time1 := time.Now()
|
|
||||||
time2 := time1.Add(time.Second)
|
|
||||||
time3 := time1.Add(time.Second)
|
|
||||||
|
|
||||||
assert.Equal(false, Equal(time1, time2))
|
|
||||||
assert.Equal(true, Equal(time2, time3))
|
|
||||||
|
|
||||||
st1 := struct {
|
|
||||||
A string
|
|
||||||
B string
|
|
||||||
}{
|
}{
|
||||||
A: "a",
|
{1, 1, true},
|
||||||
B: "b",
|
{int64(1), int64(1), true},
|
||||||
|
{"a", "a", true},
|
||||||
|
{true, true, true},
|
||||||
|
{[]int{1, 2, 3}, []int{1, 2, 3}, true},
|
||||||
|
{map[int]string{1: "a", 2: "b"}, map[int]string{1: "a", 2: "b"}, true},
|
||||||
|
{1, 2, false},
|
||||||
|
{1, int64(1), false},
|
||||||
|
{"a", "b", false},
|
||||||
|
{true, false, false},
|
||||||
|
{[]int{1, 2}, []int{1, 2, 3}, false},
|
||||||
|
{map[int]string{1: "a", 2: "b"}, map[int]string{1: "a"}, false},
|
||||||
|
// {time.Now(), time.Now(), true},
|
||||||
|
// {time.Now(), time.Now().Add(time.Second), false},
|
||||||
|
{[]byte("hello"), []byte("hello"), true},
|
||||||
|
{[]byte("hello"), []byte("world"), false},
|
||||||
|
{json.Number("123"), json.Number("123"), true},
|
||||||
|
{json.Number("123"), json.Number("124"), false},
|
||||||
|
|
||||||
|
{big.NewInt(123), big.NewInt(123), true},
|
||||||
}
|
}
|
||||||
|
|
||||||
st2 := struct {
|
for _, tt := range tests {
|
||||||
A string
|
assert.Equal(tt.want, Equal(tt.left, tt.right))
|
||||||
B string
|
|
||||||
}{
|
|
||||||
A: "a",
|
|
||||||
B: "b",
|
|
||||||
}
|
}
|
||||||
|
|
||||||
st3 := struct {
|
|
||||||
A string
|
|
||||||
B string
|
|
||||||
}{
|
|
||||||
A: "a1",
|
|
||||||
B: "b",
|
|
||||||
}
|
|
||||||
|
|
||||||
assert.Equal(true, Equal(st1, st2))
|
|
||||||
assert.Equal(false, Equal(st1, st3))
|
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestEqualValue(t *testing.T) {
|
func TestEqualValue(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
assert := internal.NewAssert(t, "TestEqualValue")
|
assert := internal.NewAssert(t, "TestEqualValue")
|
||||||
|
|
||||||
assert.Equal(true, EqualValue(1, 1))
|
tests := []struct {
|
||||||
assert.Equal(true, EqualValue(int(1), int64(1)))
|
left any
|
||||||
assert.Equal(true, EqualValue(1, "1"))
|
right any
|
||||||
|
want bool
|
||||||
|
}{
|
||||||
|
{1, 1, true},
|
||||||
|
{int64(1), int64(1), true},
|
||||||
|
{"a", "a", true},
|
||||||
|
{true, true, true},
|
||||||
|
{[]int{1, 2, 3}, []int{1, 2, 3}, true},
|
||||||
|
{map[int]string{1: "a", 2: "b"}, map[int]string{1: "a", 2: "b"}, true},
|
||||||
|
{1, 2, false},
|
||||||
|
{1, int64(1), true},
|
||||||
|
{"a", "b", false},
|
||||||
|
{true, false, false},
|
||||||
|
{[]int{1, 2}, []int{1, 2, 3}, false},
|
||||||
|
}
|
||||||
|
|
||||||
assert.Equal(false, EqualValue(1, "2"))
|
for _, tt := range tests {
|
||||||
|
assert.Equal(tt.want, EqualValue(tt.left, tt.right))
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestLessThan(t *testing.T) {
|
func TestLessThan(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
assert := internal.NewAssert(t, "TestLessThan")
|
assert := internal.NewAssert(t, "TestLessThan")
|
||||||
|
|
||||||
assert.Equal(true, LessThan(1, 2))
|
tests := []struct {
|
||||||
assert.Equal(true, LessThan(1.1, 2.2))
|
left any
|
||||||
assert.Equal(true, LessThan("a", "b"))
|
right any
|
||||||
|
want bool
|
||||||
|
}{
|
||||||
|
{1, 2, true},
|
||||||
|
{1.1, 2.2, true},
|
||||||
|
{"a", "b", true},
|
||||||
|
{time.Now(), time.Now().Add(time.Second), true},
|
||||||
|
{[]byte("hello1"), []byte("hello2"), true},
|
||||||
|
{json.Number("123"), json.Number("124"), true},
|
||||||
|
{645680099112988673, 645680099112988675, true},
|
||||||
|
{1, 1, false},
|
||||||
|
{1, int64(1), false},
|
||||||
|
}
|
||||||
|
|
||||||
time1 := time.Now()
|
for _, tt := range tests {
|
||||||
time2 := time1.Add(time.Second)
|
assert.Equal(tt.want, LessThan(tt.left, tt.right))
|
||||||
assert.Equal(true, LessThan(time1, time2))
|
}
|
||||||
|
|
||||||
assert.Equal(false, LessThan(1, 1))
|
|
||||||
assert.Equal(false, LessThan(1, int64(1)))
|
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestGreaterThan(t *testing.T) {
|
func TestGreaterThan(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
assert := internal.NewAssert(t, "TestGreaterThan")
|
assert := internal.NewAssert(t, "TestGreaterThan")
|
||||||
|
|
||||||
assert.Equal(true, GreaterThan(2, 1))
|
tests := []struct {
|
||||||
assert.Equal(true, GreaterThan(2.2, 1.1))
|
left any
|
||||||
assert.Equal(true, GreaterThan("b", "a"))
|
right any
|
||||||
|
want bool
|
||||||
|
}{
|
||||||
|
{2, 1, true},
|
||||||
|
{2.2, 1.1, true},
|
||||||
|
{"b", "a", true},
|
||||||
|
{time.Now().Add(time.Second), time.Now(), true},
|
||||||
|
{[]byte("hello2"), []byte("hello1"), true},
|
||||||
|
{json.Number("124"), json.Number("123"), true},
|
||||||
|
{645680099112988675, 645680099112988673, true},
|
||||||
|
{1, 1, false},
|
||||||
|
{1, int64(1), false},
|
||||||
|
}
|
||||||
|
|
||||||
time1 := time.Now()
|
for _, tt := range tests {
|
||||||
time2 := time1.Add(time.Second)
|
assert.Equal(tt.want, GreaterThan(tt.left, tt.right))
|
||||||
assert.Equal(true, GreaterThan(time2, time1))
|
}
|
||||||
|
|
||||||
assert.Equal(false, GreaterThan(1, 2))
|
|
||||||
assert.Equal(false, GreaterThan(int64(2), 1))
|
|
||||||
assert.Equal(false, GreaterThan("b", "c"))
|
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestLessOrEqual(t *testing.T) {
|
func TestLessOrEqual(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
assert := internal.NewAssert(t, "TestLessOrEqual")
|
assert := internal.NewAssert(t, "TestLessOrEqual")
|
||||||
|
|
||||||
assert.Equal(true, LessOrEqual(1, 2))
|
tests := []struct {
|
||||||
assert.Equal(true, LessOrEqual(1, 1))
|
left any
|
||||||
assert.Equal(true, LessOrEqual(1.1, 2.2))
|
right any
|
||||||
assert.Equal(true, LessOrEqual("a", "b"))
|
want bool
|
||||||
|
}{
|
||||||
|
{1, 2, true},
|
||||||
|
{1, 1, true},
|
||||||
|
{1.1, 2.2, true},
|
||||||
|
{"a", "b", true},
|
||||||
|
{time.Now(), time.Now().Add(time.Second), true},
|
||||||
|
{[]byte("hello1"), []byte("hello2"), true},
|
||||||
|
{json.Number("123"), json.Number("124"), true},
|
||||||
|
{645680099112988673, 645680099112988675, true},
|
||||||
|
{2, 1, false},
|
||||||
|
{1, int64(2), false},
|
||||||
|
}
|
||||||
|
|
||||||
time1 := time.Now()
|
for _, tt := range tests {
|
||||||
time2 := time1.Add(time.Second)
|
assert.Equal(tt.want, LessOrEqual(tt.left, tt.right))
|
||||||
assert.Equal(true, LessOrEqual(time1, time2))
|
}
|
||||||
|
|
||||||
assert.Equal(false, LessOrEqual(2, 1))
|
|
||||||
assert.Equal(false, LessOrEqual(1, int64(2)))
|
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestGreaterOrEqual(t *testing.T) {
|
func TestGreaterOrEqual(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
assert := internal.NewAssert(t, "TestGreaterThan")
|
assert := internal.NewAssert(t, "TestGreaterThan")
|
||||||
|
|
||||||
assert.Equal(true, GreaterOrEqual(2, 1))
|
tests := []struct {
|
||||||
assert.Equal(true, GreaterOrEqual(1, 1))
|
left any
|
||||||
assert.Equal(true, GreaterOrEqual(2.2, 1.1))
|
right any
|
||||||
assert.Equal(true, GreaterOrEqual("b", "b"))
|
want bool
|
||||||
|
}{
|
||||||
|
{2, 1, true},
|
||||||
|
{1, 1, true},
|
||||||
|
{2.2, 1.1, true},
|
||||||
|
{"b", "b", true},
|
||||||
|
{time.Now().Add(time.Second), time.Now(), true},
|
||||||
|
{[]byte("hello2"), []byte("hello1"), true},
|
||||||
|
{json.Number("124"), json.Number("123"), true},
|
||||||
|
{645680099112988675, 645680099112988673, true},
|
||||||
|
{1, 2, false},
|
||||||
|
{int64(2), 1, false},
|
||||||
|
{"b", "c", false},
|
||||||
|
}
|
||||||
|
|
||||||
time1 := time.Now()
|
for _, tt := range tests {
|
||||||
time2 := time1.Add(time.Second)
|
assert.Equal(tt.want, GreaterOrEqual(tt.left, tt.right))
|
||||||
assert.Equal(true, GreaterOrEqual(time2, time1))
|
}
|
||||||
|
}
|
||||||
|
|
||||||
assert.Equal(false, GreaterOrEqual(1, 2))
|
func TestInDelta(t *testing.T) {
|
||||||
assert.Equal(false, GreaterOrEqual(int64(2), 1))
|
t.Parallel()
|
||||||
assert.Equal(false, GreaterOrEqual("b", "c"))
|
assert := internal.NewAssert(t, "TestInDelta")
|
||||||
|
|
||||||
|
tests := []struct {
|
||||||
|
left float64
|
||||||
|
right float64
|
||||||
|
delta float64
|
||||||
|
want bool
|
||||||
|
}{
|
||||||
|
{1, 1, 0, true},
|
||||||
|
{1, 2, 0, false},
|
||||||
|
{2.0 / 3.0, 0.66667, 0.001, true},
|
||||||
|
{2.0 / 3.0, 0.0, 0.001, false},
|
||||||
|
{float64(74.96) - float64(20.48), 54.48, 0, false},
|
||||||
|
{float64(74.96) - float64(20.48), 54.48, 1e-14, true},
|
||||||
|
{float64(float32(80.45)), float64(80.45), 0, false},
|
||||||
|
{float64(float32(80.45)), float64(80.45), 1e-5, true},
|
||||||
|
}
|
||||||
|
|
||||||
|
for _, tt := range tests {
|
||||||
|
assert.Equal(tt.want, InDelta(tt.left, tt.right, tt.delta))
|
||||||
|
}
|
||||||
}
|
}
|
||||||
+11
-8
@@ -157,10 +157,10 @@ func (c *Channel[T]) Tee(ctx context.Context, in <-chan T) (<-chan T, <-chan T)
|
|||||||
// Play: https://go.dev/play/p/qmWSy1NVF-Y
|
// Play: https://go.dev/play/p/qmWSy1NVF-Y
|
||||||
func (c *Channel[T]) Bridge(ctx context.Context, chanStream <-chan <-chan T) <-chan T {
|
func (c *Channel[T]) Bridge(ctx context.Context, chanStream <-chan <-chan T) <-chan T {
|
||||||
valStream := make(chan T)
|
valStream := make(chan T)
|
||||||
|
|
||||||
go func() {
|
go func() {
|
||||||
defer close(valStream)
|
defer close(valStream)
|
||||||
|
wg := sync.WaitGroup{}
|
||||||
|
defer wg.Wait()
|
||||||
for {
|
for {
|
||||||
var stream <-chan T
|
var stream <-chan T
|
||||||
select {
|
select {
|
||||||
@@ -169,19 +169,22 @@ func (c *Channel[T]) Bridge(ctx context.Context, chanStream <-chan <-chan T) <-c
|
|||||||
return
|
return
|
||||||
}
|
}
|
||||||
stream = maybeStream
|
stream = maybeStream
|
||||||
|
wg.Add(1)
|
||||||
case <-ctx.Done():
|
case <-ctx.Done():
|
||||||
return
|
return
|
||||||
}
|
}
|
||||||
|
|
||||||
for val := range c.OrDone(ctx, stream) {
|
go func() {
|
||||||
select {
|
defer wg.Done()
|
||||||
case valStream <- val:
|
for val := range c.OrDone(ctx, stream) {
|
||||||
case <-ctx.Done():
|
select {
|
||||||
|
case valStream <- val:
|
||||||
|
case <-ctx.Done():
|
||||||
|
}
|
||||||
}
|
}
|
||||||
}
|
}()
|
||||||
}
|
}
|
||||||
}()
|
}()
|
||||||
|
|
||||||
return valStream
|
return valStream
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
@@ -3,6 +3,7 @@ package concurrency
|
|||||||
import (
|
import (
|
||||||
"context"
|
"context"
|
||||||
"fmt"
|
"fmt"
|
||||||
|
"log"
|
||||||
"time"
|
"time"
|
||||||
)
|
)
|
||||||
|
|
||||||
@@ -168,7 +169,8 @@ func ExampleChannel_Tee() {
|
|||||||
func ExampleChannel_Bridge() {
|
func ExampleChannel_Bridge() {
|
||||||
ctx, cancel := context.WithCancel(context.Background())
|
ctx, cancel := context.WithCancel(context.Background())
|
||||||
defer cancel()
|
defer cancel()
|
||||||
|
m1 := make(map[int]int)
|
||||||
|
m2 := make(map[int]int)
|
||||||
c := NewChannel[int]()
|
c := NewChannel[int]()
|
||||||
genVals := func() <-chan <-chan int {
|
genVals := func() <-chan <-chan int {
|
||||||
out := make(chan (<-chan int))
|
out := make(chan (<-chan int))
|
||||||
@@ -177,6 +179,7 @@ func ExampleChannel_Bridge() {
|
|||||||
for i := 1; i <= 5; i++ {
|
for i := 1; i <= 5; i++ {
|
||||||
stream := make(chan int, 1)
|
stream := make(chan int, 1)
|
||||||
stream <- i
|
stream <- i
|
||||||
|
m1[i]++
|
||||||
close(stream)
|
close(stream)
|
||||||
out <- stream
|
out <- stream
|
||||||
}
|
}
|
||||||
@@ -185,12 +188,171 @@ func ExampleChannel_Bridge() {
|
|||||||
}
|
}
|
||||||
|
|
||||||
for v := range c.Bridge(ctx, genVals()) {
|
for v := range c.Bridge(ctx, genVals()) {
|
||||||
fmt.Println(v)
|
m2[v]++
|
||||||
|
}
|
||||||
|
for k, v := range m1 {
|
||||||
|
fmt.Println(m2[k] == v)
|
||||||
}
|
}
|
||||||
// Output:
|
// Output:
|
||||||
// 1
|
// true
|
||||||
// 2
|
// true
|
||||||
// 3
|
// true
|
||||||
// 4
|
// true
|
||||||
// 5
|
// true
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleKeyedLocker_Do() {
|
||||||
|
locker := NewKeyedLocker[string](2 * time.Second)
|
||||||
|
|
||||||
|
task := func() {
|
||||||
|
fmt.Println("Executing task...")
|
||||||
|
time.Sleep(1 * time.Second)
|
||||||
|
fmt.Println("Task completed.")
|
||||||
|
}
|
||||||
|
|
||||||
|
ctx, cancel := context.WithTimeout(context.Background(), 3*time.Second)
|
||||||
|
defer cancel()
|
||||||
|
|
||||||
|
if err := locker.Do(ctx, "mykey", task); err != nil {
|
||||||
|
log.Fatalf("Error executing task: %v\n", err)
|
||||||
|
} else {
|
||||||
|
fmt.Println("Task successfully executed.")
|
||||||
|
}
|
||||||
|
|
||||||
|
ctx2, cancel2 := context.WithTimeout(context.Background(), 3*time.Second)
|
||||||
|
defer cancel2()
|
||||||
|
|
||||||
|
if err := locker.Do(ctx2, "mykey", task); err != nil {
|
||||||
|
log.Fatalf("Error executing task: %v\n", err)
|
||||||
|
} else {
|
||||||
|
fmt.Println("Task successfully executed.")
|
||||||
|
}
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// Executing task...
|
||||||
|
// Task completed.
|
||||||
|
// Task successfully executed.
|
||||||
|
// Executing task...
|
||||||
|
// Task completed.
|
||||||
|
// Task successfully executed.
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleRWKeyedLocker_Lock() {
|
||||||
|
locker := NewRWKeyedLocker[string](2 * time.Second)
|
||||||
|
|
||||||
|
// Simulate a key
|
||||||
|
key := "resource_key"
|
||||||
|
|
||||||
|
fn := func() {
|
||||||
|
fmt.Println("Starting write operation...")
|
||||||
|
// Simulate write operation, assuming it takes 2 seconds
|
||||||
|
time.Sleep(200 * time.Millisecond)
|
||||||
|
fmt.Println("Write operation completed!")
|
||||||
|
}
|
||||||
|
|
||||||
|
// Acquire the write lock and execute the operation
|
||||||
|
ctx, cancel := context.WithTimeout(context.Background(), 1*time.Second)
|
||||||
|
defer cancel()
|
||||||
|
|
||||||
|
// Execute the lock operation with a 3-second timeout
|
||||||
|
err := locker.Lock(ctx, key, fn)
|
||||||
|
if err != nil {
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
//output:
|
||||||
|
//Starting write operation...
|
||||||
|
//Write operation completed!
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleRWKeyedLocker_RLock() {
|
||||||
|
locker := NewRWKeyedLocker[string](2 * time.Second)
|
||||||
|
|
||||||
|
// Simulate a key
|
||||||
|
key := "resource_key"
|
||||||
|
|
||||||
|
fn := func() {
|
||||||
|
fmt.Println("Starting write operation...")
|
||||||
|
// Simulate write operation, assuming it takes 2 seconds
|
||||||
|
time.Sleep(200 * time.Millisecond)
|
||||||
|
fmt.Println("Write operation completed!")
|
||||||
|
}
|
||||||
|
|
||||||
|
// Acquire the write lock and execute the operation
|
||||||
|
ctx, cancel := context.WithTimeout(context.Background(), 1*time.Second)
|
||||||
|
defer cancel()
|
||||||
|
|
||||||
|
// Execute the lock operation with a 3-second timeout
|
||||||
|
err := locker.RLock(ctx, key, fn)
|
||||||
|
if err != nil {
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
//output:
|
||||||
|
//Starting write operation...
|
||||||
|
//Write operation completed!
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleTryKeyedLocker() {
|
||||||
|
locker := NewTryKeyedLocker[string]()
|
||||||
|
|
||||||
|
key := "resource_key"
|
||||||
|
|
||||||
|
if locker.TryLock(key) {
|
||||||
|
fmt.Println("Lock acquired")
|
||||||
|
time.Sleep(1 * time.Second)
|
||||||
|
// Unlock after work is done
|
||||||
|
locker.Unlock(key)
|
||||||
|
fmt.Println("Lock released")
|
||||||
|
} else {
|
||||||
|
fmt.Println("Lock failed")
|
||||||
|
}
|
||||||
|
|
||||||
|
//output:
|
||||||
|
//Lock acquired
|
||||||
|
//Lock released
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleTryKeyedLocker_TryLock() {
|
||||||
|
locker := NewTryKeyedLocker[string]()
|
||||||
|
|
||||||
|
key := "resource_key"
|
||||||
|
|
||||||
|
done := make(chan struct{})
|
||||||
|
go func() {
|
||||||
|
if locker.TryLock(key) {
|
||||||
|
time.Sleep(2 * time.Second)
|
||||||
|
locker.Unlock(key)
|
||||||
|
}
|
||||||
|
close(done)
|
||||||
|
}()
|
||||||
|
|
||||||
|
time.Sleep(100 * time.Millisecond)
|
||||||
|
|
||||||
|
if locker.TryLock(key) {
|
||||||
|
fmt.Println("Lock acquired")
|
||||||
|
locker.Unlock(key)
|
||||||
|
} else {
|
||||||
|
fmt.Println("Lock failed")
|
||||||
|
}
|
||||||
|
|
||||||
|
// wait for the goroutine to finish
|
||||||
|
<-done
|
||||||
|
|
||||||
|
fmt.Println("Retrying...")
|
||||||
|
time.Sleep(100 * time.Millisecond)
|
||||||
|
|
||||||
|
if locker.TryLock(key) {
|
||||||
|
fmt.Println("Lock acquired")
|
||||||
|
locker.Unlock(key)
|
||||||
|
fmt.Println("Lock released")
|
||||||
|
} else {
|
||||||
|
fmt.Println("Lock failed")
|
||||||
|
}
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// Lock failed
|
||||||
|
// Retrying...
|
||||||
|
// Lock acquired
|
||||||
|
// Lock released
|
||||||
}
|
}
|
||||||
@@ -9,6 +9,7 @@ import (
|
|||||||
)
|
)
|
||||||
|
|
||||||
func TestGenerate(t *testing.T) {
|
func TestGenerate(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
assert := internal.NewAssert(t, "TestGenerate")
|
assert := internal.NewAssert(t, "TestGenerate")
|
||||||
|
|
||||||
ctx, cancel := context.WithCancel(context.Background())
|
ctx, cancel := context.WithCancel(context.Background())
|
||||||
@@ -23,6 +24,7 @@ func TestGenerate(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestRepeat(t *testing.T) {
|
func TestRepeat(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
assert := internal.NewAssert(t, "TestRepeat")
|
assert := internal.NewAssert(t, "TestRepeat")
|
||||||
|
|
||||||
ctx, cancel := context.WithCancel(context.Background())
|
ctx, cancel := context.WithCancel(context.Background())
|
||||||
@@ -39,6 +41,7 @@ func TestRepeat(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestRepeatFn(t *testing.T) {
|
func TestRepeatFn(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
assert := internal.NewAssert(t, "TestRepeatFn")
|
assert := internal.NewAssert(t, "TestRepeatFn")
|
||||||
|
|
||||||
ctx, cancel := context.WithCancel(context.Background())
|
ctx, cancel := context.WithCancel(context.Background())
|
||||||
@@ -57,6 +60,7 @@ func TestRepeatFn(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestTake(t *testing.T) {
|
func TestTake(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
assert := internal.NewAssert(t, "TestTake")
|
assert := internal.NewAssert(t, "TestTake")
|
||||||
|
|
||||||
ctx, cancel := context.WithCancel(context.Background())
|
ctx, cancel := context.WithCancel(context.Background())
|
||||||
@@ -79,6 +83,7 @@ func TestTake(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestFanIn(t *testing.T) {
|
func TestFanIn(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
assert := internal.NewAssert(t, "TestFanIn")
|
assert := internal.NewAssert(t, "TestFanIn")
|
||||||
|
|
||||||
ctx, cancel := context.WithCancel(context.Background())
|
ctx, cancel := context.WithCancel(context.Background())
|
||||||
@@ -101,6 +106,7 @@ func TestFanIn(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestOr(t *testing.T) {
|
func TestOr(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
assert := internal.NewAssert(t, "TestOr")
|
assert := internal.NewAssert(t, "TestOr")
|
||||||
|
|
||||||
sig := func(after time.Duration) <-chan any {
|
sig := func(after time.Duration) <-chan any {
|
||||||
@@ -127,6 +133,7 @@ func TestOr(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestOrDone(t *testing.T) {
|
func TestOrDone(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
assert := internal.NewAssert(t, "TestOrDone")
|
assert := internal.NewAssert(t, "TestOrDone")
|
||||||
|
|
||||||
ctx, cancel := context.WithCancel(context.Background())
|
ctx, cancel := context.WithCancel(context.Background())
|
||||||
@@ -141,6 +148,7 @@ func TestOrDone(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestTee(t *testing.T) {
|
func TestTee(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
assert := internal.NewAssert(t, "TestTee")
|
assert := internal.NewAssert(t, "TestTee")
|
||||||
|
|
||||||
ctx, cancel := context.WithCancel(context.Background())
|
ctx, cancel := context.WithCancel(context.Background())
|
||||||
@@ -159,8 +167,10 @@ func TestTee(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestBridge(t *testing.T) {
|
func TestBridge(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
assert := internal.NewAssert(t, "TestBridge")
|
assert := internal.NewAssert(t, "TestBridge")
|
||||||
|
m1 := make(map[int]int)
|
||||||
|
m2 := make(map[int]int)
|
||||||
ctx, cancel := context.WithCancel(context.Background())
|
ctx, cancel := context.WithCancel(context.Background())
|
||||||
defer cancel()
|
defer cancel()
|
||||||
|
|
||||||
@@ -172,6 +182,7 @@ func TestBridge(t *testing.T) {
|
|||||||
for i := 0; i < 10; i++ {
|
for i := 0; i < 10; i++ {
|
||||||
stream := make(chan int, 1)
|
stream := make(chan int, 1)
|
||||||
stream <- i
|
stream <- i
|
||||||
|
m1[i]++
|
||||||
close(stream)
|
close(stream)
|
||||||
chanStream <- stream
|
chanStream <- stream
|
||||||
}
|
}
|
||||||
@@ -179,9 +190,11 @@ func TestBridge(t *testing.T) {
|
|||||||
return chanStream
|
return chanStream
|
||||||
}
|
}
|
||||||
|
|
||||||
index := 0
|
|
||||||
for val := range c.Bridge(ctx, genVals()) {
|
for val := range c.Bridge(ctx, genVals()) {
|
||||||
assert.Equal(index, val)
|
m2[val]++
|
||||||
index++
|
}
|
||||||
|
|
||||||
|
for k, v := range m1 {
|
||||||
|
assert.Equal(m2[k], v)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@@ -0,0 +1,257 @@
|
|||||||
|
// Copyright 2025 dudaodong@gmail.com. All rights reserved.
|
||||||
|
// Use of this source code is governed by MIT license
|
||||||
|
|
||||||
|
// Package concurrency contain some functions to support concurrent programming. eg, goroutine, channel, locker.
|
||||||
|
package concurrency
|
||||||
|
|
||||||
|
import (
|
||||||
|
"context"
|
||||||
|
"sync"
|
||||||
|
"sync/atomic"
|
||||||
|
"time"
|
||||||
|
)
|
||||||
|
|
||||||
|
// KeyedLocker is a simple implementation of a keyed locker that allows for non-blocking lock acquisition.
|
||||||
|
type KeyedLocker[K comparable] struct {
|
||||||
|
locks sync.Map
|
||||||
|
ttl time.Duration
|
||||||
|
}
|
||||||
|
|
||||||
|
type lockEntry struct {
|
||||||
|
mu sync.Mutex
|
||||||
|
ref int32
|
||||||
|
timer atomic.Pointer[time.Timer]
|
||||||
|
}
|
||||||
|
|
||||||
|
// NewKeyedLocker creates a new KeyedLocker with the specified TTL for lock expiration.
|
||||||
|
// The TTL is used to automatically release locks that are no longer held.
|
||||||
|
// Play: https://go.dev/play/p/GzeyC33T5rw
|
||||||
|
func NewKeyedLocker[K comparable](ttl time.Duration) *KeyedLocker[K] {
|
||||||
|
return &KeyedLocker[K]{ttl: ttl}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Do acquires a lock for the specified key and executes the provided function.
|
||||||
|
// It returns an error if the context is canceled before the function completes.
|
||||||
|
// Play: https://go.dev/play/p/GzeyC33T5rw
|
||||||
|
func (l *KeyedLocker[K]) Do(ctx context.Context, key K, fn func()) error {
|
||||||
|
entry := l.acquire(key)
|
||||||
|
defer l.release(key, entry, key)
|
||||||
|
|
||||||
|
done := make(chan struct{})
|
||||||
|
|
||||||
|
go func() {
|
||||||
|
entry.mu.Lock()
|
||||||
|
defer entry.mu.Unlock()
|
||||||
|
|
||||||
|
select {
|
||||||
|
case <-ctx.Done():
|
||||||
|
default:
|
||||||
|
fn()
|
||||||
|
}
|
||||||
|
close(done)
|
||||||
|
}()
|
||||||
|
|
||||||
|
select {
|
||||||
|
case <-ctx.Done():
|
||||||
|
return ctx.Err()
|
||||||
|
case <-done:
|
||||||
|
return nil
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// acquire tries to acquire a lock for the specified key.
|
||||||
|
func (l *KeyedLocker[K]) acquire(key K) *lockEntry {
|
||||||
|
lock, _ := l.locks.LoadOrStore(key, &lockEntry{})
|
||||||
|
entry := lock.(*lockEntry)
|
||||||
|
|
||||||
|
atomic.AddInt32(&entry.ref, 1)
|
||||||
|
if t := entry.timer.Swap(nil); t != nil {
|
||||||
|
t.Stop()
|
||||||
|
}
|
||||||
|
|
||||||
|
return entry
|
||||||
|
}
|
||||||
|
|
||||||
|
// release releases the lock for the specified key.
|
||||||
|
func (l *KeyedLocker[K]) release(key K, entry *lockEntry, rawKey K) {
|
||||||
|
if atomic.AddInt32(&entry.ref, -1) == 0 {
|
||||||
|
entry.mu.Lock()
|
||||||
|
defer entry.mu.Unlock()
|
||||||
|
|
||||||
|
if entry.ref == 0 {
|
||||||
|
if t := entry.timer.Swap(nil); t != nil {
|
||||||
|
t.Stop()
|
||||||
|
}
|
||||||
|
|
||||||
|
l.locks.Delete(rawKey)
|
||||||
|
} else {
|
||||||
|
if entry.timer.Load() == nil {
|
||||||
|
t := time.AfterFunc(l.ttl, func() {
|
||||||
|
l.release(key, entry, rawKey)
|
||||||
|
})
|
||||||
|
entry.timer.Store(t)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// RWKeyedLocker is a read-write version of KeyedLocker.
|
||||||
|
type RWKeyedLocker[K comparable] struct {
|
||||||
|
locks sync.Map
|
||||||
|
ttl time.Duration
|
||||||
|
}
|
||||||
|
|
||||||
|
type rwLockEntry struct {
|
||||||
|
mu sync.RWMutex
|
||||||
|
ref int32
|
||||||
|
timer atomic.Pointer[time.Timer]
|
||||||
|
}
|
||||||
|
|
||||||
|
// NewRWKeyedLocker creates a new RWKeyedLocker with the specified TTL for lock expiration.
|
||||||
|
// The TTL is used to automatically release locks that are no longer held.
|
||||||
|
// Play: https://go.dev/play/p/CkaJWWwZm9
|
||||||
|
func NewRWKeyedLocker[K comparable](ttl time.Duration) *RWKeyedLocker[K] {
|
||||||
|
return &RWKeyedLocker[K]{ttl: ttl}
|
||||||
|
}
|
||||||
|
|
||||||
|
// RLock acquires a read lock for the specified key and executes the provided function.
|
||||||
|
// It returns an error if the context is canceled before the function completes.
|
||||||
|
// Play: https://go.dev/play/p/ZrCr8sMo77T
|
||||||
|
func (l *RWKeyedLocker[K]) RLock(ctx context.Context, key K, fn func()) error {
|
||||||
|
entry := l.acquire(key)
|
||||||
|
defer l.release(entry, key)
|
||||||
|
|
||||||
|
done := make(chan struct{})
|
||||||
|
|
||||||
|
go func() {
|
||||||
|
entry.mu.RLock()
|
||||||
|
defer entry.mu.RUnlock()
|
||||||
|
|
||||||
|
select {
|
||||||
|
case <-ctx.Done():
|
||||||
|
default:
|
||||||
|
fn()
|
||||||
|
}
|
||||||
|
close(done)
|
||||||
|
}()
|
||||||
|
|
||||||
|
select {
|
||||||
|
case <-ctx.Done():
|
||||||
|
return ctx.Err()
|
||||||
|
case <-done:
|
||||||
|
return nil
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Lock acquires a write lock for the specified key and executes the provided function.
|
||||||
|
// It returns an error if the context is canceled before the function completes.
|
||||||
|
// Play: https://go.dev/play/p/WgAcXbOPKGk
|
||||||
|
func (l *RWKeyedLocker[K]) Lock(ctx context.Context, key K, fn func()) error {
|
||||||
|
entry := l.acquire(key)
|
||||||
|
defer l.release(entry, key)
|
||||||
|
|
||||||
|
done := make(chan struct{})
|
||||||
|
|
||||||
|
go func() {
|
||||||
|
entry.mu.Lock()
|
||||||
|
defer entry.mu.Unlock()
|
||||||
|
|
||||||
|
select {
|
||||||
|
case <-ctx.Done():
|
||||||
|
default:
|
||||||
|
fn()
|
||||||
|
}
|
||||||
|
close(done)
|
||||||
|
}()
|
||||||
|
|
||||||
|
select {
|
||||||
|
case <-ctx.Done():
|
||||||
|
return ctx.Err()
|
||||||
|
case <-done:
|
||||||
|
return nil
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// acquire tries to acquire a read lock for the specified key.
|
||||||
|
func (l *RWKeyedLocker[K]) acquire(key K) *rwLockEntry {
|
||||||
|
actual, _ := l.locks.LoadOrStore(key, &rwLockEntry{})
|
||||||
|
entry := actual.(*rwLockEntry)
|
||||||
|
atomic.AddInt32(&entry.ref, 1)
|
||||||
|
|
||||||
|
if t := entry.timer.Swap(nil); t != nil {
|
||||||
|
t.Stop()
|
||||||
|
}
|
||||||
|
return entry
|
||||||
|
}
|
||||||
|
|
||||||
|
// release releases the lock for the specified key.
|
||||||
|
func (l *RWKeyedLocker[K]) release(entry *rwLockEntry, rawKey K) {
|
||||||
|
if atomic.AddInt32(&entry.ref, -1) == 0 {
|
||||||
|
timer := time.AfterFunc(l.ttl, func() {
|
||||||
|
if atomic.LoadInt32(&entry.ref) == 0 {
|
||||||
|
l.locks.Delete(rawKey)
|
||||||
|
}
|
||||||
|
})
|
||||||
|
entry.timer.Store(timer)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// TryKeyedLocker is a non-blocking version of KeyedLocker.
|
||||||
|
// It allows for trying to acquire a lock without blocking if the lock is already held.
|
||||||
|
type TryKeyedLocker[K comparable] struct {
|
||||||
|
mu sync.Mutex
|
||||||
|
locks map[K]*casMutex
|
||||||
|
}
|
||||||
|
|
||||||
|
// NewTryKeyedLocker creates a new TryKeyedLocker.
|
||||||
|
// Play: https://go.dev/play/p/VG9qLvyetE2
|
||||||
|
func NewTryKeyedLocker[K comparable]() *TryKeyedLocker[K] {
|
||||||
|
return &TryKeyedLocker[K]{locks: make(map[K]*casMutex)}
|
||||||
|
}
|
||||||
|
|
||||||
|
// TryLock tries to acquire a lock for the specified key.
|
||||||
|
// It returns true if the lock was acquired, false otherwise.
|
||||||
|
// Play: https://go.dev/play/p/VG9qLvyetE2
|
||||||
|
func (l *TryKeyedLocker[K]) TryLock(key K) bool {
|
||||||
|
l.mu.Lock()
|
||||||
|
|
||||||
|
lock, ok := l.locks[key]
|
||||||
|
if !ok {
|
||||||
|
lock = &casMutex{}
|
||||||
|
l.locks[key] = lock
|
||||||
|
}
|
||||||
|
l.mu.Unlock()
|
||||||
|
|
||||||
|
return lock.TryLock()
|
||||||
|
}
|
||||||
|
|
||||||
|
// Unlock releases the lock for the specified key.
|
||||||
|
// Play: https://go.dev/play/p/VG9qLvyetE2
|
||||||
|
func (l *TryKeyedLocker[K]) Unlock(key K) {
|
||||||
|
l.mu.Lock()
|
||||||
|
defer l.mu.Unlock()
|
||||||
|
|
||||||
|
lock, ok := l.locks[key]
|
||||||
|
if ok {
|
||||||
|
lock.Unlock()
|
||||||
|
if lock.lock == 0 {
|
||||||
|
delete(l.locks, key)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// casMutex is a simple mutex that uses atomic operations to provide a non-blocking lock.
|
||||||
|
type casMutex struct {
|
||||||
|
lock int32
|
||||||
|
}
|
||||||
|
|
||||||
|
// TryLock tries to acquire the lock without blocking.
|
||||||
|
// It returns true if the lock was acquired, false otherwise.
|
||||||
|
func (m *casMutex) TryLock() bool {
|
||||||
|
return atomic.CompareAndSwapInt32(&m.lock, 0, 1)
|
||||||
|
}
|
||||||
|
|
||||||
|
// Unlock releases the lock.
|
||||||
|
func (m *casMutex) Unlock() {
|
||||||
|
atomic.StoreInt32(&m.lock, 0)
|
||||||
|
}
|
||||||
@@ -0,0 +1,230 @@
|
|||||||
|
package concurrency
|
||||||
|
|
||||||
|
import (
|
||||||
|
"context"
|
||||||
|
"strconv"
|
||||||
|
"sync"
|
||||||
|
"testing"
|
||||||
|
"time"
|
||||||
|
|
||||||
|
"github.com/duke-git/lancet/v2/internal"
|
||||||
|
)
|
||||||
|
|
||||||
|
func TestKeyedLocker_SerialExecutionSameKey(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
assert := internal.NewAssert(t, "TestKeyedLocker_SerialExecutionSameKey")
|
||||||
|
|
||||||
|
locker := NewKeyedLocker[string](100 * time.Millisecond)
|
||||||
|
|
||||||
|
var result []int
|
||||||
|
var mu sync.Mutex
|
||||||
|
|
||||||
|
wg := sync.WaitGroup{}
|
||||||
|
for i := 0; i < 5; i++ {
|
||||||
|
wg.Add(1)
|
||||||
|
go func(i int) {
|
||||||
|
defer wg.Done()
|
||||||
|
err := locker.Do(context.Background(), "key1", func() {
|
||||||
|
time.Sleep(10 * time.Millisecond)
|
||||||
|
mu.Lock()
|
||||||
|
defer mu.Unlock()
|
||||||
|
result = append(result, i)
|
||||||
|
})
|
||||||
|
|
||||||
|
assert.IsNil(err)
|
||||||
|
}(i)
|
||||||
|
}
|
||||||
|
wg.Wait()
|
||||||
|
|
||||||
|
assert.Equal(5, len(result))
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestKeyedLocker_ParallelExecutionDifferentKeys(t *testing.T) {
|
||||||
|
locker := NewKeyedLocker[string](100 * time.Millisecond)
|
||||||
|
|
||||||
|
start := time.Now()
|
||||||
|
wg := sync.WaitGroup{}
|
||||||
|
for i := 0; i < 5; i++ {
|
||||||
|
wg.Add(1)
|
||||||
|
go func(i int) {
|
||||||
|
defer wg.Done()
|
||||||
|
key := "key" + strconv.Itoa(i)
|
||||||
|
locker.Do(context.Background(), key, func() {
|
||||||
|
time.Sleep(50 * time.Millisecond)
|
||||||
|
})
|
||||||
|
}(i)
|
||||||
|
}
|
||||||
|
wg.Wait()
|
||||||
|
elapsed := time.Since(start)
|
||||||
|
|
||||||
|
if elapsed > 100*time.Millisecond {
|
||||||
|
t.Errorf("parallel execution took too long: %s", elapsed)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestKeyedLocker_ContextTimeout(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
assert := internal.NewAssert(t, "TestKeyedLocker_ContextTimeout")
|
||||||
|
|
||||||
|
locker := NewKeyedLocker[string](100 * time.Millisecond)
|
||||||
|
|
||||||
|
ctx, cancel := context.WithTimeout(context.Background(), 10*time.Millisecond)
|
||||||
|
defer cancel()
|
||||||
|
|
||||||
|
// Lock key before calling
|
||||||
|
go func() {
|
||||||
|
_ = locker.Do(context.Background(), "key-timeout", func() {
|
||||||
|
time.Sleep(50 * time.Millisecond)
|
||||||
|
})
|
||||||
|
}()
|
||||||
|
|
||||||
|
time.Sleep(1 * time.Millisecond) // ensure lock is acquired first
|
||||||
|
|
||||||
|
err := locker.Do(ctx, "key-timeout", func() {
|
||||||
|
t.Error("should not execute")
|
||||||
|
})
|
||||||
|
|
||||||
|
assert.IsNotNil(err)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestKeyedLocker_LockReleaseAfterTTL(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
assert := internal.NewAssert(t, "TestKeyedLocker_LockReleaseAfterTTL")
|
||||||
|
|
||||||
|
locker := NewKeyedLocker[string](50 * time.Millisecond)
|
||||||
|
|
||||||
|
err := locker.Do(context.Background(), "ttl-key", func() {})
|
||||||
|
if err != nil {
|
||||||
|
t.Errorf("unexpected error: %v", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
// Wait for TTL to pass
|
||||||
|
time.Sleep(100 * time.Millisecond)
|
||||||
|
|
||||||
|
err = locker.Do(context.Background(), "ttl-key", func() {})
|
||||||
|
assert.IsNil(err)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestRWKeyedLocker_LockAndUnlock(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
assert := internal.NewAssert(t, "TestKeyedLocker_LockReleaseAfterTTL")
|
||||||
|
|
||||||
|
locker := NewRWKeyedLocker[string](500 * time.Millisecond)
|
||||||
|
|
||||||
|
var locked bool
|
||||||
|
err := locker.Lock(context.Background(), "key1", func() {
|
||||||
|
locked = true
|
||||||
|
})
|
||||||
|
|
||||||
|
assert.IsNil(err)
|
||||||
|
assert.Equal(true, locked)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestRWKeyedLocker_RLockParallel(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
assert := internal.NewAssert(t, "TestKeyedLocker_LockReleaseAfterTTL")
|
||||||
|
|
||||||
|
locker := NewRWKeyedLocker[string](1 * time.Second)
|
||||||
|
|
||||||
|
var mu sync.Mutex
|
||||||
|
var count int
|
||||||
|
wg := sync.WaitGroup{}
|
||||||
|
|
||||||
|
for i := 0; i < 5; i++ {
|
||||||
|
wg.Add(1)
|
||||||
|
go func() {
|
||||||
|
defer wg.Done()
|
||||||
|
err := locker.RLock(context.Background(), "shared-key", func() {
|
||||||
|
time.Sleep(10 * time.Millisecond)
|
||||||
|
mu.Lock()
|
||||||
|
count++
|
||||||
|
mu.Unlock()
|
||||||
|
})
|
||||||
|
|
||||||
|
assert.IsNil(err)
|
||||||
|
}()
|
||||||
|
}
|
||||||
|
|
||||||
|
wg.Wait()
|
||||||
|
|
||||||
|
assert.Equal(5, count)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestRWKeyedLocker_LockTimeout(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
assert := internal.NewAssert(t, "TestRWKeyedLocker_LockTimeout")
|
||||||
|
|
||||||
|
locker := NewRWKeyedLocker[string](1 * time.Second)
|
||||||
|
|
||||||
|
start := make(chan struct{})
|
||||||
|
|
||||||
|
go func() {
|
||||||
|
locker.Lock(context.Background(), "key-timeout", func() {
|
||||||
|
close(start)
|
||||||
|
time.Sleep(200 * time.Millisecond)
|
||||||
|
})
|
||||||
|
}()
|
||||||
|
|
||||||
|
<-start
|
||||||
|
ctx, cancel := context.WithTimeout(context.Background(), 50*time.Millisecond)
|
||||||
|
defer cancel()
|
||||||
|
|
||||||
|
err := locker.Lock(ctx, "key-timeout", func() {
|
||||||
|
t.Error("should not reach here")
|
||||||
|
})
|
||||||
|
|
||||||
|
assert.IsNotNil(err)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestTryKeyedLocker_SimpleLockUnlock(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
assert := internal.NewAssert(t, "TestTryKeyedLocker_SimpleLockUnlock")
|
||||||
|
|
||||||
|
locker := NewTryKeyedLocker[string]()
|
||||||
|
|
||||||
|
ok := locker.TryLock("key1")
|
||||||
|
assert.Equal(true, ok)
|
||||||
|
|
||||||
|
ok = locker.TryLock("key1")
|
||||||
|
assert.Equal(false, ok)
|
||||||
|
|
||||||
|
locker.Unlock("key1")
|
||||||
|
|
||||||
|
ok = locker.TryLock("key1")
|
||||||
|
assert.Equal(true, ok)
|
||||||
|
|
||||||
|
locker.Unlock("key1")
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestTryKeyedLocker_ParallelTry(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
assert := internal.NewAssert(t, "TestTryKeyedLocker_ParallelTry")
|
||||||
|
|
||||||
|
locker := NewTryKeyedLocker[string]()
|
||||||
|
|
||||||
|
var wg sync.WaitGroup
|
||||||
|
var mu sync.Mutex
|
||||||
|
var count int
|
||||||
|
|
||||||
|
for i := 0; i < 5; i++ {
|
||||||
|
wg.Add(1)
|
||||||
|
go func(i int) {
|
||||||
|
defer wg.Done()
|
||||||
|
ok := locker.TryLock("key" + strconv.Itoa(i))
|
||||||
|
mu.Lock()
|
||||||
|
if ok {
|
||||||
|
count++
|
||||||
|
}
|
||||||
|
mu.Unlock()
|
||||||
|
time.Sleep(10 * time.Millisecond)
|
||||||
|
if ok {
|
||||||
|
locker.Unlock("key" + strconv.Itoa(i))
|
||||||
|
}
|
||||||
|
}(i)
|
||||||
|
}
|
||||||
|
|
||||||
|
wg.Wait()
|
||||||
|
|
||||||
|
assert.Equal(5, count)
|
||||||
|
assert.Equal(0, len(locker.locks))
|
||||||
|
}
|
||||||
+10
-7
@@ -49,9 +49,7 @@ func Or[T, U any](a T, b U) bool {
|
|||||||
// Xor returns true if a or b but not both is truthy.
|
// Xor returns true if a or b but not both is truthy.
|
||||||
// Play: https://go.dev/play/p/gObZrW7ZbG8
|
// Play: https://go.dev/play/p/gObZrW7ZbG8
|
||||||
func Xor[T, U any](a T, b U) bool {
|
func Xor[T, U any](a T, b U) bool {
|
||||||
valA := Bool(a)
|
return Bool(a) != Bool(b)
|
||||||
valB := Bool(b)
|
|
||||||
return (valA || valB) && valA != valB
|
|
||||||
}
|
}
|
||||||
|
|
||||||
// Nor returns true if neither a nor b is truthy.
|
// Nor returns true if neither a nor b is truthy.
|
||||||
@@ -63,9 +61,7 @@ func Nor[T, U any](a T, b U) bool {
|
|||||||
// Xnor returns true if both a and b or neither a nor b are truthy.
|
// Xnor returns true if both a and b or neither a nor b are truthy.
|
||||||
// Play: https://go.dev/play/p/OuDB9g51643
|
// Play: https://go.dev/play/p/OuDB9g51643
|
||||||
func Xnor[T, U any](a T, b U) bool {
|
func Xnor[T, U any](a T, b U) bool {
|
||||||
valA := Bool(a)
|
return Bool(a) == Bool(b)
|
||||||
valB := Bool(b)
|
|
||||||
return (valA && valB) || (!valA && !valB)
|
|
||||||
}
|
}
|
||||||
|
|
||||||
// Nand returns false if both a and b are truthy.
|
// Nand returns false if both a and b are truthy.
|
||||||
@@ -76,10 +72,17 @@ func Nand[T, U any](a T, b U) bool {
|
|||||||
|
|
||||||
// TernaryOperator checks the value of param `isTrue`, if true return ifValue else return elseValue.
|
// TernaryOperator checks the value of param `isTrue`, if true return ifValue else return elseValue.
|
||||||
// Play: https://go.dev/play/p/ElllPZY0guT
|
// Play: https://go.dev/play/p/ElllPZY0guT
|
||||||
func TernaryOperator[T, U any](isTrue T, ifValue U, elseValue U) U {
|
func Ternary[T, U any](isTrue T, ifValue U, elseValue U) U {
|
||||||
if Bool(isTrue) {
|
if Bool(isTrue) {
|
||||||
return ifValue
|
return ifValue
|
||||||
} else {
|
} else {
|
||||||
return elseValue
|
return elseValue
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// TernaryOperator checks the value of param `isTrue`, if true return ifValue else return elseValue.
|
||||||
|
// Play: https://go.dev/play/p/ElllPZY0guT
|
||||||
|
// Deprecated: Use Ternary instead.
|
||||||
|
func TernaryOperator[T, U any](isTrue T, ifValue U, elseValue U) U {
|
||||||
|
return Ternary(isTrue, ifValue, elseValue)
|
||||||
|
}
|
||||||
@@ -148,13 +148,13 @@ func ExampleNand() {
|
|||||||
// false
|
// false
|
||||||
}
|
}
|
||||||
|
|
||||||
func ExampleTernaryOperator() {
|
func ExampleTernary() {
|
||||||
conditionTrue := 2 > 1
|
conditionTrue := 2 > 1
|
||||||
result1 := TernaryOperator(conditionTrue, 0, 1)
|
result1 := Ternary(conditionTrue, 0, 1)
|
||||||
fmt.Println(result1)
|
fmt.Println(result1)
|
||||||
|
|
||||||
conditionFalse := 2 > 3
|
conditionFalse := 2 > 3
|
||||||
result2 := TernaryOperator(conditionFalse, 0, 1)
|
result2 := Ternary(conditionFalse, 0, 1)
|
||||||
fmt.Println(result2)
|
fmt.Println(result2)
|
||||||
|
|
||||||
// Output:
|
// Output:
|
||||||
|
|||||||
@@ -11,6 +11,8 @@ import (
|
|||||||
type TestStruct struct{}
|
type TestStruct struct{}
|
||||||
|
|
||||||
func TestBool(t *testing.T) {
|
func TestBool(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestBool")
|
assert := internal.NewAssert(t, "TestBool")
|
||||||
|
|
||||||
// bool
|
// bool
|
||||||
@@ -63,6 +65,8 @@ func TestBool(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestAnd(t *testing.T) {
|
func TestAnd(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestAnd")
|
assert := internal.NewAssert(t, "TestAnd")
|
||||||
assert.Equal(false, And(0, 1))
|
assert.Equal(false, And(0, 1))
|
||||||
assert.Equal(false, And(0, ""))
|
assert.Equal(false, And(0, ""))
|
||||||
@@ -71,6 +75,8 @@ func TestAnd(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestOr(t *testing.T) {
|
func TestOr(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestOr")
|
assert := internal.NewAssert(t, "TestOr")
|
||||||
assert.Equal(false, Or(0, ""))
|
assert.Equal(false, Or(0, ""))
|
||||||
assert.Equal(true, Or(0, 1))
|
assert.Equal(true, Or(0, 1))
|
||||||
@@ -79,6 +85,8 @@ func TestOr(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestXor(t *testing.T) {
|
func TestXor(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestOr")
|
assert := internal.NewAssert(t, "TestOr")
|
||||||
assert.Equal(false, Xor(0, 0))
|
assert.Equal(false, Xor(0, 0))
|
||||||
assert.Equal(true, Xor(0, 1))
|
assert.Equal(true, Xor(0, 1))
|
||||||
@@ -87,6 +95,8 @@ func TestXor(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestNor(t *testing.T) {
|
func TestNor(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestNor")
|
assert := internal.NewAssert(t, "TestNor")
|
||||||
assert.Equal(true, Nor(0, 0))
|
assert.Equal(true, Nor(0, 0))
|
||||||
assert.Equal(false, Nor(0, 1))
|
assert.Equal(false, Nor(0, 1))
|
||||||
@@ -95,6 +105,8 @@ func TestNor(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestXnor(t *testing.T) {
|
func TestXnor(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestXnor")
|
assert := internal.NewAssert(t, "TestXnor")
|
||||||
assert.Equal(true, Xnor(0, 0))
|
assert.Equal(true, Xnor(0, 0))
|
||||||
assert.Equal(false, Xnor(0, 1))
|
assert.Equal(false, Xnor(0, 1))
|
||||||
@@ -103,6 +115,8 @@ func TestXnor(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestNand(t *testing.T) {
|
func TestNand(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestNand")
|
assert := internal.NewAssert(t, "TestNand")
|
||||||
assert.Equal(true, Nand(0, 0))
|
assert.Equal(true, Nand(0, 0))
|
||||||
assert.Equal(true, Nand(0, 1))
|
assert.Equal(true, Nand(0, 1))
|
||||||
@@ -110,10 +124,13 @@ func TestNand(t *testing.T) {
|
|||||||
assert.Equal(false, Nand(1, 1))
|
assert.Equal(false, Nand(1, 1))
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestTernaryOperator(t *testing.T) {
|
func TestTernary(t *testing.T) {
|
||||||
assert := internal.NewAssert(t, "TernaryOperator")
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestTernary")
|
||||||
|
|
||||||
trueValue := "1"
|
trueValue := "1"
|
||||||
falseValue := "0"
|
falseValue := "0"
|
||||||
|
|
||||||
assert.Equal(trueValue, TernaryOperator(true, trueValue, falseValue))
|
assert.Equal(trueValue, Ternary(true, trueValue, falseValue))
|
||||||
}
|
}
|
||||||
@@ -1,8 +1,8 @@
|
|||||||
// Copyright 2021 dudaodong@gmail.com. All rights reserved.
|
// Copyright 2021 dudaodong@gmail.com. All rights reserved.
|
||||||
// Use of this source code is governed by MIT license
|
// Use of this source code is governed by MIT license
|
||||||
|
|
||||||
// Package lancetconstraints contain some comstomer constraints.
|
// Package constraints contain some custom interface.
|
||||||
package lancetconstraints
|
package constraints
|
||||||
|
|
||||||
// Comparator is for comparing two values
|
// Comparator is for comparing two values
|
||||||
type Comparator interface {
|
type Comparator interface {
|
||||||
@@ -0,0 +1,23 @@
|
|||||||
|
package convertor
|
||||||
|
|
||||||
|
import (
|
||||||
|
"testing"
|
||||||
|
|
||||||
|
"github.com/duke-git/lancet/v2/internal"
|
||||||
|
)
|
||||||
|
|
||||||
|
func TestDeepCloneScalarTypes(t *testing.T) {
|
||||||
|
assert := internal.NewAssert(t, "TestDeepCloneScalarTypes")
|
||||||
|
type label string
|
||||||
|
type counter int64
|
||||||
|
assert.Equal(label("value"), DeepClone(label("value")))
|
||||||
|
assert.Equal(counter(42), DeepClone(counter(42)))
|
||||||
|
assert.Equal(uintptr(42), DeepClone(uintptr(42)))
|
||||||
|
value := label("pointed")
|
||||||
|
cloned := DeepClone(&value)
|
||||||
|
assert.Equal(value, *cloned)
|
||||||
|
*cloned = "changed"
|
||||||
|
assert.Equal(label("pointed"), value)
|
||||||
|
var empty any
|
||||||
|
assert.Equal(&empty, DeepClone(&empty))
|
||||||
|
}
|
||||||
+170
-8
@@ -6,6 +6,7 @@ package convertor
|
|||||||
|
|
||||||
import (
|
import (
|
||||||
"bytes"
|
"bytes"
|
||||||
|
"encoding/base64"
|
||||||
"encoding/binary"
|
"encoding/binary"
|
||||||
"encoding/gob"
|
"encoding/gob"
|
||||||
"encoding/json"
|
"encoding/json"
|
||||||
@@ -13,6 +14,7 @@ import (
|
|||||||
"fmt"
|
"fmt"
|
||||||
"io"
|
"io"
|
||||||
"math"
|
"math"
|
||||||
|
"math/big"
|
||||||
"reflect"
|
"reflect"
|
||||||
"strconv"
|
"strconv"
|
||||||
"strings"
|
"strings"
|
||||||
@@ -73,7 +75,7 @@ func ToBytes(value any) ([]byte, error) {
|
|||||||
// ToChar convert string to char slice.
|
// ToChar convert string to char slice.
|
||||||
// Play: https://go.dev/play/p/JJ1SvbFkVdM
|
// Play: https://go.dev/play/p/JJ1SvbFkVdM
|
||||||
func ToChar(s string) []string {
|
func ToChar(s string) []string {
|
||||||
c := make([]string, 0)
|
c := make([]string, 0, len(s))
|
||||||
if len(s) == 0 {
|
if len(s) == 0 {
|
||||||
c = append(c, "")
|
c = append(c, "")
|
||||||
}
|
}
|
||||||
@@ -106,6 +108,13 @@ func ToString(value any) string {
|
|||||||
if value == nil {
|
if value == nil {
|
||||||
return ""
|
return ""
|
||||||
}
|
}
|
||||||
|
rv := reflect.ValueOf(value)
|
||||||
|
if rv.Kind() == reflect.Ptr {
|
||||||
|
if rv.IsNil() {
|
||||||
|
return ""
|
||||||
|
}
|
||||||
|
return ToString(rv.Elem().Interface())
|
||||||
|
}
|
||||||
|
|
||||||
switch val := value.(type) {
|
switch val := value.(type) {
|
||||||
case float32:
|
case float32:
|
||||||
@@ -141,12 +150,8 @@ func ToString(value any) string {
|
|||||||
if err != nil {
|
if err != nil {
|
||||||
return ""
|
return ""
|
||||||
}
|
}
|
||||||
return string(b)
|
|
||||||
|
|
||||||
// todo: maybe we should't supprt other type conversion
|
return string(b)
|
||||||
// v := reflect.ValueOf(value)
|
|
||||||
// log.Panicf("Unsupported data type: %s ", v.String())
|
|
||||||
// return ""
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -223,6 +228,42 @@ func ToPointer[T any](value T) *T {
|
|||||||
return &value
|
return &value
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// ToPointers convert a slice of values to a slice of pointers.
|
||||||
|
// Play: https://go.dev/play/p/ZUoXd2i5ZkV
|
||||||
|
func ToPointers[T any](values []T) []*T {
|
||||||
|
result := make([]*T, len(values))
|
||||||
|
for i := range values {
|
||||||
|
result[i] = &values[i]
|
||||||
|
}
|
||||||
|
return result
|
||||||
|
}
|
||||||
|
|
||||||
|
// FromPointer returns the value pointed to by the pointer.
|
||||||
|
// Play: https://go.dev/play/p/wAp90V7Zu6g
|
||||||
|
func FromPointer[T any](ptr *T) T {
|
||||||
|
if ptr == nil {
|
||||||
|
var zeroValue T
|
||||||
|
return zeroValue
|
||||||
|
}
|
||||||
|
|
||||||
|
return *ptr
|
||||||
|
}
|
||||||
|
|
||||||
|
// FromPointers convert a slice of pointers to a slice of values.
|
||||||
|
// Play: https://go.dev/play/p/qIPsyYtNy3Q
|
||||||
|
func FromPointers[T any](pointers []*T) []T {
|
||||||
|
result := make([]T, len(pointers))
|
||||||
|
for i, ptr := range pointers {
|
||||||
|
if ptr == nil {
|
||||||
|
var zeroValue T
|
||||||
|
result[i] = zeroValue
|
||||||
|
} else {
|
||||||
|
result[i] = *ptr
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return result
|
||||||
|
}
|
||||||
|
|
||||||
// ToMap convert a slice of structs to a map based on iteratee function.
|
// ToMap convert a slice of structs to a map based on iteratee function.
|
||||||
// Play: https://go.dev/play/p/tVFy7E-t24l
|
// Play: https://go.dev/play/p/tVFy7E-t24l
|
||||||
func ToMap[T any, K comparable, V any](array []T, iteratee func(T) (K, V)) map[K]V {
|
func ToMap[T any, K comparable, V any](array []T, iteratee func(T) (K, V)) map[K]V {
|
||||||
@@ -380,7 +421,7 @@ func ToInterface(v reflect.Value) (value interface{}, ok bool) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
// Utf8ToGbk convert utf8 encoding data to GBK encoding data.
|
// Utf8ToGbk convert utf8 encoding data to GBK encoding data.
|
||||||
// Play: todo
|
// Play: https://go.dev/play/p/9FlIaFLArIL
|
||||||
func Utf8ToGbk(bs []byte) ([]byte, error) {
|
func Utf8ToGbk(bs []byte) ([]byte, error) {
|
||||||
r := transform.NewReader(bytes.NewReader(bs), simplifiedchinese.GBK.NewEncoder())
|
r := transform.NewReader(bytes.NewReader(bs), simplifiedchinese.GBK.NewEncoder())
|
||||||
b, err := io.ReadAll(r)
|
b, err := io.ReadAll(r)
|
||||||
@@ -388,9 +429,130 @@ func Utf8ToGbk(bs []byte) ([]byte, error) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
// GbkToUtf8 convert GBK encoding data to utf8 encoding data.
|
// GbkToUtf8 convert GBK encoding data to utf8 encoding data.
|
||||||
// Play: todo
|
// Play: https://go.dev/play/p/OphmHCN_9u8
|
||||||
func GbkToUtf8(bs []byte) ([]byte, error) {
|
func GbkToUtf8(bs []byte) ([]byte, error) {
|
||||||
r := transform.NewReader(bytes.NewReader(bs), simplifiedchinese.GBK.NewDecoder())
|
r := transform.NewReader(bytes.NewReader(bs), simplifiedchinese.GBK.NewDecoder())
|
||||||
b, err := io.ReadAll(r)
|
b, err := io.ReadAll(r)
|
||||||
return b, err
|
return b, err
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// ToStdBase64 convert data to standard base64 encoding.
|
||||||
|
// Play: https://go.dev/play/p/_fLJqJD3NMo
|
||||||
|
func ToStdBase64(value any) string {
|
||||||
|
if value == nil || (reflect.ValueOf(value).Kind() == reflect.Ptr && reflect.ValueOf(value).IsNil()) {
|
||||||
|
return ""
|
||||||
|
}
|
||||||
|
switch v := value.(type) {
|
||||||
|
case []byte:
|
||||||
|
return base64.StdEncoding.EncodeToString(v)
|
||||||
|
case string:
|
||||||
|
return base64.StdEncoding.EncodeToString([]byte(v))
|
||||||
|
case error:
|
||||||
|
return base64.StdEncoding.EncodeToString([]byte(v.Error()))
|
||||||
|
default:
|
||||||
|
marshal, err := json.Marshal(v)
|
||||||
|
if err != nil {
|
||||||
|
return ""
|
||||||
|
}
|
||||||
|
return base64.StdEncoding.EncodeToString(marshal)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// ToUrlBase64 convert data to URL base64 encoding.
|
||||||
|
// Play: https://go.dev/play/p/C_d0GlvEeUR
|
||||||
|
func ToUrlBase64(value any) string {
|
||||||
|
if value == nil || (reflect.ValueOf(value).Kind() == reflect.Ptr && reflect.ValueOf(value).IsNil()) {
|
||||||
|
return ""
|
||||||
|
}
|
||||||
|
switch v := value.(type) {
|
||||||
|
case []byte:
|
||||||
|
return base64.URLEncoding.EncodeToString(v)
|
||||||
|
case string:
|
||||||
|
return base64.URLEncoding.EncodeToString([]byte(v))
|
||||||
|
case error:
|
||||||
|
return base64.URLEncoding.EncodeToString([]byte(v.Error()))
|
||||||
|
default:
|
||||||
|
marshal, err := json.Marshal(v)
|
||||||
|
if err != nil {
|
||||||
|
return ""
|
||||||
|
}
|
||||||
|
return base64.URLEncoding.EncodeToString(marshal)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// ToRawStdBase64 convert data to raw standard base64 encoding.
|
||||||
|
// Play: https://go.dev/play/p/wSAr3sfkDcv
|
||||||
|
func ToRawStdBase64(value any) string {
|
||||||
|
if value == nil || (reflect.ValueOf(value).Kind() == reflect.Ptr && reflect.ValueOf(value).IsNil()) {
|
||||||
|
return ""
|
||||||
|
}
|
||||||
|
switch v := value.(type) {
|
||||||
|
case []byte:
|
||||||
|
return base64.RawStdEncoding.EncodeToString(value.([]byte))
|
||||||
|
case string:
|
||||||
|
return base64.RawStdEncoding.EncodeToString([]byte(value.(string)))
|
||||||
|
case error:
|
||||||
|
return base64.RawStdEncoding.EncodeToString([]byte(value.(error).Error()))
|
||||||
|
default:
|
||||||
|
marshal, err := json.Marshal(v)
|
||||||
|
if err != nil {
|
||||||
|
return ""
|
||||||
|
}
|
||||||
|
return base64.RawStdEncoding.EncodeToString(marshal)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// ToRawUrlBase64 convert data to raw URL base64 encoding.
|
||||||
|
// Play: https://go.dev/play/p/HwdDPFcza1O
|
||||||
|
func ToRawUrlBase64(value any) string {
|
||||||
|
if value == nil || (reflect.ValueOf(value).Kind() == reflect.Ptr && reflect.ValueOf(value).IsNil()) {
|
||||||
|
return ""
|
||||||
|
}
|
||||||
|
switch v := value.(type) {
|
||||||
|
case []byte:
|
||||||
|
return base64.RawURLEncoding.EncodeToString(value.([]byte))
|
||||||
|
case string:
|
||||||
|
return base64.RawURLEncoding.EncodeToString([]byte(value.(string)))
|
||||||
|
case error:
|
||||||
|
return base64.RawURLEncoding.EncodeToString([]byte(value.(error).Error()))
|
||||||
|
default:
|
||||||
|
marshal, err := json.Marshal(v)
|
||||||
|
if err != nil {
|
||||||
|
return ""
|
||||||
|
}
|
||||||
|
return base64.RawURLEncoding.EncodeToString(marshal)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// ToBigInt converts an integer of any supported type (int, int64, uint64, etc.) to *big.Int
|
||||||
|
// Play: https://go.dev/play/p/X3itkCxwB_x
|
||||||
|
func ToBigInt[T any](v T) (*big.Int, error) {
|
||||||
|
result := new(big.Int)
|
||||||
|
|
||||||
|
switch v := any(v).(type) {
|
||||||
|
case int:
|
||||||
|
result.SetInt64(int64(v)) // Convert to int64 for big.Int
|
||||||
|
case int8:
|
||||||
|
result.SetInt64(int64(v))
|
||||||
|
case int16:
|
||||||
|
result.SetInt64(int64(v))
|
||||||
|
case int32:
|
||||||
|
result.SetInt64(int64(v))
|
||||||
|
case int64:
|
||||||
|
result.SetInt64(v)
|
||||||
|
case uint:
|
||||||
|
result.SetUint64(uint64(v)) // Convert to uint64 for big.Int
|
||||||
|
case uint8:
|
||||||
|
result.SetUint64(uint64(v))
|
||||||
|
case uint16:
|
||||||
|
result.SetUint64(uint64(v))
|
||||||
|
case uint32:
|
||||||
|
result.SetUint64(uint64(v))
|
||||||
|
case uint64:
|
||||||
|
result.SetUint64(v)
|
||||||
|
default:
|
||||||
|
return nil, fmt.Errorf("unsupported type: %T", v)
|
||||||
|
}
|
||||||
|
|
||||||
|
return result, nil
|
||||||
|
}
|
||||||
@@ -1,6 +1,7 @@
|
|||||||
package convertor
|
package convertor
|
||||||
|
|
||||||
import (
|
import (
|
||||||
|
"errors"
|
||||||
"fmt"
|
"fmt"
|
||||||
"reflect"
|
"reflect"
|
||||||
"strconv"
|
"strconv"
|
||||||
@@ -168,6 +169,45 @@ func ExampleToPointer() {
|
|||||||
// 123
|
// 123
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func ExampleToPointers() {
|
||||||
|
strs := []string{"a", "b", "c"}
|
||||||
|
pointerStrs := ToPointers(strs)
|
||||||
|
fmt.Println(*pointerStrs[0])
|
||||||
|
fmt.Println(*pointerStrs[1])
|
||||||
|
fmt.Println(*pointerStrs[2])
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// a
|
||||||
|
// b
|
||||||
|
// c
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleFromPointer() {
|
||||||
|
str := "abc"
|
||||||
|
strPtr := &str
|
||||||
|
result := FromPointer(strPtr)
|
||||||
|
fmt.Println(result)
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// abc
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleFromPointers() {
|
||||||
|
strs := []string{"a", "b", "c"}
|
||||||
|
strPtr := []*string{&strs[0], &strs[1], &strs[2]}
|
||||||
|
|
||||||
|
result := FromPointers(strPtr)
|
||||||
|
|
||||||
|
fmt.Println(result[0])
|
||||||
|
fmt.Println(result[1])
|
||||||
|
fmt.Println(result[2])
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// a
|
||||||
|
// b
|
||||||
|
// c
|
||||||
|
}
|
||||||
|
|
||||||
func ExampleToMap() {
|
func ExampleToMap() {
|
||||||
type Message struct {
|
type Message struct {
|
||||||
name string
|
name string
|
||||||
@@ -391,3 +431,191 @@ func ExampleGbkToUtf8() {
|
|||||||
// true
|
// true
|
||||||
// hello
|
// hello
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func ExampleToStdBase64() {
|
||||||
|
// if you want to see the result, please use 'base64.StdEncoding.DecodeString()' to decode the result
|
||||||
|
|
||||||
|
afterEncode := ToStdBase64(nil)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
stringVal := "hello"
|
||||||
|
afterEncode = ToStdBase64(stringVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
byteSliceVal := []byte("hello")
|
||||||
|
afterEncode = ToStdBase64(byteSliceVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
intVal := 123
|
||||||
|
afterEncode = ToStdBase64(intVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
mapVal := map[string]any{"a": "hi", "b": 2, "c": struct {
|
||||||
|
A string
|
||||||
|
B int
|
||||||
|
}{"hello", 3}}
|
||||||
|
afterEncode = ToStdBase64(mapVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
floatVal := 123.456
|
||||||
|
afterEncode = ToStdBase64(floatVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
boolVal := true
|
||||||
|
afterEncode = ToStdBase64(boolVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
errVal := errors.New("err")
|
||||||
|
afterEncode = ToStdBase64(errVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
//
|
||||||
|
// aGVsbG8=
|
||||||
|
// aGVsbG8=
|
||||||
|
// MTIz
|
||||||
|
// eyJhIjoiaGkiLCJiIjoyLCJjIjp7IkEiOiJoZWxsbyIsIkIiOjN9fQ==
|
||||||
|
// MTIzLjQ1Ng==
|
||||||
|
// dHJ1ZQ==
|
||||||
|
// ZXJy
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleToUrlBase64() {
|
||||||
|
// if you want to see the result, please use 'base64.URLEncoding.DecodeString()' to decode the result
|
||||||
|
|
||||||
|
stringVal := "hello"
|
||||||
|
afterEncode := ToUrlBase64(stringVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
byteSliceVal := []byte("hello")
|
||||||
|
afterEncode = ToUrlBase64(byteSliceVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
intVal := 123
|
||||||
|
afterEncode = ToUrlBase64(intVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
mapVal := map[string]any{"a": "hi", "b": 2, "c": struct {
|
||||||
|
A string
|
||||||
|
B int
|
||||||
|
}{"hello", 3}}
|
||||||
|
afterEncode = ToUrlBase64(mapVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
floatVal := 123.456
|
||||||
|
afterEncode = ToUrlBase64(floatVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
boolVal := true
|
||||||
|
afterEncode = ToUrlBase64(boolVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
errVal := errors.New("err")
|
||||||
|
afterEncode = ToUrlBase64(errVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// aGVsbG8=
|
||||||
|
// aGVsbG8=
|
||||||
|
// MTIz
|
||||||
|
// eyJhIjoiaGkiLCJiIjoyLCJjIjp7IkEiOiJoZWxsbyIsIkIiOjN9fQ==
|
||||||
|
// MTIzLjQ1Ng==
|
||||||
|
// dHJ1ZQ==
|
||||||
|
// ZXJy
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleToRawStdBase64() {
|
||||||
|
// if you want to see the result, please use 'base64.RawStdEncoding.DecodeString()' to decode the result
|
||||||
|
stringVal := "hello"
|
||||||
|
afterEncode := ToRawStdBase64(stringVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
byteSliceVal := []byte("hello")
|
||||||
|
afterEncode = ToRawStdBase64(byteSliceVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
intVal := 123
|
||||||
|
afterEncode = ToRawStdBase64(intVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
mapVal := map[string]any{"a": "hi", "b": 2, "c": struct {
|
||||||
|
A string
|
||||||
|
B int
|
||||||
|
}{"hello", 3}}
|
||||||
|
afterEncode = ToRawStdBase64(mapVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
floatVal := 123.456
|
||||||
|
afterEncode = ToRawStdBase64(floatVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
boolVal := true
|
||||||
|
afterEncode = ToRawStdBase64(boolVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
errVal := errors.New("err")
|
||||||
|
afterEncode = ToRawStdBase64(errVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// aGVsbG8
|
||||||
|
// aGVsbG8
|
||||||
|
// MTIz
|
||||||
|
// eyJhIjoiaGkiLCJiIjoyLCJjIjp7IkEiOiJoZWxsbyIsIkIiOjN9fQ
|
||||||
|
// MTIzLjQ1Ng
|
||||||
|
// dHJ1ZQ
|
||||||
|
// ZXJy
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleToRawUrlBase64() {
|
||||||
|
// if you want to see the result, please use 'base64.RawURLEncoding.DecodeString()' to decode the result
|
||||||
|
|
||||||
|
stringVal := "hello"
|
||||||
|
afterEncode := ToRawUrlBase64(stringVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
byteSliceVal := []byte("hello")
|
||||||
|
afterEncode = ToRawUrlBase64(byteSliceVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
intVal := 123
|
||||||
|
afterEncode = ToRawUrlBase64(intVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
mapVal := map[string]any{"a": "hi", "b": 2, "c": struct {
|
||||||
|
A string
|
||||||
|
B int
|
||||||
|
}{"hello", 3}}
|
||||||
|
afterEncode = ToRawUrlBase64(mapVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
floatVal := 123.456
|
||||||
|
afterEncode = ToRawUrlBase64(floatVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
boolVal := true
|
||||||
|
afterEncode = ToRawUrlBase64(boolVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
errVal := errors.New("err")
|
||||||
|
afterEncode = ToRawUrlBase64(errVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// aGVsbG8
|
||||||
|
// aGVsbG8
|
||||||
|
// MTIz
|
||||||
|
// eyJhIjoiaGkiLCJiIjoyLCJjIjp7IkEiOiJoZWxsbyIsIkIiOjN9fQ
|
||||||
|
// MTIzLjQ1Ng
|
||||||
|
// dHJ1ZQ
|
||||||
|
// ZXJy
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleToBigInt() {
|
||||||
|
n := 9876543210
|
||||||
|
bigInt, _ := ToBigInt(n)
|
||||||
|
|
||||||
|
fmt.Println(bigInt)
|
||||||
|
// Output:
|
||||||
|
// 9876543210
|
||||||
|
}
|
||||||
@@ -16,49 +16,10 @@ func (c *cloner) clone(v reflect.Value) reflect.Value {
|
|||||||
case reflect.Invalid:
|
case reflect.Invalid:
|
||||||
return reflect.ValueOf(nil)
|
return reflect.ValueOf(nil)
|
||||||
|
|
||||||
// bool
|
case reflect.Bool, reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64,
|
||||||
case reflect.Bool:
|
reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uintptr,
|
||||||
return reflect.ValueOf(v.Bool())
|
reflect.Float32, reflect.Float64, reflect.Complex64, reflect.Complex128, reflect.String:
|
||||||
|
return v
|
||||||
//int
|
|
||||||
case reflect.Int:
|
|
||||||
return reflect.ValueOf(int(v.Int()))
|
|
||||||
case reflect.Int8:
|
|
||||||
return reflect.ValueOf(int8(v.Int()))
|
|
||||||
case reflect.Int16:
|
|
||||||
return reflect.ValueOf(int16(v.Int()))
|
|
||||||
case reflect.Int32:
|
|
||||||
return reflect.ValueOf(int32(v.Int()))
|
|
||||||
case reflect.Int64:
|
|
||||||
return reflect.ValueOf(v.Int())
|
|
||||||
|
|
||||||
// uint
|
|
||||||
case reflect.Uint:
|
|
||||||
return reflect.ValueOf(uint(v.Uint()))
|
|
||||||
case reflect.Uint8:
|
|
||||||
return reflect.ValueOf(uint8(v.Uint()))
|
|
||||||
case reflect.Uint16:
|
|
||||||
return reflect.ValueOf(uint16(v.Uint()))
|
|
||||||
case reflect.Uint32:
|
|
||||||
return reflect.ValueOf(uint32(v.Uint()))
|
|
||||||
case reflect.Uint64:
|
|
||||||
return reflect.ValueOf(v.Uint())
|
|
||||||
|
|
||||||
// float
|
|
||||||
case reflect.Float32:
|
|
||||||
return reflect.ValueOf(float32(v.Float()))
|
|
||||||
case reflect.Float64:
|
|
||||||
return reflect.ValueOf(v.Float())
|
|
||||||
|
|
||||||
// complex
|
|
||||||
case reflect.Complex64:
|
|
||||||
return reflect.ValueOf(complex64(v.Complex()))
|
|
||||||
case reflect.Complex128:
|
|
||||||
return reflect.ValueOf(v.Complex())
|
|
||||||
|
|
||||||
// string
|
|
||||||
case reflect.String:
|
|
||||||
return reflect.ValueOf(v.String())
|
|
||||||
|
|
||||||
// array
|
// array
|
||||||
case reflect.Array, reflect.Slice:
|
case reflect.Array, reflect.Slice:
|
||||||
@@ -90,16 +51,21 @@ func (c *cloner) clone(v reflect.Value) reflect.Value {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func (c *cloner) cloneArray(v reflect.Value) reflect.Value {
|
func (c *cloner) cloneArray(v reflect.Value) reflect.Value {
|
||||||
if v.IsNil() {
|
if v.Kind() == reflect.Slice && v.IsNil() {
|
||||||
return reflect.Zero(v.Type())
|
return reflect.Zero(v.Type())
|
||||||
}
|
}
|
||||||
|
|
||||||
arr := reflect.MakeSlice(v.Type(), v.Len(), v.Len())
|
var arr reflect.Value
|
||||||
|
if v.Kind() == reflect.Array {
|
||||||
|
arr = reflect.New(v.Type()).Elem()
|
||||||
|
} else {
|
||||||
|
arr = reflect.MakeSlice(v.Type(), v.Len(), v.Len())
|
||||||
|
}
|
||||||
|
|
||||||
for i := 0; i < v.Len(); i++ {
|
for i := 0; i < v.Len(); i++ {
|
||||||
val := c.clone(v.Index(i))
|
val := c.clone(v.Index(i))
|
||||||
|
|
||||||
if val.IsValid() {
|
if !val.IsValid() {
|
||||||
continue
|
continue
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -179,8 +145,10 @@ func (c *cloner) clonePtr(v reflect.Value) reflect.Value {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
clonedPtr := reflect.New(newVal.Type())
|
clonedPtr := reflect.New(v.Type().Elem())
|
||||||
clonedPtr.Elem().Set(newVal)
|
if newVal.IsValid() {
|
||||||
|
clonedPtr.Elem().Set(newVal)
|
||||||
|
}
|
||||||
|
|
||||||
return clonedPtr
|
return clonedPtr
|
||||||
}
|
}
|
||||||
|
|||||||
+497
-1
@@ -1,11 +1,16 @@
|
|||||||
package convertor
|
package convertor
|
||||||
|
|
||||||
import (
|
import (
|
||||||
|
"encoding/base64"
|
||||||
|
"errors"
|
||||||
"fmt"
|
"fmt"
|
||||||
|
"io"
|
||||||
|
"math/big"
|
||||||
"reflect"
|
"reflect"
|
||||||
"strconv"
|
"strconv"
|
||||||
"testing"
|
"testing"
|
||||||
"unicode/utf8"
|
"unicode/utf8"
|
||||||
|
"unsafe"
|
||||||
|
|
||||||
"github.com/duke-git/lancet/v2/internal"
|
"github.com/duke-git/lancet/v2/internal"
|
||||||
"github.com/duke-git/lancet/v2/slice"
|
"github.com/duke-git/lancet/v2/slice"
|
||||||
@@ -13,6 +18,8 @@ import (
|
|||||||
)
|
)
|
||||||
|
|
||||||
func TestToChar(t *testing.T) {
|
func TestToChar(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestToChar")
|
assert := internal.NewAssert(t, "TestToChar")
|
||||||
|
|
||||||
cases := []string{"", "abc", "1 2#3"}
|
cases := []string{"", "abc", "1 2#3"}
|
||||||
@@ -27,6 +34,8 @@ func TestToChar(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestToChannel(t *testing.T) {
|
func TestToChannel(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestToChannel")
|
assert := internal.NewAssert(t, "TestToChannel")
|
||||||
|
|
||||||
ch := ToChannel([]int{1, 2, 3})
|
ch := ToChannel([]int{1, 2, 3})
|
||||||
@@ -39,6 +48,8 @@ func TestToChannel(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestToBool(t *testing.T) {
|
func TestToBool(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestToBool")
|
assert := internal.NewAssert(t, "TestToBool")
|
||||||
|
|
||||||
cases := []string{"1", "true", "True", "false", "False", "0", "123", "0.0", "abc"}
|
cases := []string{"1", "true", "True", "false", "False", "0", "123", "0.0", "abc"}
|
||||||
@@ -51,6 +62,8 @@ func TestToBool(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestToBytes(t *testing.T) {
|
func TestToBytes(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestToBytes")
|
assert := internal.NewAssert(t, "TestToBytes")
|
||||||
|
|
||||||
cases := []any{
|
cases := []any{
|
||||||
@@ -77,6 +90,8 @@ func TestToBytes(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestToInt(t *testing.T) {
|
func TestToInt(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestToInt")
|
assert := internal.NewAssert(t, "TestToInt")
|
||||||
|
|
||||||
cases := []any{"123", "-123", 123,
|
cases := []any{"123", "-123", 123,
|
||||||
@@ -93,6 +108,8 @@ func TestToInt(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestToFloat(t *testing.T) {
|
func TestToFloat(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestToFloat")
|
assert := internal.NewAssert(t, "TestToFloat")
|
||||||
|
|
||||||
cases := []any{
|
cases := []any{
|
||||||
@@ -111,6 +128,8 @@ func TestToFloat(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestToString(t *testing.T) {
|
func TestToString(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestToString")
|
assert := internal.NewAssert(t, "TestToString")
|
||||||
|
|
||||||
aMap := make(map[string]int)
|
aMap := make(map[string]int)
|
||||||
@@ -123,13 +142,24 @@ func TestToString(t *testing.T) {
|
|||||||
}
|
}
|
||||||
aStruct := TestStruct{Name: "TestStruct"}
|
aStruct := TestStruct{Name: "TestStruct"}
|
||||||
|
|
||||||
|
i32Val := int32(123)
|
||||||
|
i64Val := int64(123)
|
||||||
|
iZeroVal := 0
|
||||||
|
fVal := 12.3
|
||||||
|
sVal := "abc"
|
||||||
|
var iNilPointer *int
|
||||||
|
var sNilPointer *string
|
||||||
|
|
||||||
cases := []any{
|
cases := []any{
|
||||||
"", nil,
|
"", nil,
|
||||||
int(0), int8(1), int16(-1), int32(123), int64(123),
|
int(0), int8(1), int16(-1), int32(123), int64(123),
|
||||||
uint(123), uint8(123), uint16(123), uint32(123), uint64(123),
|
uint(123), uint8(123), uint16(123), uint32(123), uint64(123),
|
||||||
float64(12.3), float32(12.3),
|
float64(12.3), float32(12.3),
|
||||||
true, false,
|
true, false,
|
||||||
[]int{1, 2, 3}, aMap, aStruct, []byte{104, 101, 108, 108, 111}}
|
[]int{1, 2, 3}, aMap, aStruct, []byte{104, 101, 108, 108, 111},
|
||||||
|
&i32Val, &i64Val, &fVal, &sVal, &aStruct, iNilPointer, sNilPointer,
|
||||||
|
&iZeroVal,
|
||||||
|
}
|
||||||
|
|
||||||
expected := []string{
|
expected := []string{
|
||||||
"", "",
|
"", "",
|
||||||
@@ -138,6 +168,8 @@ func TestToString(t *testing.T) {
|
|||||||
"12.3", "12.3",
|
"12.3", "12.3",
|
||||||
"true", "false",
|
"true", "false",
|
||||||
"[1,2,3]", "{\"a\":1,\"b\":2,\"c\":3}", "{\"Name\":\"TestStruct\"}", "hello",
|
"[1,2,3]", "{\"a\":1,\"b\":2,\"c\":3}", "{\"Name\":\"TestStruct\"}", "hello",
|
||||||
|
"123", "123", "12.3", "abc", "{\"Name\":\"TestStruct\"}", "", "",
|
||||||
|
"0",
|
||||||
}
|
}
|
||||||
|
|
||||||
for i := 0; i < len(cases); i++ {
|
for i := 0; i < len(cases); i++ {
|
||||||
@@ -146,6 +178,8 @@ func TestToString(t *testing.T) {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
func TestToJson(t *testing.T) {
|
func TestToJson(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestToJson")
|
assert := internal.NewAssert(t, "TestToJson")
|
||||||
|
|
||||||
var aMap = map[string]int{"a": 1, "b": 2, "c": 3}
|
var aMap = map[string]int{"a": 1, "b": 2, "c": 3}
|
||||||
@@ -161,6 +195,8 @@ func TestToJson(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestToMap(t *testing.T) {
|
func TestToMap(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestToMap")
|
assert := internal.NewAssert(t, "TestToMap")
|
||||||
|
|
||||||
type Message struct {
|
type Message struct {
|
||||||
@@ -180,6 +216,8 @@ func TestToMap(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestStructToMap(t *testing.T) {
|
func TestStructToMap(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestStructToMap")
|
assert := internal.NewAssert(t, "TestStructToMap")
|
||||||
|
|
||||||
t.Run("StructToMap", func(_ *testing.T) {
|
t.Run("StructToMap", func(_ *testing.T) {
|
||||||
@@ -215,6 +253,8 @@ func TestStructToMap(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestMapToSlice(t *testing.T) {
|
func TestMapToSlice(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestMapToSlice")
|
assert := internal.NewAssert(t, "TestMapToSlice")
|
||||||
|
|
||||||
aMap := map[string]int{"a": 1, "b": 2, "c": 3}
|
aMap := map[string]int{"a": 1, "b": 2, "c": 3}
|
||||||
@@ -229,6 +269,8 @@ func TestMapToSlice(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestColorHexToRGB(t *testing.T) {
|
func TestColorHexToRGB(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
colorHex := "#003366"
|
colorHex := "#003366"
|
||||||
r, g, b := ColorHexToRGB(colorHex)
|
r, g, b := ColorHexToRGB(colorHex)
|
||||||
colorRGB := fmt.Sprintf("%d,%d,%d", r, g, b)
|
colorRGB := fmt.Sprintf("%d,%d,%d", r, g, b)
|
||||||
@@ -239,6 +281,8 @@ func TestColorHexToRGB(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestColorRGBToHex(t *testing.T) {
|
func TestColorRGBToHex(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
r := 0
|
r := 0
|
||||||
g := 51
|
g := 51
|
||||||
b := 102
|
b := 102
|
||||||
@@ -250,13 +294,86 @@ func TestColorRGBToHex(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestToPointer(t *testing.T) {
|
func TestToPointer(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestToPointer")
|
assert := internal.NewAssert(t, "TestToPointer")
|
||||||
result := ToPointer(123)
|
result := ToPointer(123)
|
||||||
|
|
||||||
assert.Equal(*result, 123)
|
assert.Equal(*result, 123)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func TestToPointers(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestToPointers")
|
||||||
|
|
||||||
|
intVals := []int{1, 2, 3}
|
||||||
|
result := ToPointers(intVals)
|
||||||
|
|
||||||
|
assert.Equal(3, len(result))
|
||||||
|
assert.Equal(1, *result[0])
|
||||||
|
assert.Equal(2, *result[1])
|
||||||
|
assert.Equal(3, *result[2])
|
||||||
|
|
||||||
|
stringVals := []string{"a", "b", "c"}
|
||||||
|
resultStr := ToPointers(stringVals)
|
||||||
|
assert.Equal(3, len(resultStr))
|
||||||
|
assert.Equal("a", *resultStr[0])
|
||||||
|
assert.Equal("b", *resultStr[1])
|
||||||
|
assert.Equal("c", *resultStr[2])
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestFromPointer(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestFromPointer")
|
||||||
|
|
||||||
|
intVal := 123
|
||||||
|
pointer := &intVal
|
||||||
|
result := FromPointer(pointer)
|
||||||
|
|
||||||
|
assert.Equal(123, result)
|
||||||
|
|
||||||
|
stringVal := "abc"
|
||||||
|
stringPointer := &stringVal
|
||||||
|
resultStr := FromPointer(stringPointer)
|
||||||
|
|
||||||
|
assert.Equal("abc", resultStr)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestFromPointers(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestFromPointers")
|
||||||
|
|
||||||
|
intPointers := []*int{new(int), new(int), new(int)}
|
||||||
|
*intPointers[0] = 1
|
||||||
|
*intPointers[1] = 2
|
||||||
|
*intPointers[2] = 3
|
||||||
|
|
||||||
|
result := FromPointers(intPointers)
|
||||||
|
|
||||||
|
assert.Equal(3, len(result))
|
||||||
|
assert.Equal(1, result[0])
|
||||||
|
assert.Equal(2, result[1])
|
||||||
|
assert.Equal(3, result[2])
|
||||||
|
|
||||||
|
stringPointers := []*string{new(string), new(string), new(string)}
|
||||||
|
*stringPointers[0] = "a"
|
||||||
|
*stringPointers[1] = "b"
|
||||||
|
*stringPointers[2] = "c"
|
||||||
|
|
||||||
|
resultStr := FromPointers(stringPointers)
|
||||||
|
|
||||||
|
assert.Equal(3, len(resultStr))
|
||||||
|
assert.Equal("a", resultStr[0])
|
||||||
|
assert.Equal("b", resultStr[1])
|
||||||
|
assert.Equal("c", resultStr[2])
|
||||||
|
}
|
||||||
|
|
||||||
func TestEncodeByte(t *testing.T) {
|
func TestEncodeByte(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestEncodeByte")
|
assert := internal.NewAssert(t, "TestEncodeByte")
|
||||||
|
|
||||||
byteData, _ := EncodeByte("abc")
|
byteData, _ := EncodeByte("abc")
|
||||||
@@ -266,6 +383,8 @@ func TestEncodeByte(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestDecodeByte(t *testing.T) {
|
func TestDecodeByte(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestDecodeByte")
|
assert := internal.NewAssert(t, "TestDecodeByte")
|
||||||
|
|
||||||
var obj string
|
var obj string
|
||||||
@@ -275,7 +394,21 @@ func TestDecodeByte(t *testing.T) {
|
|||||||
assert.Equal("abc", obj)
|
assert.Equal("abc", obj)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func TestDeepCloneArrays(t *testing.T) {
|
||||||
|
assert := internal.NewAssert(t, "TestDeepCloneArrays")
|
||||||
|
value := 42
|
||||||
|
type pair [2]*int
|
||||||
|
src := pair{&value, nil}
|
||||||
|
got := DeepClone(src)
|
||||||
|
assert.Equal(src, got)
|
||||||
|
*got[0] = 99
|
||||||
|
assert.Equal(42, *src[0])
|
||||||
|
assert.Equal([0]int{}, DeepClone([0]int{}))
|
||||||
|
}
|
||||||
|
|
||||||
func TestDeepClone(t *testing.T) {
|
func TestDeepClone(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
// assert := internal.NewAssert(t, "TestDeepClone")
|
// assert := internal.NewAssert(t, "TestDeepClone")
|
||||||
|
|
||||||
type Struct struct {
|
type Struct struct {
|
||||||
@@ -303,6 +436,7 @@ func TestDeepClone(t *testing.T) {
|
|||||||
Nil: nil,
|
Nil: nil,
|
||||||
// unexported: "can't be cloned",
|
// unexported: "can't be cloned",
|
||||||
},
|
},
|
||||||
|
[]interface{}{1, &Struct{Str: "test"}, Struct{Str: "test2"}},
|
||||||
}
|
}
|
||||||
|
|
||||||
for i, item := range cases {
|
for i, item := range cases {
|
||||||
@@ -319,6 +453,8 @@ func TestDeepClone(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestCopyProperties(t *testing.T) {
|
func TestCopyProperties(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestCopyProperties")
|
assert := internal.NewAssert(t, "TestCopyProperties")
|
||||||
|
|
||||||
type Disk struct {
|
type Disk struct {
|
||||||
@@ -371,6 +507,8 @@ func TestCopyProperties(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestToInterface(t *testing.T) {
|
func TestToInterface(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestToInterface")
|
assert := internal.NewAssert(t, "TestToInterface")
|
||||||
|
|
||||||
cases := []reflect.Value{
|
cases := []reflect.Value{
|
||||||
@@ -400,6 +538,7 @@ func TestToInterface(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestUtf8ToGbk(t *testing.T) {
|
func TestUtf8ToGbk(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
assert := internal.NewAssert(t, "TestUtf8ToGbk")
|
assert := internal.NewAssert(t, "TestUtf8ToGbk")
|
||||||
|
|
||||||
utf8Data := []byte("hello")
|
utf8Data := []byte("hello")
|
||||||
@@ -411,6 +550,7 @@ func TestUtf8ToGbk(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestGbkToUtf8(t *testing.T) {
|
func TestGbkToUtf8(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
assert := internal.NewAssert(t, "TestGbkToUtf8")
|
assert := internal.NewAssert(t, "TestGbkToUtf8")
|
||||||
|
|
||||||
gbkData, err := Utf8ToGbk([]byte("hello"))
|
gbkData, err := Utf8ToGbk([]byte("hello"))
|
||||||
@@ -420,3 +560,359 @@ func TestGbkToUtf8(t *testing.T) {
|
|||||||
assert.Equal(true, utf8.Valid(utf8Data))
|
assert.Equal(true, utf8.Valid(utf8Data))
|
||||||
assert.Equal("hello", string(utf8Data))
|
assert.Equal("hello", string(utf8Data))
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func TestToStdBase64(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
assert := internal.NewAssert(t, "TestToStdBase64")
|
||||||
|
|
||||||
|
r1 := ToStdBase64("abc")
|
||||||
|
d1, _ := base64.StdEncoding.DecodeString(r1)
|
||||||
|
assert.Equal("abc", string(d1))
|
||||||
|
|
||||||
|
r2 := ToStdBase64([]byte("abc"))
|
||||||
|
d2, _ := base64.StdEncoding.DecodeString(r2)
|
||||||
|
assert.Equal("abc", string(d2))
|
||||||
|
|
||||||
|
r3 := ToStdBase64(123)
|
||||||
|
d3, _ := base64.StdEncoding.DecodeString(r3)
|
||||||
|
assert.Equal("123", string(d3))
|
||||||
|
|
||||||
|
r4 := ToStdBase64(11.11)
|
||||||
|
d4, _ := base64.StdEncoding.DecodeString(r4)
|
||||||
|
assert.Equal("11.11", string(d4))
|
||||||
|
|
||||||
|
r5 := ToStdBase64(map[string]any{"name": "duke", "quantity": 1})
|
||||||
|
d5, _ := base64.StdEncoding.DecodeString(r5)
|
||||||
|
assert.Equal("{\"name\":\"duke\",\"quantity\":1}", string(d5))
|
||||||
|
|
||||||
|
r6 := ToStdBase64([]int64{7, 5, 9, 4, 23})
|
||||||
|
d6, _ := base64.StdEncoding.DecodeString(r6)
|
||||||
|
assert.Equal("[7,5,9,4,23]", string(d6))
|
||||||
|
|
||||||
|
r7 := ToStdBase64([]string{"7", "5", "9", "4", "23"})
|
||||||
|
d7, _ := base64.StdEncoding.DecodeString(r7)
|
||||||
|
assert.Equal("[\"7\",\"5\",\"9\",\"4\",\"23\"]", string(d7))
|
||||||
|
|
||||||
|
r8 := ToStdBase64(nil)
|
||||||
|
d8, _ := base64.StdEncoding.DecodeString(r8)
|
||||||
|
assert.Equal("", string(d8))
|
||||||
|
|
||||||
|
ch := make(chan int, 3)
|
||||||
|
ch <- 1
|
||||||
|
ch <- 2
|
||||||
|
r9 := ToStdBase64(ch)
|
||||||
|
d9, _ := base64.StdEncoding.DecodeString(r9)
|
||||||
|
assert.Equal("", string(d9))
|
||||||
|
|
||||||
|
r10 := ToStdBase64(io.EOF)
|
||||||
|
d10, _ := base64.StdEncoding.DecodeString(r10)
|
||||||
|
assert.Equal("EOF", string(d10))
|
||||||
|
|
||||||
|
r11 := ToStdBase64(errors.New("test"))
|
||||||
|
d11, _ := base64.StdEncoding.DecodeString(r11)
|
||||||
|
assert.Equal("test", string(d11))
|
||||||
|
|
||||||
|
typedNil := (*int)(nil)
|
||||||
|
r12 := ToStdBase64(typedNil)
|
||||||
|
d12, _ := base64.StdEncoding.DecodeString(r12)
|
||||||
|
assert.Equal("", string(d12))
|
||||||
|
|
||||||
|
type nilInterface interface {
|
||||||
|
}
|
||||||
|
var nI nilInterface = nil
|
||||||
|
d13, _ := base64.StdEncoding.DecodeString(ToStdBase64(nI))
|
||||||
|
assert.Equal("", string(d13))
|
||||||
|
|
||||||
|
var p unsafe.Pointer
|
||||||
|
d14, _ := base64.StdEncoding.DecodeString(ToStdBase64(p))
|
||||||
|
assert.Equal("", string(d14))
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestToUrlBase64(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
assert := internal.NewAssert(t, "TestToUrlBase64")
|
||||||
|
|
||||||
|
r1 := ToUrlBase64("abc")
|
||||||
|
d1, _ := base64.URLEncoding.DecodeString(r1)
|
||||||
|
assert.Equal("abc", string(d1))
|
||||||
|
|
||||||
|
r2 := ToUrlBase64([]byte("abc"))
|
||||||
|
d2, _ := base64.URLEncoding.DecodeString(r2)
|
||||||
|
assert.Equal("abc", string(d2))
|
||||||
|
|
||||||
|
r3 := ToUrlBase64(123)
|
||||||
|
d3, _ := base64.URLEncoding.DecodeString(r3)
|
||||||
|
assert.Equal("123", string(d3))
|
||||||
|
|
||||||
|
r4 := ToUrlBase64(11.11)
|
||||||
|
d4, _ := base64.URLEncoding.DecodeString(r4)
|
||||||
|
assert.Equal("11.11", string(d4))
|
||||||
|
|
||||||
|
r5 := ToUrlBase64(map[string]any{"name": "duke", "quantity": 1})
|
||||||
|
d5, _ := base64.URLEncoding.DecodeString(r5)
|
||||||
|
assert.Equal("{\"name\":\"duke\",\"quantity\":1}", string(d5))
|
||||||
|
|
||||||
|
r6 := ToUrlBase64([]int64{7, 5, 9, 4, 23})
|
||||||
|
d6, _ := base64.URLEncoding.DecodeString(r6)
|
||||||
|
assert.Equal("[7,5,9,4,23]", string(d6))
|
||||||
|
|
||||||
|
r7 := ToUrlBase64([]string{"7", "5", "9", "4", "23"})
|
||||||
|
d7, _ := base64.URLEncoding.DecodeString(r7)
|
||||||
|
assert.Equal("[\"7\",\"5\",\"9\",\"4\",\"23\"]", string(d7))
|
||||||
|
|
||||||
|
r8 := ToUrlBase64(nil)
|
||||||
|
d8, _ := base64.URLEncoding.DecodeString(r8)
|
||||||
|
assert.Equal("", string(d8))
|
||||||
|
|
||||||
|
ch := make(chan int, 3)
|
||||||
|
ch <- 1
|
||||||
|
ch <- 2
|
||||||
|
r9 := ToUrlBase64(ch)
|
||||||
|
d9, _ := base64.URLEncoding.DecodeString(r9)
|
||||||
|
assert.Equal("", string(d9))
|
||||||
|
|
||||||
|
r10 := ToUrlBase64(io.EOF)
|
||||||
|
d10, _ := base64.URLEncoding.DecodeString(r10)
|
||||||
|
assert.Equal("EOF", string(d10))
|
||||||
|
|
||||||
|
r11 := ToUrlBase64(errors.New("test"))
|
||||||
|
d11, _ := base64.URLEncoding.DecodeString(r11)
|
||||||
|
assert.Equal("test", string(d11))
|
||||||
|
|
||||||
|
typedNil := (*int)(nil)
|
||||||
|
r12 := ToUrlBase64(typedNil)
|
||||||
|
d12, _ := base64.URLEncoding.DecodeString(r12)
|
||||||
|
assert.Equal("", string(d12))
|
||||||
|
|
||||||
|
type nilInterface interface {
|
||||||
|
}
|
||||||
|
var nI nilInterface = nil
|
||||||
|
d13, _ := base64.URLEncoding.DecodeString(ToUrlBase64(nI))
|
||||||
|
assert.Equal("", string(d13))
|
||||||
|
|
||||||
|
var p unsafe.Pointer
|
||||||
|
d14, _ := base64.URLEncoding.DecodeString(ToUrlBase64(p))
|
||||||
|
assert.Equal("", string(d14))
|
||||||
|
|
||||||
|
r15 := ToUrlBase64("4+3/4?=")
|
||||||
|
d15, _ := base64.URLEncoding.DecodeString(r15)
|
||||||
|
assert.Equal("4+3/4?=", string(d15))
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestToRawStdBase64(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
assert := internal.NewAssert(t, "TestToRawStdBase64")
|
||||||
|
|
||||||
|
r1 := ToRawStdBase64("abc")
|
||||||
|
d1, _ := base64.RawStdEncoding.DecodeString(r1)
|
||||||
|
assert.Equal("abc", string(d1))
|
||||||
|
|
||||||
|
r2 := ToRawStdBase64([]byte("abc"))
|
||||||
|
d2, _ := base64.RawStdEncoding.DecodeString(r2)
|
||||||
|
assert.Equal("abc", string(d2))
|
||||||
|
|
||||||
|
r3 := ToRawStdBase64(123)
|
||||||
|
d3, _ := base64.RawStdEncoding.DecodeString(r3)
|
||||||
|
assert.Equal("123", string(d3))
|
||||||
|
|
||||||
|
r4 := ToRawStdBase64(11.11)
|
||||||
|
d4, _ := base64.RawStdEncoding.DecodeString(r4)
|
||||||
|
assert.Equal("11.11", string(d4))
|
||||||
|
|
||||||
|
r5 := ToRawStdBase64(map[string]any{"name": "duke", "quantity": 1})
|
||||||
|
d5, _ := base64.RawStdEncoding.DecodeString(r5)
|
||||||
|
assert.Equal("{\"name\":\"duke\",\"quantity\":1}", string(d5))
|
||||||
|
|
||||||
|
r6 := ToRawStdBase64([]int64{7, 5, 9, 4, 23})
|
||||||
|
d6, _ := base64.RawStdEncoding.DecodeString(r6)
|
||||||
|
assert.Equal("[7,5,9,4,23]", string(d6))
|
||||||
|
|
||||||
|
r7 := ToRawStdBase64([]string{"7", "5", "9", "4", "23"})
|
||||||
|
d7, _ := base64.RawStdEncoding.DecodeString(r7)
|
||||||
|
assert.Equal("[\"7\",\"5\",\"9\",\"4\",\"23\"]", string(d7))
|
||||||
|
|
||||||
|
r8 := ToRawStdBase64(nil)
|
||||||
|
d8, _ := base64.RawStdEncoding.DecodeString(r8)
|
||||||
|
assert.Equal("", string(d8))
|
||||||
|
|
||||||
|
ch := make(chan int, 3)
|
||||||
|
ch <- 1
|
||||||
|
ch <- 2
|
||||||
|
r9 := ToRawStdBase64(ch)
|
||||||
|
d9, _ := base64.RawStdEncoding.DecodeString(r9)
|
||||||
|
assert.Equal("", string(d9))
|
||||||
|
|
||||||
|
r10 := ToRawStdBase64(io.EOF)
|
||||||
|
d10, _ := base64.RawStdEncoding.DecodeString(r10)
|
||||||
|
assert.Equal("EOF", string(d10))
|
||||||
|
|
||||||
|
r11 := ToRawStdBase64(errors.New("test"))
|
||||||
|
d11, _ := base64.RawStdEncoding.DecodeString(r11)
|
||||||
|
assert.Equal("test", string(d11))
|
||||||
|
|
||||||
|
typedNil := (*int)(nil)
|
||||||
|
r12 := ToRawStdBase64(typedNil)
|
||||||
|
d12, _ := base64.RawStdEncoding.DecodeString(r12)
|
||||||
|
assert.Equal("", string(d12))
|
||||||
|
|
||||||
|
type nilInterface interface {
|
||||||
|
}
|
||||||
|
var nI nilInterface = nil
|
||||||
|
d13, _ := base64.RawStdEncoding.DecodeString(ToRawStdBase64(nI))
|
||||||
|
assert.Equal("", string(d13))
|
||||||
|
|
||||||
|
var p unsafe.Pointer
|
||||||
|
d14, _ := base64.RawStdEncoding.DecodeString(ToRawStdBase64(p))
|
||||||
|
assert.Equal("", string(d14))
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestToRawUrlBase64(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
assert := internal.NewAssert(t, "TestToRawUrlBase64")
|
||||||
|
|
||||||
|
r1 := ToRawUrlBase64("abc")
|
||||||
|
d1, _ := base64.RawURLEncoding.DecodeString(r1)
|
||||||
|
assert.Equal("abc", string(d1))
|
||||||
|
|
||||||
|
r2 := ToRawUrlBase64([]byte("abc"))
|
||||||
|
d2, _ := base64.RawURLEncoding.DecodeString(r2)
|
||||||
|
assert.Equal("abc", string(d2))
|
||||||
|
|
||||||
|
r3 := ToRawUrlBase64(123)
|
||||||
|
d3, _ := base64.RawURLEncoding.DecodeString(r3)
|
||||||
|
assert.Equal("123", string(d3))
|
||||||
|
|
||||||
|
r4 := ToRawUrlBase64(11.11)
|
||||||
|
d4, _ := base64.RawURLEncoding.DecodeString(r4)
|
||||||
|
assert.Equal("11.11", string(d4))
|
||||||
|
|
||||||
|
r5 := ToRawUrlBase64(map[string]any{"name": "duke", "quantity": 1})
|
||||||
|
d5, _ := base64.RawURLEncoding.DecodeString(r5)
|
||||||
|
assert.Equal("{\"name\":\"duke\",\"quantity\":1}", string(d5))
|
||||||
|
|
||||||
|
r6 := ToRawUrlBase64([]int64{7, 5, 9, 4, 23})
|
||||||
|
d6, _ := base64.RawURLEncoding.DecodeString(r6)
|
||||||
|
assert.Equal("[7,5,9,4,23]", string(d6))
|
||||||
|
|
||||||
|
r7 := ToRawUrlBase64([]string{"7", "5", "9", "4", "23"})
|
||||||
|
d7, _ := base64.RawURLEncoding.DecodeString(r7)
|
||||||
|
assert.Equal("[\"7\",\"5\",\"9\",\"4\",\"23\"]", string(d7))
|
||||||
|
|
||||||
|
r8 := ToRawUrlBase64(nil)
|
||||||
|
d8, _ := base64.RawURLEncoding.DecodeString(r8)
|
||||||
|
assert.Equal("", string(d8))
|
||||||
|
|
||||||
|
ch := make(chan int, 3)
|
||||||
|
ch <- 1
|
||||||
|
ch <- 2
|
||||||
|
r9 := ToRawUrlBase64(ch)
|
||||||
|
d9, _ := base64.RawURLEncoding.DecodeString(r9)
|
||||||
|
assert.Equal("", string(d9))
|
||||||
|
|
||||||
|
r10 := ToRawUrlBase64(io.EOF)
|
||||||
|
d10, _ := base64.RawURLEncoding.DecodeString(r10)
|
||||||
|
assert.Equal("EOF", string(d10))
|
||||||
|
|
||||||
|
r11 := ToRawUrlBase64(errors.New("test"))
|
||||||
|
d11, _ := base64.RawURLEncoding.DecodeString(r11)
|
||||||
|
assert.Equal("test", string(d11))
|
||||||
|
|
||||||
|
typedNil := (*int)(nil)
|
||||||
|
r12 := ToRawUrlBase64(typedNil)
|
||||||
|
d12, _ := base64.RawURLEncoding.DecodeString(r12)
|
||||||
|
assert.Equal("", string(d12))
|
||||||
|
|
||||||
|
type nilInterface interface {
|
||||||
|
}
|
||||||
|
var nI nilInterface = nil
|
||||||
|
d13, _ := base64.RawURLEncoding.DecodeString(ToRawUrlBase64(nI))
|
||||||
|
assert.Equal("", string(d13))
|
||||||
|
|
||||||
|
var p unsafe.Pointer
|
||||||
|
d14, _ := base64.RawURLEncoding.DecodeString(ToRawUrlBase64(p))
|
||||||
|
assert.Equal("", string(d14))
|
||||||
|
|
||||||
|
r15 := ToRawUrlBase64("4+3/4?=")
|
||||||
|
d15, _ := base64.RawURLEncoding.DecodeString(r15)
|
||||||
|
assert.Equal("4+3/4?=", string(d15))
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestToBigInt(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
assert := internal.NewAssert(t, "TestToBigInt")
|
||||||
|
|
||||||
|
tests := []struct {
|
||||||
|
name string
|
||||||
|
input any
|
||||||
|
want *big.Int
|
||||||
|
hasErr bool
|
||||||
|
}{
|
||||||
|
{
|
||||||
|
name: "int",
|
||||||
|
input: 42,
|
||||||
|
want: big.NewInt(42),
|
||||||
|
},
|
||||||
|
{
|
||||||
|
name: "int8",
|
||||||
|
input: int8(127),
|
||||||
|
want: big.NewInt(127),
|
||||||
|
},
|
||||||
|
{
|
||||||
|
name: "int16",
|
||||||
|
input: int16(32000),
|
||||||
|
want: big.NewInt(32000),
|
||||||
|
},
|
||||||
|
{
|
||||||
|
name: "int32",
|
||||||
|
input: int32(123456),
|
||||||
|
want: big.NewInt(123456),
|
||||||
|
},
|
||||||
|
{
|
||||||
|
name: "int64",
|
||||||
|
input: int64(987654321),
|
||||||
|
want: big.NewInt(987654321),
|
||||||
|
},
|
||||||
|
{
|
||||||
|
name: "uint",
|
||||||
|
input: uint(987654321),
|
||||||
|
want: big.NewInt(987654321),
|
||||||
|
},
|
||||||
|
{
|
||||||
|
name: "uint8",
|
||||||
|
input: uint8(255),
|
||||||
|
want: big.NewInt(255),
|
||||||
|
},
|
||||||
|
{
|
||||||
|
name: "uint16",
|
||||||
|
input: uint16(65535),
|
||||||
|
want: big.NewInt(65535),
|
||||||
|
},
|
||||||
|
{
|
||||||
|
name: "uint32",
|
||||||
|
input: uint32(4294967295),
|
||||||
|
want: big.NewInt(4294967295),
|
||||||
|
},
|
||||||
|
{
|
||||||
|
name: "uint64",
|
||||||
|
input: uint64(18446744073709551615),
|
||||||
|
want: new(big.Int).SetUint64(18446744073709551615),
|
||||||
|
},
|
||||||
|
{
|
||||||
|
name: "unsupported type",
|
||||||
|
input: 3.14, // Unsupported type
|
||||||
|
hasErr: true,
|
||||||
|
},
|
||||||
|
}
|
||||||
|
|
||||||
|
for _, tt := range tests {
|
||||||
|
t.Run(tt.name, func(t *testing.T) {
|
||||||
|
got, err := ToBigInt(tt.input)
|
||||||
|
if (err != nil) != tt.hasErr {
|
||||||
|
t.Errorf("ToBigInt() error = %v, hasErr %v", err, tt.hasErr)
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
assert.Equal(tt.want, got)
|
||||||
|
})
|
||||||
|
}
|
||||||
|
}
|
||||||
+117
-35
@@ -6,7 +6,6 @@
|
|||||||
package cryptor
|
package cryptor
|
||||||
|
|
||||||
import (
|
import (
|
||||||
"bufio"
|
|
||||||
"crypto/hmac"
|
"crypto/hmac"
|
||||||
"crypto/md5"
|
"crypto/md5"
|
||||||
"crypto/sha1"
|
"crypto/sha1"
|
||||||
@@ -40,90 +39,173 @@ func Md5String(s string) string {
|
|||||||
return hex.EncodeToString(h.Sum(nil))
|
return hex.EncodeToString(h.Sum(nil))
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// Md5StringWithBase64 return the md5 value of string with base64.
|
||||||
|
// Play: https://go.dev/play/p/Lx4gH7Vdr5_y
|
||||||
|
func Md5StringWithBase64(s string) string {
|
||||||
|
h := md5.New()
|
||||||
|
h.Write([]byte(s))
|
||||||
|
return base64.StdEncoding.EncodeToString(h.Sum(nil))
|
||||||
|
}
|
||||||
|
|
||||||
|
// Md5Byte return the md5 string of byte slice.
|
||||||
|
// Play: https://go.dev/play/p/suraalH8lyC
|
||||||
|
func Md5Byte(data []byte) string {
|
||||||
|
h := md5.New()
|
||||||
|
h.Write(data)
|
||||||
|
return hex.EncodeToString(h.Sum(nil))
|
||||||
|
}
|
||||||
|
|
||||||
|
// Md5ByteWithBase64 return the md5 string of byte slice with base64.
|
||||||
|
// Play: https://go.dev/play/p/Tcb-Z7LN2ax
|
||||||
|
func Md5ByteWithBase64(data []byte) string {
|
||||||
|
h := md5.New()
|
||||||
|
h.Write(data)
|
||||||
|
return base64.StdEncoding.EncodeToString(h.Sum(nil))
|
||||||
|
}
|
||||||
|
|
||||||
// Md5File return the md5 value of file.
|
// Md5File return the md5 value of file.
|
||||||
func Md5File(filename string) (string, error) {
|
func Md5File(filename string) (string, error) {
|
||||||
if fileInfo, err := os.Stat(filename); err != nil {
|
|
||||||
return "", err
|
|
||||||
} else if fileInfo.IsDir() {
|
|
||||||
return "", nil
|
|
||||||
}
|
|
||||||
|
|
||||||
file, err := os.Open(filename)
|
file, err := os.Open(filename)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return "", err
|
return "", err
|
||||||
}
|
}
|
||||||
defer file.Close()
|
defer file.Close()
|
||||||
|
|
||||||
hash := md5.New()
|
stat, err := file.Stat()
|
||||||
|
if err != nil {
|
||||||
chunkSize := 65536
|
return "", err
|
||||||
for buf, reader := make([]byte, chunkSize), bufio.NewReader(file); ; {
|
}
|
||||||
n, err := reader.Read(buf)
|
if stat.IsDir() {
|
||||||
if err != nil {
|
return "", nil
|
||||||
if err == io.EOF {
|
|
||||||
break
|
|
||||||
}
|
|
||||||
return "", err
|
|
||||||
}
|
|
||||||
hash.Write(buf[:n])
|
|
||||||
}
|
}
|
||||||
|
|
||||||
checksum := fmt.Sprintf("%x", hash.Sum(nil))
|
hash := md5.New()
|
||||||
return checksum, nil
|
buf := make([]byte, 65536) // 64KB
|
||||||
|
|
||||||
|
for {
|
||||||
|
n, err := file.Read(buf)
|
||||||
|
if err != nil && err != io.EOF {
|
||||||
|
return "", err
|
||||||
|
}
|
||||||
|
if n > 0 {
|
||||||
|
hash.Write(buf[:n])
|
||||||
|
}
|
||||||
|
if err == io.EOF {
|
||||||
|
break
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return fmt.Sprintf("%x", hash.Sum(nil)), nil
|
||||||
}
|
}
|
||||||
|
|
||||||
// HmacMd5 return the hmac hash of string use md5.
|
// HmacMd5 return the hmac hash of string use md5.
|
||||||
// Play: https://go.dev/play/p/uef0q1fz53I
|
// Play: https://go.dev/play/p/uef0q1fz53I
|
||||||
func HmacMd5(data, key string) string {
|
func HmacMd5(str, key string) string {
|
||||||
|
h := hmac.New(md5.New, []byte(key))
|
||||||
|
h.Write([]byte(str))
|
||||||
|
return hex.EncodeToString(h.Sum([]byte("")))
|
||||||
|
}
|
||||||
|
|
||||||
|
// HmacMd5WithBase64 return the hmac hash of string use md5 with base64.
|
||||||
|
// https://go.dev/play/p/UY0ng2AefFC
|
||||||
|
func HmacMd5WithBase64(data, key string) string {
|
||||||
h := hmac.New(md5.New, []byte(key))
|
h := hmac.New(md5.New, []byte(key))
|
||||||
h.Write([]byte(data))
|
h.Write([]byte(data))
|
||||||
return hex.EncodeToString(h.Sum([]byte("")))
|
return base64.StdEncoding.EncodeToString(h.Sum([]byte("")))
|
||||||
}
|
}
|
||||||
|
|
||||||
// HmacSha1 return the hmac hash of string use sha1.
|
// HmacSha1 return the hmac hash of string use sha1.
|
||||||
// Play: https://go.dev/play/p/1UI4oQ4WXKM
|
// Play: https://go.dev/play/p/1UI4oQ4WXKM
|
||||||
func HmacSha1(data, key string) string {
|
func HmacSha1(str, key string) string {
|
||||||
h := hmac.New(sha1.New, []byte(key))
|
h := hmac.New(sha1.New, []byte(key))
|
||||||
h.Write([]byte(data))
|
h.Write([]byte(str))
|
||||||
return hex.EncodeToString(h.Sum([]byte("")))
|
return hex.EncodeToString(h.Sum([]byte("")))
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// HmacSha1WithBase64 return the hmac hash of string use sha1 with base64.
|
||||||
|
// Play: https://go.dev/play/p/47JmmGrnF7B
|
||||||
|
func HmacSha1WithBase64(str, key string) string {
|
||||||
|
h := hmac.New(sha1.New, []byte(key))
|
||||||
|
h.Write([]byte(str))
|
||||||
|
return base64.StdEncoding.EncodeToString(h.Sum([]byte("")))
|
||||||
|
}
|
||||||
|
|
||||||
// HmacSha256 return the hmac hash of string use sha256.
|
// HmacSha256 return the hmac hash of string use sha256.
|
||||||
// Play: https://go.dev/play/p/HhpwXxFhhC0
|
// Play: https://go.dev/play/p/HhpwXxFhhC0
|
||||||
func HmacSha256(data, key string) string {
|
func HmacSha256(str, key string) string {
|
||||||
h := hmac.New(sha256.New, []byte(key))
|
h := hmac.New(sha256.New, []byte(key))
|
||||||
h.Write([]byte(data))
|
h.Write([]byte(str))
|
||||||
return hex.EncodeToString(h.Sum([]byte("")))
|
return hex.EncodeToString(h.Sum([]byte("")))
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// HmacSha256WithBase64 return the hmac hash of string use sha256 with base64.
|
||||||
|
// Play: https://go.dev/play/p/EKbkUvPTLwO
|
||||||
|
func HmacSha256WithBase64(str, key string) string {
|
||||||
|
h := hmac.New(sha256.New, []byte(key))
|
||||||
|
h.Write([]byte(str))
|
||||||
|
return base64.StdEncoding.EncodeToString(h.Sum([]byte("")))
|
||||||
|
}
|
||||||
|
|
||||||
// HmacSha512 return the hmac hash of string use sha512.
|
// HmacSha512 return the hmac hash of string use sha512.
|
||||||
// Play: https://go.dev/play/p/59Od6m4A0Ud
|
// Play: https://go.dev/play/p/59Od6m4A0Ud
|
||||||
func HmacSha512(data, key string) string {
|
func HmacSha512(str, key string) string {
|
||||||
h := hmac.New(sha512.New, []byte(key))
|
h := hmac.New(sha512.New, []byte(key))
|
||||||
h.Write([]byte(data))
|
h.Write([]byte(str))
|
||||||
return hex.EncodeToString(h.Sum([]byte("")))
|
return hex.EncodeToString(h.Sum([]byte("")))
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// HmacSha512WithBase64 return the hmac hash of string use sha512 with base64.
|
||||||
|
// Play: https://go.dev/play/p/c6dSe3E2ydU
|
||||||
|
func HmacSha512WithBase64(str, key string) string {
|
||||||
|
h := hmac.New(sha512.New, []byte(key))
|
||||||
|
h.Write([]byte(str))
|
||||||
|
return base64.StdEncoding.EncodeToString(h.Sum([]byte("")))
|
||||||
|
}
|
||||||
|
|
||||||
// Sha1 return the sha1 value (SHA-1 hash algorithm) of string.
|
// Sha1 return the sha1 value (SHA-1 hash algorithm) of string.
|
||||||
// Play: https://go.dev/play/p/_m_uoD1deMT
|
// Play: https://go.dev/play/p/_m_uoD1deMT
|
||||||
func Sha1(data string) string {
|
func Sha1(str string) string {
|
||||||
sha1 := sha1.New()
|
sha1 := sha1.New()
|
||||||
sha1.Write([]byte(data))
|
sha1.Write([]byte(str))
|
||||||
return hex.EncodeToString(sha1.Sum([]byte("")))
|
return hex.EncodeToString(sha1.Sum([]byte("")))
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// Sha1WithBase64 return the sha1 value (SHA-1 hash algorithm) of base64 string.
|
||||||
|
// Play: https://go.dev/play/p/fSyx-Gl2l2-
|
||||||
|
func Sha1WithBase64(str string) string {
|
||||||
|
sha1 := sha1.New()
|
||||||
|
sha1.Write([]byte(str))
|
||||||
|
return base64.StdEncoding.EncodeToString(sha1.Sum([]byte("")))
|
||||||
|
}
|
||||||
|
|
||||||
// Sha256 return the sha256 value (SHA256 hash algorithm) of string.
|
// Sha256 return the sha256 value (SHA256 hash algorithm) of string.
|
||||||
// Play: https://go.dev/play/p/tU9tfBMIAr1
|
// Play: https://go.dev/play/p/tU9tfBMIAr1
|
||||||
func Sha256(data string) string {
|
func Sha256(str string) string {
|
||||||
sha256 := sha256.New()
|
sha256 := sha256.New()
|
||||||
sha256.Write([]byte(data))
|
sha256.Write([]byte(str))
|
||||||
return hex.EncodeToString(sha256.Sum([]byte("")))
|
return hex.EncodeToString(sha256.Sum([]byte("")))
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// Sha256WithBase64 return the sha256 value (SHA256 hash algorithm) of base64 string.
|
||||||
|
// Play: https://go.dev/play/p/85IXJHIal1k
|
||||||
|
func Sha256WithBase64(str string) string {
|
||||||
|
sha256 := sha256.New()
|
||||||
|
sha256.Write([]byte(str))
|
||||||
|
return base64.StdEncoding.EncodeToString(sha256.Sum([]byte("")))
|
||||||
|
}
|
||||||
|
|
||||||
// Sha512 return the sha512 value (SHA512 hash algorithm) of string.
|
// Sha512 return the sha512 value (SHA512 hash algorithm) of string.
|
||||||
// Play: https://go.dev/play/p/3WsvLYZxsHa
|
// Play: https://go.dev/play/p/3WsvLYZxsHa
|
||||||
func Sha512(data string) string {
|
func Sha512(str string) string {
|
||||||
sha512 := sha512.New()
|
sha512 := sha512.New()
|
||||||
sha512.Write([]byte(data))
|
sha512.Write([]byte(str))
|
||||||
return hex.EncodeToString(sha512.Sum([]byte("")))
|
return hex.EncodeToString(sha512.Sum([]byte("")))
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// Sha512WithBase64 return the sha512 value (SHA512 hash algorithm) of base64 string.
|
||||||
|
// Play: https://go.dev/play/p/q_fY2rA-k5I
|
||||||
|
func Sha512WithBase64(str string) string {
|
||||||
|
sha512 := sha512.New()
|
||||||
|
sha512.Write([]byte(str))
|
||||||
|
return base64.StdEncoding.EncodeToString(sha512.Sum([]byte("")))
|
||||||
|
}
|
||||||
+120
-3
@@ -7,21 +7,51 @@ import (
|
|||||||
)
|
)
|
||||||
|
|
||||||
func TestBase64StdEncode(t *testing.T) {
|
func TestBase64StdEncode(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestBase64StdEncode")
|
assert := internal.NewAssert(t, "TestBase64StdEncode")
|
||||||
assert.Equal("aGVsbG8gd29ybGQ=", Base64StdEncode("hello world"))
|
assert.Equal("aGVsbG8gd29ybGQ=", Base64StdEncode("hello world"))
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestBase64StdDecode(t *testing.T) {
|
func TestBase64StdDecode(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestBase64StdDecode")
|
assert := internal.NewAssert(t, "TestBase64StdDecode")
|
||||||
assert.Equal("hello world", Base64StdDecode("aGVsbG8gd29ybGQ="))
|
assert.Equal("hello world", Base64StdDecode("aGVsbG8gd29ybGQ="))
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestMd5String(t *testing.T) {
|
func TestMd5String(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestMd5String")
|
assert := internal.NewAssert(t, "TestMd5String")
|
||||||
assert.Equal("5d41402abc4b2a76b9719d911017c592", Md5String("hello"))
|
assert.Equal("5d41402abc4b2a76b9719d911017c592", Md5String("hello"))
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func TestMd5StringWithBase64(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestMd5StringWithBase64")
|
||||||
|
assert.Equal("XUFAKrxLKna5cZ2REBfFkg==", Md5StringWithBase64("hello"))
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestMd5Byte(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestMd5Byte")
|
||||||
|
data := []byte{'a'}
|
||||||
|
assert.Equal("0cc175b9c0f1b6a831c399e269772661", Md5Byte(data))
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestMd5ByteWithBase64(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestMd5ByteWithBase64")
|
||||||
|
assert.Equal("XUFAKrxLKna5cZ2REBfFkg==", Md5ByteWithBase64([]byte("hello")))
|
||||||
|
}
|
||||||
|
|
||||||
func TestMd5File(t *testing.T) {
|
func TestMd5File(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
fileMd5, err := Md5File("./basic.go")
|
fileMd5, err := Md5File("./basic.go")
|
||||||
assert := internal.NewAssert(t, "TestMd5File")
|
assert := internal.NewAssert(t, "TestMd5File")
|
||||||
assert.IsNotNil(fileMd5)
|
assert.IsNotNil(fileMd5)
|
||||||
@@ -29,11 +59,22 @@ func TestMd5File(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestHmacMd5(t *testing.T) {
|
func TestHmacMd5(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestHmacMd5")
|
assert := internal.NewAssert(t, "TestHmacMd5")
|
||||||
assert.Equal("5f4c9faaff0a1ad3007d9ddc06abe36d", HmacMd5("hello world", "12345"))
|
assert.Equal("5f4c9faaff0a1ad3007d9ddc06abe36d", HmacMd5("hello world", "12345"))
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func TestHmacMd5WithBase64(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestHmacMd5WithBase64")
|
||||||
|
assert.Equal("6DQwbquJLYclJdSRinpjmg==", HmacMd5WithBase64("hello", "12345"))
|
||||||
|
}
|
||||||
|
|
||||||
func TestHmacSha1(t *testing.T) {
|
func TestHmacSha1(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
s := "hello world"
|
s := "hello world"
|
||||||
key := "12345"
|
key := "12345"
|
||||||
hmacSha1 := HmacSha1(s, key)
|
hmacSha1 := HmacSha1(s, key)
|
||||||
@@ -43,17 +84,45 @@ func TestHmacSha1(t *testing.T) {
|
|||||||
assert.Equal(expected, hmacSha1)
|
assert.Equal(expected, hmacSha1)
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestHmacSha256(t *testing.T) {
|
func TestHmacSha1WithBase64(t *testing.T) {
|
||||||
s := "hello world"
|
t.Parallel()
|
||||||
|
|
||||||
|
s := "hello"
|
||||||
key := "12345"
|
key := "12345"
|
||||||
hmacSha256 := HmacSha256(s, key)
|
hmacSha1 := HmacSha1WithBase64(s, key)
|
||||||
|
expected := "XGqdsMzLkuNu0DI/0Jt/k23prOA="
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestHmacSha1")
|
||||||
|
assert.Equal(expected, hmacSha1)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestHmacSha256(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
str := "hello world"
|
||||||
|
key := "12345"
|
||||||
|
hmacSha256 := HmacSha256(str, key)
|
||||||
expected := "9dce2609f2d67d41f74c7f9efc8ccd44370d41ad2de52982627588dfe7289ab8"
|
expected := "9dce2609f2d67d41f74c7f9efc8ccd44370d41ad2de52982627588dfe7289ab8"
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestHmacSha256")
|
assert := internal.NewAssert(t, "TestHmacSha256")
|
||||||
assert.Equal(expected, hmacSha256)
|
assert.Equal(expected, hmacSha256)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func TestHmacSha256WithBase64(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
str := "hello"
|
||||||
|
key := "12345"
|
||||||
|
hms := HmacSha256WithBase64(str, key)
|
||||||
|
expected := "MVu5PE6YmGK6Ccti4F1zpfN2yzbw14btqwwyDQWf3nU="
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestHmacSha256WithBase64")
|
||||||
|
assert.Equal(expected, hms)
|
||||||
|
}
|
||||||
|
|
||||||
func TestHmacSha512(t *testing.T) {
|
func TestHmacSha512(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
s := "hello world"
|
s := "hello world"
|
||||||
key := "12345"
|
key := "12345"
|
||||||
hmacSha512 := HmacSha512(s, key)
|
hmacSha512 := HmacSha512(s, key)
|
||||||
@@ -63,7 +132,21 @@ func TestHmacSha512(t *testing.T) {
|
|||||||
assert.Equal(expected, hmacSha512)
|
assert.Equal(expected, hmacSha512)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func TestHmacSha512WithBase64(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
str := "hello"
|
||||||
|
key := "12345"
|
||||||
|
hms := HmacSha512WithBase64(str, key)
|
||||||
|
expected := "3Y8SkKndI9NU4lJtmi6c6M///dN8syCADRxsE9Lvw2Mog3ahlsVFja9T+OGqa0Wm2FYwPVwKIGS/+XhYYdSM/A=="
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestHmacSha512WithBase64")
|
||||||
|
assert.Equal(expected, hms)
|
||||||
|
}
|
||||||
|
|
||||||
func TestSha1(t *testing.T) {
|
func TestSha1(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
s := "hello world"
|
s := "hello world"
|
||||||
sha1 := Sha1(s)
|
sha1 := Sha1(s)
|
||||||
expected := "2aae6c35c94fcfb415dbe95f408b9ce91ee846ed"
|
expected := "2aae6c35c94fcfb415dbe95f408b9ce91ee846ed"
|
||||||
@@ -72,7 +155,19 @@ func TestSha1(t *testing.T) {
|
|||||||
assert.Equal(expected, sha1)
|
assert.Equal(expected, sha1)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func TestSha1WithBase64(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
str := Sha1WithBase64("hello")
|
||||||
|
expected := "qvTGHdzF6KLavt4PO0gs2a6pQ00="
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestSha1WithBase64")
|
||||||
|
assert.Equal(expected, str)
|
||||||
|
}
|
||||||
|
|
||||||
func TestSha256(t *testing.T) {
|
func TestSha256(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
s := "hello world"
|
s := "hello world"
|
||||||
sha256 := Sha256(s)
|
sha256 := Sha256(s)
|
||||||
expected := "b94d27b9934d3e08a52e52d7da7dabfac484efe37a5380ee9088f7ace2efcde9"
|
expected := "b94d27b9934d3e08a52e52d7da7dabfac484efe37a5380ee9088f7ace2efcde9"
|
||||||
@@ -81,7 +176,19 @@ func TestSha256(t *testing.T) {
|
|||||||
assert.Equal(expected, sha256)
|
assert.Equal(expected, sha256)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func TestSha256WithBase64(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
str := Sha256WithBase64("hello")
|
||||||
|
expected := "LPJNul+wow4m6DsqxbninhsWHlwfp0JecwQzYpOLmCQ="
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestSha256WithBase64")
|
||||||
|
assert.Equal(expected, str)
|
||||||
|
}
|
||||||
|
|
||||||
func TestSha512(t *testing.T) {
|
func TestSha512(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
s := "hello world"
|
s := "hello world"
|
||||||
sha512 := Sha512(s)
|
sha512 := Sha512(s)
|
||||||
expected := "309ecc489c12d6eb4cc40f50c902f2b4d0ed77ee511a7c7a9bcd3ca86d4cd86f989dd35bc5ff499670da34255b45b0cfd830e81f605dcf7dc5542e93ae9cd76f"
|
expected := "309ecc489c12d6eb4cc40f50c902f2b4d0ed77ee511a7c7a9bcd3ca86d4cd86f989dd35bc5ff499670da34255b45b0cfd830e81f605dcf7dc5542e93ae9cd76f"
|
||||||
@@ -89,3 +196,13 @@ func TestSha512(t *testing.T) {
|
|||||||
assert := internal.NewAssert(t, "TestSha512")
|
assert := internal.NewAssert(t, "TestSha512")
|
||||||
assert.Equal(expected, sha512)
|
assert.Equal(expected, sha512)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func TestSha512WithBase64(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
str := Sha512WithBase64("hello")
|
||||||
|
expected := "m3HSJL1i83hdltRq0+o9czGb+8KJDKra4t/3JRlnPKcjI8PZm6XBHXx6zG4UuMXaDEZjR1wuXDre9G9zvN7AQw=="
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestSha512WithBase64")
|
||||||
|
assert.Equal(expected, str)
|
||||||
|
}
|
||||||
@@ -0,0 +1,859 @@
|
|||||||
|
// Copyright 2021 dudaodong@gmail.com. All rights reserved.
|
||||||
|
// Use of this source code is governed by MIT license
|
||||||
|
|
||||||
|
// Package cryptor implements some util functions to encrypt and decrypt.
|
||||||
|
// Note:
|
||||||
|
// 1. for aes crypt function, the `key` param length should be 16, 24 or 32. if not, will panic.
|
||||||
|
package cryptor
|
||||||
|
|
||||||
|
import (
|
||||||
|
"bytes"
|
||||||
|
"crypto"
|
||||||
|
"crypto/aes"
|
||||||
|
"crypto/cipher"
|
||||||
|
"crypto/des"
|
||||||
|
"crypto/rand"
|
||||||
|
"crypto/rsa"
|
||||||
|
"crypto/sha256"
|
||||||
|
"crypto/x509"
|
||||||
|
"encoding/pem"
|
||||||
|
"io"
|
||||||
|
"os"
|
||||||
|
)
|
||||||
|
|
||||||
|
// AesEcbEncrypt encrypt data with key use AES ECB algorithm
|
||||||
|
// len(key) should be 16, 24 or 32.
|
||||||
|
// Play: https://go.dev/play/p/jT5irszHx-j
|
||||||
|
func AesEcbEncrypt(data, key []byte) []byte {
|
||||||
|
if !isAesKeyLengthValid(len(key)) {
|
||||||
|
panic("aes: invalid key length (must be 16, 24, or 32 bytes)")
|
||||||
|
}
|
||||||
|
|
||||||
|
blockSize := aes.BlockSize
|
||||||
|
dataLen := len(data)
|
||||||
|
padding := blockSize - (dataLen % blockSize)
|
||||||
|
paddedLen := dataLen + padding
|
||||||
|
|
||||||
|
paddedData := make([]byte, paddedLen)
|
||||||
|
copy(paddedData, data)
|
||||||
|
|
||||||
|
for i := dataLen; i < paddedLen; i++ {
|
||||||
|
paddedData[i] = byte(padding)
|
||||||
|
}
|
||||||
|
|
||||||
|
cipher, err := aes.NewCipher(generateAesKey(key, len(key)))
|
||||||
|
if err != nil {
|
||||||
|
panic("aes: failed to create cipher: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
encrypted := make([]byte, paddedLen)
|
||||||
|
for bs := 0; bs < paddedLen; bs += blockSize {
|
||||||
|
cipher.Encrypt(encrypted[bs:], paddedData[bs:])
|
||||||
|
}
|
||||||
|
|
||||||
|
return encrypted
|
||||||
|
}
|
||||||
|
|
||||||
|
// AesEcbDecrypt decrypt data with key use AES ECB algorithm
|
||||||
|
// len(key) should be 16, 24 or 32.
|
||||||
|
// Play: https://go.dev/play/p/jT5irszHx-j
|
||||||
|
func AesEcbDecrypt(encrypted, key []byte) []byte {
|
||||||
|
if !isAesKeyLengthValid(len(key)) {
|
||||||
|
panic("aes: invalid key length (must be 16, 24, or 32 bytes)")
|
||||||
|
}
|
||||||
|
|
||||||
|
blockSize := aes.BlockSize
|
||||||
|
if len(encrypted)%blockSize != 0 {
|
||||||
|
panic("aes: encrypted data length is not a multiple of block size")
|
||||||
|
}
|
||||||
|
|
||||||
|
cipher, err := aes.NewCipher(generateAesKey(key, len(key)))
|
||||||
|
if err != nil {
|
||||||
|
panic("aes: failed to create cipher: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
decrypted := make([]byte, len(encrypted))
|
||||||
|
for i := 0; i < len(encrypted); i += blockSize {
|
||||||
|
cipher.Decrypt(decrypted[i:], encrypted[i:])
|
||||||
|
}
|
||||||
|
|
||||||
|
if len(decrypted) == 0 {
|
||||||
|
return nil
|
||||||
|
}
|
||||||
|
padding := int(decrypted[len(decrypted)-1])
|
||||||
|
if padding == 0 || padding > blockSize {
|
||||||
|
panic("aes: invalid PKCS#7 padding")
|
||||||
|
}
|
||||||
|
for i := len(decrypted) - padding; i < len(decrypted); i++ {
|
||||||
|
if decrypted[i] != byte(padding) {
|
||||||
|
panic("aes: invalid PKCS#7 padding content")
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return decrypted[:len(decrypted)-padding]
|
||||||
|
}
|
||||||
|
|
||||||
|
// AesCbcEncrypt encrypt data with key use AES CBC algorithm
|
||||||
|
// len(key) should be 16, 24 or 32.
|
||||||
|
// Play: https://go.dev/play/p/IOq_g8_lKZD
|
||||||
|
func AesCbcEncrypt(data, key []byte) []byte {
|
||||||
|
if !isAesKeyLengthValid(len(key)) {
|
||||||
|
panic("aes: invalid key length (must be 16, 24, or 32 bytes)")
|
||||||
|
}
|
||||||
|
|
||||||
|
block, err := aes.NewCipher(key)
|
||||||
|
if err != nil {
|
||||||
|
panic("aes: failed to create cipher: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
padding := aes.BlockSize - len(data)%aes.BlockSize
|
||||||
|
padded := append(data, bytes.Repeat([]byte{byte(padding)}, padding)...)
|
||||||
|
|
||||||
|
iv := make([]byte, aes.BlockSize)
|
||||||
|
if _, err := io.ReadFull(rand.Reader, iv); err != nil {
|
||||||
|
panic("aes: failed to generate IV: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
encrypted := make([]byte, len(padded))
|
||||||
|
mode := cipher.NewCBCEncrypter(block, iv)
|
||||||
|
mode.CryptBlocks(encrypted, padded)
|
||||||
|
|
||||||
|
return append(iv, encrypted...)
|
||||||
|
}
|
||||||
|
|
||||||
|
// AesCbcDecrypt decrypt data with key use AES CBC algorithm
|
||||||
|
// len(key) should be 16, 24 or 32.
|
||||||
|
// Play: https://go.dev/play/p/IOq_g8_lKZD
|
||||||
|
func AesCbcDecrypt(encrypted, key []byte) []byte {
|
||||||
|
if !isAesKeyLengthValid(len(key)) {
|
||||||
|
panic("aes: invalid key length (must be 16, 24, or 32 bytes)")
|
||||||
|
}
|
||||||
|
|
||||||
|
if len(encrypted) < aes.BlockSize {
|
||||||
|
panic("aes: ciphertext too short")
|
||||||
|
}
|
||||||
|
|
||||||
|
if len(encrypted)%aes.BlockSize != 0 {
|
||||||
|
panic("aes: ciphertext is not a multiple of the block size")
|
||||||
|
}
|
||||||
|
|
||||||
|
iv := encrypted[:aes.BlockSize]
|
||||||
|
ciphertext := encrypted[aes.BlockSize:]
|
||||||
|
|
||||||
|
block, err := aes.NewCipher(key)
|
||||||
|
if err != nil {
|
||||||
|
panic("aes: failed to create cipher: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
decrypted := make([]byte, len(ciphertext))
|
||||||
|
mode := cipher.NewCBCDecrypter(block, iv)
|
||||||
|
mode.CryptBlocks(decrypted, ciphertext)
|
||||||
|
|
||||||
|
return pkcs7UnPadding(decrypted)
|
||||||
|
}
|
||||||
|
|
||||||
|
// AesCtrCrypt encrypt data with key use AES CTR algorithm
|
||||||
|
// len(key) should be 16, 24 or 32.
|
||||||
|
// Play: https://go.dev/play/p/SpaZO0-5Nsp
|
||||||
|
// deprecated: use AesCtrEncrypt and AesCtrDecrypt instead.
|
||||||
|
func AesCtrCrypt(data, key []byte) []byte {
|
||||||
|
if !isAesKeyLengthValid(len(key)) {
|
||||||
|
panic("aes: invalid key length (must be 16, 24, or 32 bytes)")
|
||||||
|
}
|
||||||
|
|
||||||
|
block, _ := aes.NewCipher(key)
|
||||||
|
|
||||||
|
iv := bytes.Repeat([]byte("1"), block.BlockSize())
|
||||||
|
stream := cipher.NewCTR(block, iv)
|
||||||
|
|
||||||
|
dst := make([]byte, len(data))
|
||||||
|
stream.XORKeyStream(dst, data)
|
||||||
|
|
||||||
|
return dst
|
||||||
|
}
|
||||||
|
|
||||||
|
// AesCtrEncrypt encrypt data with key use AES CTR algorithm
|
||||||
|
// len(key) should be 16, 24 or 32.
|
||||||
|
// Play: https://go.dev/play/p/x6pjPAvThRz
|
||||||
|
func AesCtrEncrypt(data, key []byte) []byte {
|
||||||
|
if !isAesKeyLengthValid(len(key)) {
|
||||||
|
panic("aes: invalid key length (must be 16, 24, or 32 bytes)")
|
||||||
|
}
|
||||||
|
|
||||||
|
block, err := aes.NewCipher(key)
|
||||||
|
if err != nil {
|
||||||
|
panic("aes: failed to create cipher: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
iv := make([]byte, aes.BlockSize)
|
||||||
|
if _, err := io.ReadFull(rand.Reader, iv); err != nil {
|
||||||
|
panic("aes: failed to generate IV: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
stream := cipher.NewCTR(block, iv)
|
||||||
|
ciphertext := make([]byte, len(data))
|
||||||
|
stream.XORKeyStream(ciphertext, data)
|
||||||
|
|
||||||
|
return append(iv, ciphertext...)
|
||||||
|
}
|
||||||
|
|
||||||
|
// AesCtrDecrypt decrypt data with key use AES CTR algorithm
|
||||||
|
// len(key) should be 16, 24 or 32.
|
||||||
|
// Play: https://go.dev/play/p/x6pjPAvThRz
|
||||||
|
func AesCtrDecrypt(encrypted, key []byte) []byte {
|
||||||
|
if !isAesKeyLengthValid(len(key)) {
|
||||||
|
panic("aes: invalid key length (must be 16, 24, or 32 bytes)")
|
||||||
|
}
|
||||||
|
if len(encrypted) < aes.BlockSize {
|
||||||
|
panic("aes: invalid ciphertext length")
|
||||||
|
}
|
||||||
|
|
||||||
|
iv := encrypted[:aes.BlockSize]
|
||||||
|
ciphertext := encrypted[aes.BlockSize:]
|
||||||
|
|
||||||
|
block, err := aes.NewCipher(key)
|
||||||
|
if err != nil {
|
||||||
|
panic("aes: failed to create cipher: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
stream := cipher.NewCTR(block, iv)
|
||||||
|
plaintext := make([]byte, len(ciphertext))
|
||||||
|
stream.XORKeyStream(plaintext, ciphertext)
|
||||||
|
|
||||||
|
return plaintext
|
||||||
|
}
|
||||||
|
|
||||||
|
// AesCfbEncrypt encrypt data with key use AES CFB algorithm
|
||||||
|
// len(key) should be 16, 24 or 32.
|
||||||
|
// Play: https://go.dev/play/p/tfkF10B13kH
|
||||||
|
func AesCfbEncrypt(data, key []byte) []byte {
|
||||||
|
if !isAesKeyLengthValid(len(key)) {
|
||||||
|
panic("aes: invalid key length (must be 16, 24, or 32 bytes)")
|
||||||
|
}
|
||||||
|
|
||||||
|
block, err := aes.NewCipher(key)
|
||||||
|
if err != nil {
|
||||||
|
panic("aes: failed to create cipher: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
iv := make([]byte, aes.BlockSize)
|
||||||
|
if _, err := io.ReadFull(rand.Reader, iv); err != nil {
|
||||||
|
panic("aes: failed to generate IV: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
ciphertext := make([]byte, len(data))
|
||||||
|
stream := cipher.NewCFBEncrypter(block, iv)
|
||||||
|
stream.XORKeyStream(ciphertext, data)
|
||||||
|
|
||||||
|
return append(iv, ciphertext...)
|
||||||
|
}
|
||||||
|
|
||||||
|
// AesCfbDecrypt decrypt data with key use AES CFB algorithm
|
||||||
|
// len(encrypted) should be great than 16, len(key) should be 16, 24 or 32.
|
||||||
|
// Play: https://go.dev/play/p/tfkF10B13kH
|
||||||
|
func AesCfbDecrypt(encrypted, key []byte) []byte {
|
||||||
|
if !isAesKeyLengthValid(len(key)) {
|
||||||
|
panic("aes: invalid key length (must be 16, 24, or 32 bytes)")
|
||||||
|
}
|
||||||
|
|
||||||
|
if len(encrypted) < aes.BlockSize {
|
||||||
|
panic("aes: encrypted data too short")
|
||||||
|
}
|
||||||
|
|
||||||
|
iv := encrypted[:aes.BlockSize]
|
||||||
|
ciphertext := encrypted[aes.BlockSize:]
|
||||||
|
|
||||||
|
block, err := aes.NewCipher(key)
|
||||||
|
if err != nil {
|
||||||
|
panic("aes: failed to create cipher: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
plaintext := make([]byte, len(ciphertext))
|
||||||
|
stream := cipher.NewCFBDecrypter(block, iv)
|
||||||
|
stream.XORKeyStream(plaintext, ciphertext)
|
||||||
|
|
||||||
|
return plaintext
|
||||||
|
}
|
||||||
|
|
||||||
|
// AesOfbEncrypt encrypt data with key use AES OFB algorithm
|
||||||
|
// len(key) should be 16, 24 or 32.
|
||||||
|
// Play: https://go.dev/play/p/VtHxtkUj-3F
|
||||||
|
func AesOfbEncrypt(data, key []byte) []byte {
|
||||||
|
if !isAesKeyLengthValid(len(key)) {
|
||||||
|
panic("aes: invalid key length (must be 16, 24, or 32 bytes)")
|
||||||
|
}
|
||||||
|
|
||||||
|
block, err := aes.NewCipher(key)
|
||||||
|
if err != nil {
|
||||||
|
panic("aes: failed to create cipher: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
iv := make([]byte, aes.BlockSize)
|
||||||
|
if _, err := io.ReadFull(rand.Reader, iv); err != nil {
|
||||||
|
panic("aes: failed to generate IV: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
ciphertext := make([]byte, len(data))
|
||||||
|
stream := cipher.NewOFB(block, iv)
|
||||||
|
stream.XORKeyStream(ciphertext, data)
|
||||||
|
|
||||||
|
return append(iv, ciphertext...)
|
||||||
|
}
|
||||||
|
|
||||||
|
// AesOfbDecrypt decrypt data with key use AES OFB algorithm
|
||||||
|
// len(key) should be 16, 24 or 32.
|
||||||
|
// Play: https://go.dev/play/p/VtHxtkUj-3F
|
||||||
|
func AesOfbDecrypt(data, key []byte) []byte {
|
||||||
|
if !isAesKeyLengthValid(len(key)) {
|
||||||
|
panic("aes: invalid key length (must be 16, 24, or 32 bytes)")
|
||||||
|
}
|
||||||
|
|
||||||
|
if len(data) < aes.BlockSize {
|
||||||
|
panic("aes: encrypted data too short")
|
||||||
|
}
|
||||||
|
|
||||||
|
iv := data[:aes.BlockSize]
|
||||||
|
ciphertext := data[aes.BlockSize:]
|
||||||
|
|
||||||
|
block, err := aes.NewCipher(key)
|
||||||
|
if err != nil {
|
||||||
|
panic("aes: failed to create cipher: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
plaintext := make([]byte, len(ciphertext))
|
||||||
|
stream := cipher.NewOFB(block, iv)
|
||||||
|
stream.XORKeyStream(plaintext, ciphertext)
|
||||||
|
|
||||||
|
return plaintext
|
||||||
|
}
|
||||||
|
|
||||||
|
// AesGcmEncrypt encrypt data with key use AES GCM algorithm
|
||||||
|
// Play: https://go.dev/play/p/rUt0-DmsPCs
|
||||||
|
func AesGcmEncrypt(data, key []byte) []byte {
|
||||||
|
if !isAesKeyLengthValid(len(key)) {
|
||||||
|
panic("aes: invalid key length (must be 16, 24, or 32 bytes)")
|
||||||
|
}
|
||||||
|
|
||||||
|
block, err := aes.NewCipher(key)
|
||||||
|
if err != nil {
|
||||||
|
panic("aes: failed to create cipher: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
gcm, err := cipher.NewGCM(block)
|
||||||
|
if err != nil {
|
||||||
|
panic("aes: failed to create GCM: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
nonce := make([]byte, gcm.NonceSize())
|
||||||
|
if _, err := io.ReadFull(rand.Reader, nonce); err != nil {
|
||||||
|
panic("aes: failed to generate nonce: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
ciphertext := gcm.Seal(nil, nonce, data, nil)
|
||||||
|
|
||||||
|
return append(nonce, ciphertext...)
|
||||||
|
}
|
||||||
|
|
||||||
|
// AesGcmDecrypt decrypt data with key use AES GCM algorithm
|
||||||
|
// Play: https://go.dev/play/p/rUt0-DmsPCs
|
||||||
|
func AesGcmDecrypt(data, key []byte) []byte {
|
||||||
|
if !isAesKeyLengthValid(len(key)) {
|
||||||
|
panic("aes: invalid key length (must be 16, 24, or 32 bytes)")
|
||||||
|
}
|
||||||
|
|
||||||
|
block, err := aes.NewCipher(key)
|
||||||
|
if err != nil {
|
||||||
|
panic("aes: failed to create cipher: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
gcm, err := cipher.NewGCM(block)
|
||||||
|
if err != nil {
|
||||||
|
panic("aes: failed to create GCM: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
nonceSize := gcm.NonceSize()
|
||||||
|
if len(data) < nonceSize {
|
||||||
|
panic("aes: ciphertext too short")
|
||||||
|
}
|
||||||
|
|
||||||
|
nonce, ciphertext := data[:nonceSize], data[nonceSize:]
|
||||||
|
plaintext, err := gcm.Open(nil, nonce, ciphertext, nil)
|
||||||
|
if err != nil {
|
||||||
|
panic("aes: decryption failed: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
return plaintext
|
||||||
|
}
|
||||||
|
|
||||||
|
// DesEcbEncrypt encrypt data with key use DES ECB algorithm
|
||||||
|
// len(key) should be 8.
|
||||||
|
// Play: https://go.dev/play/p/8qivmPeZy4P
|
||||||
|
func DesEcbEncrypt(data, key []byte) []byte {
|
||||||
|
cipher, err := des.NewCipher(generateDesKey(key))
|
||||||
|
if err != nil {
|
||||||
|
panic("des: failed to create cipher: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
blockSize := cipher.BlockSize()
|
||||||
|
padded := pkcs5Padding(data, blockSize)
|
||||||
|
encrypted := make([]byte, len(padded))
|
||||||
|
|
||||||
|
for i := 0; i < len(padded); i += blockSize {
|
||||||
|
cipher.Encrypt(encrypted[i:], padded[i:])
|
||||||
|
}
|
||||||
|
|
||||||
|
return encrypted
|
||||||
|
}
|
||||||
|
|
||||||
|
// DesEcbDecrypt decrypt data with key use DES ECB algorithm
|
||||||
|
// len(key) should be 8.
|
||||||
|
// Play: https://go.dev/play/p/8qivmPeZy4P
|
||||||
|
func DesEcbDecrypt(encrypted, key []byte) []byte {
|
||||||
|
cipher, err := des.NewCipher(generateDesKey(key))
|
||||||
|
if err != nil {
|
||||||
|
panic("des: failed to create cipher: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
blockSize := cipher.BlockSize()
|
||||||
|
if len(encrypted)%blockSize != 0 {
|
||||||
|
panic("des: invalid encrypted data length")
|
||||||
|
}
|
||||||
|
|
||||||
|
decrypted := make([]byte, len(encrypted))
|
||||||
|
for i := 0; i < len(encrypted); i += blockSize {
|
||||||
|
cipher.Decrypt(decrypted[i:], encrypted[i:])
|
||||||
|
}
|
||||||
|
|
||||||
|
// Remove padding
|
||||||
|
return pkcs5UnPadding(decrypted)
|
||||||
|
}
|
||||||
|
|
||||||
|
// DesCbcEncrypt encrypt data with key use DES CBC algorithm
|
||||||
|
// len(key) should be 8.
|
||||||
|
// Play: https://go.dev/play/p/4cC4QvWfe3_1
|
||||||
|
func DesCbcEncrypt(data, key []byte) []byte {
|
||||||
|
if len(key) != 8 {
|
||||||
|
panic("des: key length must be 8 bytes")
|
||||||
|
}
|
||||||
|
|
||||||
|
block, err := des.NewCipher(key)
|
||||||
|
if err != nil {
|
||||||
|
panic("des: failed to create cipher: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
blockSize := block.BlockSize()
|
||||||
|
data = pkcs7Padding(data, blockSize)
|
||||||
|
|
||||||
|
encrypted := make([]byte, blockSize+len(data))
|
||||||
|
iv := encrypted[:blockSize]
|
||||||
|
|
||||||
|
if _, err := io.ReadFull(rand.Reader, iv); err != nil {
|
||||||
|
panic("des: failed to generate IV: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
mode := cipher.NewCBCEncrypter(block, iv)
|
||||||
|
mode.CryptBlocks(encrypted[blockSize:], data)
|
||||||
|
|
||||||
|
return encrypted
|
||||||
|
}
|
||||||
|
|
||||||
|
// DesCbcDecrypt decrypt data with key use DES CBC algorithm
|
||||||
|
// len(key) should be 8.
|
||||||
|
// Play: https://go.dev/play/p/4cC4QvWfe3_1
|
||||||
|
func DesCbcDecrypt(encrypted, key []byte) []byte {
|
||||||
|
if len(key) != 8 {
|
||||||
|
panic("des: key length must be 8 bytes")
|
||||||
|
}
|
||||||
|
|
||||||
|
block, err := des.NewCipher(key)
|
||||||
|
if err != nil {
|
||||||
|
panic("des: failed to create cipher: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
blockSize := block.BlockSize()
|
||||||
|
if len(encrypted) < blockSize || len(encrypted)%blockSize != 0 {
|
||||||
|
panic("des: invalid encrypted data length")
|
||||||
|
}
|
||||||
|
|
||||||
|
iv := encrypted[:blockSize]
|
||||||
|
ciphertext := encrypted[blockSize:]
|
||||||
|
|
||||||
|
mode := cipher.NewCBCDecrypter(block, iv)
|
||||||
|
mode.CryptBlocks(ciphertext, ciphertext)
|
||||||
|
|
||||||
|
return pkcs7UnPadding(ciphertext)
|
||||||
|
}
|
||||||
|
|
||||||
|
// DesCtrCrypt encrypt data with key use DES CTR algorithm
|
||||||
|
// len(key) should be 8.
|
||||||
|
// Play: https://go.dev/play/p/9-T6OjKpcdw
|
||||||
|
// deprecated: use DesCtrEncrypt and DesCtrDecrypt instead.
|
||||||
|
func DesCtrCrypt(data, key []byte) []byte {
|
||||||
|
size := len(key)
|
||||||
|
if size != 8 {
|
||||||
|
panic("key length shoud be 8")
|
||||||
|
}
|
||||||
|
|
||||||
|
block, _ := des.NewCipher(key)
|
||||||
|
|
||||||
|
iv := bytes.Repeat([]byte("1"), block.BlockSize())
|
||||||
|
stream := cipher.NewCTR(block, iv)
|
||||||
|
|
||||||
|
dst := make([]byte, len(data))
|
||||||
|
stream.XORKeyStream(dst, data)
|
||||||
|
|
||||||
|
return dst
|
||||||
|
}
|
||||||
|
|
||||||
|
// DesCtrEncrypt encrypt data with key use DES CTR algorithm
|
||||||
|
// len(key) should be 8.
|
||||||
|
// Play: https://go.dev/play/p/S6p_WHCgH1d
|
||||||
|
func DesCtrEncrypt(data, key []byte) []byte {
|
||||||
|
if len(key) != 8 {
|
||||||
|
panic("des: key length must be 8 bytes")
|
||||||
|
}
|
||||||
|
|
||||||
|
block, err := des.NewCipher(key)
|
||||||
|
if err != nil {
|
||||||
|
panic("des: failed to create cipher: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
iv := make([]byte, block.BlockSize())
|
||||||
|
if _, err := io.ReadFull(rand.Reader, iv); err != nil {
|
||||||
|
panic("des: failed to generate IV: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
stream := cipher.NewCTR(block, iv)
|
||||||
|
|
||||||
|
encrypted := make([]byte, len(data))
|
||||||
|
stream.XORKeyStream(encrypted, data)
|
||||||
|
|
||||||
|
// 返回前缀包含 IV,便于解密
|
||||||
|
return append(iv, encrypted...)
|
||||||
|
}
|
||||||
|
|
||||||
|
// DesCtrDecrypt decrypt data with key use DES CTR algorithm
|
||||||
|
// len(key) should be 8.
|
||||||
|
// Play: https://go.dev/play/p/S6p_WHCgH1d
|
||||||
|
func DesCtrDecrypt(encrypted, key []byte) []byte {
|
||||||
|
if len(key) != 8 {
|
||||||
|
panic("des: key length must be 8 bytes")
|
||||||
|
}
|
||||||
|
|
||||||
|
block, err := des.NewCipher(key)
|
||||||
|
if err != nil {
|
||||||
|
panic("des: failed to create cipher: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
blockSize := block.BlockSize()
|
||||||
|
if len(encrypted) < blockSize {
|
||||||
|
panic("des: ciphertext too short")
|
||||||
|
}
|
||||||
|
|
||||||
|
iv := encrypted[:blockSize]
|
||||||
|
ciphertext := encrypted[blockSize:]
|
||||||
|
|
||||||
|
stream := cipher.NewCTR(block, iv)
|
||||||
|
|
||||||
|
decrypted := make([]byte, len(ciphertext))
|
||||||
|
stream.XORKeyStream(decrypted, ciphertext)
|
||||||
|
|
||||||
|
return decrypted
|
||||||
|
}
|
||||||
|
|
||||||
|
// DesCfbEncrypt encrypt data with key use DES CFB algorithm
|
||||||
|
// len(key) should be 8.
|
||||||
|
// Play: https://go.dev/play/p/y-eNxcFBlxL
|
||||||
|
func DesCfbEncrypt(data, key []byte) []byte {
|
||||||
|
if len(key) != 8 {
|
||||||
|
panic("des: key length must be 8 bytes")
|
||||||
|
}
|
||||||
|
|
||||||
|
block, err := des.NewCipher(key)
|
||||||
|
if err != nil {
|
||||||
|
panic("des: failed to create cipher: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
iv := make([]byte, des.BlockSize)
|
||||||
|
if _, err := io.ReadFull(rand.Reader, iv); err != nil {
|
||||||
|
panic("des: failed to generate IV: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
encrypted := make([]byte, des.BlockSize+len(data))
|
||||||
|
|
||||||
|
copy(encrypted[:des.BlockSize], iv)
|
||||||
|
|
||||||
|
stream := cipher.NewCFBEncrypter(block, iv)
|
||||||
|
stream.XORKeyStream(encrypted[des.BlockSize:], data)
|
||||||
|
|
||||||
|
return encrypted
|
||||||
|
}
|
||||||
|
|
||||||
|
// DesCfbDecrypt decrypt data with key use DES CFB algorithm
|
||||||
|
// len(encrypted) should be great than 16, len(key) should be 8.
|
||||||
|
// Play: https://go.dev/play/p/y-eNxcFBlxL
|
||||||
|
func DesCfbDecrypt(encrypted, key []byte) []byte {
|
||||||
|
if len(key) != 8 {
|
||||||
|
panic("des: key length must be 8 bytes")
|
||||||
|
}
|
||||||
|
|
||||||
|
block, err := des.NewCipher(key)
|
||||||
|
if err != nil {
|
||||||
|
panic("des: failed to create cipher: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
if len(encrypted) < des.BlockSize {
|
||||||
|
panic("des: encrypted data too short")
|
||||||
|
}
|
||||||
|
|
||||||
|
iv := encrypted[:des.BlockSize]
|
||||||
|
ciphertext := encrypted[des.BlockSize:]
|
||||||
|
|
||||||
|
stream := cipher.NewCFBDecrypter(block, iv)
|
||||||
|
stream.XORKeyStream(ciphertext, ciphertext)
|
||||||
|
|
||||||
|
return ciphertext
|
||||||
|
}
|
||||||
|
|
||||||
|
// DesOfbEncrypt encrypt data with key use DES OFB algorithm
|
||||||
|
// len(key) should be 8.
|
||||||
|
// Play: https://go.dev/play/p/74KmNadjN1J
|
||||||
|
func DesOfbEncrypt(data, key []byte) []byte {
|
||||||
|
if len(key) != 8 {
|
||||||
|
panic("des: key length must be 8 bytes")
|
||||||
|
}
|
||||||
|
|
||||||
|
block, err := des.NewCipher(key)
|
||||||
|
if err != nil {
|
||||||
|
panic("des: failed to create cipher: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
data = pkcs7Padding(data, des.BlockSize)
|
||||||
|
|
||||||
|
iv := make([]byte, des.BlockSize)
|
||||||
|
if _, err := io.ReadFull(rand.Reader, iv); err != nil {
|
||||||
|
panic("des: failed to generate IV: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
encrypted := make([]byte, des.BlockSize+len(data))
|
||||||
|
copy(encrypted[:des.BlockSize], iv)
|
||||||
|
|
||||||
|
stream := cipher.NewOFB(block, iv)
|
||||||
|
stream.XORKeyStream(encrypted[des.BlockSize:], data)
|
||||||
|
|
||||||
|
return encrypted
|
||||||
|
}
|
||||||
|
|
||||||
|
// DesOfbDecrypt decrypt data with key use DES OFB algorithm
|
||||||
|
// len(key) should be 8.
|
||||||
|
// Play: https://go.dev/play/p/74KmNadjN1J
|
||||||
|
func DesOfbDecrypt(data, key []byte) []byte {
|
||||||
|
if len(key) != 8 {
|
||||||
|
panic("des: key length must be 8 bytes")
|
||||||
|
}
|
||||||
|
|
||||||
|
block, err := des.NewCipher(key)
|
||||||
|
if err != nil {
|
||||||
|
panic("des: failed to create cipher: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
if len(data) < des.BlockSize {
|
||||||
|
panic("des: encrypted data too short")
|
||||||
|
}
|
||||||
|
|
||||||
|
iv := data[:des.BlockSize]
|
||||||
|
ciphertext := data[des.BlockSize:]
|
||||||
|
|
||||||
|
stream := cipher.NewOFB(block, iv)
|
||||||
|
decrypted := make([]byte, len(ciphertext))
|
||||||
|
stream.XORKeyStream(decrypted, ciphertext)
|
||||||
|
|
||||||
|
decrypted = pkcs7UnPadding(decrypted)
|
||||||
|
|
||||||
|
return decrypted
|
||||||
|
}
|
||||||
|
|
||||||
|
// GenerateRsaKey create rsa private and public pemo file.
|
||||||
|
// Play: https://go.dev/play/p/zutRHrDqs0X
|
||||||
|
func GenerateRsaKey(keySize int, priKeyFile, pubKeyFile string) error {
|
||||||
|
// private key
|
||||||
|
privateKey, err := rsa.GenerateKey(rand.Reader, keySize)
|
||||||
|
if err != nil {
|
||||||
|
return err
|
||||||
|
}
|
||||||
|
|
||||||
|
derText := x509.MarshalPKCS1PrivateKey(privateKey)
|
||||||
|
|
||||||
|
block := pem.Block{
|
||||||
|
Type: "rsa private key",
|
||||||
|
Bytes: derText,
|
||||||
|
}
|
||||||
|
|
||||||
|
file, err := os.Create(priKeyFile)
|
||||||
|
if err != nil {
|
||||||
|
panic(err)
|
||||||
|
}
|
||||||
|
err = pem.Encode(file, &block)
|
||||||
|
if err != nil {
|
||||||
|
return err
|
||||||
|
}
|
||||||
|
|
||||||
|
file.Close()
|
||||||
|
|
||||||
|
// public key
|
||||||
|
publicKey := privateKey.PublicKey
|
||||||
|
|
||||||
|
derpText, err := x509.MarshalPKIXPublicKey(&publicKey)
|
||||||
|
if err != nil {
|
||||||
|
return err
|
||||||
|
}
|
||||||
|
|
||||||
|
block = pem.Block{
|
||||||
|
Type: "rsa public key",
|
||||||
|
Bytes: derpText,
|
||||||
|
}
|
||||||
|
|
||||||
|
file, err = os.Create(pubKeyFile)
|
||||||
|
if err != nil {
|
||||||
|
return err
|
||||||
|
}
|
||||||
|
|
||||||
|
err = pem.Encode(file, &block)
|
||||||
|
if err != nil {
|
||||||
|
return err
|
||||||
|
}
|
||||||
|
|
||||||
|
file.Close()
|
||||||
|
|
||||||
|
return nil
|
||||||
|
}
|
||||||
|
|
||||||
|
// RsaEncrypt encrypt data with ras algorithm.
|
||||||
|
// Play: https://go.dev/play/p/7_zo6mrx-eX
|
||||||
|
func RsaEncrypt(data []byte, pubKeyFileName string) []byte {
|
||||||
|
file, err := os.Open(pubKeyFileName)
|
||||||
|
if err != nil {
|
||||||
|
panic(err)
|
||||||
|
}
|
||||||
|
fileInfo, err := file.Stat()
|
||||||
|
if err != nil {
|
||||||
|
panic(err)
|
||||||
|
}
|
||||||
|
defer file.Close()
|
||||||
|
buf := make([]byte, fileInfo.Size())
|
||||||
|
|
||||||
|
_, err = file.Read(buf)
|
||||||
|
if err != nil {
|
||||||
|
panic(err)
|
||||||
|
}
|
||||||
|
|
||||||
|
block, _ := pem.Decode(buf)
|
||||||
|
|
||||||
|
pubInterface, err := x509.ParsePKIXPublicKey(block.Bytes)
|
||||||
|
if err != nil {
|
||||||
|
panic(err)
|
||||||
|
}
|
||||||
|
pubKey := pubInterface.(*rsa.PublicKey)
|
||||||
|
|
||||||
|
cipherText, err := rsa.EncryptPKCS1v15(rand.Reader, pubKey, data)
|
||||||
|
if err != nil {
|
||||||
|
panic(err)
|
||||||
|
}
|
||||||
|
|
||||||
|
return cipherText
|
||||||
|
}
|
||||||
|
|
||||||
|
// RsaDecrypt decrypt data with ras algorithm.
|
||||||
|
// Play: https://go.dev/play/p/7_zo6mrx-eX
|
||||||
|
func RsaDecrypt(data []byte, privateKeyFileName string) []byte {
|
||||||
|
file, err := os.Open(privateKeyFileName)
|
||||||
|
if err != nil {
|
||||||
|
panic(err)
|
||||||
|
}
|
||||||
|
fileInfo, err := file.Stat()
|
||||||
|
if err != nil {
|
||||||
|
panic(err)
|
||||||
|
}
|
||||||
|
buf := make([]byte, fileInfo.Size())
|
||||||
|
defer file.Close()
|
||||||
|
|
||||||
|
_, err = file.Read(buf)
|
||||||
|
if err != nil {
|
||||||
|
panic(err)
|
||||||
|
}
|
||||||
|
|
||||||
|
block, _ := pem.Decode(buf)
|
||||||
|
|
||||||
|
priKey, err := x509.ParsePKCS1PrivateKey(block.Bytes)
|
||||||
|
if err != nil {
|
||||||
|
panic(err)
|
||||||
|
}
|
||||||
|
|
||||||
|
plainText, err := rsa.DecryptPKCS1v15(rand.Reader, priKey, data)
|
||||||
|
if err != nil {
|
||||||
|
panic(err)
|
||||||
|
}
|
||||||
|
|
||||||
|
return plainText
|
||||||
|
}
|
||||||
|
|
||||||
|
// GenerateRsaKeyPair create rsa private and public key.
|
||||||
|
// Play: https://go.dev/play/p/sSVmkfENKMz
|
||||||
|
func GenerateRsaKeyPair(keySize int) (*rsa.PrivateKey, *rsa.PublicKey) {
|
||||||
|
privateKey, _ := rsa.GenerateKey(rand.Reader, keySize)
|
||||||
|
return privateKey, &privateKey.PublicKey
|
||||||
|
}
|
||||||
|
|
||||||
|
// RsaEncryptOAEP encrypts the given data with RSA-OAEP.
|
||||||
|
// Play: https://go.dev/play/p/sSVmkfENKMz
|
||||||
|
func RsaEncryptOAEP(data []byte, label []byte, key rsa.PublicKey) ([]byte, error) {
|
||||||
|
encryptedBytes, err := rsa.EncryptOAEP(sha256.New(), rand.Reader, &key, data, label)
|
||||||
|
if err != nil {
|
||||||
|
return nil, err
|
||||||
|
}
|
||||||
|
|
||||||
|
return encryptedBytes, nil
|
||||||
|
}
|
||||||
|
|
||||||
|
// RsaDecryptOAEP decrypts the data with RSA-OAEP.
|
||||||
|
// Play: https://go.dev/play/p/sSVmkfENKMz
|
||||||
|
func RsaDecryptOAEP(ciphertext []byte, label []byte, key rsa.PrivateKey) ([]byte, error) {
|
||||||
|
decryptedBytes, err := rsa.DecryptOAEP(sha256.New(), rand.Reader, &key, ciphertext, label)
|
||||||
|
if err != nil {
|
||||||
|
return nil, err
|
||||||
|
}
|
||||||
|
|
||||||
|
return decryptedBytes, nil
|
||||||
|
}
|
||||||
|
|
||||||
|
// RsaSign signs the data with RSA.
|
||||||
|
// Play: https://go.dev/play/p/qhsbf8BJ6Mf
|
||||||
|
func RsaSign(hash crypto.Hash, data []byte, privateKeyFileName string) ([]byte, error) {
|
||||||
|
privateKey, err := loadRasPrivateKey(privateKeyFileName)
|
||||||
|
if err != nil {
|
||||||
|
return nil, err
|
||||||
|
}
|
||||||
|
|
||||||
|
hashed, err := hashData(hash, data)
|
||||||
|
if err != nil {
|
||||||
|
return nil, err
|
||||||
|
}
|
||||||
|
|
||||||
|
return rsa.SignPKCS1v15(rand.Reader, privateKey, hash, hashed)
|
||||||
|
}
|
||||||
|
|
||||||
|
// RsaVerifySign verifies the signature of the data with RSA.
|
||||||
|
// Play: https://go.dev/play/p/qhsbf8BJ6Mf
|
||||||
|
func RsaVerifySign(hash crypto.Hash, data, signature []byte, pubKeyFileName string) error {
|
||||||
|
publicKey, err := loadRsaPublicKey(pubKeyFileName)
|
||||||
|
if err != nil {
|
||||||
|
return err
|
||||||
|
}
|
||||||
|
|
||||||
|
hashed, err := hashData(hash, data)
|
||||||
|
if err != nil {
|
||||||
|
return err
|
||||||
|
}
|
||||||
|
|
||||||
|
return rsa.VerifyPKCS1v15(publicKey, hash, hashed, signature)
|
||||||
|
}
|
||||||
+240
-26
@@ -1,6 +1,9 @@
|
|||||||
package cryptor
|
package cryptor
|
||||||
|
|
||||||
import "fmt"
|
import (
|
||||||
|
"crypto"
|
||||||
|
"fmt"
|
||||||
|
)
|
||||||
|
|
||||||
func ExampleAesEcbEncrypt() {
|
func ExampleAesEcbEncrypt() {
|
||||||
data := "hello"
|
data := "hello"
|
||||||
@@ -71,6 +74,32 @@ func ExampleAesCtrCrypt() {
|
|||||||
// hello
|
// hello
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func ExampleAesCtrEncrypt() {
|
||||||
|
data := "hello"
|
||||||
|
key := "abcdefghijklmnop"
|
||||||
|
|
||||||
|
enCrypt := AesCtrEncrypt([]byte(data), []byte(key))
|
||||||
|
deCrypt := AesCtrDecrypt(enCrypt, []byte(key))
|
||||||
|
|
||||||
|
fmt.Println(string(deCrypt))
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// hello
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleAesCtrDecrypt() {
|
||||||
|
data := "hello"
|
||||||
|
key := "abcdefghijklmnop"
|
||||||
|
|
||||||
|
enCrypt := AesCtrEncrypt([]byte(data), []byte(key))
|
||||||
|
deCrypt := AesCtrDecrypt(enCrypt, []byte(key))
|
||||||
|
|
||||||
|
fmt.Println(string(deCrypt))
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// hello
|
||||||
|
}
|
||||||
|
|
||||||
func ExampleAesCfbEncrypt() {
|
func ExampleAesCfbEncrypt() {
|
||||||
data := "hello"
|
data := "hello"
|
||||||
key := "abcdefghijklmnop"
|
key := "abcdefghijklmnop"
|
||||||
@@ -127,6 +156,34 @@ func ExampleAesOfbDecrypt() {
|
|||||||
// hello
|
// hello
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func ExampleAesGcmEncrypt() {
|
||||||
|
data := "hello"
|
||||||
|
key := "abcdefghijklmnop"
|
||||||
|
|
||||||
|
encrypted := AesGcmEncrypt([]byte(data), []byte(key))
|
||||||
|
|
||||||
|
decrypted := AesGcmDecrypt(encrypted, []byte(key))
|
||||||
|
|
||||||
|
fmt.Println(string(decrypted))
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// hello
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleAesGcmDecrypt() {
|
||||||
|
data := "hello"
|
||||||
|
key := "abcdefghijklmnop"
|
||||||
|
|
||||||
|
encrypted := AesGcmEncrypt([]byte(data), []byte(key))
|
||||||
|
|
||||||
|
decrypted := AesGcmDecrypt(encrypted, []byte(key))
|
||||||
|
|
||||||
|
fmt.Println(string(decrypted))
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// hello
|
||||||
|
}
|
||||||
|
|
||||||
func ExampleDesEcbEncrypt() {
|
func ExampleDesEcbEncrypt() {
|
||||||
data := "hello"
|
data := "hello"
|
||||||
key := "abcdefgh"
|
key := "abcdefgh"
|
||||||
@@ -196,6 +253,19 @@ func ExampleDesCtrCrypt() {
|
|||||||
// hello
|
// hello
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func ExampleDesCtrDecrypt() {
|
||||||
|
data := "hello"
|
||||||
|
key := "abcdefgh"
|
||||||
|
|
||||||
|
enCrypt := DesCtrEncrypt([]byte(data), []byte(key))
|
||||||
|
deCrypt := DesCtrDecrypt(enCrypt, []byte(key))
|
||||||
|
|
||||||
|
fmt.Println(string(deCrypt))
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// hello
|
||||||
|
}
|
||||||
|
|
||||||
func ExampleDesCfbEncrypt() {
|
func ExampleDesCfbEncrypt() {
|
||||||
data := "hello"
|
data := "hello"
|
||||||
key := "abcdefgh"
|
key := "abcdefgh"
|
||||||
@@ -254,7 +324,7 @@ func ExampleDesOfbDecrypt() {
|
|||||||
|
|
||||||
func ExampleGenerateRsaKey() {
|
func ExampleGenerateRsaKey() {
|
||||||
// Create ras private and public pem file
|
// Create ras private and public pem file
|
||||||
err := GenerateRsaKey(4096, "rsa_private.pem", "rsa_public.pem")
|
err := GenerateRsaKey(4096, "rsa_private_example.pem", "rsa_public_example.pem")
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return
|
return
|
||||||
}
|
}
|
||||||
@@ -267,14 +337,14 @@ func ExampleGenerateRsaKey() {
|
|||||||
|
|
||||||
func ExampleRsaEncrypt() {
|
func ExampleRsaEncrypt() {
|
||||||
// Create ras private and public pem file
|
// Create ras private and public pem file
|
||||||
err := GenerateRsaKey(4096, "rsa_private.pem", "rsa_public.pem")
|
err := GenerateRsaKey(4096, "rsa_private_example.pem", "rsa_public_example.pem")
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return
|
return
|
||||||
}
|
}
|
||||||
|
|
||||||
data := []byte("hello")
|
data := []byte("hello")
|
||||||
encrypted := RsaEncrypt(data, "rsa_public.pem")
|
encrypted := RsaEncrypt(data, "rsa_public_example.pem")
|
||||||
decrypted := RsaDecrypt(encrypted, "rsa_private.pem")
|
decrypted := RsaDecrypt(encrypted, "rsa_private_example.pem")
|
||||||
|
|
||||||
fmt.Println(string(decrypted))
|
fmt.Println(string(decrypted))
|
||||||
|
|
||||||
@@ -284,14 +354,14 @@ func ExampleRsaEncrypt() {
|
|||||||
|
|
||||||
func ExampleRsaDecrypt() {
|
func ExampleRsaDecrypt() {
|
||||||
// Create ras private and public pem file
|
// Create ras private and public pem file
|
||||||
err := GenerateRsaKey(4096, "rsa_private.pem", "rsa_public.pem")
|
err := GenerateRsaKey(4096, "rsa_private_example.pem", "rsa_public_example.pem")
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return
|
return
|
||||||
}
|
}
|
||||||
|
|
||||||
data := []byte("hello")
|
data := []byte("hello")
|
||||||
encrypted := RsaEncrypt(data, "rsa_public.pem")
|
encrypted := RsaEncrypt(data, "rsa_public_example.pem")
|
||||||
decrypted := RsaDecrypt(encrypted, "rsa_private.pem")
|
decrypted := RsaDecrypt(encrypted, "rsa_private_example.pem")
|
||||||
|
|
||||||
fmt.Println(string(decrypted))
|
fmt.Println(string(decrypted))
|
||||||
|
|
||||||
@@ -322,89 +392,233 @@ func ExampleHmacMd5() {
|
|||||||
key := "12345"
|
key := "12345"
|
||||||
|
|
||||||
hms := HmacMd5(str, key)
|
hms := HmacMd5(str, key)
|
||||||
|
|
||||||
fmt.Println(hms)
|
fmt.Println(hms)
|
||||||
|
|
||||||
// Output:
|
// Output:
|
||||||
// e834306eab892d872525d4918a7a639a
|
// e834306eab892d872525d4918a7a639a
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func ExampleHmacMd5WithBase64() {
|
||||||
|
str := "hello"
|
||||||
|
key := "12345"
|
||||||
|
|
||||||
|
hms := HmacMd5WithBase64(str, key)
|
||||||
|
fmt.Println(hms)
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// 6DQwbquJLYclJdSRinpjmg==
|
||||||
|
}
|
||||||
|
|
||||||
func ExampleHmacSha1() {
|
func ExampleHmacSha1() {
|
||||||
str := "hello"
|
str := "hello"
|
||||||
key := "12345"
|
key := "12345"
|
||||||
|
|
||||||
hms := HmacSha1(str, key)
|
hms := HmacSha1(str, key)
|
||||||
|
|
||||||
fmt.Println(hms)
|
fmt.Println(hms)
|
||||||
|
|
||||||
// Output:
|
// Output:
|
||||||
// 5c6a9db0cccb92e36ed0323fd09b7f936de9ace0
|
// 5c6a9db0cccb92e36ed0323fd09b7f936de9ace0
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func ExampleHmacSha1WithBase64() {
|
||||||
|
str := "hello"
|
||||||
|
key := "12345"
|
||||||
|
|
||||||
|
hms := HmacSha1WithBase64(str, key)
|
||||||
|
fmt.Println(hms)
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// XGqdsMzLkuNu0DI/0Jt/k23prOA=
|
||||||
|
}
|
||||||
|
|
||||||
func ExampleHmacSha256() {
|
func ExampleHmacSha256() {
|
||||||
str := "hello"
|
str := "hello"
|
||||||
key := "12345"
|
key := "12345"
|
||||||
|
|
||||||
hms := HmacSha256(str, key)
|
hms := HmacSha256(str, key)
|
||||||
|
|
||||||
fmt.Println(hms)
|
fmt.Println(hms)
|
||||||
|
|
||||||
// Output:
|
// Output:
|
||||||
// 315bb93c4e989862ba09cb62e05d73a5f376cb36f0d786edab0c320d059fde75
|
// 315bb93c4e989862ba09cb62e05d73a5f376cb36f0d786edab0c320d059fde75
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func ExampleHmacSha256WithBase64() {
|
||||||
|
str := "hello"
|
||||||
|
key := "12345"
|
||||||
|
|
||||||
|
hms := HmacSha256WithBase64(str, key)
|
||||||
|
fmt.Println(hms)
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// MVu5PE6YmGK6Ccti4F1zpfN2yzbw14btqwwyDQWf3nU=
|
||||||
|
}
|
||||||
|
|
||||||
func ExampleHmacSha512() {
|
func ExampleHmacSha512() {
|
||||||
str := "hello"
|
str := "hello"
|
||||||
key := "12345"
|
key := "12345"
|
||||||
|
|
||||||
hms := HmacSha512(str, key)
|
hms := HmacSha512(str, key)
|
||||||
|
|
||||||
fmt.Println(hms)
|
fmt.Println(hms)
|
||||||
|
|
||||||
// Output:
|
// Output:
|
||||||
// dd8f1290a9dd23d354e2526d9a2e9ce8cffffdd37cb320800d1c6c13d2efc363288376a196c5458daf53f8e1aa6b45a6d856303d5c0a2064bff9785861d48cfc
|
// dd8f1290a9dd23d354e2526d9a2e9ce8cffffdd37cb320800d1c6c13d2efc363288376a196c5458daf53f8e1aa6b45a6d856303d5c0a2064bff9785861d48cfc
|
||||||
}
|
}
|
||||||
|
|
||||||
func ExampleMd5String() {
|
func ExampleHmacSha512WithBase64() {
|
||||||
str := "hello"
|
str := "hello"
|
||||||
|
key := "12345"
|
||||||
|
|
||||||
md5Str := Md5String(str)
|
hms := HmacSha512WithBase64(str, key)
|
||||||
|
fmt.Println(hms)
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// 3Y8SkKndI9NU4lJtmi6c6M///dN8syCADRxsE9Lvw2Mog3ahlsVFja9T+OGqa0Wm2FYwPVwKIGS/+XhYYdSM/A==
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleMd5String() {
|
||||||
|
md5Str := Md5String("hello")
|
||||||
fmt.Println(md5Str)
|
fmt.Println(md5Str)
|
||||||
|
|
||||||
// Output:
|
// Output:
|
||||||
// 5d41402abc4b2a76b9719d911017c592
|
// 5d41402abc4b2a76b9719d911017c592
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func ExampleMd5StringWithBase64() {
|
||||||
|
md5Str := Md5StringWithBase64("hello")
|
||||||
|
fmt.Println(md5Str)
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// XUFAKrxLKna5cZ2REBfFkg==
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleMd5Byte() {
|
||||||
|
md5Str := Md5Byte([]byte{'a'})
|
||||||
|
fmt.Println(md5Str)
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// 0cc175b9c0f1b6a831c399e269772661
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleMd5ByteWithBase64() {
|
||||||
|
md5Str := Md5ByteWithBase64([]byte("hello"))
|
||||||
|
fmt.Println(md5Str)
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// XUFAKrxLKna5cZ2REBfFkg==
|
||||||
|
}
|
||||||
|
|
||||||
func ExampleSha1() {
|
func ExampleSha1() {
|
||||||
str := "hello"
|
result := Sha1("hello")
|
||||||
|
|
||||||
result := Sha1(str)
|
|
||||||
|
|
||||||
fmt.Println(result)
|
fmt.Println(result)
|
||||||
|
|
||||||
// Output:
|
// Output:
|
||||||
// aaf4c61ddcc5e8a2dabede0f3b482cd9aea9434d
|
// aaf4c61ddcc5e8a2dabede0f3b482cd9aea9434d
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func ExampleSha1WithBase64() {
|
||||||
|
result := Sha1WithBase64("hello")
|
||||||
|
fmt.Println(result)
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// qvTGHdzF6KLavt4PO0gs2a6pQ00=
|
||||||
|
}
|
||||||
|
|
||||||
func ExampleSha256() {
|
func ExampleSha256() {
|
||||||
str := "hello"
|
result := Sha256("hello")
|
||||||
|
|
||||||
result := Sha256(str)
|
|
||||||
|
|
||||||
fmt.Println(result)
|
fmt.Println(result)
|
||||||
|
|
||||||
// Output:
|
// Output:
|
||||||
// 2cf24dba5fb0a30e26e83b2ac5b9e29e1b161e5c1fa7425e73043362938b9824
|
// 2cf24dba5fb0a30e26e83b2ac5b9e29e1b161e5c1fa7425e73043362938b9824
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func ExampleSha256WithBase64() {
|
||||||
|
result := Sha256WithBase64("hello")
|
||||||
|
fmt.Println(result)
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// LPJNul+wow4m6DsqxbninhsWHlwfp0JecwQzYpOLmCQ=
|
||||||
|
}
|
||||||
|
|
||||||
func ExampleSha512() {
|
func ExampleSha512() {
|
||||||
str := "hello"
|
result := Sha512("hello")
|
||||||
|
|
||||||
result := Sha512(str)
|
|
||||||
|
|
||||||
fmt.Println(result)
|
fmt.Println(result)
|
||||||
|
|
||||||
// Output:
|
// Output:
|
||||||
// 9b71d224bd62f3785d96d46ad3ea3d73319bfbc2890caadae2dff72519673ca72323c3d99ba5c11d7c7acc6e14b8c5da0c4663475c2e5c3adef46f73bcdec043
|
// 9b71d224bd62f3785d96d46ad3ea3d73319bfbc2890caadae2dff72519673ca72323c3d99ba5c11d7c7acc6e14b8c5da0c4663475c2e5c3adef46f73bcdec043
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func ExampleSha512WithBase64() {
|
||||||
|
result := Sha512WithBase64("hello")
|
||||||
|
fmt.Println(result)
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// m3HSJL1i83hdltRq0+o9czGb+8KJDKra4t/3JRlnPKcjI8PZm6XBHXx6zG4UuMXaDEZjR1wuXDre9G9zvN7AQw==
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleRsaEncryptOAEP() {
|
||||||
|
pri, pub := GenerateRsaKeyPair(1024)
|
||||||
|
|
||||||
|
data := []byte("hello world")
|
||||||
|
label := []byte("123456")
|
||||||
|
|
||||||
|
encrypted, err := RsaEncryptOAEP(data, label, *pub)
|
||||||
|
if err != nil {
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
decrypted, err := RsaDecryptOAEP([]byte(encrypted), label, *pri)
|
||||||
|
if err != nil {
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
fmt.Println(string(decrypted))
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// hello world
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleRsaSign() {
|
||||||
|
data := []byte("This is a test data for RSA signing")
|
||||||
|
hash := crypto.SHA256
|
||||||
|
|
||||||
|
privateKey := "./rsa_private_example.pem"
|
||||||
|
publicKey := "./rsa_public_example.pem"
|
||||||
|
|
||||||
|
signature, err := RsaSign(hash, data, privateKey)
|
||||||
|
if err != nil {
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
err = RsaVerifySign(hash, data, signature, publicKey)
|
||||||
|
if err != nil {
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
fmt.Println("ok")
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// ok
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleRsaVerifySign() {
|
||||||
|
data := []byte("This is a test data for RSA signing")
|
||||||
|
hash := crypto.SHA256
|
||||||
|
|
||||||
|
privateKey := "./rsa_private_example.pem"
|
||||||
|
publicKey := "./rsa_public_example.pem"
|
||||||
|
|
||||||
|
signature, err := RsaSign(hash, data, privateKey)
|
||||||
|
if err != nil {
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
err = RsaVerifySign(hash, data, signature, publicKey)
|
||||||
|
if err != nil {
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
fmt.Println("ok")
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// ok
|
||||||
|
}
|
||||||
+148
-1
@@ -1,6 +1,17 @@
|
|||||||
package cryptor
|
package cryptor
|
||||||
|
|
||||||
import "bytes"
|
import (
|
||||||
|
"bytes"
|
||||||
|
"crypto"
|
||||||
|
"crypto/rsa"
|
||||||
|
"crypto/sha256"
|
||||||
|
"crypto/sha512"
|
||||||
|
"crypto/x509"
|
||||||
|
"encoding/pem"
|
||||||
|
"errors"
|
||||||
|
"os"
|
||||||
|
"strings"
|
||||||
|
)
|
||||||
|
|
||||||
func generateAesKey(key []byte, size int) []byte {
|
func generateAesKey(key []byte, size int) []byte {
|
||||||
genKey := make([]byte, size)
|
genKey := make([]byte, size)
|
||||||
@@ -35,3 +46,139 @@ func pkcs7UnPadding(src []byte) []byte {
|
|||||||
unPadding := int(src[length-1])
|
unPadding := int(src[length-1])
|
||||||
return src[:(length - unPadding)]
|
return src[:(length - unPadding)]
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func pkcs5Padding(data []byte, blockSize int) []byte {
|
||||||
|
padding := blockSize - len(data)%blockSize
|
||||||
|
padText := bytes.Repeat([]byte{byte(padding)}, padding)
|
||||||
|
return append(data, padText...)
|
||||||
|
}
|
||||||
|
|
||||||
|
func pkcs5UnPadding(data []byte) []byte {
|
||||||
|
length := len(data)
|
||||||
|
if length == 0 {
|
||||||
|
return nil
|
||||||
|
}
|
||||||
|
padLen := int(data[length-1])
|
||||||
|
if padLen == 0 || padLen > length {
|
||||||
|
return nil
|
||||||
|
}
|
||||||
|
return data[:length-padLen]
|
||||||
|
}
|
||||||
|
|
||||||
|
func isAesKeyLengthValid(n int) bool {
|
||||||
|
return n == 16 || n == 24 || n == 32
|
||||||
|
}
|
||||||
|
|
||||||
|
// loadRsaPrivateKey loads and parses a PEM encoded private key file.
|
||||||
|
func loadRsaPublicKey(filename string) (*rsa.PublicKey, error) {
|
||||||
|
pubKeyData, err := os.ReadFile(filename)
|
||||||
|
if err != nil {
|
||||||
|
return nil, err
|
||||||
|
}
|
||||||
|
|
||||||
|
block, _ := pem.Decode(pubKeyData)
|
||||||
|
if block == nil {
|
||||||
|
return nil, errors.New("failed to decode PEM block containing the public key")
|
||||||
|
}
|
||||||
|
|
||||||
|
var pubKey *rsa.PublicKey
|
||||||
|
blockType := strings.ToUpper(block.Type)
|
||||||
|
|
||||||
|
if blockType == "RSA PUBLIC KEY" {
|
||||||
|
pubKey, err = x509.ParsePKCS1PublicKey(block.Bytes)
|
||||||
|
if err != nil {
|
||||||
|
key, err := x509.ParsePKIXPublicKey(block.Bytes)
|
||||||
|
if err != nil {
|
||||||
|
return nil, err
|
||||||
|
}
|
||||||
|
|
||||||
|
var ok bool
|
||||||
|
pubKey, ok = key.(*rsa.PublicKey)
|
||||||
|
if !ok {
|
||||||
|
return nil, errors.New("failed to parse RSA private key")
|
||||||
|
}
|
||||||
|
}
|
||||||
|
} else if blockType == "PUBLIC KEY" {
|
||||||
|
key, err := x509.ParsePKIXPublicKey(block.Bytes)
|
||||||
|
if err != nil {
|
||||||
|
return nil, err
|
||||||
|
}
|
||||||
|
|
||||||
|
var ok bool
|
||||||
|
pubKey, ok = key.(*rsa.PublicKey)
|
||||||
|
if !ok {
|
||||||
|
return nil, errors.New("failed to parse RSA private key")
|
||||||
|
}
|
||||||
|
|
||||||
|
} else {
|
||||||
|
return nil, errors.New("unsupported key type")
|
||||||
|
}
|
||||||
|
|
||||||
|
return pubKey, nil
|
||||||
|
}
|
||||||
|
|
||||||
|
// loadRsaPrivateKey loads and parses a PEM encoded private key file.
|
||||||
|
func loadRasPrivateKey(filename string) (*rsa.PrivateKey, error) {
|
||||||
|
priKeyData, err := os.ReadFile(filename)
|
||||||
|
if err != nil {
|
||||||
|
return nil, err
|
||||||
|
}
|
||||||
|
|
||||||
|
block, _ := pem.Decode(priKeyData)
|
||||||
|
if block == nil {
|
||||||
|
return nil, errors.New("failed to decode PEM block containing the private key")
|
||||||
|
}
|
||||||
|
|
||||||
|
var privateKey *rsa.PrivateKey
|
||||||
|
blockType := strings.ToUpper(block.Type)
|
||||||
|
|
||||||
|
// PKCS#1 format
|
||||||
|
if blockType == "RSA PRIVATE KEY" {
|
||||||
|
privateKey, err = x509.ParsePKCS1PrivateKey(block.Bytes)
|
||||||
|
if err != nil {
|
||||||
|
return nil, err
|
||||||
|
}
|
||||||
|
} else if blockType == "PRIVATE KEY" { // PKCS#8 format
|
||||||
|
priKey, err := x509.ParsePKCS8PrivateKey(block.Bytes)
|
||||||
|
if err != nil {
|
||||||
|
return nil, err
|
||||||
|
}
|
||||||
|
var ok bool
|
||||||
|
privateKey, ok = priKey.(*rsa.PrivateKey)
|
||||||
|
if !ok {
|
||||||
|
return nil, errors.New("failed to parse RSA private key")
|
||||||
|
}
|
||||||
|
} else {
|
||||||
|
return nil, errors.New("unsupported key type")
|
||||||
|
}
|
||||||
|
|
||||||
|
return privateKey, nil
|
||||||
|
}
|
||||||
|
|
||||||
|
// hashData returns the hash value of the data, using the specified hash function
|
||||||
|
func hashData(hash crypto.Hash, data []byte) ([]byte, error) {
|
||||||
|
if !hash.Available() {
|
||||||
|
return nil, errors.New("unsupported hash algorithm")
|
||||||
|
}
|
||||||
|
|
||||||
|
var hashed []byte
|
||||||
|
|
||||||
|
switch hash {
|
||||||
|
case crypto.SHA224:
|
||||||
|
h := sha256.Sum224(data)
|
||||||
|
hashed = h[:]
|
||||||
|
case crypto.SHA256:
|
||||||
|
h := sha256.Sum256(data)
|
||||||
|
hashed = h[:]
|
||||||
|
case crypto.SHA384:
|
||||||
|
h := sha512.Sum384(data)
|
||||||
|
hashed = h[:]
|
||||||
|
case crypto.SHA512:
|
||||||
|
h := sha512.Sum512(data)
|
||||||
|
hashed = h[:]
|
||||||
|
default:
|
||||||
|
return nil, errors.New("unsupported hash algorithm")
|
||||||
|
}
|
||||||
|
|
||||||
|
return hashed, nil
|
||||||
|
}
|
||||||
@@ -0,0 +1,234 @@
|
|||||||
|
package cryptor
|
||||||
|
|
||||||
|
import (
|
||||||
|
"crypto"
|
||||||
|
"testing"
|
||||||
|
|
||||||
|
"github.com/duke-git/lancet/v2/internal"
|
||||||
|
)
|
||||||
|
|
||||||
|
func TestAesEcbCrypt(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
data := "hello world"
|
||||||
|
key := "abcdefghijklmnop"
|
||||||
|
|
||||||
|
aesEcbEncrypt := AesEcbEncrypt([]byte(data), []byte(key))
|
||||||
|
aesEcbDecrypt := AesEcbDecrypt(aesEcbEncrypt, []byte(key))
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestAesEcbCrypt")
|
||||||
|
assert.Equal(data, string(aesEcbDecrypt))
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestAesCbcCrypt(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
data := "hello world"
|
||||||
|
key := "abcdefghijklmnop"
|
||||||
|
|
||||||
|
aesCbcEncrypt := AesCbcEncrypt([]byte(data), []byte(key))
|
||||||
|
aesCbcDecrypt := AesCbcDecrypt(aesCbcEncrypt, []byte(key))
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestAesCbcCrypt")
|
||||||
|
assert.Equal(data, string(aesCbcDecrypt))
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestAesCtrCrypt(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
data := "hello world"
|
||||||
|
key := "abcdefghijklmnop"
|
||||||
|
|
||||||
|
aesCtrCrypt := AesCtrEncrypt([]byte(data), []byte(key))
|
||||||
|
aesCtrDeCrypt := AesCtrDecrypt(aesCtrCrypt, []byte(key))
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestAesCtrCrypt")
|
||||||
|
assert.Equal(data, string(aesCtrDeCrypt))
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestAesCfbCrypt(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
data := "hello world"
|
||||||
|
key := "abcdefghijklmnop"
|
||||||
|
|
||||||
|
aesCfbEncrypt := AesCfbEncrypt([]byte(data), []byte(key))
|
||||||
|
aesCfbDecrypt := AesCfbDecrypt(aesCfbEncrypt, []byte(key))
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestAesCfbCrypt")
|
||||||
|
assert.Equal(data, string(aesCfbDecrypt))
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestAesOfbCrypt(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
data := "hello world"
|
||||||
|
key := "abcdefghijklmnop"
|
||||||
|
|
||||||
|
aesOfbEncrypt := AesOfbEncrypt([]byte(data), []byte(key))
|
||||||
|
aesOfbDecrypt := AesOfbDecrypt(aesOfbEncrypt, []byte(key))
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestAesOfbEncrypt")
|
||||||
|
assert.Equal(data, string(aesOfbDecrypt))
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestDesEcbCrypt(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
data := "hello world"
|
||||||
|
key := "abcdefgh"
|
||||||
|
|
||||||
|
desEcbEncrypt := DesEcbEncrypt([]byte(data), []byte(key))
|
||||||
|
desEcbDecrypt := DesEcbDecrypt(desEcbEncrypt, []byte(key))
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestDesEcbEncrypt")
|
||||||
|
assert.Equal(data, string(desEcbDecrypt))
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestDesCbcCrypt(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
data := "hello world"
|
||||||
|
key := "abcdefgh"
|
||||||
|
|
||||||
|
desCbcEncrypt := DesCbcEncrypt([]byte(data), []byte(key))
|
||||||
|
desCbcDecrypt := DesCbcDecrypt(desCbcEncrypt, []byte(key))
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestDesCbcEncrypt")
|
||||||
|
assert.Equal(data, string(desCbcDecrypt))
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestDesCtrCrypt(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
data := "hello world"
|
||||||
|
key := "abcdefgh"
|
||||||
|
|
||||||
|
desCtrCrypt := DesCtrEncrypt([]byte(data), []byte(key))
|
||||||
|
desCtrDeCrypt := DesCtrDecrypt(desCtrCrypt, []byte(key))
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestDesCtrCrypt")
|
||||||
|
assert.Equal(data, string(desCtrDeCrypt))
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestDesCfbCrypt(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
data := "hello world"
|
||||||
|
key := "abcdefgh"
|
||||||
|
|
||||||
|
desCfbEncrypt := DesCfbEncrypt([]byte(data), []byte(key))
|
||||||
|
desCfbDecrypt := DesCfbDecrypt(desCfbEncrypt, []byte(key))
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestDesCfbEncrypt")
|
||||||
|
assert.Equal(data, string(desCfbDecrypt))
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestDesOfbCrypt(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
data := "hello world"
|
||||||
|
key := "abcdefgh"
|
||||||
|
|
||||||
|
desOfbEncrypt := DesOfbEncrypt([]byte(data), []byte(key))
|
||||||
|
desOfbDecrypt := DesOfbDecrypt(desOfbEncrypt, []byte(key))
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestDesOfbEncrypt")
|
||||||
|
assert.Equal(data, string(desOfbDecrypt))
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestRsaEncrypt(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
err := GenerateRsaKey(4096, "./rsa_private_example.pem", "./rsa_public_example.pem")
|
||||||
|
if err != nil {
|
||||||
|
t.FailNow()
|
||||||
|
}
|
||||||
|
data := []byte("hello world")
|
||||||
|
encrypted := RsaEncrypt(data, "./rsa_public_example.pem")
|
||||||
|
decrypted := RsaDecrypt(encrypted, "./rsa_private_example.pem")
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestRsaEncrypt")
|
||||||
|
assert.Equal(string(data), string(decrypted))
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestRsaEncryptOAEP(t *testing.T) {
|
||||||
|
assert := internal.NewAssert(t, "TestRsaEncrypt")
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
pri, pub := GenerateRsaKeyPair(1024)
|
||||||
|
|
||||||
|
data := []byte("hello world")
|
||||||
|
label := []byte("123456")
|
||||||
|
|
||||||
|
encrypted, err := RsaEncryptOAEP(data, label, *pub)
|
||||||
|
assert.IsNil(err)
|
||||||
|
|
||||||
|
decrypted, err := RsaDecryptOAEP([]byte(encrypted), label, *pri)
|
||||||
|
|
||||||
|
assert.IsNil(err)
|
||||||
|
assert.Equal("hello world", string(decrypted))
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestAesGcmEncrypt(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
data := "hello world"
|
||||||
|
key := "abcdefghijklmnop"
|
||||||
|
|
||||||
|
encrypted := AesGcmEncrypt([]byte(data), []byte(key))
|
||||||
|
decrypted := AesGcmDecrypt(encrypted, []byte(key))
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestAesGcmEncrypt")
|
||||||
|
assert.Equal(data, string(decrypted))
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestRsaSignAndVerify(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
data := []byte("This is a test data for RSA signing")
|
||||||
|
hash := crypto.SHA256
|
||||||
|
|
||||||
|
t.Run("RSA Sign and Verify", func(t *testing.T) {
|
||||||
|
privateKey := "./rsa_private_example.pem"
|
||||||
|
publicKey := "./rsa_public_example.pem"
|
||||||
|
|
||||||
|
signature, err := RsaSign(hash, data, privateKey)
|
||||||
|
if err != nil {
|
||||||
|
t.Fatalf("RsaSign failed: %v", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
err = RsaVerifySign(hash, data, signature, publicKey)
|
||||||
|
if err != nil {
|
||||||
|
t.Fatalf("RsaVerifySign failed: %v", err)
|
||||||
|
}
|
||||||
|
})
|
||||||
|
|
||||||
|
t.Run("RSA Sign and Verify Invalid Signature", func(t *testing.T) {
|
||||||
|
publicKey := "./rsa_public_example.pem"
|
||||||
|
|
||||||
|
invalidSig := []byte("InvalidSignature")
|
||||||
|
|
||||||
|
err := RsaVerifySign(hash, data, invalidSig, publicKey)
|
||||||
|
if err == nil {
|
||||||
|
t.Fatalf("RsaVerifySign failed: %v", err)
|
||||||
|
}
|
||||||
|
})
|
||||||
|
|
||||||
|
t.Run("RSA Sign and Verify With Different Hash", func(t *testing.T) {
|
||||||
|
publicKey := "./rsa_public_example.pem"
|
||||||
|
privateKey := "./rsa_private_example.pem"
|
||||||
|
hashSign := crypto.SHA256
|
||||||
|
hashVerify := crypto.SHA512
|
||||||
|
|
||||||
|
signature, err := RsaSign(hashSign, data, privateKey)
|
||||||
|
if err != nil {
|
||||||
|
t.Fatalf("RsaSign failed: %v", err)
|
||||||
|
}
|
||||||
|
|
||||||
|
err = RsaVerifySign(hashVerify, data, signature, publicKey)
|
||||||
|
if err == nil {
|
||||||
|
t.Fatalf("RsaVerifySign failed: %v", err)
|
||||||
|
}
|
||||||
|
})
|
||||||
|
}
|
||||||
@@ -1,507 +0,0 @@
|
|||||||
// Copyright 2021 dudaodong@gmail.com. All rights reserved.
|
|
||||||
// Use of this source code is governed by MIT license
|
|
||||||
|
|
||||||
// Package cryptor implements some util functions to encrypt and decrypt.
|
|
||||||
// Note:
|
|
||||||
// 1. for aes crypt function, the `key` param length should be 16, 24 or 32. if not, will panic.
|
|
||||||
package cryptor
|
|
||||||
|
|
||||||
import (
|
|
||||||
"bytes"
|
|
||||||
"crypto/aes"
|
|
||||||
"crypto/cipher"
|
|
||||||
"crypto/des"
|
|
||||||
"crypto/rand"
|
|
||||||
"crypto/rsa"
|
|
||||||
"crypto/x509"
|
|
||||||
"encoding/pem"
|
|
||||||
"io"
|
|
||||||
"os"
|
|
||||||
)
|
|
||||||
|
|
||||||
// AesEcbEncrypt encrypt data with key use AES ECB algorithm
|
|
||||||
// len(key) should be 16, 24 or 32.
|
|
||||||
// Play: https://go.dev/play/p/jT5irszHx-j
|
|
||||||
func AesEcbEncrypt(data, key []byte) []byte {
|
|
||||||
size := len(key)
|
|
||||||
if size != 16 && size != 24 && size != 32 {
|
|
||||||
panic("key length shoud be 16 or 24 or 32")
|
|
||||||
}
|
|
||||||
|
|
||||||
length := (len(data) + aes.BlockSize) / aes.BlockSize
|
|
||||||
plain := make([]byte, length*aes.BlockSize)
|
|
||||||
|
|
||||||
copy(plain, data)
|
|
||||||
|
|
||||||
pad := byte(len(plain) - len(data))
|
|
||||||
for i := len(data); i < len(plain); i++ {
|
|
||||||
plain[i] = pad
|
|
||||||
}
|
|
||||||
|
|
||||||
encrypted := make([]byte, len(plain))
|
|
||||||
cipher, _ := aes.NewCipher(generateAesKey(key, size))
|
|
||||||
|
|
||||||
for bs, be := 0, cipher.BlockSize(); bs <= len(data); bs, be = bs+cipher.BlockSize(), be+cipher.BlockSize() {
|
|
||||||
cipher.Encrypt(encrypted[bs:be], plain[bs:be])
|
|
||||||
}
|
|
||||||
|
|
||||||
return encrypted
|
|
||||||
}
|
|
||||||
|
|
||||||
// AesEcbDecrypt decrypt data with key use AES ECB algorithm
|
|
||||||
// len(key) should be 16, 24 or 32.
|
|
||||||
// Play: https://go.dev/play/p/jT5irszHx-j
|
|
||||||
func AesEcbDecrypt(encrypted, key []byte) []byte {
|
|
||||||
size := len(key)
|
|
||||||
if size != 16 && size != 24 && size != 32 {
|
|
||||||
panic("key length shoud be 16 or 24 or 32")
|
|
||||||
}
|
|
||||||
cipher, _ := aes.NewCipher(generateAesKey(key, size))
|
|
||||||
decrypted := make([]byte, len(encrypted))
|
|
||||||
|
|
||||||
for bs, be := 0, cipher.BlockSize(); bs < len(encrypted); bs, be = bs+cipher.BlockSize(), be+cipher.BlockSize() {
|
|
||||||
cipher.Decrypt(decrypted[bs:be], encrypted[bs:be])
|
|
||||||
}
|
|
||||||
|
|
||||||
trim := 0
|
|
||||||
if len(decrypted) > 0 {
|
|
||||||
trim = len(decrypted) - int(decrypted[len(decrypted)-1])
|
|
||||||
}
|
|
||||||
|
|
||||||
return decrypted[:trim]
|
|
||||||
}
|
|
||||||
|
|
||||||
// AesCbcEncrypt encrypt data with key use AES CBC algorithm
|
|
||||||
// len(key) should be 16, 24 or 32.
|
|
||||||
// Play: https://go.dev/play/p/IOq_g8_lKZD
|
|
||||||
func AesCbcEncrypt(data, key []byte) []byte {
|
|
||||||
block, _ := aes.NewCipher(key)
|
|
||||||
data = pkcs7Padding(data, block.BlockSize())
|
|
||||||
|
|
||||||
encrypted := make([]byte, aes.BlockSize+len(data))
|
|
||||||
iv := encrypted[:aes.BlockSize]
|
|
||||||
if _, err := io.ReadFull(rand.Reader, iv); err != nil {
|
|
||||||
panic(err)
|
|
||||||
}
|
|
||||||
|
|
||||||
mode := cipher.NewCBCEncrypter(block, iv)
|
|
||||||
mode.CryptBlocks(encrypted[aes.BlockSize:], data)
|
|
||||||
|
|
||||||
return encrypted
|
|
||||||
}
|
|
||||||
|
|
||||||
// AesCbcDecrypt decrypt data with key use AES CBC algorithm
|
|
||||||
// len(key) should be 16, 24 or 32.
|
|
||||||
// Play: https://go.dev/play/p/IOq_g8_lKZD
|
|
||||||
func AesCbcDecrypt(encrypted, key []byte) []byte {
|
|
||||||
block, _ := aes.NewCipher(key)
|
|
||||||
|
|
||||||
iv := encrypted[:aes.BlockSize]
|
|
||||||
encrypted = encrypted[aes.BlockSize:]
|
|
||||||
|
|
||||||
mode := cipher.NewCBCDecrypter(block, iv)
|
|
||||||
mode.CryptBlocks(encrypted, encrypted)
|
|
||||||
|
|
||||||
decrypted := pkcs7UnPadding(encrypted)
|
|
||||||
return decrypted
|
|
||||||
}
|
|
||||||
|
|
||||||
// AesCtrCrypt encrypt data with key use AES CTR algorithm
|
|
||||||
// len(key) should be 16, 24 or 32.
|
|
||||||
// Play: https://go.dev/play/p/SpaZO0-5Nsp
|
|
||||||
func AesCtrCrypt(data, key []byte) []byte {
|
|
||||||
block, _ := aes.NewCipher(key)
|
|
||||||
|
|
||||||
iv := bytes.Repeat([]byte("1"), block.BlockSize())
|
|
||||||
stream := cipher.NewCTR(block, iv)
|
|
||||||
|
|
||||||
dst := make([]byte, len(data))
|
|
||||||
stream.XORKeyStream(dst, data)
|
|
||||||
|
|
||||||
return dst
|
|
||||||
}
|
|
||||||
|
|
||||||
// AesCfbEncrypt encrypt data with key use AES CFB algorithm
|
|
||||||
// len(key) should be 16, 24 or 32.
|
|
||||||
// Play: https://go.dev/play/p/tfkF10B13kH
|
|
||||||
func AesCfbEncrypt(data, key []byte) []byte {
|
|
||||||
block, err := aes.NewCipher(key)
|
|
||||||
if err != nil {
|
|
||||||
panic(err)
|
|
||||||
}
|
|
||||||
|
|
||||||
encrypted := make([]byte, aes.BlockSize+len(data))
|
|
||||||
iv := encrypted[:aes.BlockSize]
|
|
||||||
|
|
||||||
if _, err := io.ReadFull(rand.Reader, iv); err != nil {
|
|
||||||
panic(err)
|
|
||||||
}
|
|
||||||
|
|
||||||
stream := cipher.NewCFBEncrypter(block, iv)
|
|
||||||
stream.XORKeyStream(encrypted[aes.BlockSize:], data)
|
|
||||||
|
|
||||||
return encrypted
|
|
||||||
}
|
|
||||||
|
|
||||||
// AesCfbDecrypt decrypt data with key use AES CFB algorithm
|
|
||||||
// len(encrypted) should be great than 16, len(key) should be 16, 24 or 32.
|
|
||||||
// Play: https://go.dev/play/p/tfkF10B13kH
|
|
||||||
func AesCfbDecrypt(encrypted, key []byte) []byte {
|
|
||||||
if len(encrypted) < aes.BlockSize {
|
|
||||||
panic("encrypted data is too short")
|
|
||||||
}
|
|
||||||
|
|
||||||
block, _ := aes.NewCipher(key)
|
|
||||||
iv := encrypted[:aes.BlockSize]
|
|
||||||
encrypted = encrypted[aes.BlockSize:]
|
|
||||||
|
|
||||||
stream := cipher.NewCFBDecrypter(block, iv)
|
|
||||||
|
|
||||||
stream.XORKeyStream(encrypted, encrypted)
|
|
||||||
|
|
||||||
return encrypted
|
|
||||||
}
|
|
||||||
|
|
||||||
// AesOfbEncrypt encrypt data with key use AES OFB algorithm
|
|
||||||
// len(key) should be 16, 24 or 32.
|
|
||||||
// Play: https://go.dev/play/p/VtHxtkUj-3F
|
|
||||||
func AesOfbEncrypt(data, key []byte) []byte {
|
|
||||||
block, err := aes.NewCipher(key)
|
|
||||||
if err != nil {
|
|
||||||
panic(err)
|
|
||||||
}
|
|
||||||
|
|
||||||
data = pkcs7Padding(data, aes.BlockSize)
|
|
||||||
encrypted := make([]byte, aes.BlockSize+len(data))
|
|
||||||
iv := encrypted[:aes.BlockSize]
|
|
||||||
if _, err := io.ReadFull(rand.Reader, iv); err != nil {
|
|
||||||
panic(err)
|
|
||||||
}
|
|
||||||
|
|
||||||
stream := cipher.NewOFB(block, iv)
|
|
||||||
stream.XORKeyStream(encrypted[aes.BlockSize:], data)
|
|
||||||
|
|
||||||
return encrypted
|
|
||||||
}
|
|
||||||
|
|
||||||
// AesOfbDecrypt decrypt data with key use AES OFB algorithm
|
|
||||||
// len(key) should be 16, 24 or 32.
|
|
||||||
// Play: https://go.dev/play/p/VtHxtkUj-3F
|
|
||||||
func AesOfbDecrypt(data, key []byte) []byte {
|
|
||||||
block, err := aes.NewCipher(key)
|
|
||||||
if err != nil {
|
|
||||||
panic(err)
|
|
||||||
}
|
|
||||||
|
|
||||||
iv := data[:aes.BlockSize]
|
|
||||||
data = data[aes.BlockSize:]
|
|
||||||
if len(data)%aes.BlockSize != 0 {
|
|
||||||
return nil
|
|
||||||
}
|
|
||||||
|
|
||||||
decrypted := make([]byte, len(data))
|
|
||||||
mode := cipher.NewOFB(block, iv)
|
|
||||||
mode.XORKeyStream(decrypted, data)
|
|
||||||
|
|
||||||
decrypted = pkcs7UnPadding(decrypted)
|
|
||||||
|
|
||||||
return decrypted
|
|
||||||
}
|
|
||||||
|
|
||||||
// DesEcbEncrypt encrypt data with key use DES ECB algorithm
|
|
||||||
// len(key) should be 8.
|
|
||||||
// Play: https://go.dev/play/p/8qivmPeZy4P
|
|
||||||
func DesEcbEncrypt(data, key []byte) []byte {
|
|
||||||
length := (len(data) + des.BlockSize) / des.BlockSize
|
|
||||||
plain := make([]byte, length*des.BlockSize)
|
|
||||||
copy(plain, data)
|
|
||||||
|
|
||||||
pad := byte(len(plain) - len(data))
|
|
||||||
for i := len(data); i < len(plain); i++ {
|
|
||||||
plain[i] = pad
|
|
||||||
}
|
|
||||||
|
|
||||||
encrypted := make([]byte, len(plain))
|
|
||||||
cipher, _ := des.NewCipher(generateDesKey(key))
|
|
||||||
|
|
||||||
for bs, be := 0, cipher.BlockSize(); bs <= len(data); bs, be = bs+cipher.BlockSize(), be+cipher.BlockSize() {
|
|
||||||
cipher.Encrypt(encrypted[bs:be], plain[bs:be])
|
|
||||||
}
|
|
||||||
|
|
||||||
return encrypted
|
|
||||||
}
|
|
||||||
|
|
||||||
// DesEcbDecrypt decrypt data with key use DES ECB algorithm
|
|
||||||
// len(key) should be 8.
|
|
||||||
// Play: https://go.dev/play/p/8qivmPeZy4P
|
|
||||||
func DesEcbDecrypt(encrypted, key []byte) []byte {
|
|
||||||
cipher, _ := des.NewCipher(generateDesKey(key))
|
|
||||||
decrypted := make([]byte, len(encrypted))
|
|
||||||
|
|
||||||
for bs, be := 0, cipher.BlockSize(); bs < len(encrypted); bs, be = bs+cipher.BlockSize(), be+cipher.BlockSize() {
|
|
||||||
cipher.Decrypt(decrypted[bs:be], encrypted[bs:be])
|
|
||||||
}
|
|
||||||
|
|
||||||
trim := 0
|
|
||||||
if len(decrypted) > 0 {
|
|
||||||
trim = len(decrypted) - int(decrypted[len(decrypted)-1])
|
|
||||||
}
|
|
||||||
|
|
||||||
return decrypted[:trim]
|
|
||||||
}
|
|
||||||
|
|
||||||
// DesCbcEncrypt encrypt data with key use DES CBC algorithm
|
|
||||||
// len(key) should be 8.
|
|
||||||
// Play: https://go.dev/play/p/4cC4QvWfe3_1
|
|
||||||
func DesCbcEncrypt(data, key []byte) []byte {
|
|
||||||
block, _ := des.NewCipher(key)
|
|
||||||
data = pkcs7Padding(data, block.BlockSize())
|
|
||||||
|
|
||||||
encrypted := make([]byte, des.BlockSize+len(data))
|
|
||||||
iv := encrypted[:des.BlockSize]
|
|
||||||
|
|
||||||
if _, err := io.ReadFull(rand.Reader, iv); err != nil {
|
|
||||||
panic(err)
|
|
||||||
}
|
|
||||||
|
|
||||||
mode := cipher.NewCBCEncrypter(block, iv)
|
|
||||||
mode.CryptBlocks(encrypted[des.BlockSize:], data)
|
|
||||||
|
|
||||||
return encrypted
|
|
||||||
}
|
|
||||||
|
|
||||||
// DesCbcDecrypt decrypt data with key use DES CBC algorithm
|
|
||||||
// len(key) should be 8.
|
|
||||||
// Play: https://go.dev/play/p/4cC4QvWfe3_1
|
|
||||||
func DesCbcDecrypt(encrypted, key []byte) []byte {
|
|
||||||
block, _ := des.NewCipher(key)
|
|
||||||
|
|
||||||
iv := encrypted[:des.BlockSize]
|
|
||||||
encrypted = encrypted[des.BlockSize:]
|
|
||||||
|
|
||||||
mode := cipher.NewCBCDecrypter(block, iv)
|
|
||||||
mode.CryptBlocks(encrypted, encrypted)
|
|
||||||
|
|
||||||
decrypted := pkcs7UnPadding(encrypted)
|
|
||||||
return decrypted
|
|
||||||
}
|
|
||||||
|
|
||||||
// DesCtrCrypt encrypt data with key use DES CTR algorithm
|
|
||||||
// len(key) should be 8.
|
|
||||||
// Play: https://go.dev/play/p/9-T6OjKpcdw
|
|
||||||
func DesCtrCrypt(data, key []byte) []byte {
|
|
||||||
block, _ := des.NewCipher(key)
|
|
||||||
|
|
||||||
iv := bytes.Repeat([]byte("1"), block.BlockSize())
|
|
||||||
stream := cipher.NewCTR(block, iv)
|
|
||||||
|
|
||||||
dst := make([]byte, len(data))
|
|
||||||
stream.XORKeyStream(dst, data)
|
|
||||||
|
|
||||||
return dst
|
|
||||||
}
|
|
||||||
|
|
||||||
// DesCfbEncrypt encrypt data with key use DES CFB algorithm
|
|
||||||
// len(key) should be 8.
|
|
||||||
// Play: https://go.dev/play/p/y-eNxcFBlxL
|
|
||||||
func DesCfbEncrypt(data, key []byte) []byte {
|
|
||||||
block, err := des.NewCipher(key)
|
|
||||||
if err != nil {
|
|
||||||
panic(err)
|
|
||||||
}
|
|
||||||
|
|
||||||
encrypted := make([]byte, des.BlockSize+len(data))
|
|
||||||
iv := encrypted[:des.BlockSize]
|
|
||||||
if _, err := io.ReadFull(rand.Reader, iv); err != nil {
|
|
||||||
panic(err)
|
|
||||||
}
|
|
||||||
|
|
||||||
stream := cipher.NewCFBEncrypter(block, iv)
|
|
||||||
stream.XORKeyStream(encrypted[des.BlockSize:], data)
|
|
||||||
|
|
||||||
return encrypted
|
|
||||||
}
|
|
||||||
|
|
||||||
// DesCfbDecrypt decrypt data with key use DES CFB algorithm
|
|
||||||
// len(encrypted) should be great than 16, len(key) should be 8.
|
|
||||||
// Play: https://go.dev/play/p/y-eNxcFBlxL
|
|
||||||
func DesCfbDecrypt(encrypted, key []byte) []byte {
|
|
||||||
block, _ := des.NewCipher(key)
|
|
||||||
if len(encrypted) < des.BlockSize {
|
|
||||||
panic("encrypted data is too short")
|
|
||||||
}
|
|
||||||
iv := encrypted[:des.BlockSize]
|
|
||||||
encrypted = encrypted[des.BlockSize:]
|
|
||||||
|
|
||||||
stream := cipher.NewCFBDecrypter(block, iv)
|
|
||||||
stream.XORKeyStream(encrypted, encrypted)
|
|
||||||
|
|
||||||
return encrypted
|
|
||||||
}
|
|
||||||
|
|
||||||
// DesOfbEncrypt encrypt data with key use DES OFB algorithm
|
|
||||||
// len(key) should be 16, 24 or 32.
|
|
||||||
// Play: https://go.dev/play/p/74KmNadjN1J
|
|
||||||
func DesOfbEncrypt(data, key []byte) []byte {
|
|
||||||
block, err := des.NewCipher(key)
|
|
||||||
if err != nil {
|
|
||||||
panic(err)
|
|
||||||
}
|
|
||||||
data = pkcs7Padding(data, des.BlockSize)
|
|
||||||
encrypted := make([]byte, des.BlockSize+len(data))
|
|
||||||
iv := encrypted[:des.BlockSize]
|
|
||||||
if _, err := io.ReadFull(rand.Reader, iv); err != nil {
|
|
||||||
panic(err)
|
|
||||||
}
|
|
||||||
|
|
||||||
stream := cipher.NewOFB(block, iv)
|
|
||||||
stream.XORKeyStream(encrypted[des.BlockSize:], data)
|
|
||||||
|
|
||||||
return encrypted
|
|
||||||
}
|
|
||||||
|
|
||||||
// DesOfbDecrypt decrypt data with key use DES OFB algorithm
|
|
||||||
// len(key) should be 8.
|
|
||||||
// Play: https://go.dev/play/p/74KmNadjN1J
|
|
||||||
func DesOfbDecrypt(data, key []byte) []byte {
|
|
||||||
block, err := des.NewCipher(key)
|
|
||||||
if err != nil {
|
|
||||||
panic(err)
|
|
||||||
}
|
|
||||||
|
|
||||||
iv := data[:des.BlockSize]
|
|
||||||
data = data[des.BlockSize:]
|
|
||||||
if len(data)%des.BlockSize != 0 {
|
|
||||||
return nil
|
|
||||||
}
|
|
||||||
|
|
||||||
decrypted := make([]byte, len(data))
|
|
||||||
mode := cipher.NewOFB(block, iv)
|
|
||||||
mode.XORKeyStream(decrypted, data)
|
|
||||||
|
|
||||||
decrypted = pkcs7UnPadding(decrypted)
|
|
||||||
|
|
||||||
return decrypted
|
|
||||||
}
|
|
||||||
|
|
||||||
// GenerateRsaKey create rsa private and public pemo file.
|
|
||||||
// Play: https://go.dev/play/p/zutRHrDqs0X
|
|
||||||
func GenerateRsaKey(keySize int, priKeyFile, pubKeyFile string) error {
|
|
||||||
// private key
|
|
||||||
privateKey, err := rsa.GenerateKey(rand.Reader, keySize)
|
|
||||||
if err != nil {
|
|
||||||
return err
|
|
||||||
}
|
|
||||||
|
|
||||||
derText := x509.MarshalPKCS1PrivateKey(privateKey)
|
|
||||||
|
|
||||||
block := pem.Block{
|
|
||||||
Type: "rsa private key",
|
|
||||||
Bytes: derText,
|
|
||||||
}
|
|
||||||
|
|
||||||
file, err := os.Create(priKeyFile)
|
|
||||||
if err != nil {
|
|
||||||
panic(err)
|
|
||||||
}
|
|
||||||
err = pem.Encode(file, &block)
|
|
||||||
if err != nil {
|
|
||||||
return err
|
|
||||||
}
|
|
||||||
|
|
||||||
file.Close()
|
|
||||||
|
|
||||||
// public key
|
|
||||||
publicKey := privateKey.PublicKey
|
|
||||||
|
|
||||||
derpText, err := x509.MarshalPKIXPublicKey(&publicKey)
|
|
||||||
if err != nil {
|
|
||||||
return err
|
|
||||||
}
|
|
||||||
|
|
||||||
block = pem.Block{
|
|
||||||
Type: "rsa public key",
|
|
||||||
Bytes: derpText,
|
|
||||||
}
|
|
||||||
|
|
||||||
file, err = os.Create(pubKeyFile)
|
|
||||||
if err != nil {
|
|
||||||
return err
|
|
||||||
}
|
|
||||||
|
|
||||||
err = pem.Encode(file, &block)
|
|
||||||
if err != nil {
|
|
||||||
return err
|
|
||||||
}
|
|
||||||
|
|
||||||
file.Close()
|
|
||||||
|
|
||||||
return nil
|
|
||||||
}
|
|
||||||
|
|
||||||
// RsaEncrypt encrypt data with ras algorithm.
|
|
||||||
// Play: https://go.dev/play/p/rDqTT01SPkZ
|
|
||||||
func RsaEncrypt(data []byte, pubKeyFileName string) []byte {
|
|
||||||
file, err := os.Open(pubKeyFileName)
|
|
||||||
if err != nil {
|
|
||||||
panic(err)
|
|
||||||
}
|
|
||||||
fileInfo, err := file.Stat()
|
|
||||||
if err != nil {
|
|
||||||
panic(err)
|
|
||||||
}
|
|
||||||
defer file.Close()
|
|
||||||
buf := make([]byte, fileInfo.Size())
|
|
||||||
|
|
||||||
_, err = file.Read(buf)
|
|
||||||
if err != nil {
|
|
||||||
panic(err)
|
|
||||||
}
|
|
||||||
|
|
||||||
block, _ := pem.Decode(buf)
|
|
||||||
|
|
||||||
pubInterface, err := x509.ParsePKIXPublicKey(block.Bytes)
|
|
||||||
if err != nil {
|
|
||||||
panic(err)
|
|
||||||
}
|
|
||||||
pubKey := pubInterface.(*rsa.PublicKey)
|
|
||||||
|
|
||||||
cipherText, err := rsa.EncryptPKCS1v15(rand.Reader, pubKey, data)
|
|
||||||
if err != nil {
|
|
||||||
panic(err)
|
|
||||||
}
|
|
||||||
return cipherText
|
|
||||||
}
|
|
||||||
|
|
||||||
// RsaDecrypt decrypt data with ras algorithm.
|
|
||||||
// Play: https://go.dev/play/p/rDqTT01SPkZ
|
|
||||||
func RsaDecrypt(data []byte, privateKeyFileName string) []byte {
|
|
||||||
file, err := os.Open(privateKeyFileName)
|
|
||||||
if err != nil {
|
|
||||||
panic(err)
|
|
||||||
}
|
|
||||||
fileInfo, err := file.Stat()
|
|
||||||
if err != nil {
|
|
||||||
panic(err)
|
|
||||||
}
|
|
||||||
buf := make([]byte, fileInfo.Size())
|
|
||||||
defer file.Close()
|
|
||||||
|
|
||||||
_, err = file.Read(buf)
|
|
||||||
if err != nil {
|
|
||||||
panic(err)
|
|
||||||
}
|
|
||||||
|
|
||||||
block, _ := pem.Decode(buf)
|
|
||||||
|
|
||||||
priKey, err := x509.ParsePKCS1PrivateKey(block.Bytes)
|
|
||||||
if err != nil {
|
|
||||||
panic(err)
|
|
||||||
}
|
|
||||||
|
|
||||||
plainText, err := rsa.DecryptPKCS1v15(rand.Reader, priKey, data)
|
|
||||||
if err != nil {
|
|
||||||
panic(err)
|
|
||||||
}
|
|
||||||
return plainText
|
|
||||||
}
|
|
||||||
@@ -1,130 +0,0 @@
|
|||||||
package cryptor
|
|
||||||
|
|
||||||
import (
|
|
||||||
"testing"
|
|
||||||
|
|
||||||
"github.com/duke-git/lancet/v2/internal"
|
|
||||||
)
|
|
||||||
|
|
||||||
func TestAesEcbEncrypt(t *testing.T) {
|
|
||||||
data := "hello world"
|
|
||||||
key := "abcdefghijklmnop"
|
|
||||||
|
|
||||||
aesEcbEncrypt := AesEcbEncrypt([]byte(data), []byte(key))
|
|
||||||
aesEcbDecrypt := AesEcbDecrypt(aesEcbEncrypt, []byte(key))
|
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestAesEcbEncrypt")
|
|
||||||
assert.Equal(data, string(aesEcbDecrypt))
|
|
||||||
}
|
|
||||||
|
|
||||||
func TestAesCbcEncrypt(t *testing.T) {
|
|
||||||
data := "hello world"
|
|
||||||
key := "abcdefghijklmnop"
|
|
||||||
|
|
||||||
aesCbcEncrypt := AesCbcEncrypt([]byte(data), []byte(key))
|
|
||||||
aesCbcDecrypt := AesCbcDecrypt(aesCbcEncrypt, []byte(key))
|
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestAesCbcEncrypt")
|
|
||||||
assert.Equal(data, string(aesCbcDecrypt))
|
|
||||||
}
|
|
||||||
|
|
||||||
func TestAesCtrCrypt(t *testing.T) {
|
|
||||||
data := "hello world"
|
|
||||||
key := "abcdefghijklmnop"
|
|
||||||
|
|
||||||
aesCtrCrypt := AesCtrCrypt([]byte(data), []byte(key))
|
|
||||||
aesCtrDeCrypt := AesCtrCrypt(aesCtrCrypt, []byte(key))
|
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestAesCtrCrypt")
|
|
||||||
assert.Equal(data, string(aesCtrDeCrypt))
|
|
||||||
}
|
|
||||||
|
|
||||||
func TestAesCfbEncrypt(t *testing.T) {
|
|
||||||
data := "hello world"
|
|
||||||
key := "abcdefghijklmnop"
|
|
||||||
|
|
||||||
aesCfbEncrypt := AesCfbEncrypt([]byte(data), []byte(key))
|
|
||||||
aesCfbDecrypt := AesCfbDecrypt(aesCfbEncrypt, []byte(key))
|
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestAesCfbEncrypt")
|
|
||||||
assert.Equal(data, string(aesCfbDecrypt))
|
|
||||||
}
|
|
||||||
|
|
||||||
func TestAesOfbEncrypt(t *testing.T) {
|
|
||||||
data := "hello world"
|
|
||||||
key := "abcdefghijklmnop"
|
|
||||||
|
|
||||||
aesOfbEncrypt := AesOfbEncrypt([]byte(data), []byte(key))
|
|
||||||
aesOfbDecrypt := AesOfbDecrypt(aesOfbEncrypt, []byte(key))
|
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestAesOfbEncrypt")
|
|
||||||
assert.Equal(data, string(aesOfbDecrypt))
|
|
||||||
}
|
|
||||||
|
|
||||||
func TestDesEcbEncrypt(t *testing.T) {
|
|
||||||
data := "hello world"
|
|
||||||
key := "abcdefgh"
|
|
||||||
|
|
||||||
desEcbEncrypt := DesEcbEncrypt([]byte(data), []byte(key))
|
|
||||||
desEcbDecrypt := DesEcbDecrypt(desEcbEncrypt, []byte(key))
|
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestDesEcbEncrypt")
|
|
||||||
assert.Equal(data, string(desEcbDecrypt))
|
|
||||||
}
|
|
||||||
|
|
||||||
func TestDesCbcEncrypt(t *testing.T) {
|
|
||||||
data := "hello world"
|
|
||||||
key := "abcdefgh"
|
|
||||||
|
|
||||||
desCbcEncrypt := DesCbcEncrypt([]byte(data), []byte(key))
|
|
||||||
desCbcDecrypt := DesCbcDecrypt(desCbcEncrypt, []byte(key))
|
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestDesCbcEncrypt")
|
|
||||||
assert.Equal(data, string(desCbcDecrypt))
|
|
||||||
}
|
|
||||||
|
|
||||||
func TestDesCtrCrypt(t *testing.T) {
|
|
||||||
data := "hello world"
|
|
||||||
key := "abcdefgh"
|
|
||||||
|
|
||||||
desCtrCrypt := DesCtrCrypt([]byte(data), []byte(key))
|
|
||||||
desCtrDeCrypt := DesCtrCrypt(desCtrCrypt, []byte(key))
|
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestDesCtrCrypt")
|
|
||||||
assert.Equal(data, string(desCtrDeCrypt))
|
|
||||||
}
|
|
||||||
|
|
||||||
func TestDesCfbEncrypt(t *testing.T) {
|
|
||||||
data := "hello world"
|
|
||||||
key := "abcdefgh"
|
|
||||||
|
|
||||||
desCfbEncrypt := DesCfbEncrypt([]byte(data), []byte(key))
|
|
||||||
desCfbDecrypt := DesCfbDecrypt(desCfbEncrypt, []byte(key))
|
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestDesCfbEncrypt")
|
|
||||||
assert.Equal(data, string(desCfbDecrypt))
|
|
||||||
}
|
|
||||||
|
|
||||||
func TestDesOfbEncrypt(t *testing.T) {
|
|
||||||
data := "hello world"
|
|
||||||
key := "abcdefgh"
|
|
||||||
|
|
||||||
desOfbEncrypt := DesOfbEncrypt([]byte(data), []byte(key))
|
|
||||||
desOfbDecrypt := DesOfbDecrypt(desOfbEncrypt, []byte(key))
|
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestDesOfbEncrypt")
|
|
||||||
assert.Equal(data, string(desOfbDecrypt))
|
|
||||||
}
|
|
||||||
|
|
||||||
func TestRsaEncrypt(t *testing.T) {
|
|
||||||
err := GenerateRsaKey(4096, "rsa_private.pem", "rsa_public.pem")
|
|
||||||
if err != nil {
|
|
||||||
t.FailNow()
|
|
||||||
}
|
|
||||||
data := []byte("hello world")
|
|
||||||
encrypted := RsaEncrypt(data, "rsa_public.pem")
|
|
||||||
decrypted := RsaDecrypt(encrypted, "rsa_private.pem")
|
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestRsaEncrypt")
|
|
||||||
assert.Equal(string(data), string(decrypted))
|
|
||||||
}
|
|
||||||
@@ -0,0 +1,71 @@
|
|||||||
|
package cryptor_test
|
||||||
|
|
||||||
|
import (
|
||||||
|
"encoding/hex"
|
||||||
|
"fmt"
|
||||||
|
|
||||||
|
"github.com/duke-git/lancet/v2/cryptor"
|
||||||
|
)
|
||||||
|
|
||||||
|
func ExampleSm3() {
|
||||||
|
data := []byte("hello world")
|
||||||
|
hash := cryptor.Sm3(data)
|
||||||
|
|
||||||
|
fmt.Println(hex.EncodeToString(hash))
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// 44f0061e69fa6fdfc290c494654a05dc0c053da7e5c52b84ef93a9d67d3fff88
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleSm4EcbEncrypt() {
|
||||||
|
key := []byte("1234567890abcdef") // 16 bytes key
|
||||||
|
plaintext := []byte("hello world")
|
||||||
|
|
||||||
|
encrypted := cryptor.Sm4EcbEncrypt(plaintext, key)
|
||||||
|
decrypted := cryptor.Sm4EcbDecrypt(encrypted, key)
|
||||||
|
|
||||||
|
fmt.Println(string(decrypted))
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// hello world
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleSm4CbcEncrypt() {
|
||||||
|
key := []byte("1234567890abcdef") // 16 bytes key
|
||||||
|
plaintext := []byte("hello world")
|
||||||
|
|
||||||
|
encrypted := cryptor.Sm4CbcEncrypt(plaintext, key)
|
||||||
|
decrypted := cryptor.Sm4CbcDecrypt(encrypted, key)
|
||||||
|
|
||||||
|
fmt.Println(string(decrypted))
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// hello world
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleGenerateSm2Key() {
|
||||||
|
// Generate SM2 key pair
|
||||||
|
privateKey, err := cryptor.GenerateSm2Key()
|
||||||
|
if err != nil {
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
plaintext := []byte("hello world")
|
||||||
|
|
||||||
|
// Encrypt with public key
|
||||||
|
ciphertext, err := cryptor.Sm2Encrypt(&privateKey.PublicKey, plaintext)
|
||||||
|
if err != nil {
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
// Decrypt with private key
|
||||||
|
decrypted, err := cryptor.Sm2Decrypt(privateKey, ciphertext)
|
||||||
|
if err != nil {
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
fmt.Println(string(decrypted))
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// hello world
|
||||||
|
}
|
||||||
@@ -0,0 +1,251 @@
|
|||||||
|
package cryptor
|
||||||
|
|
||||||
|
import (
|
||||||
|
"crypto/elliptic"
|
||||||
|
"crypto/rand"
|
||||||
|
"encoding/binary"
|
||||||
|
"errors"
|
||||||
|
"io"
|
||||||
|
"math/big"
|
||||||
|
)
|
||||||
|
|
||||||
|
// SM2 implements the Chinese SM2 elliptic curve public key algorithm.
|
||||||
|
// SM2 is based on elliptic curve cryptography and provides encryption, decryption, signing and verification.
|
||||||
|
//
|
||||||
|
// Note: This implementation uses crypto/elliptic package methods (GenerateKey, ScalarBaseMult, ScalarMult, IsOnCurve)
|
||||||
|
// which are marked as deprecated in Go 1.20+. These methods still work correctly and are widely used.
|
||||||
|
// The //nolint:staticcheck directive suppresses deprecation warnings.
|
||||||
|
// A future version may replace these with a custom elliptic curve implementation.
|
||||||
|
|
||||||
|
var (
|
||||||
|
sm2P256 *sm2Curve
|
||||||
|
sm2P256Params = &elliptic.CurveParams{Name: "sm2p256v1"}
|
||||||
|
)
|
||||||
|
|
||||||
|
func init() {
|
||||||
|
// SM2 curve parameters
|
||||||
|
sm2P256Params.P, _ = new(big.Int).SetString("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFF", 16)
|
||||||
|
sm2P256Params.N, _ = new(big.Int).SetString("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFF7203DF6B21C6052B53BBF40939D54123", 16)
|
||||||
|
sm2P256Params.B, _ = new(big.Int).SetString("28E9FA9E9D9F5E344D5A9E4BCF6509A7F39789F515AB8F92DDBCBD414D940E93", 16)
|
||||||
|
sm2P256Params.Gx, _ = new(big.Int).SetString("32C4AE2C1F1981195F9904466A39C9948FE30BBFF2660BE1715A4589334C74C7", 16)
|
||||||
|
sm2P256Params.Gy, _ = new(big.Int).SetString("BC3736A2F4F6779C59BDCEE36B692153D0A9877CC62A474002DF32E52139F0A0", 16)
|
||||||
|
sm2P256Params.BitSize = 256
|
||||||
|
|
||||||
|
sm2P256 = &sm2Curve{sm2P256Params}
|
||||||
|
}
|
||||||
|
|
||||||
|
type sm2Curve struct {
|
||||||
|
*elliptic.CurveParams
|
||||||
|
}
|
||||||
|
|
||||||
|
// Sm2PrivateKey represents an SM2 private key.
|
||||||
|
type Sm2PrivateKey struct {
|
||||||
|
D *big.Int
|
||||||
|
PublicKey Sm2PublicKey
|
||||||
|
}
|
||||||
|
|
||||||
|
// Sm2PublicKey represents an SM2 public key.
|
||||||
|
type Sm2PublicKey struct {
|
||||||
|
X, Y *big.Int
|
||||||
|
}
|
||||||
|
|
||||||
|
// GenerateSm2Key generates a new SM2 private/public key pair.
|
||||||
|
// Play: https://go.dev/play/p/bKYMqRLvIx3
|
||||||
|
func GenerateSm2Key() (*Sm2PrivateKey, error) {
|
||||||
|
priv, x, y, err := elliptic.GenerateKey(sm2P256, rand.Reader)
|
||||||
|
if err != nil {
|
||||||
|
return nil, err
|
||||||
|
}
|
||||||
|
|
||||||
|
privateKey := &Sm2PrivateKey{
|
||||||
|
D: new(big.Int).SetBytes(priv),
|
||||||
|
PublicKey: Sm2PublicKey{
|
||||||
|
X: x,
|
||||||
|
Y: y,
|
||||||
|
},
|
||||||
|
}
|
||||||
|
|
||||||
|
return privateKey, nil
|
||||||
|
}
|
||||||
|
|
||||||
|
// Sm2Encrypt encrypts plaintext using SM2 public key.
|
||||||
|
// Returns ciphertext in the format: C1 || C3 || C2
|
||||||
|
// C1 = kG (65 bytes in uncompressed format)
|
||||||
|
// C3 = Hash(x2 || M || y2) (32 bytes for SM3)
|
||||||
|
// C2 = M xor t (same length as plaintext)
|
||||||
|
// Play: https://go.dev/play/p/bKYMqRLvIx3
|
||||||
|
func Sm2Encrypt(pub *Sm2PublicKey, plaintext []byte) ([]byte, error) {
|
||||||
|
if pub == nil || pub.X == nil || pub.Y == nil {
|
||||||
|
return nil, errors.New("sm2: invalid public key")
|
||||||
|
}
|
||||||
|
|
||||||
|
for {
|
||||||
|
// Generate random k
|
||||||
|
k, err := randFieldElement(sm2P256, rand.Reader)
|
||||||
|
if err != nil {
|
||||||
|
return nil, err
|
||||||
|
}
|
||||||
|
|
||||||
|
// C1 = kG
|
||||||
|
c1x, c1y := sm2P256.ScalarBaseMult(k.Bytes())
|
||||||
|
|
||||||
|
// kP = (x2, y2)
|
||||||
|
x2, y2 := sm2P256.ScalarMult(pub.X, pub.Y, k.Bytes())
|
||||||
|
|
||||||
|
// Derive key using KDF
|
||||||
|
kdfLen := len(plaintext)
|
||||||
|
t := sm2KDF(append(toBytes(sm2P256, x2), toBytes(sm2P256, y2)...), kdfLen)
|
||||||
|
|
||||||
|
// Check if t is all zeros
|
||||||
|
allZero := true
|
||||||
|
for _, b := range t {
|
||||||
|
if b != 0 {
|
||||||
|
allZero = false
|
||||||
|
break
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if allZero {
|
||||||
|
continue
|
||||||
|
}
|
||||||
|
|
||||||
|
// C2 = M xor t
|
||||||
|
c2 := make([]byte, len(plaintext))
|
||||||
|
for i := 0; i < len(plaintext); i++ {
|
||||||
|
c2[i] = plaintext[i] ^ t[i]
|
||||||
|
}
|
||||||
|
|
||||||
|
// C3 = Hash(x2 || M || y2)
|
||||||
|
c3Input := append(toBytes(sm2P256, x2), plaintext...)
|
||||||
|
c3Input = append(c3Input, toBytes(sm2P256, y2)...)
|
||||||
|
c3 := Sm3(c3Input)
|
||||||
|
|
||||||
|
// Return C1 || C3 || C2
|
||||||
|
c1 := sm2MarshalUncompressed(sm2P256, c1x, c1y)
|
||||||
|
result := append(c1, c3...)
|
||||||
|
result = append(result, c2...)
|
||||||
|
|
||||||
|
return result, nil
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Sm2Decrypt decrypts ciphertext using SM2 private key.
|
||||||
|
// Expects ciphertext in the format: C1 || C3 || C2
|
||||||
|
// Play: https://go.dev/play/p/bKYMqRLvIx3
|
||||||
|
func Sm2Decrypt(priv *Sm2PrivateKey, ciphertext []byte) ([]byte, error) {
|
||||||
|
if priv == nil || priv.D == nil {
|
||||||
|
return nil, errors.New("sm2: invalid private key")
|
||||||
|
}
|
||||||
|
|
||||||
|
// Parse C1 (65 bytes), C3 (32 bytes), C2 (remaining)
|
||||||
|
if len(ciphertext) < 97 {
|
||||||
|
return nil, errors.New("sm2: ciphertext too short")
|
||||||
|
}
|
||||||
|
|
||||||
|
c1 := ciphertext[:65]
|
||||||
|
c3 := ciphertext[65:97]
|
||||||
|
c2 := ciphertext[97:]
|
||||||
|
|
||||||
|
// Parse C1
|
||||||
|
c1x, c1y := sm2UnmarshalUncompressed(sm2P256, c1)
|
||||||
|
if c1x == nil {
|
||||||
|
return nil, errors.New("sm2: invalid C1 point")
|
||||||
|
}
|
||||||
|
|
||||||
|
// Verify C1 is on curve
|
||||||
|
if !sm2P256.IsOnCurve(c1x, c1y) {
|
||||||
|
return nil, errors.New("sm2: C1 not on curve")
|
||||||
|
}
|
||||||
|
|
||||||
|
// dC1 = (x2, y2)
|
||||||
|
x2, y2 := sm2P256.ScalarMult(c1x, c1y, priv.D.Bytes())
|
||||||
|
|
||||||
|
// Derive key using KDF
|
||||||
|
kdfLen := len(c2)
|
||||||
|
t := sm2KDF(append(toBytes(sm2P256, x2), toBytes(sm2P256, y2)...), kdfLen)
|
||||||
|
|
||||||
|
// M = C2 xor t
|
||||||
|
plaintext := make([]byte, len(c2))
|
||||||
|
for i := 0; i < len(c2); i++ {
|
||||||
|
plaintext[i] = c2[i] ^ t[i]
|
||||||
|
}
|
||||||
|
|
||||||
|
// Verify C3 = Hash(x2 || M || y2)
|
||||||
|
u := append(toBytes(sm2P256, x2), plaintext...)
|
||||||
|
u = append(u, toBytes(sm2P256, y2)...)
|
||||||
|
hash := Sm3(u)
|
||||||
|
|
||||||
|
for i := 0; i < len(c3); i++ {
|
||||||
|
if c3[i] != hash[i] {
|
||||||
|
return nil, errors.New("sm2: hash verification failed")
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return plaintext, nil
|
||||||
|
}
|
||||||
|
|
||||||
|
// SM2 KDF (Key Derivation Function)
|
||||||
|
func sm2KDF(z []byte, klen int) []byte {
|
||||||
|
limit := (klen + 31) / 32
|
||||||
|
result := make([]byte, 0, limit*32)
|
||||||
|
|
||||||
|
for i := 1; i <= limit; i++ {
|
||||||
|
counter := make([]byte, 4)
|
||||||
|
binary.BigEndian.PutUint32(counter, uint32(i))
|
||||||
|
hash := Sm3(append(z, counter...))
|
||||||
|
result = append(result, hash...)
|
||||||
|
}
|
||||||
|
|
||||||
|
return result[:klen]
|
||||||
|
}
|
||||||
|
|
||||||
|
func toBytes(curve elliptic.Curve, value *big.Int) []byte {
|
||||||
|
byteLen := (curve.Params().BitSize + 7) / 8
|
||||||
|
buf := make([]byte, byteLen)
|
||||||
|
b := value.Bytes()
|
||||||
|
copy(buf[byteLen-len(b):], b)
|
||||||
|
return buf
|
||||||
|
}
|
||||||
|
|
||||||
|
func sm2MarshalUncompressed(curve *sm2Curve, x, y *big.Int) []byte {
|
||||||
|
byteLen := (curve.BitSize + 7) / 8
|
||||||
|
ret := make([]byte, 1+2*byteLen)
|
||||||
|
ret[0] = 4 // uncompressed point
|
||||||
|
|
||||||
|
xBytes := x.Bytes()
|
||||||
|
copy(ret[1+byteLen-len(xBytes):], xBytes)
|
||||||
|
yBytes := y.Bytes()
|
||||||
|
copy(ret[1+2*byteLen-len(yBytes):], yBytes)
|
||||||
|
|
||||||
|
return ret
|
||||||
|
}
|
||||||
|
|
||||||
|
func sm2UnmarshalUncompressed(curve *sm2Curve, data []byte) (*big.Int, *big.Int) {
|
||||||
|
byteLen := (curve.BitSize + 7) / 8
|
||||||
|
if len(data) != 1+2*byteLen {
|
||||||
|
return nil, nil
|
||||||
|
}
|
||||||
|
if data[0] != 4 {
|
||||||
|
return nil, nil
|
||||||
|
}
|
||||||
|
|
||||||
|
x := new(big.Int).SetBytes(data[1 : 1+byteLen])
|
||||||
|
y := new(big.Int).SetBytes(data[1+byteLen:])
|
||||||
|
|
||||||
|
return x, y
|
||||||
|
}
|
||||||
|
|
||||||
|
func randFieldElement(c elliptic.Curve, rand io.Reader) (*big.Int, error) {
|
||||||
|
params := c.Params()
|
||||||
|
b := make([]byte, params.BitSize/8+8)
|
||||||
|
_, err := io.ReadFull(rand, b)
|
||||||
|
if err != nil {
|
||||||
|
return nil, err
|
||||||
|
}
|
||||||
|
|
||||||
|
k := new(big.Int).SetBytes(b)
|
||||||
|
n := new(big.Int).Sub(params.N, big.NewInt(1))
|
||||||
|
k.Mod(k, n)
|
||||||
|
k.Add(k, big.NewInt(1))
|
||||||
|
|
||||||
|
return k, nil
|
||||||
|
}
|
||||||
@@ -0,0 +1,211 @@
|
|||||||
|
package cryptor
|
||||||
|
|
||||||
|
import (
|
||||||
|
"encoding/binary"
|
||||||
|
"hash"
|
||||||
|
)
|
||||||
|
|
||||||
|
// SM3 implements the Chinese SM3 cryptographic hash algorithm.
|
||||||
|
// SM3 produces a 256-bit (32-byte) hash value.
|
||||||
|
|
||||||
|
const (
|
||||||
|
sm3BlockSize = 64
|
||||||
|
sm3Size = 32
|
||||||
|
sm3T1 = 0x79cc4519
|
||||||
|
sm3T2 = 0x7a879d8a
|
||||||
|
)
|
||||||
|
|
||||||
|
var sm3IV = [8]uint32{
|
||||||
|
0x7380166f, 0x4914b2b9, 0x172442d7, 0xda8a0600,
|
||||||
|
0xa96f30bc, 0x163138aa, 0xe38dee4d, 0xb0fb0e4e,
|
||||||
|
}
|
||||||
|
|
||||||
|
type sm3Digest struct {
|
||||||
|
h [8]uint32
|
||||||
|
x [sm3BlockSize]byte
|
||||||
|
nx int
|
||||||
|
len uint64
|
||||||
|
}
|
||||||
|
|
||||||
|
// Sm3 returns a new hash.Hash computing the SM3 checksum.
|
||||||
|
// Play: https://go.dev/play/p/zDAQpteAiOc
|
||||||
|
func Sm3(data []byte) []byte {
|
||||||
|
h := newSm3()
|
||||||
|
h.Write(data)
|
||||||
|
return h.Sum(nil)
|
||||||
|
}
|
||||||
|
|
||||||
|
func newSm3() hash.Hash {
|
||||||
|
d := new(sm3Digest)
|
||||||
|
d.Reset()
|
||||||
|
return d
|
||||||
|
}
|
||||||
|
|
||||||
|
func (d *sm3Digest) Reset() {
|
||||||
|
d.h = sm3IV
|
||||||
|
d.nx = 0
|
||||||
|
d.len = 0
|
||||||
|
}
|
||||||
|
|
||||||
|
func (d *sm3Digest) Size() int {
|
||||||
|
return sm3Size
|
||||||
|
}
|
||||||
|
|
||||||
|
func (d *sm3Digest) BlockSize() int {
|
||||||
|
return sm3BlockSize
|
||||||
|
}
|
||||||
|
|
||||||
|
func (d *sm3Digest) Write(p []byte) (nn int, err error) {
|
||||||
|
nn = len(p)
|
||||||
|
d.len += uint64(nn)
|
||||||
|
|
||||||
|
if d.nx > 0 {
|
||||||
|
n := copy(d.x[d.nx:], p)
|
||||||
|
d.nx += n
|
||||||
|
if d.nx == sm3BlockSize {
|
||||||
|
sm3Block(d, d.x[:])
|
||||||
|
d.nx = 0
|
||||||
|
}
|
||||||
|
p = p[n:]
|
||||||
|
}
|
||||||
|
|
||||||
|
if len(p) >= sm3BlockSize {
|
||||||
|
n := len(p) &^ (sm3BlockSize - 1)
|
||||||
|
sm3Block(d, p[:n])
|
||||||
|
p = p[n:]
|
||||||
|
}
|
||||||
|
|
||||||
|
if len(p) > 0 {
|
||||||
|
d.nx = copy(d.x[:], p)
|
||||||
|
}
|
||||||
|
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
func (d *sm3Digest) Sum(in []byte) []byte {
|
||||||
|
d0 := *d
|
||||||
|
hash := d0.checkSum()
|
||||||
|
return append(in, hash[:]...)
|
||||||
|
}
|
||||||
|
|
||||||
|
func (d *sm3Digest) checkSum() [sm3Size]byte {
|
||||||
|
len := d.len
|
||||||
|
var tmp [64]byte
|
||||||
|
tmp[0] = 0x80
|
||||||
|
|
||||||
|
if len%64 < 56 {
|
||||||
|
d.Write(tmp[0 : 56-len%64])
|
||||||
|
} else {
|
||||||
|
d.Write(tmp[0 : 64+56-len%64])
|
||||||
|
}
|
||||||
|
|
||||||
|
len <<= 3
|
||||||
|
binary.BigEndian.PutUint64(tmp[:], len)
|
||||||
|
d.Write(tmp[0:8])
|
||||||
|
|
||||||
|
if d.nx != 0 {
|
||||||
|
panic("d.nx != 0")
|
||||||
|
}
|
||||||
|
|
||||||
|
var digest [sm3Size]byte
|
||||||
|
for i := 0; i < 8; i++ {
|
||||||
|
binary.BigEndian.PutUint32(digest[i*4:], d.h[i])
|
||||||
|
}
|
||||||
|
|
||||||
|
return digest
|
||||||
|
}
|
||||||
|
|
||||||
|
func sm3Block(dig *sm3Digest, p []byte) {
|
||||||
|
var w [68]uint32
|
||||||
|
var w1 [64]uint32
|
||||||
|
|
||||||
|
h0, h1, h2, h3, h4, h5, h6, h7 := dig.h[0], dig.h[1], dig.h[2], dig.h[3], dig.h[4], dig.h[5], dig.h[6], dig.h[7]
|
||||||
|
|
||||||
|
for len(p) >= sm3BlockSize {
|
||||||
|
for i := 0; i < 16; i++ {
|
||||||
|
j := i * 4
|
||||||
|
w[i] = binary.BigEndian.Uint32(p[j : j+4])
|
||||||
|
}
|
||||||
|
|
||||||
|
for i := 16; i < 68; i++ {
|
||||||
|
w[i] = sm3P1(w[i-16]^w[i-9]^sm3RotateLeft(w[i-3], 15)) ^ sm3RotateLeft(w[i-13], 7) ^ w[i-6]
|
||||||
|
}
|
||||||
|
|
||||||
|
for i := 0; i < 64; i++ {
|
||||||
|
w1[i] = w[i] ^ w[i+4]
|
||||||
|
}
|
||||||
|
|
||||||
|
A, B, C, D, E, F, G, H := h0, h1, h2, h3, h4, h5, h6, h7
|
||||||
|
|
||||||
|
for j := 0; j < 64; j++ {
|
||||||
|
var ss1, ss2, tt1, tt2, t uint32
|
||||||
|
|
||||||
|
if j < 16 {
|
||||||
|
t = sm3T1
|
||||||
|
} else {
|
||||||
|
t = sm3T2
|
||||||
|
}
|
||||||
|
|
||||||
|
ss1 = sm3RotateLeft(sm3RotateLeft(A, 12)+E+sm3RotateLeft(t, uint32(j%32)), 7)
|
||||||
|
ss2 = ss1 ^ sm3RotateLeft(A, 12)
|
||||||
|
|
||||||
|
if j < 16 {
|
||||||
|
tt1 = sm3FF0(A, B, C) + D + ss2 + w1[j]
|
||||||
|
tt2 = sm3GG0(E, F, G) + H + ss1 + w[j]
|
||||||
|
} else {
|
||||||
|
tt1 = sm3FF1(A, B, C) + D + ss2 + w1[j]
|
||||||
|
tt2 = sm3GG1(E, F, G) + H + ss1 + w[j]
|
||||||
|
}
|
||||||
|
|
||||||
|
D = C
|
||||||
|
C = sm3RotateLeft(B, 9)
|
||||||
|
B = A
|
||||||
|
A = tt1
|
||||||
|
H = G
|
||||||
|
G = sm3RotateLeft(F, 19)
|
||||||
|
F = E
|
||||||
|
E = sm3P0(tt2)
|
||||||
|
}
|
||||||
|
|
||||||
|
h0 ^= A
|
||||||
|
h1 ^= B
|
||||||
|
h2 ^= C
|
||||||
|
h3 ^= D
|
||||||
|
h4 ^= E
|
||||||
|
h5 ^= F
|
||||||
|
h6 ^= G
|
||||||
|
h7 ^= H
|
||||||
|
|
||||||
|
p = p[sm3BlockSize:]
|
||||||
|
}
|
||||||
|
|
||||||
|
dig.h[0], dig.h[1], dig.h[2], dig.h[3], dig.h[4], dig.h[5], dig.h[6], dig.h[7] = h0, h1, h2, h3, h4, h5, h6, h7
|
||||||
|
}
|
||||||
|
|
||||||
|
func sm3RotateLeft(x, n uint32) uint32 {
|
||||||
|
return (x << n) | (x >> (32 - n))
|
||||||
|
}
|
||||||
|
|
||||||
|
func sm3P0(x uint32) uint32 {
|
||||||
|
return x ^ sm3RotateLeft(x, 9) ^ sm3RotateLeft(x, 17)
|
||||||
|
}
|
||||||
|
|
||||||
|
func sm3P1(x uint32) uint32 {
|
||||||
|
return x ^ sm3RotateLeft(x, 15) ^ sm3RotateLeft(x, 23)
|
||||||
|
}
|
||||||
|
|
||||||
|
func sm3FF0(x, y, z uint32) uint32 {
|
||||||
|
return x ^ y ^ z
|
||||||
|
}
|
||||||
|
|
||||||
|
func sm3FF1(x, y, z uint32) uint32 {
|
||||||
|
return (x & y) | (x & z) | (y & z)
|
||||||
|
}
|
||||||
|
|
||||||
|
func sm3GG0(x, y, z uint32) uint32 {
|
||||||
|
return x ^ y ^ z
|
||||||
|
}
|
||||||
|
|
||||||
|
func sm3GG1(x, y, z uint32) uint32 {
|
||||||
|
return (x & y) | (^x & z)
|
||||||
|
}
|
||||||
@@ -0,0 +1,270 @@
|
|||||||
|
package cryptor
|
||||||
|
|
||||||
|
import (
|
||||||
|
"crypto/cipher"
|
||||||
|
"crypto/rand"
|
||||||
|
"encoding/binary"
|
||||||
|
"io"
|
||||||
|
)
|
||||||
|
|
||||||
|
// SM4 implements the Chinese SM4 block cipher.
|
||||||
|
// SM4 is a 128-bit block cipher with 128-bit keys.
|
||||||
|
// This implementation uses pre-computed lookup tables for optimal performance.
|
||||||
|
|
||||||
|
const sm4BlockSize = 16
|
||||||
|
|
||||||
|
// Pre-computed T-transformation lookup tables for performance optimization
|
||||||
|
var sm4T1Table [256][4]uint32 // S-box + L1 transformation
|
||||||
|
var sm4T2Table [256][4]uint32 // S-box + L2 transformation
|
||||||
|
|
||||||
|
var sm4Sbox = [256]byte{
|
||||||
|
0xd6, 0x90, 0xe9, 0xfe, 0xcc, 0xe1, 0x3d, 0xb7, 0x16, 0xb6, 0x14, 0xc2, 0x28, 0xfb, 0x2c, 0x05,
|
||||||
|
0x2b, 0x67, 0x9a, 0x76, 0x2a, 0xbe, 0x04, 0xc3, 0xaa, 0x44, 0x13, 0x26, 0x49, 0x86, 0x06, 0x99,
|
||||||
|
0x9c, 0x42, 0x50, 0xf4, 0x91, 0xef, 0x98, 0x7a, 0x33, 0x54, 0x0b, 0x43, 0xed, 0xcf, 0xac, 0x62,
|
||||||
|
0xe4, 0xb3, 0x1c, 0xa9, 0xc9, 0x08, 0xe8, 0x95, 0x80, 0xdf, 0x94, 0xfa, 0x75, 0x8f, 0x3f, 0xa6,
|
||||||
|
0x47, 0x07, 0xa7, 0xfc, 0xf3, 0x73, 0x17, 0xba, 0x83, 0x59, 0x3c, 0x19, 0xe6, 0x85, 0x4f, 0xa8,
|
||||||
|
0x68, 0x6b, 0x81, 0xb2, 0x71, 0x64, 0xda, 0x8b, 0xf8, 0xeb, 0x0f, 0x4b, 0x70, 0x56, 0x9d, 0x35,
|
||||||
|
0x1e, 0x24, 0x0e, 0x5e, 0x63, 0x58, 0xd1, 0xa2, 0x25, 0x22, 0x7c, 0x3b, 0x01, 0x21, 0x78, 0x87,
|
||||||
|
0xd4, 0x00, 0x46, 0x57, 0x9f, 0xd3, 0x27, 0x52, 0x4c, 0x36, 0x02, 0xe7, 0xa0, 0xc4, 0xc8, 0x9e,
|
||||||
|
0xea, 0xbf, 0x8a, 0xd2, 0x40, 0xc7, 0x38, 0xb5, 0xa3, 0xf7, 0xf2, 0xce, 0xf9, 0x61, 0x15, 0xa1,
|
||||||
|
0xe0, 0xae, 0x5d, 0xa4, 0x9b, 0x34, 0x1a, 0x55, 0xad, 0x93, 0x32, 0x30, 0xf5, 0x8c, 0xb1, 0xe3,
|
||||||
|
0x1d, 0xf6, 0xe2, 0x2e, 0x82, 0x66, 0xca, 0x60, 0xc0, 0x29, 0x23, 0xab, 0x0d, 0x53, 0x4e, 0x6f,
|
||||||
|
0xd5, 0xdb, 0x37, 0x45, 0xde, 0xfd, 0x8e, 0x2f, 0x03, 0xff, 0x6a, 0x72, 0x6d, 0x6c, 0x5b, 0x51,
|
||||||
|
0x8d, 0x1b, 0xaf, 0x92, 0xbb, 0xdd, 0xbc, 0x7f, 0x11, 0xd9, 0x5c, 0x41, 0x1f, 0x10, 0x5a, 0xd8,
|
||||||
|
0x0a, 0xc1, 0x31, 0x88, 0xa5, 0xcd, 0x7b, 0xbd, 0x2d, 0x74, 0xd0, 0x12, 0xb8, 0xe5, 0xb4, 0xb0,
|
||||||
|
0x89, 0x69, 0x97, 0x4a, 0x0c, 0x96, 0x77, 0x7e, 0x65, 0xb9, 0xf1, 0x09, 0xc5, 0x6e, 0xc6, 0x84,
|
||||||
|
0x18, 0xf0, 0x7d, 0xec, 0x3a, 0xdc, 0x4d, 0x20, 0x79, 0xee, 0x5f, 0x3e, 0xd7, 0xcb, 0x39, 0x48,
|
||||||
|
}
|
||||||
|
|
||||||
|
var sm4FK = [4]uint32{0xa3b1bac6, 0x56aa3350, 0x677d9197, 0xb27022dc}
|
||||||
|
|
||||||
|
var sm4CK = [32]uint32{
|
||||||
|
0x00070e15, 0x1c232a31, 0x383f464d, 0x545b6269,
|
||||||
|
0x70777e85, 0x8c939aa1, 0xa8afb6bd, 0xc4cbd2d9,
|
||||||
|
0xe0e7eef5, 0xfc030a11, 0x181f262d, 0x343b4249,
|
||||||
|
0x50575e65, 0x6c737a81, 0x888f969d, 0xa4abb2b9,
|
||||||
|
0xc0c7ced5, 0xdce3eaf1, 0xf8ff060d, 0x141b2229,
|
||||||
|
0x30373e45, 0x4c535a61, 0x686f767d, 0x848b9299,
|
||||||
|
0xa0a7aeb5, 0xbcc3cad1, 0xd8dfe6ed, 0xf4fb0209,
|
||||||
|
0x10171e25, 0x2c333a41, 0x484f565d, 0x646b7279,
|
||||||
|
}
|
||||||
|
|
||||||
|
// 初始化预计算查找表
|
||||||
|
func init() {
|
||||||
|
// Pre-compute all possible T1 and T2 transformations
|
||||||
|
for pos := 0; pos < 4; pos++ {
|
||||||
|
for i := 0; i < 256; i++ {
|
||||||
|
// S-box 替换
|
||||||
|
sboxVal := sm4Sbox[i]
|
||||||
|
|
||||||
|
// 根据字节位置计算偏移
|
||||||
|
shift := uint32((3 - pos) * 8)
|
||||||
|
b := uint32(sboxVal) << shift
|
||||||
|
|
||||||
|
// L1 变换:b ^ ROL(b,2) ^ ROL(b,10) ^ ROL(b,18) ^ ROL(b,24)
|
||||||
|
sm4T1Table[i][pos] = b ^ sm4RotateLeft(b, 2) ^ sm4RotateLeft(b, 10) ^ sm4RotateLeft(b, 18) ^ sm4RotateLeft(b, 24)
|
||||||
|
|
||||||
|
// L2 变换:b ^ ROL(b,13) ^ ROL(b,23)
|
||||||
|
sm4T2Table[i][pos] = b ^ sm4RotateLeft(b, 13) ^ sm4RotateLeft(b, 23)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
type sm4Cipher struct {
|
||||||
|
enc [32]uint32
|
||||||
|
dec [32]uint32
|
||||||
|
}
|
||||||
|
|
||||||
|
// Sm4EcbEncrypt encrypts data using SM4 in ECB mode.
|
||||||
|
// key must be 16 bytes.
|
||||||
|
// Play: https://go.dev/play/p/l5IQxYuuaED
|
||||||
|
func Sm4EcbEncrypt(data, key []byte) []byte {
|
||||||
|
if len(key) != 16 {
|
||||||
|
panic("sm4: key length must be 16 bytes")
|
||||||
|
}
|
||||||
|
|
||||||
|
c := newSm4Cipher(key)
|
||||||
|
padded := pkcs7Padding(data, sm4BlockSize)
|
||||||
|
encrypted := make([]byte, len(padded))
|
||||||
|
|
||||||
|
for i := 0; i < len(padded); i += sm4BlockSize {
|
||||||
|
c.Encrypt(encrypted[i:i+sm4BlockSize], padded[i:i+sm4BlockSize])
|
||||||
|
}
|
||||||
|
|
||||||
|
return encrypted
|
||||||
|
}
|
||||||
|
|
||||||
|
// Sm4EcbDecrypt decrypts data using SM4 in ECB mode.
|
||||||
|
// key must be 16 bytes.
|
||||||
|
// Play: https://go.dev/play/p/l5IQxYuuaED
|
||||||
|
func Sm4EcbDecrypt(encrypted, key []byte) []byte {
|
||||||
|
if len(key) != 16 {
|
||||||
|
panic("sm4: key length must be 16 bytes")
|
||||||
|
}
|
||||||
|
|
||||||
|
if len(encrypted)%sm4BlockSize != 0 {
|
||||||
|
panic("sm4: encrypted data length must be multiple of block size")
|
||||||
|
}
|
||||||
|
|
||||||
|
c := newSm4Cipher(key)
|
||||||
|
decrypted := make([]byte, len(encrypted))
|
||||||
|
|
||||||
|
for i := 0; i < len(encrypted); i += sm4BlockSize {
|
||||||
|
c.Decrypt(decrypted[i:i+sm4BlockSize], encrypted[i:i+sm4BlockSize])
|
||||||
|
}
|
||||||
|
|
||||||
|
return pkcs7UnPadding(decrypted)
|
||||||
|
}
|
||||||
|
|
||||||
|
// Sm4CbcEncrypt encrypts data using SM4 in CBC mode.
|
||||||
|
// key must be 16 bytes.
|
||||||
|
// Play: https://go.dev/play/p/65Q6iYhLRTa
|
||||||
|
func Sm4CbcEncrypt(data, key []byte) []byte {
|
||||||
|
if len(key) != 16 {
|
||||||
|
panic("sm4: key length must be 16 bytes")
|
||||||
|
}
|
||||||
|
|
||||||
|
c := newSm4Cipher(key)
|
||||||
|
padded := pkcs7Padding(data, sm4BlockSize)
|
||||||
|
|
||||||
|
iv := make([]byte, sm4BlockSize)
|
||||||
|
if _, err := io.ReadFull(rand.Reader, iv); err != nil {
|
||||||
|
panic("sm4: failed to generate IV: " + err.Error())
|
||||||
|
}
|
||||||
|
|
||||||
|
encrypted := make([]byte, len(padded))
|
||||||
|
mode := cipher.NewCBCEncrypter(c, iv)
|
||||||
|
mode.CryptBlocks(encrypted, padded)
|
||||||
|
|
||||||
|
return append(iv, encrypted...)
|
||||||
|
}
|
||||||
|
|
||||||
|
// Sm4CbcDecrypt decrypts data using SM4 in CBC mode.
|
||||||
|
// key must be 16 bytes.
|
||||||
|
// Play: https://go.dev/play/p/65Q6iYhLRTa
|
||||||
|
func Sm4CbcDecrypt(encrypted, key []byte) []byte {
|
||||||
|
if len(key) != 16 {
|
||||||
|
panic("sm4: key length must be 16 bytes")
|
||||||
|
}
|
||||||
|
|
||||||
|
if len(encrypted) < sm4BlockSize {
|
||||||
|
panic("sm4: encrypted data too short")
|
||||||
|
}
|
||||||
|
|
||||||
|
if len(encrypted)%sm4BlockSize != 0 {
|
||||||
|
panic("sm4: encrypted data length must be multiple of block size")
|
||||||
|
}
|
||||||
|
|
||||||
|
c := newSm4Cipher(key)
|
||||||
|
iv := encrypted[:sm4BlockSize]
|
||||||
|
ciphertext := encrypted[sm4BlockSize:]
|
||||||
|
|
||||||
|
decrypted := make([]byte, len(ciphertext))
|
||||||
|
mode := cipher.NewCBCDecrypter(c, iv)
|
||||||
|
mode.CryptBlocks(decrypted, ciphertext)
|
||||||
|
|
||||||
|
return pkcs7UnPadding(decrypted)
|
||||||
|
}
|
||||||
|
|
||||||
|
func newSm4Cipher(key []byte) *sm4Cipher {
|
||||||
|
c := &sm4Cipher{}
|
||||||
|
|
||||||
|
var mk [4]uint32
|
||||||
|
for i := 0; i < 4; i++ {
|
||||||
|
mk[i] = binary.BigEndian.Uint32(key[i*4 : (i+1)*4])
|
||||||
|
}
|
||||||
|
|
||||||
|
var k [36]uint32
|
||||||
|
k[0] = mk[0] ^ sm4FK[0]
|
||||||
|
k[1] = mk[1] ^ sm4FK[1]
|
||||||
|
k[2] = mk[2] ^ sm4FK[2]
|
||||||
|
k[3] = mk[3] ^ sm4FK[3]
|
||||||
|
|
||||||
|
for i := 0; i < 32; i++ {
|
||||||
|
k[i+4] = k[i] ^ sm4T2Fast(k[i+1]^k[i+2]^k[i+3]^sm4CK[i])
|
||||||
|
c.enc[i] = k[i+4]
|
||||||
|
}
|
||||||
|
|
||||||
|
for i := 0; i < 32; i++ {
|
||||||
|
c.dec[i] = c.enc[31-i]
|
||||||
|
}
|
||||||
|
|
||||||
|
return c
|
||||||
|
}
|
||||||
|
|
||||||
|
func (c *sm4Cipher) BlockSize() int {
|
||||||
|
return sm4BlockSize
|
||||||
|
}
|
||||||
|
|
||||||
|
func (c *sm4Cipher) Encrypt(dst, src []byte) {
|
||||||
|
if len(src) < sm4BlockSize {
|
||||||
|
panic("sm4: input not full block")
|
||||||
|
}
|
||||||
|
if len(dst) < sm4BlockSize {
|
||||||
|
panic("sm4: output not full block")
|
||||||
|
}
|
||||||
|
|
||||||
|
// 使用局部变量避免数组分配,提升性能
|
||||||
|
x0 := binary.BigEndian.Uint32(src[0:4])
|
||||||
|
x1 := binary.BigEndian.Uint32(src[4:8])
|
||||||
|
x2 := binary.BigEndian.Uint32(src[8:12])
|
||||||
|
x3 := binary.BigEndian.Uint32(src[12:16])
|
||||||
|
|
||||||
|
// 32 轮加密
|
||||||
|
for i := 0; i < 32; i++ {
|
||||||
|
t := x1 ^ x2 ^ x3 ^ c.enc[i]
|
||||||
|
x0 ^= sm4T1Fast(t)
|
||||||
|
x0, x1, x2, x3 = x1, x2, x3, x0
|
||||||
|
}
|
||||||
|
|
||||||
|
binary.BigEndian.PutUint32(dst[0:4], x3)
|
||||||
|
binary.BigEndian.PutUint32(dst[4:8], x2)
|
||||||
|
binary.BigEndian.PutUint32(dst[8:12], x1)
|
||||||
|
binary.BigEndian.PutUint32(dst[12:16], x0)
|
||||||
|
}
|
||||||
|
|
||||||
|
func (c *sm4Cipher) Decrypt(dst, src []byte) {
|
||||||
|
if len(src) < sm4BlockSize {
|
||||||
|
panic("sm4: input not full block")
|
||||||
|
}
|
||||||
|
if len(dst) < sm4BlockSize {
|
||||||
|
panic("sm4: output not full block")
|
||||||
|
}
|
||||||
|
|
||||||
|
x0 := binary.BigEndian.Uint32(src[0:4])
|
||||||
|
x1 := binary.BigEndian.Uint32(src[4:8])
|
||||||
|
x2 := binary.BigEndian.Uint32(src[8:12])
|
||||||
|
x3 := binary.BigEndian.Uint32(src[12:16])
|
||||||
|
|
||||||
|
// 32 轮解密
|
||||||
|
for i := 0; i < 32; i++ {
|
||||||
|
t := x1 ^ x2 ^ x3 ^ c.dec[i]
|
||||||
|
x0 ^= sm4T1Fast(t)
|
||||||
|
x0, x1, x2, x3 = x1, x2, x3, x0
|
||||||
|
}
|
||||||
|
|
||||||
|
binary.BigEndian.PutUint32(dst[0:4], x3)
|
||||||
|
binary.BigEndian.PutUint32(dst[4:8], x2)
|
||||||
|
binary.BigEndian.PutUint32(dst[8:12], x1)
|
||||||
|
binary.BigEndian.PutUint32(dst[12:16], x0)
|
||||||
|
}
|
||||||
|
|
||||||
|
// 使用预计算查找表的快速 T1 变换(用于加密轮函数)
|
||||||
|
func sm4T1Fast(a uint32) uint32 {
|
||||||
|
return sm4T1Table[byte(a>>24)][0] ^
|
||||||
|
sm4T1Table[byte(a>>16)][1] ^
|
||||||
|
sm4T1Table[byte(a>>8)][2] ^
|
||||||
|
sm4T1Table[byte(a)][3]
|
||||||
|
}
|
||||||
|
|
||||||
|
// 使用预计算查找表的快速 T2 变换(用于密钥扩展)
|
||||||
|
func sm4T2Fast(a uint32) uint32 {
|
||||||
|
return sm4T2Table[byte(a>>24)][0] ^
|
||||||
|
sm4T2Table[byte(a>>16)][1] ^
|
||||||
|
sm4T2Table[byte(a>>8)][2] ^
|
||||||
|
sm4T2Table[byte(a)][3]
|
||||||
|
}
|
||||||
|
|
||||||
|
func sm4RotateLeft(x uint32, n uint32) uint32 {
|
||||||
|
return (x << n) | (x >> (32 - n))
|
||||||
|
}
|
||||||
@@ -0,0 +1,163 @@
|
|||||||
|
package cryptor
|
||||||
|
|
||||||
|
import (
|
||||||
|
"encoding/hex"
|
||||||
|
"testing"
|
||||||
|
|
||||||
|
"github.com/duke-git/lancet/v2/internal"
|
||||||
|
)
|
||||||
|
|
||||||
|
func TestSm3(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestSm3")
|
||||||
|
|
||||||
|
tests := []struct {
|
||||||
|
input string
|
||||||
|
expected string
|
||||||
|
}{
|
||||||
|
{
|
||||||
|
input: "abc",
|
||||||
|
expected: "66c7f0f462eeedd9d1f2d46bdc10e4e24167c4875cf2f7a2297da02b8f4ba8e0",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
input: "abcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcdabcd",
|
||||||
|
expected: "debe9ff92275b8a138604889c18e5a4d6fdb70e5387e5765293dcba39c0c5732",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
input: "",
|
||||||
|
expected: "1ab21d8355cfa17f8e61194831e81a8f22bec8c728fefb747ed035eb5082aa2b",
|
||||||
|
},
|
||||||
|
}
|
||||||
|
|
||||||
|
for _, tt := range tests {
|
||||||
|
result := Sm3([]byte(tt.input))
|
||||||
|
resultHex := hex.EncodeToString(result)
|
||||||
|
assert.Equal(tt.expected, resultHex)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestSm4EcbEncryptDecrypt(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestSm4EcbEncryptDecrypt")
|
||||||
|
|
||||||
|
key := []byte("1234567890abcdef") // 16 bytes
|
||||||
|
plaintext := []byte("Hello, SM4!")
|
||||||
|
|
||||||
|
// Encrypt
|
||||||
|
encrypted := Sm4EcbEncrypt(plaintext, key)
|
||||||
|
assert.IsNotNil(encrypted)
|
||||||
|
|
||||||
|
// Decrypt
|
||||||
|
decrypted := Sm4EcbDecrypt(encrypted, key)
|
||||||
|
assert.Equal(plaintext, decrypted)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestSm4CbcEncryptDecrypt(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestSm4CbcEncryptDecrypt")
|
||||||
|
|
||||||
|
key := []byte("1234567890abcdef") // 16 bytes
|
||||||
|
plaintext := []byte("Hello, SM4 CBC mode!")
|
||||||
|
|
||||||
|
// Encrypt
|
||||||
|
encrypted := Sm4CbcEncrypt(plaintext, key)
|
||||||
|
assert.IsNotNil(encrypted)
|
||||||
|
|
||||||
|
// Decrypt
|
||||||
|
decrypted := Sm4CbcDecrypt(encrypted, key)
|
||||||
|
assert.Equal(plaintext, decrypted)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestSm4EcbWithLongData(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestSm4EcbWithLongData")
|
||||||
|
|
||||||
|
key := []byte("1234567890abcdef")
|
||||||
|
plaintext := []byte("This is a longer message that spans multiple blocks for SM4 encryption testing.")
|
||||||
|
|
||||||
|
encrypted := Sm4EcbEncrypt(plaintext, key)
|
||||||
|
decrypted := Sm4EcbDecrypt(encrypted, key)
|
||||||
|
|
||||||
|
assert.Equal(plaintext, decrypted)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestSm2EncryptDecrypt(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestSm2EncryptDecrypt")
|
||||||
|
|
||||||
|
// Generate key pair
|
||||||
|
privateKey, err := GenerateSm2Key()
|
||||||
|
assert.IsNil(err)
|
||||||
|
assert.IsNotNil(privateKey)
|
||||||
|
|
||||||
|
plaintext := []byte("Hello, SM2!")
|
||||||
|
|
||||||
|
// Encrypt with public key
|
||||||
|
ciphertext, err := Sm2Encrypt(&privateKey.PublicKey, plaintext)
|
||||||
|
assert.IsNil(err)
|
||||||
|
assert.IsNotNil(ciphertext)
|
||||||
|
|
||||||
|
// Decrypt with private key
|
||||||
|
decrypted, err := Sm2Decrypt(privateKey, ciphertext)
|
||||||
|
assert.IsNil(err)
|
||||||
|
assert.Equal(plaintext, decrypted)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestSm2WithLongData(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestSm2WithLongData")
|
||||||
|
|
||||||
|
privateKey, err := GenerateSm2Key()
|
||||||
|
assert.IsNil(err)
|
||||||
|
|
||||||
|
plaintext := []byte("This is a longer message for SM2 encryption testing. " +
|
||||||
|
"SM2 is an elliptic curve public key cryptography algorithm.")
|
||||||
|
|
||||||
|
ciphertext, err := Sm2Encrypt(&privateKey.PublicKey, plaintext)
|
||||||
|
assert.IsNil(err)
|
||||||
|
|
||||||
|
decrypted, err := Sm2Decrypt(privateKey, ciphertext)
|
||||||
|
assert.IsNil(err)
|
||||||
|
assert.Equal(plaintext, decrypted)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestSm4InvalidKeyLength(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestSm4InvalidKeyLength")
|
||||||
|
|
||||||
|
defer func() {
|
||||||
|
if r := recover(); r != nil {
|
||||||
|
assert.IsNotNil(r)
|
||||||
|
}
|
||||||
|
}()
|
||||||
|
|
||||||
|
key := []byte("short")
|
||||||
|
plaintext := []byte("test")
|
||||||
|
Sm4EcbEncrypt(plaintext, key) // Should panic
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestSm2InvalidInput(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestSm2InvalidInput")
|
||||||
|
|
||||||
|
// Test with nil public key
|
||||||
|
_, err := Sm2Encrypt(nil, []byte("test"))
|
||||||
|
assert.IsNotNil(err)
|
||||||
|
|
||||||
|
// Test with nil private key
|
||||||
|
_, err = Sm2Decrypt(nil, []byte("test"))
|
||||||
|
assert.IsNotNil(err)
|
||||||
|
|
||||||
|
// Test with invalid ciphertext
|
||||||
|
privateKey, _ := GenerateSm2Key()
|
||||||
|
_, err = Sm2Decrypt(privateKey, []byte("short"))
|
||||||
|
assert.IsNotNil(err)
|
||||||
|
}
|
||||||
@@ -0,0 +1,51 @@
|
|||||||
|
-----BEGIN rsa private key-----
|
||||||
|
MIIJKAIBAAKCAgEA5IqWfYbW1NlTDWE2plFWqD6CTquA0Ar/1E66lY8OMtrdpxTm
|
||||||
|
chirmoISWN0BD7r2tV9T/kHs44Sy3raAfkR5ixYF5FRkb63FdIAtoynsxS6MEE26
|
||||||
|
fgWuDAa1xwNt+t/uivnpfJk25htpBNkKGT8ii0TPPLn1N15hMHenT6PzWVjGjQxW
|
||||||
|
cp4dUA4gXTDuqaeu7Oy7Ku2yP90/ra+cjTV8DnBJ9enQhAfu1LivJO3FgmXeuC3u
|
||||||
|
qhhM3t9ZbNy7tvJI5PXDCaS8iesBvCp5carTSXWLpFEgvIhXQIsXtxezKAP3gRd8
|
||||||
|
r5JPQI9FZlxyUcyf+Htkn2A4qyKhFElnP1z9j0YLFhL/gQMdtNIY7yhSb29PyuCG
|
||||||
|
7noz25swrfxbA7ZVppM0J19JNhlpqmusBKLBNqN+KMD8EDli7NLX17S9Dj2pQF9I
|
||||||
|
8fVXPEhkdTb67rr7y3OUANKjh0Opnt3JLoj9u1X7BfCeUSR/qq3E8RFPeyxvP1tc
|
||||||
|
5QVqKBG6UPBo8nLQqdzJhUd8a1YEfXIUbdHLs2q5WVFu2MDavIp634+fzfcIFRoB
|
||||||
|
tdxf5aCdxLaLocsA/aLLyL1pK6K0rpdrSUtcEBMST26qIlU0Ht+SQtaMdE2gyjkM
|
||||||
|
M5RpLh1q/gpow+0j3zu6f5tDsu3qwgjLIx78YCTGUuCpsVMzFK4tahYSPNkCAwEA
|
||||||
|
AQKCAgEAuXz97X2uCW0lqjtXhp+HrN+nFUC/OJtkziTj7RUBmibnNX+SFdKOHMYr
|
||||||
|
K/KbtO+y4rwvSLKrGHIQVxBas6DR4SALwij4p2erVgXehIo3gEZqKaVckoH7pAki
|
||||||
|
KhdPgQmU6zkw1w7nbtWaY/Pf7WO/nrdHV+s56ilwykyi/9F6Ze7Wn43+7+ICuoHs
|
||||||
|
pJZdblcJc4Qj2RC41nq0/zwD3NwnBvT+IlgWA8MIhaArjtZospAJtwSYq3czlMRE
|
||||||
|
KUXyGOcGYMZS+RW6bFnPu6/hh271M67ymne6ESq7XkhGBDV5FCY8EItGiJ1AM47U
|
||||||
|
7eJkap2gzKUhovUOqV9eyz9UTComJETl2kmcjpZeaxrZZxtPap23IzBu6PJoPuDg
|
||||||
|
hgzRWh3BrkakLdq6Km2z+jDFEQhWeHsksozuKzln5USx9wovb9LDKKFSpKm4vzW+
|
||||||
|
7YVLZnH4Z1m4wvWQJShvZur7kkM7aNfK+xcS81OBMtqKerjWhdHqfMRVvLvtG/ev
|
||||||
|
ftPTwRy+u02w+FoYcassTS+lW+Pnhj0ZuOewsWoNvgWg1TpPEDBkY4UJOYQPkTrS
|
||||||
|
bixTBVI3teSjMXmjEAif+BG2LBCl7pFY5SW9Jk6eRvmxt9rEly13C+4tcBHEJnXu
|
||||||
|
eVUMurRuB/9BAKgj4qGHPQlG455mKHQzWJxJXBpRurh+U478xm0CggEBAOgduMra
|
||||||
|
tPDhyhy01iIAzYsh0PW9p11AcCoJkDUE/5IUf03fVt3WKdSNauHZBKTulqaCHkvz
|
||||||
|
+pjmSwPr4JdJKcJzwk5ncResFBYF177JmYXzJzwpIPRQFNP34heaUd9cVsFckddV
|
||||||
|
G3jR7c1vD33VElexUM94BubZFEqF2lO3/y0sLwhd7prKhwy6mctJyvyDFk02psDc
|
||||||
|
6XzBG/sMiZ6meWA1sP4QIM6+sYdZ9ihvTNWGb1+TGojvgOHCEQ3Hv9u/qwdkzFKj
|
||||||
|
qo25pRMV4VNMQUvYIywSB7K5c0w1ccfOINzB8kgqpHhpimAHqZw9ix4H98YmvaXS
|
||||||
|
rr0LP8ES9xVvelcCggEBAPwOs7pWvm/R3RAXZ8Erk9x68Fsn8wzoofsGP/BG5QCC
|
||||||
|
r1fDJr9aJAVggXOVNDktWRKkN7Cnib+Z7ymL5br3FfYPy945cF2e8nkx2ri0VveF
|
||||||
|
glkPCFLb3lF3iLKD8nJNtiv1rpu2v4Dj09+SzQYSIF3h55BaZGUCHLskR7Mhdd74
|
||||||
|
iTBzPaQ3NC+n0xrv8o1EXjy9w/nBt07sZojrf82Ae3mIbEFYdEHUVDaCZKKeBT4b
|
||||||
|
9W8Q5aAt56DIkSkaBAZZZhzbfxollmeKiwJ32+finR7LZ1Fj2cTHia19Ef85U8bE
|
||||||
|
Ow7E2cTDZkqaqgi+pFescl518DQ47PCeXfnFP0g65E8CggEAUApHubO3J0VE06dM
|
||||||
|
G8eZGTwc+VBf0RkyVFyd3JqPoojs6SZ1puN94yysyZpzLoiTbHF8DwbfyC/JeF2z
|
||||||
|
QZfaDZKrUyv6ZIZTGtEC92g/R2B0jBtGoNiohft5fFgbmWEXDXBlXhKb+YqybN+6
|
||||||
|
QNLjk1eynQgvoRUEGTqU8b+F/8a3pTP23muuLCaAeAhHNdHiM9f/oovK+9j/VA+b
|
||||||
|
uRiAzDtXgBSBq6k4QIs2BfVzUkIcT6HDSasFD1RDWzQhJZ6vVEpe5rRHUL3OfYlS
|
||||||
|
/M1TytqKLl09SFUIvCPFy3d5/4XljRsfQeJq8/hQdW8HdOCcgTjEttSyqr+hSWvH
|
||||||
|
xh192wKCAQB0uSY3u2XTCH9zrTMJ/HErn+7gd76REsW4JmvDjEEOHHawkJnH8SlP
|
||||||
|
KCKqcMTPWZWvEUcM0njytolPVw6ap0OPQD9reHP1lt64iwK7mB/R3gy/yztSi6kH
|
||||||
|
VvCBoqLKlfwvnUUvrNBAEsER/rxc/FXqw+tlKMbnE7RUYXeml28rQzLcsfEws7PC
|
||||||
|
Adi717QeATQWstYnObL2pHjTHSOA+ee0Hx3qoNith3M8DuQlfkH1QiNFPLDpnXhv
|
||||||
|
N5IpU3fbrNihsm/InvFon3rCONkoKAQUt6LvyOqWusSiB5Im+9g06rhinXwvJ0Ge
|
||||||
|
eMMW65nVU/FelwUWWeo3f08LlHE6tLL3AoIBABcc549sTCMhBmQS9prESurzhPVk
|
||||||
|
HCFYlR/GdlfNmRtTYssk25xaG+tiaEzXi7DXBq20TGNOATgoX7l9EWIRXkDuR6hS
|
||||||
|
aRXyn+CVU3y2dhpGZBf+EUWP0u9TNSJ/RFO0ViAriL5J9kjF9hFvG36B9kRSiMrn
|
||||||
|
mCp9NCdtRYOHjzkvbY5uRMqP8H4/nAXNMA+odPnOPDUOIcH2ztaFOtQgZxa9x/eS
|
||||||
|
eGmnJ/V/rLvS04uVw5d7juJstEspnM4MxPHSFEDN7NG13bN+c1jTY1/85icIeRBi
|
||||||
|
nP47M2kDQ6RrEdgYfPbdlx1wGdTUIeAm3duptTiwpwa5Q2Js22TMJYRTnbM=
|
||||||
|
-----END rsa private key-----
|
||||||
@@ -0,0 +1,51 @@
|
|||||||
|
-----BEGIN rsa private key-----
|
||||||
|
MIIJKAIBAAKCAgEA4TSGNCTws7pRURptw911vSr9rISCcjSgpjxVFtxkDpri/L+Q
|
||||||
|
HwDaDpTnAx2FKfFkBbYNklSl3JtY4vZQ8hNDvfHbwt+PagbNaeiu5l1agl7s2ssW
|
||||||
|
SXQ2dIKx45gtQxsuvAVGvmdgVEuyt/UwJrHgcyt5cqYejtRI5rcj509Pxegb3B84
|
||||||
|
gkPwgy6xb2jYWBZ+pi6aLdm2TGX8SCsbCJcO5SD3GFI4fG9OhsSaToD0/OSYzIbQ
|
||||||
|
8WP6D7KX3y5tVHFqV6eFHT2ZIskDRzN8z6cDxp+K2QcCtv5F7yqnjVBYbnk0dmC/
|
||||||
|
woAaNMgvpSaC94cv0oFOS1TWivZDgpLkUJL2hu4V1xGflkHVAdz/DlSUIfiJ47sL
|
||||||
|
HOHnjBQXY81ruh10Xwf7Sh0P9TfNod0KITSZaqXljYaomEfMOXHn8t1xxy6mAF/c
|
||||||
|
Zf/nSmXn+r3ue+cYHxPD0sHYQQqCCAAsNO/VT0Z1NXzjLwc497LwrfXnin0J2EGD
|
||||||
|
yNQf2LKCj8JhICRw72tMrzp8XAHodfxWNQzPL26k7ZzIGUUmlMn7ku0WcU2BsiGn
|
||||||
|
SXNPlFmeOqOzfdmgmiERbQPd3uzZ3a7pxhWlKGZSakZPEJeZHDEobmm+uBkr4OzI
|
||||||
|
gc/jBNp3xa3wXiPxftzoPB3TpUQdN/mgW/DeHMS7V56ie3vqYZQG1vUC7rsCAwEA
|
||||||
|
AQKCAgA1GCgHxSnGhcfEIkH8qoqmpasW8Eq82DGD37eD40PnuZaIVjWJSa8fPvXT
|
||||||
|
4zLQ96tIOWqrtC9CepGTONVOrUIMVygjoodyTNZDAOuzPhEnqW+YCcdgW/i2sVV1
|
||||||
|
Phx1tMPo6imKnF62oP4qprDKfqdXH8nLQOT1cZEaa9UYJLe/BgEDfYzaEWBz3R9S
|
||||||
|
D9rpsav8TAJniuuSyXyYGymNdee6F3KKFmBg3fEajuF+XqLjuJVZqvM55gM/jjCG
|
||||||
|
GrEF9pNGxST6BtrCu7d9IuNrJYobWuPmVOPL9tjQETNderLOoN7AhgDPv1nuVb/9
|
||||||
|
5L191C5vJ7MoyYCnVHYII8+WO3/JUMJVIk2cqssJ7/Kmg9HEkwSf18YqlZrL06tk
|
||||||
|
sqSGjE+/BioPoVuYUXXge44vO1wubirEWE2j4MIac8h77YEVk3/z3L63n8KyJLee
|
||||||
|
jBrbQoUIKQJxRM7KnOYvUuXtEuYd0koZaoYAUPoK/rEbtKpeEXSdSxrVf/eFAwXX
|
||||||
|
Rco0RIorId0eqrMr/ourR8T9A9NZJ0Tho432L/opd4iqy29TkbNHJ076LIM4ZmF7
|
||||||
|
KY0zlxiLEz9984Sn4cwyGAN/XrF2I/80du9GETMADlX+ut2Kaa6RWLaeANHuHqZY
|
||||||
|
UJu83F88ijFxrRE/L7KzTcx5qLmkuLzs3REWb/RO8hqj+yOSUQKCAQEA8SbJS8un
|
||||||
|
OWBXY5ZggutOHDobFsB/rdaM5s4tawO3w9UllwzN+wotkVvdtdRCN6jUdefF7Elc
|
||||||
|
wfJH69xXEmztpagdYU5TNTdAIRegr4mDNO0a2ESZ7xDT+9oO/Zf61n1g2YMSxWGc
|
||||||
|
1AhDO35bgMdimNlM65s9Nz4R1ZK3euTg0p2IpkIRTd+VRI9sxA9PQG4b5Zy9HHnS
|
||||||
|
Wv6DN7ULNKE2PBVlGWBXUGEndSXnnkTzIk8D2yZG0cpxiQilWlzs+XRa8URxRiy2
|
||||||
|
hdTSQPv9gR9hU833Ane9TlF6Y/tThVzOFV8DoUbyQuyyRcIqjvNnI8FAT69VTPr3
|
||||||
|
ogm8wWuksG2qkwKCAQEA7xJhL0YoUfmdt3s6YN97BhgZbFbm52XJiXPz/mlhlqwK
|
||||||
|
98w9vts4g5CAcnQbGyuj6r+OdQKgzK6YxJvs0DAokuQVYlqjfkB4KS55HDSzjKKy
|
||||||
|
N7WYXqp5Tnb+FCMycn7WvhEKbwMSvSI5e6L+aMOog/+FsLwdfDmfljEacYMBn2zq
|
||||||
|
AiAY8suN5dSKYXH6tf034FjyJYzT0HP2LA/qN/eXeF2fplapT0uXbjB9psUX6HEu
|
||||||
|
KPsEvl4xwJmAf8z+t6wbr6bTeHWCVvBsT/BQFrpkBacpohPRF0hb2JSetkT4dAk+
|
||||||
|
8xfnlCwm0h6ghSwcqWcQaOQ31drzsBRSmliwX9y8OQKCAQBkr4AOYHpyj1INZ4Tm
|
||||||
|
RJ65VF1pE3h7uX/dAiqeas/4OO9X8OWzsh0yervIJlZ7bMdAb0QJEtxisejrhnTo
|
||||||
|
YYibyORzc0N0jZv99SKHCBA7MeAqegIXedw4ZGQr55+4nGKqjnpw5P+Y29ZOacSE
|
||||||
|
sTrufJQMLyXRAd5qYLaw3g0sgs/CMwWMkRR+qq+L8KRzT0XgiZ+/2vFEQs3AnZuP
|
||||||
|
HtxJG9m5TatHCTlzRR8+yqUFJx6CCqo4/6CFyZFYeEINKVKrN5tf5F1U5XXf4haH
|
||||||
|
KfX2CqHeauYkZAqI4i+OGCCHdcNLPBb8cF1CmP4x71iZ6h8S5i7kVEi+Y/hmfa4m
|
||||||
|
Z7N3AoIBABvaBU5vmvTp4rDkf0mX34o3NocDnMTqe88yngNOnZrjEigKOEtK2Muj
|
||||||
|
AwPSePHyZJdNl7gUBU2zLYMCM1WRtrheMAuUSaXEtvr9OgjKLvy8W4zX8BdfPuCg
|
||||||
|
RjtsWk0yb6wW6iNCtWUpXo8DzyW/XZt7IkUTtU+qmufxcoY03/SFyMFUofNvOWnE
|
||||||
|
GBcAI1geVushEZzESkznpY8+j2fTxWa1aYsEX5coVEz3Azxxi7Z9sQX/MG9JI/yv
|
||||||
|
JWQ+KpKVT2hoRAyti/C687NgaMQtFMf/0H7cViijOmgB8HeFk3hZN2c0qrr9Zcxm
|
||||||
|
2waIvBIUOrotlD+q0Wb7ByCKIooYeikCggEBANeckCBhJ+JLa3XYQeQ1wCwx8VzZ
|
||||||
|
qUh+Fn0PHP14kkCyGH5JHRYz4JwxjZhhtSSH4i8glJCDEO4Nd8o5b7ziyJ6wjtmB
|
||||||
|
T/R6RxeWoCIyrmah5Fk/gHKbQJJP10yaDI2Pa2Dh5CDylNxaxMfuuHrM6KICXKqB
|
||||||
|
Ke7V5vFK+sgrO5PCEEIyEu3xGg9sFeZRpMvAxn85e2xLRN2lt/rekEqRpbsNK0QD
|
||||||
|
Vjl5n2QKjg+yGtS9iFPP9BPT331SL1J0gyPZn86UcGNFbQFAN43z7cU9Jvk1FcQC
|
||||||
|
ywP+0ziNE4AxRFwqVMXnsHvAJ55ppLOXJ8p+gJSo0HKky6hr6WkJHKsfw4I=
|
||||||
|
-----END rsa private key-----
|
||||||
@@ -0,0 +1,14 @@
|
|||||||
|
-----BEGIN rsa public key-----
|
||||||
|
MIICIjANBgkqhkiG9w0BAQEFAAOCAg8AMIICCgKCAgEA5IqWfYbW1NlTDWE2plFW
|
||||||
|
qD6CTquA0Ar/1E66lY8OMtrdpxTmchirmoISWN0BD7r2tV9T/kHs44Sy3raAfkR5
|
||||||
|
ixYF5FRkb63FdIAtoynsxS6MEE26fgWuDAa1xwNt+t/uivnpfJk25htpBNkKGT8i
|
||||||
|
i0TPPLn1N15hMHenT6PzWVjGjQxWcp4dUA4gXTDuqaeu7Oy7Ku2yP90/ra+cjTV8
|
||||||
|
DnBJ9enQhAfu1LivJO3FgmXeuC3uqhhM3t9ZbNy7tvJI5PXDCaS8iesBvCp5carT
|
||||||
|
SXWLpFEgvIhXQIsXtxezKAP3gRd8r5JPQI9FZlxyUcyf+Htkn2A4qyKhFElnP1z9
|
||||||
|
j0YLFhL/gQMdtNIY7yhSb29PyuCG7noz25swrfxbA7ZVppM0J19JNhlpqmusBKLB
|
||||||
|
NqN+KMD8EDli7NLX17S9Dj2pQF9I8fVXPEhkdTb67rr7y3OUANKjh0Opnt3JLoj9
|
||||||
|
u1X7BfCeUSR/qq3E8RFPeyxvP1tc5QVqKBG6UPBo8nLQqdzJhUd8a1YEfXIUbdHL
|
||||||
|
s2q5WVFu2MDavIp634+fzfcIFRoBtdxf5aCdxLaLocsA/aLLyL1pK6K0rpdrSUtc
|
||||||
|
EBMST26qIlU0Ht+SQtaMdE2gyjkMM5RpLh1q/gpow+0j3zu6f5tDsu3qwgjLIx78
|
||||||
|
YCTGUuCpsVMzFK4tahYSPNkCAwEAAQ==
|
||||||
|
-----END rsa public key-----
|
||||||
@@ -0,0 +1,14 @@
|
|||||||
|
-----BEGIN rsa public key-----
|
||||||
|
MIICIjANBgkqhkiG9w0BAQEFAAOCAg8AMIICCgKCAgEA4TSGNCTws7pRURptw911
|
||||||
|
vSr9rISCcjSgpjxVFtxkDpri/L+QHwDaDpTnAx2FKfFkBbYNklSl3JtY4vZQ8hND
|
||||||
|
vfHbwt+PagbNaeiu5l1agl7s2ssWSXQ2dIKx45gtQxsuvAVGvmdgVEuyt/UwJrHg
|
||||||
|
cyt5cqYejtRI5rcj509Pxegb3B84gkPwgy6xb2jYWBZ+pi6aLdm2TGX8SCsbCJcO
|
||||||
|
5SD3GFI4fG9OhsSaToD0/OSYzIbQ8WP6D7KX3y5tVHFqV6eFHT2ZIskDRzN8z6cD
|
||||||
|
xp+K2QcCtv5F7yqnjVBYbnk0dmC/woAaNMgvpSaC94cv0oFOS1TWivZDgpLkUJL2
|
||||||
|
hu4V1xGflkHVAdz/DlSUIfiJ47sLHOHnjBQXY81ruh10Xwf7Sh0P9TfNod0KITSZ
|
||||||
|
aqXljYaomEfMOXHn8t1xxy6mAF/cZf/nSmXn+r3ue+cYHxPD0sHYQQqCCAAsNO/V
|
||||||
|
T0Z1NXzjLwc497LwrfXnin0J2EGDyNQf2LKCj8JhICRw72tMrzp8XAHodfxWNQzP
|
||||||
|
L26k7ZzIGUUmlMn7ku0WcU2BsiGnSXNPlFmeOqOzfdmgmiERbQPd3uzZ3a7pxhWl
|
||||||
|
KGZSakZPEJeZHDEobmm+uBkr4OzIgc/jBNp3xa3wXiPxftzoPB3TpUQdN/mgW/De
|
||||||
|
HMS7V56ie3vqYZQG1vUC7rsCAwEAAQ==
|
||||||
|
-----END rsa public key-----
|
||||||
@@ -7,6 +7,7 @@ package datastructure
|
|||||||
import (
|
import (
|
||||||
"fmt"
|
"fmt"
|
||||||
"hash/fnv"
|
"hash/fnv"
|
||||||
|
"reflect"
|
||||||
)
|
)
|
||||||
|
|
||||||
var defaultMapCapacity uint64 = 1 << 10
|
var defaultMapCapacity uint64 = 1 << 10
|
||||||
@@ -45,13 +46,24 @@ func NewHashMapWithCapacity(size, capacity uint64) *HashMap {
|
|||||||
func (hm *HashMap) Get(key any) any {
|
func (hm *HashMap) Get(key any) any {
|
||||||
hashValue := hm.hash(key)
|
hashValue := hm.hash(key)
|
||||||
node := hm.table[hashValue]
|
node := hm.table[hashValue]
|
||||||
if node != nil {
|
for node != nil {
|
||||||
return node.value
|
if reflect.DeepEqual(node.key, key) {
|
||||||
|
return node.value
|
||||||
|
}
|
||||||
|
node = node.next
|
||||||
}
|
}
|
||||||
|
|
||||||
return nil
|
return nil
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// GetOrDefault return the value of given key in hashmap, if not found return default value
|
||||||
|
func (hm *HashMap) GetOrDefault(key any, defaultValue any) any {
|
||||||
|
value := hm.Get(key)
|
||||||
|
if value == nil {
|
||||||
|
return defaultValue
|
||||||
|
}
|
||||||
|
return value
|
||||||
|
}
|
||||||
|
|
||||||
// Put new key value in hashmap
|
// Put new key value in hashmap
|
||||||
func (hm *HashMap) Put(key any, value any) {
|
func (hm *HashMap) Put(key any, value any) {
|
||||||
hm.putValue(hm.hash(key), key, value)
|
hm.putValue(hm.hash(key), key, value)
|
||||||
@@ -90,7 +102,13 @@ func (hm *HashMap) Delete(key any) {
|
|||||||
// Contains checks if given key is in hashmap or not
|
// Contains checks if given key is in hashmap or not
|
||||||
func (hm *HashMap) Contains(key any) bool {
|
func (hm *HashMap) Contains(key any) bool {
|
||||||
node := hm.table[hm.hash(key)]
|
node := hm.table[hm.hash(key)]
|
||||||
return node != nil
|
for node != nil {
|
||||||
|
if reflect.DeepEqual(node.key, key) {
|
||||||
|
return true
|
||||||
|
}
|
||||||
|
node = node.next
|
||||||
|
}
|
||||||
|
return false
|
||||||
}
|
}
|
||||||
|
|
||||||
// Iterate executes iteratee funcation for every key and value pair of hashmap (random order)
|
// Iterate executes iteratee funcation for every key and value pair of hashmap (random order)
|
||||||
@@ -105,6 +123,25 @@ func (hm *HashMap) Iterate(iteratee func(key, value any)) {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// FilterByValue returns a filtered HashMap.
|
||||||
|
// If any value is not matching the perdicate function then it returns nil
|
||||||
|
// otherwise it returns the HashMap with selected values.
|
||||||
|
func (hm *HashMap) FilterByValue(perdicate func(value any) bool) *HashMap {
|
||||||
|
var filteredHM *HashMap
|
||||||
|
if hm.size > 0 {
|
||||||
|
for i := 0; i < len(hm.table); i++ {
|
||||||
|
item := hm.table[i]
|
||||||
|
if item != nil && perdicate(item.value) {
|
||||||
|
if filteredHM == nil {
|
||||||
|
filteredHM = NewHashMap()
|
||||||
|
}
|
||||||
|
filteredHM.Put(item.key, item.value)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return filteredHM
|
||||||
|
}
|
||||||
|
|
||||||
// Keys returns a slice of the hashmap's keys (random order)
|
// Keys returns a slice of the hashmap's keys (random order)
|
||||||
func (hm *HashMap) Keys() []any {
|
func (hm *HashMap) Keys() []any {
|
||||||
keys := make([]any, int(hm.size))
|
keys := make([]any, int(hm.size))
|
||||||
@@ -150,6 +187,11 @@ func (hm *HashMap) resize() {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// Size returns current size of Hashmap
|
||||||
|
func (hm *HashMap) Size() uint64 {
|
||||||
|
return hm.size
|
||||||
|
}
|
||||||
|
|
||||||
func (hm *HashMap) hash(key any) uint64 {
|
func (hm *HashMap) hash(key any) uint64 {
|
||||||
h := fnv.New64a()
|
h := fnv.New64a()
|
||||||
_, _ = h.Write([]byte(fmt.Sprintf("%v", key)))
|
_, _ = h.Write([]byte(fmt.Sprintf("%v", key)))
|
||||||
|
|||||||
@@ -32,6 +32,8 @@ func TestHashMap_Resize(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestHashMap_Delete(t *testing.T) {
|
func TestHashMap_Delete(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestHashMap_Delete")
|
assert := internal.NewAssert(t, "TestHashMap_Delete")
|
||||||
|
|
||||||
hm := NewHashMap()
|
hm := NewHashMap()
|
||||||
@@ -44,6 +46,8 @@ func TestHashMap_Delete(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestHashMap_Contains(t *testing.T) {
|
func TestHashMap_Contains(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestHashMap_Contains")
|
assert := internal.NewAssert(t, "TestHashMap_Contains")
|
||||||
|
|
||||||
hm := NewHashMap()
|
hm := NewHashMap()
|
||||||
@@ -54,6 +58,8 @@ func TestHashMap_Contains(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestHashMap_KeysValues(t *testing.T) {
|
func TestHashMap_KeysValues(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestHashMap_KeysValues")
|
assert := internal.NewAssert(t, "TestHashMap_KeysValues")
|
||||||
|
|
||||||
hm := NewHashMap()
|
hm := NewHashMap()
|
||||||
@@ -68,3 +74,55 @@ func TestHashMap_KeysValues(t *testing.T) {
|
|||||||
assert.Equal(3, len(values))
|
assert.Equal(3, len(values))
|
||||||
assert.Equal(3, len(keys))
|
assert.Equal(3, len(keys))
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func TestHashMap_Keys(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestHashMap_Keys")
|
||||||
|
|
||||||
|
hm := NewHashMap()
|
||||||
|
|
||||||
|
hm.Put("a", 1)
|
||||||
|
hm.Put("b", 2)
|
||||||
|
hm.Put("c", 3)
|
||||||
|
|
||||||
|
keys := hm.Keys()
|
||||||
|
|
||||||
|
assert.Equal(3, len(keys))
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestHashMap_GetOrDefault(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestHashMap_GetOrDefault")
|
||||||
|
|
||||||
|
hm := NewHashMap()
|
||||||
|
|
||||||
|
hm.Put("a", 1)
|
||||||
|
hm.Put("b", 2)
|
||||||
|
hm.Put("c", 3)
|
||||||
|
|
||||||
|
assert.Equal(1, hm.GetOrDefault("a", 5))
|
||||||
|
assert.Equal(5, hm.GetOrDefault("d", 5))
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestHashMap_FilterByValue(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestHashMap_FilterByValue")
|
||||||
|
|
||||||
|
hm := NewHashMap()
|
||||||
|
|
||||||
|
hm.Put("a", 1)
|
||||||
|
hm.Put("b", 2)
|
||||||
|
hm.Put("c", 3)
|
||||||
|
hm.Put("d", 4)
|
||||||
|
hm.Put("e", 5)
|
||||||
|
hm.Put("f", 6)
|
||||||
|
|
||||||
|
filteredHM := hm.FilterByValue(func(value any) bool {
|
||||||
|
return value.(int) == 1 || value.(int) == 3
|
||||||
|
})
|
||||||
|
|
||||||
|
assert.Equal(uint64(2), filteredHM.Size())
|
||||||
|
}
|
||||||
@@ -7,18 +7,18 @@ package datastructure
|
|||||||
import (
|
import (
|
||||||
"fmt"
|
"fmt"
|
||||||
|
|
||||||
"github.com/duke-git/lancet/v2/lancetconstraints"
|
"github.com/duke-git/lancet/v2/constraints"
|
||||||
)
|
)
|
||||||
|
|
||||||
// MaxHeap implements a binary max heap
|
// MaxHeap implements a binary max heap
|
||||||
// type T should implements Compare function in lancetconstraints.Comparator interface.
|
// type T should implements Compare function in constraints.Comparator interface.
|
||||||
type MaxHeap[T any] struct {
|
type MaxHeap[T any] struct {
|
||||||
data []T
|
data []T
|
||||||
comparator lancetconstraints.Comparator
|
comparator constraints.Comparator
|
||||||
}
|
}
|
||||||
|
|
||||||
// NewMaxHeap returns a MaxHeap instance with the given comparator.
|
// NewMaxHeap returns a MaxHeap instance with the given comparator.
|
||||||
func NewMaxHeap[T any](comparator lancetconstraints.Comparator) *MaxHeap[T] {
|
func NewMaxHeap[T any](comparator constraints.Comparator) *MaxHeap[T] {
|
||||||
return &MaxHeap[T]{
|
return &MaxHeap[T]{
|
||||||
data: make([]T, 0),
|
data: make([]T, 0),
|
||||||
comparator: comparator,
|
comparator: comparator,
|
||||||
@@ -26,7 +26,7 @@ func NewMaxHeap[T any](comparator lancetconstraints.Comparator) *MaxHeap[T] {
|
|||||||
}
|
}
|
||||||
|
|
||||||
// BuildMaxHeap builds a MaxHeap instance with data and given comparator.
|
// BuildMaxHeap builds a MaxHeap instance with data and given comparator.
|
||||||
func BuildMaxHeap[T any](data []T, comparator lancetconstraints.Comparator) *MaxHeap[T] {
|
func BuildMaxHeap[T any](data []T, comparator constraints.Comparator) *MaxHeap[T] {
|
||||||
heap := &MaxHeap[T]{
|
heap := &MaxHeap[T]{
|
||||||
data: make([]T, 0, len(data)),
|
data: make([]T, 0, len(data)),
|
||||||
comparator: comparator,
|
comparator: comparator,
|
||||||
|
|||||||
@@ -21,6 +21,8 @@ func (c *intComparator) Compare(v1, v2 any) int {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestMaxHeap_BuildMaxHeap(t *testing.T) {
|
func TestMaxHeap_BuildMaxHeap(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestMaxHeap_BuildMaxHeap")
|
assert := internal.NewAssert(t, "TestMaxHeap_BuildMaxHeap")
|
||||||
|
|
||||||
values := []int{6, 5, 2, 4, 7, 10, 12, 1, 3, 8, 9, 11}
|
values := []int{6, 5, 2, 4, 7, 10, 12, 1, 3, 8, 9, 11}
|
||||||
@@ -33,6 +35,8 @@ func TestMaxHeap_BuildMaxHeap(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestMaxHeap_Push(t *testing.T) {
|
func TestMaxHeap_Push(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestMaxHeap_Push")
|
assert := internal.NewAssert(t, "TestMaxHeap_Push")
|
||||||
|
|
||||||
heap := NewMaxHeap[int](&intComparator{})
|
heap := NewMaxHeap[int](&intComparator{})
|
||||||
@@ -51,6 +55,8 @@ func TestMaxHeap_Push(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestMaxHeap_Pop(t *testing.T) {
|
func TestMaxHeap_Pop(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestMaxHeap_Pop")
|
assert := internal.NewAssert(t, "TestMaxHeap_Pop")
|
||||||
|
|
||||||
heap := NewMaxHeap[int](&intComparator{})
|
heap := NewMaxHeap[int](&intComparator{})
|
||||||
@@ -70,6 +76,8 @@ func TestMaxHeap_Pop(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestMaxHeap_Peek(t *testing.T) {
|
func TestMaxHeap_Peek(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestMaxHeap_Peek")
|
assert := internal.NewAssert(t, "TestMaxHeap_Peek")
|
||||||
|
|
||||||
heap := NewMaxHeap[int](&intComparator{})
|
heap := NewMaxHeap[int](&intComparator{})
|
||||||
|
|||||||
@@ -209,7 +209,7 @@ func (dl *DoublyLink[T]) Size() int {
|
|||||||
|
|
||||||
// Values return slice of all doubly linklist node value
|
// Values return slice of all doubly linklist node value
|
||||||
func (dl *DoublyLink[T]) Values() []T {
|
func (dl *DoublyLink[T]) Values() []T {
|
||||||
result := []T{}
|
result := make([]T, 0, dl.length)
|
||||||
current := dl.Head
|
current := dl.Head
|
||||||
for current != nil {
|
for current != nil {
|
||||||
result = append(result, current.Value)
|
result = append(result, current.Value)
|
||||||
|
|||||||
@@ -7,6 +7,8 @@ import (
|
|||||||
)
|
)
|
||||||
|
|
||||||
func TestDoublyLink_InsertAtFirst(t *testing.T) {
|
func TestDoublyLink_InsertAtFirst(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestDoublyLink_InsertAtFirst")
|
assert := internal.NewAssert(t, "TestDoublyLink_InsertAtFirst")
|
||||||
|
|
||||||
link := NewDoublyLink[int]()
|
link := NewDoublyLink[int]()
|
||||||
@@ -22,6 +24,8 @@ func TestDoublyLink_InsertAtFirst(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestDoublyLink_InsertAtTail(t *testing.T) {
|
func TestDoublyLink_InsertAtTail(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestDoublyLink_InsertAtTail")
|
assert := internal.NewAssert(t, "TestDoublyLink_InsertAtTail")
|
||||||
|
|
||||||
link := NewDoublyLink[int]()
|
link := NewDoublyLink[int]()
|
||||||
@@ -37,12 +41,12 @@ func TestDoublyLink_InsertAtTail(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestDoublyLink_InsertAt(t *testing.T) {
|
func TestDoublyLink_InsertAt(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestDoublyLink_InsertAt")
|
assert := internal.NewAssert(t, "TestDoublyLink_InsertAt")
|
||||||
|
|
||||||
link := NewDoublyLink[int]()
|
link := NewDoublyLink[int]()
|
||||||
|
|
||||||
link.InsertAt(1, 1) //do nothing
|
link.InsertAt(1, 1) //do nothing
|
||||||
|
|
||||||
link.InsertAt(0, 1)
|
link.InsertAt(0, 1)
|
||||||
link.InsertAt(1, 2)
|
link.InsertAt(1, 2)
|
||||||
link.InsertAt(2, 4)
|
link.InsertAt(2, 4)
|
||||||
@@ -55,6 +59,8 @@ func TestDoublyLink_InsertAt(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestDoublyLink_DeleteAtHead(t *testing.T) {
|
func TestDoublyLink_DeleteAtHead(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestDoublyLink_DeleteAtHead")
|
assert := internal.NewAssert(t, "TestDoublyLink_DeleteAtHead")
|
||||||
|
|
||||||
link := NewDoublyLink[int]()
|
link := NewDoublyLink[int]()
|
||||||
@@ -74,6 +80,8 @@ func TestDoublyLink_DeleteAtHead(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestDoublyLink_DeleteAtTail(t *testing.T) {
|
func TestDoublyLink_DeleteAtTail(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestDoublyLink_DeleteAtTail")
|
assert := internal.NewAssert(t, "TestDoublyLink_DeleteAtTail")
|
||||||
|
|
||||||
link := NewDoublyLink[int]()
|
link := NewDoublyLink[int]()
|
||||||
@@ -93,6 +101,8 @@ func TestDoublyLink_DeleteAtTail(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestDoublyLink_DeleteAt(t *testing.T) {
|
func TestDoublyLink_DeleteAt(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestDoublyLink_DeleteAt")
|
assert := internal.NewAssert(t, "TestDoublyLink_DeleteAt")
|
||||||
|
|
||||||
link := NewDoublyLink[int]()
|
link := NewDoublyLink[int]()
|
||||||
@@ -116,6 +126,8 @@ func TestDoublyLink_DeleteAt(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestDoublyLink_Reverse(t *testing.T) {
|
func TestDoublyLink_Reverse(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestDoublyLink_Reverse")
|
assert := internal.NewAssert(t, "TestDoublyLink_Reverse")
|
||||||
|
|
||||||
link := NewDoublyLink[int]()
|
link := NewDoublyLink[int]()
|
||||||
@@ -130,6 +142,8 @@ func TestDoublyLink_Reverse(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestDoublyLink_GetMiddleNode(t *testing.T) {
|
func TestDoublyLink_GetMiddleNode(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestDoublyLink_GetMiddleNode")
|
assert := internal.NewAssert(t, "TestDoublyLink_GetMiddleNode")
|
||||||
|
|
||||||
link := NewDoublyLink[int]()
|
link := NewDoublyLink[int]()
|
||||||
@@ -149,10 +163,11 @@ func TestDoublyLink_GetMiddleNode(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestDoublyLink_Clear(t *testing.T) {
|
func TestDoublyLink_Clear(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestDoublyLink_Clear")
|
assert := internal.NewAssert(t, "TestDoublyLink_Clear")
|
||||||
|
|
||||||
link := NewDoublyLink[int]()
|
link := NewDoublyLink[int]()
|
||||||
|
|
||||||
assert.Equal(true, link.IsEmpty())
|
assert.Equal(true, link.IsEmpty())
|
||||||
assert.Equal(0, link.Size())
|
assert.Equal(0, link.Size())
|
||||||
|
|
||||||
|
|||||||
@@ -212,7 +212,7 @@ func (sl *SinglyLink[T]) Size() int {
|
|||||||
|
|
||||||
// Values return slice of all singly linklist node value
|
// Values return slice of all singly linklist node value
|
||||||
func (sl *SinglyLink[T]) Values() []T {
|
func (sl *SinglyLink[T]) Values() []T {
|
||||||
result := []T{}
|
result := make([]T, 0, sl.length)
|
||||||
current := sl.Head
|
current := sl.Head
|
||||||
for current != nil {
|
for current != nil {
|
||||||
result = append(result, current.Value)
|
result = append(result, current.Value)
|
||||||
|
|||||||
@@ -7,13 +7,14 @@ import (
|
|||||||
)
|
)
|
||||||
|
|
||||||
func TestSinglyLink_InsertAtFirst(t *testing.T) {
|
func TestSinglyLink_InsertAtFirst(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestSinglyLink_InsertAtFirst")
|
assert := internal.NewAssert(t, "TestSinglyLink_InsertAtFirst")
|
||||||
|
|
||||||
link := NewSinglyLink[int]()
|
link := NewSinglyLink[int]()
|
||||||
link.InsertAtHead(1)
|
link.InsertAtHead(1)
|
||||||
link.InsertAtHead(2)
|
link.InsertAtHead(2)
|
||||||
link.InsertAtHead(3)
|
link.InsertAtHead(3)
|
||||||
link.Print()
|
|
||||||
|
|
||||||
expected := []int{3, 2, 1}
|
expected := []int{3, 2, 1}
|
||||||
values := link.Values()
|
values := link.Values()
|
||||||
@@ -22,13 +23,14 @@ func TestSinglyLink_InsertAtFirst(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestSinglyLink_InsertAtTail(t *testing.T) {
|
func TestSinglyLink_InsertAtTail(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestSinglyLink_InsertAtTail")
|
assert := internal.NewAssert(t, "TestSinglyLink_InsertAtTail")
|
||||||
|
|
||||||
link := NewSinglyLink[int]()
|
link := NewSinglyLink[int]()
|
||||||
link.InsertAtTail(1)
|
link.InsertAtTail(1)
|
||||||
link.InsertAtTail(2)
|
link.InsertAtTail(2)
|
||||||
link.InsertAtTail(3)
|
link.InsertAtTail(3)
|
||||||
link.Print()
|
|
||||||
|
|
||||||
expected := []int{1, 2, 3}
|
expected := []int{1, 2, 3}
|
||||||
values := link.Values()
|
values := link.Values()
|
||||||
@@ -37,6 +39,8 @@ func TestSinglyLink_InsertAtTail(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestSinglyLink_InsertAt(t *testing.T) {
|
func TestSinglyLink_InsertAt(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestSinglyLink_InsertAt")
|
assert := internal.NewAssert(t, "TestSinglyLink_InsertAt")
|
||||||
|
|
||||||
link := NewSinglyLink[int]()
|
link := NewSinglyLink[int]()
|
||||||
@@ -57,6 +61,8 @@ func TestSinglyLink_InsertAt(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestSinglyLink_DeleteAtHead(t *testing.T) {
|
func TestSinglyLink_DeleteAtHead(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestSinglyLink_DeleteAtHead")
|
assert := internal.NewAssert(t, "TestSinglyLink_DeleteAtHead")
|
||||||
|
|
||||||
link := NewSinglyLink[int]()
|
link := NewSinglyLink[int]()
|
||||||
@@ -69,7 +75,6 @@ func TestSinglyLink_DeleteAtHead(t *testing.T) {
|
|||||||
link.InsertAtTail(4)
|
link.InsertAtTail(4)
|
||||||
|
|
||||||
link.DeleteAtHead()
|
link.DeleteAtHead()
|
||||||
link.Print()
|
|
||||||
|
|
||||||
expected := []int{2, 3, 4}
|
expected := []int{2, 3, 4}
|
||||||
values := link.Values()
|
values := link.Values()
|
||||||
@@ -78,10 +83,11 @@ func TestSinglyLink_DeleteAtHead(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestSinglyLink_DeleteAtTail(t *testing.T) {
|
func TestSinglyLink_DeleteAtTail(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestSinglyLink_DeleteAtTail")
|
assert := internal.NewAssert(t, "TestSinglyLink_DeleteAtTail")
|
||||||
|
|
||||||
link := NewSinglyLink[int]()
|
link := NewSinglyLink[int]()
|
||||||
|
|
||||||
link.InsertAtTail(1)
|
link.InsertAtTail(1)
|
||||||
link.InsertAtTail(2)
|
link.InsertAtTail(2)
|
||||||
link.InsertAtTail(3)
|
link.InsertAtTail(3)
|
||||||
@@ -96,10 +102,11 @@ func TestSinglyLink_DeleteAtTail(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestSinglyLink_DeleteValue(t *testing.T) {
|
func TestSinglyLink_DeleteValue(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestSinglyLink_DeleteValue")
|
assert := internal.NewAssert(t, "TestSinglyLink_DeleteValue")
|
||||||
|
|
||||||
link := NewSinglyLink[int]()
|
link := NewSinglyLink[int]()
|
||||||
|
|
||||||
link.InsertAtTail(1)
|
link.InsertAtTail(1)
|
||||||
link.InsertAtTail(2)
|
link.InsertAtTail(2)
|
||||||
link.InsertAtTail(2)
|
link.InsertAtTail(2)
|
||||||
@@ -114,10 +121,11 @@ func TestSinglyLink_DeleteValue(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestSinglyLink_DeleteAt(t *testing.T) {
|
func TestSinglyLink_DeleteAt(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestSinglyLink_DeleteAt")
|
assert := internal.NewAssert(t, "TestSinglyLink_DeleteAt")
|
||||||
|
|
||||||
link := NewSinglyLink[int]()
|
link := NewSinglyLink[int]()
|
||||||
|
|
||||||
link.InsertAtTail(1)
|
link.InsertAtTail(1)
|
||||||
link.InsertAtTail(2)
|
link.InsertAtTail(2)
|
||||||
link.InsertAtTail(3)
|
link.InsertAtTail(3)
|
||||||
@@ -136,6 +144,8 @@ func TestSinglyLink_DeleteAt(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestSinglyLink_Reverse(t *testing.T) {
|
func TestSinglyLink_Reverse(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestSinglyLink_Reverse")
|
assert := internal.NewAssert(t, "TestSinglyLink_Reverse")
|
||||||
|
|
||||||
link := NewSinglyLink[int]()
|
link := NewSinglyLink[int]()
|
||||||
@@ -149,6 +159,8 @@ func TestSinglyLink_Reverse(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestSinglyLink_GetMiddleNode(t *testing.T) {
|
func TestSinglyLink_GetMiddleNode(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestSinglyLink_GetMiddleNode")
|
assert := internal.NewAssert(t, "TestSinglyLink_GetMiddleNode")
|
||||||
|
|
||||||
link := NewSinglyLink[int]()
|
link := NewSinglyLink[int]()
|
||||||
@@ -163,6 +175,7 @@ func TestSinglyLink_GetMiddleNode(t *testing.T) {
|
|||||||
link.InsertAtTail(5)
|
link.InsertAtTail(5)
|
||||||
link.InsertAtTail(6)
|
link.InsertAtTail(6)
|
||||||
link.InsertAtTail(7)
|
link.InsertAtTail(7)
|
||||||
|
|
||||||
middle2 := link.GetMiddleNode()
|
middle2 := link.GetMiddleNode()
|
||||||
assert.Equal(4, middle2.Value)
|
assert.Equal(4, middle2.Value)
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -0,0 +1,379 @@
|
|||||||
|
package datastructure
|
||||||
|
|
||||||
|
import (
|
||||||
|
"reflect"
|
||||||
|
"sort"
|
||||||
|
"sync"
|
||||||
|
)
|
||||||
|
|
||||||
|
type CopyOnWriteList[T any] struct {
|
||||||
|
data []T
|
||||||
|
lock sync.Locker
|
||||||
|
}
|
||||||
|
|
||||||
|
// NewCopyOnWriteList Creates an empty list.
|
||||||
|
func NewCopyOnWriteList[T any](data []T) *CopyOnWriteList[T] {
|
||||||
|
return &CopyOnWriteList[T]{data: data, lock: &sync.RWMutex{}}
|
||||||
|
}
|
||||||
|
|
||||||
|
func (c *CopyOnWriteList[T]) getList() []T {
|
||||||
|
return c.data
|
||||||
|
}
|
||||||
|
func (c *CopyOnWriteList[T]) setList(data []T) {
|
||||||
|
c.data = data
|
||||||
|
}
|
||||||
|
|
||||||
|
// Size returns the number of elements in this list.
|
||||||
|
func (c *CopyOnWriteList[T]) Size() int {
|
||||||
|
return len(c.getList())
|
||||||
|
}
|
||||||
|
|
||||||
|
// IsEmpty returns true if this list contains no elements.
|
||||||
|
func (c *CopyOnWriteList[T]) IsEmpty() bool {
|
||||||
|
return c.Size() == 0
|
||||||
|
}
|
||||||
|
|
||||||
|
// Contain returns true if this list contains the specified element.
|
||||||
|
func (c *CopyOnWriteList[T]) Contain(e T) bool {
|
||||||
|
list := c.getList()
|
||||||
|
return indexOf(e, list, 0, c.Size()) >= 0
|
||||||
|
}
|
||||||
|
|
||||||
|
// ValueOf returns the index of the first occurrence of the specified element in this list, or null if this list does not contain the element.
|
||||||
|
func (c *CopyOnWriteList[T]) ValueOf(index int) (*T, bool) {
|
||||||
|
list := c.getList()
|
||||||
|
if index < 0 || index >= len(c.data) {
|
||||||
|
return nil, false
|
||||||
|
}
|
||||||
|
return get(list, index), true
|
||||||
|
}
|
||||||
|
|
||||||
|
// IndexOf returns the index of the first occurrence of the specified element in this list, or -1 if this list does not contain the element.
|
||||||
|
func (c *CopyOnWriteList[T]) IndexOf(e T) int {
|
||||||
|
list := c.getList()
|
||||||
|
return indexOf(e, list, 0, c.Size())
|
||||||
|
}
|
||||||
|
|
||||||
|
// indexOf returns the index of the first occurrence of the specified element in this list, or -1 if this list does not contain the element.
|
||||||
|
// start the start position of the search (inclusive)
|
||||||
|
// end the end position of the search (exclusive)
|
||||||
|
func indexOf[T any](o T, e []T, start int, end int) int {
|
||||||
|
if start >= end {
|
||||||
|
return -1
|
||||||
|
}
|
||||||
|
for i := start; i < end; i++ {
|
||||||
|
if reflect.DeepEqual(e[i], o) {
|
||||||
|
return i
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return -1
|
||||||
|
}
|
||||||
|
|
||||||
|
// LastIndexOf returns the index of the last occurrence of the specified element in this list, or -1 if this list does not contain the element.
|
||||||
|
func (c *CopyOnWriteList[T]) LastIndexOf(e T) int {
|
||||||
|
list := c.getList()
|
||||||
|
return lastIndexOf(e, list, 0, c.Size())
|
||||||
|
}
|
||||||
|
|
||||||
|
// lastIndexOf returns the index of the last occurrence of the specified element in this list, or -1 if this list does not contain the element.
|
||||||
|
// start the start position of the search (inclusive)
|
||||||
|
// end the end position of the search (exclusive)
|
||||||
|
func lastIndexOf[T any](o T, e []T, start int, end int) int {
|
||||||
|
if start >= end {
|
||||||
|
return -1
|
||||||
|
}
|
||||||
|
for i := end - 1; i >= start; i-- {
|
||||||
|
if reflect.DeepEqual(e[i], o) {
|
||||||
|
return i
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return -1
|
||||||
|
}
|
||||||
|
|
||||||
|
// LastIndexOfFunc returns the index of the last occurrence of the value in this list satisfying the
|
||||||
|
// functional predicate f(T) bool
|
||||||
|
// if not found return -1.
|
||||||
|
func (l *CopyOnWriteList[T]) LastIndexOfFunc(f func(T) bool) int {
|
||||||
|
index := -1
|
||||||
|
data := l.getList()
|
||||||
|
for i := len(data) - 1; i >= 0; i-- {
|
||||||
|
if f(data[i]) {
|
||||||
|
index = i
|
||||||
|
break
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return index
|
||||||
|
}
|
||||||
|
|
||||||
|
// IndexOfFunc returns the first index satisfying the functional predicate f(v) bool
|
||||||
|
// if not found return -1.
|
||||||
|
func (l *CopyOnWriteList[T]) IndexOfFunc(f func(T) bool) int {
|
||||||
|
index := -1
|
||||||
|
data := l.getList()
|
||||||
|
for i, v := range data {
|
||||||
|
if f(v) {
|
||||||
|
index = i
|
||||||
|
break
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return index
|
||||||
|
}
|
||||||
|
|
||||||
|
// get returns the element at the specified position in this list.
|
||||||
|
func get[T any](o []T, index int) *T {
|
||||||
|
return &o[index]
|
||||||
|
}
|
||||||
|
|
||||||
|
// Get returns the element at the specified position in this list.
|
||||||
|
func (c *CopyOnWriteList[T]) Get(index int) *T {
|
||||||
|
list := c.getList()
|
||||||
|
if index < 0 || index >= len(list) {
|
||||||
|
return nil
|
||||||
|
}
|
||||||
|
return get(list, index)
|
||||||
|
}
|
||||||
|
|
||||||
|
func (c *CopyOnWriteList[T]) set(index int, e T) (oldValue *T) {
|
||||||
|
lock := c.lock
|
||||||
|
lock.Lock()
|
||||||
|
defer lock.Unlock()
|
||||||
|
list := c.getList()
|
||||||
|
oldValue = get(list, index)
|
||||||
|
|
||||||
|
if reflect.DeepEqual(oldValue, e) {
|
||||||
|
c.setList(list)
|
||||||
|
} else {
|
||||||
|
newList := make([]T, len(list))
|
||||||
|
copy(newList, list)
|
||||||
|
newList[index] = e
|
||||||
|
c.setList(newList)
|
||||||
|
}
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
// Set replaces the element at the specified position in this list with the specified element.
|
||||||
|
func (c *CopyOnWriteList[T]) Set(index int, e T) (oldValue *T, ok bool) {
|
||||||
|
list := c.getList()
|
||||||
|
if index < 0 || index >= len(list) {
|
||||||
|
return oldValue, false
|
||||||
|
}
|
||||||
|
return c.set(index, e), true
|
||||||
|
}
|
||||||
|
|
||||||
|
// Add appends the specified element to the end of this list.
|
||||||
|
func (c *CopyOnWriteList[T]) Add(e T) bool {
|
||||||
|
lock := c.lock
|
||||||
|
lock.Lock()
|
||||||
|
defer lock.Unlock()
|
||||||
|
|
||||||
|
list := c.getList()
|
||||||
|
newList := make([]T, len(list)+1)
|
||||||
|
copy(newList, list)
|
||||||
|
newList[len(list)] = e
|
||||||
|
c.setList(newList)
|
||||||
|
return true
|
||||||
|
}
|
||||||
|
|
||||||
|
// AddAll appends all the elements in the specified collection to the end of this list
|
||||||
|
func (c *CopyOnWriteList[T]) AddAll(e []T) bool {
|
||||||
|
lock := c.lock
|
||||||
|
lock.Lock()
|
||||||
|
defer lock.Unlock()
|
||||||
|
|
||||||
|
list := c.getList()
|
||||||
|
newList := make([]T, len(list)+len(e))
|
||||||
|
copy(newList, list)
|
||||||
|
copy(newList[len(list):], e)
|
||||||
|
c.setList(newList)
|
||||||
|
return true
|
||||||
|
}
|
||||||
|
|
||||||
|
// AddByIndex inserts the specified element at the specified position in this list.
|
||||||
|
func (c *CopyOnWriteList[T]) AddByIndex(index int, e T) bool {
|
||||||
|
lock := c.lock
|
||||||
|
lock.Lock()
|
||||||
|
defer lock.Unlock()
|
||||||
|
|
||||||
|
list := c.getList()
|
||||||
|
length := len(list)
|
||||||
|
if index < 0 || index > length {
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
var newList []T
|
||||||
|
var numMove = length - index
|
||||||
|
if numMove == 0 {
|
||||||
|
newList = make([]T, length+1)
|
||||||
|
copy(newList, list)
|
||||||
|
} else {
|
||||||
|
newList = make([]T, length+1)
|
||||||
|
copy(newList, list[:index])
|
||||||
|
copy(newList[index+1:], list[index:])
|
||||||
|
}
|
||||||
|
newList[index] = e
|
||||||
|
c.setList(newList)
|
||||||
|
return true
|
||||||
|
}
|
||||||
|
|
||||||
|
// delete removes the element at the specified position in this list.
|
||||||
|
func (c *CopyOnWriteList[T]) delete(index int) *T {
|
||||||
|
lock := c.lock
|
||||||
|
lock.Lock()
|
||||||
|
defer lock.Unlock()
|
||||||
|
|
||||||
|
list := c.getList()
|
||||||
|
length := len(list)
|
||||||
|
|
||||||
|
oldValue := get(list, index)
|
||||||
|
numMove := length - index - 1
|
||||||
|
var newList []T
|
||||||
|
if numMove == 0 {
|
||||||
|
newList = make([]T, length-1)
|
||||||
|
copy(newList, list[:index])
|
||||||
|
} else {
|
||||||
|
newList = make([]T, length-1)
|
||||||
|
copy(newList, list[:index])
|
||||||
|
copy(newList[index:], list[index+1:])
|
||||||
|
}
|
||||||
|
|
||||||
|
c.setList(newList)
|
||||||
|
return oldValue
|
||||||
|
}
|
||||||
|
|
||||||
|
// DeleteAt removes the element at the specified position in this list.
|
||||||
|
func (c *CopyOnWriteList[T]) DeleteAt(index int) (*T, bool) {
|
||||||
|
list := c.getList()
|
||||||
|
if index < 0 || index >= len(list) {
|
||||||
|
return nil, false
|
||||||
|
}
|
||||||
|
return c.delete(index), true
|
||||||
|
}
|
||||||
|
|
||||||
|
// DeleteBy removes the first occurrence of the specified element from this list, if it is present.
|
||||||
|
func (c *CopyOnWriteList[T]) DeleteBy(o T) (*T, bool) {
|
||||||
|
list := c.getList()
|
||||||
|
index := indexOf(o, list, 0, len(list))
|
||||||
|
if index == -1 {
|
||||||
|
return nil, false
|
||||||
|
}
|
||||||
|
return c.delete(index), true
|
||||||
|
}
|
||||||
|
|
||||||
|
// DeleteRange removes from this list all the elements whose index is between fromIndex, inclusive, and toIndex, exclusive.
|
||||||
|
// left close and right open
|
||||||
|
func (c *CopyOnWriteList[T]) DeleteRange(start int, end int) {
|
||||||
|
lock := c.lock
|
||||||
|
lock.Lock()
|
||||||
|
defer lock.Unlock()
|
||||||
|
|
||||||
|
list := c.getList()
|
||||||
|
length := len(list)
|
||||||
|
if start < 0 || end > length || start > end {
|
||||||
|
return
|
||||||
|
}
|
||||||
|
var newList []T
|
||||||
|
numMove := length - end
|
||||||
|
if numMove == 0 {
|
||||||
|
newList = make([]T, length-(end-start))
|
||||||
|
copy(newList, list[:start])
|
||||||
|
} else {
|
||||||
|
newList = make([]T, length-(end-start))
|
||||||
|
copy(newList, list[:start])
|
||||||
|
copy(newList[start:], list[end:])
|
||||||
|
}
|
||||||
|
c.setList(newList)
|
||||||
|
}
|
||||||
|
|
||||||
|
// DeleteIf removes all the elements of this collection that satisfy the given predicate.
|
||||||
|
func (c *CopyOnWriteList[T]) DeleteIf(f func(T) bool) {
|
||||||
|
lock := c.lock
|
||||||
|
lock.Lock()
|
||||||
|
defer lock.Unlock()
|
||||||
|
|
||||||
|
list := c.getList()
|
||||||
|
length := len(list)
|
||||||
|
var newList []T
|
||||||
|
for i := 0; i < length; i++ {
|
||||||
|
if !f(list[i]) {
|
||||||
|
newList = append(newList, list[i])
|
||||||
|
}
|
||||||
|
}
|
||||||
|
c.setList(newList)
|
||||||
|
}
|
||||||
|
|
||||||
|
// Equal returns true if the specified object is equal to this list.
|
||||||
|
func (c *CopyOnWriteList[T]) Equal(other *[]T) bool {
|
||||||
|
if other == nil {
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
if c.Size() != len(*other) {
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
list := c.getList()
|
||||||
|
otherList := NewCopyOnWriteList(*other).getList()
|
||||||
|
for i := 0; i < len(list); i++ {
|
||||||
|
if !reflect.DeepEqual(list[i], otherList[i]) {
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return true
|
||||||
|
}
|
||||||
|
|
||||||
|
// Clear removes all the elements from this list.
|
||||||
|
func (c *CopyOnWriteList[T]) Clear() {
|
||||||
|
lock := c.lock
|
||||||
|
lock.Lock()
|
||||||
|
defer lock.Unlock()
|
||||||
|
|
||||||
|
list := c.getList()
|
||||||
|
list = make([]T, 0)
|
||||||
|
c.setList(list)
|
||||||
|
}
|
||||||
|
|
||||||
|
// Merge a tow list to one, change the list
|
||||||
|
func (c *CopyOnWriteList[T]) Merge(other []T) {
|
||||||
|
lock := c.lock
|
||||||
|
lock.Lock()
|
||||||
|
defer lock.Unlock()
|
||||||
|
|
||||||
|
list := c.getList()
|
||||||
|
list = append(list, other...)
|
||||||
|
c.setList(list)
|
||||||
|
}
|
||||||
|
|
||||||
|
// ForEach performs the given action for each element of the Iterable until all elements have been processed
|
||||||
|
// or the action throws an exception.
|
||||||
|
func (c *CopyOnWriteList[T]) ForEach(f func(T)) {
|
||||||
|
list := c.getList()
|
||||||
|
for i := 0; i < len(list); i++ {
|
||||||
|
f(list[i])
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
// Sort sorts this list according to the order induced by the specified Comparator.
|
||||||
|
func (c *CopyOnWriteList[T]) Sort(compare func(o1 T, o2 T) bool) {
|
||||||
|
lock := c.lock
|
||||||
|
lock.Lock()
|
||||||
|
list := c.getList()
|
||||||
|
|
||||||
|
sort.Slice(list, func(i, j int) bool {
|
||||||
|
return compare(list[i], list[j])
|
||||||
|
})
|
||||||
|
|
||||||
|
c.setList(list)
|
||||||
|
}
|
||||||
|
|
||||||
|
func (c *CopyOnWriteList[T]) SubList(start int, end int) (newList []T) {
|
||||||
|
lock := c.lock
|
||||||
|
lock.Lock()
|
||||||
|
list := c.getList()
|
||||||
|
length := len(list)
|
||||||
|
defer lock.Unlock()
|
||||||
|
if start < 0 || end > length || start > end {
|
||||||
|
return []T{}
|
||||||
|
}
|
||||||
|
newList = make([]T, end-start)
|
||||||
|
copy(newList, list[start:end])
|
||||||
|
c.setList(newList)
|
||||||
|
return
|
||||||
|
}
|
||||||
@@ -0,0 +1,268 @@
|
|||||||
|
package datastructure
|
||||||
|
|
||||||
|
import (
|
||||||
|
"testing"
|
||||||
|
|
||||||
|
"github.com/duke-git/lancet/v2/internal"
|
||||||
|
)
|
||||||
|
|
||||||
|
func TestCopyOnWriteList_ValueOf(t *testing.T) {
|
||||||
|
list := NewCopyOnWriteList([]int{1, 2, 3, 4, 5})
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "CopyOnWriteList_IndexOf")
|
||||||
|
of, ok := list.ValueOf(3)
|
||||||
|
assert.Equal(4, *of)
|
||||||
|
assert.Equal(true, ok)
|
||||||
|
|
||||||
|
_, ok = list.ValueOf(6)
|
||||||
|
assert.Equal(false, ok)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestCopyOnWriteList_Contain(t *testing.T) {
|
||||||
|
list := NewCopyOnWriteList([]int{1, 2, 3, 4, 5})
|
||||||
|
assert := internal.NewAssert(t, "CopyOnWriteList_Contains")
|
||||||
|
assert.Equal(true, list.Contain(3))
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestCopyOnWriteList_IsEmpty(t *testing.T) {
|
||||||
|
list := NewCopyOnWriteList([]int{})
|
||||||
|
assert := internal.NewAssert(t, "CopyOnWriteList_IsEmpty")
|
||||||
|
assert.Equal(true, list.IsEmpty())
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestCopyOnWriteList_Size(t *testing.T) {
|
||||||
|
list := NewCopyOnWriteList([]int{1, 2, 3, 4, 5})
|
||||||
|
assert := internal.NewAssert(t, "CopyOnWriteList_size")
|
||||||
|
assert.Equal(5, list.Size())
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestCopyOnWriteList_GetList(t *testing.T) {
|
||||||
|
list := NewCopyOnWriteList([]int{1, 2, 3, 4, 5})
|
||||||
|
assert := internal.NewAssert(t, "CopyOnWriteList_GetList")
|
||||||
|
assert.Equal([]int{1, 2, 3, 4, 5}, list.getList())
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestCopyOnWriteList_Get(t *testing.T) {
|
||||||
|
list := NewCopyOnWriteList([]int{1, 2, 3, 4, 5})
|
||||||
|
assert := internal.NewAssert(t, "CopyOnWriteList_Get")
|
||||||
|
i := list.Get(2)
|
||||||
|
assert.Equal(3, *i)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestCopyOnWriteList_Set(t *testing.T) {
|
||||||
|
list := NewCopyOnWriteList([]int{1, 2, 3, 4, 5})
|
||||||
|
assert := internal.NewAssert(t, "CopyOnWriteList_Set")
|
||||||
|
list.Set(2, 6)
|
||||||
|
assert.Equal(6, list.getList()[2])
|
||||||
|
|
||||||
|
list = NewCopyOnWriteList([]int{1, 2, 3, 4, 5})
|
||||||
|
list.Set(0, 6)
|
||||||
|
assert.Equal(6, list.getList()[0])
|
||||||
|
|
||||||
|
list = NewCopyOnWriteList([]int{1, 2, 3, 4, 5})
|
||||||
|
list.Set(0, 1)
|
||||||
|
assert.Equal(1, list.getList()[0])
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestCopyOnWriteList_Add(t *testing.T) {
|
||||||
|
list := NewCopyOnWriteList([]int{1, 2, 3, 4, 5})
|
||||||
|
assert := internal.NewAssert(t, "CopyOnWriteList_Add")
|
||||||
|
list.Add(6)
|
||||||
|
assert.Equal([]int{1, 2, 3, 4, 5, 6}, list.getList())
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestCopyOnWriteList_AddAll(t *testing.T) {
|
||||||
|
list := NewCopyOnWriteList([]int{1, 2, 3, 4, 5})
|
||||||
|
assert := internal.NewAssert(t, "CopyOnWriteList_AddAll")
|
||||||
|
list.AddAll([]int{6, 7, 8})
|
||||||
|
assert.Equal([]int{1, 2, 3, 4, 5, 6, 7, 8}, list.getList())
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestCopyOnWriteList_AddByIndex(t *testing.T) {
|
||||||
|
list := NewCopyOnWriteList([]int{1, 2, 3, 4, 5})
|
||||||
|
assert := internal.NewAssert(t, "CopyOnWriteList_AddByIndex")
|
||||||
|
list.AddByIndex(2, 6)
|
||||||
|
assert.Equal([]int{1, 2, 6, 3, 4, 5}, list.getList())
|
||||||
|
|
||||||
|
list = NewCopyOnWriteList([]int{1, 2, 3, 4, 5})
|
||||||
|
list.AddByIndex(0, 6)
|
||||||
|
assert.Equal([]int{6, 1, 2, 3, 4, 5}, list.getList())
|
||||||
|
|
||||||
|
list = NewCopyOnWriteList([]int{1, 2, 3, 4, 5})
|
||||||
|
list.AddByIndex(5, 6)
|
||||||
|
assert.Equal([]int{1, 2, 3, 4, 5, 6}, list.getList())
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestCopyOnWriteList_DeleteAt2(t *testing.T) {
|
||||||
|
list := NewCopyOnWriteList([]int{1, 2, 3, 4, 5})
|
||||||
|
assert := internal.NewAssert(t, "CopyOnWriteList_RemoveByIndex")
|
||||||
|
list.DeleteAt(2)
|
||||||
|
assert.Equal([]int{1, 2, 4, 5}, list.getList())
|
||||||
|
|
||||||
|
list = NewCopyOnWriteList([]int{1, 2, 3, 4, 5})
|
||||||
|
list.DeleteAt(4)
|
||||||
|
assert.Equal([]int{1, 2, 3, 4}, list.getList())
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestCopyOnWriteList_RemoveByValue(t *testing.T) {
|
||||||
|
list := NewCopyOnWriteList([]int{1, 2, 3, 4, 5})
|
||||||
|
assert := internal.NewAssert(t, "CopyOnWriteList_RemoveByValue")
|
||||||
|
list.DeleteBy(3)
|
||||||
|
assert.Equal([]int{1, 2, 4, 5}, list.getList())
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestCopyOnWriteList_DeleteRange(t *testing.T) {
|
||||||
|
list := NewCopyOnWriteList([]int{1, 2, 3, 4, 5})
|
||||||
|
assert := internal.NewAssert(t, "CopyOnWriteList_RemoveRange")
|
||||||
|
list.DeleteRange(1, 3)
|
||||||
|
assert.Equal([]int{1, 4, 5}, list.getList())
|
||||||
|
|
||||||
|
list = NewCopyOnWriteList([]int{1, 2, 3, 4, 5})
|
||||||
|
list.DeleteRange(0, 5)
|
||||||
|
assert.Equal([]int{}, list.getList())
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestCopyOnWriteList_LastIndexOf(t *testing.T) {
|
||||||
|
list := NewCopyOnWriteList([]int{1, 2, 3, 4, 5, 3})
|
||||||
|
assert := internal.NewAssert(t, "CopyOnWriteList_LastIndexOf")
|
||||||
|
assert.Equal(5, list.LastIndexOf(3))
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestCopyOnWriteList_DeleteAt(t *testing.T) {
|
||||||
|
list := NewCopyOnWriteList([]int{1, 2, 3, 4, 5, 3})
|
||||||
|
assert := internal.NewAssert(t, "CopyOnWriteList_DeleteAt")
|
||||||
|
list.DeleteAt(2)
|
||||||
|
assert.Equal([]int{1, 2, 4, 5, 3}, list.getList())
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestCopyOnWriteList_DeleteBy(t *testing.T) {
|
||||||
|
list := NewCopyOnWriteList([]int{1, 2, 3, 4, 5, 3})
|
||||||
|
assert := internal.NewAssert(t, "CopyOnWriteList_DeleteBy")
|
||||||
|
list.DeleteBy(3)
|
||||||
|
assert.Equal([]int{1, 2, 4, 5, 3}, list.getList())
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestCopyOnWriteList_DeleteIf(t *testing.T) {
|
||||||
|
list := NewCopyOnWriteList([]int{1, 2, 3, 4, 5, 3, 6})
|
||||||
|
assert := internal.NewAssert(t, "CopyOnWriteList_DeleteIf")
|
||||||
|
|
||||||
|
list.DeleteIf(func(i int) bool {
|
||||||
|
return i%2 == 0
|
||||||
|
})
|
||||||
|
|
||||||
|
assert.Equal([]int{1, 3, 5, 3}, list.getList())
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestCopyOnWriteList_Equal(t *testing.T) {
|
||||||
|
list := NewCopyOnWriteList([]int{1, 2, 3, 4, 5, 3, 6})
|
||||||
|
assert := internal.NewAssert(t, "CopyOnWriteList_Equal")
|
||||||
|
|
||||||
|
assert.Equal(true, list.Equal(&[]int{1, 2, 3, 4, 5, 3, 6}))
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestCopyOnWriteList_ForEach(t *testing.T) {
|
||||||
|
testList := make([]int, 0)
|
||||||
|
list := NewCopyOnWriteList([]int{1, 2, 3, 4, 5, 3, 6})
|
||||||
|
assert := internal.NewAssert(t, "CopyOnWriteList_ForEach")
|
||||||
|
|
||||||
|
list.ForEach(func(i int) {
|
||||||
|
testList = append(testList, i)
|
||||||
|
})
|
||||||
|
assert.Equal([]int{1, 2, 3, 4, 5, 3, 6}, testList)
|
||||||
|
|
||||||
|
list.ForEach(func(i int) {
|
||||||
|
list.Add(i)
|
||||||
|
})
|
||||||
|
assert.Equal([]int{1, 2, 3, 4, 5, 3, 6, 1, 2, 3, 4, 5, 3, 6}, list.getList())
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestCopyOnWriteList_Clear(t *testing.T) {
|
||||||
|
list := NewCopyOnWriteList([]int{1, 2, 3, 4, 5, 3, 6})
|
||||||
|
assert := internal.NewAssert(t, "CopyOnWriteList_Clear")
|
||||||
|
|
||||||
|
list.Clear()
|
||||||
|
assert.Equal([]int{}, list.getList())
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestCopyOnWriteList_Merge(t *testing.T) {
|
||||||
|
list := NewCopyOnWriteList([]int{1, 3, 5, 7, 9})
|
||||||
|
assert := internal.NewAssert(t, "CopyOnWriteList_Merge")
|
||||||
|
|
||||||
|
list.Merge([]int{2, 4, 6, 8, 10})
|
||||||
|
assert.Equal([]int{1, 3, 5, 7, 9, 2, 4, 6, 8, 10}, list.getList())
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestCopyOnWriteList_Sort(t *testing.T) {
|
||||||
|
list := NewCopyOnWriteList([]int{1, 3, 5, 7, 9, 2, 4, 6, 8, 10})
|
||||||
|
assert := internal.NewAssert(t, "CopyOnWriteList_Sort")
|
||||||
|
|
||||||
|
list.Sort(func(i, j int) bool {
|
||||||
|
return i < j
|
||||||
|
})
|
||||||
|
assert.Equal([]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, list.getList())
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestCopyOnWriteList_IndexOf(t *testing.T) {
|
||||||
|
list := NewCopyOnWriteList([]int{1, 3, 5, 7, 9, 2, 4, 6, 8, 10})
|
||||||
|
assert := internal.NewAssert(t, "CopyOnWriteList_IndexOf")
|
||||||
|
|
||||||
|
assert.Equal(0, list.IndexOf(1))
|
||||||
|
assert.Equal(9, list.IndexOf(10))
|
||||||
|
assert.Equal(-1, list.IndexOf(11))
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestCopyOnWriteList_SubList(t *testing.T) {
|
||||||
|
list := NewCopyOnWriteList([]int{1, 3, 5, 7, 9, 2, 4, 6, 8, 10})
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "CopyOnWriteList_SubList")
|
||||||
|
|
||||||
|
list = NewCopyOnWriteList([]int{1, 3, 5, 7, 9, 2, 4, 6, 8, 10})
|
||||||
|
subList := list.SubList(1, 3)
|
||||||
|
assert.Equal([]int{3, 5}, subList)
|
||||||
|
|
||||||
|
list = NewCopyOnWriteList([]int{1, 3, 5, 7, 9, 2, 4, 6, 8, 10})
|
||||||
|
subList = list.SubList(1, 1)
|
||||||
|
assert.Equal([]int{}, subList)
|
||||||
|
|
||||||
|
list = NewCopyOnWriteList([]int{1, 3, 5, 7, 9, 2, 4, 6, 8, 10})
|
||||||
|
assert.Equal(10, list.Size())
|
||||||
|
subList = list.SubList(1, 10)
|
||||||
|
assert.Equal([]int{3, 5, 7, 9, 2, 4, 6, 8, 10}, subList)
|
||||||
|
|
||||||
|
list = NewCopyOnWriteList([]int{1, 3, 5, 7, 9, 2, 4, 6, 8, 10})
|
||||||
|
subList = list.SubList(11, 1)
|
||||||
|
assert.Equal([]int{}, subList)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestCopyOnWriteListIndexOfFunc(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestIndexOfFunc")
|
||||||
|
|
||||||
|
list := NewCopyOnWriteList([]int{1, 2, 3})
|
||||||
|
i := list.IndexOfFunc(func(a int) bool { return a == 1 })
|
||||||
|
assert.Equal(0, i)
|
||||||
|
|
||||||
|
i = list.IndexOfFunc(func(a int) bool { return a == 4 })
|
||||||
|
assert.Equal(-1, i)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestNewCopyOnWriteListLastIndexOfFunc(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestLastIndexOfFunc")
|
||||||
|
|
||||||
|
list := NewCopyOnWriteList([]int{1, 2, 3, 3, 3, 3, 4, 5, 6, 9})
|
||||||
|
i := list.LastIndexOfFunc(func(a int) bool { return a == 3 })
|
||||||
|
assert.Equal(5, i)
|
||||||
|
|
||||||
|
i = list.LastIndexOfFunc(func(a int) bool { return a == 10 })
|
||||||
|
assert.Equal(-1, i)
|
||||||
|
|
||||||
|
i = list.LastIndexOfFunc(func(a int) bool { return a == 4 })
|
||||||
|
assert.Equal(6, i)
|
||||||
|
|
||||||
|
i = list.LastIndexOfFunc(func(a int) bool { return a == 1 })
|
||||||
|
assert.Equal(0, i)
|
||||||
|
}
|
||||||
@@ -239,8 +239,8 @@ func (l *List[T]) Merge(other *List[T]) *List[T] {
|
|||||||
l1, l2 := len(l.data), len(other.data)
|
l1, l2 := len(l.data), len(other.data)
|
||||||
ml := NewList(make([]T, l1+l2))
|
ml := NewList(make([]T, l1+l2))
|
||||||
|
|
||||||
data := append([]T{}, append(l.data, other.data...)...)
|
copy(ml.data, l.data)
|
||||||
ml.data = data
|
copy(ml.data[l1:], other.data)
|
||||||
|
|
||||||
return ml
|
return ml
|
||||||
}
|
}
|
||||||
@@ -271,7 +271,7 @@ func (l *List[T]) Reverse() {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// Unique remove duplicate items in list.
|
// Unique delete duplicate items in list.
|
||||||
func (l *List[T]) Unique() {
|
func (l *List[T]) Unique() {
|
||||||
data := l.data
|
data := l.data
|
||||||
size := len(data)
|
size := len(data)
|
||||||
@@ -294,7 +294,7 @@ func (l *List[T]) Unique() {
|
|||||||
l.data = uniqueData
|
l.data = uniqueData
|
||||||
}
|
}
|
||||||
|
|
||||||
// Union creates a new list contain all element in list l and other, remove duplicate element.
|
// Union creates a new list contain all element in list l and other, delete duplicate element.
|
||||||
func (l *List[T]) Union(other *List[T]) *List[T] {
|
func (l *List[T]) Union(other *List[T]) *List[T] {
|
||||||
result := NewList([]T{})
|
result := NewList([]T{})
|
||||||
|
|
||||||
|
|||||||
@@ -7,6 +7,8 @@ import (
|
|||||||
)
|
)
|
||||||
|
|
||||||
func TestListData(t *testing.T) {
|
func TestListData(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestListData")
|
assert := internal.NewAssert(t, "TestListData")
|
||||||
|
|
||||||
list := NewList([]int{1, 2, 3})
|
list := NewList([]int{1, 2, 3})
|
||||||
@@ -14,6 +16,8 @@ func TestListData(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestValueOf(t *testing.T) {
|
func TestValueOf(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestValueOf")
|
assert := internal.NewAssert(t, "TestValueOf")
|
||||||
|
|
||||||
list := NewList([]int{1, 2, 3})
|
list := NewList([]int{1, 2, 3})
|
||||||
@@ -26,6 +30,8 @@ func TestValueOf(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestIndexOf(t *testing.T) {
|
func TestIndexOf(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestIndexOf")
|
assert := internal.NewAssert(t, "TestIndexOf")
|
||||||
|
|
||||||
list := NewList([]int{1, 2, 3})
|
list := NewList([]int{1, 2, 3})
|
||||||
@@ -37,6 +43,8 @@ func TestIndexOf(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestIndexOfFunc(t *testing.T) {
|
func TestIndexOfFunc(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestIndexOf")
|
assert := internal.NewAssert(t, "TestIndexOf")
|
||||||
|
|
||||||
list := NewList([]int{1, 2, 3})
|
list := NewList([]int{1, 2, 3})
|
||||||
@@ -48,6 +56,8 @@ func TestIndexOfFunc(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestLastIndexOf(t *testing.T) {
|
func TestLastIndexOf(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestIndexOf")
|
assert := internal.NewAssert(t, "TestIndexOf")
|
||||||
|
|
||||||
list := NewList([]int{1, 2, 3, 3, 3, 3, 4, 5, 6, 9})
|
list := NewList([]int{1, 2, 3, 3, 3, 3, 4, 5, 6, 9})
|
||||||
@@ -65,6 +75,8 @@ func TestLastIndexOf(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestLastIndexOfFunc(t *testing.T) {
|
func TestLastIndexOfFunc(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestIndexOf")
|
assert := internal.NewAssert(t, "TestIndexOf")
|
||||||
|
|
||||||
list := NewList([]int{1, 2, 3, 3, 3, 3, 4, 5, 6, 9})
|
list := NewList([]int{1, 2, 3, 3, 3, 3, 4, 5, 6, 9})
|
||||||
@@ -82,6 +94,8 @@ func TestLastIndexOfFunc(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestContain(t *testing.T) {
|
func TestContain(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestContain")
|
assert := internal.NewAssert(t, "TestContain")
|
||||||
|
|
||||||
list := NewList([]int{1, 2, 3})
|
list := NewList([]int{1, 2, 3})
|
||||||
@@ -90,6 +104,8 @@ func TestContain(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestPush(t *testing.T) {
|
func TestPush(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestPush")
|
assert := internal.NewAssert(t, "TestPush")
|
||||||
|
|
||||||
list := NewList([]int{1, 2, 3})
|
list := NewList([]int{1, 2, 3})
|
||||||
@@ -99,6 +115,8 @@ func TestPush(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestInsertAtFirst(t *testing.T) {
|
func TestInsertAtFirst(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestInsertAtFirst")
|
assert := internal.NewAssert(t, "TestInsertAtFirst")
|
||||||
|
|
||||||
list := NewList([]int{1, 2, 3})
|
list := NewList([]int{1, 2, 3})
|
||||||
@@ -108,6 +126,8 @@ func TestInsertAtFirst(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestInsertAtLast(t *testing.T) {
|
func TestInsertAtLast(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestInsertAtLast")
|
assert := internal.NewAssert(t, "TestInsertAtLast")
|
||||||
|
|
||||||
list := NewList([]int{1, 2, 3})
|
list := NewList([]int{1, 2, 3})
|
||||||
@@ -117,6 +137,8 @@ func TestInsertAtLast(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestInsertAt(t *testing.T) {
|
func TestInsertAt(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestInsertAt")
|
assert := internal.NewAssert(t, "TestInsertAt")
|
||||||
|
|
||||||
list := NewList([]int{1, 2, 3})
|
list := NewList([]int{1, 2, 3})
|
||||||
@@ -135,6 +157,8 @@ func TestInsertAt(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestPopFirst(t *testing.T) {
|
func TestPopFirst(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestPopFirst")
|
assert := internal.NewAssert(t, "TestPopFirst")
|
||||||
|
|
||||||
list := NewList([]int{1, 2, 3})
|
list := NewList([]int{1, 2, 3})
|
||||||
@@ -150,6 +174,8 @@ func TestPopFirst(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestPopLast(t *testing.T) {
|
func TestPopLast(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestPopLast")
|
assert := internal.NewAssert(t, "TestPopLast")
|
||||||
|
|
||||||
list := NewList([]int{1, 2, 3})
|
list := NewList([]int{1, 2, 3})
|
||||||
@@ -165,6 +191,8 @@ func TestPopLast(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestDeleteAt(t *testing.T) {
|
func TestDeleteAt(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestDeleteAt")
|
assert := internal.NewAssert(t, "TestDeleteAt")
|
||||||
|
|
||||||
list := NewList([]int{1, 2, 3, 4})
|
list := NewList([]int{1, 2, 3, 4})
|
||||||
@@ -183,6 +211,8 @@ func TestDeleteAt(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestUpdateAt(t *testing.T) {
|
func TestUpdateAt(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestUpdateAt")
|
assert := internal.NewAssert(t, "TestUpdateAt")
|
||||||
|
|
||||||
list := NewList([]int{1, 2, 3, 4})
|
list := NewList([]int{1, 2, 3, 4})
|
||||||
@@ -201,6 +231,8 @@ func TestUpdateAt(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestEqual(t *testing.T) {
|
func TestEqual(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestEqual")
|
assert := internal.NewAssert(t, "TestEqual")
|
||||||
|
|
||||||
list1 := NewList([]int{1, 2, 3, 4})
|
list1 := NewList([]int{1, 2, 3, 4})
|
||||||
@@ -212,6 +244,8 @@ func TestEqual(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestIsEmpty(t *testing.T) {
|
func TestIsEmpty(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestIsEmpty")
|
assert := internal.NewAssert(t, "TestIsEmpty")
|
||||||
|
|
||||||
list1 := NewList([]int{1, 2, 3, 4})
|
list1 := NewList([]int{1, 2, 3, 4})
|
||||||
@@ -222,6 +256,8 @@ func TestIsEmpty(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestIsClear(t *testing.T) {
|
func TestIsClear(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestIsClear")
|
assert := internal.NewAssert(t, "TestIsClear")
|
||||||
|
|
||||||
list1 := NewList([]int{1, 2, 3, 4})
|
list1 := NewList([]int{1, 2, 3, 4})
|
||||||
@@ -232,6 +268,8 @@ func TestIsClear(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestClone(t *testing.T) {
|
func TestClone(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestClone")
|
assert := internal.NewAssert(t, "TestClone")
|
||||||
|
|
||||||
list1 := NewList([]int{1, 2, 3, 4})
|
list1 := NewList([]int{1, 2, 3, 4})
|
||||||
@@ -241,6 +279,8 @@ func TestClone(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestMerge(t *testing.T) {
|
func TestMerge(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestMerge")
|
assert := internal.NewAssert(t, "TestMerge")
|
||||||
|
|
||||||
list1 := NewList([]int{1, 2, 3, 4})
|
list1 := NewList([]int{1, 2, 3, 4})
|
||||||
@@ -252,6 +292,8 @@ func TestMerge(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestSize(t *testing.T) {
|
func TestSize(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestSize")
|
assert := internal.NewAssert(t, "TestSize")
|
||||||
|
|
||||||
list := NewList([]int{1, 2, 3, 4})
|
list := NewList([]int{1, 2, 3, 4})
|
||||||
@@ -262,6 +304,8 @@ func TestSize(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestCap(t *testing.T) {
|
func TestCap(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestCap")
|
assert := internal.NewAssert(t, "TestCap")
|
||||||
|
|
||||||
data := make([]int, 0, 100)
|
data := make([]int, 0, 100)
|
||||||
@@ -274,6 +318,8 @@ func TestCap(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestSwap(t *testing.T) {
|
func TestSwap(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestSwap")
|
assert := internal.NewAssert(t, "TestSwap")
|
||||||
|
|
||||||
list := NewList([]int{1, 2, 3, 4})
|
list := NewList([]int{1, 2, 3, 4})
|
||||||
@@ -285,6 +331,8 @@ func TestSwap(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestReverse(t *testing.T) {
|
func TestReverse(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestReverse")
|
assert := internal.NewAssert(t, "TestReverse")
|
||||||
|
|
||||||
list := NewList([]int{1, 2, 3, 4})
|
list := NewList([]int{1, 2, 3, 4})
|
||||||
@@ -296,6 +344,8 @@ func TestReverse(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestUnique(t *testing.T) {
|
func TestUnique(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestUnique")
|
assert := internal.NewAssert(t, "TestUnique")
|
||||||
|
|
||||||
list := NewList([]int{1, 2, 2, 3, 4})
|
list := NewList([]int{1, 2, 2, 3, 4})
|
||||||
@@ -307,6 +357,8 @@ func TestUnique(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestUnion(t *testing.T) {
|
func TestUnion(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestUnion")
|
assert := internal.NewAssert(t, "TestUnion")
|
||||||
|
|
||||||
list1 := NewList([]int{1, 2, 3, 4})
|
list1 := NewList([]int{1, 2, 3, 4})
|
||||||
@@ -318,6 +370,8 @@ func TestUnion(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestIntersection(t *testing.T) {
|
func TestIntersection(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestIntersection")
|
assert := internal.NewAssert(t, "TestIntersection")
|
||||||
|
|
||||||
list1 := NewList([]int{1, 2, 3, 4})
|
list1 := NewList([]int{1, 2, 3, 4})
|
||||||
@@ -329,6 +383,8 @@ func TestIntersection(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestDifference(t *testing.T) {
|
func TestDifference(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestDifference")
|
assert := internal.NewAssert(t, "TestDifference")
|
||||||
|
|
||||||
list1 := NewList([]int{1, 2, 3})
|
list1 := NewList([]int{1, 2, 3})
|
||||||
@@ -340,6 +396,8 @@ func TestDifference(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestSymmetricDifference(t *testing.T) {
|
func TestSymmetricDifference(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestSymmetricDifference")
|
assert := internal.NewAssert(t, "TestSymmetricDifference")
|
||||||
|
|
||||||
list1 := NewList([]int{1, 2, 3})
|
list1 := NewList([]int{1, 2, 3})
|
||||||
@@ -351,6 +409,8 @@ func TestSymmetricDifference(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestSubSlice(t *testing.T) {
|
func TestSubSlice(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestSubSlice")
|
assert := internal.NewAssert(t, "TestSubSlice")
|
||||||
|
|
||||||
list := NewList([]int{1, 2, 3, 4, 5, 8})
|
list := NewList([]int{1, 2, 3, 4, 5, 8})
|
||||||
@@ -367,6 +427,8 @@ func BenchmarkSubSlice(b *testing.B) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestDeleteIf(t *testing.T) {
|
func TestDeleteIf(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestDeleteIf")
|
assert := internal.NewAssert(t, "TestDeleteIf")
|
||||||
|
|
||||||
list := NewList([]int{1, 1, 1, 1, 2, 3, 1, 1, 4, 1, 1, 1, 1, 1, 1})
|
list := NewList([]int{1, 1, 1, 1, 2, 3, 1, 1, 4, 1, 1, 1, 1, 1, 1})
|
||||||
@@ -381,10 +443,11 @@ func TestDeleteIf(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestForEach(t *testing.T) {
|
func TestForEach(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestForEach")
|
assert := internal.NewAssert(t, "TestForEach")
|
||||||
|
|
||||||
list := NewList([]int{1, 2, 3, 4})
|
list := NewList([]int{1, 2, 3, 4})
|
||||||
|
|
||||||
rs := make([]int, 0)
|
rs := make([]int, 0)
|
||||||
list.ForEach(func(i int) {
|
list.ForEach(func(i int) {
|
||||||
rs = append(rs, i)
|
rs = append(rs, i)
|
||||||
@@ -394,6 +457,8 @@ func TestForEach(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestRetainAll(t *testing.T) {
|
func TestRetainAll(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestRetainAll")
|
assert := internal.NewAssert(t, "TestRetainAll")
|
||||||
|
|
||||||
list := NewList([]int{1, 2, 3, 4})
|
list := NewList([]int{1, 2, 3, 4})
|
||||||
@@ -414,6 +479,8 @@ func TestRetainAll(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestDeleteAll(t *testing.T) {
|
func TestDeleteAll(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestDeleteAll")
|
assert := internal.NewAssert(t, "TestDeleteAll")
|
||||||
|
|
||||||
list := NewList([]int{1, 2, 3, 4})
|
list := NewList([]int{1, 2, 3, 4})
|
||||||
@@ -433,10 +500,11 @@ func TestDeleteAll(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestIterator(t *testing.T) {
|
func TestIterator(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestIterator")
|
assert := internal.NewAssert(t, "TestIterator")
|
||||||
|
|
||||||
list := NewList([]int{1, 2, 3, 4})
|
list := NewList([]int{1, 2, 3, 4})
|
||||||
|
|
||||||
iterator := list.Iterator()
|
iterator := list.Iterator()
|
||||||
|
|
||||||
rs := make([]int, 0)
|
rs := make([]int, 0)
|
||||||
@@ -449,14 +517,15 @@ func TestIterator(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestListToMap(t *testing.T) {
|
func TestListToMap(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "ListToMap")
|
assert := internal.NewAssert(t, "ListToMap")
|
||||||
|
|
||||||
list := NewList([]int{1, 2, 3, 4})
|
list := NewList([]int{1, 2, 3, 4})
|
||||||
|
|
||||||
result := ListToMap(list, func(n int) (int, bool) {
|
result := ListToMap(list, func(n int) (int, bool) {
|
||||||
return n, n > 1
|
return n, n > 1
|
||||||
})
|
})
|
||||||
expected := map[int]bool{1: false, 2: true, 3: true, 4: true}
|
|
||||||
|
|
||||||
|
expected := map[int]bool{1: false, 2: true, 3: true, 4: true}
|
||||||
assert.Equal(expected, result)
|
assert.Equal(expected, result)
|
||||||
}
|
}
|
||||||
@@ -0,0 +1,18 @@
|
|||||||
|
package datastructure
|
||||||
|
|
||||||
|
import (
|
||||||
|
"testing"
|
||||||
|
|
||||||
|
"github.com/duke-git/lancet/v2/internal"
|
||||||
|
)
|
||||||
|
|
||||||
|
func TestMergePreservesBackingStorage(t *testing.T) {
|
||||||
|
assert := internal.NewAssert(t, "TestMergePreservesBackingStorage")
|
||||||
|
backing := []int{1, 99, 100}
|
||||||
|
left := NewList(backing[:1])
|
||||||
|
merged := left.Merge(NewList([]int{2, 3}))
|
||||||
|
assert.Equal([]int{1, 2, 3}, merged.Data())
|
||||||
|
assert.Equal([]int{1, 99, 100}, backing)
|
||||||
|
merged.UpdateAt(0, 42)
|
||||||
|
assert.Equal([]int{1}, left.Data())
|
||||||
|
}
|
||||||
@@ -0,0 +1,108 @@
|
|||||||
|
package optional
|
||||||
|
|
||||||
|
import (
|
||||||
|
"sync"
|
||||||
|
)
|
||||||
|
|
||||||
|
// Optional is a type that may or may not contain a non-nil value.
|
||||||
|
type Optional[T any] struct {
|
||||||
|
value *T
|
||||||
|
mu *sync.RWMutex
|
||||||
|
}
|
||||||
|
|
||||||
|
// Default returns an default Optional instance.
|
||||||
|
func Default[T any]() Optional[T] {
|
||||||
|
return Optional[T]{mu: &sync.RWMutex{}}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Of returns an Optional with a non-nil value.
|
||||||
|
func Of[T any](value T) Optional[T] {
|
||||||
|
return Optional[T]{value: &value, mu: &sync.RWMutex{}}
|
||||||
|
}
|
||||||
|
|
||||||
|
// FromNillable returns an Optional for a given value, which may be nil.
|
||||||
|
func FromNillable[T any](value *T) Optional[T] {
|
||||||
|
if value == nil {
|
||||||
|
return Default[T]()
|
||||||
|
}
|
||||||
|
return Optional[T]{value: value, mu: &sync.RWMutex{}}
|
||||||
|
}
|
||||||
|
|
||||||
|
// IsNotNil checks if there is a value present.
|
||||||
|
func (o Optional[T]) IsNotNil() bool {
|
||||||
|
o.mu.RLock()
|
||||||
|
defer o.mu.RUnlock()
|
||||||
|
|
||||||
|
return o.value != nil
|
||||||
|
}
|
||||||
|
|
||||||
|
// IsNil checks if the Optional is nil.
|
||||||
|
func (o Optional[T]) IsNil() bool {
|
||||||
|
return !o.IsNotNil()
|
||||||
|
}
|
||||||
|
|
||||||
|
// IfNotNil performs the given action with the value if a value is not nil.
|
||||||
|
func (o Optional[T]) IfNotNil(action func(value T)) {
|
||||||
|
o.mu.RLock()
|
||||||
|
defer o.mu.RUnlock()
|
||||||
|
|
||||||
|
if o.value != nil {
|
||||||
|
action(*o.value)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// IfNotNilOrElse performs the action with the value if present, otherwise performs the fallback action.
|
||||||
|
func (o Optional[T]) IfNotNilOrElse(action func(value T), fallbackAction func()) {
|
||||||
|
o.mu.RLock()
|
||||||
|
defer o.mu.RUnlock()
|
||||||
|
|
||||||
|
if o.value != nil {
|
||||||
|
action(*o.value)
|
||||||
|
} else {
|
||||||
|
fallbackAction()
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Unwarp returns the value if not nil, otherwise panics.
|
||||||
|
func (o Optional[T]) Unwarp() T {
|
||||||
|
o.mu.RLock()
|
||||||
|
defer o.mu.RUnlock()
|
||||||
|
|
||||||
|
if o.value == nil {
|
||||||
|
panic("Optional.Get: no value present")
|
||||||
|
}
|
||||||
|
return *o.value
|
||||||
|
}
|
||||||
|
|
||||||
|
// OrElse returns the value if is not nil, otherwise returns other.
|
||||||
|
func (o Optional[T]) OrElse(other T) T {
|
||||||
|
o.mu.RLock()
|
||||||
|
defer o.mu.RUnlock()
|
||||||
|
|
||||||
|
if o.value != nil {
|
||||||
|
return *o.value
|
||||||
|
}
|
||||||
|
return other
|
||||||
|
}
|
||||||
|
|
||||||
|
// OrElseGet returns the value if is not nil, otherwise invokes action and returns the result.
|
||||||
|
func (o Optional[T]) OrElseGet(action func() T) T {
|
||||||
|
o.mu.RLock()
|
||||||
|
defer o.mu.RUnlock()
|
||||||
|
|
||||||
|
if o.value != nil {
|
||||||
|
return *o.value
|
||||||
|
}
|
||||||
|
return action()
|
||||||
|
}
|
||||||
|
|
||||||
|
// OrElseTrigger returns the value if present, otherwise returns an error.
|
||||||
|
func (o Optional[T]) OrElseTrigger(errorHandler func() error) (T, error) {
|
||||||
|
o.mu.RLock()
|
||||||
|
defer o.mu.RUnlock()
|
||||||
|
|
||||||
|
if o.value == nil {
|
||||||
|
return *new(T), errorHandler()
|
||||||
|
}
|
||||||
|
return *o.value, nil
|
||||||
|
}
|
||||||
@@ -0,0 +1,151 @@
|
|||||||
|
package optional
|
||||||
|
|
||||||
|
import (
|
||||||
|
"errors"
|
||||||
|
"testing"
|
||||||
|
|
||||||
|
"github.com/duke-git/lancet/v2/internal"
|
||||||
|
)
|
||||||
|
|
||||||
|
func TestDefault(t *testing.T) {
|
||||||
|
assert := internal.NewAssert(t, "TestEmpty")
|
||||||
|
opt := Default[int]()
|
||||||
|
|
||||||
|
assert.ShouldBeTrue(opt.IsNil())
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestOf(t *testing.T) {
|
||||||
|
assert := internal.NewAssert(t, "TestOf")
|
||||||
|
value := 42
|
||||||
|
opt := Of(value)
|
||||||
|
|
||||||
|
assert.ShouldBeTrue(opt.IsNotNil())
|
||||||
|
assert.Equal(opt.Unwarp(), value)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestFromNillable(t *testing.T) {
|
||||||
|
assert := internal.NewAssert(t, "TestOfNullable")
|
||||||
|
var value *int = nil
|
||||||
|
opt := FromNillable(value)
|
||||||
|
|
||||||
|
assert.ShouldBeFalse(opt.IsNotNil())
|
||||||
|
|
||||||
|
value = new(int)
|
||||||
|
*value = 42
|
||||||
|
opt = FromNillable(value)
|
||||||
|
|
||||||
|
assert.ShouldBeTrue(opt.IsNotNil())
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestOrElse(t *testing.T) {
|
||||||
|
assert := internal.NewAssert(t, "TestOrElse")
|
||||||
|
optDefault := Default[int]()
|
||||||
|
defaultValue := 100
|
||||||
|
|
||||||
|
val := optDefault.OrElse(defaultValue)
|
||||||
|
assert.Equal(val, defaultValue)
|
||||||
|
|
||||||
|
optWithValue := Of(42)
|
||||||
|
val = optWithValue.OrElse(defaultValue)
|
||||||
|
assert.Equal(val, 42)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestOrElseGetHappyPath(t *testing.T) {
|
||||||
|
assert := internal.NewAssert(t, "TestOrElseGetHappyPath")
|
||||||
|
optWithValue := Of(42)
|
||||||
|
action := func() int { return 100 }
|
||||||
|
|
||||||
|
val := optWithValue.OrElseGet(action)
|
||||||
|
assert.Equal(val, 42)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestOrElseGet(t *testing.T) {
|
||||||
|
assert := internal.NewAssert(t, "TestOrElseGet")
|
||||||
|
optDefault := Default[int]()
|
||||||
|
action := func() int { return 100 }
|
||||||
|
|
||||||
|
val := optDefault.OrElseGet(action)
|
||||||
|
assert.Equal(val, action())
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestOrElseTrigger(t *testing.T) {
|
||||||
|
assert := internal.NewAssert(t, "OrElseTrigger")
|
||||||
|
optDefault := Default[int]()
|
||||||
|
_, err := optDefault.OrElseTrigger(func() error { return errors.New("no value") })
|
||||||
|
|
||||||
|
assert.Equal(err.Error(), "no value")
|
||||||
|
|
||||||
|
optWithValue := Of(42)
|
||||||
|
val, err := optWithValue.OrElseTrigger(func() error { return errors.New("no value") })
|
||||||
|
|
||||||
|
assert.IsNil(err)
|
||||||
|
assert.Equal(val, 42)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestIfNotNil(t *testing.T) {
|
||||||
|
assert := internal.NewAssert(t, "IfNotNil")
|
||||||
|
called := false
|
||||||
|
action := func(value int) { called = true }
|
||||||
|
|
||||||
|
optDefault := Default[int]()
|
||||||
|
optDefault.IfNotNil(action)
|
||||||
|
|
||||||
|
assert.ShouldBeFalse(called)
|
||||||
|
|
||||||
|
called = false // Reset for next test
|
||||||
|
optWithValue := Of(42)
|
||||||
|
optWithValue.IfNotNil(action)
|
||||||
|
|
||||||
|
assert.ShouldBeTrue(called)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestIfNotNilOrElse(t *testing.T) {
|
||||||
|
assert := internal.NewAssert(t, "TestIfNotNilOrElse")
|
||||||
|
|
||||||
|
// Test when value is present
|
||||||
|
calledWithValue := false
|
||||||
|
valueAction := func(value int) { calledWithValue = true }
|
||||||
|
fallbackAction := func() { t.Errorf("Empty action should not be called when value is present") }
|
||||||
|
|
||||||
|
optWithValue := Of(42)
|
||||||
|
optWithValue.IfNotNilOrElse(valueAction, fallbackAction)
|
||||||
|
|
||||||
|
assert.ShouldBeTrue(calledWithValue)
|
||||||
|
|
||||||
|
// Test when value is not present
|
||||||
|
calledWithEmpty := false
|
||||||
|
valueAction = func(value int) { t.Errorf("Value action should not be called when value is not present") }
|
||||||
|
fallbackAction = func() { calledWithEmpty = true }
|
||||||
|
|
||||||
|
optDefault := Default[int]()
|
||||||
|
optDefault.IfNotNilOrElse(valueAction, fallbackAction)
|
||||||
|
|
||||||
|
assert.ShouldBeTrue(calledWithEmpty)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestGetWithPanicStandard(t *testing.T) {
|
||||||
|
assert := internal.NewAssert(t, "TestGetWithPanicStandard")
|
||||||
|
|
||||||
|
// Test when value is present
|
||||||
|
optWithValue := Of(42)
|
||||||
|
func() {
|
||||||
|
defer func() {
|
||||||
|
r := recover()
|
||||||
|
assert.IsNil(r)
|
||||||
|
}()
|
||||||
|
val := optWithValue.Unwarp()
|
||||||
|
if val != 42 {
|
||||||
|
t.Errorf("Expected Unwarp to return 42, got %v", val)
|
||||||
|
}
|
||||||
|
}()
|
||||||
|
|
||||||
|
// Test when value is not present
|
||||||
|
optDefault := Default[int]()
|
||||||
|
func() {
|
||||||
|
defer func() {
|
||||||
|
r := recover()
|
||||||
|
assert.IsNotNil(r)
|
||||||
|
}()
|
||||||
|
_ = optDefault.Unwarp()
|
||||||
|
}()
|
||||||
|
}
|
||||||
@@ -12,7 +12,7 @@ import (
|
|||||||
|
|
||||||
// ArrayQueue implements queue with slice
|
// ArrayQueue implements queue with slice
|
||||||
type ArrayQueue[T any] struct {
|
type ArrayQueue[T any] struct {
|
||||||
items []T
|
data []T
|
||||||
head int
|
head int
|
||||||
tail int
|
tail int
|
||||||
capacity int
|
capacity int
|
||||||
@@ -21,7 +21,7 @@ type ArrayQueue[T any] struct {
|
|||||||
|
|
||||||
func NewArrayQueue[T any](capacity int) *ArrayQueue[T] {
|
func NewArrayQueue[T any](capacity int) *ArrayQueue[T] {
|
||||||
return &ArrayQueue[T]{
|
return &ArrayQueue[T]{
|
||||||
items: make([]T, 0, capacity),
|
data: make([]T, 0, capacity),
|
||||||
head: 0,
|
head: 0,
|
||||||
tail: 0,
|
tail: 0,
|
||||||
capacity: capacity,
|
capacity: capacity,
|
||||||
@@ -31,9 +31,9 @@ func NewArrayQueue[T any](capacity int) *ArrayQueue[T] {
|
|||||||
|
|
||||||
// Data return slice of queue data
|
// Data return slice of queue data
|
||||||
func (q *ArrayQueue[T]) Data() []T {
|
func (q *ArrayQueue[T]) Data() []T {
|
||||||
items := []T{}
|
items := make([]T, 0, q.tail-q.head)
|
||||||
for i := q.head; i < q.tail; i++ {
|
for i := q.head; i < q.tail; i++ {
|
||||||
items = append(items, q.items[i])
|
items = append(items, q.data[i])
|
||||||
}
|
}
|
||||||
return items
|
return items
|
||||||
}
|
}
|
||||||
@@ -55,40 +55,71 @@ func (q *ArrayQueue[T]) IsFull() bool {
|
|||||||
|
|
||||||
// Front return front value of queue
|
// Front return front value of queue
|
||||||
func (q *ArrayQueue[T]) Front() T {
|
func (q *ArrayQueue[T]) Front() T {
|
||||||
return q.items[0]
|
return q.data[q.head]
|
||||||
}
|
}
|
||||||
|
|
||||||
// Back return back value of queue
|
// Back return back value of queue
|
||||||
func (q *ArrayQueue[T]) Back() T {
|
func (q *ArrayQueue[T]) Back() T {
|
||||||
return q.items[q.size-1]
|
return q.data[q.tail-1]
|
||||||
}
|
}
|
||||||
|
|
||||||
// EnQueue put element into queue
|
// EnQueue put element into queue
|
||||||
func (q *ArrayQueue[T]) Enqueue(item T) bool {
|
func (q *ArrayQueue[T]) Enqueue(item T) bool {
|
||||||
if q.head == 0 && q.tail == q.capacity {
|
if q.tail < q.capacity {
|
||||||
return false
|
q.data = append(q.data, item)
|
||||||
} else if q.head != 0 && q.tail == q.capacity {
|
// q.tail++
|
||||||
for i := q.head; i < q.tail; i++ {
|
q.data[q.tail] = item
|
||||||
q.items[i-q.head] = q.items[i]
|
} else {
|
||||||
|
//upgrade
|
||||||
|
if q.head > 0 {
|
||||||
|
for i := 0; i < q.tail-q.head; i++ {
|
||||||
|
q.data[i] = q.data[i+q.head]
|
||||||
|
}
|
||||||
|
q.tail -= q.head
|
||||||
|
q.head = 0
|
||||||
|
} else {
|
||||||
|
if q.capacity < 65536 {
|
||||||
|
if q.capacity == 0 {
|
||||||
|
q.capacity = 1
|
||||||
|
}
|
||||||
|
q.capacity *= 2
|
||||||
|
} else {
|
||||||
|
q.capacity += 2 ^ 16
|
||||||
|
}
|
||||||
|
|
||||||
|
tmp := make([]T, q.capacity, q.capacity)
|
||||||
|
copy(tmp, q.data)
|
||||||
|
q.data = tmp
|
||||||
}
|
}
|
||||||
q.tail = q.tail - q.head
|
|
||||||
q.head = 0
|
q.data[q.tail] = item
|
||||||
}
|
}
|
||||||
|
|
||||||
q.items = append(q.items, item)
|
|
||||||
q.tail++
|
q.tail++
|
||||||
q.size++
|
q.size++
|
||||||
|
|
||||||
return true
|
return true
|
||||||
}
|
}
|
||||||
|
|
||||||
// DeQueue remove head element of queue and return it, if queue is empty, return nil and error
|
// DeQueue remove head element of queue and return it, if queue is empty, return nil and error
|
||||||
func (q *ArrayQueue[T]) Dequeue() (T, bool) {
|
func (q *ArrayQueue[T]) Dequeue() (T, bool) {
|
||||||
var item T
|
var item T
|
||||||
if q.head == q.tail {
|
if q.size == 0 {
|
||||||
return item, false
|
return item, false
|
||||||
}
|
}
|
||||||
item = q.items[q.head]
|
|
||||||
|
item = q.data[q.head]
|
||||||
q.head++
|
q.head++
|
||||||
|
|
||||||
|
if q.head >= 1024 || q.head*2 > q.tail {
|
||||||
|
q.capacity -= q.head
|
||||||
|
q.tail -= q.head
|
||||||
|
tmp := make([]T, q.capacity, q.capacity)
|
||||||
|
copy(tmp, q.data[q.head:])
|
||||||
|
q.data = tmp
|
||||||
|
q.head = 0
|
||||||
|
}
|
||||||
|
|
||||||
q.size--
|
q.size--
|
||||||
return item, true
|
return item, true
|
||||||
}
|
}
|
||||||
@@ -96,7 +127,7 @@ func (q *ArrayQueue[T]) Dequeue() (T, bool) {
|
|||||||
// Clear the queue data
|
// Clear the queue data
|
||||||
func (q *ArrayQueue[T]) Clear() {
|
func (q *ArrayQueue[T]) Clear() {
|
||||||
capacity := q.capacity
|
capacity := q.capacity
|
||||||
q.items = make([]T, 0, capacity)
|
q.data = make([]T, 0, capacity)
|
||||||
q.head = 0
|
q.head = 0
|
||||||
q.tail = 0
|
q.tail = 0
|
||||||
q.size = 0
|
q.size = 0
|
||||||
@@ -105,8 +136,8 @@ func (q *ArrayQueue[T]) Clear() {
|
|||||||
|
|
||||||
// Contain checks if the value is in queue or not
|
// Contain checks if the value is in queue or not
|
||||||
func (q *ArrayQueue[T]) Contain(value T) bool {
|
func (q *ArrayQueue[T]) Contain(value T) bool {
|
||||||
for _, v := range q.items {
|
for i := q.head; i < q.tail; i++ {
|
||||||
if reflect.DeepEqual(v, value) {
|
if reflect.DeepEqual(q.data[i], value) {
|
||||||
return true
|
return true
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@@ -117,7 +148,7 @@ func (q *ArrayQueue[T]) Contain(value T) bool {
|
|||||||
func (q *ArrayQueue[T]) Print() {
|
func (q *ArrayQueue[T]) Print() {
|
||||||
info := "["
|
info := "["
|
||||||
for i := q.head; i < q.tail; i++ {
|
for i := q.head; i < q.tail; i++ {
|
||||||
info += fmt.Sprintf("%+v, ", q.items[i])
|
info += fmt.Sprintf("%+v, ", q.data[i])
|
||||||
}
|
}
|
||||||
info += "]"
|
info += "]"
|
||||||
fmt.Println(info)
|
fmt.Println(info)
|
||||||
|
|||||||
@@ -7,22 +7,25 @@ import (
|
|||||||
)
|
)
|
||||||
|
|
||||||
func TestArrayQueue_Enqueue(t *testing.T) {
|
func TestArrayQueue_Enqueue(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestArrayQueue_Enqueue")
|
assert := internal.NewAssert(t, "TestArrayQueue_Enqueue")
|
||||||
|
|
||||||
queue := NewArrayQueue[int](5)
|
queue := NewArrayQueue[int](2)
|
||||||
queue.Enqueue(1)
|
queue.Enqueue(1)
|
||||||
queue.Enqueue(2)
|
queue.Enqueue(2)
|
||||||
queue.Enqueue(3)
|
queue.Enqueue(3)
|
||||||
|
|
||||||
expected := []int{1, 2, 3}
|
|
||||||
data := queue.Data()
|
data := queue.Data()
|
||||||
size := queue.Size()
|
size := queue.Size()
|
||||||
|
|
||||||
assert.Equal(expected, data)
|
assert.Equal([]int{1, 2, 3}, data)
|
||||||
assert.Equal(3, size)
|
assert.Equal(3, size)
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestArrayQueue_Dequeue(t *testing.T) {
|
func TestArrayQueue_Dequeue(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestArrayQueue_Dequeue")
|
assert := internal.NewAssert(t, "TestArrayQueue_Dequeue")
|
||||||
|
|
||||||
queue := NewArrayQueue[int](4)
|
queue := NewArrayQueue[int](4)
|
||||||
@@ -38,6 +41,8 @@ func TestArrayQueue_Dequeue(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestArrayQueue_Front(t *testing.T) {
|
func TestArrayQueue_Front(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestArrayQueue_Front")
|
assert := internal.NewAssert(t, "TestArrayQueue_Front")
|
||||||
|
|
||||||
queue := NewArrayQueue[int](4)
|
queue := NewArrayQueue[int](4)
|
||||||
@@ -52,6 +57,8 @@ func TestArrayQueue_Front(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestArrayQueue_Back(t *testing.T) {
|
func TestArrayQueue_Back(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestArrayQueue_Back")
|
assert := internal.NewAssert(t, "TestArrayQueue_Back")
|
||||||
|
|
||||||
queue := NewArrayQueue[int](4)
|
queue := NewArrayQueue[int](4)
|
||||||
@@ -66,6 +73,8 @@ func TestArrayQueue_Back(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestArrayQueue_Contain(t *testing.T) {
|
func TestArrayQueue_Contain(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestArrayQueue_Contain")
|
assert := internal.NewAssert(t, "TestArrayQueue_Contain")
|
||||||
|
|
||||||
queue := NewArrayQueue[int](4)
|
queue := NewArrayQueue[int](4)
|
||||||
@@ -78,6 +87,8 @@ func TestArrayQueue_Contain(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestArrayQueue_Clear(t *testing.T) {
|
func TestArrayQueue_Clear(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestArrayQueue_Clear")
|
assert := internal.NewAssert(t, "TestArrayQueue_Clear")
|
||||||
|
|
||||||
queue := NewArrayQueue[int](4)
|
queue := NewArrayQueue[int](4)
|
||||||
@@ -95,6 +106,8 @@ func TestArrayQueue_Clear(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestArrayQueue_IsFull(t *testing.T) {
|
func TestArrayQueue_IsFull(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestArrayQueue_IsFull")
|
assert := internal.NewAssert(t, "TestArrayQueue_IsFull")
|
||||||
|
|
||||||
queue := NewArrayQueue[int](3)
|
queue := NewArrayQueue[int](3)
|
||||||
|
|||||||
@@ -57,7 +57,7 @@ func (q *CircularQueue[T]) IsEmpty() bool {
|
|||||||
|
|
||||||
// IsFull checks if queue is full or not
|
// IsFull checks if queue is full or not
|
||||||
func (q *CircularQueue[T]) IsFull() bool {
|
func (q *CircularQueue[T]) IsFull() bool {
|
||||||
return (q.rear+1)%q.capacity == q.front
|
return q.capacity == 0 || (q.rear+1)%q.capacity == q.front
|
||||||
}
|
}
|
||||||
|
|
||||||
// Front return front value of queue
|
// Front return front value of queue
|
||||||
@@ -101,16 +101,15 @@ func (q *CircularQueue[T]) Dequeue() (*T, error) {
|
|||||||
|
|
||||||
// Clear the queue data
|
// Clear the queue data
|
||||||
func (q *CircularQueue[T]) Clear() {
|
func (q *CircularQueue[T]) Clear() {
|
||||||
q.data = []T{}
|
q.data = make([]T, q.capacity)
|
||||||
q.front = 0
|
q.front = 0
|
||||||
q.rear = 0
|
q.rear = 0
|
||||||
q.capacity = 0
|
|
||||||
}
|
}
|
||||||
|
|
||||||
// Contain checks if the value is in queue or not
|
// Contain checks if the value is in queue or not
|
||||||
func (q *CircularQueue[T]) Contain(value T) bool {
|
func (q *CircularQueue[T]) Contain(value T) bool {
|
||||||
for _, v := range q.data {
|
for i := q.front; i != q.rear; i = (i + 1) % q.capacity {
|
||||||
if reflect.DeepEqual(v, value) {
|
if reflect.DeepEqual(q.data[i], value) {
|
||||||
return true
|
return true
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -7,6 +7,8 @@ import (
|
|||||||
)
|
)
|
||||||
|
|
||||||
func TestCircularQueue_Enqueue(t *testing.T) {
|
func TestCircularQueue_Enqueue(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestCircularQueue_Enqueue")
|
assert := internal.NewAssert(t, "TestCircularQueue_Enqueue")
|
||||||
|
|
||||||
queue := NewCircularQueue[int](6)
|
queue := NewCircularQueue[int](6)
|
||||||
@@ -34,6 +36,8 @@ func TestCircularQueue_Enqueue(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestCircularQueue_Dequeue(t *testing.T) {
|
func TestCircularQueue_Dequeue(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestCircularQueue_DeQueue")
|
assert := internal.NewAssert(t, "TestCircularQueue_DeQueue")
|
||||||
|
|
||||||
queue := NewCircularQueue[int](4)
|
queue := NewCircularQueue[int](4)
|
||||||
@@ -60,6 +64,8 @@ func TestCircularQueue_Dequeue(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestCircularQueue_Front(t *testing.T) {
|
func TestCircularQueue_Front(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestCircularQueue_Front")
|
assert := internal.NewAssert(t, "TestCircularQueue_Front")
|
||||||
|
|
||||||
queue := NewCircularQueue[int](6)
|
queue := NewCircularQueue[int](6)
|
||||||
@@ -80,6 +86,8 @@ func TestCircularQueue_Front(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestCircularQueue_Back(t *testing.T) {
|
func TestCircularQueue_Back(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestCircularQueue_Back")
|
assert := internal.NewAssert(t, "TestCircularQueue_Back")
|
||||||
|
|
||||||
queue := NewCircularQueue[int](3)
|
queue := NewCircularQueue[int](3)
|
||||||
@@ -103,6 +111,8 @@ func TestCircularQueue_Back(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestCircularQueue_Contain(t *testing.T) {
|
func TestCircularQueue_Contain(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestCircularQueue_Contain")
|
assert := internal.NewAssert(t, "TestCircularQueue_Contain")
|
||||||
|
|
||||||
queue := NewCircularQueue[int](2)
|
queue := NewCircularQueue[int](2)
|
||||||
@@ -114,6 +124,8 @@ func TestCircularQueue_Contain(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestCircularQueue_Clear(t *testing.T) {
|
func TestCircularQueue_Clear(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestCircularQueue_Clear")
|
assert := internal.NewAssert(t, "TestCircularQueue_Clear")
|
||||||
|
|
||||||
queue := NewCircularQueue[int](3)
|
queue := NewCircularQueue[int](3)
|
||||||
@@ -132,6 +144,8 @@ func TestCircularQueue_Clear(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestCircularQueue_Data(t *testing.T) {
|
func TestCircularQueue_Data(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestCircularQueue_Data")
|
assert := internal.NewAssert(t, "TestCircularQueue_Data")
|
||||||
|
|
||||||
queue := NewCircularQueue[int](3)
|
queue := NewCircularQueue[int](3)
|
||||||
|
|||||||
@@ -0,0 +1,19 @@
|
|||||||
|
package datastructure
|
||||||
|
|
||||||
|
import "testing"
|
||||||
|
|
||||||
|
func TestCircularQueueReuseAfterClear(t *testing.T) {
|
||||||
|
queue := NewCircularQueue[int](3)
|
||||||
|
queue.Enqueue(1)
|
||||||
|
queue.Clear()
|
||||||
|
if err := queue.Enqueue(2); err != nil {
|
||||||
|
t.Fatal(err)
|
||||||
|
}
|
||||||
|
if queue.Size() != 1 || queue.Front() != 2 {
|
||||||
|
t.Error("cleared queue could not be reused")
|
||||||
|
}
|
||||||
|
zero := NewCircularQueue[int](0)
|
||||||
|
if !zero.IsFull() || zero.Enqueue(1) == nil {
|
||||||
|
t.Error("zero-capacity queue should reject an element")
|
||||||
|
}
|
||||||
|
}
|
||||||
@@ -0,0 +1,25 @@
|
|||||||
|
package datastructure
|
||||||
|
|
||||||
|
import "testing"
|
||||||
|
|
||||||
|
func TestQueueContainActiveValues(t *testing.T) {
|
||||||
|
array := NewArrayQueue[int](5)
|
||||||
|
array.Enqueue(1)
|
||||||
|
array.Enqueue(2)
|
||||||
|
array.Dequeue()
|
||||||
|
if array.Contain(1) || !array.Contain(2) {
|
||||||
|
t.Error("array queue includes a dequeued value")
|
||||||
|
}
|
||||||
|
circular := NewCircularQueue[int](4)
|
||||||
|
if circular.Contain(0) {
|
||||||
|
t.Error("empty circular queue contains a zero value")
|
||||||
|
}
|
||||||
|
circular.Enqueue(1)
|
||||||
|
circular.Enqueue(2)
|
||||||
|
circular.Dequeue()
|
||||||
|
circular.Enqueue(3)
|
||||||
|
circular.Enqueue(4)
|
||||||
|
if circular.Contain(0) || circular.Contain(1) || !circular.Contain(4) {
|
||||||
|
t.Error("circular queue did not restrict its search to active values")
|
||||||
|
}
|
||||||
|
}
|
||||||
@@ -27,7 +27,7 @@ func NewLinkedQueue[T any]() *LinkedQueue[T] {
|
|||||||
|
|
||||||
// Data return slice of queue data
|
// Data return slice of queue data
|
||||||
func (q *LinkedQueue[T]) Data() []T {
|
func (q *LinkedQueue[T]) Data() []T {
|
||||||
res := []T{}
|
res := make([]T, 0, q.length)
|
||||||
current := q.head
|
current := q.head
|
||||||
|
|
||||||
for current != nil {
|
for current != nil {
|
||||||
|
|||||||
@@ -7,6 +7,8 @@ import (
|
|||||||
)
|
)
|
||||||
|
|
||||||
func TestLinkedQueue_Enqueue(t *testing.T) {
|
func TestLinkedQueue_Enqueue(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestLinkedQueue_Enqueue")
|
assert := internal.NewAssert(t, "TestLinkedQueue_Enqueue")
|
||||||
|
|
||||||
queue := NewLinkedQueue[int]()
|
queue := NewLinkedQueue[int]()
|
||||||
@@ -19,6 +21,8 @@ func TestLinkedQueue_Enqueue(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestLinkedQueue_Dequeue(t *testing.T) {
|
func TestLinkedQueue_Dequeue(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestLinkedQueue_DeQueue")
|
assert := internal.NewAssert(t, "TestLinkedQueue_DeQueue")
|
||||||
|
|
||||||
queue := NewLinkedQueue[int]()
|
queue := NewLinkedQueue[int]()
|
||||||
@@ -35,6 +39,8 @@ func TestLinkedQueue_Dequeue(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestLinkedQueue_Front(t *testing.T) {
|
func TestLinkedQueue_Front(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestLinkedQueue_Front")
|
assert := internal.NewAssert(t, "TestLinkedQueue_Front")
|
||||||
|
|
||||||
queue := NewLinkedQueue[int]()
|
queue := NewLinkedQueue[int]()
|
||||||
@@ -51,6 +57,8 @@ func TestLinkedQueue_Front(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestLinkedQueue_Back(t *testing.T) {
|
func TestLinkedQueue_Back(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestLinkedQueue_Back")
|
assert := internal.NewAssert(t, "TestLinkedQueue_Back")
|
||||||
|
|
||||||
queue := NewLinkedQueue[int]()
|
queue := NewLinkedQueue[int]()
|
||||||
@@ -67,6 +75,8 @@ func TestLinkedQueue_Back(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestLinkedQueue_Clear(t *testing.T) {
|
func TestLinkedQueue_Clear(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestLinkedQueue_Back")
|
assert := internal.NewAssert(t, "TestLinkedQueue_Back")
|
||||||
|
|
||||||
queue := NewLinkedQueue[int]()
|
queue := NewLinkedQueue[int]()
|
||||||
@@ -82,10 +92,11 @@ func TestLinkedQueue_Clear(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestLinkedQueue_Contain(t *testing.T) {
|
func TestLinkedQueue_Contain(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestLinkedQueue_Contain")
|
assert := internal.NewAssert(t, "TestLinkedQueue_Contain")
|
||||||
|
|
||||||
queue := NewLinkedQueue[int]()
|
queue := NewLinkedQueue[int]()
|
||||||
|
|
||||||
queue.Enqueue(1)
|
queue.Enqueue(1)
|
||||||
queue.Enqueue(2)
|
queue.Enqueue(2)
|
||||||
queue.Enqueue(3)
|
queue.Enqueue(3)
|
||||||
|
|||||||
@@ -8,20 +8,20 @@ package datastructure
|
|||||||
import (
|
import (
|
||||||
"errors"
|
"errors"
|
||||||
|
|
||||||
"github.com/duke-git/lancet/v2/lancetconstraints"
|
"github.com/duke-git/lancet/v2/constraints"
|
||||||
)
|
)
|
||||||
|
|
||||||
// PriorityQueue is a priority queue implemented by binary heap tree
|
// PriorityQueue is a priority queue implemented by binary heap tree
|
||||||
// type T should implements Compare function in lancetconstraints.Comparator interface.
|
// type T should implements Compare function in constraints.Comparator interface.
|
||||||
type PriorityQueue[T any] struct {
|
type PriorityQueue[T any] struct {
|
||||||
items []T
|
items []T
|
||||||
size int
|
size int
|
||||||
comparator lancetconstraints.Comparator
|
comparator constraints.Comparator
|
||||||
}
|
}
|
||||||
|
|
||||||
// NewPriorityQueue return a pointer of PriorityQueue
|
// NewPriorityQueue return a pointer of PriorityQueue
|
||||||
// param `comparator` is used to compare values in the queue
|
// param `comparator` is used to compare values in the queue
|
||||||
func NewPriorityQueue[T any](capacity int, comparator lancetconstraints.Comparator) *PriorityQueue[T] {
|
func NewPriorityQueue[T any](capacity int, comparator constraints.Comparator) *PriorityQueue[T] {
|
||||||
return &PriorityQueue[T]{
|
return &PriorityQueue[T]{
|
||||||
items: make([]T, capacity+1),
|
items: make([]T, capacity+1),
|
||||||
size: 0,
|
size: 0,
|
||||||
|
|||||||
@@ -20,6 +20,8 @@ func (c *intComparator) Compare(v1, v2 any) int {
|
|||||||
return 0
|
return 0
|
||||||
}
|
}
|
||||||
func TestPriorityQueue_Enqueue(t *testing.T) {
|
func TestPriorityQueue_Enqueue(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestPriorityQueue_Enqueue")
|
assert := internal.NewAssert(t, "TestPriorityQueue_Enqueue")
|
||||||
|
|
||||||
comparator := &intComparator{}
|
comparator := &intComparator{}
|
||||||
@@ -45,6 +47,8 @@ func TestPriorityQueue_Enqueue(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestPriorityQueue_Dequeue(t *testing.T) {
|
func TestPriorityQueue_Dequeue(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestPriorityQueue_Dequeue")
|
assert := internal.NewAssert(t, "TestPriorityQueue_Dequeue")
|
||||||
|
|
||||||
comparator := &intComparator{}
|
comparator := &intComparator{}
|
||||||
|
|||||||
+44
-23
@@ -4,19 +4,21 @@
|
|||||||
// Package datastructure contains some data structure. Set is a data container, like slice, but element of set is not duplicate.
|
// Package datastructure contains some data structure. Set is a data container, like slice, but element of set is not duplicate.
|
||||||
package datastructure
|
package datastructure
|
||||||
|
|
||||||
|
import "sort"
|
||||||
|
|
||||||
// Set is a data container, like slice, but element of set is not duplicate.
|
// Set is a data container, like slice, but element of set is not duplicate.
|
||||||
type Set[T comparable] map[T]struct{}
|
type Set[T comparable] map[T]struct{}
|
||||||
|
|
||||||
// NewSet return a instance of set
|
// New create a instance of set from given values.
|
||||||
func NewSet[T comparable](items ...T) Set[T] {
|
func New[T comparable](items ...T) Set[T] {
|
||||||
set := make(Set[T])
|
set := make(Set[T], len(items))
|
||||||
set.Add(items...)
|
set.Add(items...)
|
||||||
return set
|
return set
|
||||||
}
|
}
|
||||||
|
|
||||||
// NewSetFromSlice create a set from slice
|
// FromSlice create a set from given slice.
|
||||||
func NewSetFromSlice[T comparable](items []T) Set[T] {
|
func FromSlice[T comparable](items []T) Set[T] {
|
||||||
set := make(Set[T])
|
set := make(Set[T], len(items))
|
||||||
for _, item := range items {
|
for _, item := range items {
|
||||||
set.Add(item)
|
set.Add(item)
|
||||||
}
|
}
|
||||||
@@ -77,8 +79,7 @@ func (s Set[T]) ContainAll(other Set[T]) bool {
|
|||||||
|
|
||||||
// Clone return a copy of set
|
// Clone return a copy of set
|
||||||
func (s Set[T]) Clone() Set[T] {
|
func (s Set[T]) Clone() Set[T] {
|
||||||
set := NewSet[T]()
|
set := FromSlice(s.ToSlice())
|
||||||
set.Add(s.Values()...)
|
|
||||||
return set
|
return set
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -116,14 +117,11 @@ func (s Set[T]) Size() int {
|
|||||||
}
|
}
|
||||||
|
|
||||||
// Values return all values of set
|
// Values return all values of set
|
||||||
|
// Deprecated: Values function is deprecated and will be removed in future versions. Please use ToSlice() function instead.
|
||||||
|
//
|
||||||
|
// The ToSlice() function provides the same functionality as Values and returns a slice containing all values of the set.
|
||||||
func (s Set[T]) Values() []T {
|
func (s Set[T]) Values() []T {
|
||||||
result := make([]T, 0, len(s))
|
return s.ToSlice()
|
||||||
|
|
||||||
s.Iterate(func(value T) {
|
|
||||||
result = append(result, value)
|
|
||||||
})
|
|
||||||
|
|
||||||
return result
|
|
||||||
}
|
}
|
||||||
|
|
||||||
// Union creates a new set contain all element of set s and other
|
// Union creates a new set contain all element of set s and other
|
||||||
@@ -135,7 +133,7 @@ func (s Set[T]) Union(other Set[T]) Set[T] {
|
|||||||
|
|
||||||
// Intersection creates a new set whose element both be contained in set s and other
|
// Intersection creates a new set whose element both be contained in set s and other
|
||||||
func (s Set[T]) Intersection(other Set[T]) Set[T] {
|
func (s Set[T]) Intersection(other Set[T]) Set[T] {
|
||||||
set := NewSet[T]()
|
set := New[T]()
|
||||||
s.Iterate(func(value T) {
|
s.Iterate(func(value T) {
|
||||||
if other.Contain(value) {
|
if other.Contain(value) {
|
||||||
set.Add(value)
|
set.Add(value)
|
||||||
@@ -147,7 +145,7 @@ func (s Set[T]) Intersection(other Set[T]) Set[T] {
|
|||||||
|
|
||||||
// SymmetricDifference creates a new set whose element is in set1 or set2, but not in both sets
|
// SymmetricDifference creates a new set whose element is in set1 or set2, but not in both sets
|
||||||
func (s Set[T]) SymmetricDifference(other Set[T]) Set[T] {
|
func (s Set[T]) SymmetricDifference(other Set[T]) Set[T] {
|
||||||
set := NewSet[T]()
|
set := New[T]()
|
||||||
s.Iterate(func(value T) {
|
s.Iterate(func(value T) {
|
||||||
if !other.Contain(value) {
|
if !other.Contain(value) {
|
||||||
set.Add(value)
|
set.Add(value)
|
||||||
@@ -163,9 +161,9 @@ func (s Set[T]) SymmetricDifference(other Set[T]) Set[T] {
|
|||||||
return set
|
return set
|
||||||
}
|
}
|
||||||
|
|
||||||
// Minus creates an set of whose element in origin set but not in compared set
|
// Minus creates a set of whose element in origin set but not in compared set
|
||||||
func (s Set[T]) Minus(comparedSet Set[T]) Set[T] {
|
func (s Set[T]) Minus(comparedSet Set[T]) Set[T] {
|
||||||
set := NewSet[T]()
|
set := New[T]()
|
||||||
|
|
||||||
s.Iterate(func(value T) {
|
s.Iterate(func(value T) {
|
||||||
if !comparedSet.Contain(value) {
|
if !comparedSet.Contain(value) {
|
||||||
@@ -189,11 +187,34 @@ func (s Set[T]) EachWithBreak(iteratee func(item T) bool) {
|
|||||||
// Pop delete the top element of set then return it, if set is empty, return nil-value of T and false.
|
// Pop delete the top element of set then return it, if set is empty, return nil-value of T and false.
|
||||||
func (s Set[T]) Pop() (v T, ok bool) {
|
func (s Set[T]) Pop() (v T, ok bool) {
|
||||||
if len(s) > 0 {
|
if len(s) > 0 {
|
||||||
items := s.Values()
|
for item := range s {
|
||||||
item := items[len(s)-1]
|
v = item
|
||||||
delete(s, item)
|
delete(s, item)
|
||||||
return item, true
|
return v, true
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
return v, false
|
return v, false
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// ToSlice returns a slice containing all values of the set.
|
||||||
|
func (s Set[T]) ToSlice() []T {
|
||||||
|
if s.IsEmpty() {
|
||||||
|
return []T{}
|
||||||
|
}
|
||||||
|
result := make([]T, 0, s.Size())
|
||||||
|
s.Iterate(func(value T) {
|
||||||
|
result = append(result, value)
|
||||||
|
})
|
||||||
|
|
||||||
|
return result
|
||||||
|
}
|
||||||
|
|
||||||
|
// ToSortedSlice returns a sorted slice containing all values of the set.
|
||||||
|
func (s Set[T]) ToSortedSlice(less func(v1, v2 T) bool) []T {
|
||||||
|
result := s.ToSlice()
|
||||||
|
sort.Slice(result, func(i, j int) bool {
|
||||||
|
return less(result[i], result[j])
|
||||||
|
})
|
||||||
|
return result
|
||||||
|
}
|
||||||
+161
-57
@@ -1,50 +1,60 @@
|
|||||||
package datastructure
|
package datastructure
|
||||||
|
|
||||||
import (
|
import (
|
||||||
|
"reflect"
|
||||||
|
"sort"
|
||||||
"testing"
|
"testing"
|
||||||
|
|
||||||
"github.com/duke-git/lancet/v2/internal"
|
"github.com/duke-git/lancet/v2/internal"
|
||||||
)
|
)
|
||||||
|
|
||||||
func TestSet_NewSetFromSlice(t *testing.T) {
|
func TestSet_FromSlice(t *testing.T) {
|
||||||
assert := internal.NewAssert(t, "TestSet_NewSetFromSlice")
|
t.Parallel()
|
||||||
|
|
||||||
s1 := NewSetFromSlice([]int{1, 2, 2, 3})
|
assert := internal.NewAssert(t, "TestSet_FromSlice")
|
||||||
|
|
||||||
|
s1 := FromSlice([]int{1, 2, 2, 3})
|
||||||
assert.Equal(3, s1.Size())
|
assert.Equal(3, s1.Size())
|
||||||
assert.Equal(true, s1.Contain(1))
|
assert.Equal(true, s1.Contain(1))
|
||||||
assert.Equal(true, s1.Contain(2))
|
assert.Equal(true, s1.Contain(2))
|
||||||
assert.Equal(true, s1.Contain(3))
|
assert.Equal(true, s1.Contain(3))
|
||||||
|
|
||||||
s2 := NewSetFromSlice([]int{})
|
s2 := FromSlice([]int{})
|
||||||
assert.Equal(0, s2.Size())
|
assert.Equal(0, s2.Size())
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestSet_Add(t *testing.T) {
|
func TestSet_Add(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestSet_Add")
|
assert := internal.NewAssert(t, "TestSet_Add")
|
||||||
|
|
||||||
set := NewSet[int]()
|
set := New[int]()
|
||||||
set.Add(1, 2, 3)
|
set.Add(1, 2, 3)
|
||||||
|
|
||||||
expected := NewSet(1, 2, 3)
|
cmpSet := New(1, 2, 3)
|
||||||
|
|
||||||
assert.Equal(true, set.Equal(expected))
|
assert.Equal(true, set.Equal(cmpSet))
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestSet_AddIfNotExist(t *testing.T) {
|
func TestSet_AddIfNotExist(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestSet_AddIfNotExist")
|
assert := internal.NewAssert(t, "TestSet_AddIfNotExist")
|
||||||
|
|
||||||
set := NewSet[int]()
|
set := New[int]()
|
||||||
set.Add(1, 2, 3)
|
set.Add(1, 2, 3)
|
||||||
|
|
||||||
assert.Equal(false, set.AddIfNotExist(1))
|
assert.Equal(false, set.AddIfNotExist(1))
|
||||||
assert.Equal(true, set.AddIfNotExist(4))
|
assert.Equal(true, set.AddIfNotExist(4))
|
||||||
assert.Equal(NewSet(1, 2, 3, 4), set)
|
assert.Equal(New(1, 2, 3, 4), set)
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestSet_AddIfNotExistBy(t *testing.T) {
|
func TestSet_AddIfNotExistBy(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestSet_AddIfNotExistBy")
|
assert := internal.NewAssert(t, "TestSet_AddIfNotExistBy")
|
||||||
|
|
||||||
set := NewSet[int]()
|
set := New[int]()
|
||||||
set.Add(1, 2)
|
set.Add(1, 2)
|
||||||
|
|
||||||
ok := set.AddIfNotExistBy(3, func(val int) bool {
|
ok := set.AddIfNotExistBy(3, func(val int) bool {
|
||||||
@@ -63,9 +73,11 @@ func TestSet_AddIfNotExistBy(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestSet_Contain(t *testing.T) {
|
func TestSet_Contain(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestSet_Contain")
|
assert := internal.NewAssert(t, "TestSet_Contain")
|
||||||
|
|
||||||
set := NewSet[int]()
|
set := New[int]()
|
||||||
set.Add(1, 2, 3)
|
set.Add(1, 2, 3)
|
||||||
|
|
||||||
assert.Equal(true, set.Contain(1))
|
assert.Equal(true, set.Contain(1))
|
||||||
@@ -73,20 +85,24 @@ func TestSet_Contain(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestSet_ContainAll(t *testing.T) {
|
func TestSet_ContainAll(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestSet_ContainAll")
|
assert := internal.NewAssert(t, "TestSet_ContainAll")
|
||||||
|
|
||||||
set1 := NewSet(1, 2, 3)
|
set1 := New(1, 2, 3)
|
||||||
set2 := NewSet(1, 2)
|
set2 := New(1, 2)
|
||||||
set3 := NewSet(1, 2, 3, 4)
|
set3 := New(1, 2, 3, 4)
|
||||||
|
|
||||||
assert.Equal(true, set1.ContainAll(set2))
|
assert.Equal(true, set1.ContainAll(set2))
|
||||||
assert.Equal(false, set1.ContainAll(set3))
|
assert.Equal(false, set1.ContainAll(set3))
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestSet_Clone(t *testing.T) {
|
func TestSet_Clone(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestSet_Clone")
|
assert := internal.NewAssert(t, "TestSet_Clone")
|
||||||
|
|
||||||
set1 := NewSet(1, 2, 3)
|
set1 := New(1, 2, 3)
|
||||||
set2 := set1.Clone()
|
set2 := set1.Clone()
|
||||||
|
|
||||||
assert.Equal(true, set1.Size() == set2.Size())
|
assert.Equal(true, set1.Size() == set2.Size())
|
||||||
@@ -94,32 +110,36 @@ func TestSet_Clone(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestSet_Delete(t *testing.T) {
|
func TestSet_Delete(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestSet_Delete")
|
assert := internal.NewAssert(t, "TestSet_Delete")
|
||||||
|
|
||||||
set := NewSet[int]()
|
set := New[int]()
|
||||||
set.Add(1, 2, 3)
|
set.Add(1, 2, 3)
|
||||||
set.Delete(3)
|
set.Delete(3)
|
||||||
|
|
||||||
expected := NewSet(1, 2)
|
assert.Equal(true, set.Equal(New(1, 2)))
|
||||||
|
|
||||||
assert.Equal(true, set.Equal(expected))
|
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestSet_Equal(t *testing.T) {
|
func TestSet_Equal(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestSet_Equal")
|
assert := internal.NewAssert(t, "TestSet_Equal")
|
||||||
|
|
||||||
set1 := NewSet(1, 2, 3)
|
set1 := New(1, 2, 3)
|
||||||
set2 := NewSet(1, 2, 3)
|
set2 := New(1, 2, 3)
|
||||||
set3 := NewSet(1, 2, 3, 4)
|
set3 := New(1, 2, 3, 4)
|
||||||
|
|
||||||
assert.Equal(true, set1.Equal(set2))
|
assert.Equal(true, set1.Equal(set2))
|
||||||
assert.Equal(false, set1.Equal(set3))
|
assert.Equal(false, set1.Equal(set3))
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestSet_Iterate(t *testing.T) {
|
func TestSet_Iterate(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestSet_Iterate")
|
assert := internal.NewAssert(t, "TestSet_Iterate")
|
||||||
|
|
||||||
set := NewSet(1, 2, 3)
|
set := New(1, 2, 3)
|
||||||
arr := []int{}
|
arr := []int{}
|
||||||
set.Iterate(func(value int) {
|
set.Iterate(func(value int) {
|
||||||
arr = append(arr, value)
|
arr = append(arr, value)
|
||||||
@@ -129,72 +149,85 @@ func TestSet_Iterate(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestSet_IsEmpty(t *testing.T) {
|
func TestSet_IsEmpty(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestSet_IsEmpty")
|
assert := internal.NewAssert(t, "TestSet_IsEmpty")
|
||||||
|
|
||||||
set := NewSet[int]()
|
set := New[int]()
|
||||||
assert.Equal(true, set.IsEmpty())
|
assert.Equal(true, set.IsEmpty())
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestSet_Size(t *testing.T) {
|
func TestSet_Size(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestSet_Size")
|
assert := internal.NewAssert(t, "TestSet_Size")
|
||||||
|
|
||||||
set := NewSet(1, 2, 3)
|
set := New(1, 2, 3)
|
||||||
assert.Equal(3, set.Size())
|
assert.Equal(3, set.Size())
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestSet_Values(t *testing.T) {
|
func TestSet_Values(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestSet_Values")
|
assert := internal.NewAssert(t, "TestSet_Values")
|
||||||
|
|
||||||
set := NewSet(1, 2, 3)
|
set := New(1, 2, 3)
|
||||||
values := set.Values()
|
values := set.Values()
|
||||||
|
|
||||||
assert.Equal(3, len(values))
|
assert.Equal(3, len(values))
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestSet_Union(t *testing.T) {
|
func TestSet_Union(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestSet_Union")
|
assert := internal.NewAssert(t, "TestSet_Union")
|
||||||
|
|
||||||
set1 := NewSet(1, 2, 3)
|
set1 := New(1, 2, 3)
|
||||||
set2 := NewSet(2, 3, 4, 5)
|
set2 := New(2, 3, 4, 5)
|
||||||
expected := NewSet(1, 2, 3, 4, 5)
|
|
||||||
unionSet := set1.Union(set2)
|
unionSet := set1.Union(set2)
|
||||||
|
|
||||||
assert.Equal(expected, unionSet)
|
assert.Equal(New(1, 2, 3, 4, 5), unionSet)
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestSet_Intersection(t *testing.T) {
|
func TestSet_Intersection(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestSet_Intersection")
|
assert := internal.NewAssert(t, "TestSet_Intersection")
|
||||||
|
|
||||||
set1 := NewSet(1, 2, 3)
|
set1 := New(1, 2, 3)
|
||||||
set2 := NewSet(2, 3, 4, 5)
|
set2 := New(2, 3, 4, 5)
|
||||||
expected := NewSet(2, 3)
|
|
||||||
intersectionSet := set1.Intersection(set2)
|
intersectionSet := set1.Intersection(set2)
|
||||||
|
|
||||||
assert.Equal(expected, intersectionSet)
|
assert.Equal(New(2, 3), intersectionSet)
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestSet_SymmetricDifference(t *testing.T) {
|
func TestSet_SymmetricDifference(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestSet_SymmetricDifference")
|
assert := internal.NewAssert(t, "TestSet_SymmetricDifference")
|
||||||
|
|
||||||
set1 := NewSet(1, 2, 3)
|
set1 := New(1, 2, 3)
|
||||||
set2 := NewSet(2, 3, 4, 5)
|
set2 := New(2, 3, 4, 5)
|
||||||
|
|
||||||
assert.Equal(NewSet(1, 4, 5), set1.SymmetricDifference(set2))
|
assert.Equal(New(1, 4, 5), set1.SymmetricDifference(set2))
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestSet_Minus(t *testing.T) {
|
func TestSet_Minus(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestSet_Minus")
|
assert := internal.NewAssert(t, "TestSet_Minus")
|
||||||
|
|
||||||
set1 := NewSet(1, 2, 3)
|
set1 := New(1, 2, 3)
|
||||||
set2 := NewSet(2, 3, 4, 5)
|
set2 := New(2, 3, 4, 5)
|
||||||
set3 := NewSet(2, 3)
|
set3 := New(2, 3)
|
||||||
|
|
||||||
assert.Equal(NewSet(1), set1.Minus(set2))
|
assert.Equal(New(1), set1.Minus(set2))
|
||||||
assert.Equal(NewSet(4, 5), set2.Minus(set3))
|
assert.Equal(New(4, 5), set2.Minus(set3))
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestEachWithBreak(t *testing.T) {
|
func TestEachWithBreak(t *testing.T) {
|
||||||
// s := NewSet(1, 2, 3, 4, 5)
|
// s := New(1, 2, 3, 4, 5)
|
||||||
|
|
||||||
// var sum int
|
// var sum int
|
||||||
|
|
||||||
@@ -210,22 +243,93 @@ func TestEachWithBreak(t *testing.T) {
|
|||||||
// assert.Equal(6, sum)
|
// assert.Equal(6, sum)
|
||||||
}
|
}
|
||||||
|
|
||||||
// func TestPop(t *testing.T) {
|
func TestPop(t *testing.T) {
|
||||||
// assert := internal.NewAssert(t, "TestPop")
|
t.Parallel()
|
||||||
|
assert := internal.NewAssert(t, "TestSet_Pop")
|
||||||
|
|
||||||
// s := NewSet[int]()
|
s := New[int]()
|
||||||
|
|
||||||
// val, ok := s.Pop()
|
val, ok := s.Pop()
|
||||||
// assert.Equal(0, val)
|
assert.Equal(0, val)
|
||||||
// assert.Equal(false, ok)
|
assert.Equal(false, ok)
|
||||||
|
|
||||||
// s.Add(1)
|
s = New(1, 2, 3, 4, 5)
|
||||||
// s.Add(2)
|
sl := s.ToSlice()
|
||||||
// s.Add(3)
|
|
||||||
|
|
||||||
// // s = NewSet(1, 2, 3, 4, 5)
|
val, ok = s.Pop()
|
||||||
|
assert.Equal(false, s.Contain(val))
|
||||||
|
assert.Equal(true, ok)
|
||||||
|
assert.Equal(len(sl)-1, s.Size())
|
||||||
|
|
||||||
// val, ok = s.Pop()
|
var found bool
|
||||||
// assert.Equal(3, val)
|
|
||||||
// assert.Equal(true, ok)
|
for _, v := range sl {
|
||||||
// }
|
if v == val {
|
||||||
|
found = true
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
assert.Equal(true, found)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestSet_ToSlice(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestSet_ToSlice")
|
||||||
|
|
||||||
|
set1 := FromSlice([]int{6, 3, 1, 5, 6, 7, 1})
|
||||||
|
set2 := FromSlice([]float64{-2.65, 4.25, 4.25 - 3.14, 0})
|
||||||
|
set3 := New[string]()
|
||||||
|
|
||||||
|
slice1 := set1.ToSlice()
|
||||||
|
slice2 := set2.ToSlice()
|
||||||
|
slice3 := set3.ToSlice()
|
||||||
|
|
||||||
|
sort.Ints(slice1)
|
||||||
|
sort.Float64s(slice2)
|
||||||
|
|
||||||
|
assert.Equal(5, len(slice1))
|
||||||
|
assert.Equal(4, len(slice2))
|
||||||
|
assert.Equal(0, len(slice3))
|
||||||
|
|
||||||
|
assert.Equal(true, reflect.DeepEqual(slice1, []int{1, 3, 5, 6, 7}))
|
||||||
|
assert.Equal(true, reflect.DeepEqual(slice2, []float64{-2.65, 0, 1.11, 4.25}))
|
||||||
|
assert.Equal("[]string", reflect.TypeOf(slice3).String())
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestSet_ToSortedSlice(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestSet_ToSortedSlice")
|
||||||
|
|
||||||
|
set1 := FromSlice([]int{6, 3, 1, 5, 6, 7, 1})
|
||||||
|
set2 := FromSlice([]float64{-2.65, 4.25, 4.25 - 3.14, 0})
|
||||||
|
|
||||||
|
type Person struct {
|
||||||
|
Name string
|
||||||
|
Age int
|
||||||
|
}
|
||||||
|
set3 := FromSlice([]Person{{"Tom", 20}, {"Jerry", 18}, {"Spike", 25}})
|
||||||
|
|
||||||
|
slice1 := set1.ToSortedSlice(func(v1, v2 int) bool {
|
||||||
|
return v1 < v2
|
||||||
|
})
|
||||||
|
slice2 := set2.ToSortedSlice(func(v1, v2 float64) bool {
|
||||||
|
return v2 < v1
|
||||||
|
})
|
||||||
|
slice3 := set3.ToSortedSlice(func(v1, v2 Person) bool {
|
||||||
|
return v1.Age < v2.Age
|
||||||
|
})
|
||||||
|
|
||||||
|
assert.Equal(5, len(slice1))
|
||||||
|
assert.Equal(4, len(slice2))
|
||||||
|
assert.Equal(3, len(slice3))
|
||||||
|
|
||||||
|
assert.Equal(true, reflect.DeepEqual(slice1, []int{1, 3, 5, 6, 7}))
|
||||||
|
assert.Equal(true, reflect.DeepEqual(slice2, []float64{4.25, 1.11, 0, -2.65}))
|
||||||
|
assert.Equal(true, reflect.DeepEqual(slice3, []Person{
|
||||||
|
{"Jerry", 18},
|
||||||
|
{"Tom", 20},
|
||||||
|
{"Spike", 25},
|
||||||
|
}))
|
||||||
|
}
|
||||||
@@ -7,6 +7,8 @@ import (
|
|||||||
)
|
)
|
||||||
|
|
||||||
func TestArrayStack_Push(t *testing.T) {
|
func TestArrayStack_Push(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestArrayStack_Push")
|
assert := internal.NewAssert(t, "TestArrayStack_Push")
|
||||||
|
|
||||||
stack := NewArrayStack[int]()
|
stack := NewArrayStack[int]()
|
||||||
@@ -14,15 +16,16 @@ func TestArrayStack_Push(t *testing.T) {
|
|||||||
stack.Push(2)
|
stack.Push(2)
|
||||||
stack.Push(3)
|
stack.Push(3)
|
||||||
|
|
||||||
expected := []int{3, 2, 1}
|
|
||||||
values := stack.Data()
|
values := stack.Data()
|
||||||
length := stack.Size()
|
length := stack.Size()
|
||||||
|
|
||||||
assert.Equal(expected, values)
|
assert.Equal([]int{3, 2, 1}, values)
|
||||||
assert.Equal(3, length)
|
assert.Equal(3, length)
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestArrayStack_Pop(t *testing.T) {
|
func TestArrayStack_Pop(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestArrayStack_Pop")
|
assert := internal.NewAssert(t, "TestArrayStack_Pop")
|
||||||
|
|
||||||
stack := NewArrayStack[int]()
|
stack := NewArrayStack[int]()
|
||||||
@@ -37,11 +40,12 @@ func TestArrayStack_Pop(t *testing.T) {
|
|||||||
assert.IsNil(err)
|
assert.IsNil(err)
|
||||||
assert.Equal(3, *topItem)
|
assert.Equal(3, *topItem)
|
||||||
|
|
||||||
expected := []int{2, 1}
|
assert.Equal([]int{2, 1}, stack.Data())
|
||||||
assert.Equal(expected, stack.Data())
|
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestArrayStack_Peak(t *testing.T) {
|
func TestArrayStack_Peak(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestArrayStack_Peak")
|
assert := internal.NewAssert(t, "TestArrayStack_Peak")
|
||||||
|
|
||||||
stack := NewArrayStack[int]()
|
stack := NewArrayStack[int]()
|
||||||
@@ -56,11 +60,12 @@ func TestArrayStack_Peak(t *testing.T) {
|
|||||||
assert.IsNil(err)
|
assert.IsNil(err)
|
||||||
assert.Equal(3, *topItem)
|
assert.Equal(3, *topItem)
|
||||||
|
|
||||||
expected := []int{3, 2, 1}
|
assert.Equal([]int{3, 2, 1}, stack.Data())
|
||||||
assert.Equal(expected, stack.Data())
|
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestArrayStack_Clear(t *testing.T) {
|
func TestArrayStack_Clear(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestArrayStack_Clear")
|
assert := internal.NewAssert(t, "TestArrayStack_Clear")
|
||||||
|
|
||||||
stack := NewArrayStack[int]()
|
stack := NewArrayStack[int]()
|
||||||
|
|||||||
@@ -24,7 +24,7 @@ func NewLinkedStack[T any]() *LinkedStack[T] {
|
|||||||
|
|
||||||
// Data return stack data
|
// Data return stack data
|
||||||
func (s *LinkedStack[T]) Data() []T {
|
func (s *LinkedStack[T]) Data() []T {
|
||||||
res := []T{}
|
res := make([]T, 0, s.length)
|
||||||
current := s.top
|
current := s.top
|
||||||
|
|
||||||
for current != nil {
|
for current != nil {
|
||||||
|
|||||||
@@ -7,6 +7,8 @@ import (
|
|||||||
)
|
)
|
||||||
|
|
||||||
func TestLinkedStack_Push(t *testing.T) {
|
func TestLinkedStack_Push(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestLinkedStack_Push")
|
assert := internal.NewAssert(t, "TestLinkedStack_Push")
|
||||||
|
|
||||||
stack := NewLinkedStack[int]()
|
stack := NewLinkedStack[int]()
|
||||||
@@ -14,15 +16,16 @@ func TestLinkedStack_Push(t *testing.T) {
|
|||||||
stack.Push(2)
|
stack.Push(2)
|
||||||
stack.Push(3)
|
stack.Push(3)
|
||||||
|
|
||||||
expected := []int{3, 2, 1}
|
|
||||||
values := stack.Data()
|
values := stack.Data()
|
||||||
size := stack.Size()
|
size := stack.Size()
|
||||||
|
|
||||||
assert.Equal(expected, values)
|
assert.Equal([]int{3, 2, 1}, values)
|
||||||
assert.Equal(3, size)
|
assert.Equal(3, size)
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestLinkedStack_Pop(t *testing.T) {
|
func TestLinkedStack_Pop(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestLinkedStack_Pop")
|
assert := internal.NewAssert(t, "TestLinkedStack_Pop")
|
||||||
|
|
||||||
stack := NewLinkedStack[int]()
|
stack := NewLinkedStack[int]()
|
||||||
@@ -37,12 +40,13 @@ func TestLinkedStack_Pop(t *testing.T) {
|
|||||||
assert.IsNil(err)
|
assert.IsNil(err)
|
||||||
assert.Equal(3, *topItem)
|
assert.Equal(3, *topItem)
|
||||||
|
|
||||||
expected := []int{2, 1}
|
|
||||||
stack.Print()
|
stack.Print()
|
||||||
assert.Equal(expected, stack.Data())
|
assert.Equal([]int{2, 1}, stack.Data())
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestLinkedStack_Peak(t *testing.T) {
|
func TestLinkedStack_Peak(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestLinkedStack_Peak")
|
assert := internal.NewAssert(t, "TestLinkedStack_Peak")
|
||||||
|
|
||||||
stack := NewLinkedStack[int]()
|
stack := NewLinkedStack[int]()
|
||||||
@@ -57,11 +61,12 @@ func TestLinkedStack_Peak(t *testing.T) {
|
|||||||
assert.IsNil(err)
|
assert.IsNil(err)
|
||||||
assert.Equal(3, *topItem)
|
assert.Equal(3, *topItem)
|
||||||
|
|
||||||
expected := []int{3, 2, 1}
|
assert.Equal([]int{3, 2, 1}, stack.Data())
|
||||||
assert.Equal(expected, stack.Data())
|
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestLinkedStack_Empty(t *testing.T) {
|
func TestLinkedStack_Empty(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestLinkedStack_Empty")
|
assert := internal.NewAssert(t, "TestLinkedStack_Empty")
|
||||||
|
|
||||||
stack := NewLinkedStack[int]()
|
stack := NewLinkedStack[int]()
|
||||||
|
|||||||
@@ -7,22 +7,22 @@ package datastructure
|
|||||||
import (
|
import (
|
||||||
"math"
|
"math"
|
||||||
|
|
||||||
|
"github.com/duke-git/lancet/v2/constraints"
|
||||||
"github.com/duke-git/lancet/v2/datastructure"
|
"github.com/duke-git/lancet/v2/datastructure"
|
||||||
"github.com/duke-git/lancet/v2/lancetconstraints"
|
|
||||||
)
|
)
|
||||||
|
|
||||||
// BSTree is a binary search tree data structure in which each node has at most two children,
|
// BSTree is a binary search tree data structure in which each node has at most two children,
|
||||||
// which are referred to as the left child and the right child.
|
// which are referred to as the left child and the right child.
|
||||||
// In BSTree: leftNode < rootNode < rightNode
|
// In BSTree: leftNode < rootNode < rightNode
|
||||||
// type T should implements Compare function in lancetconstraints.Comparator interface.
|
// type T should implements Compare function in constraints.Comparator interface.
|
||||||
type BSTree[T any] struct {
|
type BSTree[T any] struct {
|
||||||
root *datastructure.TreeNode[T]
|
root *datastructure.TreeNode[T]
|
||||||
comparator lancetconstraints.Comparator
|
comparator constraints.Comparator
|
||||||
}
|
}
|
||||||
|
|
||||||
// NewBSTree create a BSTree pointer
|
// NewBSTree create a BSTree pointer
|
||||||
// param `comparator` is used to compare values in the tree
|
// param `comparator` is used to compare values in the tree
|
||||||
func NewBSTree[T any](rootData T, comparator lancetconstraints.Comparator) *BSTree[T] {
|
func NewBSTree[T any](rootData T, comparator constraints.Comparator) *BSTree[T] {
|
||||||
root := datastructure.NewTreeNode(rootData)
|
root := datastructure.NewTreeNode(rootData)
|
||||||
return &BSTree[T]{root, comparator}
|
return &BSTree[T]{root, comparator}
|
||||||
}
|
}
|
||||||
@@ -87,7 +87,7 @@ func (t *BSTree[T]) HasSubTree(subTree *BSTree[T]) bool {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func hasSubTree[T any](superTreeRoot, subTreeRoot *datastructure.TreeNode[T],
|
func hasSubTree[T any](superTreeRoot, subTreeRoot *datastructure.TreeNode[T],
|
||||||
comparator lancetconstraints.Comparator) bool {
|
comparator constraints.Comparator) bool {
|
||||||
result := false
|
result := false
|
||||||
|
|
||||||
if superTreeRoot != nil && subTreeRoot != nil {
|
if superTreeRoot != nil && subTreeRoot != nil {
|
||||||
|
|||||||
@@ -20,16 +20,9 @@ func (c *intComparator) Compare(v1, v2 any) int {
|
|||||||
return 0
|
return 0
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestBSTree_Insert(t *testing.T) {
|
|
||||||
bstree := NewBSTree(6, &intComparator{})
|
|
||||||
|
|
||||||
bstree.Insert(7)
|
|
||||||
bstree.Insert(5)
|
|
||||||
bstree.Insert(2)
|
|
||||||
bstree.Insert(4)
|
|
||||||
}
|
|
||||||
|
|
||||||
func TestBSTree_PreOrderTraverse(t *testing.T) {
|
func TestBSTree_PreOrderTraverse(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestBSTree_PreOrderTraverse")
|
assert := internal.NewAssert(t, "TestBSTree_PreOrderTraverse")
|
||||||
|
|
||||||
bstree := NewBSTree(6, &intComparator{})
|
bstree := NewBSTree(6, &intComparator{})
|
||||||
@@ -44,6 +37,8 @@ func TestBSTree_PreOrderTraverse(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestBSTree_PostOrderTraverse(t *testing.T) {
|
func TestBSTree_PostOrderTraverse(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestBSTree_PostOrderTraverse")
|
assert := internal.NewAssert(t, "TestBSTree_PostOrderTraverse")
|
||||||
|
|
||||||
bstree := NewBSTree(6, &intComparator{})
|
bstree := NewBSTree(6, &intComparator{})
|
||||||
@@ -58,6 +53,8 @@ func TestBSTree_PostOrderTraverse(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestBSTree_InOrderTraverse(t *testing.T) {
|
func TestBSTree_InOrderTraverse(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestBSTree_InOrderTraverse")
|
assert := internal.NewAssert(t, "TestBSTree_InOrderTraverse")
|
||||||
|
|
||||||
bstree := NewBSTree(6, &intComparator{})
|
bstree := NewBSTree(6, &intComparator{})
|
||||||
@@ -72,6 +69,8 @@ func TestBSTree_InOrderTraverse(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestBSTree_LevelOrderTraverse(t *testing.T) {
|
func TestBSTree_LevelOrderTraverse(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestBSTree_LevelOrderTraverse")
|
assert := internal.NewAssert(t, "TestBSTree_LevelOrderTraverse")
|
||||||
|
|
||||||
bstree := NewBSTree(6, &intComparator{})
|
bstree := NewBSTree(6, &intComparator{})
|
||||||
@@ -86,6 +85,8 @@ func TestBSTree_LevelOrderTraverse(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestBSTree_Delete(t *testing.T) {
|
func TestBSTree_Delete(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestBSTree_Delete")
|
assert := internal.NewAssert(t, "TestBSTree_Delete")
|
||||||
|
|
||||||
bstree := NewBSTree(6, &intComparator{})
|
bstree := NewBSTree(6, &intComparator{})
|
||||||
@@ -99,15 +100,11 @@ func TestBSTree_Delete(t *testing.T) {
|
|||||||
|
|
||||||
acturl1 := bstree.InOrderTraverse()
|
acturl1 := bstree.InOrderTraverse()
|
||||||
assert.Equal([]int{2, 5, 6, 7}, acturl1)
|
assert.Equal([]int{2, 5, 6, 7}, acturl1)
|
||||||
|
|
||||||
//todo
|
|
||||||
// bstree.DeletetNode(6, comparator)
|
|
||||||
// bstree.Print()
|
|
||||||
// acturl2 := bstree.InOrderTraverse()
|
|
||||||
// assert.Equal([]int{2, 5, 7}, acturl2)
|
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestBSTree_Depth(t *testing.T) {
|
func TestBSTree_Depth(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestBSTree_Depth")
|
assert := internal.NewAssert(t, "TestBSTree_Depth")
|
||||||
|
|
||||||
bstree := NewBSTree(6, &intComparator{})
|
bstree := NewBSTree(6, &intComparator{})
|
||||||
@@ -121,6 +118,8 @@ func TestBSTree_Depth(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestBSTree_IsSubTree(t *testing.T) {
|
func TestBSTree_IsSubTree(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestBSTree_IsSubTree")
|
assert := internal.NewAssert(t, "TestBSTree_IsSubTree")
|
||||||
|
|
||||||
superTree := NewBSTree(8, &intComparator{})
|
superTree := NewBSTree(8, &intComparator{})
|
||||||
|
|||||||
@@ -4,8 +4,8 @@ import (
|
|||||||
"fmt"
|
"fmt"
|
||||||
"math"
|
"math"
|
||||||
|
|
||||||
|
"github.com/duke-git/lancet/v2/constraints"
|
||||||
"github.com/duke-git/lancet/v2/datastructure"
|
"github.com/duke-git/lancet/v2/datastructure"
|
||||||
"github.com/duke-git/lancet/v2/lancetconstraints"
|
|
||||||
)
|
)
|
||||||
|
|
||||||
func preOrderTraverse[T any](node *datastructure.TreeNode[T]) []T {
|
func preOrderTraverse[T any](node *datastructure.TreeNode[T]) []T {
|
||||||
@@ -86,7 +86,7 @@ func levelOrderTraverse[T any](root *datastructure.TreeNode[T], traversal *[]T)
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
func insertTreeNode[T any](rootNode, newNode *datastructure.TreeNode[T], comparator lancetconstraints.Comparator) {
|
func insertTreeNode[T any](rootNode, newNode *datastructure.TreeNode[T], comparator constraints.Comparator) {
|
||||||
if comparator.Compare(newNode.Value, rootNode.Value) == -1 {
|
if comparator.Compare(newNode.Value, rootNode.Value) == -1 {
|
||||||
if rootNode.Left == nil {
|
if rootNode.Left == nil {
|
||||||
rootNode.Left = newNode
|
rootNode.Left = newNode
|
||||||
@@ -103,7 +103,7 @@ func insertTreeNode[T any](rootNode, newNode *datastructure.TreeNode[T], compara
|
|||||||
}
|
}
|
||||||
|
|
||||||
// todo, delete root node failed
|
// todo, delete root node failed
|
||||||
func deleteTreeNode[T any](node *datastructure.TreeNode[T], data T, comparator lancetconstraints.Comparator) *datastructure.TreeNode[T] {
|
func deleteTreeNode[T any](node *datastructure.TreeNode[T], data T, comparator constraints.Comparator) *datastructure.TreeNode[T] {
|
||||||
if node == nil {
|
if node == nil {
|
||||||
return nil
|
return nil
|
||||||
}
|
}
|
||||||
@@ -147,7 +147,7 @@ func printTreeNodes[T any](nodes []*datastructure.TreeNode[T], level, maxLevel i
|
|||||||
|
|
||||||
printSpaces(firstSpaces)
|
printSpaces(firstSpaces)
|
||||||
|
|
||||||
newNodes := []*datastructure.TreeNode[T]{}
|
newNodes := make([]*datastructure.TreeNode[T], 0, len(nodes)*2)
|
||||||
for _, node := range nodes {
|
for _, node := range nodes {
|
||||||
if node != nil {
|
if node != nil {
|
||||||
fmt.Printf("%v", node.Value)
|
fmt.Printf("%v", node.Value)
|
||||||
@@ -216,7 +216,7 @@ func calculateDepth[T any](node *datastructure.TreeNode[T], depth int) int {
|
|||||||
return max(calculateDepth(node.Left, depth+1), calculateDepth(node.Right, depth+1))
|
return max(calculateDepth(node.Left, depth+1), calculateDepth(node.Right, depth+1))
|
||||||
}
|
}
|
||||||
|
|
||||||
func isSubTree[T any](superTreeRoot, subTreeRoot *datastructure.TreeNode[T], comparator lancetconstraints.Comparator) bool {
|
func isSubTree[T any](superTreeRoot, subTreeRoot *datastructure.TreeNode[T], comparator constraints.Comparator) bool {
|
||||||
if subTreeRoot == nil {
|
if subTreeRoot == nil {
|
||||||
return true
|
return true
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -7,6 +7,8 @@ import (
|
|||||||
)
|
)
|
||||||
|
|
||||||
func TestToUnix(t *testing.T) {
|
func TestToUnix(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestToUnix")
|
assert := internal.NewAssert(t, "TestToUnix")
|
||||||
|
|
||||||
tm1 := NewUnixNow()
|
tm1 := NewUnixNow()
|
||||||
@@ -17,6 +19,8 @@ func TestToUnix(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestToFormat(t *testing.T) {
|
func TestToFormat(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestToFormat")
|
assert := internal.NewAssert(t, "TestToFormat")
|
||||||
|
|
||||||
tm, err := NewFormat("2022-03-18 17:04:05")
|
tm, err := NewFormat("2022-03-18 17:04:05")
|
||||||
@@ -25,18 +29,21 @@ func TestToFormat(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestToFormatForTpl(t *testing.T) {
|
func TestToFormatForTpl(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestToFormatForTpl")
|
assert := internal.NewAssert(t, "TestToFormatForTpl")
|
||||||
|
|
||||||
_, err := NewFormat("2022/03/18 17:04:05")
|
_, err := NewFormat("2022/03/18 17:04:05")
|
||||||
assert.IsNotNil(err)
|
assert.IsNotNil(err)
|
||||||
|
|
||||||
tm, err := NewFormat("2022-03-18 17:04:05")
|
tm, err := NewFormat("2022-03-18 17:04:05")
|
||||||
// assert.Equal("2022/03/18 17:04:05", tm.ToFormatForTpl("2006/01/02 15:04:05"))
|
|
||||||
t.Log("TestToFormatForTpl", tm.ToFormatForTpl("2006/01/02 15:04:05"))
|
t.Log("TestToFormatForTpl", tm.ToFormatForTpl("2006/01/02 15:04:05"))
|
||||||
assert.IsNil(err)
|
assert.IsNil(err)
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestToIso8601(t *testing.T) {
|
func TestToIso8601(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestToIso8601")
|
assert := internal.NewAssert(t, "TestToIso8601")
|
||||||
|
|
||||||
_, err := NewISO8601("2022-03-18 17:04:05")
|
_, err := NewISO8601("2022-03-18 17:04:05")
|
||||||
@@ -44,6 +51,5 @@ func TestToIso8601(t *testing.T) {
|
|||||||
|
|
||||||
tm, err := NewISO8601("2006-01-02T15:04:05.999Z")
|
tm, err := NewISO8601("2006-01-02T15:04:05.999Z")
|
||||||
t.Log("TestToIso8601", tm.ToIso8601())
|
t.Log("TestToIso8601", tm.ToIso8601())
|
||||||
// assert.Equal("2006-01-02T23:04:05+08:00", tm.ToIso8601())
|
|
||||||
assert.IsNil(err)
|
assert.IsNil(err)
|
||||||
}
|
}
|
||||||
+331
-36
@@ -3,7 +3,7 @@
|
|||||||
|
|
||||||
// Package datetime implements some functions to format date and time.
|
// Package datetime implements some functions to format date and time.
|
||||||
// Note:
|
// Note:
|
||||||
// 1. `format` param in FormatTimeToStr function should be as flow:
|
// 1. `format` param in FormatTimeToStr function should be as flow (case no sensitive):
|
||||||
// "yyyy-mm-dd hh:mm:ss"
|
// "yyyy-mm-dd hh:mm:ss"
|
||||||
// "yyyy-mm-dd hh:mm"
|
// "yyyy-mm-dd hh:mm"
|
||||||
// "yyyy-mm-dd hh"
|
// "yyyy-mm-dd hh"
|
||||||
@@ -18,14 +18,20 @@
|
|||||||
// "yyyy/mm"
|
// "yyyy/mm"
|
||||||
// "mm/dd"
|
// "mm/dd"
|
||||||
// "dd/mm/yy hh:mm:ss"
|
// "dd/mm/yy hh:mm:ss"
|
||||||
|
// "yyyymmdd"
|
||||||
|
// "mmddyy"
|
||||||
// "yyyy"
|
// "yyyy"
|
||||||
|
// "yy"
|
||||||
// "mm"
|
// "mm"
|
||||||
// "hh:mm:ss"
|
// "hh:mm:ss"
|
||||||
|
// "hh:mm"
|
||||||
// "mm:ss"
|
// "mm:ss"
|
||||||
package datetime
|
package datetime
|
||||||
|
|
||||||
import (
|
import (
|
||||||
"fmt"
|
"fmt"
|
||||||
|
"runtime"
|
||||||
|
"strings"
|
||||||
"time"
|
"time"
|
||||||
)
|
)
|
||||||
|
|
||||||
@@ -47,35 +53,106 @@ func init() {
|
|||||||
"yyyy/mm": "2006/01",
|
"yyyy/mm": "2006/01",
|
||||||
"mm/dd": "01/02",
|
"mm/dd": "01/02",
|
||||||
"dd/mm/yy hh:mm:ss": "02/01/06 15:04:05",
|
"dd/mm/yy hh:mm:ss": "02/01/06 15:04:05",
|
||||||
|
"yyyymmdd": "20060102",
|
||||||
|
"mmddyy": "010206",
|
||||||
"yyyy": "2006",
|
"yyyy": "2006",
|
||||||
|
"yy": "06",
|
||||||
"mm": "01",
|
"mm": "01",
|
||||||
"hh:mm:ss": "15:04:05",
|
"hh:mm:ss": "15:04:05",
|
||||||
|
"hh:mm": "15:04",
|
||||||
"mm:ss": "04:05",
|
"mm:ss": "04:05",
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// AddMinute add or sub minute to the time.
|
// AddMinute add or sub minutes to the time.
|
||||||
// Play: https://go.dev/play/p/nT1heB1KUUK
|
// Play: https://go.dev/play/p/nT1heB1KUUK
|
||||||
func AddMinute(t time.Time, minute int64) time.Time {
|
func AddMinute(t time.Time, minutes int64) time.Time {
|
||||||
return t.Add(time.Minute * time.Duration(minute))
|
return t.Add(time.Minute * time.Duration(minutes))
|
||||||
}
|
}
|
||||||
|
|
||||||
// AddHour add or sub hour to the time.
|
// AddHour add or sub hours to the time.
|
||||||
// Play: https://go.dev/play/p/rcMjd7OCsi5
|
// Play: https://go.dev/play/p/rcMjd7OCsi5
|
||||||
func AddHour(t time.Time, hour int64) time.Time {
|
func AddHour(t time.Time, hours int64) time.Time {
|
||||||
return t.Add(time.Hour * time.Duration(hour))
|
return t.Add(time.Hour * time.Duration(hours))
|
||||||
}
|
}
|
||||||
|
|
||||||
// AddDay add or sub day to the time.
|
// AddDay add or sub days to the time.
|
||||||
// Play: https://go.dev/play/p/dIGbs_uTdFa
|
// Play: https://go.dev/play/p/dIGbs_uTdFa
|
||||||
func AddDay(t time.Time, day int64) time.Time {
|
func AddDay(t time.Time, days int64) time.Time {
|
||||||
return t.Add(24 * time.Hour * time.Duration(day))
|
return t.Add(24 * time.Hour * time.Duration(days))
|
||||||
|
}
|
||||||
|
|
||||||
|
// AddWeek add or sub weeks to the time.
|
||||||
|
// play: https://go.dev/play/p/M9TqdMiaA2p
|
||||||
|
func AddWeek(t time.Time, weeks int64) time.Time {
|
||||||
|
return t.Add(7 * 24 * time.Hour * time.Duration(weeks))
|
||||||
|
}
|
||||||
|
|
||||||
|
// AddMonth add or sub months to the time.
|
||||||
|
// Play: https://go.dev/play/p/DLoiOnpLvsN
|
||||||
|
func AddMonth(t time.Time, months int64) time.Time {
|
||||||
|
return t.AddDate(0, int(months), 0)
|
||||||
}
|
}
|
||||||
|
|
||||||
// AddYear add or sub year to the time.
|
// AddYear add or sub year to the time.
|
||||||
// Play: https://go.dev/play/p/MqW2ujnBx10
|
// Play: https://go.dev/play/p/MqW2ujnBx10
|
||||||
func AddYear(t time.Time, year int64) time.Time {
|
func AddYear(t time.Time, year int64) time.Time {
|
||||||
return t.Add(365 * 24 * time.Hour * time.Duration(year))
|
return t.AddDate(int(year), 0, 0)
|
||||||
|
}
|
||||||
|
|
||||||
|
// AddDaySafe add or sub days to the time and ensure that the returned date does not exceed the valid date of the target year and month.
|
||||||
|
// Play: https://go.dev/play/p/JTohZFpoDJ3
|
||||||
|
func AddDaySafe(t time.Time, days int) time.Time {
|
||||||
|
t = t.AddDate(0, 0, days)
|
||||||
|
year, month, day := t.Date()
|
||||||
|
|
||||||
|
lastDayOfMonth := time.Date(year, month+1, 0, 0, 0, 0, 0, t.Location()).Day()
|
||||||
|
|
||||||
|
if day > lastDayOfMonth {
|
||||||
|
t = time.Date(year, month, lastDayOfMonth, t.Hour(), t.Minute(), t.Second(), t.Nanosecond(), t.Location())
|
||||||
|
}
|
||||||
|
|
||||||
|
return t
|
||||||
|
}
|
||||||
|
|
||||||
|
// AddMonthSafe add or sub months to the time and ensure that the returned date does not exceed the valid date of the target year and month.
|
||||||
|
// Play: https://go.dev/play/p/KLw0lo6mbVW
|
||||||
|
func AddMonthSafe(t time.Time, months int) time.Time {
|
||||||
|
year := t.Year()
|
||||||
|
month := int(t.Month()) + months
|
||||||
|
|
||||||
|
for month > 12 {
|
||||||
|
month -= 12
|
||||||
|
year++
|
||||||
|
}
|
||||||
|
for month < 1 {
|
||||||
|
month += 12
|
||||||
|
year--
|
||||||
|
}
|
||||||
|
|
||||||
|
daysInMonth := time.Date(year, time.Month(month+1), 0, 0, 0, 0, 0, time.UTC).Day()
|
||||||
|
|
||||||
|
day := t.Day()
|
||||||
|
if day > daysInMonth {
|
||||||
|
day = daysInMonth
|
||||||
|
}
|
||||||
|
|
||||||
|
return time.Date(year, time.Month(month), day, t.Hour(), t.Minute(), t.Second(), t.Nanosecond(), t.Location())
|
||||||
|
}
|
||||||
|
|
||||||
|
// AddYearSafe add or sub years to the time and ensure that the returned date does not exceed the valid date of the target year and month.
|
||||||
|
// Play: https://go.dev/play/p/KVGXWZZ54ZH
|
||||||
|
func AddYearSafe(t time.Time, years int) time.Time {
|
||||||
|
year, month, day := t.Date()
|
||||||
|
year += years
|
||||||
|
|
||||||
|
if month == time.February && day == 29 {
|
||||||
|
if !IsLeapYear(year) {
|
||||||
|
day = 28
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return time.Date(year, month, day, t.Hour(), t.Minute(), t.Second(), t.Nanosecond(), t.Location())
|
||||||
}
|
}
|
||||||
|
|
||||||
// GetNowDate return format yyyy-mm-dd of current date.
|
// GetNowDate return format yyyy-mm-dd of current date.
|
||||||
@@ -96,6 +173,18 @@ func GetNowDateTime() string {
|
|||||||
return time.Now().Format("2006-01-02 15:04:05")
|
return time.Now().Format("2006-01-02 15:04:05")
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// GetTodayStartTime return the start time of today, format: yyyy-mm-dd 00:00:00.
|
||||||
|
// Play: https://go.dev/play/p/84siyYF7t99
|
||||||
|
func GetTodayStartTime() string {
|
||||||
|
return time.Now().Format("2006-01-02") + " 00:00:00"
|
||||||
|
}
|
||||||
|
|
||||||
|
// GetTodayEndTime return the end time of today, format: yyyy-mm-dd 23:59:59.
|
||||||
|
// Play: https://go.dev/play/p/jjrLnfoqgn3
|
||||||
|
func GetTodayEndTime() string {
|
||||||
|
return time.Now().Format("2006-01-02") + " 23:59:59"
|
||||||
|
}
|
||||||
|
|
||||||
// GetZeroHourTimestamp return timestamp of zero hour (timestamp of 00:00).
|
// GetZeroHourTimestamp return timestamp of zero hour (timestamp of 00:00).
|
||||||
// Play: https://go.dev/play/p/QmL2oIaGE3q
|
// Play: https://go.dev/play/p/QmL2oIaGE3q
|
||||||
func GetZeroHourTimestamp() int64 {
|
func GetZeroHourTimestamp() int64 {
|
||||||
@@ -112,19 +201,40 @@ func GetNightTimestamp() int64 {
|
|||||||
|
|
||||||
// FormatTimeToStr convert time to string.
|
// FormatTimeToStr convert time to string.
|
||||||
// Play: https://go.dev/play/p/_Ia7M8H_OvE
|
// Play: https://go.dev/play/p/_Ia7M8H_OvE
|
||||||
func FormatTimeToStr(t time.Time, format string) string {
|
func FormatTimeToStr(t time.Time, format string, timezone ...string) string {
|
||||||
return t.Format(timeFormat[format])
|
tf, ok := timeFormat[strings.ToLower(format)]
|
||||||
|
if !ok {
|
||||||
|
return ""
|
||||||
|
}
|
||||||
|
|
||||||
|
if len(timezone) > 0 && timezone[0] != "" {
|
||||||
|
loc, err := time.LoadLocation(timezone[0])
|
||||||
|
if err != nil {
|
||||||
|
return ""
|
||||||
|
}
|
||||||
|
return t.In(loc).Format(tf)
|
||||||
|
}
|
||||||
|
return t.Format(tf)
|
||||||
}
|
}
|
||||||
|
|
||||||
// FormatStrToTime convert string to time.
|
// FormatStrToTime convert string to time.
|
||||||
// Play: https://go.dev/play/p/1h9FwdU8ql4
|
// Play: https://go.dev/play/p/1h9FwdU8ql4
|
||||||
func FormatStrToTime(str, format string) (time.Time, error) {
|
func FormatStrToTime(str, format string, timezone ...string) (time.Time, error) {
|
||||||
v, ok := timeFormat[format]
|
tf, ok := timeFormat[strings.ToLower(format)]
|
||||||
if !ok {
|
if !ok {
|
||||||
return time.Time{}, fmt.Errorf("format %s not found", format)
|
return time.Time{}, fmt.Errorf("format %s not support", format)
|
||||||
}
|
}
|
||||||
|
|
||||||
return time.Parse(v, str)
|
if len(timezone) > 0 && timezone[0] != "" {
|
||||||
|
loc, err := time.LoadLocation(timezone[0])
|
||||||
|
if err != nil {
|
||||||
|
return time.Time{}, err
|
||||||
|
}
|
||||||
|
|
||||||
|
return time.ParseInLocation(tf, str, loc)
|
||||||
|
}
|
||||||
|
|
||||||
|
return time.Parse(tf, str)
|
||||||
}
|
}
|
||||||
|
|
||||||
// BeginOfMinute return beginning minute time of day.
|
// BeginOfMinute return beginning minute time of day.
|
||||||
@@ -170,13 +280,9 @@ func EndOfDay(t time.Time) time.Time {
|
|||||||
}
|
}
|
||||||
|
|
||||||
// BeginOfWeek return beginning week, default week begin from Sunday.
|
// BeginOfWeek return beginning week, default week begin from Sunday.
|
||||||
// Play: https://go.dev/play/p/ynjoJPz7VNV
|
// Play: https://go.dev/play/p/DCHdcL6gnfV
|
||||||
func BeginOfWeek(t time.Time, beginFrom ...time.Weekday) time.Time {
|
func BeginOfWeek(t time.Time, beginFrom time.Weekday) time.Time {
|
||||||
var beginFromWeekday = time.Sunday
|
y, m, d := t.AddDate(0, 0, int(beginFrom-t.Weekday())).Date()
|
||||||
if len(beginFrom) > 0 {
|
|
||||||
beginFromWeekday = beginFrom[0]
|
|
||||||
}
|
|
||||||
y, m, d := t.AddDate(0, 0, int(beginFromWeekday-t.Weekday())).Date()
|
|
||||||
beginOfWeek := time.Date(y, m, d, 0, 0, 0, 0, t.Location())
|
beginOfWeek := time.Date(y, m, d, 0, 0, 0, 0, t.Location())
|
||||||
if beginOfWeek.After(t) {
|
if beginOfWeek.After(t) {
|
||||||
return beginOfWeek.AddDate(0, 0, -7)
|
return beginOfWeek.AddDate(0, 0, -7)
|
||||||
@@ -185,13 +291,9 @@ func BeginOfWeek(t time.Time, beginFrom ...time.Weekday) time.Time {
|
|||||||
}
|
}
|
||||||
|
|
||||||
// EndOfWeek return end week time, default week end with Saturday.
|
// EndOfWeek return end week time, default week end with Saturday.
|
||||||
// Play: https://go.dev/play/p/i08qKXD9flf
|
// Play: https://go.dev/play/p/mGSA162YgX9
|
||||||
func EndOfWeek(t time.Time, endWith ...time.Weekday) time.Time {
|
func EndOfWeek(t time.Time, endWith time.Weekday) time.Time {
|
||||||
var endWithWeekday = time.Saturday
|
y, m, d := t.AddDate(0, 0, int(endWith-t.Weekday())).Date()
|
||||||
if len(endWith) > 0 {
|
|
||||||
endWithWeekday = endWith[0]
|
|
||||||
}
|
|
||||||
y, m, d := t.AddDate(0, 0, int(endWithWeekday-t.Weekday())).Date()
|
|
||||||
var endWithWeek = time.Date(y, m, d, 23, 59, 59, int(time.Second-time.Nanosecond), t.Location())
|
var endWithWeek = time.Date(y, m, d, 23, 59, 59, int(time.Second-time.Nanosecond), t.Location())
|
||||||
if endWithWeek.Before(t) {
|
if endWithWeek.Before(t) {
|
||||||
endWithWeek = endWithWeek.AddDate(0, 0, 7)
|
endWithWeek = endWithWeek.AddDate(0, 0, 7)
|
||||||
@@ -241,15 +343,208 @@ func BetweenSeconds(t1 time.Time, t2 time.Time) int64 {
|
|||||||
// DayOfYear returns which day of the year the parameter date `t` is.
|
// DayOfYear returns which day of the year the parameter date `t` is.
|
||||||
// Play: https://go.dev/play/p/0hjqhTwFNlH
|
// Play: https://go.dev/play/p/0hjqhTwFNlH
|
||||||
func DayOfYear(t time.Time) int {
|
func DayOfYear(t time.Time) int {
|
||||||
y, m, d := t.Date()
|
return t.YearDay() - 1
|
||||||
firstDay := time.Date(y, 1, 1, 0, 0, 0, 0, t.Location())
|
|
||||||
nowDate := time.Date(y, m, d, 0, 0, 0, 0, t.Location())
|
|
||||||
|
|
||||||
return int(nowDate.Sub(firstDay).Hours() / 24)
|
|
||||||
}
|
}
|
||||||
|
|
||||||
// IsWeekend checks if passed time is weekend or not.
|
// IsWeekend checks if passed time is weekend or not.
|
||||||
// Play: https://go.dev/play/p/cupRM5aZOIY
|
// Play: https://go.dev/play/p/cupRM5aZOIY
|
||||||
|
// Deprecated Use '== Weekday' instead
|
||||||
func IsWeekend(t time.Time) bool {
|
func IsWeekend(t time.Time) bool {
|
||||||
return time.Saturday == t.Weekday() || time.Sunday == t.Weekday()
|
return time.Saturday == t.Weekday() || time.Sunday == t.Weekday()
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// NowDateOrTime return current datetime with specific format and timezone.
|
||||||
|
// Play: https://go.dev/play/p/EZ-begEjtT0
|
||||||
|
func NowDateOrTime(format string, timezone ...string) string {
|
||||||
|
tf, ok := timeFormat[strings.ToLower(format)]
|
||||||
|
if !ok {
|
||||||
|
return ""
|
||||||
|
}
|
||||||
|
|
||||||
|
if len(timezone) > 0 && timezone[0] != "" {
|
||||||
|
loc, err := time.LoadLocation(timezone[0])
|
||||||
|
if err != nil {
|
||||||
|
return ""
|
||||||
|
}
|
||||||
|
|
||||||
|
return time.Now().In(loc).Format(tf)
|
||||||
|
}
|
||||||
|
|
||||||
|
return time.Now().Format(tf)
|
||||||
|
}
|
||||||
|
|
||||||
|
// Timestamp return current second timestamp.
|
||||||
|
// Play: https://go.dev/play/p/iU5b7Vvjx6x
|
||||||
|
func Timestamp(timezone ...string) int64 {
|
||||||
|
t := time.Now()
|
||||||
|
|
||||||
|
if len(timezone) > 0 && timezone[0] != "" {
|
||||||
|
loc, err := time.LoadLocation(timezone[0])
|
||||||
|
if err != nil {
|
||||||
|
return 0
|
||||||
|
}
|
||||||
|
|
||||||
|
t = t.In(loc)
|
||||||
|
}
|
||||||
|
|
||||||
|
return t.Unix()
|
||||||
|
}
|
||||||
|
|
||||||
|
// TimestampMilli return current mill second timestamp.
|
||||||
|
// Play: https://go.dev/play/p/4gvEusOTu1T
|
||||||
|
func TimestampMilli(timezone ...string) int64 {
|
||||||
|
t := time.Now()
|
||||||
|
|
||||||
|
if len(timezone) > 0 && timezone[0] != "" {
|
||||||
|
loc, err := time.LoadLocation(timezone[0])
|
||||||
|
if err != nil {
|
||||||
|
return 0
|
||||||
|
}
|
||||||
|
t = t.In(loc)
|
||||||
|
}
|
||||||
|
|
||||||
|
return int64(time.Nanosecond) * t.UnixNano() / int64(time.Millisecond)
|
||||||
|
}
|
||||||
|
|
||||||
|
// TimestampMicro return current micro second timestamp.
|
||||||
|
// Play: https://go.dev/play/p/2maANglKHQE
|
||||||
|
func TimestampMicro(timezone ...string) int64 {
|
||||||
|
t := time.Now()
|
||||||
|
|
||||||
|
if len(timezone) > 0 && timezone[0] != "" {
|
||||||
|
loc, err := time.LoadLocation(timezone[0])
|
||||||
|
if err != nil {
|
||||||
|
return 0
|
||||||
|
}
|
||||||
|
t = t.In(loc)
|
||||||
|
}
|
||||||
|
|
||||||
|
return int64(time.Nanosecond) * t.UnixNano() / int64(time.Microsecond)
|
||||||
|
}
|
||||||
|
|
||||||
|
// TimestampNano return current nano second timestamp.
|
||||||
|
// Play: https://go.dev/play/p/A9Oq_COrcCF
|
||||||
|
func TimestampNano(timezone ...string) int64 {
|
||||||
|
t := time.Now()
|
||||||
|
|
||||||
|
if len(timezone) > 0 && timezone[0] != "" {
|
||||||
|
loc, err := time.LoadLocation(timezone[0])
|
||||||
|
if err != nil {
|
||||||
|
return 0
|
||||||
|
}
|
||||||
|
t = t.In(loc)
|
||||||
|
}
|
||||||
|
|
||||||
|
return t.UnixNano()
|
||||||
|
}
|
||||||
|
|
||||||
|
// TrackFuncTime track the time of function execution.
|
||||||
|
// call it at top of the func like `defer TrackFuncTime(time.Now())()`
|
||||||
|
// Play: https://go.dev/play/p/QBSEdfXHPTp
|
||||||
|
func TrackFuncTime(pre time.Time) func() {
|
||||||
|
callerName := getCallerName()
|
||||||
|
return func() {
|
||||||
|
elapsed := time.Since(pre)
|
||||||
|
fmt.Printf("Function %s execution time:\t %v", callerName, elapsed)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
func getCallerName() string {
|
||||||
|
pc, _, _, ok := runtime.Caller(2)
|
||||||
|
if !ok {
|
||||||
|
return "Unknown"
|
||||||
|
}
|
||||||
|
fn := runtime.FuncForPC(pc)
|
||||||
|
if fn == nil {
|
||||||
|
return "Unknown"
|
||||||
|
}
|
||||||
|
|
||||||
|
fullName := fn.Name()
|
||||||
|
if lastDot := strings.LastIndex(fullName, "."); lastDot != -1 {
|
||||||
|
return fullName[lastDot+1:]
|
||||||
|
}
|
||||||
|
|
||||||
|
return fullName
|
||||||
|
}
|
||||||
|
|
||||||
|
// DaysBetween returns the number of days between two times.
|
||||||
|
// Play: https://go.dev/play/p/qD6qGb3TbOy
|
||||||
|
func DaysBetween(start, end time.Time) int {
|
||||||
|
duration := end.Sub(start)
|
||||||
|
days := int(duration.Hours() / 24)
|
||||||
|
|
||||||
|
return days
|
||||||
|
}
|
||||||
|
|
||||||
|
// GenerateDatetimesBetween returns a slice of strings between two times.
|
||||||
|
// layout: the format of the datetime string
|
||||||
|
// interval: the interval between two datetimes
|
||||||
|
// Play: https://go.dev/play/p/6kHBpAxD9ZC
|
||||||
|
func GenerateDatetimesBetween(start, end time.Time, layout string, interval string) ([]string, error) {
|
||||||
|
var result []string
|
||||||
|
|
||||||
|
if start.After(end) {
|
||||||
|
start, end = end, start
|
||||||
|
}
|
||||||
|
|
||||||
|
duration, err := time.ParseDuration(interval)
|
||||||
|
if err != nil {
|
||||||
|
return nil, err
|
||||||
|
}
|
||||||
|
if duration <= 0 {
|
||||||
|
return nil, fmt.Errorf("interval must be positive")
|
||||||
|
}
|
||||||
|
|
||||||
|
for current := start; !current.After(end); current = current.Add(duration) {
|
||||||
|
result = append(result, current.Format(layout))
|
||||||
|
}
|
||||||
|
|
||||||
|
return result, nil
|
||||||
|
}
|
||||||
|
|
||||||
|
// Min returns the earliest time among the given times.
|
||||||
|
// Play: https://go.dev/play/p/MCIDvHNOGGb
|
||||||
|
func Min(t1 time.Time, times ...time.Time) time.Time {
|
||||||
|
minTime := t1
|
||||||
|
|
||||||
|
for _, t := range times {
|
||||||
|
if t.Before(minTime) {
|
||||||
|
minTime = t
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return minTime
|
||||||
|
}
|
||||||
|
|
||||||
|
// Max returns the latest time among the given times.
|
||||||
|
// Play: https://go.dev/play/p/9m6JMk1LB7-
|
||||||
|
func Max(t1 time.Time, times ...time.Time) time.Time {
|
||||||
|
maxTime := t1
|
||||||
|
|
||||||
|
for _, t := range times {
|
||||||
|
if t.After(maxTime) {
|
||||||
|
maxTime = t
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return maxTime
|
||||||
|
}
|
||||||
|
|
||||||
|
// MaxMin returns the latest and earliest time among the given times.
|
||||||
|
// Play: https://go.dev/play/p/rbW51cDtM_2
|
||||||
|
func MaxMin(t1 time.Time, times ...time.Time) (maxTime time.Time, minTime time.Time) {
|
||||||
|
maxTime = t1
|
||||||
|
minTime = t1
|
||||||
|
|
||||||
|
for _, t := range times {
|
||||||
|
if t.Before(minTime) {
|
||||||
|
minTime = t
|
||||||
|
}
|
||||||
|
|
||||||
|
if t.After(maxTime) {
|
||||||
|
maxTime = t
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return maxTime, minTime
|
||||||
|
}
|
||||||
@@ -7,71 +7,141 @@ import (
|
|||||||
)
|
)
|
||||||
|
|
||||||
func ExampleAddDay() {
|
func ExampleAddDay() {
|
||||||
now := time.Now()
|
date, _ := time.Parse("2006-01-02 15:04:05", "2021-01-01 00:00:00")
|
||||||
|
|
||||||
tomorrow := AddDay(now, 1)
|
after1Day := AddDay(date, 1)
|
||||||
diff1 := tomorrow.Sub(now)
|
before1Day := AddDay(date, -1)
|
||||||
|
|
||||||
yesterday := AddDay(now, -1)
|
fmt.Println(after1Day.Format("2006-01-02 15:04:05"))
|
||||||
diff2 := yesterday.Sub(now)
|
fmt.Println(before1Day.Format("2006-01-02 15:04:05"))
|
||||||
|
|
||||||
fmt.Println(diff1)
|
|
||||||
fmt.Println(diff2)
|
|
||||||
|
|
||||||
// Output:
|
// Output:
|
||||||
// 24h0m0s
|
// 2021-01-02 00:00:00
|
||||||
// -24h0m0s
|
// 2020-12-31 00:00:00
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleAddWeek() {
|
||||||
|
date, _ := time.Parse("2006-01-02", "2021-01-01")
|
||||||
|
|
||||||
|
after2Weeks := AddWeek(date, 2)
|
||||||
|
before2Weeks := AddWeek(date, -2)
|
||||||
|
|
||||||
|
fmt.Println(after2Weeks.Format("2006-01-02"))
|
||||||
|
fmt.Println(before2Weeks.Format("2006-01-02"))
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// 2021-01-15
|
||||||
|
// 2020-12-18
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleAddMonth() {
|
||||||
|
date, _ := time.Parse("2006-01-02", "2021-01-01")
|
||||||
|
|
||||||
|
after2Months := AddMonth(date, 2)
|
||||||
|
before2Months := AddMonth(date, -2)
|
||||||
|
|
||||||
|
fmt.Println(after2Months.Format("2006-01-02"))
|
||||||
|
fmt.Println(before2Months.Format("2006-01-02"))
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// 2021-03-01
|
||||||
|
// 2020-11-01
|
||||||
}
|
}
|
||||||
|
|
||||||
func ExampleAddHour() {
|
func ExampleAddHour() {
|
||||||
now := time.Now()
|
date, _ := time.Parse("2006-01-02 15:04:05", "2021-01-01 00:00:00")
|
||||||
|
|
||||||
after2Hours := AddHour(now, 2)
|
after2Hours := AddHour(date, 2)
|
||||||
diff1 := after2Hours.Sub(now)
|
before2Hours := AddHour(date, -2)
|
||||||
|
|
||||||
before2Hours := AddHour(now, -2)
|
fmt.Println(after2Hours.Format("2006-01-02 15:04:05"))
|
||||||
diff2 := before2Hours.Sub(now)
|
fmt.Println(before2Hours.Format("2006-01-02 15:04:05"))
|
||||||
|
|
||||||
fmt.Println(diff1)
|
|
||||||
fmt.Println(diff2)
|
|
||||||
|
|
||||||
// Output:
|
// Output:
|
||||||
// 2h0m0s
|
// 2021-01-01 02:00:00
|
||||||
// -2h0m0s
|
// 2020-12-31 22:00:00
|
||||||
}
|
}
|
||||||
|
|
||||||
func ExampleAddMinute() {
|
func ExampleAddMinute() {
|
||||||
now := time.Now()
|
date, _ := time.Parse("2006-01-02 15:04:05", "2021-01-01 00:00:00")
|
||||||
|
|
||||||
after2Minutes := AddMinute(now, 2)
|
after2Minutes := AddMinute(date, 2)
|
||||||
diff1 := after2Minutes.Sub(now)
|
before2Minutes := AddMinute(date, -2)
|
||||||
|
|
||||||
before2Minutes := AddMinute(now, -2)
|
fmt.Println(after2Minutes.Format("2006-01-02 15:04:05"))
|
||||||
diff2 := before2Minutes.Sub(now)
|
fmt.Println(before2Minutes.Format("2006-01-02 15:04:05"))
|
||||||
|
|
||||||
fmt.Println(diff1)
|
|
||||||
fmt.Println(diff2)
|
|
||||||
|
|
||||||
// Output:
|
// Output:
|
||||||
// 2m0s
|
// 2021-01-01 00:02:00
|
||||||
// -2m0s
|
// 2020-12-31 23:58:00
|
||||||
}
|
}
|
||||||
|
|
||||||
func ExampleAddYear() {
|
func ExampleAddYear() {
|
||||||
now := time.Now()
|
date, _ := time.Parse("2006-01-02", "2021-01-01")
|
||||||
|
|
||||||
after1Year := AddYear(now, 1)
|
after2Years := AddYear(date, 2)
|
||||||
diff1 := after1Year.Sub(now)
|
before2Years := AddYear(date, -2)
|
||||||
|
|
||||||
before1Year := AddYear(now, -1)
|
fmt.Println(after2Years.Format("2006-01-02"))
|
||||||
diff2 := before1Year.Sub(now)
|
fmt.Println(before2Years.Format("2006-01-02"))
|
||||||
|
|
||||||
fmt.Println(diff1)
|
|
||||||
fmt.Println(diff2)
|
|
||||||
|
|
||||||
// Output:
|
// Output:
|
||||||
// 8760h0m0s
|
// 2023-01-01
|
||||||
// -8760h0m0s
|
// 2019-01-01
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleAddDaySafe() {
|
||||||
|
leapYearDate1, _ := time.Parse("2006-01-02", "2024-02-29")
|
||||||
|
result1 := AddDaySafe(leapYearDate1, 1)
|
||||||
|
|
||||||
|
leapYearDate2, _ := time.Parse("2006-01-02", "2024-03-01")
|
||||||
|
result2 := AddDaySafe(leapYearDate2, -1)
|
||||||
|
|
||||||
|
nonLeapYearDate1, _ := time.Parse("2006-01-02", "2025-02-28")
|
||||||
|
result3 := AddDaySafe(nonLeapYearDate1, 1)
|
||||||
|
|
||||||
|
nonLeaYearDate2, _ := time.Parse("2006-01-02", "2025-03-01")
|
||||||
|
result4 := AddDaySafe(nonLeaYearDate2, -1)
|
||||||
|
|
||||||
|
fmt.Println(result1.Format("2006-01-02"))
|
||||||
|
fmt.Println(result2.Format("2006-01-02"))
|
||||||
|
fmt.Println(result3.Format("2006-01-02"))
|
||||||
|
fmt.Println(result4.Format("2006-01-02"))
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// 2024-03-01
|
||||||
|
// 2024-02-29
|
||||||
|
// 2025-03-01
|
||||||
|
// 2025-02-28
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleAddMonthSafe() {
|
||||||
|
date1, _ := time.Parse("2006-01-02", "2025-01-31")
|
||||||
|
result1 := AddMonthSafe(date1, 1)
|
||||||
|
|
||||||
|
date2, _ := time.Parse("2006-01-02", "2024-02-29")
|
||||||
|
result2 := AddMonthSafe(date2, -1)
|
||||||
|
|
||||||
|
fmt.Println(result1.Format("2006-01-02"))
|
||||||
|
fmt.Println(result2.Format("2006-01-02"))
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// 2025-02-28
|
||||||
|
// 2024-01-29
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleAddYearSafe() {
|
||||||
|
date, _ := time.Parse("2006-01-02", "2020-02-29")
|
||||||
|
|
||||||
|
result1 := AddYearSafe(date, 1)
|
||||||
|
result2 := AddYearSafe(date, -1)
|
||||||
|
|
||||||
|
fmt.Println(result1.Format("2006-01-02"))
|
||||||
|
fmt.Println(result2.Format("2006-01-02"))
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// 2021-02-28
|
||||||
|
// 2019-02-28
|
||||||
}
|
}
|
||||||
|
|
||||||
func ExampleGetNowDate() {
|
func ExampleGetNowDate() {
|
||||||
@@ -229,23 +299,23 @@ func ExampleEndOfDay() {
|
|||||||
func ExampleBeginOfWeek() {
|
func ExampleBeginOfWeek() {
|
||||||
input := time.Date(2023, 1, 8, 18, 50, 10, 100, time.UTC)
|
input := time.Date(2023, 1, 8, 18, 50, 10, 100, time.UTC)
|
||||||
|
|
||||||
result := BeginOfWeek(input)
|
result := BeginOfWeek(input, time.Monday)
|
||||||
|
|
||||||
fmt.Println(result)
|
fmt.Println(result)
|
||||||
|
|
||||||
// Output:
|
// Output:
|
||||||
// 2023-01-08 00:00:00 +0000 UTC
|
// 2023-01-02 00:00:00 +0000 UTC
|
||||||
}
|
}
|
||||||
|
|
||||||
func ExampleEndOfWeek() {
|
func ExampleEndOfWeek() {
|
||||||
input := time.Date(2023, 1, 8, 18, 50, 10, 100, time.UTC)
|
input := time.Date(2023, 1, 8, 18, 50, 10, 100, time.UTC)
|
||||||
|
|
||||||
result := EndOfWeek(input)
|
result := EndOfWeek(input, time.Sunday)
|
||||||
|
|
||||||
fmt.Println(result)
|
fmt.Println(result)
|
||||||
|
|
||||||
// Output:
|
// Output:
|
||||||
// 2023-01-14 23:59:59.999999999 +0000 UTC
|
// 2023-01-08 23:59:59.999999999 +0000 UTC
|
||||||
}
|
}
|
||||||
|
|
||||||
func ExampleBeginOfMonth() {
|
func ExampleBeginOfMonth() {
|
||||||
@@ -408,3 +478,61 @@ func ExampleIsWeekend() {
|
|||||||
// true
|
// true
|
||||||
// false
|
// false
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func ExampleDaysBetween() {
|
||||||
|
start := time.Date(2024, time.September, 1, 0, 0, 0, 0, time.UTC)
|
||||||
|
end := time.Date(2024, time.September, 10, 0, 0, 0, 0, time.UTC)
|
||||||
|
|
||||||
|
result := DaysBetween(start, end)
|
||||||
|
|
||||||
|
fmt.Println(result)
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// 9
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleGenerateDatetimesBetween() {
|
||||||
|
start := time.Date(2024, time.September, 1, 0, 0, 0, 0, time.UTC)
|
||||||
|
end := time.Date(2024, time.September, 1, 2, 0, 0, 0, time.UTC)
|
||||||
|
|
||||||
|
layout := "2006-01-02 15:04:05"
|
||||||
|
interval := "1h"
|
||||||
|
|
||||||
|
result, err := GenerateDatetimesBetween(start, end, layout, interval)
|
||||||
|
|
||||||
|
fmt.Println(result)
|
||||||
|
fmt.Println(err)
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// [2024-09-01 00:00:00 2024-09-01 01:00:00 2024-09-01 02:00:00]
|
||||||
|
// <nil>
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleMin() {
|
||||||
|
result := Min(time.Date(2024, time.September, 1, 0, 0, 0, 0, time.UTC), time.Date(2024, time.September, 2, 0, 0, 0, 0, time.UTC))
|
||||||
|
|
||||||
|
fmt.Println(result)
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// 2024-09-01 00:00:00 +0000 UTC
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleMax() {
|
||||||
|
result := Max(time.Date(2024, time.September, 1, 0, 0, 0, 0, time.UTC), time.Date(2024, time.September, 2, 0, 0, 0, 0, time.UTC))
|
||||||
|
|
||||||
|
fmt.Println(result)
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// 2024-09-02 00:00:00 +0000 UTC
|
||||||
|
}
|
||||||
|
|
||||||
|
func ExampleMaxMin() {
|
||||||
|
max, min := MaxMin(time.Date(2024, time.September, 1, 0, 0, 0, 0, time.UTC), time.Date(2024, time.September, 2, 0, 0, 0, 0, time.UTC), time.Date(2024, time.September, 3, 0, 0, 0, 0, time.UTC))
|
||||||
|
|
||||||
|
fmt.Println(max)
|
||||||
|
fmt.Println(min)
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// 2024-09-03 00:00:00 +0000 UTC
|
||||||
|
// 2024-09-01 00:00:00 +0000 UTC
|
||||||
|
}
|
||||||
+690
-49
@@ -8,90 +8,473 @@ import (
|
|||||||
)
|
)
|
||||||
|
|
||||||
func TestAddYear(t *testing.T) {
|
func TestAddYear(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
assert := internal.NewAssert(t, "TestAddDay")
|
assert := internal.NewAssert(t, "TestAddDay")
|
||||||
|
|
||||||
now := time.Now()
|
tests := []struct {
|
||||||
after2Years := AddYear(now, 1)
|
inputDate string
|
||||||
diff1 := after2Years.Sub(now)
|
years int
|
||||||
assert.Equal(float64(8760), diff1.Hours())
|
expected string
|
||||||
|
}{
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01 00:00:00",
|
||||||
|
years: 1,
|
||||||
|
expected: "2022-01-01 00:00:00",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01 00:00:00",
|
||||||
|
years: -1,
|
||||||
|
expected: "2020-01-01 00:00:00",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01 00:00:00",
|
||||||
|
years: 0,
|
||||||
|
expected: "2021-01-01 00:00:00",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01 00:00:00",
|
||||||
|
years: 2,
|
||||||
|
expected: "2023-01-01 00:00:00",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01 00:00:00",
|
||||||
|
years: 3,
|
||||||
|
expected: "2024-01-01 00:00:00",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01 00:00:00",
|
||||||
|
years: 4,
|
||||||
|
expected: "2025-01-01 00:00:00",
|
||||||
|
},
|
||||||
|
}
|
||||||
|
|
||||||
before2Years := AddYear(now, -1)
|
for _, tt := range tests {
|
||||||
diff2 := before2Years.Sub(now)
|
date, _ := time.Parse("2006-01-02 15:04:05", tt.inputDate)
|
||||||
assert.Equal(float64(-8760), diff2.Hours())
|
result := AddYear(date, int64(tt.years))
|
||||||
}
|
assert.Equal(tt.expected, result.Format("2006-01-02 15:04:05"))
|
||||||
|
}
|
||||||
func TestBetweenSeconds(t *testing.T) {
|
|
||||||
assert := internal.NewAssert(t, "TestBetweenSeconds")
|
|
||||||
|
|
||||||
today := time.Now()
|
|
||||||
tomorrow := AddDay(today, 1)
|
|
||||||
yesterday := AddDay(today, -1)
|
|
||||||
|
|
||||||
result1 := BetweenSeconds(today, tomorrow)
|
|
||||||
result2 := BetweenSeconds(today, yesterday)
|
|
||||||
|
|
||||||
assert.Equal(int64(86400), result1)
|
|
||||||
assert.Equal(int64(-86400), result2)
|
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestAddDay(t *testing.T) {
|
func TestAddDay(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
assert := internal.NewAssert(t, "TestAddDay")
|
assert := internal.NewAssert(t, "TestAddDay")
|
||||||
|
|
||||||
now := time.Now()
|
tests := []struct {
|
||||||
after2Days := AddDay(now, 2)
|
inputDate string
|
||||||
diff1 := after2Days.Sub(now)
|
days int
|
||||||
assert.Equal(float64(48), diff1.Hours())
|
expected string
|
||||||
|
}{
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01 00:00:00",
|
||||||
|
days: 1,
|
||||||
|
expected: "2021-01-02 00:00:00",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01 00:00:00",
|
||||||
|
days: -1,
|
||||||
|
expected: "2020-12-31 00:00:00",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01 00:00:00",
|
||||||
|
days: 0,
|
||||||
|
expected: "2021-01-01 00:00:00",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01 00:00:00",
|
||||||
|
days: 2,
|
||||||
|
expected: "2021-01-03 00:00:00",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01 00:00:00",
|
||||||
|
days: 3,
|
||||||
|
expected: "2021-01-04 00:00:00",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01 00:00:00",
|
||||||
|
days: 4,
|
||||||
|
expected: "2021-01-05 00:00:00",
|
||||||
|
},
|
||||||
|
}
|
||||||
|
|
||||||
before2Days := AddDay(now, -2)
|
for _, tt := range tests {
|
||||||
diff2 := before2Days.Sub(now)
|
date, _ := time.Parse("2006-01-02 15:04:05", tt.inputDate)
|
||||||
assert.Equal(float64(-48), diff2.Hours())
|
result := AddDay(date, int64(tt.days))
|
||||||
|
assert.Equal(tt.expected, result.Format("2006-01-02 15:04:05"))
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestAddHour(t *testing.T) {
|
func TestAddHour(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
assert := internal.NewAssert(t, "TestAddHour")
|
assert := internal.NewAssert(t, "TestAddHour")
|
||||||
|
|
||||||
now := time.Now()
|
tests := []struct {
|
||||||
after2Hours := AddHour(now, 2)
|
inputDate string
|
||||||
diff1 := after2Hours.Sub(now)
|
hours int
|
||||||
assert.Equal(float64(2), diff1.Hours())
|
expected string
|
||||||
|
}{
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01 00:00:00",
|
||||||
|
hours: 1,
|
||||||
|
expected: "2021-01-01 01:00:00",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01 00:00:00",
|
||||||
|
hours: -1,
|
||||||
|
expected: "2020-12-31 23:00:00",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01 00:00:00",
|
||||||
|
hours: 0,
|
||||||
|
expected: "2021-01-01 00:00:00",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01 00:00:00",
|
||||||
|
hours: 24,
|
||||||
|
expected: "2021-01-02 00:00:00",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01 00:00:00",
|
||||||
|
hours: 25,
|
||||||
|
expected: "2021-01-02 01:00:00",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01 00:00:00",
|
||||||
|
hours: 48,
|
||||||
|
expected: "2021-01-03 00:00:00",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01 00:00:00",
|
||||||
|
hours: 49,
|
||||||
|
expected: "2021-01-03 01:00:00",
|
||||||
|
},
|
||||||
|
}
|
||||||
|
|
||||||
|
for _, tt := range tests {
|
||||||
|
date, _ := time.Parse("2006-01-02 15:04:05", tt.inputDate)
|
||||||
|
result := AddHour(date, int64(tt.hours))
|
||||||
|
assert.Equal(tt.expected, result.Format("2006-01-02 15:04:05"))
|
||||||
|
}
|
||||||
|
|
||||||
before2Hours := AddHour(now, -2)
|
|
||||||
diff2 := before2Hours.Sub(now)
|
|
||||||
assert.Equal(float64(-2), diff2.Hours())
|
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestAddMinute(t *testing.T) {
|
func TestAddMinute(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
assert := internal.NewAssert(t, "TestAddMinute")
|
assert := internal.NewAssert(t, "TestAddMinute")
|
||||||
|
|
||||||
now := time.Now()
|
tests := []struct {
|
||||||
after2Minutes := AddMinute(now, 2)
|
inputDate string
|
||||||
diff1 := after2Minutes.Sub(now)
|
minutes int
|
||||||
assert.Equal(float64(2), diff1.Minutes())
|
expected string
|
||||||
|
}{
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01 00:00:00",
|
||||||
|
minutes: 1,
|
||||||
|
expected: "2021-01-01 00:01:00",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01 00:00:00",
|
||||||
|
minutes: -1,
|
||||||
|
expected: "2020-12-31 23:59:00",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01 00:00:00",
|
||||||
|
minutes: 0,
|
||||||
|
expected: "2021-01-01 00:00:00",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01 00:00:00",
|
||||||
|
minutes: 60,
|
||||||
|
expected: "2021-01-01 01:00:00",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01 00:00:00",
|
||||||
|
minutes: 61,
|
||||||
|
expected: "2021-01-01 01:01:00",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01 00:00:00",
|
||||||
|
minutes: 1440,
|
||||||
|
expected: "2021-01-02 00:00:00",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01 00:00:00",
|
||||||
|
minutes: 1441,
|
||||||
|
expected: "2021-01-02 00:01:00",
|
||||||
|
},
|
||||||
|
}
|
||||||
|
|
||||||
before2Minutes := AddMinute(now, -2)
|
for _, tt := range tests {
|
||||||
diff2 := before2Minutes.Sub(now)
|
date, _ := time.Parse("2006-01-02 15:04:05", tt.inputDate)
|
||||||
assert.Equal(float64(-2), diff2.Minutes())
|
result := AddMinute(date, int64(tt.minutes))
|
||||||
|
assert.Equal(tt.expected, result.Format("2006-01-02 15:04:05"))
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestAddWeek(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestAddWeek")
|
||||||
|
|
||||||
|
tests := []struct {
|
||||||
|
inputDate string
|
||||||
|
weeks int
|
||||||
|
expected string
|
||||||
|
}{
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01",
|
||||||
|
weeks: 1,
|
||||||
|
expected: "2021-01-08",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01",
|
||||||
|
weeks: -1,
|
||||||
|
expected: "2020-12-25",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01",
|
||||||
|
weeks: 0,
|
||||||
|
expected: "2021-01-01",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01",
|
||||||
|
weeks: 52,
|
||||||
|
expected: "2021-12-31",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01",
|
||||||
|
weeks: 53,
|
||||||
|
expected: "2022-01-07",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01",
|
||||||
|
weeks: 104,
|
||||||
|
expected: "2022-12-30",
|
||||||
|
},
|
||||||
|
}
|
||||||
|
|
||||||
|
for _, tt := range tests {
|
||||||
|
date, _ := time.Parse("2006-01-02", tt.inputDate)
|
||||||
|
result := AddWeek(date, int64(tt.weeks))
|
||||||
|
assert.Equal(tt.expected, result.Format("2006-01-02"))
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestAddMonth(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestAddMonth")
|
||||||
|
|
||||||
|
tests := []struct {
|
||||||
|
inputDate string
|
||||||
|
months int
|
||||||
|
expected string
|
||||||
|
}{
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01",
|
||||||
|
months: 1,
|
||||||
|
expected: "2021-02-01",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01",
|
||||||
|
months: -1,
|
||||||
|
expected: "2020-12-01",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01",
|
||||||
|
months: 0,
|
||||||
|
expected: "2021-01-01",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01",
|
||||||
|
months: 12,
|
||||||
|
expected: "2022-01-01",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01",
|
||||||
|
months: 13,
|
||||||
|
expected: "2022-02-01",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2021-01-01",
|
||||||
|
months: 24,
|
||||||
|
expected: "2023-01-01",
|
||||||
|
},
|
||||||
|
}
|
||||||
|
|
||||||
|
for _, tt := range tests {
|
||||||
|
date, _ := time.Parse("2006-01-02", tt.inputDate)
|
||||||
|
result := AddMonth(date, int64(tt.months))
|
||||||
|
assert.Equal(tt.expected, result.Format("2006-01-02"))
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestAddDaySafe(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestAddDaySafe")
|
||||||
|
|
||||||
|
tests := []struct {
|
||||||
|
inputDate string
|
||||||
|
days int
|
||||||
|
expected string
|
||||||
|
}{
|
||||||
|
{"2025-01-31", 10, "2025-02-10"},
|
||||||
|
{"2025-01-01", 30, "2025-01-31"},
|
||||||
|
{"2025-01-31", 1, "2025-02-01"},
|
||||||
|
{"2025-02-28", 1, "2025-03-01"},
|
||||||
|
{"2024-02-29", 1, "2024-03-01"},
|
||||||
|
{"2024-02-29", 365, "2025-02-28"},
|
||||||
|
|
||||||
|
{"2025-01-31", -10, "2025-01-21"},
|
||||||
|
{"2025-01-01", -30, "2024-12-02"},
|
||||||
|
{"2025-02-01", -1, "2025-01-31"},
|
||||||
|
{"2025-03-01", -1, "2025-02-28"},
|
||||||
|
{"2024-03-01", -1, "2024-02-29"},
|
||||||
|
|
||||||
|
{"2025-01-31", -31, "2024-12-31"},
|
||||||
|
{"2025-12-31", 1, "2026-01-01"},
|
||||||
|
}
|
||||||
|
|
||||||
|
for _, tt := range tests {
|
||||||
|
date, _ := time.Parse("2006-01-02", tt.inputDate)
|
||||||
|
result := AddDaySafe(date, tt.days)
|
||||||
|
assert.Equal(tt.expected, result.Format("2006-01-02"))
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestAddMonthSafe(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestAddMonthSafe")
|
||||||
|
|
||||||
|
tests := []struct {
|
||||||
|
inputDate string
|
||||||
|
months int
|
||||||
|
expected string
|
||||||
|
}{
|
||||||
|
{
|
||||||
|
inputDate: "2025-01-31",
|
||||||
|
months: 1,
|
||||||
|
expected: "2025-02-28",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2025-01-31",
|
||||||
|
months: -1,
|
||||||
|
expected: "2024-12-31",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2025-12-31",
|
||||||
|
months: 1,
|
||||||
|
expected: "2026-01-31",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2025-01-31",
|
||||||
|
months: -1,
|
||||||
|
expected: "2024-12-31",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2024-02-29",
|
||||||
|
months: 1,
|
||||||
|
expected: "2024-03-29",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2024-02-29",
|
||||||
|
months: -1,
|
||||||
|
expected: "2024-01-29",
|
||||||
|
},
|
||||||
|
}
|
||||||
|
|
||||||
|
for _, tt := range tests {
|
||||||
|
date, _ := time.Parse("2006-01-02", tt.inputDate)
|
||||||
|
result := AddMonthSafe(date, tt.months)
|
||||||
|
assert.Equal(tt.expected, result.Format("2006-01-02"))
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestAddYearSafe(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestAddYearSafe")
|
||||||
|
|
||||||
|
tests := []struct {
|
||||||
|
inputDate string
|
||||||
|
years int
|
||||||
|
expected string
|
||||||
|
}{
|
||||||
|
{
|
||||||
|
inputDate: "2020-02-29",
|
||||||
|
years: 1,
|
||||||
|
expected: "2021-02-28",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2020-02-29",
|
||||||
|
years: 2,
|
||||||
|
expected: "2022-02-28",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2020-02-29",
|
||||||
|
years: -1,
|
||||||
|
expected: "2019-02-28",
|
||||||
|
},
|
||||||
|
{
|
||||||
|
inputDate: "2020-02-29",
|
||||||
|
years: -2,
|
||||||
|
expected: "2018-02-28",
|
||||||
|
},
|
||||||
|
}
|
||||||
|
|
||||||
|
for _, tt := range tests {
|
||||||
|
date, _ := time.Parse("2006-01-02", tt.inputDate)
|
||||||
|
result := AddYearSafe(date, tt.years)
|
||||||
|
assert.Equal(tt.expected, result.Format("2006-01-02"))
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestGetNowDate(t *testing.T) {
|
func TestGetNowDate(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestGetNowDate")
|
assert := internal.NewAssert(t, "TestGetNowDate")
|
||||||
expected := time.Now().Format("2006-01-02")
|
expected := time.Now().Format("2006-01-02")
|
||||||
assert.Equal(expected, GetNowDate())
|
assert.Equal(expected, GetNowDate())
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestGetNowTime(t *testing.T) {
|
func TestGetNowTime(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestGetNowTime")
|
assert := internal.NewAssert(t, "TestGetNowTime")
|
||||||
expected := time.Now().Format("15:04:05")
|
expected := time.Now().Format("15:04:05")
|
||||||
assert.Equal(expected, GetNowTime())
|
assert.Equal(expected, GetNowTime())
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestGetNowDateTime(t *testing.T) {
|
func TestGetNowDateTime(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestGetNowDateTime")
|
assert := internal.NewAssert(t, "TestGetNowDateTime")
|
||||||
expected := time.Now().Format("2006-01-02 15:04:05")
|
expected := time.Now().Format("2006-01-02 15:04:05")
|
||||||
assert.Equal(expected, GetNowDateTime())
|
assert.Equal(expected, GetNowDateTime())
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func TestGetTodayStartTime(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestGetTodayStartTime")
|
||||||
|
expected := time.Now().Format("2006-01-02") + " 00:00:00"
|
||||||
|
assert.Equal(expected, GetTodayStartTime())
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestGetTodayEndTime(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestGetTodayEndTime")
|
||||||
|
expected := time.Now().Format("2006-01-02") + " 23:59:59"
|
||||||
|
assert.Equal(expected, GetTodayEndTime())
|
||||||
|
}
|
||||||
|
|
||||||
func TestFormatTimeToStr(t *testing.T) {
|
func TestFormatTimeToStr(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestFormatTimeToStr")
|
assert := internal.NewAssert(t, "TestFormatTimeToStr")
|
||||||
|
|
||||||
datetime, _ := time.Parse("2006-01-02 15:04:05", "2021-01-02 16:04:08")
|
datetime, _ := time.Parse("2006-01-02 15:04:05", "2021-01-02 16:04:08")
|
||||||
@@ -113,9 +496,14 @@ func TestFormatTimeToStr(t *testing.T) {
|
|||||||
actual := FormatTimeToStr(datetime, cases[i])
|
actual := FormatTimeToStr(datetime, cases[i])
|
||||||
assert.Equal(expected[i], actual)
|
assert.Equal(expected[i], actual)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
ds := FormatTimeToStr(datetime, "yyyy-mm-dd hh:mm:ss", "EST")
|
||||||
|
t.Log(ds)
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestFormatStrToTime(t *testing.T) {
|
func TestFormatStrToTime(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestFormatStrToTime")
|
assert := internal.NewAssert(t, "TestFormatStrToTime")
|
||||||
|
|
||||||
formats := []string{
|
formats := []string{
|
||||||
@@ -127,22 +515,28 @@ func TestFormatStrToTime(t *testing.T) {
|
|||||||
"dd-mm-yy hh:mm:ss", "yyyy/mm/dd hh:mm:ss",
|
"dd-mm-yy hh:mm:ss", "yyyy/mm/dd hh:mm:ss",
|
||||||
"yyyy/mm"}
|
"yyyy/mm"}
|
||||||
|
|
||||||
datetimeStr := []string{
|
expected := []string{
|
||||||
"2021-01-02 16:04:08", "2021-01-02",
|
"2021-01-02 16:04:08", "2021-01-02",
|
||||||
"02-01-21 16:04:08", "2021/01/02 16:04:08",
|
"02-01-21 16:04:08", "2021/01/02 16:04:08",
|
||||||
"2021/01"}
|
"2021/01"}
|
||||||
|
|
||||||
for i := 0; i < len(cases); i++ {
|
for i := 0; i < len(cases); i++ {
|
||||||
actual, err := FormatStrToTime(datetimeStr[i], cases[i])
|
actual, err := FormatStrToTime(expected[i], cases[i])
|
||||||
if err != nil {
|
if err != nil {
|
||||||
t.Fatal(err)
|
t.Fatal(err)
|
||||||
}
|
}
|
||||||
expected, _ := time.Parse(formats[i], datetimeStr[i])
|
expected, _ := time.Parse(formats[i], expected[i])
|
||||||
assert.Equal(expected, actual)
|
assert.Equal(expected, actual)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
estTime, err := FormatStrToTime("2021-01-02 16:04:08", "yyyy-mm-dd hh:mm:ss", "EST")
|
||||||
|
t.Log(estTime)
|
||||||
|
assert.IsNil(err)
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestBeginOfMinute(t *testing.T) {
|
func TestBeginOfMinute(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestBeginOfMinute")
|
assert := internal.NewAssert(t, "TestBeginOfMinute")
|
||||||
|
|
||||||
expected := time.Date(2022, 2, 15, 15, 48, 0, 0, time.Local)
|
expected := time.Date(2022, 2, 15, 15, 48, 0, 0, time.Local)
|
||||||
@@ -153,6 +547,8 @@ func TestBeginOfMinute(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestEndOfMinute(t *testing.T) {
|
func TestEndOfMinute(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestEndOfMinute")
|
assert := internal.NewAssert(t, "TestEndOfMinute")
|
||||||
|
|
||||||
expected := time.Date(2022, 2, 15, 15, 48, 59, 999999999, time.Local)
|
expected := time.Date(2022, 2, 15, 15, 48, 59, 999999999, time.Local)
|
||||||
@@ -163,6 +559,8 @@ func TestEndOfMinute(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestBeginOfHour(t *testing.T) {
|
func TestBeginOfHour(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestBeginOfHour")
|
assert := internal.NewAssert(t, "TestBeginOfHour")
|
||||||
|
|
||||||
expected := time.Date(2022, 2, 15, 15, 0, 0, 0, time.Local)
|
expected := time.Date(2022, 2, 15, 15, 0, 0, 0, time.Local)
|
||||||
@@ -173,6 +571,8 @@ func TestBeginOfHour(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestEndOfHour(t *testing.T) {
|
func TestEndOfHour(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestEndOfHour")
|
assert := internal.NewAssert(t, "TestEndOfHour")
|
||||||
|
|
||||||
expected := time.Date(2022, 2, 15, 15, 59, 59, 999999999, time.Local)
|
expected := time.Date(2022, 2, 15, 15, 59, 59, 999999999, time.Local)
|
||||||
@@ -183,6 +583,8 @@ func TestEndOfHour(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestBeginOfDay(t *testing.T) {
|
func TestBeginOfDay(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestBeginOfDay")
|
assert := internal.NewAssert(t, "TestBeginOfDay")
|
||||||
|
|
||||||
expected := time.Date(2022, 2, 15, 0, 0, 0, 0, time.Local)
|
expected := time.Date(2022, 2, 15, 0, 0, 0, 0, time.Local)
|
||||||
@@ -193,6 +595,8 @@ func TestBeginOfDay(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestEndOfDay(t *testing.T) {
|
func TestEndOfDay(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestEndOfDay")
|
assert := internal.NewAssert(t, "TestEndOfDay")
|
||||||
|
|
||||||
expected := time.Date(2022, 2, 15, 23, 59, 59, 999999999, time.Local)
|
expected := time.Date(2022, 2, 15, 23, 59, 59, 999999999, time.Local)
|
||||||
@@ -203,26 +607,32 @@ func TestEndOfDay(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestBeginOfWeek(t *testing.T) {
|
func TestBeginOfWeek(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestBeginOfWeek")
|
assert := internal.NewAssert(t, "TestBeginOfWeek")
|
||||||
|
|
||||||
expected := time.Date(2022, 2, 13, 0, 0, 0, 0, time.Local)
|
expected := time.Date(2022, 2, 14, 0, 0, 0, 0, time.Local)
|
||||||
td := time.Date(2022, 2, 15, 15, 48, 40, 112, time.Local)
|
td := time.Date(2022, 2, 15, 15, 48, 40, 112, time.Local)
|
||||||
actual := BeginOfWeek(td)
|
actual := BeginOfWeek(td, time.Monday)
|
||||||
|
|
||||||
assert.Equal(expected, actual)
|
assert.Equal(expected, actual)
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestEndOfWeek(t *testing.T) {
|
func TestEndOfWeek(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestEndOfWeek")
|
assert := internal.NewAssert(t, "TestEndOfWeek")
|
||||||
|
|
||||||
expected := time.Date(2022, 2, 19, 23, 59, 59, 999999999, time.Local)
|
expected := time.Date(2022, 2, 20, 23, 59, 59, 999999999, time.Local)
|
||||||
td := time.Date(2022, 2, 15, 15, 48, 40, 112, time.Local)
|
td := time.Date(2022, 2, 15, 15, 48, 40, 112, time.Local)
|
||||||
actual := EndOfWeek(td)
|
actual := EndOfWeek(td, time.Sunday)
|
||||||
|
|
||||||
assert.Equal(expected, actual)
|
assert.Equal(expected, actual)
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestBeginOfMonth(t *testing.T) {
|
func TestBeginOfMonth(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestBeginOfMonth")
|
assert := internal.NewAssert(t, "TestBeginOfMonth")
|
||||||
|
|
||||||
expected := time.Date(2022, 2, 1, 0, 0, 0, 0, time.Local)
|
expected := time.Date(2022, 2, 1, 0, 0, 0, 0, time.Local)
|
||||||
@@ -233,6 +643,8 @@ func TestBeginOfMonth(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestEndOfMonth(t *testing.T) {
|
func TestEndOfMonth(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestEndOfMonth")
|
assert := internal.NewAssert(t, "TestEndOfMonth")
|
||||||
|
|
||||||
expected := time.Date(2022, 2, 28, 23, 59, 59, 999999999, time.Local)
|
expected := time.Date(2022, 2, 28, 23, 59, 59, 999999999, time.Local)
|
||||||
@@ -243,6 +655,8 @@ func TestEndOfMonth(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestBeginOfYear(t *testing.T) {
|
func TestBeginOfYear(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestBeginOfYear")
|
assert := internal.NewAssert(t, "TestBeginOfYear")
|
||||||
|
|
||||||
expected := time.Date(2022, 1, 1, 0, 0, 0, 0, time.Local)
|
expected := time.Date(2022, 1, 1, 0, 0, 0, 0, time.Local)
|
||||||
@@ -253,6 +667,8 @@ func TestBeginOfYear(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestEndOfYear(t *testing.T) {
|
func TestEndOfYear(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestEndOfYear")
|
assert := internal.NewAssert(t, "TestEndOfYear")
|
||||||
|
|
||||||
expected := time.Date(2022, 12, 31, 23, 59, 59, 999999999, time.Local)
|
expected := time.Date(2022, 12, 31, 23, 59, 59, 999999999, time.Local)
|
||||||
@@ -263,6 +679,8 @@ func TestEndOfYear(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestIsLeapYear(t *testing.T) {
|
func TestIsLeapYear(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestEndOfYear")
|
assert := internal.NewAssert(t, "TestEndOfYear")
|
||||||
|
|
||||||
result1 := IsLeapYear(2000)
|
result1 := IsLeapYear(2000)
|
||||||
@@ -273,6 +691,8 @@ func TestIsLeapYear(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestDayOfYear(t *testing.T) {
|
func TestDayOfYear(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestDayOfYear")
|
assert := internal.NewAssert(t, "TestDayOfYear")
|
||||||
date1 := time.Date(2023, 02, 01, 1, 1, 1, 0, time.Local)
|
date1 := time.Date(2023, 02, 01, 1, 1, 1, 0, time.Local)
|
||||||
result1 := DayOfYear(date1)
|
result1 := DayOfYear(date1)
|
||||||
@@ -288,7 +708,10 @@ func TestDayOfYear(t *testing.T) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
func TestIsWeekend(t *testing.T) {
|
func TestIsWeekend(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
assert := internal.NewAssert(t, "TestIsWeekend")
|
assert := internal.NewAssert(t, "TestIsWeekend")
|
||||||
|
|
||||||
date := time.Date(2023, 06, 03, 0, 0, 0, 0, time.Local)
|
date := time.Date(2023, 06, 03, 0, 0, 0, 0, time.Local)
|
||||||
result := IsWeekend(date)
|
result := IsWeekend(date)
|
||||||
assert.Equal(true, result)
|
assert.Equal(true, result)
|
||||||
@@ -300,5 +723,223 @@ func TestIsWeekend(t *testing.T) {
|
|||||||
date2 := time.Date(2023, 06, 02, 0, 0, 0, 0, time.Local)
|
date2 := time.Date(2023, 06, 02, 0, 0, 0, 0, time.Local)
|
||||||
result2 := IsWeekend(date2)
|
result2 := IsWeekend(date2)
|
||||||
assert.Equal(false, result2)
|
assert.Equal(false, result2)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestNowDateOrTime(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
formats := []string{
|
||||||
|
"yyyy-mm-dd hh:mm:ss",
|
||||||
|
"yyyy-mm-dd",
|
||||||
|
"dd-mm-yy hh:mm:ss",
|
||||||
|
"yyyy/mm/dd hh:mm:ss",
|
||||||
|
"hh:mm:ss",
|
||||||
|
"yyyy/mm",
|
||||||
|
"yyyy-mm-dd hh",
|
||||||
|
}
|
||||||
|
|
||||||
|
for i := 0; i < len(formats); i++ {
|
||||||
|
result := NowDateOrTime(formats[i], "UTC")
|
||||||
|
t.Log(result)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestTimestamp(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
ts1 := Timestamp()
|
||||||
|
t.Log(ts1)
|
||||||
|
|
||||||
|
ts2 := TimestampMilli()
|
||||||
|
t.Log(ts2)
|
||||||
|
|
||||||
|
ts3 := TimestampMicro()
|
||||||
|
t.Log(ts3)
|
||||||
|
|
||||||
|
ts4 := TimestampNano()
|
||||||
|
t.Log(ts4)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestTrackFuncTime(t *testing.T) {
|
||||||
|
defer TrackFuncTime(time.Now())()
|
||||||
|
|
||||||
|
var n int
|
||||||
|
for i := 0; i < 5000000; i++ {
|
||||||
|
n++
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestDaysBetween(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestDaysBetween")
|
||||||
|
|
||||||
|
tests := []struct {
|
||||||
|
start time.Time
|
||||||
|
end time.Time
|
||||||
|
expected int
|
||||||
|
}{
|
||||||
|
{
|
||||||
|
start: time.Date(2024, time.September, 1, 0, 0, 0, 0, time.UTC),
|
||||||
|
end: time.Date(2024, time.September, 10, 0, 0, 0, 0, time.UTC),
|
||||||
|
expected: 9,
|
||||||
|
},
|
||||||
|
{
|
||||||
|
start: time.Date(2024, time.September, 10, 0, 0, 0, 0, time.UTC),
|
||||||
|
end: time.Date(2024, time.September, 1, 0, 0, 0, 0, time.UTC),
|
||||||
|
expected: -9,
|
||||||
|
},
|
||||||
|
{
|
||||||
|
start: time.Date(2024, time.September, 1, 0, 0, 0, 0, time.UTC),
|
||||||
|
end: time.Date(2024, time.September, 1, 0, 0, 0, 0, time.UTC),
|
||||||
|
expected: 0,
|
||||||
|
},
|
||||||
|
{
|
||||||
|
start: time.Date(2024, time.January, 1, 0, 0, 0, 0, time.UTC),
|
||||||
|
end: time.Date(2024, time.December, 31, 0, 0, 0, 0, time.UTC),
|
||||||
|
expected: 365,
|
||||||
|
},
|
||||||
|
{
|
||||||
|
start: time.Date(2024, time.March, 1, 0, 0, 0, 0, time.UTC),
|
||||||
|
end: time.Date(2024, time.March, 31, 0, 0, 0, 0, time.UTC),
|
||||||
|
expected: 30,
|
||||||
|
},
|
||||||
|
}
|
||||||
|
|
||||||
|
for _, tt := range tests {
|
||||||
|
result := DaysBetween(tt.start, tt.end)
|
||||||
|
assert.Equal(tt.expected, result)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestGenerateDatetimesBetween(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestGenerateDatetimesBetween")
|
||||||
|
|
||||||
|
tests := []struct {
|
||||||
|
start time.Time
|
||||||
|
end time.Time
|
||||||
|
layout string
|
||||||
|
interval string
|
||||||
|
expected []string
|
||||||
|
}{
|
||||||
|
{
|
||||||
|
start: time.Date(2024, time.September, 1, 0, 0, 0, 0, time.UTC),
|
||||||
|
end: time.Date(2024, time.September, 1, 2, 0, 0, 0, time.UTC),
|
||||||
|
layout: "2006-01-02 15:04:05",
|
||||||
|
interval: "30m",
|
||||||
|
expected: []string{
|
||||||
|
"2024-09-01 00:00:00",
|
||||||
|
"2024-09-01 00:30:00",
|
||||||
|
"2024-09-01 01:00:00",
|
||||||
|
"2024-09-01 01:30:00",
|
||||||
|
"2024-09-01 02:00:00",
|
||||||
|
},
|
||||||
|
},
|
||||||
|
{
|
||||||
|
start: time.Date(2024, time.September, 1, 0, 0, 0, 0, time.UTC),
|
||||||
|
end: time.Date(2024, time.September, 1, 0, 0, 0, 0, time.UTC),
|
||||||
|
layout: "2006-01-02 15:04:05",
|
||||||
|
interval: "1h",
|
||||||
|
expected: []string{"2024-09-01 00:00:00"},
|
||||||
|
},
|
||||||
|
{
|
||||||
|
start: time.Date(2024, time.September, 1, 0, 0, 0, 0, time.UTC),
|
||||||
|
end: time.Date(2024, time.September, 1, 3, 0, 0, 0, time.UTC),
|
||||||
|
layout: "2006-01-02 15:04:05",
|
||||||
|
interval: "2h",
|
||||||
|
expected: []string{
|
||||||
|
"2024-09-01 00:00:00",
|
||||||
|
"2024-09-01 02:00:00",
|
||||||
|
},
|
||||||
|
},
|
||||||
|
}
|
||||||
|
|
||||||
|
for _, tt := range tests {
|
||||||
|
result, err := GenerateDatetimesBetween(tt.start, tt.end, tt.layout, tt.interval)
|
||||||
|
|
||||||
|
assert.Equal(tt.expected, result)
|
||||||
|
assert.IsNil(err)
|
||||||
|
}
|
||||||
|
|
||||||
|
t.Run("Invalid interval", func(t *testing.T) {
|
||||||
|
_, err := GenerateDatetimesBetween(time.Now(), time.Now(), "2006-01-02 15:04:05", "invalid")
|
||||||
|
if err == nil {
|
||||||
|
t.Fatal("Expected error, got nil")
|
||||||
|
}
|
||||||
|
})
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestMin(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestMin")
|
||||||
|
|
||||||
|
zeroTime := time.Time{}
|
||||||
|
now := time.Now()
|
||||||
|
oneMinuteAgo := now.Add(-time.Minute)
|
||||||
|
oneMinuteAfter := now.Add(time.Minute)
|
||||||
|
|
||||||
|
assert.Equal(zeroTime, Min(zeroTime, now, oneMinuteAgo, oneMinuteAfter))
|
||||||
|
|
||||||
|
assert.Equal(zeroTime, Min(now, zeroTime))
|
||||||
|
|
||||||
|
assert.Equal(oneMinuteAgo, Min(oneMinuteAgo, now, oneMinuteAfter))
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestMax(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestMax")
|
||||||
|
|
||||||
|
zeroTime := time.Time{}
|
||||||
|
now := time.Now()
|
||||||
|
oneMinuteAgo := now.Add(-time.Minute)
|
||||||
|
oneMinuteAfter := now.Add(time.Minute)
|
||||||
|
|
||||||
|
assert.Equal(oneMinuteAfter, Max(zeroTime, now, oneMinuteAgo, oneMinuteAfter))
|
||||||
|
|
||||||
|
assert.Equal(now, Max(now, zeroTime))
|
||||||
|
|
||||||
|
assert.Equal(oneMinuteAfter, Max(oneMinuteAgo, now, oneMinuteAfter))
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestMaxMin(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestMinMax")
|
||||||
|
|
||||||
|
zeroTime := time.Time{}
|
||||||
|
now := time.Now()
|
||||||
|
oneMinuteAgo := now.Add(-time.Minute)
|
||||||
|
oneMinuteAfter := now.Add(time.Minute)
|
||||||
|
|
||||||
|
max, min := MaxMin(zeroTime, now, oneMinuteAgo, oneMinuteAfter)
|
||||||
|
assert.Equal(zeroTime, min)
|
||||||
|
assert.Equal(oneMinuteAfter, max)
|
||||||
|
|
||||||
|
max, min = MaxMin(now, zeroTime)
|
||||||
|
assert.Equal(zeroTime, min)
|
||||||
|
assert.Equal(now, max)
|
||||||
|
|
||||||
|
max, min = MaxMin(oneMinuteAgo, now, oneMinuteAfter)
|
||||||
|
assert.Equal(oneMinuteAgo, min)
|
||||||
|
assert.Equal(oneMinuteAfter, max)
|
||||||
|
}
|
||||||
|
|
||||||
|
func TestBetweenSeconds(t *testing.T) {
|
||||||
|
t.Parallel()
|
||||||
|
|
||||||
|
assert := internal.NewAssert(t, "TestBetweenSeconds")
|
||||||
|
|
||||||
|
today := time.Now()
|
||||||
|
tomorrow := AddDay(today, 1)
|
||||||
|
yesterday := AddDay(today, -1)
|
||||||
|
|
||||||
|
result1 := BetweenSeconds(today, tomorrow)
|
||||||
|
result2 := BetweenSeconds(today, yesterday)
|
||||||
|
|
||||||
|
assert.Equal(int64(86400), result1)
|
||||||
|
assert.Equal(int64(-86400), result2)
|
||||||
}
|
}
|
||||||
@@ -0,0 +1,20 @@
|
|||||||
|
package datetime
|
||||||
|
|
||||||
|
import (
|
||||||
|
"testing"
|
||||||
|
"time"
|
||||||
|
_ "time/tzdata"
|
||||||
|
)
|
||||||
|
|
||||||
|
func TestDayOfYearDaylightSaving(t *testing.T) {
|
||||||
|
loc, err := time.LoadLocation("America/New_York")
|
||||||
|
if err != nil {
|
||||||
|
t.Fatal(err)
|
||||||
|
}
|
||||||
|
for _, month := range []time.Month{time.January, time.July, time.December} {
|
||||||
|
date := time.Date(2024, month, 1, 12, 0, 0, 0, loc)
|
||||||
|
if got, want := DayOfYear(date), date.YearDay()-1; got != want {
|
||||||
|
t.Errorf("%v: got %d, want %d", date, got, want)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
@@ -0,0 +1,17 @@
|
|||||||
|
package datetime
|
||||||
|
|
||||||
|
import (
|
||||||
|
"testing"
|
||||||
|
"time"
|
||||||
|
)
|
||||||
|
|
||||||
|
func TestGenerateDatetimesNonPositiveInterval(t *testing.T) {
|
||||||
|
start := time.Date(2026, 1, 1, 0, 0, 0, 0, time.UTC)
|
||||||
|
for _, interval := range []string{"0s", "-1h"} {
|
||||||
|
t.Run(interval, func(t *testing.T) {
|
||||||
|
if _, err := GenerateDatetimesBetween(start, start.Add(time.Hour), "2006-01-02", interval); err == nil {
|
||||||
|
t.Error("expected an error for a non-positive interval")
|
||||||
|
}
|
||||||
|
})
|
||||||
|
}
|
||||||
|
}
|
||||||
@@ -0,0 +1,25 @@
|
|||||||
|
package datetime
|
||||||
|
|
||||||
|
import (
|
||||||
|
"testing"
|
||||||
|
"time"
|
||||||
|
)
|
||||||
|
|
||||||
|
func TestEmptyTimezoneOptions(t *testing.T) {
|
||||||
|
empty := []string{}
|
||||||
|
now := time.Now()
|
||||||
|
if got := FormatTimeToStr(now, "yyyy-mm-dd", empty...); got != FormatTimeToStr(now, "yyyy-mm-dd") {
|
||||||
|
t.Errorf("unexpected date: %s", got)
|
||||||
|
}
|
||||||
|
if _, err := FormatStrToTime("2026-01-02", "yyyy-mm-dd", empty...); err != nil {
|
||||||
|
t.Fatal(err)
|
||||||
|
}
|
||||||
|
if NowDateOrTime("yyyy", empty...) == "" {
|
||||||
|
t.Error("empty date")
|
||||||
|
}
|
||||||
|
for _, fn := range []func(...string) int64{Timestamp, TimestampMilli, TimestampMicro, TimestampNano} {
|
||||||
|
if fn(empty...) == 0 {
|
||||||
|
t.Error("empty timestamp")
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
@@ -0,0 +1,90 @@
|
|||||||
|
import { defineConfig, HeadConfig } from 'vitepress'
|
||||||
|
|
||||||
|
export const META_IMAGE = '/lancet_logo.png'
|
||||||
|
export const isProduction = process.env.NETLIFY && process.env.CONTEXT === 'production'
|
||||||
|
|
||||||
|
if (process.env.NETLIFY) {
|
||||||
|
console.log('Netlify build', process.env.CONTEXT)
|
||||||
|
}
|
||||||
|
|
||||||
|
const productionHead: HeadConfig[] = [
|
||||||
|
[
|
||||||
|
'script',
|
||||||
|
{
|
||||||
|
src: 'https://unpkg.com/thesemetrics@latest',
|
||||||
|
async: '',
|
||||||
|
type: 'text/javascript',
|
||||||
|
},
|
||||||
|
],
|
||||||
|
]
|
||||||
|
|
||||||
|
const rControl = /[\u0000-\u001f]/g
|
||||||
|
const rSpecial = /[\s~`!@#$%^&*()\-_+=[\]{}|\\;:"'“”‘’<>,.?/]+/g
|
||||||
|
const rCombining = /[\u0300-\u036F]/g
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Default slugification function
|
||||||
|
*/
|
||||||
|
export const slugify = (str: string): string =>
|
||||||
|
str
|
||||||
|
.normalize('NFKD')
|
||||||
|
// Remove accents
|
||||||
|
.replace(rCombining, '')
|
||||||
|
// Remove control characters
|
||||||
|
.replace(rControl, '')
|
||||||
|
// Replace special characters
|
||||||
|
.replace(rSpecial, '-')
|
||||||
|
// ensure it doesn't start with a number
|
||||||
|
.replace(/^(\d)/, '_$1')
|
||||||
|
|
||||||
|
export const commonConfig = defineConfig({
|
||||||
|
title: 'Lancet',
|
||||||
|
appearance: true,
|
||||||
|
ignoreDeadLinks: true,
|
||||||
|
|
||||||
|
markdown: {
|
||||||
|
theme: {
|
||||||
|
dark: 'dracula-soft',
|
||||||
|
light: 'vitesse-light',
|
||||||
|
},
|
||||||
|
|
||||||
|
attrs: {
|
||||||
|
leftDelimiter: '%{',
|
||||||
|
rightDelimiter: '}%',
|
||||||
|
},
|
||||||
|
|
||||||
|
anchor: {
|
||||||
|
slugify,
|
||||||
|
},
|
||||||
|
},
|
||||||
|
|
||||||
|
head: [
|
||||||
|
// ['link', { rel: 'icon', type: 'image/svg+xml', href: '/logo.svg' }],
|
||||||
|
['link', { rel: 'icon', type: 'image/png', href: '/lancet_logo_mini.png' }],
|
||||||
|
['meta', { name: 'theme-color', content: '#5f67ee' }],
|
||||||
|
['meta', { name: 'og:type', content: 'website' }],
|
||||||
|
['meta', { name: 'og:locale', content: 'zh' }],
|
||||||
|
|
||||||
|
...(isProduction ? productionHead : []),
|
||||||
|
],
|
||||||
|
|
||||||
|
themeConfig: {
|
||||||
|
logo: { src: '/lancet_logo_mini.png', width: 24, height: 24 },
|
||||||
|
outline: [2, 3],
|
||||||
|
|
||||||
|
search: {
|
||||||
|
provider: 'local',
|
||||||
|
},
|
||||||
|
socialLinks: [
|
||||||
|
{
|
||||||
|
icon: 'github',
|
||||||
|
link: 'https://github.com/duke-git/lancet',
|
||||||
|
},
|
||||||
|
],
|
||||||
|
|
||||||
|
footer: {
|
||||||
|
copyright: 'Copyright © 2023-present Duke Du',
|
||||||
|
message: '<a href="https://beian.miit.gov.cn/" target="_blank">京ICP备2023022770号-1</a>',
|
||||||
|
},
|
||||||
|
},
|
||||||
|
})
|
||||||
@@ -0,0 +1,14 @@
|
|||||||
|
import { defineConfig } from 'vitepress'
|
||||||
|
import { commonConfig } from './common'
|
||||||
|
import { zhConfig } from './zh'
|
||||||
|
import { enConfig } from './en'
|
||||||
|
|
||||||
|
// https://vitepress.dev/reference/site-config
|
||||||
|
export default defineConfig({
|
||||||
|
...commonConfig,
|
||||||
|
|
||||||
|
locales: {
|
||||||
|
root: { label: '简体中文', lang: 'zh-CN', link: '/', ...zhConfig },
|
||||||
|
en: { label: 'English', lang: 'en-US', link: '/en/', ...enConfig },
|
||||||
|
},
|
||||||
|
})
|
||||||
@@ -0,0 +1,141 @@
|
|||||||
|
import type { DefaultTheme, LocaleSpecificConfig } from 'vitepress'
|
||||||
|
|
||||||
|
export const META_URL = 'https://www.golancet.cn/en/'
|
||||||
|
export const META_TITLE = 'Lancet'
|
||||||
|
export const META_DESCRIPTION = 'A powerful util function library of Go'
|
||||||
|
|
||||||
|
export const enConfig: LocaleSpecificConfig<DefaultTheme.Config> = {
|
||||||
|
description: META_DESCRIPTION,
|
||||||
|
|
||||||
|
head: [
|
||||||
|
['meta', { property: 'og:url', content: META_URL }],
|
||||||
|
['meta', { property: 'og:description', content: META_DESCRIPTION }],
|
||||||
|
],
|
||||||
|
|
||||||
|
themeConfig: {
|
||||||
|
editLink: {
|
||||||
|
pattern: 'https://github.com/duke-git/lancet/edit/v2/docs/:path',
|
||||||
|
text: 'Suggest changes to this page',
|
||||||
|
},
|
||||||
|
nav: [
|
||||||
|
{
|
||||||
|
text: 'Home',
|
||||||
|
link: '/en/',
|
||||||
|
activeMatch: '^/en/',
|
||||||
|
},
|
||||||
|
{
|
||||||
|
text: 'Guide',
|
||||||
|
link: '/en/guide/introduction',
|
||||||
|
activeMatch: '^/en/guide/',
|
||||||
|
},
|
||||||
|
{ text: 'API', link: '/en/api/overview', activeMatch: '^/en/api/' },
|
||||||
|
{
|
||||||
|
text: 'Links',
|
||||||
|
items: [
|
||||||
|
{
|
||||||
|
text: 'Discussion',
|
||||||
|
link: 'https://github.com/duke-git/lancet/discussions',
|
||||||
|
},
|
||||||
|
{
|
||||||
|
text: 'Changelog',
|
||||||
|
link: 'https://github.com/duke-git/lancet/releases',
|
||||||
|
},
|
||||||
|
{
|
||||||
|
text: 'Contribution',
|
||||||
|
link: 'https://github.com/duke-git/lancet/blob/main/CONTRIBUTION.md',
|
||||||
|
},
|
||||||
|
],
|
||||||
|
},
|
||||||
|
],
|
||||||
|
|
||||||
|
sidebar: {
|
||||||
|
'/en/guide/': [
|
||||||
|
{
|
||||||
|
text: 'Introduction',
|
||||||
|
collapsed: false,
|
||||||
|
items: [
|
||||||
|
{
|
||||||
|
text: 'What is Lancet?',
|
||||||
|
link: '/en/guide/introduction',
|
||||||
|
},
|
||||||
|
{
|
||||||
|
text: 'Getting started',
|
||||||
|
link: '/en/guide/getting_started',
|
||||||
|
},
|
||||||
|
],
|
||||||
|
},
|
||||||
|
{
|
||||||
|
text: 'Contribute Code',
|
||||||
|
collapsed: false,
|
||||||
|
items: [
|
||||||
|
{
|
||||||
|
text: 'Contribution guide',
|
||||||
|
link: '/en/guide/contribution_guide',
|
||||||
|
},
|
||||||
|
{
|
||||||
|
text: 'Contributors',
|
||||||
|
link: '/en/guide/contributors',
|
||||||
|
},
|
||||||
|
],
|
||||||
|
},
|
||||||
|
{
|
||||||
|
text: 'API Reference',
|
||||||
|
link: '/en/api/overview'
|
||||||
|
},
|
||||||
|
],
|
||||||
|
'/en/api/': [
|
||||||
|
{
|
||||||
|
text: 'Overview',
|
||||||
|
items: [{ text: 'API overview', link: '/en/api/overview' }],
|
||||||
|
},
|
||||||
|
{
|
||||||
|
text: 'Packages',
|
||||||
|
collapsed: false,
|
||||||
|
items: [
|
||||||
|
{ text: 'algorithm', link: '/en/api/packages/algorithm' },
|
||||||
|
{ text: 'compare', link: '/en/api/packages/compare' },
|
||||||
|
{ text: 'concurrency', link: '/en/api/packages/concurrency' },
|
||||||
|
{ text: 'condition', link: '/en/api/packages/condition' },
|
||||||
|
{ text: 'convertor', link: '/en/api/packages/convertor' },
|
||||||
|
{ text: 'cryptor', link: '/en/api/packages/cryptor' },
|
||||||
|
{
|
||||||
|
text: 'datastructure',
|
||||||
|
collapsed: true,
|
||||||
|
items: [
|
||||||
|
{ text: 'list', link: '/en/api/packages/datastructure/list' },
|
||||||
|
{ text: 'safelist', link: '/en/api/packages/datastructure/copyonwritelist' },
|
||||||
|
{ text: 'link', link: '/en/api/packages/datastructure/link' },
|
||||||
|
{ text: 'stack', link: '/en/api/packages/datastructure/stack' },
|
||||||
|
{ text: 'queue', link: '/en/api/packages/datastructure/queue' },
|
||||||
|
{ text: 'heap', link: '/en/api/packages/datastructure/heap' },
|
||||||
|
{ text: 'tree', link: '/en/api/packages/datastructure/tree' },
|
||||||
|
{ text: 'set', link: '/en/api/packages/datastructure/set' },
|
||||||
|
{ text: 'hashmap', link: '/en/api/packages/datastructure/hashmap' },
|
||||||
|
],
|
||||||
|
},
|
||||||
|
{ text: 'datetime', link: '/en/api/packages/datetime' },
|
||||||
|
{ text: 'enum', link: '/en/api/packages/enum' },
|
||||||
|
{ text: 'eventbus', link: '/en/api/packages/eventbus' },
|
||||||
|
{ text: 'fileutil', link: '/en/api/packages/fileutil' },
|
||||||
|
{ text: 'formatter', link: '/en/api/packages/formatter' },
|
||||||
|
{ text: 'function', link: '/en/api/packages/function' },
|
||||||
|
{ text: 'mathutil', link: '/en/api/packages/mathutil' },
|
||||||
|
{ text: 'maputil', link: '/en/api/packages/maputil' },
|
||||||
|
{ text: 'netutil', link: '/en/api/packages/netutil' },
|
||||||
|
{ text: 'pointer', link: '/en/api/packages/pointer' },
|
||||||
|
{ text: 'random', link: '/en/api/packages/random' },
|
||||||
|
{ text: 'retry', link: '/en/api/packages/retry' },
|
||||||
|
{ text: 'slice', link: '/en/api/packages/slice' },
|
||||||
|
{ text: 'stream', link: '/en/api/packages/stream' },
|
||||||
|
{ text: 'struct', link: '/en/api/packages/struct' },
|
||||||
|
{ text: 'strutil', link: '/en/api/packages/strutil' },
|
||||||
|
{ text: 'tuple', link: '/en/api/packages/tuple' },
|
||||||
|
{ text: 'validator', link: '/en/api/packages/validator' },
|
||||||
|
{ text: 'system', link: '/en/api/packages/system' },
|
||||||
|
{ text: 'xerror', link: '/en/api/packages/xerror' },
|
||||||
|
],
|
||||||
|
},
|
||||||
|
],
|
||||||
|
},
|
||||||
|
},
|
||||||
|
}
|
||||||
@@ -0,0 +1,154 @@
|
|||||||
|
import type { DefaultTheme, LocaleSpecificConfig } from 'vitepress'
|
||||||
|
|
||||||
|
export const META_URL = 'https://www.golancet.cn'
|
||||||
|
export const META_TITLE = 'Lancet'
|
||||||
|
export const META_DESCRIPTION = '一个强大的Go语言工具函数库'
|
||||||
|
|
||||||
|
export const zhConfig: LocaleSpecificConfig<DefaultTheme.Config> = {
|
||||||
|
description: META_DESCRIPTION,
|
||||||
|
|
||||||
|
head: [
|
||||||
|
['meta', { property: 'og:url', content: META_URL }],
|
||||||
|
['meta', { property: 'og:description', content: META_DESCRIPTION }],
|
||||||
|
],
|
||||||
|
|
||||||
|
themeConfig: {
|
||||||
|
editLink: {
|
||||||
|
pattern: 'https://github.com/duke-git/lancet/edit/v2/docs/:path',
|
||||||
|
text: '对本页提出修改建议',
|
||||||
|
},
|
||||||
|
outline: {
|
||||||
|
label: '本页内容',
|
||||||
|
},
|
||||||
|
|
||||||
|
docFooter: {
|
||||||
|
prev: '上一页',
|
||||||
|
next: '下一页',
|
||||||
|
},
|
||||||
|
|
||||||
|
nav: [
|
||||||
|
{
|
||||||
|
text: '首页',
|
||||||
|
link: '/',
|
||||||
|
activeMatch: '^/',
|
||||||
|
},
|
||||||
|
{
|
||||||
|
text: '指南',
|
||||||
|
link: '/guide/introduction',
|
||||||
|
activeMatch: '^/guide/',
|
||||||
|
},
|
||||||
|
{ text: 'API', link: '/api/overview', activeMatch: '^/api/' },
|
||||||
|
{
|
||||||
|
text: '相关链接',
|
||||||
|
items: [
|
||||||
|
{
|
||||||
|
text: '论坛',
|
||||||
|
link: 'https://github.com/duke-git/lancet/discussions',
|
||||||
|
},
|
||||||
|
{
|
||||||
|
text: '更新日志',
|
||||||
|
link: 'https://github.com/duke-git/lancet/releases',
|
||||||
|
},
|
||||||
|
{
|
||||||
|
text: '参与贡献',
|
||||||
|
link: 'https://github.com/duke-git/lancet/blob/main/CONTRIBUTION.zh-CN.md',
|
||||||
|
},
|
||||||
|
],
|
||||||
|
},
|
||||||
|
],
|
||||||
|
|
||||||
|
sidebar: {
|
||||||
|
'/guide/': [
|
||||||
|
{
|
||||||
|
text: '介绍',
|
||||||
|
collapsed: false,
|
||||||
|
items: [
|
||||||
|
{
|
||||||
|
text: 'Lancet是什么?',
|
||||||
|
link: '/guide/introduction',
|
||||||
|
},
|
||||||
|
{
|
||||||
|
text: '开始',
|
||||||
|
link: '/guide/getting_started',
|
||||||
|
},
|
||||||
|
],
|
||||||
|
},
|
||||||
|
{
|
||||||
|
text: '贡献代码',
|
||||||
|
collapsed: false,
|
||||||
|
items: [
|
||||||
|
{
|
||||||
|
text: '贡献指南',
|
||||||
|
link: '/guide/contribution_guide',
|
||||||
|
},
|
||||||
|
{
|
||||||
|
text: '贡献者',
|
||||||
|
link: '/guide/contributors',
|
||||||
|
},
|
||||||
|
],
|
||||||
|
},
|
||||||
|
{
|
||||||
|
text: 'API手册',
|
||||||
|
link: '/api/overview'
|
||||||
|
},
|
||||||
|
],
|
||||||
|
|
||||||
|
'/api/': [
|
||||||
|
{
|
||||||
|
text: '概览',
|
||||||
|
items: [{ text: 'API概述', link: '/api/overview' }],
|
||||||
|
},
|
||||||
|
{
|
||||||
|
text: 'API文档',
|
||||||
|
collapsed: false,
|
||||||
|
items: [
|
||||||
|
{ text: '算法', link: '/api/packages/algorithm' },
|
||||||
|
{ text: '比较器', link: '/api/packages/compare' },
|
||||||
|
{ text: '并发处理', link: '/api/packages/concurrency' },
|
||||||
|
{ text: '条件判断', link: '/api/packages/condition' },
|
||||||
|
{ text: '类型转换', link: '/api/packages/convertor' },
|
||||||
|
{ text: '加密&解密', link: '/api/packages/cryptor' },
|
||||||
|
{
|
||||||
|
text: '数据结构',
|
||||||
|
collapsed: true,
|
||||||
|
items: [
|
||||||
|
{ text: '线性表', link: '/api/packages/datastructure/list' },
|
||||||
|
{
|
||||||
|
text: '线性表(线程安全)',
|
||||||
|
link: '/api/packages/datastructure/copyonwritelist',
|
||||||
|
},
|
||||||
|
{ text: '链表', link: '/api/packages/datastructure/link' },
|
||||||
|
{ text: '栈', link: '/api/packages/datastructure/stack' },
|
||||||
|
{ text: '队列', link: '/api/packages/datastructure/queue' },
|
||||||
|
{ text: '堆', link: '/api/packages/datastructure/heap' },
|
||||||
|
{ text: '树', link: '/api/packages/datastructure/tree' },
|
||||||
|
{ text: '集合', link: '/api/packages/datastructure/set' },
|
||||||
|
{ text: 'HashMap', link: '/api/packages/datastructure/hashmap' },
|
||||||
|
],
|
||||||
|
},
|
||||||
|
{ text: '日期&时间', link: '/api/packages/datetime' },
|
||||||
|
{ text: '事件总线', link: '/api/packages/eventbus' },
|
||||||
|
{ text: '文件处理', link: '/api/packages/fileutil' },
|
||||||
|
{ text: '格式化工具', link: '/api/packages/formatter' },
|
||||||
|
{ text: '函数', link: '/api/packages/function' },
|
||||||
|
{ text: '数学工具', link: '/api/packages/mathutil' },
|
||||||
|
{ text: 'Map', link: '/api/packages/maputil' },
|
||||||
|
{ text: '网络', link: '/api/packages/netutil' },
|
||||||
|
{ text: '指针', link: '/api/packages/pointer' },
|
||||||
|
{ text: '随机数', link: '/api/packages/random' },
|
||||||
|
{ text: '重试', link: '/api/packages/retry' },
|
||||||
|
{ text: '切片', link: '/api/packages/slice' },
|
||||||
|
{ text: '流', link: '/api/packages/stream' },
|
||||||
|
{ text: '结构体', link: '/api/packages/struct' },
|
||||||
|
{ text: '字符串', link: '/api/packages/strutil' },
|
||||||
|
{ text: '枚举', link: '/api/packages/enum' },
|
||||||
|
{ text: '元组', link: '/api/packages/tuple' },
|
||||||
|
{ text: '验证器', link: '/api/packages/validator' },
|
||||||
|
{ text: '系统工具函数', link: '/api/packages/system' },
|
||||||
|
{ text: '错误处理', link: '/api/packages/xerror' },
|
||||||
|
],
|
||||||
|
},
|
||||||
|
],
|
||||||
|
},
|
||||||
|
},
|
||||||
|
}
|
||||||
@@ -0,0 +1,70 @@
|
|||||||
|
---
|
||||||
|
outline: deep
|
||||||
|
---
|
||||||
|
|
||||||
|
# API 概述
|
||||||
|
|
||||||
|
<b>lancet(柳叶刀)是一个功能强大、全面、高效、可复用的 go 语言工具函数库。包含 25 个包,超过 600 个工具函数。功能涵盖字符串处理、切片处理、网络、并发、加解密、文件处理、时间/日期、流处理、迭代器等等。</b>
|
||||||
|
|
||||||
|
<style>
|
||||||
|
.package-title {
|
||||||
|
color: black;
|
||||||
|
font-size: 18px;
|
||||||
|
text-align: center;
|
||||||
|
font-weight: bold;
|
||||||
|
}
|
||||||
|
.package-container {
|
||||||
|
font-size: 16px;
|
||||||
|
border: 1px dashed;
|
||||||
|
padding: 10px;
|
||||||
|
text-align: center;
|
||||||
|
}
|
||||||
|
|
||||||
|
.package-cell {
|
||||||
|
height: 40px;
|
||||||
|
width: 140px;
|
||||||
|
display: inline-block;
|
||||||
|
vertical-align: middle;
|
||||||
|
line-height: 40px;
|
||||||
|
background: #6cadf5;
|
||||||
|
border: 1px solid;
|
||||||
|
margin-right: 10px;
|
||||||
|
margin-bottom: 10px;
|
||||||
|
border-radius: 6px;
|
||||||
|
font-weight: bold;
|
||||||
|
}
|
||||||
|
</style>
|
||||||
|
|
||||||
|
<div>
|
||||||
|
<p class="package-title">lancet功能模块</p>
|
||||||
|
<div class="package-container">
|
||||||
|
<div class="package-cell">algorithm</div>
|
||||||
|
<div class="package-cell">compare</div>
|
||||||
|
<div class="package-cell">concurrency</div>
|
||||||
|
<div class="package-cell">condition</div>
|
||||||
|
<div class="package-cell">convertor</div>
|
||||||
|
<div class="package-cell">cryptor</div>
|
||||||
|
<div class="package-cell">datastructure</div>
|
||||||
|
<div class="package-cell">datetime</div>
|
||||||
|
<div class="package-cell">enum</div>
|
||||||
|
<div class="package-cell">eventbus</div>
|
||||||
|
<div class="package-cell">fileutil</div>
|
||||||
|
<div class="package-cell">formatter</div>
|
||||||
|
<div class="package-cell">function</div>
|
||||||
|
<div class="package-cell">iterator</div>
|
||||||
|
<div class="package-cell">maputil</div>
|
||||||
|
<div class="package-cell">mathutil</div>
|
||||||
|
<div class="package-cell">netutil</div>
|
||||||
|
<div class="package-cell">pointer</div>
|
||||||
|
<div class="package-cell">random</div>
|
||||||
|
<div class="package-cell">retry</div>
|
||||||
|
<div class="package-cell">slice</div>
|
||||||
|
<div class="package-cell">stream</div>
|
||||||
|
<div class="package-cell">structs</div>
|
||||||
|
<div class="package-cell">strutil</div>
|
||||||
|
<div class="package-cell">system</div>
|
||||||
|
<div class="package-cell">tuple</div>
|
||||||
|
<div class="package-cell">validator</div>
|
||||||
|
<div class="package-cell">xerror</div>
|
||||||
|
</div>
|
||||||
|
</div>
|
||||||
@@ -8,7 +8,7 @@ algorithm 算法包实现一些基本算法,sort,search,lrucache。
|
|||||||
|
|
||||||
- [https://github.com/duke-git/lancet/blob/main/algorithm/sort.go](https://github.com/duke-git/lancet/blob/main/algorithm/sort.go)
|
- [https://github.com/duke-git/lancet/blob/main/algorithm/sort.go](https://github.com/duke-git/lancet/blob/main/algorithm/sort.go)
|
||||||
- [https://github.com/duke-git/lancet/blob/main/algorithm/search.go](https://github.com/duke-git/lancet/blob/main/algorithm/search.go)
|
- [https://github.com/duke-git/lancet/blob/main/algorithm/search.go](https://github.com/duke-git/lancet/blob/main/algorithm/search.go)
|
||||||
- [https://github.com/duke-git/lancet/blob/main/algorithm/lru_cache.go](https://github.com/duke-git/lancet/blob/main/algorithm/lru_cache.go)
|
- [https://github.com/duke-git/lancet/blob/main/algorithm/lrucache.go](https://github.com/duke-git/lancet/blob/main/algorithm/lrucache.go)
|
||||||
|
|
||||||
<div STYLE="page-break-after: always;"></div>
|
<div STYLE="page-break-after: always;"></div>
|
||||||
|
|
||||||
@@ -43,15 +43,15 @@ import (
|
|||||||
|
|
||||||
### <span id="BubbleSort">BubbleSort</span>
|
### <span id="BubbleSort">BubbleSort</span>
|
||||||
|
|
||||||
<p>冒泡排序,参数comparator需要实现包lancetconstraints.Comparator。</p>
|
<p>冒泡排序,参数comparator需要实现包constraints.Comparator。</p>
|
||||||
|
|
||||||
<b>函数签名:</b>
|
<b>函数签名:</b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
func BubbleSort[T any](slice []T, comparator lancetconstraints.Comparator)
|
func BubbleSort[T any](slice []T, comparator constraints.Comparator)
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/GNdv7Jg2Taj)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -91,15 +91,15 @@ func main() {
|
|||||||
|
|
||||||
### <span id="InsertionSort">InsertionSort</span>
|
### <span id="InsertionSort">InsertionSort</span>
|
||||||
|
|
||||||
<p>插入排序,参数comparator需要实现包lancetconstraints.Comparator。</p>
|
<p>插入排序,参数comparator需要实现包constraints.Comparator。</p>
|
||||||
|
|
||||||
<b>函数签名:</b>
|
<b>函数签名:</b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
func InsertionSort[T any](slice []T, comparator lancetconstraints.Comparator)
|
func InsertionSort[T any](slice []T, comparator constraints.Comparator)
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/G5LJiWgJJW6)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -117,7 +117,7 @@ type people struct {
|
|||||||
// PeopleAageComparator sort people slice by age field
|
// PeopleAageComparator sort people slice by age field
|
||||||
type peopleAgeComparator struct{}
|
type peopleAgeComparator struct{}
|
||||||
|
|
||||||
// Compare implements github.com/duke-git/lancet/lancetconstraints/constraints.go/Comparator
|
// Compare implements github.com/duke-git/lancet/constraints/constraints.go/Comparator
|
||||||
func (pc *peopleAgeComparator) Compare(v1 any, v2 any) int {
|
func (pc *peopleAgeComparator) Compare(v1 any, v2 any) int {
|
||||||
p1, _ := v1.(people)
|
p1, _ := v1.(people)
|
||||||
p2, _ := v2.(people)
|
p2, _ := v2.(people)
|
||||||
@@ -154,15 +154,15 @@ func main() {
|
|||||||
|
|
||||||
### <span id="SelectionSort">SelectionSort</span>
|
### <span id="SelectionSort">SelectionSort</span>
|
||||||
|
|
||||||
<p>选择排序,参数comparator需要实现包lancetconstraints.Comparator。</p>
|
<p>选择排序,参数comparator需要实现包constraints.Comparator。</p>
|
||||||
|
|
||||||
<b>函数签名:</b>
|
<b>函数签名:</b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
func SelectionSort[T any](slice []T, comparator lancetconstraints.Comparator)
|
func SelectionSort[T any](slice []T, comparator constraints.Comparator)
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/oXovbkekayS)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -202,15 +202,15 @@ func main() {
|
|||||||
|
|
||||||
### <span id="ShellSort">ShellSort</span>
|
### <span id="ShellSort">ShellSort</span>
|
||||||
|
|
||||||
<p>希尔排序,参数comparator需要实现包lancetconstraints.Comparator。</p>
|
<p>希尔排序,参数comparator需要实现包constraints.Comparator。</p>
|
||||||
|
|
||||||
<b>函数签名:</b>
|
<b>函数签名:</b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
func ShellSort[T any](slice []T, comparator lancetconstraints.Comparator)
|
func ShellSort[T any](slice []T, comparator constraints.Comparator)
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/3ibkszpJEu3)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -250,15 +250,15 @@ func main() {
|
|||||||
|
|
||||||
### <span id="QuickSort">QuickSort</span>
|
### <span id="QuickSort">QuickSort</span>
|
||||||
|
|
||||||
<p>快速排序,参数comparator需要实现包lancetconstraints.Comparator。</p>
|
<p>快速排序,参数comparator需要实现包constraints.Comparator。</p>
|
||||||
|
|
||||||
<b>函数签名:</b>
|
<b>函数签名:</b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
func QuickSort[T any](slice []T comparator lancetconstraints.Comparator)
|
func QuickSort[T any](slice []T comparator constraints.Comparator)
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/7Y7c1Elk3ax)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -298,15 +298,15 @@ func main() {
|
|||||||
|
|
||||||
### <span id="HeapSort">HeapSort</span>
|
### <span id="HeapSort">HeapSort</span>
|
||||||
|
|
||||||
<p>堆排序,参数comparator需要实现包lancetconstraints.Comparator。</p>
|
<p>堆排序,参数comparator需要实现包constraints.Comparator。</p>
|
||||||
|
|
||||||
<b>函数签名:</b>
|
<b>函数签名:</b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
func HeapSort[T any](slice []T, comparator lancetconstraints.Comparator)
|
func HeapSort[T any](slice []T, comparator constraints.Comparator)
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/u6Iwa1VZS_f)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -346,15 +346,15 @@ func main() {
|
|||||||
|
|
||||||
### <span id="MergeSort">MergeSort</span>
|
### <span id="MergeSort">MergeSort</span>
|
||||||
|
|
||||||
<p>归并排序,参数comparator需要实现包lancetconstraints.Comparator。</p>
|
<p>归并排序,参数comparator需要实现包constraints.Comparator。</p>
|
||||||
|
|
||||||
<b>函数签名:</b>
|
<b>函数签名:</b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
func MergeSort[T any](slice []T, comparator lancetconstraints.Comparator)
|
func MergeSort[T any](slice []T, comparator constraints.Comparator)
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/ydinn9YzUJn)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -394,15 +394,15 @@ func main() {
|
|||||||
|
|
||||||
### <span id="CountSort">CountSort</span>
|
### <span id="CountSort">CountSort</span>
|
||||||
|
|
||||||
<p>计数排序,参数comparator需要实现包lancetconstraints.Comparator。</p>
|
<p>计数排序,参数comparator需要实现包constraints.Comparator。</p>
|
||||||
|
|
||||||
<b>函数签名:</b>
|
<b>函数签名:</b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
func CountSort[T any](slice []T, comparator lancetconstraints.Comparator) []T
|
func CountSort[T any](slice []T, comparator constraints.Comparator) []T
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/tB-Umgm0DrP)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -443,15 +443,15 @@ func main() {
|
|||||||
|
|
||||||
### <span id="BinarySearch">BinarySearch</span>
|
### <span id="BinarySearch">BinarySearch</span>
|
||||||
|
|
||||||
<p>二分递归查找,返回元素索引,未找到元素返回-1,参数comparator需要实现包lancetconstraints.Comparator。</p>
|
<p>二分递归查找,返回元素索引,未找到元素返回-1,参数comparator需要实现包constraints.Comparator。</p>
|
||||||
|
|
||||||
<b>函数签名:</b>
|
<b>函数签名:</b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
func BinarySearch[T any](sortedSlice []T, target T, lowIndex, highIndex int, comparator lancetconstraints.Comparator) int
|
func BinarySearch[T any](sortedSlice []T, target T, lowIndex, highIndex int, comparator constraints.Comparator) int
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例: <span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/t6MeGiUSN47)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -494,15 +494,15 @@ func main() {
|
|||||||
|
|
||||||
### <span id="BinaryIterativeSearch">BinaryIterativeSearch</span>
|
### <span id="BinaryIterativeSearch">BinaryIterativeSearch</span>
|
||||||
|
|
||||||
<p>二分迭代查找,返回元素索引,未找到元素返回-1,参数comparator需要实现包lancetconstraints.Comparator。</p>
|
<p>二分迭代查找,返回元素索引,未找到元素返回-1,参数comparator需要实现包constraints.Comparator。</p>
|
||||||
|
|
||||||
<b>函数签名:</b>
|
<b>函数签名:</b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
func BinaryIterativeSearch[T any](sortedSlice []T, target T, lowIndex, highIndex int, comparator lancetconstraints.Comparator) int
|
func BinaryIterativeSearch[T any](sortedSlice []T, target T, lowIndex, highIndex int, comparator constraints.Comparator) int
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例: <span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/Anozfr8ZLH3)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -553,7 +553,7 @@ func main() {
|
|||||||
func LinearSearch[T any](slice []T, target T, equal func(a, b T) bool) int
|
func LinearSearch[T any](slice []T, target T, equal func(a, b T) bool) int
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例: <span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/IsS7rgn5s3x)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -596,7 +596,7 @@ func (l *LRUCache[K, V]) Delete(key K) bool
|
|||||||
func (l *LRUCache[K, V]) Len() int
|
func (l *LRUCache[K, V]) Len() int
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/-EZjgOURufP)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -30,10 +30,12 @@ import (
|
|||||||
- [GreaterThan](#GreaterThan)
|
- [GreaterThan](#GreaterThan)
|
||||||
- [LessOrEqual](#LessOrEqual)
|
- [LessOrEqual](#LessOrEqual)
|
||||||
- [GreaterOrEqual](#GreaterOrEqual)
|
- [GreaterOrEqual](#GreaterOrEqual)
|
||||||
|
- [InDelta](#InDelta)
|
||||||
|
|
||||||
|
|
||||||
<div STYLE="page-break-after: always;"></div>
|
<div STYLE="page-break-after: always;"></div>
|
||||||
|
|
||||||
## Documentation
|
## 文档
|
||||||
|
|
||||||
### <span id="Equal">Equal</span>
|
### <span id="Equal">Equal</span>
|
||||||
|
|
||||||
@@ -45,7 +47,7 @@ import (
|
|||||||
func Equal(left, right any) bool
|
func Equal(left, right any) bool
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例: <span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/wmVxR-to4lz)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -94,7 +96,7 @@ func main() {
|
|||||||
func EqualValue(left, right any) bool
|
func EqualValue(left, right any) bool
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例: <span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/fxnna_LLD9u)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -133,7 +135,7 @@ func main() {
|
|||||||
func LessThan(left, right any) bool
|
func LessThan(left, right any) bool
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例: <span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/cYh7FQQj0ne)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -182,7 +184,7 @@ func main() {
|
|||||||
func GreaterThan(left, right any) bool
|
func GreaterThan(left, right any) bool
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例: <span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/9-NYDFZmIMp)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -234,7 +236,7 @@ func main() {
|
|||||||
func LessOrEqual(left, right any) bool
|
func LessOrEqual(left, right any) bool
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例: <span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/e4T_scwoQzp)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -283,7 +285,7 @@ func main() {
|
|||||||
func GreaterOrEqual(left, right any) bool
|
func GreaterOrEqual(left, right any) bool
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例: <span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/vx8mP0U8DFk)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -324,3 +326,50 @@ func main() {
|
|||||||
// false
|
// false
|
||||||
}
|
}
|
||||||
```
|
```
|
||||||
|
|
||||||
|
### <span id="InDelta">InDelta</span>
|
||||||
|
|
||||||
|
<p>检查增量内两个值是否相等。</p>
|
||||||
|
|
||||||
|
<b>函数签名:</b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
func InDelta[T constraints.Integer | constraints.Float](left, right T, delta float64) bool
|
||||||
|
```
|
||||||
|
|
||||||
|
<b>示例: <span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/TuDdcNtMkjo)</span></b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
package main
|
||||||
|
|
||||||
|
import (
|
||||||
|
"fmt"
|
||||||
|
"github.com/duke-git/lancet/v2/compare"
|
||||||
|
)
|
||||||
|
|
||||||
|
func main() {
|
||||||
|
result1 := InDelta(1, 1, 0)
|
||||||
|
result2 := InDelta(1, 2, 0)
|
||||||
|
|
||||||
|
result3 := InDelta(2.0/3.0, 0.66667, 0.001)
|
||||||
|
result4 := InDelta(2.0/3.0, 0.0, 0.001)
|
||||||
|
|
||||||
|
result5 := InDelta(float64(74.96)-float64(20.48), 54.48, 0)
|
||||||
|
result6 := InDelta(float64(74.96)-float64(20.48), 54.48, 1e-14)
|
||||||
|
|
||||||
|
fmt.Println(result1)
|
||||||
|
fmt.Println(result2)
|
||||||
|
fmt.Println(result3)
|
||||||
|
fmt.Println(result4)
|
||||||
|
fmt.Println(result5)
|
||||||
|
fmt.Println(result6)
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// true
|
||||||
|
// false
|
||||||
|
// true
|
||||||
|
// false
|
||||||
|
// false
|
||||||
|
// true
|
||||||
|
}
|
||||||
|
```
|
||||||
@@ -0,0 +1,852 @@
|
|||||||
|
# Concurrency
|
||||||
|
|
||||||
|
并发包包含一些支持并发编程的功能。例如:goroutine, channel 等。
|
||||||
|
|
||||||
|
<div STYLE="page-break-after: always;"></div>
|
||||||
|
|
||||||
|
## 源码:
|
||||||
|
|
||||||
|
- [https://github.com/duke-git/lancet/blob/main/concurrency/channel.go](https://github.com/duke-git/lancet/blob/main/concurrency/channel.go)
|
||||||
|
- [https://github.com/duke-git/lancet/blob/main/concurrency/keyed_locker.go](https://github.com/duke-git/lancet/blob/main/concurrency/keyed_locker.go)
|
||||||
|
|
||||||
|
<div STYLE="page-break-after: always;"></div>
|
||||||
|
|
||||||
|
## 用法:
|
||||||
|
|
||||||
|
```go
|
||||||
|
import (
|
||||||
|
"github.com/duke-git/lancet/v2/concurrency"
|
||||||
|
)
|
||||||
|
```
|
||||||
|
|
||||||
|
<div STYLE="page-break-after: always;"></div>
|
||||||
|
|
||||||
|
## 目录
|
||||||
|
|
||||||
|
### Channel
|
||||||
|
|
||||||
|
- [NewChannel](#NewChannel)
|
||||||
|
- [Bridge](#Bridge)
|
||||||
|
- [FanIn](#FanIn)
|
||||||
|
- [Generate](#Generate)
|
||||||
|
- [Or](#Or)
|
||||||
|
- [OrDone](#OrDone)
|
||||||
|
- [Repeat](#Repeat)
|
||||||
|
- [RepeatFn](#RepeatFn)
|
||||||
|
- [Take](#Take)
|
||||||
|
- [Tee](#Tee)
|
||||||
|
|
||||||
|
### KeyedLocker
|
||||||
|
|
||||||
|
- [NewKeyedLocker](#NewKeyedLocker)
|
||||||
|
- [KeyedLocker_Do](#Do)
|
||||||
|
- [NewRWKeyedLocker](#NewRWKeyedLocker)
|
||||||
|
- [RLock](#RLock)
|
||||||
|
- [Lock](#Lock)
|
||||||
|
- [NewTryKeyedLocker](#NewTryKeyedLocker)
|
||||||
|
- [TryLock](#TryLock)
|
||||||
|
- [Unlock](#Unlock)
|
||||||
|
|
||||||
|
<div STYLE="page-break-after: always;"></div>
|
||||||
|
|
||||||
|
## 文档
|
||||||
|
|
||||||
|
### Channel
|
||||||
|
|
||||||
|
### <span id="NewChannel">NewChannel</span>
|
||||||
|
|
||||||
|
<p>返回一个Channel指针实例</p>
|
||||||
|
|
||||||
|
<b>函数签名:</b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
type Channel[T any] struct
|
||||||
|
func NewChannel[T any]() *Channel[T]
|
||||||
|
```
|
||||||
|
|
||||||
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/7aB4KyMMp9A)</span></b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
package main
|
||||||
|
|
||||||
|
import (
|
||||||
|
"fmt"
|
||||||
|
"github.com/duke-git/lancet/v2/concurrency"
|
||||||
|
)
|
||||||
|
|
||||||
|
func main() {
|
||||||
|
c := concurrency.NewChannel[int]()
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
|
### <span id="Bridge">Bridge</span>
|
||||||
|
|
||||||
|
<p>将多个channel链接到一个channel,直到取消上下文。</p>
|
||||||
|
|
||||||
|
<b>函数签名:</b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
func (c *Channel[T]) Bridge(ctx context.Context, chanStream <-chan <-chan T) <-chan T
|
||||||
|
```
|
||||||
|
|
||||||
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/qmWSy1NVF-Y)</span></b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
package main
|
||||||
|
|
||||||
|
import (
|
||||||
|
"context"
|
||||||
|
"fmt"
|
||||||
|
"github.com/duke-git/lancet/v2/concurrency"
|
||||||
|
)
|
||||||
|
|
||||||
|
func main() {
|
||||||
|
ctx, cancel := context.WithCancel(context.Background())
|
||||||
|
defer cancel()
|
||||||
|
|
||||||
|
c := concurrency.NewChannel[int]()
|
||||||
|
genVals := func() <-chan <-chan int {
|
||||||
|
out := make(chan (<-chan int))
|
||||||
|
go func() {
|
||||||
|
defer close(out)
|
||||||
|
for i := 1; i <= 5; i++ {
|
||||||
|
stream := make(chan int, 1)
|
||||||
|
stream <- i
|
||||||
|
close(stream)
|
||||||
|
out <- stream
|
||||||
|
}
|
||||||
|
}()
|
||||||
|
return out
|
||||||
|
}
|
||||||
|
|
||||||
|
for v := range c.Bridge(ctx, genVals()) {
|
||||||
|
fmt.Println(v)
|
||||||
|
}
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// 1
|
||||||
|
// 2
|
||||||
|
// 3
|
||||||
|
// 4
|
||||||
|
// 5
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
|
### <span id="FanIn">FanIn</span>
|
||||||
|
|
||||||
|
<p>将多个channel合并为一个channel,直到取消上下文。</p>
|
||||||
|
|
||||||
|
<b>函数签名:</b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
func (c *Channel[T]) FanIn(ctx context.Context, channels ...<-chan T) <-chan T
|
||||||
|
```
|
||||||
|
|
||||||
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/2VYFMexEvTm)</span></b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
package main
|
||||||
|
|
||||||
|
import (
|
||||||
|
"context"
|
||||||
|
"fmt"
|
||||||
|
"github.com/duke-git/lancet/v2/concurrency"
|
||||||
|
)
|
||||||
|
|
||||||
|
func main() {
|
||||||
|
ctx, cancel := context.WithCancel(context.Background())
|
||||||
|
defer cancel()
|
||||||
|
|
||||||
|
c := concurrency.NewChannel[int]()
|
||||||
|
channels := make([]<-chan int, 2)
|
||||||
|
|
||||||
|
for i := 0; i < 2; i++ {
|
||||||
|
channels[i] = c.Take(ctx, c.Repeat(ctx, i), 2)
|
||||||
|
}
|
||||||
|
|
||||||
|
chs := c.FanIn(ctx, channels...)
|
||||||
|
|
||||||
|
for v := range chs {
|
||||||
|
fmt.Println(v) //1 1 0 0 or 0 0 1 1
|
||||||
|
}
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
|
### <span id="Generate">Generate</span>
|
||||||
|
|
||||||
|
<p>根据传入的值,生成channel.</p>
|
||||||
|
|
||||||
|
<b>函数签名:</b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
func (c *Channel[T]) Generate(ctx context.Context, values ...T) <-chan T
|
||||||
|
```
|
||||||
|
|
||||||
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/7aB4KyMMp9A)</span></b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
package main
|
||||||
|
|
||||||
|
import (
|
||||||
|
"context"
|
||||||
|
"fmt"
|
||||||
|
"github.com/duke-git/lancet/v2/concurrency"
|
||||||
|
)
|
||||||
|
|
||||||
|
func main() {
|
||||||
|
ctx, cancel := context.WithCancel(context.Background())
|
||||||
|
defer cancel()
|
||||||
|
|
||||||
|
c := concurrency.NewChannel[int]()
|
||||||
|
intStream := c.Generate(ctx, 1, 2, 3)
|
||||||
|
|
||||||
|
fmt.Println(<-intStream)
|
||||||
|
fmt.Println(<-intStream)
|
||||||
|
fmt.Println(<-intStream)
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// 1
|
||||||
|
// 2
|
||||||
|
// 3
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
|
### <span id="Repeat">Repeat</span>
|
||||||
|
|
||||||
|
<p>返回一个channel,将参数`values`重复放入channel,直到取消上下文。</p>
|
||||||
|
|
||||||
|
<b>函数签名:</b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
func (c *Channel[T]) Repeat(ctx context.Context, values ...T) <-chan T
|
||||||
|
```
|
||||||
|
|
||||||
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/k5N_ALVmYjE)</span></b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
package main
|
||||||
|
|
||||||
|
import (
|
||||||
|
"context"
|
||||||
|
"fmt"
|
||||||
|
"github.com/duke-git/lancet/v2/concurrency"
|
||||||
|
)
|
||||||
|
|
||||||
|
func main() {
|
||||||
|
ctx, cancel := context.WithCancel(context.Background())
|
||||||
|
defer cancel()
|
||||||
|
|
||||||
|
c := concurrency.NewChannel[int]()
|
||||||
|
intStream := c.Take(ctx, c.Repeat(ctx, 1, 2), 4)
|
||||||
|
|
||||||
|
for v := range intStream {
|
||||||
|
fmt.Println(v)
|
||||||
|
}
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// 1
|
||||||
|
// 2
|
||||||
|
// 1
|
||||||
|
// 2
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
|
### <span id="RepeatFn">RepeatFn</span>
|
||||||
|
|
||||||
|
<p>返回一个channel,重复执行函数fn,并将结果放入返回的channel,直到取消上下文。</p>
|
||||||
|
|
||||||
|
<b>函数签名:</b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
func (c *Channel[T]) RepeatFn(ctx context.Context, fn func() T) <-chan T
|
||||||
|
```
|
||||||
|
|
||||||
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/4J1zAWttP85)</span></b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
package main
|
||||||
|
|
||||||
|
import (
|
||||||
|
"context"
|
||||||
|
"fmt"
|
||||||
|
"github.com/duke-git/lancet/v2/concurrency"
|
||||||
|
)
|
||||||
|
|
||||||
|
func main() {
|
||||||
|
ctx, cancel := context.WithCancel(context.Background())
|
||||||
|
defer cancel()
|
||||||
|
|
||||||
|
fn := func() string {
|
||||||
|
return "hello"
|
||||||
|
}
|
||||||
|
|
||||||
|
c := concurrency.NewChannel[string]()
|
||||||
|
intStream := c.Take(ctx, c.RepeatFn(ctx, fn), 3)
|
||||||
|
|
||||||
|
for v := range intStream {
|
||||||
|
fmt.Println(v)
|
||||||
|
}
|
||||||
|
// Output:
|
||||||
|
// hello
|
||||||
|
// hello
|
||||||
|
// hello
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
|
### <span id="Or">Or</span>
|
||||||
|
|
||||||
|
<p>将一个或多个channel读取到一个channel中,当任何读取channel关闭时将结束读取。</p>
|
||||||
|
|
||||||
|
<b>函数签名:</b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
func (c *Channel[T]) Or(channels ...<-chan T) <-chan T
|
||||||
|
```
|
||||||
|
|
||||||
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/Wqz9rwioPww)</span></b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
package main
|
||||||
|
|
||||||
|
import (
|
||||||
|
"context"
|
||||||
|
"fmt"
|
||||||
|
"github.com/duke-git/lancet/v2/concurrency"
|
||||||
|
)
|
||||||
|
|
||||||
|
func main() {
|
||||||
|
sig := func(after time.Duration) <-chan any {
|
||||||
|
c := make(chan any)
|
||||||
|
go func() {
|
||||||
|
defer close(c)
|
||||||
|
time.Sleep(after)
|
||||||
|
}()
|
||||||
|
return c
|
||||||
|
}
|
||||||
|
|
||||||
|
start := time.Now()
|
||||||
|
|
||||||
|
c := concurrency.NewChannel[any]()
|
||||||
|
<-c.Or(
|
||||||
|
sig(1*time.Second),
|
||||||
|
sig(2*time.Second),
|
||||||
|
sig(3*time.Second),
|
||||||
|
)
|
||||||
|
|
||||||
|
fmt.Println("done after %v", time.Since(start)) //1.003s
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
|
### <span id="OrDone">OrDone</span>
|
||||||
|
|
||||||
|
<p>将一个channel读入另一个channel,直到取消上下文。</p>
|
||||||
|
|
||||||
|
<b>函数签名:</b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
func (c *Channel[T]) OrDone(ctx context.Context, channel <-chan T) <-chan T
|
||||||
|
```
|
||||||
|
|
||||||
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/lm_GoS6aDjo)</span></b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
package main
|
||||||
|
|
||||||
|
import (
|
||||||
|
"context"
|
||||||
|
"fmt"
|
||||||
|
"github.com/duke-git/lancet/v2/concurrency"
|
||||||
|
)
|
||||||
|
|
||||||
|
func main() {
|
||||||
|
ctx, cancel := context.WithCancel(context.Background())
|
||||||
|
defer cancel()
|
||||||
|
|
||||||
|
c := concurrency.NewChannel[int]()
|
||||||
|
intStream := c.Take(ctx, c.Repeat(ctx, 1), 3)
|
||||||
|
|
||||||
|
for v := range c.OrDone(ctx, intStream) {
|
||||||
|
fmt.Println(v)
|
||||||
|
}
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// 1
|
||||||
|
// 1
|
||||||
|
// 1
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
|
### <span id="Take">Take</span>
|
||||||
|
|
||||||
|
<p>返回一个channel,其值从另一个channel获取,直到取消上下文。</p>
|
||||||
|
|
||||||
|
<b>函数签名:</b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
func (c *Channel[T]) Take(ctx context.Context, valueStream <-chan T, number int) <-chan T
|
||||||
|
```
|
||||||
|
|
||||||
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/9Utt-1pDr2J)</span></b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
package main
|
||||||
|
|
||||||
|
import (
|
||||||
|
"context"
|
||||||
|
"fmt"
|
||||||
|
"github.com/duke-git/lancet/v2/concurrency"
|
||||||
|
)
|
||||||
|
|
||||||
|
func main() {
|
||||||
|
ctx, cancel := context.WithCancel(context.Background())
|
||||||
|
defer cancel()
|
||||||
|
|
||||||
|
numbers := make(chan int, 5)
|
||||||
|
numbers <- 1
|
||||||
|
numbers <- 2
|
||||||
|
numbers <- 3
|
||||||
|
numbers <- 4
|
||||||
|
numbers <- 5
|
||||||
|
defer close(numbers)
|
||||||
|
|
||||||
|
c := concurrency.NewChannel[int]()
|
||||||
|
intStream := c.Take(ctx, numbers, 3)
|
||||||
|
|
||||||
|
for v := range intStream {
|
||||||
|
fmt.Println(v)
|
||||||
|
}
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// 1
|
||||||
|
// 2
|
||||||
|
// 3
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
|
### <span id="Tee">Tee</span>
|
||||||
|
|
||||||
|
<p>将一个channel分成两个channel,直到取消上下文。</p>
|
||||||
|
|
||||||
|
<b>函数签名:</b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
func (c *Channel[T]) Tee(ctx context.Context, in <-chan T) (<-chan T, <-chan T)
|
||||||
|
```
|
||||||
|
|
||||||
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/3TQPKnCirrP)</span></b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
package main
|
||||||
|
|
||||||
|
import (
|
||||||
|
"context"
|
||||||
|
"fmt"
|
||||||
|
"github.com/duke-git/lancet/v2/concurrency"
|
||||||
|
)
|
||||||
|
|
||||||
|
func main() {
|
||||||
|
ctx, cancel := context.WithCancel(context.Background())
|
||||||
|
defer cancel()
|
||||||
|
|
||||||
|
c := concurrency.NewChannel[int]()
|
||||||
|
intStream := c.Take(ctx, c.Repeat(ctx, 1), 2)
|
||||||
|
|
||||||
|
ch1, ch2 := c.Tee(ctx, intStream)
|
||||||
|
|
||||||
|
for v := range ch1 {
|
||||||
|
fmt.Println(v)
|
||||||
|
fmt.Println(<-ch2)
|
||||||
|
}
|
||||||
|
// Output:
|
||||||
|
// 1
|
||||||
|
// 1
|
||||||
|
// 1
|
||||||
|
// 1
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
|
### KeyedLocker
|
||||||
|
|
||||||
|
### <span id="NewKeyedLocker">NewKeyedLocker</span>
|
||||||
|
|
||||||
|
<p>NewKeyedLocker创建一个新的KeyedLocker,并为锁的过期设置指定的 TTL。KeyedLocker 是一个简单的键值锁实现,允许非阻塞的锁获取。</p>
|
||||||
|
|
||||||
|
<b>函数签名:</b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
func NewKeyedLocker[K comparable](ttl time.Duration) *KeyedLocker[K]
|
||||||
|
```
|
||||||
|
|
||||||
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/GzeyC33T5rw)</span></b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
package main
|
||||||
|
|
||||||
|
import (
|
||||||
|
"fmt"
|
||||||
|
"github.com/duke-git/lancet/v2/concurrency"
|
||||||
|
)
|
||||||
|
|
||||||
|
func main() {
|
||||||
|
locker := concurrency.NewKeyedLocker[string](2 * time.Second)
|
||||||
|
|
||||||
|
task := func() {
|
||||||
|
fmt.Println("Executing task...")
|
||||||
|
time.Sleep(1 * time.Second)
|
||||||
|
fmt.Println("Task completed.")
|
||||||
|
}
|
||||||
|
|
||||||
|
ctx, cancel := context.WithTimeout(context.Background(), 3*time.Second)
|
||||||
|
defer cancel()
|
||||||
|
|
||||||
|
if err := locker.Do(ctx, "mykey", task); err != nil {
|
||||||
|
log.Fatalf("Error executing task: %v\n", err)
|
||||||
|
} else {
|
||||||
|
fmt.Println("Task successfully executed.")
|
||||||
|
}
|
||||||
|
|
||||||
|
ctx2, cancel2 := context.WithTimeout(context.Background(), 3*time.Second)
|
||||||
|
defer cancel2()
|
||||||
|
|
||||||
|
if err := locker.Do(ctx2, "mykey", task); err != nil {
|
||||||
|
log.Fatalf("Error executing task: %v\n", err)
|
||||||
|
} else {
|
||||||
|
fmt.Println("Task successfully executed.")
|
||||||
|
}
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// Executing task...
|
||||||
|
// Task completed.
|
||||||
|
// Task successfully executed.
|
||||||
|
// Executing task...
|
||||||
|
// Task completed.
|
||||||
|
// Task successfully executed.
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
|
### <span id="Do">Do</span>
|
||||||
|
|
||||||
|
<p>为指定的键获取锁并执行提供的函数。</p>
|
||||||
|
|
||||||
|
<b>函数签名:</b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
func (l *KeyedLocker[K]) Do(ctx context.Context, key K, fn func()) error
|
||||||
|
```
|
||||||
|
|
||||||
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/GzeyC33T5rw)</span></b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
package main
|
||||||
|
|
||||||
|
import (
|
||||||
|
"fmt"
|
||||||
|
"github.com/duke-git/lancet/v2/concurrency"
|
||||||
|
)
|
||||||
|
|
||||||
|
func main() {
|
||||||
|
locker := concurrency.NewKeyedLocker[string](2 * time.Second)
|
||||||
|
|
||||||
|
task := func() {
|
||||||
|
fmt.Println("Executing task...")
|
||||||
|
time.Sleep(1 * time.Second)
|
||||||
|
fmt.Println("Task completed.")
|
||||||
|
}
|
||||||
|
|
||||||
|
ctx, cancel := context.WithTimeout(context.Background(), 3*time.Second)
|
||||||
|
defer cancel()
|
||||||
|
|
||||||
|
if err := locker.Do(ctx, "mykey", task); err != nil {
|
||||||
|
log.Fatalf("Error executing task: %v\n", err)
|
||||||
|
} else {
|
||||||
|
fmt.Println("Task successfully executed.")
|
||||||
|
}
|
||||||
|
|
||||||
|
ctx2, cancel2 := context.WithTimeout(context.Background(), 3*time.Second)
|
||||||
|
defer cancel2()
|
||||||
|
|
||||||
|
if err := locker.Do(ctx2, "mykey", task); err != nil {
|
||||||
|
log.Fatalf("Error executing task: %v\n", err)
|
||||||
|
} else {
|
||||||
|
fmt.Println("Task successfully executed.")
|
||||||
|
}
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// Executing task...
|
||||||
|
// Task completed.
|
||||||
|
// Task successfully executed.
|
||||||
|
// Executing task...
|
||||||
|
// Task completed.
|
||||||
|
// Task successfully executed.
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
|
### <span id="NewRWKeyedLocker">NewRWKeyedLocker</span>
|
||||||
|
|
||||||
|
<p>NewRWKeyedLocker创建一个新的RWKeyedLocker,并为锁的过期设置指定的 TTL。RWKeyedLocker 是一个简单的键值读写锁实现,允许非阻塞的锁获取。</p>
|
||||||
|
|
||||||
|
<b>函数签名:</b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
func NewRWKeyedLocker[K comparable](ttl time.Duration) *RWKeyedLocker[K]
|
||||||
|
```
|
||||||
|
|
||||||
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/CkaJWWwZm9)</span></b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
package main
|
||||||
|
|
||||||
|
import (
|
||||||
|
"fmt"
|
||||||
|
"github.com/duke-git/lancet/v2/concurrency"
|
||||||
|
)
|
||||||
|
|
||||||
|
func main() {
|
||||||
|
locker := concurrency.NewRWKeyedLocker[string](2 * time.Second)
|
||||||
|
|
||||||
|
// Simulate a key
|
||||||
|
key := "resource_key"
|
||||||
|
|
||||||
|
fn := func() {
|
||||||
|
fmt.Println("Starting write operation...")
|
||||||
|
// Simulate write operation, assuming it takes 2 seconds
|
||||||
|
time.Sleep(200 * time.Millisecond)
|
||||||
|
fmt.Println("Write operation completed!")
|
||||||
|
}
|
||||||
|
|
||||||
|
// Acquire the write lock and execute the operation
|
||||||
|
ctx, cancel := context.WithTimeout(context.Background(), 1*time.Second)
|
||||||
|
defer cancel()
|
||||||
|
|
||||||
|
// Execute the lock operation with a 3-second timeout
|
||||||
|
err := locker.Lock(ctx, key, fn)
|
||||||
|
if err != nil {
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
//output:
|
||||||
|
//Starting write operation...
|
||||||
|
//Write operation completed!
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
|
### <span id="RLock">RLock</span>
|
||||||
|
|
||||||
|
<p>RLock为指定的键获取读锁并执行提供的函数。</p>
|
||||||
|
|
||||||
|
<b>函数签名:</b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
func (l *RWKeyedLocker[K]) RLock(ctx context.Context, key K, fn func()) error
|
||||||
|
```
|
||||||
|
|
||||||
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/ZrCr8sMo77T)</span></b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
package main
|
||||||
|
|
||||||
|
import (
|
||||||
|
"fmt"
|
||||||
|
"github.com/duke-git/lancet/v2/concurrency"
|
||||||
|
)
|
||||||
|
|
||||||
|
func main() {
|
||||||
|
locker := concurrency.NewRWKeyedLocker[string](2 * time.Second)
|
||||||
|
|
||||||
|
// Simulate a key
|
||||||
|
key := "resource_key"
|
||||||
|
|
||||||
|
fn := func() {
|
||||||
|
fmt.Println("Starting write operation...")
|
||||||
|
// Simulate write operation, assuming it takes 2 seconds
|
||||||
|
time.Sleep(200 * time.Millisecond)
|
||||||
|
fmt.Println("Write operation completed!")
|
||||||
|
}
|
||||||
|
|
||||||
|
// Acquire the write lock and execute the operation
|
||||||
|
ctx, cancel := context.WithTimeout(context.Background(), 1*time.Second)
|
||||||
|
defer cancel()
|
||||||
|
|
||||||
|
// Execute the lock operation with a 3-second timeout
|
||||||
|
err := locker.RLock(ctx, key, fn)
|
||||||
|
if err != nil {
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
//output:
|
||||||
|
//Starting write operation...
|
||||||
|
//Write operation completed!
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
|
### <span id="Lock">Lock</span>
|
||||||
|
|
||||||
|
<p>Lock为指定的键获取锁并执行提供的函数。</p>
|
||||||
|
|
||||||
|
<b>函数签名:</b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
func (l *RWKeyedLocker[K]) Lock(ctx context.Context, key K, fn func()) error
|
||||||
|
```
|
||||||
|
|
||||||
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/WgAcXbOPKGk)</span></b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
package main
|
||||||
|
|
||||||
|
import (
|
||||||
|
"fmt"
|
||||||
|
"github.com/duke-git/lancet/v2/concurrency"
|
||||||
|
)
|
||||||
|
|
||||||
|
func main() {
|
||||||
|
locker := NewRWKeyedLocker[string](2 * time.Second)
|
||||||
|
|
||||||
|
// Simulate a key
|
||||||
|
key := "resource_key"
|
||||||
|
|
||||||
|
fn := func() {
|
||||||
|
fmt.Println("Starting write operation...")
|
||||||
|
// Simulate write operation, assuming it takes 2 seconds
|
||||||
|
time.Sleep(200 * time.Millisecond)
|
||||||
|
fmt.Println("Write operation completed!")
|
||||||
|
}
|
||||||
|
|
||||||
|
// Acquire the write lock and execute the operation
|
||||||
|
ctx, cancel := context.WithTimeout(context.Background(), 1*time.Second)
|
||||||
|
defer cancel()
|
||||||
|
|
||||||
|
// Execute the lock operation with a 3-second timeout
|
||||||
|
err := locker.Lock(ctx, key, fn)
|
||||||
|
if err != nil {
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
//output:
|
||||||
|
//Starting write operation...
|
||||||
|
//Write operation completed!
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
|
### <span id="NewTryKeyedLocker">NewTryKeyedLocker</span>
|
||||||
|
|
||||||
|
<p>创建一个TryKeyedLocker实例,TryKeyedLocker是KeyedLocker的非阻塞版本。</p>
|
||||||
|
|
||||||
|
<b>函数签名:</b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
func NewTryKeyedLocker[K comparable]() *TryKeyedLocker[K]
|
||||||
|
```
|
||||||
|
|
||||||
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/VG9qLvyetE2)</span></b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
package main
|
||||||
|
|
||||||
|
import (
|
||||||
|
"fmt"
|
||||||
|
"github.com/duke-git/lancet/v2/concurrency"
|
||||||
|
)
|
||||||
|
|
||||||
|
func main() {
|
||||||
|
locker := concurrency.NewTryKeyedLocker[string]()
|
||||||
|
|
||||||
|
key := "resource_key"
|
||||||
|
|
||||||
|
if locker.TryLock(key) {
|
||||||
|
fmt.Println("Lock acquired")
|
||||||
|
time.Sleep(1 * time.Second)
|
||||||
|
// Unlock after work is done
|
||||||
|
locker.Unlock(key)
|
||||||
|
fmt.Println("Lock released")
|
||||||
|
} else {
|
||||||
|
fmt.Println("Lock failed")
|
||||||
|
}
|
||||||
|
|
||||||
|
//output:
|
||||||
|
//Lock acquired
|
||||||
|
//Lock released
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
|
### <span id="TryLock">TryLock</span>
|
||||||
|
|
||||||
|
<p>TryLock尝试获取指定键的锁。如果锁成功获取,则返回true,否则返回false。</p>
|
||||||
|
|
||||||
|
<b>函数签名:</b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
func (l *TryKeyedLocker[K]) TryLock(key K) bool
|
||||||
|
```
|
||||||
|
|
||||||
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/VG9qLvyetE2)</span></b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
package main
|
||||||
|
|
||||||
|
import (
|
||||||
|
"fmt"
|
||||||
|
"github.com/duke-git/lancet/v2/concurrency"
|
||||||
|
)
|
||||||
|
|
||||||
|
func main() {
|
||||||
|
locker := concurrency.NewTryKeyedLocker[string]()
|
||||||
|
|
||||||
|
key := "resource_key"
|
||||||
|
|
||||||
|
if locker.TryLock(key) {
|
||||||
|
fmt.Println("Lock acquired")
|
||||||
|
time.Sleep(1 * time.Second)
|
||||||
|
// Unlock after work is done
|
||||||
|
locker.Unlock(key)
|
||||||
|
fmt.Println("Lock released")
|
||||||
|
} else {
|
||||||
|
fmt.Println("Lock failed")
|
||||||
|
}
|
||||||
|
|
||||||
|
//output:
|
||||||
|
//Lock acquired
|
||||||
|
//Lock released
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
|
### <span id="Unlock">Unlock</span>
|
||||||
|
|
||||||
|
<p>释放指定键的锁。</p>
|
||||||
|
|
||||||
|
<b>函数签名:</b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
func (l *TryKeyedLocker[K]) Unlock(key K)
|
||||||
|
```
|
||||||
|
|
||||||
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/VG9qLvyetE2)</span></b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
package main
|
||||||
|
|
||||||
|
import (
|
||||||
|
"fmt"
|
||||||
|
"github.com/duke-git/lancet/v2/concurrency"
|
||||||
|
)
|
||||||
|
|
||||||
|
func main() {
|
||||||
|
locker := concurrency.NewTryKeyedLocker[string]()
|
||||||
|
|
||||||
|
key := "resource_key"
|
||||||
|
|
||||||
|
if locker.TryLock(key) {
|
||||||
|
fmt.Println("Lock acquired")
|
||||||
|
time.Sleep(1 * time.Second)
|
||||||
|
// Unlock after work is done
|
||||||
|
locker.Unlock(key)
|
||||||
|
fmt.Println("Lock released")
|
||||||
|
} else {
|
||||||
|
fmt.Println("Lock failed")
|
||||||
|
}
|
||||||
|
|
||||||
|
//output:
|
||||||
|
//Lock acquired
|
||||||
|
//Lock released
|
||||||
|
}
|
||||||
|
```
|
||||||
@@ -18,7 +18,7 @@ import (
|
|||||||
|
|
||||||
<div STYLE="page-break-after: always;"></div>
|
<div STYLE="page-break-after: always;"></div>
|
||||||
|
|
||||||
## Index
|
## 目录
|
||||||
|
|
||||||
- [Bool](#Bool)
|
- [Bool](#Bool)
|
||||||
- [And](#And)
|
- [And](#And)
|
||||||
@@ -27,11 +27,12 @@ import (
|
|||||||
- [Nor](#Nor)
|
- [Nor](#Nor)
|
||||||
- [Xnor](#Xnor)
|
- [Xnor](#Xnor)
|
||||||
- [Nand](#Nand)
|
- [Nand](#Nand)
|
||||||
- [TernaryOperator](#TernaryOperator)
|
- [Ternary](#Ternary)
|
||||||
|
- [TernaryOperator<sup>deprecated</sup>](#TernaryOperator)
|
||||||
|
|
||||||
<div STYLE="page-break-after: always;"></div>
|
<div STYLE="page-break-after: always;"></div>
|
||||||
|
|
||||||
## 目录
|
## 文档
|
||||||
|
|
||||||
### <span id="Bool">Bool</span>
|
### <span id="Bool">Bool</span>
|
||||||
<p>返回传入参数的bool值.<br/>
|
<p>返回传入参数的bool值.<br/>
|
||||||
@@ -45,7 +46,7 @@ slices和map的length大于0时,返回true,否则返回false<br/>
|
|||||||
```go
|
```go
|
||||||
func Bool[T any](value T) bool
|
func Bool[T any](value T) bool
|
||||||
```
|
```
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/ETzeDJRSvhm)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -109,7 +110,7 @@ func main() {
|
|||||||
```go
|
```go
|
||||||
func And[T, U any](a T, b U) bool
|
func And[T, U any](a T, b U) bool
|
||||||
```
|
```
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/W1SSUmt6pvr)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -135,7 +136,7 @@ func main() {
|
|||||||
```go
|
```go
|
||||||
func Or[T, U any](a T, b U) bool
|
func Or[T, U any](a T, b U) bool
|
||||||
```
|
```
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/UlQTxHaeEkq)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -161,7 +162,7 @@ func main() {
|
|||||||
```go
|
```go
|
||||||
func Xor[T, U any](a T, b U) bool
|
func Xor[T, U any](a T, b U) bool
|
||||||
```
|
```
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/gObZrW7ZbG8)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -187,7 +188,7 @@ func main() {
|
|||||||
```go
|
```go
|
||||||
func Nor[T, U any](a T, b U) bool
|
func Nor[T, U any](a T, b U) bool
|
||||||
```
|
```
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/g2j08F_zZky)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -213,7 +214,7 @@ func main() {
|
|||||||
```go
|
```go
|
||||||
func Xnor[T, U any](a T, b U) bool
|
func Xnor[T, U any](a T, b U) bool
|
||||||
```
|
```
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/OuDB9g51643)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -239,7 +240,7 @@ func main() {
|
|||||||
```go
|
```go
|
||||||
func Nand[T, U any](a T, b U) bool
|
func Nand[T, U any](a T, b U) bool
|
||||||
```
|
```
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/vSRMLxLIbq8)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -257,15 +258,51 @@ func main() {
|
|||||||
}
|
}
|
||||||
```
|
```
|
||||||
|
|
||||||
|
### <span id="Ternary">Ternary</span>
|
||||||
|
<p>三元运算符。</p>
|
||||||
|
|
||||||
|
<b>函数签名:</b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
func Ternary[T, U any](isTrue T, ifValue U, elseValue U) U
|
||||||
|
```
|
||||||
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/ElllPZY0guT)</span></b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
package main
|
||||||
|
|
||||||
|
import (
|
||||||
|
"fmt"
|
||||||
|
"github.com/duke-git/lancet/v2/condition"
|
||||||
|
)
|
||||||
|
|
||||||
|
func main() {
|
||||||
|
conditionTrue := 2 > 1
|
||||||
|
result1 := condition.Ternary(conditionTrue, 0, 1)
|
||||||
|
|
||||||
|
conditionFalse := 2 > 3
|
||||||
|
result2 := condition.Ternary(conditionFalse, 0, 1)
|
||||||
|
|
||||||
|
fmt.Println(result1)
|
||||||
|
fmt.Println(result2)
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// 0
|
||||||
|
// 1
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
### <span id="TernaryOperator">TernaryOperator</span>
|
### <span id="TernaryOperator">TernaryOperator</span>
|
||||||
<p>三元运算符</p>
|
<p>三元运算符</p>
|
||||||
|
|
||||||
|
> ⚠️ 本函数已弃用,使用`Ternary`代替。
|
||||||
|
|
||||||
<b>函数签名:</b>
|
<b>函数签名:</b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
func TernaryOperator[T, U any](isTrue T, ifValue U, elseValue U) U
|
func TernaryOperator[T, U any](isTrue T, ifValue U, elseValue U) U
|
||||||
```
|
```
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/ElllPZY0guT)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -33,6 +33,9 @@ import (
|
|||||||
- [ToJson](#ToJson)
|
- [ToJson](#ToJson)
|
||||||
- [ToMap](#ToMap)
|
- [ToMap](#ToMap)
|
||||||
- [ToPointer](#ToPointer)
|
- [ToPointer](#ToPointer)
|
||||||
|
- [ToPointers](#ToPointers)
|
||||||
|
- [FromPointer](#FromPointer)
|
||||||
|
- [FromPointers](#FromPointers)
|
||||||
- [ToString](#ToString)
|
- [ToString](#ToString)
|
||||||
- [StructToMap](#StructToMap)
|
- [StructToMap](#StructToMap)
|
||||||
- [MapToSlice](#MapToSlice)
|
- [MapToSlice](#MapToSlice)
|
||||||
@@ -43,6 +46,11 @@ import (
|
|||||||
- [ToInterface](#ToInterface)
|
- [ToInterface](#ToInterface)
|
||||||
- [Utf8ToGbk](#Utf8ToGbk)
|
- [Utf8ToGbk](#Utf8ToGbk)
|
||||||
- [GbkToUtf8](#GbkToUtf8)
|
- [GbkToUtf8](#GbkToUtf8)
|
||||||
|
- [ToStdBase64](#ToStdBase64)
|
||||||
|
- [ToUrlBase64](#ToUrlBase64)
|
||||||
|
- [ToRawStdBase64](#ToRawStdBase64)
|
||||||
|
- [ToRawUrlBase64](#ToRawUrlBase64)
|
||||||
|
- [ToBigInt](#ToBigInt)
|
||||||
|
|
||||||
<div STYLE="page-break-after: always;"></div>
|
<div STYLE="page-break-after: always;"></div>
|
||||||
|
|
||||||
@@ -58,7 +66,7 @@ import (
|
|||||||
func ColorHexToRGB(colorHex string) (red, green, blue int)
|
func ColorHexToRGB(colorHex string) (red, green, blue int)
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/o7_ft-JCJBV)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -89,7 +97,7 @@ func main() {
|
|||||||
func ColorRGBToHex(red, green, blue int) string
|
func ColorRGBToHex(red, green, blue int) string
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/nzKS2Ro87J1)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -122,7 +130,7 @@ func main() {
|
|||||||
func ToBool(s string) (bool, error)
|
func ToBool(s string) (bool, error)
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/ARht2WnGdIN)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -163,7 +171,7 @@ func main() {
|
|||||||
func ToBytes(data any) ([]byte, error)
|
func ToBytes(data any) ([]byte, error)
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/fAMXYFDvOvr)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -196,7 +204,7 @@ func main() {
|
|||||||
func ToChar(s string) []string
|
func ToChar(s string) []string
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/JJ1SvbFkVdM)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -232,7 +240,7 @@ func main() {
|
|||||||
func ToChannel[T any](array []T) <-chan T
|
func ToChannel[T any](array []T) <-chan T
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/hOx_oYZbAnL)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -269,7 +277,7 @@ func main() {
|
|||||||
func ToFloat(value any) (float64, error)
|
func ToFloat(value any) (float64, error)
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/4YTmPCibqHJ)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -314,7 +322,7 @@ func main() {
|
|||||||
func ToInt(value any) (int64, error)
|
func ToInt(value any) (int64, error)
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/9_h9vIt-QZ_b)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -356,7 +364,7 @@ func main() {
|
|||||||
func ToJson(value any) (string, error)
|
func ToJson(value any) (string, error)
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/2rLIkMmXWvR)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -368,7 +376,7 @@ import (
|
|||||||
|
|
||||||
func main() {
|
func main() {
|
||||||
aMap := map[string]int{"a": 1, "b": 2, "c": 3}
|
aMap := map[string]int{"a": 1, "b": 2, "c": 3}
|
||||||
result, err := ToJson(aMap)
|
result, err := convertor.ToJson(aMap)
|
||||||
|
|
||||||
if err != nil {
|
if err != nil {
|
||||||
fmt.Printf("%v", err)
|
fmt.Printf("%v", err)
|
||||||
@@ -391,7 +399,7 @@ func main() {
|
|||||||
func ToMap[T any, K comparable, V any](array []T, iteratee func(T) (K, V)) map[K]V
|
func ToMap[T any, K comparable, V any](array []T, iteratee func(T) (K, V)) map[K]V
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/tVFy7E-t24l)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -432,7 +440,7 @@ func main() {
|
|||||||
func ToPointer[T any](value T) *T
|
func ToPointer[T any](value T) *T
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/ASf_etHNlw1)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -451,6 +459,108 @@ func main() {
|
|||||||
}
|
}
|
||||||
```
|
```
|
||||||
|
|
||||||
|
### <span id="ToPointers">ToPointers</span>
|
||||||
|
|
||||||
|
<p>将值的切片转换为指针的切片。</p>
|
||||||
|
|
||||||
|
<b>函数签名:</b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
func ToPointers[T any](values []T) []*T
|
||||||
|
```
|
||||||
|
|
||||||
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/ZUoXd2i5ZkV)</span></b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
package main
|
||||||
|
|
||||||
|
import (
|
||||||
|
"fmt"
|
||||||
|
"github.com/duke-git/lancet/v2/convertor"
|
||||||
|
)
|
||||||
|
|
||||||
|
func main() {
|
||||||
|
strs := []string{"a", "b", "c"}
|
||||||
|
pointerStrs := convertor.ToPointers(strs)
|
||||||
|
fmt.Println(*pointerStrs[0])
|
||||||
|
fmt.Println(*pointerStrs[1])
|
||||||
|
fmt.Println(*pointerStrs[2])
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// a
|
||||||
|
// b
|
||||||
|
// c
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
|
### <span id="FromPointer">FromPointer</span>
|
||||||
|
|
||||||
|
<p>返回指针所指向的值。</p>
|
||||||
|
|
||||||
|
<b>函数签名:</b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
func FromPointer[T any](ptr *T) T
|
||||||
|
```
|
||||||
|
|
||||||
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/wAp90V7Zu6g)</span></b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
package main
|
||||||
|
|
||||||
|
import (
|
||||||
|
"fmt"
|
||||||
|
"github.com/duke-git/lancet/v2/convertor"
|
||||||
|
)
|
||||||
|
|
||||||
|
func main() {
|
||||||
|
str := "abc"
|
||||||
|
strPtr := &str
|
||||||
|
result := convertor.FromPointer(strPtr)
|
||||||
|
fmt.Println(result)
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// abc
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
|
### <span id="FromPointers">FromPointers</span>
|
||||||
|
|
||||||
|
<p>将指针的切片转换为值的切片。</p>
|
||||||
|
|
||||||
|
<b>函数签名:</b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
func FromPointers[T any](pointers []*T) []T
|
||||||
|
```
|
||||||
|
|
||||||
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/qIPsyYtNy3Q)</span></b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
package main
|
||||||
|
|
||||||
|
import (
|
||||||
|
"fmt"
|
||||||
|
"github.com/duke-git/lancet/v2/convertor"
|
||||||
|
)
|
||||||
|
|
||||||
|
func main() {
|
||||||
|
strs := []string{"a", "b", "c"}
|
||||||
|
strPtr := []*string{&strs[0], &strs[1], &strs[2]}
|
||||||
|
|
||||||
|
result := convertor.FromPointers(strPtr)
|
||||||
|
|
||||||
|
fmt.Println(result[0])
|
||||||
|
fmt.Println(result[1])
|
||||||
|
fmt.Println(result[2])
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// a
|
||||||
|
// b
|
||||||
|
// c
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
### <span id="ToString">ToString</span>
|
### <span id="ToString">ToString</span>
|
||||||
|
|
||||||
<p>将值转换为字符串,对于数字、字符串、[]byte,将转换为字符串。 对于其他类型(切片、映射、数组、结构体)将调用 json.Marshal</p>
|
<p>将值转换为字符串,对于数字、字符串、[]byte,将转换为字符串。 对于其他类型(切片、映射、数组、结构体)将调用 json.Marshal</p>
|
||||||
@@ -461,7 +571,7 @@ func main() {
|
|||||||
func ToString(value any) string
|
func ToString(value any) string
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/nF1zOOslpQq)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -509,7 +619,7 @@ func main() {
|
|||||||
func StructToMap(value any) (map[string]any, error)
|
func StructToMap(value any) (map[string]any, error)
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/KYGYJqNUBOI)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -547,7 +657,7 @@ func main() {
|
|||||||
func MapToSlice[T any, K comparable, V any](aMap map[K]V, iteratee func(K, V) T) []T
|
func MapToSlice[T any, K comparable, V any](aMap map[K]V, iteratee func(K, V) T) []T
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/dmX4Ix5V6Wl)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -577,7 +687,7 @@ func main() {
|
|||||||
func EncodeByte(data any) ([]byte, error)
|
func EncodeByte(data any) ([]byte, error)
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/DVmM1G5JfuP)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -606,7 +716,7 @@ func main() {
|
|||||||
func DecodeByte(data []byte, target any) error
|
func DecodeByte(data []byte, target any) error
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/zI6xsmuQRbn)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -642,7 +752,7 @@ func main() {
|
|||||||
func DeepClone[T any](src T) T
|
func DeepClone[T any](src T) T
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/j4DP5dquxnk)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -706,7 +816,7 @@ func main() {
|
|||||||
func CopyProperties[T, U any](dst T, src U) (err error)
|
func CopyProperties[T, U any](dst T, src U) (err error)
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/oZujoB5Sgg5)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -785,7 +895,7 @@ func main() {
|
|||||||
func ToInterface(v reflect.Value) (value interface{}, ok bool)
|
func ToInterface(v reflect.Value) (value interface{}, ok bool)
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/syqw0-WG7Xd)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -820,7 +930,7 @@ func main() {
|
|||||||
func Utf8ToGbk(bs []byte) ([]byte, error)
|
func Utf8ToGbk(bs []byte) ([]byte, error)
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/9FlIaFLArIL)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -854,7 +964,7 @@ func main() {
|
|||||||
func GbkToUtf8(bs []byte) ([]byte, error)
|
func GbkToUtf8(bs []byte) ([]byte, error)
|
||||||
```
|
```
|
||||||
|
|
||||||
<b>示例:</b>
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/OphmHCN_9u8)</span></b>
|
||||||
|
|
||||||
```go
|
```go
|
||||||
package main
|
package main
|
||||||
@@ -876,3 +986,302 @@ func main() {
|
|||||||
// hello
|
// hello
|
||||||
}
|
}
|
||||||
```
|
```
|
||||||
|
|
||||||
|
### <span id="ToStdBase64">ToStdBase64</span>
|
||||||
|
|
||||||
|
<p>将值转换为StdBase64编码的字符串。error类型的数据也会把error的原因进行编码,复杂的结构会转为JSON格式的字符串</p>
|
||||||
|
|
||||||
|
<b>函数签名:</b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
func ToStdBase64(value any) string
|
||||||
|
```
|
||||||
|
|
||||||
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/_fLJqJD3NMo)</span></b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
package main
|
||||||
|
|
||||||
|
import (
|
||||||
|
"fmt"
|
||||||
|
"github.com/duke-git/lancet/v2/convertor"
|
||||||
|
)
|
||||||
|
|
||||||
|
func main() {
|
||||||
|
afterEncode := convertor.ToStdBase64(nil)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
afterEncode = convertor.ToStdBase64("")
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
stringVal := "hello"
|
||||||
|
afterEncode = convertor.ToStdBase64(stringVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
byteSliceVal := []byte("hello")
|
||||||
|
afterEncode = convertor.ToStdBase64(byteSliceVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
intVal := 123
|
||||||
|
afterEncode = convertor.ToStdBase64(intVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
mapVal := map[string]any{"a": "hi", "b": 2, "c": struct {
|
||||||
|
A string
|
||||||
|
B int
|
||||||
|
}{"hello", 3}}
|
||||||
|
afterEncode = convertor.ToStdBase64(mapVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
floatVal := 123.456
|
||||||
|
afterEncode = convertor.ToStdBase64(floatVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
boolVal := true
|
||||||
|
afterEncode = convertor.ToStdBase64(boolVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
errVal := errors.New("err")
|
||||||
|
afterEncode = convertor.ToStdBase64(errVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
//
|
||||||
|
//
|
||||||
|
// aGVsbG8=
|
||||||
|
// aGVsbG8=
|
||||||
|
// MTIz
|
||||||
|
// eyJhIjoiaGkiLCJiIjoyLCJjIjp7IkEiOiJoZWxsbyIsIkIiOjN9fQ==
|
||||||
|
// MTIzLjQ1Ng==
|
||||||
|
// dHJ1ZQ==
|
||||||
|
// ZXJy
|
||||||
|
}
|
||||||
|
|
||||||
|
```
|
||||||
|
|
||||||
|
### <span id="ToUrlBase64">ToUrlBase64</span>
|
||||||
|
|
||||||
|
<p>值转换为 ToUrlBase64 编码的字符串。error 类型的数据也会把 error 的原因进行编码,复杂的结构会转为 JSON 格式的字符串</p>
|
||||||
|
|
||||||
|
<b>函数签名:</b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
func ToUrlBase64(value any) string
|
||||||
|
```
|
||||||
|
|
||||||
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/C_d0GlvEeUR)</span></b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
package main
|
||||||
|
|
||||||
|
import (
|
||||||
|
"fmt"
|
||||||
|
"github.com/duke-git/lancet/v2/convertor"
|
||||||
|
)
|
||||||
|
|
||||||
|
func main() {
|
||||||
|
afterEncode := convertor.ToUrlBase64(nil)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
|
||||||
|
stringVal := "hello"
|
||||||
|
afterEncode = convertor.ToUrlBase64(stringVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
byteSliceVal := []byte("hello")
|
||||||
|
afterEncode = convertor.ToUrlBase64(byteSliceVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
intVal := 123
|
||||||
|
afterEncode = convertor.ToUrlBase64(intVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
mapVal := map[string]any{"a": "hi", "b": 2, "c": struct {
|
||||||
|
A string
|
||||||
|
B int
|
||||||
|
}{"hello", 3}}
|
||||||
|
afterEncode = convertor.ToUrlBase64(mapVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
floatVal := 123.456
|
||||||
|
afterEncode = convertor.ToUrlBase64(floatVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
boolVal := true
|
||||||
|
afterEncode = convertor.ToUrlBase64(boolVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
errVal := errors.New("err")
|
||||||
|
afterEncode = convertor.ToUrlBase64(errVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
//
|
||||||
|
// aGVsbG8=
|
||||||
|
// aGVsbG8=
|
||||||
|
// MTIz
|
||||||
|
// eyJhIjoiaGkiLCJiIjoyLCJjIjp7IkEiOiJoZWxsbyIsIkIiOjN9fQ==
|
||||||
|
// MTIzLjQ1Ng==
|
||||||
|
// dHJ1ZQ==
|
||||||
|
// ZXJy
|
||||||
|
}
|
||||||
|
|
||||||
|
```
|
||||||
|
|
||||||
|
### <span id="ToRawStdBase64">ToRawStdBase64</span>
|
||||||
|
|
||||||
|
<p>值转换为 ToRawStdBase64 编码的字符串。error 类型的数据也会把 error 的原因进行编码,复杂的结构会转为 JSON 格式的字符串</p>
|
||||||
|
|
||||||
|
<b>函数签名:</b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
func ToRawStdBase64(value any) string
|
||||||
|
```
|
||||||
|
|
||||||
|
<b>示例:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/wSAr3sfkDcv)</span></b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
package main
|
||||||
|
|
||||||
|
import (
|
||||||
|
"fmt"
|
||||||
|
"github.com/duke-git/lancet/v2/convertor"
|
||||||
|
)
|
||||||
|
|
||||||
|
func main() {
|
||||||
|
|
||||||
|
stringVal := "hello"
|
||||||
|
afterEncode = convertor.ToRawStdBase64(stringVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
byteSliceVal := []byte("hello")
|
||||||
|
afterEncode = convertor.ToRawStdBase64(byteSliceVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
intVal := 123
|
||||||
|
afterEncode = convertor.ToRawStdBase64(intVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
mapVal := map[string]any{"a": "hi", "b": 2, "c": struct {
|
||||||
|
A string
|
||||||
|
B int
|
||||||
|
}{"hello", 3}}
|
||||||
|
afterEncode = convertor.ToRawStdBase64(mapVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
floatVal := 123.456
|
||||||
|
afterEncode := convertor.ToRawStdBase64(floatVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
boolVal := true
|
||||||
|
afterEncode = convertor.ToRawStdBase64(boolVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
errVal := errors.New("err")
|
||||||
|
afterEncode = convertor.ToRawStdBase64(errVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// aGVsbG8
|
||||||
|
// aGVsbG8
|
||||||
|
// MTIz
|
||||||
|
// eyJhIjoiaGkiLCJiIjoyLCJjIjp7IkEiOiJoZWxsbyIsIkIiOjN9fQ
|
||||||
|
// MTIzLjQ1Ng
|
||||||
|
// dHJ1ZQ
|
||||||
|
// ZXJy
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
|
### <span id="ToRawUrlBase64">ToRawUrlBase64</span>
|
||||||
|
|
||||||
|
<p>值转换为 ToRawUrlBase64 编码的字符串。error 类型的数据也会把 error 的原因进行编码,复杂的结构会转为 JSON 格式的字符串</p>
|
||||||
|
|
||||||
|
<b>函数签名:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/HwdDPFcza1O)</span></b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
func ToRawUrlBase64(value any) string
|
||||||
|
```
|
||||||
|
|
||||||
|
<b>示例:</b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
package main
|
||||||
|
|
||||||
|
import (
|
||||||
|
"fmt"
|
||||||
|
"github.com/duke-git/lancet/v2/convertor"
|
||||||
|
)
|
||||||
|
|
||||||
|
func main() {
|
||||||
|
|
||||||
|
stringVal := "hello"
|
||||||
|
afterEncode := convertor.ToRawUrlBase64(stringVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
byteSliceVal := []byte("hello")
|
||||||
|
afterEncode = convertor.ToRawUrlBase64(byteSliceVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
intVal := 123
|
||||||
|
afterEncode = convertor.ToRawUrlBase64(intVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
mapVal := map[string]any{"a": "hi", "b": 2, "c": struct {
|
||||||
|
A string
|
||||||
|
B int
|
||||||
|
}{"hello", 3}}
|
||||||
|
afterEncode = convertor.ToRawUrlBase64(mapVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
floatVal := 123.456
|
||||||
|
afterEncode = convertor.ToRawUrlBase64(floatVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
boolVal := true
|
||||||
|
afterEncode = convertor.ToRawUrlBase64(boolVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
errVal := errors.New("err")
|
||||||
|
afterEncode = convertor.ToRawUrlBase64(errVal)
|
||||||
|
fmt.Println(afterEncode)
|
||||||
|
|
||||||
|
// Output:
|
||||||
|
// aGVsbG8
|
||||||
|
// aGVsbG8
|
||||||
|
// MTIz
|
||||||
|
// eyJhIjoiaGkiLCJiIjoyLCJjIjp7IkEiOiJoZWxsbyIsIkIiOjN9fQ
|
||||||
|
// MTIzLjQ1Ng
|
||||||
|
// dHJ1ZQ
|
||||||
|
// ZXJy
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
|
### <span id="ToBigInt">ToBigInt</span>
|
||||||
|
|
||||||
|
<p>将整数值转换为bigInt。</p>
|
||||||
|
|
||||||
|
<b>函数签名:<span style="float:right;display:inline-block;">[运行](https://go.dev/play/p/X3itkCxwB_x)</span></b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
func ToBigInt[T any](v T) (*big.Int, error)
|
||||||
|
```
|
||||||
|
|
||||||
|
<b>示例:</b>
|
||||||
|
|
||||||
|
```go
|
||||||
|
package main
|
||||||
|
|
||||||
|
import (
|
||||||
|
"fmt"
|
||||||
|
"github.com/duke-git/lancet/v2/convertor"
|
||||||
|
)
|
||||||
|
|
||||||
|
func main() {
|
||||||
|
n := 9876543210
|
||||||
|
bigInt, _ := convertor.ToBigInt(n)
|
||||||
|
|
||||||
|
fmt.Println(bigInt)
|
||||||
|
// Output:
|
||||||
|
// 9876543210
|
||||||
|
}
|
||||||
|
```
|
||||||
File diff suppressed because it is too large.
Load diff
Loaded 100 of 311 files, more files were not shown because too many files have changed in this diff.
Show more
Reference in new issue
Block a user