-
-
Notifications
You must be signed in to change notification settings - Fork 84
/
report.yaml
1047 lines (1046 loc) · 101 KB
/
report.yaml
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
---
Repository: TheAlgorithms/Python
Url: https://github.com/TheAlgorithms/Python.git
Args: ["**/*.{md,py}"]
Summary:
files: 1026
filesWithIssues: 419
issues: 3033
errors: 0
Errors: []
issues:
- "arithmetic_analysis/gaussian_elimination.py:10:64 ndarray U np.matrix, vector: np.ndarray) -> np.ndarray:"
- "arithmetic_analysis/gaussian_elimination.py:30:29 dtype U np.zeros((rows, 1), dtype=float)"
- "arithmetic_analysis/gaussian_elimination.py:64:35 astype U mat = augmented_mat.astype(\"float64\")"
- "arithmetic_analysis/newton_forward_interpolation.py:8:5 ucal U def ucal(u: float, p: int) -"
- "arithmetic_analysis/newton_forward_interpolation.py:49:5 summ U summ = y[0][0]"
- "arithmetic_analysis/newton_raphson.py:1:23 Raphson U Implementing Newton Raphson method in Python"
- "arithmetic_analysis/newton_raphson.py:2:11 Syed U # Author: Syed Haseeb Shah (github"
- "arithmetic_analysis/newton_raphson.py:2:16 Haseeb U # Author: Syed Haseeb Shah (github.com/QuantumNovic"
- "arithmetic_analysis/newton_raphson.py:10:6 sympy U from sympy import diff"
- "arithmetic_analysis/newton_raphson.py:13:12 raphson U def newton_raphson("
- "arithmetic_analysis/secant_method.py:3:9 dimgrichr U Author: dimgrichr"
- "audio_filters/butterworth_filter.py:9:27 scipy U Alternatively you can use scipy.signal.butter, which"
- "audio_filters/butterworth_filter.py:20:18 coeffs U >>> filter.a_coeffs + filter.b_coeffs"
- "audio_filters/butterworth_filter.py:36:5 filt U filt = IIRFilter(2)"
- "audio_filters/butterworth_filter.py:169:5 ppmc U ppmc = (big_a + 1) + (big"
- "audio_filters/butterworth_filter.py:171:5 pmpc U pmpc = (big_a - 1) + (big"
- "audio_filters/iir_filter.py:40:37 scipy's U method works well with scipy's filter design functions"
- "audio_filters/iir_filter.py:44:58 btype U btype='lowpass',"
- "audio_filters/show_response.py:6:19 pyplot U import matplotlib.pyplot as plt"
- "audio_filters/show_response.py:55:43 nyquist U log scale from 24 to nyquist frequency"
- "audio_filters/show_response.py:56:9 xlim U plt.xlim(24, samplerate / 2"
- "audio_filters/show_response.py:57:9 xlabel U plt.xlabel(\"Frequency (Hz)\")"
- "audio_filters/show_response.py:58:9 xscale U plt.xscale(\"log\")"
- "audio_filters/show_response.py:62:9 ylim U plt.ylim(max([-80, bounds[0]"
- "audio_filters/show_response.py:63:9 ylabel U plt.ylabel(\"Gain (dB)\")"
- "backtracking/coloring.py:11:5 neighbours U neighbours: list[int], colored"
- "backtracking/coloring.py:14:14 neighbour U For each neighbour check if the coloring"
- "backtracking/coloring.py:52:18 Uncolor U 2.5. Uncolor given vertex"
- "backtracking/hamiltonian_cycle.py:12:44 curr U int]], next_ver: int, curr_ind: int, path: list"
- "backtracking/knight_tour.py:82:22 Kight U ValueError: Open Kight Tour cannot be performed"
- "backtracking/n_queens.py:3:6 nqueens U The nqueens problem is of placing"
- "backtracking/sum_of_subsets.py:12:29 soln U generate_sum_of_subsets_soln(nums: list[int], max"
- "backtracking/sum_of_subsets.py:12:34 nums U sum_of_subsets_soln(nums: list[int], max_sum"
- "bit_manipulation/count_1s_brian_kernighan_method.py:3:66 Kernighan's U integer using Brian Kernighan's way."
- "blockchain/modular_division.py:12:55 modn U 0≤x≤n−1, and b/a=x(modn) (that is, b=ax(modn"
- "boolean_algebra/quine_mc_cluskey.py:83:45 implicants U list[list[int]], prime_implicants: list[str]) -> list"
- "boolean_algebra/quine_mc_cluskey.py:130:11 implicant U def prime_implicant_chart("
- "boolean_algebra/quine_mc_cluskey.py:158:18 Implicants U print(\"Prime Implicants are:\")"
- "cellular_automata/game_of_life.py:1:41 Kumar U Life, Author Anurag Kumar(mailto:anuragkumarak"
- "cellular_automata/game_of_life.py:76:54 tolist U bool]] = current_canvas.tolist()"
- "cellular_automata/game_of_life.py:123:5 cmap U cmap = ListedColormap([\"w"
- "cellular_automata/nagel_schrekenberg.py:91:7 Beforce U # Beforce calculations, the highway"
- "ciphers/a1z26.py:13:17 myname U >>> encode(\"myname\")"
- "ciphers/affine_cipher.py:40:35 Mpyx U I}p~{HL}Gp{vp pFsH}pxMpyxIx JHL O}F{~pvuOvF{FuF"
- "ciphers/atbash.py:5:5 atbash U def atbash_slow(sequence: str)"
- "ciphers/atbash.py:8:6 ZYXWVUT U 'ZYXWVUT'"
- "ciphers/baconian_cipher.py:8:11 AAAAB U \"b\": \"AAAAB\","
- "ciphers/baconian_cipher.py:9:11 AAABA U \"c\": \"AAABA\","
- "ciphers/baconian_cipher.py:10:11 AAABB U \"d\": \"AAABB\","
- "ciphers/baconian_cipher.py:11:11 AABAA U \"e\": \"AABAA\","
- "ciphers/baconian_cipher.py:12:11 AABAB U \"f\": \"AABAB\","
- "ciphers/baconian_cipher.py:13:11 AABBA U \"g\": \"AABBA\","
- "ciphers/baconian_cipher.py:14:11 AABBB U \"h\": \"AABBB\","
- "ciphers/baconian_cipher.py:15:11 ABAAA U \"i\": \"ABAAA\","
- "ciphers/baconian_cipher.py:16:11 BBBAA U \"j\": \"BBBAA\","
- "ciphers/baconian_cipher.py:17:11 ABAAB U \"k\": \"ABAAB\","
- "ciphers/baconian_cipher.py:18:11 ABABA U \"l\": \"ABABA\","
- "ciphers/baconian_cipher.py:19:11 ABABB U \"m\": \"ABABB\","
- "ciphers/baconian_cipher.py:20:11 ABBAA U \"n\": \"ABBAA\","
- "ciphers/baconian_cipher.py:21:11 ABBAB U \"o\": \"ABBAB\","
- "ciphers/baconian_cipher.py:22:11 ABBBA U \"p\": \"ABBBA\","
- "ciphers/baconian_cipher.py:23:11 ABBBB U \"q\": \"ABBBB\","
- "ciphers/baconian_cipher.py:24:11 BAAAA U \"r\": \"BAAAA\","
- "ciphers/baconian_cipher.py:25:11 BAAAB U \"s\": \"BAAAB\","
- "ciphers/baconian_cipher.py:26:11 BAABA U \"t\": \"BAABA\","
- "ciphers/baconian_cipher.py:27:11 BAABB U \"u\": \"BAABB\","
- "ciphers/baconian_cipher.py:28:11 BBBAB U \"v\": \"BBBAB\","
- "ciphers/baconian_cipher.py:29:11 BABAA U \"w\": \"BABAA\","
- "ciphers/baconian_cipher.py:30:11 BABAB U \"x\": \"BABAB\","
- "ciphers/baconian_cipher.py:31:11 BABBA U \"y\": \"BABBA\","
- "ciphers/baconian_cipher.py:32:11 BABBB U \"z\": \"BABBB\","
- "ciphers/baconian_cipher.py:45:6 AABBBAABAAABABAABABAABBAB U 'AABBBAABAAABABAABABAABBAB'"
- "ciphers/baconian_cipher.py:47:32 BABAAABBABBAAAAABABAAAABB U AABBBAABAAABABAABABAABBAB BABAAABBABBAAAAABABAAAABB'"
- "ciphers/base32.py:8:7 JBSWY U b'JBSWY3DPEBLW64TMMQQQ===='"
- "ciphers/base32.py:8:13 DPEBLW U b'JBSWY3DPEBLW64TMMQQQ===='"
- "ciphers/base32.py:8:21 TMMQQQ U b'JBSWY3DPEBLW64TMMQQQ===='"
- "ciphers/base32.py:10:7 GEZDGNBVGY U b'GEZDGNBVGY======'"
- "ciphers/base32.py:12:7 ONXW U b'ONXW2ZJANRXW4ZZAMNXW24DMMV"
- "ciphers/base32.py:12:12 ZJANRXW U b'ONXW2ZJANRXW4ZZAMNXW24DMMV4CA43UOJUW"
- "ciphers/base32.py:12:20 ZZAMNXW U b'ONXW2ZJANRXW4ZZAMNXW24DMMV4CA43UOJUW4ZY="
- "ciphers/base32.py:12:29 DMMV U ONXW2ZJANRXW4ZZAMNXW24DMMV4CA43UOJUW4ZY='"
- "ciphers/base32.py:12:38 UOJUW U ZJANRXW4ZZAMNXW24DMMV4CA43UOJUW4ZY='"
- "ciphers/base64.py:17:53 Steganography U encoding can be used in Steganography to hide data in these"
- "ciphers/beaufort_cipher.py:2:9 Mohit U Author: Mohit Radadiya"
- "ciphers/beaufort_cipher.py:2:15 Radadiya U Author: Mohit Radadiya"
- "ciphers/beaufort_cipher.py:17:6 SECRETSECRETSECRE U 'SECRETSECRETSECRE'"
- "ciphers/beaufort_cipher.py:36:10 PAYUWL U 'BDC PAYUWL JPAIYI'"
- "ciphers/beaufort_cipher.py:36:17 JPAIYI U 'BDC PAYUWL JPAIYI'"
- "ciphers/bifid.py:57:53 qtltbdxrxlk U encode('testmessage') == 'qtltbdxrxlk'"
- "ciphers/brute_force_caesar_cipher.py:3:18 TMDETUX U >>> decrypt('TMDETUX PMDVU')"
- "ciphers/brute_force_caesar_cipher.py:3:26 PMDVU U >> decrypt('TMDETUX PMDVU')"
- "ciphers/brute_force_caesar_cipher.py:5:30 SLCDSTW U Decryption using Key #1: SLCDSTW OLCUT"
- "ciphers/brute_force_caesar_cipher.py:5:38 OLCUT U using Key #1: SLCDSTW OLCUT"
- "ciphers/brute_force_caesar_cipher.py:6:30 RKBCRSV U Decryption using Key #2: RKBCRSV NKBTS"
- "ciphers/brute_force_caesar_cipher.py:6:38 NKBTS U using Key #2: RKBCRSV NKBTS"
- "ciphers/brute_force_caesar_cipher.py:7:30 QJABQRU U Decryption using Key #3: QJABQRU MJASR"
- "ciphers/brute_force_caesar_cipher.py:7:38 MJASR U using Key #3: QJABQRU MJASR"
- "ciphers/brute_force_caesar_cipher.py:8:30 PIZAPQT U Decryption using Key #4: PIZAPQT LIZRQ"
- "ciphers/brute_force_caesar_cipher.py:8:38 LIZRQ U using Key #4: PIZAPQT LIZRQ"
- "ciphers/brute_force_caesar_cipher.py:9:30 OHYZOPS U Decryption using Key #5: OHYZOPS KHYQP"
- "ciphers/brute_force_caesar_cipher.py:9:38 KHYQP U using Key #5: OHYZOPS KHYQP"
- "ciphers/brute_force_caesar_cipher.py:10:30 NGXYNOR U Decryption using Key #6: NGXYNOR JGXPO"
- "ciphers/brute_force_caesar_cipher.py:10:38 JGXPO U using Key #6: NGXYNOR JGXPO"
- "ciphers/brute_force_caesar_cipher.py:11:30 MFWXMNQ U Decryption using Key #7: MFWXMNQ IFWON"
- "ciphers/brute_force_caesar_cipher.py:11:38 IFWON U using Key #7: MFWXMNQ IFWON"
- "ciphers/brute_force_caesar_cipher.py:12:30 LEVWLMP U Decryption using Key #8: LEVWLMP HEVNM"
- "ciphers/brute_force_caesar_cipher.py:12:38 HEVNM U using Key #8: LEVWLMP HEVNM"
- "ciphers/brute_force_caesar_cipher.py:13:30 KDUVKLO U Decryption using Key #9: KDUVKLO GDUML"
- "ciphers/brute_force_caesar_cipher.py:13:38 GDUML U using Key #9: KDUVKLO GDUML"
- "ciphers/brute_force_caesar_cipher.py:14:31 JCTUJKN U Decryption using Key #10: JCTUJKN FCTLK"
- "ciphers/brute_force_caesar_cipher.py:14:39 FCTLK U using Key #10: JCTUJKN FCTLK"
- "ciphers/brute_force_caesar_cipher.py:15:31 IBSTIJM U Decryption using Key #11: IBSTIJM EBSKJ"
- "ciphers/brute_force_caesar_cipher.py:15:39 EBSKJ U using Key #11: IBSTIJM EBSKJ"
- "ciphers/brute_force_caesar_cipher.py:16:31 HARSHIL U Decryption using Key #12: HARSHIL DARJI"
- "ciphers/brute_force_caesar_cipher.py:16:39 DARJI U using Key #12: HARSHIL DARJI"
- "ciphers/brute_force_caesar_cipher.py:17:31 GZQRGHK U Decryption using Key #13: GZQRGHK CZQIH"
- "ciphers/brute_force_caesar_cipher.py:17:39 CZQIH U using Key #13: GZQRGHK CZQIH"
- "ciphers/brute_force_caesar_cipher.py:18:31 FYPQFGJ U Decryption using Key #14: FYPQFGJ BYPHG"
- "ciphers/brute_force_caesar_cipher.py:18:39 BYPHG U using Key #14: FYPQFGJ BYPHG"
- "ciphers/brute_force_caesar_cipher.py:19:31 EXOPEFI U Decryption using Key #15: EXOPEFI AXOGF"
- "ciphers/brute_force_caesar_cipher.py:19:39 AXOGF U using Key #15: EXOPEFI AXOGF"
- "ciphers/brute_force_caesar_cipher.py:20:31 DWNODEH U Decryption using Key #16: DWNODEH ZWNFE"
- "ciphers/brute_force_caesar_cipher.py:20:39 ZWNFE U using Key #16: DWNODEH ZWNFE"
- "ciphers/brute_force_caesar_cipher.py:21:31 CVMNCDG U Decryption using Key #17: CVMNCDG YVMED"
- "ciphers/brute_force_caesar_cipher.py:21:39 YVMED U using Key #17: CVMNCDG YVMED"
- "ciphers/brute_force_caesar_cipher.py:22:31 BULMBCF U Decryption using Key #18: BULMBCF XULDC"
- "ciphers/brute_force_caesar_cipher.py:22:39 XULDC U using Key #18: BULMBCF XULDC"
- "ciphers/brute_force_caesar_cipher.py:23:31 ATKLABE U Decryption using Key #19: ATKLABE WTKCB"
- "ciphers/brute_force_caesar_cipher.py:23:39 WTKCB U using Key #19: ATKLABE WTKCB"
- "ciphers/brute_force_caesar_cipher.py:24:31 ZSJKZAD U Decryption using Key #20: ZSJKZAD VSJBA"
- "ciphers/brute_force_caesar_cipher.py:24:39 VSJBA U using Key #20: ZSJKZAD VSJBA"
- "ciphers/brute_force_caesar_cipher.py:25:31 YRIJYZC U Decryption using Key #21: YRIJYZC URIAZ"
- "ciphers/brute_force_caesar_cipher.py:25:39 URIAZ U using Key #21: YRIJYZC URIAZ"
- "ciphers/brute_force_caesar_cipher.py:26:31 XQHIXYB U Decryption using Key #22: XQHIXYB TQHZY"
- "ciphers/brute_force_caesar_cipher.py:26:39 TQHZY U using Key #22: XQHIXYB TQHZY"
- "ciphers/brute_force_caesar_cipher.py:27:31 WPGHWXA U Decryption using Key #23: WPGHWXA SPGYX"
- "ciphers/brute_force_caesar_cipher.py:27:39 SPGYX U using Key #23: WPGHWXA SPGYX"
- "ciphers/brute_force_caesar_cipher.py:28:31 VOFGVWZ U Decryption using Key #24: VOFGVWZ ROFXW"
- "ciphers/brute_force_caesar_cipher.py:28:39 ROFXW U using Key #24: VOFGVWZ ROFXW"
- "ciphers/brute_force_caesar_cipher.py:29:31 UNEFUVY U Decryption using Key #25: UNEFUVY QNEWV"
- "ciphers/brute_force_caesar_cipher.py:29:39 QNEWV U using Key #25: UNEFUVY QNEWV"
- "ciphers/caesar_cipher.py:47:33 Jgnnq U final message would be \"Jgnnq, ecrvckp\""
- "ciphers/caesar_cipher.py:47:40 ecrvckp U message would be \"Jgnnq, ecrvckp\""
- "ciphers/caesar_cipher.py:56:11 Cqks U 'bpm yCqks jzwEv nwF rCuxA wDmz"
- "ciphers/caesar_cipher.py:62:8 qtbjwhfxj U 'f qtbjwhfxj fqumfgjy'"
- "ciphers/caesar_cipher.py:62:18 fqumfgjy U 'f qtbjwhfxj fqumfgjy'"
- "ciphers/caesar_cipher.py:188:30 IH'N U brute_force(\"jFyuMy xIH'N vLONy zILwy Gy!\")[2"
- "ciphers/decrypt_caesar_with_chi_squared.py:56:18 ifmmp U Cipher text: ifmmp"
- "ciphers/decrypt_caesar_with_chi_squared.py:112:24 jhlzhy U ... 'dof pz aol jhlzhy jpwoly zv wvwbshy? pa"
- "ciphers/decrypt_caesar_with_chi_squared.py:112:31 jpwoly U 'dof pz aol jhlzhy jpwoly zv wvwbshy? pa pz avv"
- "ciphers/decrypt_caesar_with_chi_squared.py:112:41 wvwbshy U aol jhlzhy jpwoly zv wvwbshy? pa pz avv lhzf av jyhjr"
- "ciphers/decrypt_caesar_with_chi_squared.py:112:60 lhzf U zv wvwbshy? pa pz avv lhzf av jyhjr!'"
- "ciphers/decrypt_caesar_with_chi_squared.py:112:68 jyhjr U wvwbshy? pa pz avv lhzf av jyhjr!'"
- "ciphers/decrypt_caesar_with_chi_squared.py:117:42 crybd U caesar_with_chi_squared('crybd cdbsxq')"
- "ciphers/decrypt_caesar_with_chi_squared.py:117:48 cdbsxq U with_chi_squared('crybd cdbsxq')"
- "ciphers/decrypt_caesar_with_chi_squared.py:120:42 Crybd U caesar_with_chi_squared('Crybd Cdbsxq', case_sensitive"
- "ciphers/decrypt_caesar_with_chi_squared.py:120:48 Cdbsxq U with_chi_squared('Crybd Cdbsxq', case_sensitive=True"
- "ciphers/decrypt_caesar_with_chi_squared.py:200:31 excepcted U # Get the excepcted amount of times the"
- "ciphers/deterministic_miller_rabin.py:1:30 bizzfitch U Created by Nathan Damon, @bizzfitch on github"
- "ciphers/diffie_hellman.py:1:22 hexlify U from binascii import hexlify"
- "ciphers/diffie_hellman.py:3:16 urandom U from os import urandom"
- "ciphers/diffie_hellman.py:5:40 MODP U Modular Exponential (MODP) Diffie-Hellman groups"
- "ciphers/diffie_hellman.py:5:46 Diffie U Modular Exponential (MODP) Diffie-Hellman groups for"
- "ciphers/elgamal_key_generator.py:66:21 elgamal U make_key_files(\"elgamal\", 2048)"
- "ciphers/enigma_machine2.py:11:5 randnomly U - 9 randnomly generated rotors"
- "ciphers/enigma_machine2.py:29:11 EGZWVONAHDCLFQMSIPJBYUKXTR U rotor1 = \"EGZWVONAHDCLFQMSIPJBYUKXTR\""
- "ciphers/enigma_machine2.py:30:11 FOBHMDKEXQNRAULPGSJVTYICZW U rotor2 = \"FOBHMDKEXQNRAULPGSJVTYICZW\""
- "ciphers/enigma_machine2.py:31:11 ZJXESIUQLHAVRMDOYGTNFWPBKC U rotor3 = \"ZJXESIUQLHAVRMDOYGTNFWPBKC\""
- "ciphers/enigma_machine2.py:63:11 RMDJXFUWGISLHVTCQNKYPBEZOA U rotor4 = \"RMDJXFUWGISLHVTCQNKYPBEZOA\""
- "ciphers/enigma_machine2.py:64:11 SGLCPQWZHKXAREONTFBVIYJUDM U rotor5 = \"SGLCPQWZHKXAREONTFBVIYJUDM\""
- "ciphers/enigma_machine2.py:65:11 HVSICLTYKQUBXDWAJZOMFGPREN U rotor6 = \"HVSICLTYKQUBXDWAJZOMFGPREN\""
- "ciphers/enigma_machine2.py:66:11 RZWQHFMVDBKICJLNTUXAGYPSOE U rotor7 = \"RZWQHFMVDBKICJLNTUXAGYPSOE\""
- "ciphers/enigma_machine2.py:67:11 LFKIJODBEGAMQPXVUHYSTCZRWN U rotor8 = \"LFKIJODBEGAMQPXVUHYSTCZRWN\""
- "ciphers/enigma_machine2.py:68:11 KOAEGVDHXPQZMLFTYWJNBRCIUS U rotor9 = \"KOAEGVDHXPQZMLFTYWJNBRCIUS\""
- "ciphers/enigma_machine2.py:72:29 rotsel U rotpos: RotorPositionT, rotsel: RotorSelectionT, pb"
- "ciphers/enigma_machine2.py:82:26 positon U param rotpos: rotor_positon"
- "ciphers/enigma_machine2.py:84:16 plugb U :param pb: plugb -> validated and transformed"
- "ciphers/enigma_machine2.py:109:5 pbdict U pbdict = _plugboard(pb)"
- "ciphers/enigma_machine2.py:114:16 pbstring U def _plugboard(pbstring: str) -> dict[str, str"
- "ciphers/enigma_machine2.py:143:5 tmppbl U tmppbl = set()"
- "ciphers/enigma_machine2.py:184:7 VKLEPDBGRNWTFCJOHQAMUZYIXS U | VKLEPDBGRNWTFCJOHQAMUZYIXS |"
- "ciphers/enigma_machine2.py:192:7 ABCDEFGHIJKLM U | ABCDEFGHIJKLM | e.g. E is paired to"
- "ciphers/enigma_machine2.py:193:7 ZYXWVUTSRQPON U | ZYXWVUTSRQPON | so when E goes in"
- "ciphers/enigma_machine2.py:202:6 KORYH U 'KORYH JUHHI!'"
- "ciphers/enigma_machine2.py:202:12 JUHHI U 'KORYH JUHHI!'"
- "ciphers/enigma_machine2.py:203:24 juhhi U >>> enigma('KORYH, juhhi!', (1, 2, 1), plugb"
- "ciphers/enigma_machine2.py:206:6 FPNCZ U 'FPNCZ QWOBU!'"
- "ciphers/enigma_machine2.py:206:12 QWOBU U 'FPNCZ QWOBU!'"
- "ciphers/hill_cipher.py:63:21 vectorize U modulus = numpy.vectorize(lambda x: x % 36)"
- "ciphers/hill_cipher.py:116:10 TESTINGHILLCIPHERR U 'TESTINGHILLCIPHERR'"
- "ciphers/hill_cipher.py:132:10 WHXYJOLM U 'WHXYJOLM9C6XT085LL'"
- "ciphers/mixed_keyword_cypher.py:20:6 XKJGUFMJST U 'XKJGUFMJST'"
- "ciphers/mono_alphabetic_ciphers.py:10:28 QWERTYUIOPASDFGHJKLZXCVBNM U translate_message(\"QWERTYUIOPASDFGHJKLZXCVBNM\",\"Hello World\",\"encrypt"
- "ciphers/mono_alphabetic_ciphers.py:11:6 Pcssi U 'Pcssi Bidsm'"
- "ciphers/mono_alphabetic_ciphers.py:11:12 Bidsm U 'Pcssi Bidsm'"
- "ciphers/mono_alphabetic_ciphers.py:42:6 Itssg U 'Itssg Vgksr'"
- "ciphers/mono_alphabetic_ciphers.py:42:12 Vgksr U 'Itssg Vgksr'"
- "ciphers/playfair_cipher.py:6:5 chunker U def chunker(seq: Iterable[str],"
- "ciphers/playfair_cipher.py:45:17 ABCDEFGHIKLMNOPQRSTUVWXYZ U alphabet = \"ABCDEFGHIKLMNOPQRSTUVWXYZ\""
- "ciphers/porta_cipher.py:2:29 NOPQRSTUVWXYZ U (\"ABCDEFGHIJKLM\", \"NOPQRSTUVWXYZ\"),"
- "ciphers/porta_cipher.py:4:29 ZNOPQRSTUVWXY U (\"ABCDEFGHIJKLM\", \"ZNOPQRSTUVWXY\"),"
- "ciphers/porta_cipher.py:6:29 YZNOPQRSTUVWX U (\"ABCDEFGHIJKLM\", \"YZNOPQRSTUVWX\"),"
- "ciphers/porta_cipher.py:8:29 XYZNOPQRSTUVW U (\"ABCDEFGHIJKLM\", \"XYZNOPQRSTUVW\"),"
- "ciphers/porta_cipher.py:10:29 WXYZNOPQRSTUV U (\"ABCDEFGHIJKLM\", \"WXYZNOPQRSTUV\"),"
- "ciphers/porta_cipher.py:12:29 VWXYZNOPQRSTU U (\"ABCDEFGHIJKLM\", \"VWXYZNOPQRSTU\"),"
- "ciphers/porta_cipher.py:14:29 UVWXYZNOPQRST U (\"ABCDEFGHIJKLM\", \"UVWXYZNOPQRST\"),"
- "ciphers/porta_cipher.py:16:29 TUVWXYZNOPQRS U (\"ABCDEFGHIJKLM\", \"TUVWXYZNOPQRS\"),"
- "ciphers/porta_cipher.py:18:29 STUVWXYZNOPQR U (\"ABCDEFGHIJKLM\", \"STUVWXYZNOPQR\"),"
- "ciphers/porta_cipher.py:20:29 RSTUVWXYZNOPQ U (\"ABCDEFGHIJKLM\", \"RSTUVWXYZNOPQ\"),"
- "ciphers/porta_cipher.py:22:29 QRSTUVWXYZNOP U (\"ABCDEFGHIJKLM\", \"QRSTUVWXYZNOP\"),"
- "ciphers/porta_cipher.py:24:29 PQRSTUVWXYZNO U (\"ABCDEFGHIJKLM\", \"PQRSTUVWXYZNO\"),"
- "ciphers/porta_cipher.py:26:29 OPQRSTUVWXYZN U (\"ABCDEFGHIJKLM\", \"OPQRSTUVWXYZN\"),"
- "ciphers/porta_cipher.py:44:6 QRACRWU U 'QRACRWU'"
- "ciphers/rabin_miller.py:1:3 Primality U # Primality Testing with the Rabin"
- "ciphers/rail_fence_cipher.py:11:10 olordll U 'HWe olordll'"
- "ciphers/rot13.py:8:9 frperg U \"Zl frperg onax nppbhag ahzore"
- "ciphers/rot13.py:8:16 onax U \"Zl frperg onax nppbhag ahzore vf 1"
- "ciphers/rot13.py:8:21 nppbhag U \"Zl frperg onax nppbhag ahzore vf 173-52946"
- "ciphers/rot13.py:8:29 ahzore U frperg onax nppbhag ahzore vf 173-52946 fb qba"
- "ciphers/rot13.py:8:52 qba'g U ahzore vf 173-52946 fb qba'g gryy nalbar!!\""
- "ciphers/rot13.py:8:58 gryy U vf 173-52946 fb qba'g gryy nalbar!!\""
- "ciphers/rot13.py:8:63 nalbar U 52946 fb qba'g gryy nalbar!!\""
- "ciphers/rsa_factorization.py:16:5 rsafactor U def rsafactor(d: int, e: int, N: int"
- "ciphers/shuffled_shift_cipher.py:66:10 rtype U :rtype: list"
- "ciphers/shuffled_shift_cipher.py:82:38 MLKJIHGF U shuffled parts: [A,CB,ED,MLKJIHGF,RQPON,ZYXWVUTS]"
- "ciphers/shuffled_shift_cipher.py:82:47 RQPON U parts: [A,CB,ED,MLKJIHGF,RQPON,ZYXWVUTS]"
- "ciphers/shuffled_shift_cipher.py:82:53 ZYXWVUTS U CB,ED,MLKJIHGF,RQPON,ZYXWVUTS]"
- "ciphers/shuffled_shift_cipher.py:83:35 ACBEDMLKJIHGFRQPONZYXWVUTS U shuffled __key_list : ACBEDMLKJIHGFRQPONZYXWVUTS"
- "ciphers/shuffled_shift_cipher.py:132:44 Xyqe U ShuffledShiftCipher('4PYIXyqeQZr44')"
- "ciphers/simple_keyword_cypher.py:8:6 Helo U 'Helo Wrd'"
- "ciphers/simple_keyword_cypher.py:11:12 dups U key_no_dups = \"\""
- "ciphers/simple_keyword_cypher.py:50:6 CYJJM U 'CYJJM VMQJB!!'"
- "ciphers/simple_keyword_cypher.py:50:12 VMQJB U 'CYJJM VMQJB!!'"
- "ciphers/simple_substitution_cipher.py:9:12 LFWOAYUISVKMNXPBDCRJTQEGHZ U key = \"LFWOAYUISVKMNXPBDCRJTQEGHZ\""
- "ciphers/simple_substitution_cipher.py:36:55 Harshil U LFWOAYUISVKMNXPBDCRJTQEGHZ', 'Harshil Darji')"
- "ciphers/simple_substitution_cipher.py:36:63 Darji U SVKMNXPBDCRJTQEGHZ', 'Harshil Darji')"
- "ciphers/simple_substitution_cipher.py:37:6 Ilcrism U 'Ilcrism Olcvs'"
- "ciphers/simple_substitution_cipher.py:37:14 Olcvs U 'Ilcrism Olcvs'"
- "ciphers/trafid_cipher.py:127:38 EPSDUCVWYM U encryptMessage(msg, \"EPSDUCVWYM.ZLKXNBTFGORIJHAQ\")"
- "ciphers/trafid_cipher.py:127:49 ZLKXNBTFGORIJHAQ U cryptMessage(msg, \"EPSDUCVWYM.ZLKXNBTFGORIJHAQ\")"
- "ciphers/transposition_cipher.py:28:6 Hlia U 'Hlia rDsahrij'"
- "ciphers/transposition_cipher.py:28:12 Dsahrij U 'Hlia rDsahrij'"
- "ciphers/vigenere_cipher.py:22:62 Dharmaj U is Harshil Darji from Dharmaj.')"
- "ciphers/vigenere_cipher.py:23:6 Akij U 'Akij ra Odrjqqs Gaisq muod"
- "ciphers/vigenere_cipher.py:23:14 Odrjqqs U 'Akij ra Odrjqqs Gaisq muod Mphumrs."
- "ciphers/vigenere_cipher.py:23:22 Gaisq U 'Akij ra Odrjqqs Gaisq muod Mphumrs.'"
- "ciphers/vigenere_cipher.py:23:28 muod U Akij ra Odrjqqs Gaisq muod Mphumrs.'"
- "ciphers/vigenere_cipher.py:23:33 Mphumrs U ra Odrjqqs Gaisq muod Mphumrs.'"
- "ciphers/xor_cipher.py:132:51 fout U encrypt.out\", \"w+\") as fout:"
- "compression/burrows_wheeler.py:31:31 ANANA U BANANA|', 'BANANA|^', 'ANANA|^B', 'NANA|^BA', 'ANA"
- "compression/burrows_wheeler.py:31:43 NANA U BANANA|^', 'ANANA|^B', 'NANA|^BA', 'ANA|^BAN', 'NA"
- "compression/burrows_wheeler.py:31:71 BANA U BA', 'ANA|^BAN', 'NA|^BANA',"
- "compression/burrows_wheeler.py:32:9 BANAN U 'A|^BANAN', '|^BANANA']"
- "compression/burrows_wheeler.py:34:32 casaa U asa_da_casa', '_asa_da_casaa', 'asa_da_casaa_',"
- "compression/burrows_wheeler.py:36:40 asaa U , 'casaa_asa_da_', 'asaa_asa_da_c', 'saa_asa"
- "compression/burrows_wheeler.py:39:39 namabananapa U namabanana', 'anamabananap', 'namabananapa', 'amabananapan',"
- "compression/burrows_wheeler.py:40:22 abananapanam U 'mabananapana', 'abananapanam', 'bananapanama', 'ananapanam"
- "compression/burrows_wheeler.py:41:6 nanapanamaba U 'nanapanamaba', 'anapanamaban', 'napanamaba"
- "compression/burrows_wheeler.py:41:54 apanamabanan U apanamaban', 'napanamabana', 'apanamabanan']"
- "compression/burrows_wheeler.py:65:21 aaaadss U {'bwt_string': 'aaaadss_c__aa', 'idx_original"
- "compression/burrows_wheeler.py:67:21 mnpbnnaaaaaa U {'bwt_string': 'mnpbnnaaaaaa', 'idx_original_string"
- "compression/lempel_ziv_decompress.py:2:43 Lempel U several implementations of Lempel–Ziv–Welch decompression"
- "compression/peak_signal_to_noise_ratio.py:2:30 PSNR U signal-to-noise ratio - PSNR"
- "compression/peak_signal_to_noise_ratio.py:15:5 psnr U def psnr(original: float, contrast"
- "compression/peak_signal_to_noise_ratio.py:27:20 imread U original = cv2.imread(os.path.join(dir_path"
- "computer_vision/cnn_classification.py:2:1 Convolutional U Convolutional Neural Network"
- "computer_vision/cnn_classification.py:17:22 iamges U . The labels of the iamges will be extracted from"
- "computer_vision/cnn_classification.py:26:17 Keras U # Importing the Keras libraries and packages"
- "computer_vision/cnn_classification.py:28:17 keras U from tensorflow.keras import layers, models"
- "computer_vision/cnn_classification.py:32:7 Initialising U # Initialising the CNN"
- "computer_vision/cnn_classification.py:37:16 Conv U layers.Conv2D(32, (3, 3), input"
- "computer_vision/cnn_classification.py:37:72 relu U 64, 3), activation=\"relu\")"
- "computer_vision/cnn_classification.py:43:23 convolutional U # Adding a second convolutional layer"
- "computer_vision/flip_augmentation.py:27:16 annos U img_paths, annos = get_dataset(LABEL"
- "computer_vision/flip_augmentation.py:36:13 imwrite U cv2.imwrite(f\"/{file_root}.jpg\""
- "computer_vision/flip_augmentation.py:36:54 IMWRITE U root}.jpg\", image, [cv2.IMWRITE_JPEG_QUALITY, 85])"
- "computer_vision/flip_augmentation.py:88:32 narray U new_imgs_list <type: narray>: image after resize"
- "computer_vision/harris_corner.py:15:23 neighbourhoods U window_size : neighbourhoods considered"
- "computer_vision/mosaic_augmentation.py:11:3 Parrameters U # Parrameters"
- "computer_vision/mosaic_augmentation.py:30:9 idxs U idxs = random.sample(range"
- "computer_vision/mosaic_augmentation.py:76:13 xmin U xmin = float(obj[1]) - float"
- "computer_vision/mosaic_augmentation.py:77:13 ymin U ymin = float(obj[2]) - float"
- "computer_vision/mosaic_augmentation.py:78:13 xmax U xmax = float(obj[1]) + float"
- "computer_vision/mosaic_augmentation.py:79:13 ymax U ymax = float(obj[2]) + float"
- "computer_vision/mosaic_augmentation.py:113:5 divid U divid_point_x = int(scale"
- "CONTRIBUTING.md:5:339 Gitter U ask the community in [Gitter](https://gitter.im/TheAlgorit"
- "CONTRIBUTING.md:46:8 docstrings U * have docstrings with clear explanations"
- "CONTRIBUTING.md:47:11 doctests U * contain doctests that test both valid"
- "CONTRIBUTING.md:77:334 autopep U other code formatters (autopep8, yapf) but the __black"
- "CONTRIBUTING.md:77:344 yapf U formatters (autopep8, yapf) but the __black__ formatter"
- "CONTRIBUTING.md:131:33 pytest U doctests will be run by pytest as part of our automated"
- "CONTRIBUTING.md:134:14 doctest U python3 -m doctest -v my_submission.py"
- "CONTRIBUTING.md:151:171 mypy U automated testing will run [mypy](http://mypy-lang.org"
- "CONTRIBUTING.md:182:10 poyea U Writer [@poyea](https://github.com"
- "conversions/binary_to_hexadecimal.py:39:7 Sanitising U # Sanitising parameter"
- "conversions/length_conversion.py:35:6 inche U \"inche\": \"in\", # Trailing"
- "conversions/molecular_chemistry.py:10:27 nfactor U molarity_to_normality(nfactor: int, moles: float,"
- "conversions/prefix_conversions_string.py:2:21 Lullo U * Author: Manuel Di Lullo (https://github.com"
- "conversions/prefix_conversions_string.py:5:67 pyles U repository by lance-pyles"
- "conversions/prefix_conversions_string.py:22:5 yotta U yotta = 80"
- "conversions/prefix_conversions_string.py:23:5 zetta U zetta = 70"
- "conversions/prefix_conversions_string.py:25:5 peta U peta = 50"
- "conversions/prefix_conversions_string.py:26:5 tera U tera = 40"
- "conversions/prefix_conversions_string.py:27:5 giga U giga = 30"
- "conversions/prefix_conversions_string.py:42:5 hecto U hecto = 2"
- "conversions/prefix_conversions_string.py:43:5 deca U deca = 1"
- "conversions/prefix_conversions_string.py:44:5 deci U deci = -1"
- "conversions/prefix_conversions_string.py:45:5 centi U centi = -2"
- "conversions/prefix_conversions_string.py:46:5 milli U milli = -3"
- "conversions/prefix_conversions_string.py:49:5 pico U pico = -12"
- "conversions/prefix_conversions_string.py:50:5 femto U femto = -15"
- "conversions/prefix_conversions_string.py:51:5 atto U atto = -18"
- "conversions/prefix_conversions_string.py:52:5 zepto U zepto = -21"
- "conversions/prefix_conversions_string.py:53:5 yocto U yocto = -24"
- "conversions/roman_numerals.py:7:29 CLIV U tests = {\"III\": 3, \"CLIV\": 154, \"MIX\": 1009,"
- "conversions/roman_numerals.py:7:68 MMMCMXCIX U 1009, \"MMD\": 2500, \"MMMCMXCIX\": 3999}"
- "conversions/roman_numerals.py:11:5 vals U vals = {\"I\": 1, \"V\": 5,"
- "conversions/temperature_conversions.py:4:43 ndigits U fahrenheit(celsius: float, ndigits: int = 2) -> float:"
- "conversions/temperature_conversions.py:306:5 reaumur U def reaumur_to_kelvin(reaumur: float"
- "conversions/weight_conversion.py:4:15 Anubhav U __author__ = \"Anubhav Solanki\""
- "conversions/weight_conversion.py:4:23 Solanki U author__ = \"Anubhav Solanki\""
- "data_structures/binary_tree/avl_tree.py:244:9 Ltree U class AVLtree:"
- "data_structures/binary_tree/avl_tree.py:297:26 traversale U -> str: # a level traversale, gives a more intuitive"
- "data_structures/binary_tree/binary_search_tree_recursive.py:231:9 inorder U def inorder_traversal(self) -> Iterator"
- "data_structures/binary_tree/binary_search_tree_recursive.py:598:12 Inorder U print(\"Inorder traversal:\", inorder"
- "data_structures/binary_tree/binary_search_tree.py:14:28 pformat U from pprint import pformat"
- "data_structures/binary_tree/lazy_segment_tree.py:128:5 segt U segt = SegmentTree(size)"
- "data_structures/binary_tree/lowest_common_ancestor.py:75:13 qsize U while q.qsize() != 0:"
- "data_structures/binary_tree/red_black_tree.py:711:5 pytests U def pytests() -> None:"
- "data_structures/binary_tree/treap.py:8:5 Treap's U Treap's node"
- "data_structures/binary_tree/treap.py:9:5 Treap U Treap is a binary tree by"
- "data_structures/binary_tree/treap.py:127:31 treap U value to add value into treap"
- "data_structures/binary_tree/wavelet_tree.py:18:14 maxx U self.maxx: int = -1"
- "data_structures/binary_tree/wavelet_tree.py:120:5 quantile U def quantile(node: Node | None, index"
- "data_structures/disjoint_set/alternate_disjoint_set.py:54:26 disj U def get_parent(self, disj_set: int) -> int:"
- "data_structures/heap/binomial_heap.py:54:64 logn U elements: Guaranteed logn, amoratized 1"
- "data_structures/heap/binomial_heap.py:54:70 amoratized U elements: Guaranteed logn, amoratized 1"
- "data_structures/heap/binomial_heap.py:55:56 logm U size m and n: O(logn + logm)"
- "data_structures/heap/binomial_heap.py:120:38 inplace U merged heap; (merge is inplace)"
- "data_structures/heap/binomial_heap.py:178:19 Neighbouring U # Neighbouring Nodes"
- "data_structures/heap/binomial_heap.py:327:11 Neighbour U # Neighbour nodes"
- "data_structures/heap/heap_generic.py:62:10 heapify U def _heapify_up(self, index):"
- "data_structures/linked_list/deque_doubly.py:103:8 Equeu U # DEqueu Remove Operations (At"
- "data_structures/linked_list/from_sequence.py:1:13 Prorgam U # Recursive Prorgam to create a Linked List"
- "data_structures/linked_list/singly_linked_list.py:399:10 dlrow U \"dlrow olleH\","
- "data_structures/linked_list/singly_linked_list.py:399:16 olle U \"dlrow olleH\","
- "data_structures/linked_list/skip_list.py:371:17 doesnt U def test_delete_doesnt_leave_dead_nodes():"
- "data_structures/queue/double_ended_queue.py:243:18 topop U @returns topop.val: the value of the"
- "data_structures/queue/double_ended_queue.py:379:32 deques U if the length of the deques are not the same, they"
- "data_structures/stacks/dijkstras_two_stack_algorithm.py:3:20 echoaj U GitHub: github.com/echoaj"
- "data_structures/stacks/dijkstras_two_stack_algorithm.py:39:5 dijkstras U def dijkstras_two_stack_algorithm"
- "digital_image_processing/change_brightness.py:25:9 brigt U brigt_img = change_brightness"
- "digital_image_processing/convert_to_negative.py:2:36 opencv U mplemented an algorithm using opencv to convert a colored"
- "digital_image_processing/convert_to_negative.py:4:44 imshow U destroyAllWindows, imread, imshow, waitKey"
- "digital_image_processing/edge_detection/canny.py:5:39 sobel U image_processing.filters.sobel_filter import sobel"
- "digital_image_processing/edge_detection/canny.py:12:15 mgrid U x, y = np.mgrid[0 - center : k_size"
- "digital_image_processing/filters/convolve.py:30:63 vstack U pixels into a row and np.vstack all rows"
- "digital_image_processing/filters/gabor_filter.py:1:25 Gaborfilter U Implementation of the Gaborfilter"
- "digital_image_processing/filters/gabor_filter.py:7:5 gabor U def gabor_filter_kernel("
- "digital_image_processing/filters/gabor_filter.py:8:5 ksize U ksize: int, sigma: int, theta"
- "digital_image_processing/filters/gabor_filter.py:8:41 lambd U sigma: int, theta: int, lambd: int, gamma: int, psi"
- "digital_image_processing/filters/gabor_filter.py:14:24 Gabor U of Gabor function."
- "digital_image_processing/histogram_equalization/histogram_stretch.py:4:10 Binish U @author: Binish125"
- "digital_image_processing/index_calculation.py:1:11 João U # Author: João Gustavo A. Amorim"
- "digital_image_processing/index_calculation.py:1:27 Amorim U Author: João Gustavo A. Amorim"
- "digital_image_processing/index_calculation.py:47:15 ARVI U #\"ARVI2\" -- red"
- "digital_image_processing/index_calculation.py:48:15 CCCI U #\"CCCI\" -- red"
- "digital_image_processing/index_calculation.py:51:15 NDVI U #\"NDVI\" -- red"
- "digital_image_processing/index_calculation.py:52:15 BNDVI U #\"BNDVI\" -- blue"
- "digital_image_processing/index_calculation.py:54:15 GNDVI U #\"GNDVI\" -- green"
- "digital_image_processing/index_calculation.py:55:15 GBNDVI U #\"GBNDVI\" -- green"
- "digital_image_processing/index_calculation.py:56:15 GRNDVI U #\"GRNDVI\" -- red,"
- "digital_image_processing/index_calculation.py:57:15 RBNDVI U #\"RBNDVI\" -- red,"
- "digital_image_processing/index_calculation.py:58:15 PNDVI U #\"PNDVI\" -- red"
- "digital_image_processing/index_calculation.py:60:15 BWDRVI U #\"BWDRVI\" -- blue"
- "digital_image_processing/index_calculation.py:64:15 CTVI U #\"CTVI\" -- red"
- "digital_image_processing/index_calculation.py:65:15 GDVI U #\"GDVI\" -- green"
- "digital_image_processing/index_calculation.py:67:15 GEMI U #\"GEMI\" -- red"
- "digital_image_processing/index_calculation.py:68:15 GOSAVI U #\"GOSAVI\" -- green"
- "digital_image_processing/index_calculation.py:69:15 GSAVI U #\"GSAVI\" -- green"
- "digital_image_processing/index_calculation.py:72:15 IPVI U #\"IPVI\" -- red"
- "digital_image_processing/index_calculation.py:75:15 MRVI U #\"MRVI\" -- red"
- "digital_image_processing/index_calculation.py:76:15 MSAVI U #\"MSAVI\" -- red"
- "digital_image_processing/index_calculation.py:80:15 NGRDI U #\"NGRDI\" -- red"
- "digital_image_processing/index_calculation.py:86:15 NDRE U #\"NDRE\" -- redEdge"
- "digital_image_processing/index_calculation.py:132:9 funcs U funcs = {"
- "digital_image_processing/index_calculation.py:221:34 CDVI U Index, Calibrated NDVI - CDVI"
- "digital_image_processing/index_calculation.py:339:9 ndvi U ndvi = self.NDVI()"
- "digital_image_processing/index_calculation.py:565:18 maxprec U floatmode='maxprec_equal'))"
- "digital_image_processing/test_digital_image_processing.py:13:58 conv U filters import convolve as conv"
- "DIRECTORY.md:15:6 Butterworth U * [Butterworth Filter](https://github"
- "DIRECTORY.md:35:19 Setbits U * [Binary Count Setbits](https://github.com"
- "DIRECTORY.md:41:21 Kernighan U * [Count 1S Brian Kernighan Method](https://github"
- "DIRECTORY.md:53:15 Cluskey U * [Quine Mc Cluskey](https://github.com"
- "DIRECTORY.md:56:6 Conways U * [Conways Game Of Life](https"
- "DIRECTORY.md:58:6 Nagel U * [Nagel Schrekenberg](https"
- "DIRECTORY.md:58:12 Schrekenberg U * [Nagel Schrekenberg](https://github.com"
- "DIRECTORY.md:64:6 Atbash U * [Atbash](https://github.com"
- "DIRECTORY.md:65:6 Baconian U * [Baconian Cipher](https://github"
- "DIRECTORY.md:74:6 Cryptomath U * [Cryptomath Module](https://github"
- "DIRECTORY.md:79:6 Elgamal U * [Elgamal Key Generator](https"
- "DIRECTORY.md:85:6 Onepad U * [Onepad Cipher](https://github"
- "DIRECTORY.md:86:6 Playfair U * [Playfair Cipher](https://github"
- "DIRECTORY.md:88:6 Porta U * [Porta Cipher](https://github"
- "DIRECTORY.md:98:6 Trafid U * [Trafid Cipher](https://github"
- "DIRECTORY.md:101:6 Vigenere U * [Vigenere Cipher](https://github"
- "DIRECTORY.md:149:8 Fenwick U * [Fenwick Tree](https://github"
- "DIRECTORY.md:180:8 Deque U * [Deque Doubly](https://github"
- "DIRECTORY.md:202:8 Dijkstras U * [Dijkstras Two Stack Algorithm"
- "DIRECTORY.md:230:8 Sobel U * [Sobel Filter](https://github"
- "DIRECTORY.md:252:10 Subarray U * [Max Subarray Sum](https://github"
- "DIRECTORY.md:253:6 Mergesort U * [Mergesort](https://github.com"
- "DIRECTORY.md:256:6 Strassen U * [Strassen Matrix Multiplication"
- "DIRECTORY.md:261:6 Bitmask U * [Bitmask](https://github.com"
- "DIRECTORY.md:268:12 Warshall U * [Floyd Warshall](https://github.com"
- "DIRECTORY.md:272:24 Submasks U [Iterating Through Submasks](https://github.com"
- "DIRECTORY.md:276:39 Nlogn U Increasing Subsequence O(Nlogn)](https://github.com"
- "DIRECTORY.md:324:6 Bezier U * [Bezier Curve](https://github"
- "DIRECTORY.md:336:6 Boruvka U * [Boruvka](https://github.com"
- "DIRECTORY.md:349:6 Dinic U * [Dinic](https://github.com"
- "DIRECTORY.md:351:6 Edmonds U * [Edmonds Karp Multiple Source"
- "DIRECTORY.md:351:14 Karp U * [Edmonds Karp Multiple Source And"
- "DIRECTORY.md:352:6 Eulerian U * [Eulerian Path And Circuit For"
- "DIRECTORY.md:357:11 Shapley U * [Gale Shapley Bigraph](https://github"
- "DIRECTORY.md:357:19 Bigraph U * [Gale Shapley Bigraph](https://github.com"
- "DIRECTORY.md:363:6 Kahns U * [Kahns Algorithm Long](https"
- "DIRECTORY.md:364:22 Topo U * [Kahns Algorithm Topo](https://github.com"
- "DIRECTORY.md:365:6 Karger U * [Karger](https://github.com"
- "DIRECTORY.md:369:28 Kruskal U Minimum Spanning Tree Kruskal](https://github.com"
- "DIRECTORY.md:373:22 Astar U * [Multi Heuristic Astar](https://github.com"
- "DIRECTORY.md:377:10 Kosaraju U * [Scc Kosaraju](https://github.com"
- "DIRECTORY.md:379:6 Tarjans U * [Tarjans Scc](https://github"
- "DIRECTORY.md:393:6 Luhn U * [Luhn](https://github.com"
- "DIRECTORY.md:395:6 Sdbm U * [Sdbm](https://github.com"
- "DIRECTORY.md:410:8 Polynom U * [Polynom For Points](https:/"
- "DIRECTORY.md:413:8 Schur U * [Schur Complement](https:/"
- "DIRECTORY.md:426:14 Clust U * [K Means Clust](https://github.com"
- "DIRECTORY.md:427:16 Neighbours U * [K Nearest Neighbours](https://github.com"
- "DIRECTORY.md:428:10 Sklearn U * [Knn Sklearn](https://github.com"
- "DIRECTORY.md:434:5 Lstm U * Lstm"
- "DIRECTORY.md:436:17 Perceptron U * [Multilayer Perceptron Classifier](https:/"
- "DIRECTORY.md:437:6 Polymonial U * [Polymonial Regression](https:/"
- "DIRECTORY.md:461:13 Borwein U * [Bailey Borwein Plouffe](https://github"
- "DIRECTORY.md:461:21 Plouffe U * [Bailey Borwein Plouffe](https://github.com"
- "DIRECTORY.md:472:6 Chudnovsky U * [Chudnovsky Algorithm](https://github"
- "DIRECTORY.md:473:6 Collatz U * [Collatz Sequence](https://github"
- "DIRECTORY.md:483:6 Eulers U * [Eulers Totient](https://github"
- "DIRECTORY.md:483:13 Totient U * [Eulers Totient](https://github.com"
- "DIRECTORY.md:500:12 Ramanujanalgo U * [Hardy Ramanujanalgo](https://github.com"
- "DIRECTORY.md:504:6 Jaccard U * [Jaccard Similarity](https:/"
- "DIRECTORY.md:505:6 Kadanes U * [Kadanes](https://github.com"
- "DIRECTORY.md:506:6 Karatsuba U * [Karatsuba](https://github.com"
- "DIRECTORY.md:507:6 Krishnamurthy U * [Krishnamurthy Number](https://github"
- "DIRECTORY.md:513:12 Lehmer U * [Lucas Lehmer Primality Test](https"
- "DIRECTORY.md:519:6 Mobius U * [Mobius Function](https://github"
- "DIRECTORY.md:523:6 Nevilles U * [Nevilles Method](https://github"
- "DIRECTORY.md:539:6 Primelib U * [Primelib](https://github.com"
- "DIRECTORY.md:540:6 Proth U * [Proth Number](https://github"
- "DIRECTORY.md:546:6 Relu U * [Relu](https://github.com"
- "DIRECTORY.md:547:6 Runge U * [Runge Kutta](https://github"
- "DIRECTORY.md:547:12 Kutta U * [Runge Kutta](https://github.com"
- "DIRECTORY.md:561:6 Softmax U * [Softmax](https://github.com"
- "DIRECTORY.md:574:6 Zellers U * [Zellers Congruence](https:/"
- "DIRECTORY.md:590:11 Fulkerson U * [Ford Fulkerson](https://github.com"
- "DIRECTORY.md:603:6 Davisb U * [Davisb Putnamb Logemannb Loveland"
- "DIRECTORY.md:603:13 Putnamb U * [Davisb Putnamb Logemannb Loveland]"
- "DIRECTORY.md:603:21 Logemannb U * [Davisb Putnamb Logemannb Loveland](https://github"
- "DIRECTORY.md:603:31 Loveland U Davisb Putnamb Logemannb Loveland](https://github.com"
- "DIRECTORY.md:612:13 Congruential U * [Linear Congruential Generator](https://github"
- "DIRECTORY.md:614:6 Magicdiamondpattern U * [Magicdiamondpattern](https://github.com"
- "DIRECTORY.md:618:6 Sdes U * [Sdes](https://github.com"
- "DIRECTORY.md:890:6 Deutsch U * [Deutsch Jozsa](https://github"
- "DIRECTORY.md:890:14 Jozsa U * [Deutsch Jozsa](https://github.com"
- "DIRECTORY.md:895:13 Qubit U * [Single Qubit Measure](https://github"
- "DIRECTORY.md:921:6 Bitonic U * [Bitonic Sort](https://github"
- "DIRECTORY.md:922:6 Bogo U * [Bogo Sort](https://github"
- "DIRECTORY.md:960:6 Slowsort U * [Slowsort](https://github.com"
- "DIRECTORY.md:970:10 Corasick U * [Aho Corasick](https://github.com"
- "DIRECTORY.md:978:12 Pangram U * [Check Pangram](https://github.com"
- "DIRECTORY.md:985:6 Jaro U * [Jaro Winkler](https://github"
- "DIRECTORY.md:985:11 Winkler U * [Jaro Winkler](https://github.com"
- "DIRECTORY.md:990:6 Manacher U * [Manacher](https://github.com"
- "DIRECTORY.md:1023:10 Imdb U * [Get Imdb Top 250 Movies Csv]"
- "DIRECTORY.md:1024:10 Imdbtop U * [Get Imdbtop](https://github.com"
- "DIRECTORY.md:1027:6 Giphy U * [Giphy](https://github.com"
- "DIRECTORY.md:1033:6 Recaptcha U * [Recaptcha Verification](https"
- "divide_and_conquer/closest_pair_of_points.py:5:36 ords U sorted based on Xco-ords and"
- "divide_and_conquer/closest_pair_of_points.py:112:44 Xcoords U contains the points, whose Xcoords are at a"
- "divide_and_conquer/closest_pair_of_points.py:113:45 Xcoord U pair_dis) from mid's Xcoord"
- "divide_and_conquer/convex_hull.py:409:17 melkman U def convex_hull_melkman(points: list[Point]"
- "divide_and_conquer/inversions.py:8:25 nlogn U algorithm which runs in nlogn and the brute-force"
- "divide_and_conquer/strassen_matrix_multiplication.py:75:12 strassen U def actual_strassen(matrix_a: list, matrix"
- "dynamic_programming/all_construct.py:15:34 purp U construct(\"purple\",[\"purp\",\"p\",\"ur\",\"le\",\"purpl"
- "dynamic_programming/all_construct.py:15:55 purpl U purp\",\"p\",\"ur\",\"le\",\"purpl\"])"
- "dynamic_programming/all_construct.py:51:26 jwajalapa U print(all_construct(\"jwajalapa\", [\"jwa\", \"j\", \"w\","
- "dynamic_programming/all_construct.py:51:68 lapa U j\", \"w\", \"a\", \"la\", \"lapa\"]))"
- "dynamic_programming/all_construct.py:55:14 hexagonosaurus U \"hexagonosaurus\","
- "dynamic_programming/all_construct.py:56:52 auru U \"ag\", \"ago\", \"ru\", \"auru\", \"rus\", \"go\", \"no\""
- "dynamic_programming/catalan_numbers.py:7:20 Dyck U * - The number of Dyck words of length 2n"
- "dynamic_programming/climbing_stairs.py:6:9 Cdoe U LeetCdoe No.70: Climbing Stairs"
- "dynamic_programming/edit_distance.py:2:11 Turfa U Author : Turfa Auliarachman"
- "dynamic_programming/edit_distance.py:2:17 Auliarachman U Author : Turfa Auliarachman"
- "dynamic_programming/iterating_through_submasks.py:2:15 Faizan U Author : Syed Faizan (3rd Year Student IIIT"
- "dynamic_programming/iterating_through_submasks.py:2:40 IIIT U Faizan (3rd Year Student IIIT Pune)"
- "dynamic_programming/iterating_through_submasks.py:3:10 faizan U github : faizan2700"
- "dynamic_programming/longest_common_subsequence.py:74:10 AGGTAB U a = \"AGGTAB\""
- "dynamic_programming/longest_common_subsequence.py:75:10 GXTXAYB U b = \"GXTXAYB\""
- "dynamic_programming/longest_common_subsequence.py:77:24 GTAB U expected_subseq = \"GTAB\""
- "dynamic_programming/longest_increasing_subsequence_o%28nlogn%29.py:2:11 Aravind U # Author: Aravind Kashyap"
- "dynamic_programming/longest_increasing_subsequence_o%28nlogn%29.py:2:19 Kashyap U # Author: Aravind Kashyap"
- "dynamic_programming/longest_increasing_subsequence.py:2:11 Mehdi U Author : Mehdi ALAOUI"
- "dynamic_programming/max_sub_array.py:2:10 Mayank U author : Mayank Kumar Jha (mk9440)"
- "dynamic_programming/max_sub_array.py:84:9 strt U strt = time.time()"
- "dynamic_programming/optimal_binary_search_tree.py:72:22 CLRS U Implemented from CLRS (Introduction to Algorithms"
- "dynamic_programming/optimal_binary_search_tree.py:100:5 freqs U freqs = [nodes[i].freq for"
- "dynamic_programming/subset_generation.py:43:31 Ambuj U code is contributed by Ambuj sahu"
- "dynamic_programming/subset_generation.py:43:37 sahu U contributed by Ambuj sahu"
- "electronics/coulombs_law.py:8:5 couloumbs U def couloumbs_law("
- "electronics/coulombs_law.py:24:29 mémoire U Coulomb (1785) \"Premier mémoire sur l’électricité et"
- "electronics/coulombs_law.py:24:41 l’électricité U Premier mémoire sur l’électricité et le magnétisme,\""
- "electronics/coulombs_law.py:24:61 magnétisme U l’électricité et le magnétisme,\""
- "electronics/coulombs_law.py:25:5 Histoire U Histoire de l’Académie Royale"
- "electronics/coulombs_law.py:25:17 l’Académie U Histoire de l’Académie Royale des Sciences"
- "electronics/electric_power.py:28:38 modulei U stdin>\", line 23, in <modulei"
- "file_transfer/send_file.py:1:32 mytext U file(filename: str = \"mytext.txt\", testing: bool"
- "file_transfer/tests/test_send_file.py:18:13 ensurance U # ===== ensurance ====="
- "fractals/julia_sets.py:1:24 Zotti U Author Alexandre De Zotti"
- "fractals/julia_sets.py:14:33 ambiantly U exponential map Julia set, ambiantly homeomorphic to the"
- "fractals/julia_sets.py:14:43 homeomorphic U Julia set, ambiantly homeomorphic to the examples in"
- "fractals/julia_sets.py:60:49 imag U quadratic_polynomial(1.j, 0).imag)"
- "fractals/sierpinski_triangle.py:3:58 anuragkumarak U uragkumarak95@gmail.com | git/anuragkumarak95"
- "fractals/sierpinski_triangle.py:14:15 Wacław U mathematician Wacław Sierpinski, but appeared"
- "fuzzy_logic/fuzzy_operations.py:2:18 Jigyasa U README, Author - Jigyasa Gandhi(mailto:jigsgandhi"
- "fuzzy_logic/fuzzy_operations.py:13:12 skfuzzy U import skfuzzy as fuzz"
- "fuzzy_logic/fuzzy_operations.py:22:8 trapmf U # (trapmf(), gbellmf(), gaussmf"
- "fuzzy_logic/fuzzy_operations.py:22:18 gbellmf U # (trapmf(), gbellmf(), gaussmf(), etc)."
- "fuzzy_logic/fuzzy_operations.py:22:29 gaussmf U trapmf(), gbellmf(), gaussmf(), etc)."
- "fuzzy_logic/fuzzy_operations.py:25:29 trimf U young = fuzz.membership.trimf(X, abc1)"
- "fuzzy_logic/fuzzy_operations.py:106:25 hspace U plt.subplots_adjust(hspace=0.5)"
- "genetic_algorithm/basic_string.py:5:11 rkia U Author: D4rkia"
- "genetic_algorithm/basic_string.py:77:27 Helxo U >>> evaluate(\"Helxo Worlx\", Hello World"
- "genetic_algorithm/basic_string.py:77:33 Worlx U >>> evaluate(\"Helxo Worlx\", Hello World)"
- "genetic_algorithm/basic_string.py:169:37 abcdefghijklm U ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklm\""
- "genetic_algorithm/basic_string.py:170:10 nopqrstuvwxyz U \"nopqrstuvwxyz.,;!?+-*#@^'èéòà€ù=)"
- "genetic_algorithm/basic_string.py:170:35 èéòà U nopqrstuvwxyz.,;!?+-*#@^'èéòà€ù=)(&%$£/\\\\\""
- "geodesy/lamberts_ellipsoidal_distance.py:69:39 Pcos U sin(sigma)) * sin^2Pcos^2Q / cos^2(sigma/2)"
- "geodesy/lamberts_ellipsoidal_distance.py:71:7 demonimator U X_demonimator = cos(sigma / 2) **"
- "geodesy/lamberts_ellipsoidal_distance.py:75:39 Psin U sin(sigma)) * cos^2Psin^2Q / sin^2(sigma/2)"
- "graphics/bezier_curve.py:49:9 bezier U def bezier_curve_function(self"
- "graphics/vector3_for_2d_rendering.py:10:15 xcodz U __author__ = \"xcodz-dot, cclaus, dhruvmanila"
- "graphics/vector3_for_2d_rendering.py:10:26 cclaus U author__ = \"xcodz-dot, cclaus, dhruvmanila\""
- "graphics/vector3_for_2d_rendering.py:10:34 dhruvmanila U \"xcodz-dot, cclaus, dhruvmanila\""
- "graphs/basic_graphs.py:130:5 dijk U def dijk(G, s):"
- "graphs/basic_graphs.py:158:5 topo U def topo(G, ind=None, Q=None"
- "graphs/basic_graphs.py:188:5 adjm U def adjm():"
- "graphs/basic_graphs.py:209:5 floy U def floy(A_and_n):"
- "graphs/basic_graphs.py:264:5 edglist U def edglist():"
- "graphs/basic_graphs.py:274:5 Kruskal's U Kruskal's MST Algorithm"
- "graphs/basic_graphs.py:282:5 krusk U def krusk(E_and_n):"
- "graphs/bidirectional_a_star.py:79:9 astar U >>> astar = AStar((0, 0), (len"
- "graphs/bidirectional_a_star.py:256:5 bidir U bidir_astar = BidirectionalAStar"
- "graphs/boruvka.py:1:4 Borůvka's U \"\"\"Borůvka's algorithm."
- "graphs/boruvka.py:82:9 boruvka U def boruvka(self) -> None:"
- "graphs/breadth_first_search.py:3:13 OMKAR U \"\"\" Author: OMKAR PATHAK \"\"\""
- "graphs/breadth_first_search.py:3:19 PATHAK U \"\"\" Author: OMKAR PATHAK \"\"\""
- "graphs/breadth_first_search.py:15:49 graaph U list representation of graaph"
- "graphs/connected_components.py:24:15 verts U connected_verts = []"
- "graphs/dijkstra_2.py:11:13 mdist U def minDist(mdist, vset, V):"
- "graphs/dijkstra_2.py:11:20 vset U def minDist(mdist, vset, V):"
- "graphs/dijkstra_2.py:57:5 gsrc U gsrc = int(input(\"\\nEnter"
- "graphs/dijkstra_algorithm.py:2:11 Shubham U # Author: Shubham Malik"
- "graphs/dijkstra_algorithm.py:2:19 Malik U # Author: Shubham Malik"
- "graphs/dijkstra_algorithm.py:73:33 atmost U assuming the new_d is atmost old_d"
- "graphs/dinic.py:17:33 rcap U edge(self, a, b, c, rcap=0):"
- "graphs/dinic.py:87:20 verices U Finally we add the verices near the sink to the"
- "graphs/g_topological_sort.py:1:11 Phyllipe U # Author: Phyllipe Bezerra (https://github"
- "graphs/g_topological_sort.py:1:20 Bezerra U # Author: Phyllipe Bezerra (https://github.com"
- "graphs/gale_shapley_bigraph.py:10:5 oegan U oegan donors and recipients"
- "graphs/gale_shapley_bigraph.py:16:56 Numberphile U v=Qcv1IqHWAzg&t=13s (Numberphile YouTube)."
- "graphs/graph_list.py:3:25 Nwachukwu U Author: OMKAR PATHAK, Nwachukwu Chidiebere"
- "graphs/graph_list.py:3:35 Chidiebere U OMKAR PATHAK, Nwachukwu Chidiebere"
- "graphs/greedy_min_vertex_cover.py:3:16 Approximization U * Description: Approximization algorithm for minimum"
- "graphs/kahns_algorithm_long.py:3:5 indegree U indegree = [0] * len(graph)"
- "graphs/karger.py:2:22 Karger's U An implementation of Karger's Algorithm for partitioning"
- "graphs/karger.py:34:40 adacency U dictionary containing adacency lists for the graph"
- "graphs/minimum_spanning_tree_boruvka.py:38:13 Boruvks's U For Boruvks's algorithm the weights"
- "graphs/minimum_spanning_tree_boruvka.py:71:9 Returna U Returna all edges in the graph"
- "graphs/minimum_spanning_tree_boruvka.py:104:41 Boruvka's U set Union and Find for Boruvka's algorithm"
- "graphs/minimum_spanning_tree_kruskal.py:1:5 kruskal U def kruskal("
- "graphs/minimum_spanning_tree_kruskal2.py:51:49 neighbouring U from the node to the neighbouring nodes (with weights"
- "graphs/minimum_spanning_tree_prims2.py:2:23 Jarník's U Prim's (also known as Jarník's) algorithm is a greedy"
- "graphs/multi_heuristic_astar.py:46:18 prito U for (prito, yyy) in temp:"
- "graphs/multi_heuristic_astar.py:136:16 inad U close_list_inad,"
- "graphs/multi_heuristic_astar.py:140:9 itera U for itera in range(n_heuristic"
- "graphs/scc_kosaraju.py:24:5 kosaraju U def kosaraju():"
- "graphs/strongly_connected_components.py:41:36 strongliy U first search to find strongliy connected"
- "graphs/tarjans_scc.py:16:42 equireachable U we save it and it's equireachable vertices as a strongly"
- "graphs/tests/test_min_spanning_tree_prim.py:25:5 adjancency U adjancency = defaultdict(list)"
- "hashes/chaos_machine.py:45:7 PRNG U # PRNG (Xorshift by George"
- "hashes/chaos_machine.py:45:32 Marsaglia U (Xorshift by George Marsaglia)"
- "hashes/hamming_code.py:1:44 Kunz U A. Amorim & Gabriel Kunz"
- "hashes/hamming_code.py:24:67 Pari U many parity bits (sizePari)"
- "hashes/hamming_code.py:272:5 Receiv U dataReceiv, ack = receptorConverter"
- "hashes/luhn.py:5:8 luhn U def is_luhn(string: str) -> bool"
- "hashes/md5.py:16:30 abcdfghijklmnopqrstuvw U rearrange('1234567890abcdfghijklmnopqrstuvw')"
- "hashes/md5.py:17:6 pqrstuvwhijklmno U 'pqrstuvwhijklmno90abcdfg12345678'"
- "hashes/md5.py:17:24 abcdfg U 'pqrstuvwhijklmno90abcdfg12345678'"
- "hashes/md5.py:117:5 tvals U tvals = [int(2**32 * abs(math"
- "hashes/md5.py:211:13 dtemp U dtemp = D"
- "hashes/sdbm.py:2:36 sdbm U algorithm was created for sdbm (a public-domain reimplementa"
- "hashes/sdbm.py:2:58 reimplementation U sdbm (a public-domain reimplementation of ndbm)"
- "hashes/sha1.py:41:9 Inititates U Inititates the variables data and"
- "hashes/sha256.py:1:14 Yathurshan U # Author: M. Yathurshan"
- "knapsack/README.md:13:190 Dantzig U mathematician Tobias Dantzig (1884–1956), and refers"
- "knapsack/README.md:20:72 CLASSNAME U vector)`, and `help(CLASSNAME.METHODNAME)`."
- "knapsack/README.md:20:82 METHODNAME U and `help(CLASSNAME.METHODNAME)`."
- "knapsack/tests/test_knapsack.py:4:21 Schröder U @author: Dr. Tobias Schröder"
- "linear_algebra/README.md:20:40 eulidean U length() : returns the eulidean length of the vector"
- "linear_algebra/README.md:31:12 axpy U - function axpy(scalar, vector1, vector"
- "linear_algebra/README.md:69:48 bytecode U directly use the Python bytecode file `lib.pyc`."
- "linear_algebra/src/conjugate_gradient.py:39:27 eignevectors U Get eigenvalues and eignevectors for a symmetric matrix"
- "linear_algebra/src/conjugate_gradient.py:40:5 eigen U eigen_values, _ = np.linalg"
- "linear_algebra/src/conjugate_gradient.py:40:33 eigh U values, _ = np.linalg.eigh(matrix)"
- "linear_algebra/src/conjugate_gradient.py:63:31 randn U random_matrix = np.random.randn(dimension, dimension"
- "linear_algebra/src/conjugate_gradient.py:130:25 Krylov U # Calculate new Krylov subspace scale."
- "linear_algebra/src/conjugate_gradient.py:132:27 conjuage U # Calculate new A conjuage search direction."
- "linear_algebra/src/lib.py:265:9 cofactor U cofactor(x: int, y: int): returns"
- "linear_algebra/src/polynom_for_points.py:77:13 zahlen U zahlen = 0"
- "linear_algebra/src/power_iteration.py:45:15 iscomplexobj U assert np.iscomplexobj(input_matrix) == np"
- "linear_algebra/src/power_iteration.py:55:5 lamda U lamda_previous = 0"
- "linear_algebra/src/power_iteration.py:91:22 triu U imag_matrix = np.triu(1j * complex_input_matrix"
- "linear_algebra/src/schur_complement.py:6:5 schur U def schur_complement("
- "linear_algebra/src/schur_complement.py:20:45 Vandenberghe U Optimization – Boyd and Vandenberghe, A.5.5"
- "linear_algebra/src/test_linear_algebra.py:147:9 cofactors U cofactors = [[-3, 14, -10], ["
- "machine_learning/astar.py:19:52 tupleof U the represented by tupleof x and y"
- "machine_learning/astar.py:63:13 neigbours U def get_neigbours(self, cell):"
- "machine_learning/astar.py:67:9 neughbour U neughbour_cord = ["
- "machine_learning/data_transformations.py:26:30 stdev U statistics import mean, stdev"
- "machine_learning/decision_tree.py:39:19 ndim U if labels.ndim != 1:"
- "machine_learning/decision_tree.py:162:12 arange U X = np.arange(-1.0, 1.0, 0.005)"
- "machine_learning/decision_tree.py:181:32 squarred U doctest.testmod(name=\"mean_squarred_error\", verbose=True"
- "machine_learning/forecasting/run.py:16:6 sklearn U from sklearn.preprocessing import"
- "machine_learning/forecasting/run.py:22:44 mtch U train_usr: list, train_mtch: list, test_dt: list"
- "machine_learning/forecasting/run.py:43:45 exog U data (total_user, with exog data = total_event)"
- "machine_learning/forecasting/run.py:53:27 disp U model_fit = model.fit(disp=False, maxiter=600,"
- "machine_learning/forecasting/run.py:137:14 reression U # for linear reression & sarimax"
- "machine_learning/gradient_boosting_regressor.py:29:19 iloc U X = df_boston.iloc[:, :-1]"
- "machine_learning/gradient_descent.py:119:13 atol U atol=absolute_error_limit"
- "machine_learning/gradient_descent.py:120:13 rtol U rtol=relative_error_limit"
- "machine_learning/k_means_clust.py:14:57 hetrogeneity U will be filled with hetrogeneity values if passed"
- "machine_learning/k_means_clust.py:15:8 kmeans U to kmeans func."
- "machine_learning/k_means_clust.py:52:16 CLUST U TAG = \"K-MEANS-CLUST/ \""
- "machine_learning/k_means_clust.py:237:12 fillna U df.fillna(value=FillMissingReport"
- "machine_learning/k_means_clust.py:239:30 dtypes U numeric_cols = df.select_dtypes(np.number).columns"
- "machine_learning/k_means_clust.py:317:29 clustert U concat report with clustert size and nan values"
- "machine_learning/k_means_clust.py:318:41 isin U report[\"Features\"].isin(ClusteringVariables"
- "machine_learning/linear_regression.py:7:56 CSGO U particular code, I had used a CSGO dataset (ADR vs"
- "machine_learning/local_weighted_learning/local_weighted_learning.md:32:38 preferance U \ heta$ , a higher \"preferance\" is given to points"
- "machine_learning/local_weighted_learning/local_weighted_learning.py:13:5 xmat U xmat -->Training data"
- "machine_learning/local_weighted_learning/local_weighted_learning.py:61:5 ypred U ypred = np.zeros(m)"
- "machine_learning/local_weighted_learning/local_weighted_learning.py:71:50 colb U str, cola_name: str, colb_name: str) -> np.mat"
- "machine_learning/local_weighted_learning/local_weighted_learning.py:82:5 mcol U mcol_a = np.mat(col_a)"
- "machine_learning/local_weighted_learning/local_weighted_learning.py:89:26 hstack U training_data_x = np.hstack((one.T, mcol_a.T))"
- "machine_learning/local_weighted_learning/local_weighted_learning.py:94:9 preds U def get_preds(training_data_x: np"
- "machine_learning/local_weighted_learning/local_weighted_learning.py:117:5 xsort U xsort = training_data_x.copy"
- "machine_learning/logistic_regression.py:14:1 Coursera U Coursera ML course"
- "machine_learning/logistic_regression.py:21:7 ipython U # get_ipython().run_line_magic('matplotlib"
- "machine_learning/logistic_regression.py:83:5 probs U probs = predict_prob(grid"
- "machine_learning/lstm/lstm_prediction.py:2:38 LSTM U Long Short Term Memory (LSTM) network model"
- "machine_learning/multilayer_perceptron_classifier.py:8:13 lbfgs U solver=\"lbfgs\", alpha=1e-5, hidden"
- "machine_learning/polymonial_regression.py:30:9 polymonial U def viz_polymonial():"
- "machine_learning/scoring_functions.py:4:15 RMSE U MAE, MSE, RMSE, RMSLE are included"
- "machine_learning/scoring_functions.py:4:21 RMSLE U MAE, MSE, RMSE, RMSLE are included."
- "machine_learning/scoring_functions.py:62:5 rmse U def rmse(predict, actual):"
- "machine_learning/scoring_functions.py:84:5 rmsle U def rmsle(predict, actual):"
- "machine_learning/scoring_functions.py:133:5 denumerator U denumerator = np.sum(actual) / len"
- "machine_learning/sequential_minimum_optimization.py:21:51 coef U kernel='poly', degree=3., coef0=1., gamma=0.5)"
- "machine_learning/sequential_minimum_optimization.py:47:30 wdbc U breast-cancer-wisconsin/wdbc.data\""
- "machine_learning/sequential_minimum_optimization.py:229:9 locis U locis = yield from self._choose"
- "machine_learning/sequential_minimum_optimization.py:239:16 voilate U voilate kkt condition."
- "machine_learning/sequential_minimum_optimization.py:382:7 Normalise U # Normalise data using min_max way"
- "machine_learning/sequential_minimum_optimization.py:470:62 MSIE U Mozilla/4.0 (compatible; MSIE 5.5; Windows NT)\"},"
- "machine_learning/sequential_minimum_optimization.py:481:17 dropna U data = data.dropna(axis=0)"
- "machine_learning/sequential_minimum_optimization.py:490:5 mykernel U mykernel = Kernel(kernel=\"rbf"
- "machine_learning/sequential_minimum_optimization.py:494:5 mysvm U mysvm = SmoSVM("
- "machine_learning/sequential_minimum_optimization.py:582:78 desity U distributed points with high desity and"
- "machine_learning/sequential_minimum_optimization.py:591:5 yrange U yrange = np.linspace(train"
- "machine_learning/support_vector_machines.py:6:55 SVM's U plementing different types of SVM's"
- "machine_learning/support_vector_machines.py:13:5 Linearsvc U def Linearsvc(train_x, train_y):"
- "machine_learning/support_vector_machines.py:36:6 virginica U 'virginica'"
- "maths/bailey_borwein_plouffe.py:1:12 borwein U def bailey_borwein_plouffe(digit_position"
- "maths/bailey_borwein_plouffe.py:1:20 plouffe U def bailey_borwein_plouffe(digit_position: int"
- "maths/binary_exponentiation_2.py:9:11 chinmoy U * @author chinmoy159"
- "maths/binary_exponentiation.py:3:12 Junth U # Author : Junth Basnet"
- "maths/check_polygon.py:26:17 Monogons U ValueError: Monogons and Digons are not polygons"
- "maths/check_polygon.py:26:30 Digons U ValueError: Monogons and Digons are not polygons in"
- "maths/chudnovsky_algorithm.py:12:28 multinomial U = constant_term / ((multinomial_term * linear_term)"
- "maths/chudnovsky_algorithm.py:44:18 prec U getcontext().prec = precision"
- "maths/collatz_sequence.py:4:5 collatz U def collatz_sequence(n: int) ->"
- "maths/entropy.py:27:27 telescreen U . \"from the telescreen was still \""
- "maths/entropy.py:28:35 overfulfilment U \"babbling and the overfulfilment\")"
- "maths/euclidean_distance.py:24:31 asarray U return np.sqrt(np.sum((np.asarray(vector_1) - np.asarray"
- "maths/euclidean_gcd.py:20:26 euclicedan U Recursive method for euclicedan gcd algorithm"
- "maths/eulers_totient.py:2:5 totient U def totient(n: int) -> list:"
- "maths/eulers_totient.py:4:5 totients U totients = [i - 1 for i in range"
- "maths/extended_euclidean_algorithm.py:5:41 Bezout's U bn = gcd(m, n) (a.k.a Bezout's Identity)"
- "maths/extended_euclidean_algorithm.py:10:15 Sharma U # @Author: S. Sharma <silentcat>"
- "maths/extended_euclidean_algorithm.py:13:24 pikulet U Last modified by: pikulet"
- "maths/extended_euclidean_algorithm.py:56:9 coeff U old_coeff_a, coeff_a = 1, 0"
- "maths/fibonacci.py:7:42 Binet U function because the Binet formula function uses"
- "maths/fibonacci.py:16:5 binet U fib_binet runtime: 0.0174 ms"
- "maths/fibonacci.py:113:29 recursuive U Cache must be outside recursuive function"
- "maths/integration_by_simpson_approx.py:29:19 fxdx U 1. integration of fxdx with limit a to b is"
- "maths/integration_by_simpson_approx.py:43:28 integraion U b : upper limit of integraion"
- "maths/is_square_free.py:18:26 repition U it simply checks for repition in the numbers."
- "maths/jaccard_similarity.py:8:38 MMDS U of Massive Datasets [MMDS 2nd Edition, Chapter"
- "maths/jaccard_similarity.py:17:5 jaccard U def jaccard_similariy(setA, setB"
- "maths/jaccard_similarity.py:17:13 similariy U def jaccard_similariy(setA, setB, alternativeUnion"
- "maths/kadanes.py:2:1 Kadane's U Kadane's algorithm to get maximum"
- "maths/kadanes.py:26:5 kadanes U def kadanes(arr: list) -> int:"
- "maths/kadanes.py:61:37 sepatated U Enter integer values sepatated by spaces\")"
- "maths/krishnamurthy_number.py:26:5 krishnamurthy U def krishnamurthy(number: int) -> bool"
- "maths/krishnamurthy_number.py:45:51 Krisnamurthy U whether a number is a Krisnamurthy Number or not.\")"
- "maths/largest_of_very_large_numbers.py:1:11 Abhijeeth U # Author: Abhijeeth S"
- "maths/least_common_multiple.py:17:12 mult U common_mult = max_num"
- "maths/lucas_lehmer_primality_test.py:2:58 primality U Lehmer test (LLT) is a primality test for Mersenne"
- "maths/lucas_lehmer_primality_test.py:2:77 Mersenne U a primality test for Mersenne"
- "maths/lucas_lehmer_primality_test.py:16:11 lehmer U def lucas_lehmer_test(p: int) -> bool"
- "maths/mobius_function.py:12:5 mobius U def mobius(n: int) -> int:"
- "maths/monte_carlo.py:2:10 Matteo U @author: MatteoRaso"
- "maths/monte_carlo.py:2:16 Raso U @author: MatteoRaso"
- "maths/primelib.py:84:14 erathostenes U sieve of erathostenes."
- "maths/primelib.py:540:74 Divisiors U Error in function getDivisiors(...)\""
- "maths/proth_number.py:10:5 proth U def proth(number: int) -> int"
- "maths/qr_decomposition.py:21:18 BLAS U version from BLAS should be used."
- "maths/radix2_fft.py:5:8 mpmath U import mpmath # for roots of unity"
- "maths/radix2_fft.py:91:14 ncol U next_ncol = self.C_max_length"
- "maths/runge_kutta.py:4:5 runge U def runge_kutta(f, y0, x0, h,"
- "maths/runge_kutta.py:4:11 kutta U def runge_kutta(f, y0, x0, h, x_end"
- "maths/sieve_of_eratosthenes.py:10:25 Simas U doctest provider: Bruno Simas Hadlich (https://github"
- "maths/sieve_of_eratosthenes.py:10:31 Hadlich U provider: Bruno Simas Hadlich (https://github.com"
- "maths/sieve_of_eratosthenes.py:11:16 Dmitry U Also thanks to Dmitry (https://github.com"
- "maths/softmax.py:6:8 exponentials U to the exponentials of the input numbers"
- "maths/square_root.py:25:20 aproximated U Square root is aproximated using Newtons method"
- "maths/two_sum.py:36:9 compl U compl = target - val"
- "maths/zellers_congruence.py:5:5 zeller U def zeller(date_input: str) ->"
- "matrix/matrix_class.py:37:23 Cofactors U Identity, Minors, Cofactors and Adjugate are returned"
- "matrix/matrix_class.py:37:37 Adjugate U Minors, Cofactors and Adjugate are returned as Matrices"
- "matrix/matrix_class.py:52:22 adjugate U >>> print(matrix.adjugate())"
- "matrix/sherman_morrison.py:216:13 ainv U >>> ainv = Matrix(3, 3, 0)"
- "matrix/spiral_print.py:42:11 horizotal U # horizotal printing increasing"
- "matrix/tests/test_matrix_operation.py:18:40 matop U matrix_operation as matop"
- "matrix/tests/test_matrix_operation.py:46:9 theo U theo = matop.add(mat1, mat"
- "neural_network/2_hidden_layers_neural_network.py:101:9 Updation U Updation is done using derivative"
- "neural_network/2_hidden_layers_neural_network.py:101:46 sogmoid U using derivative of sogmoid activation function"
- "neural_network/back_propagation_neural_network.py:53:26 asmatrix U self.weight = np.asmatrix(np.random.normal(0,"
- "neural_network/back_propagation_neural_network.py:67:35 xdata U forward_propagation(self, xdata):"
- "neural_network/back_propagation_neural_network.py:97:7 BPNN U class BPNN:"
- "neural_network/back_propagation_neural_network.py:124:28 ydata U def train(self, xdata, ydata, train_round, accuracy"
- "neural_network/back_propagation_neural_network.py:128:22 hlines U self.ax_loss.hlines(self.accuracy, 0, self"
- "neural_network/convolution_neural_network.py:42:19 thre U self.rate_thre = rate_t"
- "neural_network/convolution_neural_network.py:107:31 convs U convolute(self, data, convs, w_convs, thre_convs"
- "neural_network/convolution_neural_network.py:211:25 datas U self, patterns, datas_train, datas_teach,"
- "neural_network/convolution_neural_network.py:227:35 conved U data_focus1, data_conved1 = self.convolute("
- "neural_network/convolution_neural_network.py:297:13 yplot U yplot = [error_accuracy for"
- "neural_network/convolution_neural_network.py:305:43 Complished U -----------Training Complished--------------------"
- "other/check_strong_password.py:10:35 Hwea U strong_password_detector('Hwea7$2!')"
- "other/check_strong_password.py:19:44 udfhiaf U password_detector('Hello1238udfhiaf038fajdvjjf!jaiuFhkqi"
- "other/check_strong_password.py:19:54 fajdvjjf U 'Hello1238udfhiaf038fajdvjjf!jaiuFhkqi1')"
- "other/check_strong_password.py:19:63 jaiu U 8udfhiaf038fajdvjjf!jaiuFhkqi1')"
- "other/check_strong_password.py:19:67 Fhkqi U udfhiaf038fajdvjjf!jaiuFhkqi1')"
- "other/davisb_putnamb_logemannb_loveland.py:4:33 DPLL U Putnam–Logemann–Loveland (DPLL) algorithm is a complete"
- "other/davisb_putnamb_logemannb_loveland.py:5:35 satisfiability U algorithm for deciding the satisfiability of propositional logic"
- "other/davisb_putnamb_logemannb_loveland.py:6:73 Tisfiability U Conjunctive Normal Form SATisfiability"
- "other/davisb_putnamb_logemannb_loveland.py:153:21 uncomplemented U A symbol is the uncomplemented form of a literal."
- "other/davisb_putnamb_logemannb_loveland.py:258:13 Fcount U Fcount, Ncount = 0, 0"
- "other/davisb_putnamb_logemannb_loveland.py:258:21 Ncount U Fcount, Ncount = 0, 0"
- "other/davisb_putnamb_logemannb_loveland.py:276:5 dpll U def dpll_algorithm("
- "other/dijkstra_bankers_algorithm.py:4:13 Biney U # \"Author: \"Biney Kingsley (bluedistro"
- "other/dijkstra_bankers_algorithm.py:80:27 alloc U max_claim[i][j] - alloc_table[i][j] <= avail"
- "other/doomsday.py:42:5 centurian U centurian = year % 100"
- "other/gauss_easter.py:24:5 metonic U metonic_cycle = year % 19"
- "other/graham_scan.py:43:5 minidx U minidx = 0"
- "other/graham_scan.py:44:5 miny U miny, minx = maxsize, maxsize"
- "other/graham_scan.py:166:54 straigh U previous points on those straigh line is not convex hull"
- "other/greedy.py:45:18 Sambhar U ... \"Sambhar\", \"Chicken\", \"Fries"
- "other/linear_congruential_generator.py:13:27 accptable U in this case, it is accptable because `LinearCongruentialGe"
- "other/lru_cache.py:252:17 pythonic U # Note: pythonic interface would throw"
- "other/password_generator.py:24:3 ctbi U # ctbi= characters that must"
- "other/password_generator.py:45:19 generalised U # random is a generalised function for letters"
- "other/scoring_algorithm.py:2:15 markmelnic U developed by: markmelnic"
- "other/scoring_algorithm.py:5:34 percentual U using a range based percentual proximity algorithm"
- "other/scoring_algorithm.py:26:5 procentual U def procentual_proximity("
- "other/scoring_algorithm.py:50:9 dlist U for dlist, weight in zip(data"
- "other/scoring_algorithm.py:52:9 maxd U maxd = max(dlist)"
- "other/scoring_algorithm.py:80:12 slist U for i, slist in enumerate(score_lists"
- "other/sdes.py:36:11 sbox U def apply_sbox(s, data):"
- "other/sdes.py:97:29 decypting U print(\"Plain text after decypting is:\", PT)"
- "physics/n_body_simulation.py:248:41 blit U interval=INTERVAL, blit=True"
- "physics/newtons_second_law_of_motion.py:14:14 Fnet U Formulation: Fnet = m • a"
- "project_euler/problem_001/sol4.py:27:5 xmulti U xmulti = []"
- "project_euler/problem_001/sol4.py:28:5 zmulti U zmulti = []"
- "project_euler/problem_005/sol1.py:57:9 nfound U nfound = 0"
- "project_euler/problem_011/sol1.py:43:13 horz U horzProduct = grid[i][j]"
- "project_euler/problem_014/sol2.py:30:1 COLLATZ U COLLATZ_SEQUENCE_LENGTHS ="
- "project_euler/problem_020/sol1.py:48:5 nfact U nfact = factorial(num)"
- "project_euler/problem_023/sol1.py:31:8 Divs U sumDivs = [1] * (limit + 1)"
- "project_euler/problem_023/sol1.py:38:5 abundants U abundants = set()"
- "project_euler/problem_035/sol1.py:14:27 Seive U 1 million using the Seive of Eratosthenes. Then"
- "project_euler/problem_035/sol1.py:20:1 seive U seive = [True] * 1000001"
- "project_euler/problem_037/sol1.py:6:54 truncatable U primes that are both truncatable from left to right"
- "project_euler/problem_038/sol1.py:21:61 concactenation U the solution will be a concactenation of"
- "project_euler/problem_039/sol1.py:8:57 maximised U number of solutions maximised?"
- "project_euler/problem_044/sol1.py:11:37 minimised U and D = |Pk − Pj| is minimised; what is the value of"
- "project_euler/problem_045/sol1.py:11:5 trinagle U All trinagle numbers are hexagonal"
- "project_euler/problem_047/sol1.py:2:1 Combinatoric U Combinatoric selections"
- "project_euler/problem_050/sol1.py:23:14 Erotosthenes U Sieve of Erotosthenes"
- "project_euler/problem_050/sol1.py:55:42 celing U biggest prime, below the celing, that can be written"
- "project_euler/problem_054/sol1.py:114:50 ueen U 9, T(en), J(ack), Q(ueen), K(ing), A(ce)"
- "project_euler/problem_054/sol1.py:117:11 pades U S(pades), H(earts), D(iamonds"
- "project_euler/problem_054/sol1.py:117:21 earts U S(pades), H(earts), D(iamonds), C(lubs"
- "project_euler/problem_054/sol1.py:117:31 iamonds U pades), H(earts), D(iamonds), C(lubs)"
- "project_euler/problem_054/sol1.py:117:43 lubs U earts), D(iamonds), C(lubs)"
- "project_euler/problem_054/sol1.py:145:53 Stright U 2H 3H 4H 5H 6H\") # Stright flush"
- "project_euler/problem_054/test_poker_hand.py:140:11 oppo U play, oppo = randrange(len(SORTED"
- "project_euler/problem_055/sol1.py:2:1 Lychrel U Lychrel numbers"
- "project_euler/problem_055/sol1.py:58:30 lychrel U Returns the count of all lychrel numbers below limit"
- "project_euler/problem_059/sol1.py:92:30 asfla U filter_common_word(['asfla adf', 'I am here',"
- "project_euler/problem_059/sol1.py:94:30 athla U filter_common_word(['athla amf', 'I am here',"
- "project_euler/problem_065/sol1.py:14:21 convergents U Let us consider the convergents for sqrt(2)."
- "project_euler/problem_087/sol1.py:42:17 tetr U tetr = prime3 * prime3 *"
- "project_euler/problem_089/sol1.py:13:1 VVIIIIII U VVIIIIII"
- "project_euler/problem_089/sol1.py:15:1 VVVI U VVVI"
- "project_euler/problem_091/sol1.py:5:43 ΔOPQ U origin, O(0,0), to form ΔOPQ."
- "project_euler/problem_107/sol1.py:16:28 optimise U However, it is possible to optimise the network by removing"
- "project_euler/problem_107/sol1.py:111:5 adjaceny U adjaceny_matrix = [line.split"
- "project_euler/problem_113/sol1.py:50:16 upto U def non_bouncy_upto(n: int) -> int:"
- "project_euler/problem_113/sol1.py:65:5 Caclulate U Caclulate the number of non-bouncy"
- "project_euler/problem_135/sol1.py:45:52 divisble U difference % 4: # d must be divisble by 4"
- "project_euler/problem_180/sol1.py:40:75 uniquq U <= 0. We use a set \"uniquq_s\""
- "project_euler/problem_188/sol1.py:23:6 modexpt U def _modexpt(base: int, exponent"
- "project_euler/problem_188/sol1.py:58:39 assiciative U base↑↑height by right-assiciative repeated modular"
- "project_euler/problem_191/sol1.py:15:6 OOOA U OOOO OOOA OOOL OOAO OOAA OOAL"
- "project_euler/problem_191/sol1.py:15:11 OOOL U OOOO OOOA OOOL OOAO OOAA OOAL OOLO"
- "project_euler/problem_191/sol1.py:15:16 OOAO U OOOO OOOA OOOL OOAO OOAA OOAL OOLO OOLA"
- "project_euler/problem_191/sol1.py:15:21 OOAA U OOOO OOOA OOOL OOAO OOAA OOAL OOLO OOLA OAOO"
- "project_euler/problem_191/sol1.py:15:26 OOAL U OOOA OOOL OOAO OOAA OOAL OOLO OOLA OAOO OAOA"
- "project_euler/problem_191/sol1.py:15:31 OOLO U OOOL OOAO OOAA OOAL OOLO OOLA OAOO OAOA"
- "project_euler/problem_191/sol1.py:15:36 OOLA U OOAO OOAA OOAL OOLO OOLA OAOO OAOA"
- "project_euler/problem_191/sol1.py:15:41 OAOO U OOAA OOAL OOLO OOLA OAOO OAOA"
- "project_euler/problem_191/sol1.py:15:46 OAOA U OOAL OOLO OOLA OAOO OAOA"
- "project_euler/problem_191/sol1.py:16:1 OAOL U OAOL OAAO OAAL OALO OALA"
- "project_euler/problem_191/sol1.py:16:6 OAAO U OAOL OAAO OAAL OALO OALA OLOO"
- "project_euler/problem_191/sol1.py:16:11 OAAL U OAOL OAAO OAAL OALO OALA OLOO OLOA"
- "project_euler/problem_191/sol1.py:16:16 OALO U OAOL OAAO OAAL OALO OALA OLOO OLOA OLAO"
- "project_euler/problem_191/sol1.py:16:21 OALA U OAOL OAAO OAAL OALO OALA OLOO OLOA OLAO OLAA"
- "project_euler/problem_191/sol1.py:16:26 OLOO U OAAO OAAL OALO OALA OLOO OLOA OLAO OLAA AOOO"
- "project_euler/problem_191/sol1.py:16:31 OLOA U OAAL OALO OALA OLOO OLOA OLAO OLAA AOOO"
- "project_euler/problem_191/sol1.py:16:36 OLAO U OALO OALA OLOO OLOA OLAO OLAA AOOO"
- "project_euler/problem_191/sol1.py:16:41 OLAA U OALA OLOO OLOA OLAO OLAA AOOO"
- "project_euler/problem_191/sol1.py:16:46 AOOO U OLOO OLOA OLAO OLAA AOOO"
- "project_euler/problem_191/sol1.py:17:1 AOOA U AOOA AOOL AOAO AOAA AOAL"
- "project_euler/problem_191/sol1.py:17:6 AOOL U AOOA AOOL AOAO AOAA AOAL AOLO"
- "project_euler/problem_191/sol1.py:17:11 AOAO U AOOA AOOL AOAO AOAA AOAL AOLO AOLA"
- "project_euler/problem_191/sol1.py:17:16 AOAA U AOOA AOOL AOAO AOAA AOAL AOLO AOLA AAOO"
- "project_euler/problem_191/sol1.py:17:21 AOAL U AOOA AOOL AOAO AOAA AOAL AOLO AOLA AAOO AAOA"
- "project_euler/problem_191/sol1.py:17:26 AOLO U AOOL AOAO AOAA AOAL AOLO AOLA AAOO AAOA AAOL"
- "project_euler/problem_191/sol1.py:17:31 AOLA U AOAO AOAA AOAL AOLO AOLA AAOO AAOA AAOL"
- "project_euler/problem_191/sol1.py:17:36 AAOO U AOAA AOAL AOLO AOLA AAOO AAOA AAOL"
- "project_euler/problem_191/sol1.py:17:41 AAOA U AOAL AOLO AOLA AAOO AAOA AAOL"
- "project_euler/problem_191/sol1.py:17:46 AAOL U AOLO AOLA AAOO AAOA AAOL"
- "project_euler/problem_191/sol1.py:18:1 AALO U AALO AALA ALOO ALOA ALAO"
- "project_euler/problem_191/sol1.py:18:6 AALA U AALO AALA ALOO ALOA ALAO ALAA"
- "project_euler/problem_191/sol1.py:18:11 ALOO U AALO AALA ALOO ALOA ALAO ALAA LOOO"
- "project_euler/problem_191/sol1.py:18:16 ALOA U AALO AALA ALOO ALOA ALAO ALAA LOOO LOOA"
- "project_euler/problem_191/sol1.py:18:21 ALAO U AALO AALA ALOO ALOA ALAO ALAA LOOO LOOA LOAO"
- "project_euler/problem_191/sol1.py:18:26 ALAA U AALA ALOO ALOA ALAO ALAA LOOO LOOA LOAO LOAA"
- "project_euler/problem_191/sol1.py:18:31 LOOO U ALOO ALOA ALAO ALAA LOOO LOOA LOAO LOAA"
- "project_euler/problem_191/sol1.py:18:36 LOOA U ALOA ALAO ALAA LOOO LOOA LOAO LOAA"
- "project_euler/problem_191/sol1.py:18:41 LOAO U ALAO ALAA LOOO LOOA LOAO LOAA"
- "project_euler/problem_191/sol1.py:18:46 LOAA U ALAA LOOO LOOA LOAO LOAA"
- "project_euler/problem_191/sol1.py:19:1 LAOO U LAOO LAOA LAAO"
- "project_euler/problem_191/sol1.py:19:6 LAOA U LAOO LAOA LAAO"
- "project_euler/problem_191/sol1.py:19:11 LAAO U LAOO LAOA LAAO"
- "project_euler/problem_191/sol1.py:82:11 ontime U state_ontime = _calculate(days -"
- "project_euler/problem_493/sol1.py:6:62 bcdefghij U the decimal point (a.bcdefghij)."
- "project_euler/problem_493/sol1.py:12:51 cominations U of possible picking cominations"
- "project_euler/problem_493/sol1.py:13:18 binom U [combinations := binom_coeff(70, 20)]"
- "project_euler/problem_551/sol1.py:35:20 calulcated U Term are calulcated until c > 10^k or the"
- "project_euler/README.md:66:4 Stackoverflow U - [Stackoverflow link]"
- "project_euler/README.md:81:6 Doctest U [Doctest]"
- "quantum/deutsch_jozsa.py:3:9 Josza U Deutsch-Josza Algorithm is one of"
- "quantum/deutsch_jozsa.py:25:8 qiskit U import qiskit as q"
- "quantum/deutsch_jozsa.py:28:30 qubits U oracle(case: str, num_qubits: int) -> q.QuantumCircuit"
- "quantum/deutsch_jozsa.py:35:23 qubit U # plus one output qubit"
- "quantum/deutsch_jozsa.py:40:62 CNOTs U that tells us which CNOTs to"
- "quantum/deutsch_jozsa.py:46:11 correspopnds U # correspopnds to a qubit, if the digit"
- "quantum/deutsch_jozsa.py:75:26 Deustch U Returns the complete Deustch-Jozsa Quantum Circuit"
- "quantum/deutsch_jozsa.py:76:41 Hadamard U Output registers and Hadamard & Measurement Gates"
- "quantum/deutsch_jozsa.py:98:13 jozsa U def deutsch_jozsa(case: str, num_qubits"
- "quantum/deutsch_jozsa.py:107:11 Aer's U # Use Aer's qasm_simulator"
- "quantum/deutsch_jozsa.py:107:17 qasm U # Use Aer's qasm_simulator"
- "quantum/half_adder.py:38:11 cnots U # use cnots to write XOR of the"
- "quantum/half_adder.py:42:17 toffoli U # use ccx / toffoli gate to write AND of"
- "quantum/not_gate.py:6:1 Qiskit U Qiskit Docs: https://qiskit"
- "quantum/not_gate.py:25:29 Qubits U Apply X (NOT) Gate to Qubits 0 & 1"
- "quantum/quantum_entanglement.py:42:22 CNOT U # Adding CX (CNOT) gate"
- "quantum/README.md:8:3 Rigetti U * Rigetti: https://rigetti.com"
- "quantum/ripple_adder_classic.py:72:50 hadamard'd U from doing this with hadamard'd bits :)"
- "scheduling/shortest_job_first.py:32:5 minm U minm = 999999999"
- "scheduling/shortest_job_first.py:63:13 finar U finar = finish_time - arrival"
- "scheduling/shortest_job_first.py:138:5 fcfs U fcfs = pd.DataFrame("
- "scripts/build_directory_md.py:15:59 ipynb U filename)[1] in (\".py\", \".ipynb\"):"
- "scripts/validate_filenames.py:27:1 nodir U nodir_files = [file for file"
- "searches/fibonacci_search.py:109:13 fibb U fibb_k = i"
- "sorts/bitonic_sort.py:40:5 bitonic U def bitonic_merge(array: list[int"
- "sorts/bogo_sort.py:2:45 bogosort U implementation of the bogosort algorithm,"
- "sorts/bogo_sort.py:4:1 Bogosort U Bogosort generates random permutations"
- "sorts/bogo_sort.py:9:22 bogo U python -m doctest -v bogo_sort.py"
- "sorts/comb_sort.py:3:75 Wlodzimierz U originally designed by Wlodzimierz"
- "sorts/comb_sort.py:4:1 Dobosiewicz U Dobosiewicz in 1980. It was rediscovered"
- "sorts/counting_sort.py:62:6 eghhiiinrsssttt U 'eghhiiinrsssttt'"
- "sorts/external_sort.py:85:9 unshift U def unshift(self, index):"
- "sorts/gnome_sort.py:34:8 Gadeimnoprstu U ' !Gadeimnoprstu'"
- "sorts/iterative_merge_sort.py:3:9 Aman U Author: Aman Gupta"
- "sorts/msd_radix_sort.py:79:5 Inplace U Inplace implementation of the"
- "sorts/natural_sort.py:27:9 alphanum U def alphanum_key(key):"
- "sorts/normal_distribution_quick_sort.md:13:12 numpy U >>> import numpy as np"
- "sorts/normal_distribution_quick_sort.md:14:10 tempfile U >>> from tempfile import TemporaryFile"
- "sorts/normal_distribution_quick_sort.md:15:5 outfile U >>> outfile = TemporaryFile()"
- "sorts/normal_distribution_quick_sort.md:33:97 linewidth U / (2 * sigma**2) ),linewidth=2, color='r')"
- "sorts/normal_distribution_quick_sort.md:47:12 matplotlib U >>> import matplotlib.pyplot as plt"
- "sorts/quick_sort_3_partition.py:21:16 lomuto U def quick_sort_lomuto_partition(sorting: list"
- "sorts/quick_sort_3_partition.py:24:10 Lomuto U with Lomuto partition scheme:"
- "sorts/shell_sort.py:19:7 Marcin U # Marcin Ciura's gap sequence"
- "sorts/shell_sort.py:19:14 Ciura's U # Marcin Ciura's gap sequence"
- "sorts/slowsort.py:5:53 Stolfi U Andrei Broder and Jorge Stolfi"
- "sorts/slowsort.py:6:40 Simplexity U Pessimal Algorithms and Simplexity Analysis"
- "strings/aho_corasick.py:8:14 adlist U self.adlist: list[dict] = list("
- "strings/alternative_string_arrange.py:8:6 AXBYCD U 'AXBYCD'"
- "strings/alternative_string_arrange.py:10:6 XAYBCD U 'XAYBCD'"
- "strings/alternative_string_arrange.py:12:6 AXBYZ U 'AXBYZ'"
- "strings/anagrams.py:11:6 estt U 'estt'"
- "strings/anagrams.py:13:9 aehiisssttt U ' aehiisssttt'"
- "strings/anagrams.py:15:6 aefilnstt U 'aefilnstt'"
- "strings/anagrams.py:29:17 bysig U return word_bysig[signature(my_word)]"
- "strings/can_string_be_rearranged_as_palindrome.py:1:14 susmith U # Created by susmith98"
- "strings/can_string_be_rearranged_as_palindrome.py:17:57 Momo U palindrome_counter(\"Momo\")"
- "strings/detecting_english_programmatically.py:48:20 llold U >>> isEnglish('llold HorWd')"
- "strings/frequency_finder.py:32:1 ETAOIN U ETAOIN = \"ETAOINSHRDLCUMWFGYPBVKJXQZ"
- "strings/frequency_finder.py:32:11 ETAOINSHRDLCUMWFGYPBVKJXQZ U ETAOIN = \"ETAOINSHRDLCUMWFGYPBVKJXQZ\""
- "strings/is_contains_unique_chars.py:10:11 compexity U Space compexity: O(1) 19320 bytes as"
- "strings/jaro_winkler.py:4:5 jaro U def jaro_winkler(str1: str, str"
- "strings/jaro_winkler.py:4:10 winkler U def jaro_winkler(str1: str, str2: str"
- "strings/jaro_winkler.py:10:33 marhta U jaro_winkler(\"martha\", \"marhta\")"
- "strings/jaro_winkler.py:14:31 dbdbdbdb U jaro_winkler(\"test\", \"dbdbdbdb\")"
- "strings/knuth_morris_pratt.py:62:14 alskfjaldsabc U text1 = \"alskfjaldsabc1abc1abc12k23adsfabcabc"
- "strings/knuth_morris_pratt.py:62:40 adsfabcabc U alskfjaldsabc1abc1abc12k23adsfabcabc\""
- "strings/knuth_morris_pratt.py:63:14 alskfjaldsk U text2 = \"alskfjaldsk23adsfabcabc\""
- "strings/knuth_morris_pratt.py:67:16 ABABX U pattern = \"ABABX\""
- "strings/knuth_morris_pratt.py:68:13 ABABZABABYABABX U text = \"ABABZABABYABABX\""
- "strings/knuth_morris_pratt.py:72:16 AAAB U pattern = \"AAAB\""
- "strings/knuth_morris_pratt.py:73:13 ABAAAAAB U text = \"ABAAAAAB\""
- "strings/knuth_morris_pratt.py:77:16 abcdabcy U pattern = \"abcdabcy\""
- "strings/knuth_morris_pratt.py:78:13 abcxabcdabxabcdabcdabcy U text = \"abcxabcdabxabcdabcdabcy\""
- "strings/knuth_morris_pratt.py:82:16 aabaabaaa U pattern = \"aabaabaaa\""
- "strings/lower.py:8:6 hellzo U 'hellzo'"
- "strings/manacher.py:4:6 abbba U 'abbba'"
- "strings/manacher.py:5:29 ababa U palindromic_string('ababa')"
- "strings/naive_string_search.py:14:31 ABAAABCDBBABCDDEBCABC U naive_pattern_search(\"ABAAABCDBBABCDDEBCABC\", \"ABC\")"
- "strings/naive_string_search.py:22:31 ABCDEGFTEST U naive_pattern_search(\"ABCDEGFTEST\", \"TEST\")"
- "strings/ngram.py:6:12 ngram U def create_ngram(sentence: str, ngram"
- "strings/ngram.py:8:12 ngrams U Create ngrams from a sentence"
- "strings/prefix_function.py:22:26 aabcdaabc U >> prefix_function(\"aabcdaabc\")"
- "strings/prefix_function.py:24:26 asdasdad U >> prefix_function(\"asdasdad\")"
- "strings/prefix_function.py:54:25 abcab U >>> longest_prefix(\"abcab\")"
- "strings/rabin_karp.py:7:11 karp U def rabin_karp(pattern: str, text:"
- "strings/rabin_karp.py:82:13 Lüsai U text = \"Lüsai\""
- "strings/reverse_letters.py:7:10 kciuq U 'ehT kciuq nworb xof depmuj revo"
- "strings/reverse_letters.py:7:16 nworb U 'ehT kciuq nworb xof depmuj revo eht"
- "strings/reverse_letters.py:7:26 depmuj U ehT kciuq nworb xof depmuj revo eht yzal .god'"
- "strings/reverse_letters.py:7:33 revo U kciuq nworb xof depmuj revo eht yzal .god'"
- "strings/reverse_letters.py:7:42 yzal U xof depmuj revo eht yzal .god'"
- "strings/reverse_letters.py:9:9 siht U 'sI siht ?eurt'"
- "strings/reverse_letters.py:9:15 eurt U 'sI siht ?eurt'"
- "strings/reverse_letters.py:11:8 evol U 'I evol nohtyP'"
- "strings/reverse_letters.py:11:13 nohty U 'I evol nohtyP'"
- "strings/reverse_long_words.py:5:33 wollef U reverse_long_words(\"Hey wollef sroirraw\")"