-
-
Notifications
You must be signed in to change notification settings - Fork 84
/
snapshot.txt
924 lines (923 loc) · 97.8 KB
/
snapshot.txt
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
Repository: TheAlgorithms/Python
Url: "https://github.com/TheAlgorithms/Python.git"
Args: ["**/*.{md,py}"]
Lines:
CSpell: Files checked: 777, Issues found: 2556 in 403 files
exit code: 1
./CONTRIBUTING.md:131:33 - Unknown word (pytest) -- doctests will be run by pytest as part of our automated
./CONTRIBUTING.md:134:14 - Unknown word (doctest) -- python3 -m doctest -v my_submission.py
./CONTRIBUTING.md:142:11 - Unknown word (eval) -- input = eval(input("Enter your input
./CONTRIBUTING.md:151:171 - Unknown word (mypy) -- automated testing will run [mypy](http://mypy-lang.org
./CONTRIBUTING.md:173:79 - Unknown word (autogenerated) -- will be periodically autogenerated by our Travis CI processes
./CONTRIBUTING.md:182:10 - Unknown word (poyea) -- Writer [@poyea](https://github.com
./CONTRIBUTING.md:46:8 - Unknown word (docstrings) -- * have docstrings with clear explanations
./CONTRIBUTING.md:47:11 - Unknown word (doctests) -- * contain doctests that test both valid
./CONTRIBUTING.md:5:339 - Unknown word (Gitter) -- ask the community in [Gitter](https://gitter.im/TheAlgorit
./CONTRIBUTING.md:77:334 - Unknown word (autopep) -- other code formatters (autopep8, yapf) but the __black
./CONTRIBUTING.md:77:344 - Unknown word (yapf) -- formatters (autopep8, yapf) but the __black__ formatter
./DIRECTORY.md:129:8 - Unknown word (Fenwick) -- * [Fenwick Tree](https://github
./DIRECTORY.md:181:8 - Unknown word (Dijkstras) -- * [Dijkstras Two Stack Algorithm
./DIRECTORY.md:208:8 - Unknown word (Sobel) -- * [Sobel Filter](https://github
./DIRECTORY.md:227:10 - Unknown word (Subarray) -- * [Max Subarray Sum](https://github
./DIRECTORY.md:228:6 - Unknown word (Mergesort) -- * [Mergesort](https://github.com
./DIRECTORY.md:231:6 - Unknown word (Strassen) -- * [Strassen Matrix Multiplication
./DIRECTORY.md:235:6 - Unknown word (Bitmask) -- * [Bitmask](https://github.com
./DIRECTORY.md:242:12 - Unknown word (Warshall) -- * [Floyd Warshall](https://github.com
./DIRECTORY.md:246:24 - Unknown word (Submasks) -- [Iterating Through Submasks](https://github.com
./DIRECTORY.md:250:39 - Unknown word (Nlogn) -- Increasing Subsequence O(Nlogn)](https://github.com
./DIRECTORY.md:291:6 - Unknown word (Bezier) -- * [Bezier Curve](https://github
./DIRECTORY.md:29:19 - Unknown word (Setbits) -- * [Binary Count Setbits](https://github.com
./DIRECTORY.md:314:6 - Unknown word (Dinic) -- * [Dinic](https://github.com
./DIRECTORY.md:316:14 - Unknown word (Karp) -- * [Edmonds Karp Multiple Source And
./DIRECTORY.md:316:6 - Unknown word (Edmonds) -- * [Edmonds Karp Multiple Source
./DIRECTORY.md:317:6 - Unknown word (Eulerian) -- * [Eulerian Path And Circuit For
./DIRECTORY.md:322:11 - Unknown word (Shapley) -- * [Gale Shapley Bigraph](https://github
./DIRECTORY.md:322:19 - Unknown word (Bigraph) -- * [Gale Shapley Bigraph](https://github.com
./DIRECTORY.md:327:6 - Unknown word (Kahns) -- * [Kahns Algorithm Long](https
./DIRECTORY.md:328:22 - Unknown word (Topo) -- * [Kahns Algorithm Topo](https://github.com
./DIRECTORY.md:329:6 - Unknown word (Karger) -- * [Karger](https://github.com
./DIRECTORY.md:331:28 - Unknown word (Boruvka) -- Minimum Spanning Tree Boruvka](https://github.com
./DIRECTORY.md:332:28 - Unknown word (Kruskal) -- Minimum Spanning Tree Kruskal](https://github.com
./DIRECTORY.md:336:22 - Unknown word (Astar) -- * [Multi Heuristic Astar](https://github.com
./DIRECTORY.md:339:10 - Unknown word (Kosaraju) -- * [Scc Kosaraju](https://github.com
./DIRECTORY.md:341:6 - Unknown word (Tarjans) -- * [Tarjans Scc](https://github
./DIRECTORY.md:353:6 - Unknown word (Sdbm) -- * [Sdbm](https://github.com
./DIRECTORY.md:367:8 - Unknown word (Polynom) -- * [Polynom For Points](https:/
./DIRECTORY.md:382:14 - Unknown word (Clust) -- * [K Means Clust](https://github.com
./DIRECTORY.md:383:16 - Unknown word (Neighbours) -- * [K Nearest Neighbours](https://github.com
./DIRECTORY.md:384:10 - Unknown word (Sklearn) -- * [Knn Sklearn](https://github.com
./DIRECTORY.md:388:5 - Unknown word (Lstm) -- * Lstm
./DIRECTORY.md:390:17 - Unknown word (Perceptron) -- * [Multilayer Perceptron Classifier](https:/
./DIRECTORY.md:391:6 - Unknown word (Polymonial) -- * [Polymonial Regression](https:/
./DIRECTORY.md:414:13 - Unknown word (Borwein) -- * [Bailey Borwein Plouffe](https://github
./DIRECTORY.md:414:21 - Unknown word (Plouffe) -- * [Bailey Borwein Plouffe](https://github.com
./DIRECTORY.md:424:6 - Unknown word (Chudnovsky) -- * [Chudnovsky Algorithm](https://github
./DIRECTORY.md:425:6 - Unknown word (Collatz) -- * [Collatz Sequence](https://github
./DIRECTORY.md:432:13 - Unknown word (Totient) -- * [Eulers Totient](https://github.com
./DIRECTORY.md:432:6 - Unknown word (Eulers) -- * [Eulers Totient](https://github
./DIRECTORY.md:450:12 - Unknown word (Ramanujanalgo) -- * [Hardy Ramanujanalgo](https://github.com
./DIRECTORY.md:453:6 - Unknown word (Jaccard) -- * [Jaccard Similarity](https:/
./DIRECTORY.md:454:6 - Unknown word (Kadanes) -- * [Kadanes](https://github.com
./DIRECTORY.md:455:6 - Unknown word (Karatsuba) -- * [Karatsuba](https://github.com
./DIRECTORY.md:456:6 - Unknown word (Krishnamurthy) -- * [Krishnamurthy Number](https://github
./DIRECTORY.md:45:15 - Unknown word (Cluskey) -- * [Quine Mc Cluskey](https://github.com
./DIRECTORY.md:462:12 - Unknown word (Lehmer) -- * [Lucas Lehmer Primality Test](https
./DIRECTORY.md:468:6 - Unknown word (Mobius) -- * [Mobius Function](https://github
./DIRECTORY.md:485:6 - Unknown word (Primelib) -- * [Primelib](https://github.com
./DIRECTORY.md:48:6 - Unknown word (Conways) -- * [Conways Game Of Life](https
./DIRECTORY.md:491:6 - Unknown word (Relu) -- * [Relu](https://github.com
./DIRECTORY.md:492:12 - Unknown word (Kutta) -- * [Runge Kutta](https://github.com
./DIRECTORY.md:492:6 - Unknown word (Runge) -- * [Runge Kutta](https://github
./DIRECTORY.md:503:6 - Unknown word (Softmax) -- * [Softmax](https://github.com
./DIRECTORY.md:515:6 - Unknown word (Zellers) -- * [Zellers Congruence](https:/
./DIRECTORY.md:531:11 - Unknown word (Fulkerson) -- * [Ford Fulkerson](https://github.com
./DIRECTORY.md:542:19 - Unknown word (Logemann) -- * [Davis–Putnam–Logemann–Loveland](https://github
./DIRECTORY.md:542:28 - Unknown word (Loveland) -- Davis–Putnam–Logemann–Loveland](https://github.com
./DIRECTORY.md:551:13 - Unknown word (Congruential) -- * [Linear Congruential Generator](https://github
./DIRECTORY.md:553:6 - Unknown word (Magicdiamondpattern) -- * [Magicdiamondpattern](https://github.com
./DIRECTORY.md:557:6 - Unknown word (Sdes) -- * [Sdes](https://github.com
./DIRECTORY.md:55:6 - Unknown word (Atbash) -- * [Atbash](https://github.com
./DIRECTORY.md:63:6 - Unknown word (Cryptomath) -- * [Cryptomath Module](https://github
./DIRECTORY.md:68:6 - Unknown word (Elgamal) -- * [Elgamal Key Generator](https
./DIRECTORY.md:74:6 - Unknown word (Onepad) -- * [Onepad Cipher](https://github
./DIRECTORY.md:75:6 - Unknown word (Playfair) -- * [Playfair Cipher](https://github
./DIRECTORY.md:76:6 - Unknown word (Porta) -- * [Porta Cipher](https://github
./DIRECTORY.md:817:14 - Unknown word (Jozsa) -- * [Deutsch Jozsa](https://github.com
./DIRECTORY.md:817:6 - Unknown word (Deutsch) -- * [Deutsch Jozsa](https://github
./DIRECTORY.md:822:13 - Unknown word (Qubit) -- * [Single Qubit Measure](https://github
./DIRECTORY.md:848:6 - Unknown word (Bitonic) -- * [Bitonic Sort](https://github
./DIRECTORY.md:849:6 - Unknown word (Bogo) -- * [Bogo Sort](https://github
./DIRECTORY.md:86:6 - Unknown word (Trafid) -- * [Trafid Cipher](https://github
./DIRECTORY.md:885:6 - Unknown word (Slowsort) -- * [Slowsort](https://github.com
./DIRECTORY.md:895:10 - Unknown word (Corasick) -- * [Aho Corasick](https://github.com
./DIRECTORY.md:89:6 - Unknown word (Vigenere) -- * [Vigenere Cipher](https://github
./DIRECTORY.md:902:12 - Unknown word (Pangram) -- * [Check Pangram](https://github.com
./DIRECTORY.md:906:11 - Unknown word (Winkler) -- * [Jaro Winkler](https://github.com
./DIRECTORY.md:906:6 - Unknown word (Jaro) -- * [Jaro Winkler](https://github
./DIRECTORY.md:910:6 - Unknown word (Manacher) -- * [Manacher](https://github.com
./DIRECTORY.md:939:10 - Unknown word (Imdb) -- * [Get Imdb Top 250 Movies Csv]
./DIRECTORY.md:940:10 - Unknown word (Imdbtop) -- * [Get Imdbtop](https://github.com
./DIRECTORY.md:944:6 - Unknown word (Recaptcha) -- * [Recaptcha Verification](https
./README.md:2:4 - Unknown word (Gitpod) -- [ -- np.matrix, vector: np.ndarray) -> np.ndarray:
./arithmetic_analysis/gaussian_elimination.py:30:29 - Unknown word (dtype) -- np.zeros((rows, 1), dtype=float)
./arithmetic_analysis/gaussian_elimination.py:64:35 - Unknown word (astype) -- mat = augmented_mat.astype("float64")
./arithmetic_analysis/newton_forward_interpolation.py:49:5 - Unknown word (summ) -- summ = y[0][0]
./arithmetic_analysis/newton_forward_interpolation.py:8:5 - Unknown word (ucal) -- def ucal(u: float, p: int) -
./arithmetic_analysis/newton_raphson.py:12:12 - Unknown word (raphson) -- def newton_raphson(
./arithmetic_analysis/newton_raphson.py:1:23 - Unknown word (Raphson) -- Implementing Newton Raphson method in Python
./arithmetic_analysis/newton_raphson.py:2:11 - Unknown word (Syed) -- # Author: Syed Haseeb Shah (github
./arithmetic_analysis/newton_raphson.py:2:16 - Unknown word (Haseeb) -- # Author: Syed Haseeb Shah (github.com/QuantumNovic
./arithmetic_analysis/newton_raphson.py:6:23 - Unknown word (noqa) -- from math import * # noqa: F401, F403
./arithmetic_analysis/newton_raphson.py:9:6 - Unknown word (sympy) -- from sympy import diff
./arithmetic_analysis/secant_method.py:3:9 - Unknown word (dimgrichr) -- Author: dimgrichr
./backtracking/coloring.py:12:5 - Unknown word (neighbours) -- neighbours: List[int], colored
./backtracking/coloring.py:15:14 - Unknown word (neighbour) -- For each neighbour check if coloring constraint
./backtracking/coloring.py:48:8 - Unknown word (Itterates) -- 2. Itterates over each color:
./backtracking/coloring.py:53:18 - Unknown word (Uncolor) -- 2.5. Uncolor given vertex
./backtracking/hamiltonian_cycle.py:13:44 - Unknown word (curr) -- int]], next_ver: int, curr_ind: int, path: List
./backtracking/knight_tour.py:82:22 - Unknown word (Kight) -- ValueError: Open Kight Tour cannot be performed
./backtracking/n_queens.py:3:6 - Unknown word (nqueens) -- The nqueens problem is of placing
./backtracking/sum_of_subsets.py:12:29 - Unknown word (soln) -- generate_sum_of_subsets_soln(nums: List[int], max
./backtracking/sum_of_subsets.py:12:34 - Unknown word (nums) -- sum_of_subsets_soln(nums: List[int], max_sum
./blockchain/modular_division.py:12:55 - Unknown word (modn) -- 0≤x≤n−1, and b/a=x(modn) (that is, b=ax(modn
./boolean_algebra/quine_mc_cluskey.py:132:11 - Unknown word (implicant) -- def prime_implicant_chart(
./boolean_algebra/quine_mc_cluskey.py:160:18 - Unknown word (Implicants) -- print("Prime Implicants are:")
./boolean_algebra/quine_mc_cluskey.py:85:45 - Unknown word (implicants) -- List[List[int]], prime_implicants: List[str]) -> List
./cellular_automata/game_of_life.py:122:5 - Unknown word (cmap) -- cmap = ListedColormap(["w
./cellular_automata/game_of_life.py:1:41 - Unknown word (Kumar) -- Life, Author Anurag Kumar(mailto:anuragkumarak
./cellular_automata/game_of_life.py:34:24 - Unknown word (pyplot) -- from matplotlib import pyplot as plt
./cellular_automata/game_of_life.py:76:19 - Unknown word (tolist) -- return canvas.tolist()
./ciphers/a1z26.py:12:17 - Unknown word (myname) -- >>> encode("myname")
./ciphers/affine_cipher.py:40:35 - Unknown word (Mpyx) -- I}p~{HL}Gp{vp pFsH}pxMpyxIx JHL O}F{~pvuOvF{FuF
./ciphers/affine_cipher.py:7:42 - Unknown word (ABCDEFGHIJKLMNOPQRSTUVWXYZ) -- -./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`"""
./ciphers/affine_cipher.py:8:9 - Unknown word (abcdefghijklmnopqrstuvwxyz) -- r"""abcdefghijklmnopqrstuvwxyz{|}~"""
./ciphers/atbash.py:42:10 - Unknown word (timeit) -- from timeit import timeit
./ciphers/atbash.py:5:5 - Unknown word (atbash) -- def atbash_slow(sequence: str)
./ciphers/atbash.py:8:6 - Unknown word (ZYXWVUT) -- 'ZYXWVUT'
./ciphers/base64_encoding.py:17:53 - Unknown word (Steganography) -- encoding can be used in Steganography to hide data in these
./ciphers/base64_encoding.py:21:44 - Unknown word (Hacktoberfest) -- pull request is part of Hacktoberfest20!"
./ciphers/beaufort_cipher.py:17:6 - Unknown word (SECRETSECRETSECRE) -- 'SECRETSECRETSECRE'
./ciphers/beaufort_cipher.py:2:15 - Unknown word (Radadiya) -- Author: Mohit Radadiya
./ciphers/beaufort_cipher.py:2:9 - Unknown word (Mohit) -- Author: Mohit Radadiya
./ciphers/beaufort_cipher.py:36:10 - Unknown word (PAYUWL) -- 'BDC PAYUWL JPAIYI'
./ciphers/beaufort_cipher.py:36:17 - Unknown word (JPAIYI) -- 'BDC PAYUWL JPAIYI'
./ciphers/brute_force_caesar_cipher.py:10:30 - Unknown word (NGXYNOR) -- Decryption using Key #6: NGXYNOR JGXPO
./ciphers/brute_force_caesar_cipher.py:10:38 - Unknown word (JGXPO) -- using Key #6: NGXYNOR JGXPO
./ciphers/brute_force_caesar_cipher.py:11:30 - Unknown word (MFWXMNQ) -- Decryption using Key #7: MFWXMNQ IFWON
./ciphers/brute_force_caesar_cipher.py:11:38 - Unknown word (IFWON) -- using Key #7: MFWXMNQ IFWON
./ciphers/brute_force_caesar_cipher.py:12:30 - Unknown word (LEVWLMP) -- Decryption using Key #8: LEVWLMP HEVNM
./ciphers/brute_force_caesar_cipher.py:12:38 - Unknown word (HEVNM) -- using Key #8: LEVWLMP HEVNM
./ciphers/brute_force_caesar_cipher.py:13:30 - Unknown word (KDUVKLO) -- Decryption using Key #9: KDUVKLO GDUML
./ciphers/brute_force_caesar_cipher.py:13:38 - Unknown word (GDUML) -- using Key #9: KDUVKLO GDUML
./ciphers/brute_force_caesar_cipher.py:14:31 - Unknown word (JCTUJKN) -- Decryption using Key #10: JCTUJKN FCTLK
./ciphers/brute_force_caesar_cipher.py:14:39 - Unknown word (FCTLK) -- using Key #10: JCTUJKN FCTLK
./ciphers/brute_force_caesar_cipher.py:15:31 - Unknown word (IBSTIJM) -- Decryption using Key #11: IBSTIJM EBSKJ
./ciphers/brute_force_caesar_cipher.py:15:39 - Unknown word (EBSKJ) -- using Key #11: IBSTIJM EBSKJ
./ciphers/brute_force_caesar_cipher.py:16:31 - Unknown word (HARSHIL) -- Decryption using Key #12: HARSHIL DARJI
./ciphers/brute_force_caesar_cipher.py:16:39 - Unknown word (DARJI) -- using Key #12: HARSHIL DARJI
./ciphers/brute_force_caesar_cipher.py:17:31 - Unknown word (GZQRGHK) -- Decryption using Key #13: GZQRGHK CZQIH
./ciphers/brute_force_caesar_cipher.py:17:39 - Unknown word (CZQIH) -- using Key #13: GZQRGHK CZQIH
./ciphers/brute_force_caesar_cipher.py:18:31 - Unknown word (FYPQFGJ) -- Decryption using Key #14: FYPQFGJ BYPHG
./ciphers/brute_force_caesar_cipher.py:18:39 - Unknown word (BYPHG) -- using Key #14: FYPQFGJ BYPHG
./ciphers/brute_force_caesar_cipher.py:19:31 - Unknown word (EXOPEFI) -- Decryption using Key #15: EXOPEFI AXOGF
./ciphers/brute_force_caesar_cipher.py:19:39 - Unknown word (AXOGF) -- using Key #15: EXOPEFI AXOGF
./ciphers/brute_force_caesar_cipher.py:20:31 - Unknown word (DWNODEH) -- Decryption using Key #16: DWNODEH ZWNFE
./ciphers/brute_force_caesar_cipher.py:20:39 - Unknown word (ZWNFE) -- using Key #16: DWNODEH ZWNFE
./ciphers/brute_force_caesar_cipher.py:21:31 - Unknown word (CVMNCDG) -- Decryption using Key #17: CVMNCDG YVMED
./ciphers/brute_force_caesar_cipher.py:21:39 - Unknown word (YVMED) -- using Key #17: CVMNCDG YVMED
./ciphers/brute_force_caesar_cipher.py:22:31 - Unknown word (BULMBCF) -- Decryption using Key #18: BULMBCF XULDC
./ciphers/brute_force_caesar_cipher.py:22:39 - Unknown word (XULDC) -- using Key #18: BULMBCF XULDC
./ciphers/brute_force_caesar_cipher.py:23:31 - Unknown word (ATKLABE) -- Decryption using Key #19: ATKLABE WTKCB
./ciphers/brute_force_caesar_cipher.py:23:39 - Unknown word (WTKCB) -- using Key #19: ATKLABE WTKCB
./ciphers/brute_force_caesar_cipher.py:24:31 - Unknown word (ZSJKZAD) -- Decryption using Key #20: ZSJKZAD VSJBA
./ciphers/brute_force_caesar_cipher.py:24:39 - Unknown word (VSJBA) -- using Key #20: ZSJKZAD VSJBA
./ciphers/brute_force_caesar_cipher.py:25:31 - Unknown word (YRIJYZC) -- Decryption using Key #21: YRIJYZC URIAZ
./ciphers/brute_force_caesar_cipher.py:25:39 - Unknown word (URIAZ) -- using Key #21: YRIJYZC URIAZ
./ciphers/brute_force_caesar_cipher.py:26:31 - Unknown word (XQHIXYB) -- Decryption using Key #22: XQHIXYB TQHZY
./ciphers/brute_force_caesar_cipher.py:26:39 - Unknown word (TQHZY) -- using Key #22: XQHIXYB TQHZY
./ciphers/brute_force_caesar_cipher.py:27:31 - Unknown word (WPGHWXA) -- Decryption using Key #23: WPGHWXA SPGYX
./ciphers/brute_force_caesar_cipher.py:27:39 - Unknown word (SPGYX) -- using Key #23: WPGHWXA SPGYX
./ciphers/brute_force_caesar_cipher.py:28:31 - Unknown word (VOFGVWZ) -- Decryption using Key #24: VOFGVWZ ROFXW
./ciphers/brute_force_caesar_cipher.py:28:39 - Unknown word (ROFXW) -- using Key #24: VOFGVWZ ROFXW
./ciphers/brute_force_caesar_cipher.py:29:31 - Unknown word (UNEFUVY) -- Decryption using Key #25: UNEFUVY QNEWV
./ciphers/brute_force_caesar_cipher.py:29:39 - Unknown word (QNEWV) -- using Key #25: UNEFUVY QNEWV
./ciphers/brute_force_caesar_cipher.py:3:18 - Unknown word (TMDETUX) -- >>> decrypt('TMDETUX PMDVU')
./ciphers/brute_force_caesar_cipher.py:3:26 - Unknown word (PMDVU) -- >> decrypt('TMDETUX PMDVU')
./ciphers/brute_force_caesar_cipher.py:5:30 - Unknown word (SLCDSTW) -- Decryption using Key #1: SLCDSTW OLCUT
./ciphers/brute_force_caesar_cipher.py:5:38 - Unknown word (OLCUT) -- using Key #1: SLCDSTW OLCUT
./ciphers/brute_force_caesar_cipher.py:6:30 - Unknown word (RKBCRSV) -- Decryption using Key #2: RKBCRSV NKBTS
./ciphers/brute_force_caesar_cipher.py:6:38 - Unknown word (NKBTS) -- using Key #2: RKBCRSV NKBTS
./ciphers/brute_force_caesar_cipher.py:7:30 - Unknown word (QJABQRU) -- Decryption using Key #3: QJABQRU MJASR
./ciphers/brute_force_caesar_cipher.py:7:38 - Unknown word (MJASR) -- using Key #3: QJABQRU MJASR
./ciphers/brute_force_caesar_cipher.py:8:30 - Unknown word (PIZAPQT) -- Decryption using Key #4: PIZAPQT LIZRQ
./ciphers/brute_force_caesar_cipher.py:8:38 - Unknown word (LIZRQ) -- using Key #4: PIZAPQT LIZRQ
./ciphers/brute_force_caesar_cipher.py:9:30 - Unknown word (OHYZOPS) -- Decryption using Key #5: OHYZOPS KHYQP
./ciphers/brute_force_caesar_cipher.py:9:38 - Unknown word (KHYQP) -- using Key #5: OHYZOPS KHYQP
./ciphers/caesar_cipher.py:187:30 - Unknown word (IH'N) -- brute_force("jFyuMy xIH'N vLONy zILwy Gy!")[2
./ciphers/caesar_cipher.py:46:33 - Unknown word (Jgnnq) -- final message would be "Jgnnq, ecrvckp"
./ciphers/caesar_cipher.py:46:40 - Unknown word (ecrvckp) -- message would be "Jgnnq, ecrvckp"
./ciphers/caesar_cipher.py:55:11 - Unknown word (Cqks) -- 'bpm yCqks jzwEv nwF rCuxA wDmz
./ciphers/caesar_cipher.py:61:18 - Unknown word (fqumfgjy) -- 'f qtbjwhfxj fqumfgjy'
./ciphers/caesar_cipher.py:61:8 - Unknown word (qtbjwhfxj) -- 'f qtbjwhfxj fqumfgjy'
./ciphers/decrypt_caesar_with_chi_squared.py:10:10 - Unknown word (sensetive) -- case_sensetive: bool = False,
./ciphers/decrypt_caesar_with_chi_squared.py:113:24 - Unknown word (jhlzhy) -- ... 'dof pz aol jhlzhy jpwoly zv wvwbshy? pa
./ciphers/decrypt_caesar_with_chi_squared.py:113:31 - Unknown word (jpwoly) -- 'dof pz aol jhlzhy jpwoly zv wvwbshy? pa pz avv
./ciphers/decrypt_caesar_with_chi_squared.py:113:41 - Unknown word (wvwbshy) -- aol jhlzhy jpwoly zv wvwbshy? pa pz avv lhzf av jyhjr
./ciphers/decrypt_caesar_with_chi_squared.py:113:60 - Unknown word (lhzf) -- zv wvwbshy? pa pz avv lhzf av jyhjr!'
./ciphers/decrypt_caesar_with_chi_squared.py:113:68 - Unknown word (jyhjr) -- wvwbshy? pa pz avv lhzf av jyhjr!'
./ciphers/decrypt_caesar_with_chi_squared.py:118:42 - Unknown word (crybd) -- caesar_with_chi_squared('crybd cdbsxq')
./ciphers/decrypt_caesar_with_chi_squared.py:118:48 - Unknown word (cdbsxq) -- with_chi_squared('crybd cdbsxq')
./ciphers/decrypt_caesar_with_chi_squared.py:193:31 - Unknown word (excepcted) -- # Get the excepcted amount of times the
./ciphers/decrypt_caesar_with_chi_squared.py:57:18 - Unknown word (ifmmp) -- Cipher text: ifmmp
./ciphers/deterministic_miller_rabin.py:1:30 - Unknown word (bizzfitch) -- Created by Nathan Damon, @bizzfitch on github
./ciphers/diffie_hellman.py:1:22 - Unknown word (hexlify) -- from binascii import hexlify
./ciphers/diffie_hellman.py:3:16 - Unknown word (urandom) -- from os import urandom
./ciphers/diffie_hellman.py:5:40 - Unknown word (MODP) -- Modular Exponential (MODP) Diffie-Hellman groups
./ciphers/diffie_hellman.py:5:46 - Unknown word (Diffie) -- Modular Exponential (MODP) Diffie-Hellman groups for
./ciphers/elgamal_key_generator.py:66:21 - Unknown word (elgamal) -- make_key_files("elgamal", 2048)
./ciphers/enigma_machine2.py:108:5 - Unknown word (pbdict) -- pbdict = _plugboard(pb)
./ciphers/enigma_machine2.py:113:16 - Unknown word (pbstring) -- def _plugboard(pbstring: str) -> dict[str, str
./ciphers/enigma_machine2.py:11:5 - Unknown word (randnomly) -- - 9 randnomly generated rotors
./ciphers/enigma_machine2.py:142:5 - Unknown word (tmppbl) -- tmppbl = set()
./ciphers/enigma_machine2.py:183:7 - Unknown word (VKLEPDBGRNWTFCJOHQAMUZYIXS) -- | VKLEPDBGRNWTFCJOHQAMUZYIXS |
./ciphers/enigma_machine2.py:191:7 - Unknown word (ABCDEFGHIJKLM) -- | ABCDEFGHIJKLM | e.g. E is paired to
./ciphers/enigma_machine2.py:192:7 - Unknown word (ZYXWVUTSRQPON) -- | ZYXWVUTSRQPON | so when E goes in
./ciphers/enigma_machine2.py:201:12 - Unknown word (JUHHI) -- 'KORYH JUHHI!'
./ciphers/enigma_machine2.py:201:6 - Unknown word (KORYH) -- 'KORYH JUHHI!'
./ciphers/enigma_machine2.py:202:24 - Unknown word (juhhi) -- >>> enigma('KORYH, juhhi!', (1, 2, 1), plugb
./ciphers/enigma_machine2.py:205:12 - Unknown word (QWOBU) -- 'FPNCZ QWOBU!'
./ciphers/enigma_machine2.py:205:6 - Unknown word (FPNCZ) -- 'FPNCZ QWOBU!'
./ciphers/enigma_machine2.py:28:11 - Unknown word (EGZWVONAHDCLFQMSIPJBYUKXTR) -- rotor1 = "EGZWVONAHDCLFQMSIPJBYUKXTR"
./ciphers/enigma_machine2.py:29:11 - Unknown word (FOBHMDKEXQNRAULPGSJVTYICZW) -- rotor2 = "FOBHMDKEXQNRAULPGSJVTYICZW"
./ciphers/enigma_machine2.py:30:11 - Unknown word (ZJXESIUQLHAVRMDOYGTNFWPBKC) -- rotor3 = "ZJXESIUQLHAVRMDOYGTNFWPBKC"
./ciphers/enigma_machine2.py:62:11 - Unknown word (RMDJXFUWGISLHVTCQNKYPBEZOA) -- rotor4 = "RMDJXFUWGISLHVTCQNKYPBEZOA"
./ciphers/enigma_machine2.py:63:11 - Unknown word (SGLCPQWZHKXAREONTFBVIYJUDM) -- rotor5 = "SGLCPQWZHKXAREONTFBVIYJUDM"
./ciphers/enigma_machine2.py:64:11 - Unknown word (HVSICLTYKQUBXDWAJZOMFGPREN) -- rotor6 = "HVSICLTYKQUBXDWAJZOMFGPREN"
./ciphers/enigma_machine2.py:65:11 - Unknown word (RZWQHFMVDBKICJLNTUXAGYPSOE) -- rotor7 = "RZWQHFMVDBKICJLNTUXAGYPSOE"
./ciphers/enigma_machine2.py:66:11 - Unknown word (LFKIJODBEGAMQPXVUHYSTCZRWN) -- rotor8 = "LFKIJODBEGAMQPXVUHYSTCZRWN"
./ciphers/enigma_machine2.py:67:11 - Unknown word (KOAEGVDHXPQZMLFTYWJNBRCIUS) -- rotor9 = "KOAEGVDHXPQZMLFTYWJNBRCIUS"
./ciphers/enigma_machine2.py:71:29 - Unknown word (rotsel) -- rotpos: RotorPositionT, rotsel: RotorSelectionT, pb
./ciphers/enigma_machine2.py:81:26 - Unknown word (positon) -- param rotpos: rotor_positon
./ciphers/enigma_machine2.py:83:16 - Unknown word (plugb) -- :param pb: plugb -> validated and transformed
./ciphers/hill_cipher.py:116:10 - Unknown word (TESTINGHILLCIPHERR) -- 'TESTINGHILLCIPHERR'
./ciphers/hill_cipher.py:132:10 - Unknown word (WHXYJOLM) -- 'WHXYJOLM9C6XT085LL'
./ciphers/hill_cipher.py:63:21 - Unknown word (vectorize) -- modulus = numpy.vectorize(lambda x: x % 36)
./ciphers/mixed_keyword_cypher.py:20:6 - Unknown word (XKJGUFMJST) -- 'XKJGUFMJST'
./ciphers/mono_alphabetic_ciphers.py:10:28 - Unknown word (QWERTYUIOPASDFGHJKLZXCVBNM) -- translate_message("QWERTYUIOPASDFGHJKLZXCVBNM","Hello World","encrypt
./ciphers/mono_alphabetic_ciphers.py:11:12 - Unknown word (Bidsm) -- 'Pcssi Bidsm'
./ciphers/mono_alphabetic_ciphers.py:11:6 - Unknown word (Pcssi) -- 'Pcssi Bidsm'
./ciphers/mono_alphabetic_ciphers.py:42:12 - Unknown word (Vgksr) -- 'Itssg Vgksr'
./ciphers/mono_alphabetic_ciphers.py:42:6 - Unknown word (Itssg) -- 'Itssg Vgksr'
./ciphers/playfair_cipher.py:45:17 - Unknown word (ABCDEFGHIKLMNOPQRSTUVWXYZ) -- alphabet = "ABCDEFGHIKLMNOPQRSTUVWXYZ"
./ciphers/playfair_cipher.py:6:5 - Unknown word (chunker) -- def chunker(seq: Iterable[str],
./ciphers/porta_cipher.py:10:29 - Unknown word (WXYZNOPQRSTUV) -- ("ABCDEFGHIJKLM", "WXYZNOPQRSTUV"),
./ciphers/porta_cipher.py:12:29 - Unknown word (VWXYZNOPQRSTU) -- ("ABCDEFGHIJKLM", "VWXYZNOPQRSTU"),
./ciphers/porta_cipher.py:14:29 - Unknown word (UVWXYZNOPQRST) -- ("ABCDEFGHIJKLM", "UVWXYZNOPQRST"),
./ciphers/porta_cipher.py:16:29 - Unknown word (TUVWXYZNOPQRS) -- ("ABCDEFGHIJKLM", "TUVWXYZNOPQRS"),
./ciphers/porta_cipher.py:18:29 - Unknown word (STUVWXYZNOPQR) -- ("ABCDEFGHIJKLM", "STUVWXYZNOPQR"),
./ciphers/porta_cipher.py:20:29 - Unknown word (RSTUVWXYZNOPQ) -- ("ABCDEFGHIJKLM", "RSTUVWXYZNOPQ"),
./ciphers/porta_cipher.py:22:29 - Unknown word (QRSTUVWXYZNOP) -- ("ABCDEFGHIJKLM", "QRSTUVWXYZNOP"),
./ciphers/porta_cipher.py:24:29 - Unknown word (PQRSTUVWXYZNO) -- ("ABCDEFGHIJKLM", "PQRSTUVWXYZNO"),
./ciphers/porta_cipher.py:26:29 - Unknown word (OPQRSTUVWXYZN) -- ("ABCDEFGHIJKLM", "OPQRSTUVWXYZN"),
./ciphers/porta_cipher.py:2:29 - Unknown word (NOPQRSTUVWXYZ) -- ("ABCDEFGHIJKLM", "NOPQRSTUVWXYZ"),
./ciphers/porta_cipher.py:44:6 - Unknown word (QRACRWU) -- 'QRACRWU'
./ciphers/porta_cipher.py:4:29 - Unknown word (ZNOPQRSTUVWXY) -- ("ABCDEFGHIJKLM", "ZNOPQRSTUVWXY"),
./ciphers/porta_cipher.py:6:29 - Unknown word (YZNOPQRSTUVWX) -- ("ABCDEFGHIJKLM", "YZNOPQRSTUVWX"),
./ciphers/porta_cipher.py:8:29 - Unknown word (XYZNOPQRSTUVW) -- ("ABCDEFGHIJKLM", "XYZNOPQRSTUVW"),
./ciphers/rabin_miller.py:1:3 - Unknown word (Primality) -- # Primality Testing with the Rabin
./ciphers/rail_fence_cipher.py:11:10 - Unknown word (olordll) -- 'HWe olordll'
./ciphers/rot13.py:8:16 - Unknown word (onax) -- "Zl frperg onax nppbhag ahzore vf 1
./ciphers/rot13.py:8:21 - Unknown word (nppbhag) -- "Zl frperg onax nppbhag ahzore vf 173-52946
./ciphers/rot13.py:8:29 - Unknown word (ahzore) -- frperg onax nppbhag ahzore vf 173-52946 fb qba
./ciphers/rot13.py:8:52 - Unknown word (qba'g) -- ahzore vf 173-52946 fb qba'g gryy nalbar!!"
./ciphers/rot13.py:8:58 - Unknown word (gryy) -- vf 173-52946 fb qba'g gryy nalbar!!"
./ciphers/rot13.py:8:63 - Unknown word (nalbar) -- 52946 fb qba'g gryy nalbar!!"
./ciphers/rot13.py:8:9 - Unknown word (frperg) -- "Zl frperg onax nppbhag ahzore
./ciphers/rsa_cipher.py:15:11 - Unknown word (ints) -- block_ints = []
./ciphers/rsa_factorization.py:16:5 - Unknown word (rsafactor) -- def rsafactor(d: int, e: int, N: int
./ciphers/shuffled_shift_cipher.py:131:44 - Unknown word (Xyqe) -- ShuffledShiftCipher('4PYIXyqeQZr44')
./ciphers/shuffled_shift_cipher.py:65:10 - Unknown word (rtype) -- :rtype: list
./ciphers/shuffled_shift_cipher.py:81:38 - Unknown word (MLKJIHGF) -- shuffled parts: [A,CB,ED,MLKJIHGF,RQPON,ZYXWVUTS]
./ciphers/shuffled_shift_cipher.py:81:47 - Unknown word (RQPON) -- parts: [A,CB,ED,MLKJIHGF,RQPON,ZYXWVUTS]
./ciphers/shuffled_shift_cipher.py:81:53 - Unknown word (ZYXWVUTS) -- CB,ED,MLKJIHGF,RQPON,ZYXWVUTS]
./ciphers/shuffled_shift_cipher.py:82:35 - Unknown word (ACBEDMLKJIHGFRQPONZYXWVUTS) -- shuffled __key_list : ACBEDMLKJIHGFRQPONZYXWVUTS
./ciphers/simple_keyword_cypher.py:11:12 - Unknown word (dups) -- key_no_dups = ""
./ciphers/simple_keyword_cypher.py:50:12 - Unknown word (VMQJB) -- 'CYJJM VMQJB!!'
./ciphers/simple_keyword_cypher.py:50:6 - Unknown word (CYJJM) -- 'CYJJM VMQJB!!'
./ciphers/simple_keyword_cypher.py:8:6 - Unknown word (Helo) -- 'Helo Wrd'
./ciphers/simple_substitution_cipher.py:36:55 - Unknown word (Harshil) -- LFWOAYUISVKMNXPBDCRJTQEGHZ', 'Harshil Darji')
./ciphers/simple_substitution_cipher.py:36:63 - Unknown word (Darji) -- SVKMNXPBDCRJTQEGHZ', 'Harshil Darji')
./ciphers/simple_substitution_cipher.py:37:14 - Unknown word (Olcvs) -- 'Ilcrism Olcvs'
./ciphers/simple_substitution_cipher.py:37:6 - Unknown word (Ilcrism) -- 'Ilcrism Olcvs'
./ciphers/simple_substitution_cipher.py:9:12 - Unknown word (LFWOAYUISVKMNXPBDCRJTQEGHZ) -- key = "LFWOAYUISVKMNXPBDCRJTQEGHZ"
./ciphers/trafid_cipher.py:126:38 - Unknown word (EPSDUCVWYM) -- encryptMessage(msg, "EPSDUCVWYM.ZLKXNBTFGORIJHAQ")
./ciphers/trafid_cipher.py:126:49 - Unknown word (ZLKXNBTFGORIJHAQ) -- cryptMessage(msg, "EPSDUCVWYM.ZLKXNBTFGORIJHAQ")
./ciphers/transposition_cipher.py:28:12 - Unknown word (Dsahrij) -- 'Hlia rDsahrij'
./ciphers/transposition_cipher.py:28:6 - Unknown word (Hlia) -- 'Hlia rDsahrij'
./ciphers/vigenere_cipher.py:22:62 - Unknown word (Dharmaj) -- is Harshil Darji from Dharmaj.')
./ciphers/vigenere_cipher.py:23:14 - Unknown word (Odrjqqs) -- 'Akij ra Odrjqqs Gaisq muod Mphumrs.
./ciphers/vigenere_cipher.py:23:22 - Unknown word (Gaisq) -- 'Akij ra Odrjqqs Gaisq muod Mphumrs.'
./ciphers/vigenere_cipher.py:23:28 - Unknown word (muod) -- Akij ra Odrjqqs Gaisq muod Mphumrs.'
./ciphers/vigenere_cipher.py:23:33 - Unknown word (Mphumrs) -- ra Odrjqqs Gaisq muod Mphumrs.'
./ciphers/vigenere_cipher.py:23:6 - Unknown word (Akij) -- 'Akij ra Odrjqqs Gaisq muod
./ciphers/xor_cipher.py:145:51 - Unknown word (fout) -- encrypt.out", "w+") as fout:
./compression/burrows_wheeler.py:24:31 - Unknown word (ANANA) -- BANANA|', 'BANANA|^', 'ANANA|^B', 'NANA|^BA', 'ANA
./compression/burrows_wheeler.py:24:43 - Unknown word (NANA) -- BANANA|^', 'ANANA|^B', 'NANA|^BA', 'ANA|^BAN', 'NA
./compression/burrows_wheeler.py:24:71 - Unknown word (BANA) -- BA', 'ANA|^BAN', 'NA|^BANA',
./compression/burrows_wheeler.py:25:9 - Unknown word (BANAN) -- 'A|^BANAN', '|^BANANA']
./compression/burrows_wheeler.py:27:32 - Unknown word (casaa) -- asa_da_casa', '_asa_da_casaa', 'asa_da_casaa_',
./compression/burrows_wheeler.py:29:40 - Unknown word (asaa) -- , 'casaa_asa_da_', 'asaa_asa_da_c', 'saa_asa
./compression/burrows_wheeler.py:32:39 - Unknown word (namabananapa) -- namabanana', 'anamabananap', 'namabananapa', 'amabananapan',
./compression/burrows_wheeler.py:33:22 - Unknown word (abananapanam) -- 'mabananapana', 'abananapanam', 'bananapanama', 'ananapanam
./compression/burrows_wheeler.py:34:54 - Unknown word (apanamabanan) -- apanamaban', 'napanamabana', 'apanamabanan']
./compression/burrows_wheeler.py:34:6 - Unknown word (nanapanamaba) -- 'nanapanamaba', 'anapanamaban', 'napanamaba
./compression/burrows_wheeler.py:58:21 - Unknown word (aaaadss) -- {'bwt_string': 'aaaadss_c__aa', 'idx_original
./compression/burrows_wheeler.py:60:21 - Unknown word (mnpbnnaaaaaa) -- {'bwt_string': 'mnpbnnaaaaaa', 'idx_original_string
./compression/lempel_ziv_decompress.py:2:43 - Unknown word (Lempel) -- several implementations of Lempel–Ziv–Welch decompression
./compression/peak_signal_to_noise_ratio.py:15:5 - Unknown word (psnr) -- def psnr(original, contrast)
./compression/peak_signal_to_noise_ratio.py:27:20 - Unknown word (imread) -- original = cv2.imread(os.path.join(dir_path
./compression/peak_signal_to_noise_ratio.py:2:30 - Unknown word (PSNR) -- signal-to-noise ratio - PSNR
./computer_vision/cnn_classification.py:17:22 - Unknown word (iamges) -- . The labels of the iamges will be extracted from
./computer_vision/cnn_classification.py:26:17 - Unknown word (Keras) -- # Importing the Keras libraries and packages
./computer_vision/cnn_classification.py:28:17 - Unknown word (keras) -- from tensorflow.keras import layers, models
./computer_vision/cnn_classification.py:2:1 - Unknown word (Convolutional) -- Convolutional Neural Network
./computer_vision/cnn_classification.py:32:7 - Unknown word (Initialising) -- # Initialising the CNN
./computer_vision/cnn_classification.py:37:16 - Unknown word (Conv) -- layers.Conv2D(32, (3, 3), input
./computer_vision/cnn_classification.py:37:72 - Unknown word (relu) -- 64, 3), activation="relu")
./computer_vision/cnn_classification.py:43:23 - Unknown word (convolutional) -- # Adding a second convolutional layer
./computer_vision/harris_corner.py:15:23 - Unknown word (neighbourhoods) -- window_size : neighbourhoods considered
./computer_vision/harris_corner.py:75:9 - Unknown word (imwrite) -- cv2.imwrite("detect.png", color
./conversions/molecular_chemistry.py:10:27 - Unknown word (nfactor) -- molarity_to_normality(nfactor: int, moles: float,
./conversions/prefix_conversions.py:10:5 - Unknown word (zetta) -- zetta = 21
./conversions/prefix_conversions.py:12:5 - Unknown word (peta) -- peta = 15
./conversions/prefix_conversions.py:13:5 - Unknown word (tera) -- tera = 12
./conversions/prefix_conversions.py:14:5 - Unknown word (giga) -- giga = 9
./conversions/prefix_conversions.py:17:5 - Unknown word (hecto) -- hecto = 2
./conversions/prefix_conversions.py:18:5 - Unknown word (deca) -- deca = 1
./conversions/prefix_conversions.py:19:5 - Unknown word (deci) -- deci = -1
./conversions/prefix_conversions.py:20:5 - Unknown word (centi) -- centi = -2
./conversions/prefix_conversions.py:21:5 - Unknown word (milli) -- milli = -3
./conversions/prefix_conversions.py:24:5 - Unknown word (pico) -- pico = -12
./conversions/prefix_conversions.py:25:5 - Unknown word (femto) -- femto = -15
./conversions/prefix_conversions.py:26:5 - Unknown word (atto) -- atto = -18
./conversions/prefix_conversions.py:27:5 - Unknown word (zepto) -- zepto = -21
./conversions/prefix_conversions.py:28:5 - Unknown word (yocto) -- yocto = -24
./conversions/prefix_conversions.py:9:5 - Unknown word (yotta) -- yotta = 24
./conversions/roman_numerals.py:11:5 - Unknown word (vals) -- vals = {"I": 1, "V": 5,
./conversions/roman_numerals.py:7:29 - Unknown word (CLIV) -- tests = {"III": 3, "CLIV": 154, "MIX": 1009,
./conversions/roman_numerals.py:7:68 - Unknown word (MMMCMXCIX) -- 1009, "MMD": 2500, "MMMCMXCIX": 3999}
./conversions/temperature_conversions.py:306:5 - Unknown word (reaumur) -- def reaumur_to_kelvin(reaumur: float
./conversions/temperature_conversions.py:4:43 - Unknown word (ndigits) -- fahrenheit(celsius: float, ndigits: int = 2) -> float:
./conversions/weight_conversion.py:4:15 - Unknown word (Anubhav) -- __author__ = "Anubhav Solanki"
./conversions/weight_conversion.py:4:23 - Unknown word (Solanki) -- author__ = "Anubhav Solanki"
./data_structures/binary_tree/avl_tree.py:243:9 - Unknown word (Ltree) -- class AVLtree:
./data_structures/binary_tree/avl_tree.py:296:26 - Unknown word (traversale) -- -> str: # a level traversale, gives a more intuitive
./data_structures/binary_tree/binary_search_tree.py:14:28 - Unknown word (pformat) -- from pprint import pformat
./data_structures/binary_tree/binary_search_tree_recursive.py:231:9 - Unknown word (inorder) -- def inorder_traversal(self) -> Iterator
./data_structures/binary_tree/binary_search_tree_recursive.py:598:12 - Unknown word (Inorder) -- print("Inorder traversal:", inorder
./data_structures/binary_tree/lazy_segment_tree.py:129:5 - Unknown word (segt) -- segt = SegmentTree(size)
./data_structures/binary_tree/lowest_common_ancestor.py:75:13 - Unknown word (qsize) -- while q.qsize() != 0:
./data_structures/binary_tree/red_black_tree.py:685:5 - Unknown word (pytests) -- def pytests() -> None:
./data_structures/binary_tree/treap.py:11:5 - Unknown word (Treap's) -- Treap's node
./data_structures/binary_tree/treap.py:12:5 - Unknown word (Treap) -- Treap is a binary tree by
./data_structures/binary_tree/treap.py:130:31 - Unknown word (treap) -- value to add value into treap
./data_structures/binary_tree/wavelet_tree.py:118:5 - Unknown word (quantile) -- def quantile(node: Node, index: int
./data_structures/binary_tree/wavelet_tree.py:162:27 - Unknown word (elememts) -- Returns the number of elememts in range [start_num
./data_structures/binary_tree/wavelet_tree.py:19:14 - Unknown word (maxx) -- self.maxx: int = -1
./data_structures/disjoint_set/alternate_disjoint_set.py:54:26 - Unknown word (disj) -- def get_parent(self, disj_set: int) -> int:
./data_structures/hashing/hash_table_with_linked_list.py:1:25 - Unknown word (deque) -- from collections import deque
./data_structures/heap/binomial_heap.py:120:38 - Unknown word (inplace) -- merged heap; (merge is inplace)
./data_structures/heap/binomial_heap.py:178:19 - Unknown word (Neighbouring) -- # Neighbouring Nodes
./data_structures/heap/binomial_heap.py:327:11 - Unknown word (Neighbour) -- # Neighbour nodes
./data_structures/heap/binomial_heap.py:54:64 - Unknown word (logn) -- elements: Guaranteed logn, amoratized 1
./data_structures/heap/binomial_heap.py:54:70 - Unknown word (amoratized) -- elements: Guaranteed logn, amoratized 1
./data_structures/heap/binomial_heap.py:55:56 - Unknown word (logm) -- size m and n: O(logn + logm)
./data_structures/heap/heap_generic.py:62:10 - Unknown word (heapify) -- def _heapify_up(self, index):
./data_structures/heap/skew_heap.py:54:5 - Unknown word (Visualisation) -- Visualisation: https://www.cs.usfca
./data_structures/linked_list/deque_doubly.py:103:8 - Unknown word (Equeu) -- # DEqueu Remove Operations (At
./data_structures/linked_list/deque_doubly.py:2:14 - Unknown word (Deque) -- Implementing Deque using DoublyLinkedList
./data_structures/linked_list/from_sequence.py:1:13 - Unknown word (Prorgam) -- # Recursive Prorgam to create a Linked List
./data_structures/linked_list/skip_list.py:372:17 - Unknown word (doesnt) -- def test_delete_doesnt_leave_dead_nodes():
./data_structures/queue/queue_on_list.py:22:8 - Unknown word (Dequeues) -- """Dequeues {@code item}
./data_structures/stacks/dijkstras_two_stack_algorithm.py:39:5 - Unknown word (dijkstras) -- def dijkstras_two_stack_algorithm
./data_structures/stacks/dijkstras_two_stack_algorithm.py:3:20 - Unknown word (echoaj) -- GitHub: github.com/echoaj
./digital_image_processing/change_brightness.py:25:9 - Unknown word (brigt) -- brigt_img = change_brightness
./digital_image_processing/convert_to_negative.py:2:36 - Unknown word (opencv) -- mplemented an algorithm using opencv to convert a colored
./digital_image_processing/convert_to_negative.py:4:44 - Unknown word (imshow) -- destroyAllWindows, imread, imshow, waitKey
./digital_image_processing/edge_detection/canny.py:12:15 - Unknown word (mgrid) -- x, y = np.mgrid[0 - center : k_size
./digital_image_processing/edge_detection/canny.py:5:39 - Unknown word (sobel) -- image_processing.filters.sobel_filter import sobel
./digital_image_processing/filters/convolve.py:30:63 - Unknown word (vstack) -- pixels into a row and np.vstack all rows
./digital_image_processing/histogram_equalization/histogram_stretch.py:4:10 - Unknown word (Binish) -- @author: Binish125
./digital_image_processing/index_calculation.py:132:9 - Unknown word (funcs) -- funcs = {
./digital_image_processing/index_calculation.py:1:11 - Unknown word (João) -- # Author: João Gustavo A. Amorim
./digital_image_processing/index_calculation.py:1:27 - Unknown word (Amorim) -- Author: João Gustavo A. Amorim
./digital_image_processing/index_calculation.py:221:34 - Unknown word (CDVI) -- Index, Calibrated NDVI - CDVI
./digital_image_processing/index_calculation.py:339:9 - Unknown word (ndvi) -- ndvi = self.NDVI()
./digital_image_processing/index_calculation.py:47:15 - Unknown word (ARVI) -- #"ARVI2" -- red
./digital_image_processing/index_calculation.py:48:15 - Unknown word (CCCI) -- #"CCCI" -- red
./digital_image_processing/index_calculation.py:51:15 - Unknown word (NDVI) -- #"NDVI" -- red
./digital_image_processing/index_calculation.py:52:15 - Unknown word (BNDVI) -- #"BNDVI" -- blue
./digital_image_processing/index_calculation.py:54:15 - Unknown word (GNDVI) -- #"GNDVI" -- green
./digital_image_processing/index_calculation.py:55:15 - Unknown word (GBNDVI) -- #"GBNDVI" -- green
./digital_image_processing/index_calculation.py:565:18 - Unknown word (maxprec) -- floatmode='maxprec_equal'))
./digital_image_processing/index_calculation.py:56:15 - Unknown word (GRNDVI) -- #"GRNDVI" -- red,
./digital_image_processing/index_calculation.py:57:15 - Unknown word (RBNDVI) -- #"RBNDVI" -- red,
./digital_image_processing/index_calculation.py:58:15 - Unknown word (PNDVI) -- #"PNDVI" -- red
./digital_image_processing/index_calculation.py:60:15 - Unknown word (BWDRVI) -- #"BWDRVI" -- blue
./digital_image_processing/index_calculation.py:64:15 - Unknown word (CTVI) -- #"CTVI" -- red
./digital_image_processing/index_calculation.py:65:15 - Unknown word (GDVI) -- #"GDVI" -- green
./digital_image_processing/index_calculation.py:67:15 - Unknown word (GEMI) -- #"GEMI" -- red
./digital_image_processing/index_calculation.py:68:15 - Unknown word (GOSAVI) -- #"GOSAVI" -- green
./digital_image_processing/index_calculation.py:69:15 - Unknown word (GSAVI) -- #"GSAVI" -- green
./digital_image_processing/index_calculation.py:72:15 - Unknown word (IPVI) -- #"IPVI" -- red
./digital_image_processing/index_calculation.py:75:15 - Unknown word (MRVI) -- #"MRVI" -- red
./digital_image_processing/index_calculation.py:76:15 - Unknown word (MSAVI) -- #"MSAVI" -- red
./digital_image_processing/index_calculation.py:80:15 - Unknown word (NGRDI) -- #"NGRDI" -- red
./digital_image_processing/index_calculation.py:86:15 - Unknown word (NDRE) -- #"NDRE" -- redEdge
./digital_image_processing/test_digital_image_processing.py:13:58 - Unknown word (conv) -- filters import convolve as conv
./divide_and_conquer/closest_pair_of_points.py:112:44 - Unknown word (Xcoords) -- contains the points, whose Xcoords are at a
./divide_and_conquer/closest_pair_of_points.py:113:45 - Unknown word (Xcoord) -- pair_dis) from mid's Xcoord
./divide_and_conquer/closest_pair_of_points.py:5:36 - Unknown word (ords) -- sorted based on Xco-ords and
./divide_and_conquer/convex_hull.py:408:17 - Unknown word (melkman) -- def convex_hull_melkman(points: List[Point]
./divide_and_conquer/inversions.py:9:25 - Unknown word (nlogn) -- algorithm which runs in nlogn and the brute-force
./divide_and_conquer/strassen_matrix_multiplication.py:75:12 - Unknown word (strassen) -- def actual_strassen(matrix_a: list, matrix
./dynamic_programming/catalan_numbers.py:7:20 - Unknown word (Dyck) -- * - The number of Dyck words of length 2n
./dynamic_programming/climbing_stairs.py:6:9 - Unknown word (Cdoe) -- LeetCdoe No.70: Climbing Stairs
./dynamic_programming/edit_distance.py:2:11 - Unknown word (Turfa) -- Author : Turfa Auliarachman
./dynamic_programming/edit_distance.py:2:17 - Unknown word (Auliarachman) -- Author : Turfa Auliarachman
./dynamic_programming/iterating_through_submasks.py:2:15 - Unknown word (Faizan) -- Author : Syed Faizan (3rd Year Student IIIT
./dynamic_programming/iterating_through_submasks.py:2:40 - Unknown word (IIIT) -- Faizan (3rd Year Student IIIT Pune)
./dynamic_programming/iterating_through_submasks.py:3:10 - Unknown word (faizan) -- github : faizan2700
./dynamic_programming/longest_common_subsequence.py:74:10 - Unknown word (AGGTAB) -- a = "AGGTAB"
./dynamic_programming/longest_common_subsequence.py:75:10 - Unknown word (GXTXAYB) -- b = "GXTXAYB"
./dynamic_programming/longest_common_subsequence.py:77:24 - Unknown word (GTAB) -- expected_subseq = "GTAB"
./dynamic_programming/longest_increasing_subsequence.py:2:11 - Unknown word (Mehdi) -- Author : Mehdi ALAOUI
./dynamic_programming/longest_increasing_subsequence_o(nlogn).py:2:11 - Unknown word (Aravind) -- # Author: Aravind Kashyap
./dynamic_programming/longest_increasing_subsequence_o(nlogn).py:2:19 - Unknown word (Kashyap) -- # Author: Aravind Kashyap
./dynamic_programming/max_sub_array.py:2:10 - Unknown word (Mayank) -- author : Mayank Kumar Jha (mk9440)
./dynamic_programming/max_sub_array.py:84:9 - Unknown word (strt) -- strt = time.time()
./dynamic_programming/max_sub_array.py:92:9 - Unknown word (xlabel) -- plt.xlabel("Number of Inputs")
./dynamic_programming/max_sub_array.py:93:9 - Unknown word (ylabel) -- plt.ylabel("Time taken in seconds
./dynamic_programming/optimal_binary_search_tree.py:100:5 - Unknown word (freqs) -- freqs = [nodes[i].freq for
./dynamic_programming/optimal_binary_search_tree.py:72:22 - Unknown word (CLRS) -- Implemented from CLRS (Introduction to Algorithms
./dynamic_programming/subset_generation.py:43:31 - Unknown word (Ambuj) -- code is contributed by Ambuj sahu
./dynamic_programming/subset_generation.py:43:37 - Unknown word (sahu) -- contributed by Ambuj sahu
./electronics/electric_power.py:27:38 - Unknown word (modulei) -- stdin>", line 23, in <modulei
./file_transfer/send_file.py:1:32 - Unknown word (mytext) -- file(filename: str = "mytext.txt", testing: bool
./file_transfer/tests/test_send_file.py:18:13 - Unknown word (ensurance) -- # ===== ensurance =====
./fractals/mandelbrot.py:19:8 - Unknown word (colorsys) -- import colorsys
./fractals/sierpinski_triangle.py:14:15 - Unknown word (Wacław) -- mathematician Wacław Sierpinski, but appeared
./fractals/sierpinski_triangle.py:3:58 - Unknown word (anuragkumarak) -- uragkumarak95@gmail.com | git/anuragkumarak95
./fuzzy_logic/fuzzy_operations.py:101:25 - Unknown word (hspace) -- plt.subplots_adjust(hspace=0.5)
./fuzzy_logic/fuzzy_operations.py:10:8 - Unknown word (skfuzzy) -- import skfuzzy as fuzz
./fuzzy_logic/fuzzy_operations.py:17:18 - Unknown word (gbellmf) -- # (trapmf(), gbellmf(), gaussmf(), etc).
./fuzzy_logic/fuzzy_operations.py:17:29 - Unknown word (gaussmf) -- trapmf(), gbellmf(), gaussmf(), etc).
./fuzzy_logic/fuzzy_operations.py:17:8 - Unknown word (trapmf) -- # (trapmf(), gbellmf(), gaussmf
./fuzzy_logic/fuzzy_operations.py:1:21 - Unknown word (Jigyasa) -- """README, Author - Jigyasa Gandhi(mailto:jigsgandhi
./fuzzy_logic/fuzzy_operations.py:20:29 - Unknown word (trimf) -- young = fuzz.membership.trimf(X, abc1)
./genetic_algorithm/basic_string.py:169:11 - Unknown word (ABCDEFGHIJKLMNOPQRSTUVWXY) -- " ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklm"
./genetic_algorithm/basic_string.py:169:36 - Unknown word (Zabcdefghijklm) -- ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklm"
./genetic_algorithm/basic_string.py:170:10 - Unknown word (nopqrstuvwxyz) -- "nopqrstuvwxyz.,;!?+-*#@^'èéòà€ù=)
./genetic_algorithm/basic_string.py:170:35 - Unknown word (èéòà) -- nopqrstuvwxyz.,;!?+-*#@^'èéòà€ù=)(&%$£/\\"
./genetic_algorithm/basic_string.py:5:11 - Unknown word (rkia) -- Author: D4rkia
./genetic_algorithm/basic_string.py:77:27 - Unknown word (Helxo) -- >>> evaluate("Helxo Worlx", Hello World
./genetic_algorithm/basic_string.py:77:33 - Unknown word (Worlx) -- >>> evaluate("Helxo Worlx", Hello World)
./geodesy/lamberts_ellipsoidal_distance.py:69:39 - Unknown word (Pcos) -- sin(sigma)) * sin^2Pcos^2Q / cos^2(sigma/2)
./geodesy/lamberts_ellipsoidal_distance.py:71:7 - Unknown word (demonimator) -- X_demonimator = cos(sigma / 2) **
./geodesy/lamberts_ellipsoidal_distance.py:75:39 - Unknown word (Psin) -- sin(sigma)) * cos^2Psin^2Q / sin^2(sigma/2)
./graphics/bezier_curve.py:49:9 - Unknown word (bezier) -- def bezier_curve_function(self
./graphics/bezier_curve.py:5:6 - Unknown word (scipy) -- from scipy.special import comb
./graphics/vector3_for_2d_rendering.py:10:15 - Unknown word (xcodz) -- __author__ = "xcodz-dot, cclaus, dhruvmanila
./graphics/vector3_for_2d_rendering.py:10:26 - Unknown word (cclaus) -- author__ = "xcodz-dot, cclaus, dhruvmanila"
./graphics/vector3_for_2d_rendering.py:10:34 - Unknown word (dhruvmanila) -- "xcodz-dot, cclaus, dhruvmanila"
./graphs/basic_graphs.py:130:5 - Unknown word (dijk) -- def dijk(G, s):
./graphs/basic_graphs.py:158:5 - Unknown word (topo) -- def topo(G, ind=None, Q=None
./graphs/basic_graphs.py:188:5 - Unknown word (adjm) -- def adjm():
./graphs/basic_graphs.py:209:5 - Unknown word (floy) -- def floy(A_and_n):
./graphs/basic_graphs.py:264:5 - Unknown word (edglist) -- def edglist():
./graphs/basic_graphs.py:274:5 - Unknown word (Kruskal's) -- Kruskal's MST Algorithm
./graphs/basic_graphs.py:282:5 - Unknown word (krusk) -- def krusk(E_and_n):
./graphs/bidirectional_a_star.py:259:5 - Unknown word (bidir) -- bidir_astar = BidirectionalAStar
./graphs/bidirectional_a_star.py:82:9 - Unknown word (astar) -- >>> astar = AStar((0, 0), (len
./graphs/breadth_first_search.py:14:49 - Unknown word (graaph) -- list representation of graaph
./graphs/breadth_first_search.py:3:13 - Unknown word (OMKAR) -- """ Author: OMKAR PATHAK """
./graphs/breadth_first_search.py:3:19 - Unknown word (PATHAK) -- """ Author: OMKAR PATHAK """
./graphs/connected_components.py:24:15 - Unknown word (verts) -- connected_verts = []
./graphs/dijkstra.py:27:41 - Unknown word (heapq) -- that happens because heapq.heappop will always
./graphs/dijkstra_2.py:11:13 - Unknown word (mdist) -- def minDist(mdist, vset, V):
./graphs/dijkstra_2.py:11:20 - Unknown word (vset) -- def minDist(mdist, vset, V):
./graphs/dijkstra_2.py:57:5 - Unknown word (gsrc) -- gsrc = int(input("\nEnter
./graphs/dijkstra_algorithm.py:2:11 - Unknown word (Shubham) -- # Author: Shubham Malik
./graphs/dijkstra_algorithm.py:2:19 - Unknown word (Malik) -- # Author: Shubham Malik
./graphs/dijkstra_algorithm.py:73:33 - Unknown word (atmost) -- assuming the new_d is atmost old_d
./graphs/dinic.py:17:33 - Unknown word (rcap) -- edge(self, a, b, c, rcap=0):
./graphs/dinic.py:87:20 - Unknown word (verices) -- Finally we add the verices near the sink to the
./graphs/g_topological_sort.py:1:11 - Unknown word (Phyllipe) -- # Author: Phyllipe Bezerra (https://github
./graphs/g_topological_sort.py:1:20 - Unknown word (Bezerra) -- # Author: Phyllipe Bezerra (https://github.com
./graphs/gale_shapley_bigraph.py:10:5 - Unknown word (oegan) -- oegan donors and recipients
./graphs/gale_shapley_bigraph.py:16:56 - Unknown word (Numberphile) -- v=Qcv1IqHWAzg&t=13s (Numberphile YouTube).
./graphs/graph_list.py:3:25 - Unknown word (Nwachukwu) -- Author: OMKAR PATHAK, Nwachukwu Chidiebere
./graphs/graph_list.py:3:35 - Unknown word (Chidiebere) -- OMKAR PATHAK, Nwachukwu Chidiebere
./graphs/kahns_algorithm_long.py:3:5 - Unknown word (indegree) -- indegree = [0] * len(graph)
./graphs/karger.py:2:22 - Unknown word (Karger's) -- An implementation of Karger's Algorithm for partitioning
./graphs/karger.py:34:40 - Unknown word (adacency) -- dictionary containing adacency lists for the graph
./graphs/minimum_spanning_tree_boruvka.py:104:41 - Unknown word (Boruvka's) -- set Union and Find for Boruvka's algorithm
./graphs/minimum_spanning_tree_boruvka.py:150:9 - Unknown word (boruvka) -- def boruvka_mst(graph):
./graphs/minimum_spanning_tree_boruvka.py:38:13 - Unknown word (Boruvks's) -- For Boruvks's algorithm the weights
./graphs/minimum_spanning_tree_boruvka.py:71:9 - Unknown word (Returna) -- Returna all edges in the graph
./graphs/minimum_spanning_tree_kruskal.py:1:5 - Unknown word (kruskal) -- def kruskal(
./graphs/minimum_spanning_tree_kruskal2.py:51:49 - Unknown word (neighbouring) -- from the node to the neighbouring nodes (with weights
./graphs/minimum_spanning_tree_prims2.py:220:11 - Unknown word (algo) -- def prims_algo(
./graphs/minimum_spanning_tree_prims2.py:2:23 - Unknown word (Jarník's) -- Prim's (also known as Jarník's) algorithm is a greedy
./graphs/multi_heuristic_astar.py:136:16 - Unknown word (inad) -- close_list_inad,
./graphs/multi_heuristic_astar.py:140:9 - Unknown word (itera) -- for itera in range(n_heuristic
./graphs/multi_heuristic_astar.py:46:18 - Unknown word (prito) -- for (prito, yyy) in temp:
./graphs/scc_kosaraju.py:24:5 - Unknown word (kosaraju) -- def kosaraju():
./graphs/strongly_connected_components.py:41:36 - Unknown word (strongliy) -- first search to find strongliy connected
./graphs/tarjans_scc.py:16:42 - Unknown word (equireachable) -- we save it and it's equireachable vertices as a strongly
./graphs/tests/test_min_spanning_tree_prim.py:25:5 - Unknown word (adjancency) -- adjancency = defaultdict(list)
./hashes/chaos_machine.py:45:32 - Unknown word (Marsaglia) -- (Xorshift by George Marsaglia)
./hashes/chaos_machine.py:45:7 - Unknown word (PRNG) -- # PRNG (Xorshift by George
./hashes/hamming_code.py:1:44 - Unknown word (Kunz) -- A. Amorim & Gabriel Kunz
./hashes/hamming_code.py:24:67 - Unknown word (Pari) -- many parity bits (sizePari)
./hashes/hamming_code.py:272:5 - Unknown word (Receiv) -- dataReceiv, ack = receptorConverter
./hashes/luhn.py:1:5 - Unknown word (Luhn) -- """ Luhn Algorithm """
./hashes/luhn.py:5:8 - Unknown word (luhn) -- def is_luhn(string: str) -> bool
./hashes/md5.py:117:5 - Unknown word (tvals) -- tvals = [int(2 ** 32 * abs
./hashes/md5.py:16:30 - Unknown word (abcdfghijklmnopqrstuvw) -- rearrange('1234567890abcdfghijklmnopqrstuvw')
./hashes/md5.py:17:24 - Unknown word (abcdfg) -- 'pqrstuvwhijklmno90abcdfg12345678'
./hashes/md5.py:17:6 - Unknown word (pqrstuvwhijklmno) -- 'pqrstuvwhijklmno90abcdfg12345678'
./hashes/md5.py:211:13 - Unknown word (dtemp) -- dtemp = D
./hashes/sdbm.py:2:36 - Unknown word (sdbm) -- algorithm was created for sdbm (a public-domain reimplementa
./hashes/sdbm.py:2:58 - Unknown word (reimplementation) -- sdbm (a public-domain reimplementation of ndbm)
./hashes/sdbm.py:2:78 - Unknown word (ndbm) -- reimplementation of ndbm)
./hashes/sha1.py:28:8 - Unknown word (struct) -- import struct
./hashes/sha1.py:41:9 - Unknown word (Inititates) -- Inititates the variables data and
./knapsack/README.md:13:190 - Unknown word (Dantzig) -- mathematician Tobias Dantzig (1884–1956), and refers
./knapsack/README.md:20:70 - Unknown word (CLASSNAME) -- unitBasisVector)`, and `help(CLASSNAME.METHODNAME)`.
./knapsack/README.md:20:80 - Unknown word (METHODNAME) -- and `help(CLASSNAME.METHODNAME)`.
./knapsack/tests/test_knapsack.py:4:21 - Unknown word (Schröder) -- @author: Dr. Tobias Schröder
./linear_algebra/README.md:20:36 - Unknown word (eulidean) -- euclidLength() : returns the eulidean length of the vector
./linear_algebra/README.md:31:12 - Unknown word (axpy) -- - function axpy(scalar,vector1,vector
./linear_algebra/README.md:69:48 - Unknown word (bytecode) -- directly use the Python bytecode file `lib.pyc`.
./linear_algebra/src/conjugate_gradient.py:130:25 - Unknown word (Krylov) -- # Calculate new Krylov subspace scale.
./linear_algebra/src/conjugate_gradient.py:132:27 - Unknown word (conjuage) -- # Calculate new A conjuage search direction.
./linear_algebra/src/conjugate_gradient.py:39:27 - Unknown word (eignevectors) -- Get eigenvalues and eignevectors for a symmetric matrix
./linear_algebra/src/conjugate_gradient.py:40:33 - Unknown word (eigh) -- values, _ = np.linalg.eigh(matrix)
./linear_algebra/src/conjugate_gradient.py:40:5 - Unknown word (eigen) -- eigen_values, _ = np.linalg
./linear_algebra/src/conjugate_gradient.py:63:31 - Unknown word (randn) -- random_matrix = np.random.randn(dimension, dimension
./linear_algebra/src/lib.py:95:9 - Unknown word (summe) -- summe: float = 0
./linear_algebra/src/polynom_for_points.py:77:13 - Unknown word (zahlen) -- zahlen = 0
./linear_algebra/src/power_iteration.py:12:22 - Unknown word (eignevalue) -- Find the largest eignevalue and corresponding eigenvector
./linear_algebra/src/power_iteration.py:49:5 - Unknown word (lamda) -- lamda_previous = 0
./machine_learning/astar.py:19:52 - Unknown word (tupleof) -- the represented by tupleof x and y
./machine_learning/astar.py:63:13 - Unknown word (neigbours) -- def get_neigbours(self, cell):
./machine_learning/astar.py:67:9 - Unknown word (neughbour) -- neughbour_cord = [
./machine_learning/data_transformations.py:26:30 - Unknown word (stdev) -- statistics import mean, stdev
./machine_learning/decision_tree.py:162:12 - Unknown word (arange) -- X = np.arange(-1.0, 1.0, 0.005)
./machine_learning/decision_tree.py:181:32 - Unknown word (squarred) -- doctest.testmod(name="mean_squarred_error", verbose=True
./machine_learning/decision_tree.py:39:19 - Unknown word (ndim) -- if labels.ndim != 1:
./machine_learning/forecasting/run.py:137:14 - Unknown word (reression) -- # for linear reression & sarimax
./machine_learning/forecasting/run.py:16:6 - Unknown word (sklearn) -- from sklearn.preprocessing import
./machine_learning/forecasting/run.py:22:44 - Unknown word (mtch) -- train_usr: list, train_mtch: list, test_dt: list
./machine_learning/forecasting/run.py:43:45 - Unknown word (exog) -- data (total_user, with exog data = total_event)
./machine_learning/forecasting/run.py:53:27 - Unknown word (disp) -- model_fit = model.fit(disp=False, maxiter=600,
./machine_learning/gradient_boosting_regressor.py:29:19 - Unknown word (iloc) -- X = df_boston.iloc[:, :-1]
./machine_learning/gradient_descent.py:119:13 - Unknown word (atol) -- atol=absolute_error_limit
./machine_learning/gradient_descent.py:120:13 - Unknown word (rtol) -- rtol=relative_error_limit
./machine_learning/k_means_clust.py:14:57 - Unknown word (hetrogeneity) -- will be filled with hetrogeneity values if passed
./machine_learning/k_means_clust.py:15:8 - Unknown word (kmeans) -- to kmeans func.
./machine_learning/k_means_clust.py:237:12 - Unknown word (fillna) -- df.fillna(value=FillMissingReport
./machine_learning/k_means_clust.py:239:30 - Unknown word (dtypes) -- numeric_cols = df.select_dtypes(np.number).columns
./machine_learning/k_means_clust.py:317:29 - Unknown word (clustert) -- concat report with clustert size and nan values
./machine_learning/k_means_clust.py:318:41 - Unknown word (isin) -- report["Features"].isin(ClusteringVariables
./machine_learning/k_means_clust.py:52:16 - Unknown word (CLUST) -- TAG = "K-MEANS-CLUST/ "
./machine_learning/linear_regression.py:7:56 - Unknown word (CSGO) -- particular code, I had used a CSGO dataset (ADR vs
./machine_learning/logistic_regression.py:14:1 - Unknown word (Coursera) -- Coursera ML course
./machine_learning/logistic_regression.py:21:7 - Unknown word (ipython) -- # get_ipython().run_line_magic('matplotlib
./machine_learning/logistic_regression.py:83:5 - Unknown word (probs) -- probs = predict_prob(grid
./machine_learning/lstm/lstm_prediction.py:2:38 - Unknown word (LSTM) -- Long Short Term Memory (LSTM) network model
./machine_learning/multilayer_perceptron_classifier.py:8:13 - Unknown word (lbfgs) -- solver="lbfgs", alpha=1e-5, hidden
./machine_learning/polymonial_regression.py:30:9 - Unknown word (polymonial) -- def viz_polymonial():
./machine_learning/scoring_functions.py:133:5 - Unknown word (denumerator) -- denumerator = np.sum(actual) / len
./machine_learning/scoring_functions.py:4:15 - Unknown word (RMSE) -- MAE, MSE, RMSE, RMSLE are included
./machine_learning/scoring_functions.py:4:21 - Unknown word (RMSLE) -- MAE, MSE, RMSE, RMSLE are included.
./machine_learning/scoring_functions.py:62:5 - Unknown word (rmse) -- def rmse(predict, actual):
./machine_learning/scoring_functions.py:84:5 - Unknown word (rmsle) -- def rmsle(predict, actual):
./machine_learning/sequential_minimum_optimization.py:21:51 - Unknown word (coef) -- kernel='poly', degree=3., coef0=1., gamma=0.5)
./machine_learning/sequential_minimum_optimization.py:229:9 - Unknown word (locis) -- locis = yield from self._choose
./machine_learning/sequential_minimum_optimization.py:239:16 - Unknown word (voilate) -- voilate kkt condition.
./machine_learning/sequential_minimum_optimization.py:382:7 - Unknown word (Normalise) -- # Normalise data using min_max way
./machine_learning/sequential_minimum_optimization.py:470:62 - Unknown word (MSIE) -- Mozilla/4.0 (compatible; MSIE 5.5; Windows NT)"},
./machine_learning/sequential_minimum_optimization.py:47:30 - Unknown word (wdbc) -- breast-cancer-wisconsin/wdbc.data"
./machine_learning/sequential_minimum_optimization.py:481:17 - Unknown word (dropna) -- data = data.dropna(axis=0)
./machine_learning/sequential_minimum_optimization.py:490:5 - Unknown word (mykernel) -- mykernel = Kernel(kernel="rbf
./machine_learning/sequential_minimum_optimization.py:494:5 - Unknown word (mysvm) -- mysvm = SmoSVM(
./machine_learning/sequential_minimum_optimization.py:544:21 - Unknown word (hstack) -- train_data = np.hstack((train_y.reshape(50
./machine_learning/sequential_minimum_optimization.py:582:78 - Unknown word (desity) -- distributed points with high desity and
./machine_learning/sequential_minimum_optimization.py:591:5 - Unknown word (yrange) -- yrange = np.linspace(train
./machine_learning/support_vector_machines.py:13:5 - Unknown word (Linearsvc) -- def Linearsvc(train_x, train_y):
./machine_learning/support_vector_machines.py:36:6 - Unknown word (virginica) -- 'virginica'
./machine_learning/support_vector_machines.py:6:55 - Unknown word (SVM's) -- plementing different types of SVM's
./maths/bailey_borwein_plouffe.py:1:12 - Unknown word (borwein) -- def bailey_borwein_plouffe(digit_position
./maths/bailey_borwein_plouffe.py:1:20 - Unknown word (plouffe) -- def bailey_borwein_plouffe(digit_position: int
./maths/binary_exponentiation.py:3:12 - Unknown word (Junth) -- # Author : Junth Basnet
./maths/binary_exponentiation_2.py:9:11 - Unknown word (chinmoy) -- * @author chinmoy159
./maths/chudnovsky_algorithm.py:12:28 - Unknown word (multinomial) -- = constant_term / ((multinomial_term * linear_term)
./maths/chudnovsky_algorithm.py:44:18 - Unknown word (prec) -- getcontext().prec = precision
./maths/collatz_sequence.py:4:5 - Unknown word (collatz) -- def collatz_sequence(n: int) ->
./maths/entropy.py:28:35 - Unknown word (overfulfilment) -- "babbling and the overfulfilment")
./maths/euclidean_distance.py:22:31 - Unknown word (asarray) -- return np.sqrt(np.sum((np.asarray(vector_1) - np.asarray
./maths/euclidean_gcd.py:20:26 - Unknown word (euclicedan) -- Recursive method for euclicedan gcd algorithm
./maths/eulers_totient.py:2:5 - Unknown word (totient) -- def totient(n: int) -> list:
./maths/eulers_totient.py:4:5 - Unknown word (totients) -- totients = [i - 1 for i in range
./maths/extended_euclidean_algorithm.py:10:15 - Unknown word (Sharma) -- # @Author: S. Sharma <silentcat>
./maths/extended_euclidean_algorithm.py:13:24 - Unknown word (pikulet) -- Last modified by: pikulet
./maths/extended_euclidean_algorithm.py:56:9 - Unknown word (coeff) -- old_coeff_a, coeff_a = 1, 0
./maths/extended_euclidean_algorithm.py:5:41 - Unknown word (Bezout's) -- bn = gcd(m, n) (a.k.a Bezout's Identity)
./maths/fibonacci.py:6:12 - Unknown word (Phin) -- an = [ Phin - (phi)n ]/Sqrt[5]
./maths/fibonacci_sequence_recursion.py:4:11 - Unknown word (fibo) -- def recur_fibo(n: int) -> int:
./maths/integration_by_simpson_approx.py:29:19 - Unknown word (fxdx) -- 1. integration of fxdx with limit a to b is
./maths/integration_by_simpson_approx.py:43:28 - Unknown word (integraion) -- b : upper limit of integraion
./maths/is_square_free.py:18:26 - Unknown word (repition) -- it simply checks for repition in the numbers.
./maths/jaccard_similarity.py:17:13 - Unknown word (similariy) -- def jaccard_similariy(setA, setB, alternativeUnion
./maths/jaccard_similarity.py:17:5 - Unknown word (jaccard) -- def jaccard_similariy(setA, setB
./maths/jaccard_similarity.py:8:38 - Unknown word (MMDS) -- of Massive Datasets [MMDS 2nd Edition, Chapter
./maths/kadanes.py:26:5 - Unknown word (kadanes) -- def kadanes(arr: list) -> int:
./maths/kadanes.py:2:1 - Unknown word (Kadane's) -- Kadane's algorithm to get maximum
./maths/kadanes.py:61:37 - Unknown word (sepatated) -- Enter integer values sepatated by spaces")
./maths/krishnamurthy_number.py:26:5 - Unknown word (krishnamurthy) -- def krishnamurthy(number: int) -> bool
./maths/krishnamurthy_number.py:45:51 - Unknown word (Krisnamurthy) -- whether a number is a Krisnamurthy Number or not.")
./maths/largest_of_very_large_numbers.py:1:11 - Unknown word (Abhijeeth) -- # Author: Abhijeeth S
./maths/least_common_multiple.py:17:12 - Unknown word (mult) -- common_mult = max_num
./maths/lucas_lehmer_primality_test.py:16:11 - Unknown word (lehmer) -- def lucas_lehmer_test(p: int) -> bool
./maths/lucas_lehmer_primality_test.py:2:58 - Unknown word (primality) -- Lehmer test (LLT) is a primality test for Mersenne
./maths/lucas_lehmer_primality_test.py:2:77 - Unknown word (Mersenne) -- a primality test for Mersenne
./maths/mobius_function.py:12:5 - Unknown word (mobius) -- def mobius(n: int) -> int:
./maths/monte_carlo.py:2:10 - Unknown word (Matteo) -- @author: MatteoRaso
./maths/monte_carlo.py:2:16 - Unknown word (Raso) -- @author: MatteoRaso
./maths/primelib.py:540:74 - Unknown word (Divisiors) -- Error in function getDivisiors(...)"
./maths/primelib.py:84:14 - Unknown word (erathostenes) -- sieve of erathostenes.
./maths/qr_decomposition.py:21:18 - Unknown word (BLAS) -- version from BLAS should be used.
./maths/qr_decomposition.py:37:24 - Unknown word (triu) -- >>> np.allclose(np.triu(R), R)
./maths/quadratic_equations_complex_numbers.py:27:35 - Unknown word (imag) -- .real if not root_1.imag else root_1,
./maths/quadratic_equations_complex_numbers.py:3:6 - Unknown word (cmath) -- from cmath import sqrt
./maths/radix2_fft.py:5:8 - Unknown word (mpmath) -- import mpmath # for roots of unity
./maths/radix2_fft.py:91:14 - Unknown word (ncol) -- next_ncol = self.C_max_length
./maths/runge_kutta.py:4:11 - Unknown word (kutta) -- def runge_kutta(f, y0, x0, h, x_end
./maths/runge_kutta.py:4:5 - Unknown word (runge) -- def runge_kutta(f, y0, x0, h,
./maths/sieve_of_eratosthenes.py:10:25 - Unknown word (Simas) -- doctest provider: Bruno Simas Hadlich (https://github
./maths/sieve_of_eratosthenes.py:10:31 - Unknown word (Hadlich) -- provider: Bruno Simas Hadlich (https://github.com
./maths/sieve_of_eratosthenes.py:11:16 - Unknown word (Dmitry) -- Also thanks to Dmitry (https://github.com
./maths/softmax.py:6:8 - Unknown word (exponentials) -- to the exponentials of the input numbers
./maths/square_root.py:25:20 - Unknown word (aproximated) -- Square root is aproximated using Newtons method
./maths/two_sum.py:36:9 - Unknown word (compl) -- compl = target - val
./maths/zellers_congruence.py:5:5 - Unknown word (zeller) -- def zeller(date_input: str) ->
./matrix/matrix_class.py:37:23 - Unknown word (Cofactors) -- Identity, Minors, Cofactors and Adjugate are returned
./matrix/matrix_class.py:37:37 - Unknown word (Adjugate) -- Minors, Cofactors and Adjugate are returned as Matrices
./matrix/matrix_class.py:47:22 - Unknown word (cofactors) -- >>> print(matrix.cofactors())
./matrix/matrix_class.py:51:55 - Unknown word (cofactor) -- to the nature of the cofactor matrix
./matrix/matrix_class.py:52:22 - Unknown word (adjugate) -- >>> print(matrix.adjugate())
./matrix/sherman_morrison.py:216:13 - Unknown word (ainv) -- >>> ainv = Matrix(3, 3, 0)
./matrix/spiral_print.py:43:11 - Unknown word (horizotal) -- # horizotal printing increasing
./matrix/tests/test_matrix_operation.py:18:40 - Unknown word (matop) -- matrix_operation as matop
./matrix/tests/test_matrix_operation.py:46:9 - Unknown word (theo) -- theo = matop.add(mat1, mat
./neural_network/2_hidden_layers_neural_network.py:101:46 - Unknown word (sogmoid) -- using derivative of sogmoid activation function
./neural_network/2_hidden_layers_neural_network.py:101:9 - Unknown word (Updation) -- Updation is done using derivative
./neural_network/back_propagation_neural_network.py:124:28 - Unknown word (ydata) -- def train(self, xdata, ydata, train_round, accuracy
./neural_network/back_propagation_neural_network.py:128:22 - Unknown word (hlines) -- self.ax_loss.hlines(self.accuracy, 0, self
./neural_network/back_propagation_neural_network.py:53:26 - Unknown word (asmatrix) -- self.weight = np.asmatrix(np.random.normal(0,
./neural_network/back_propagation_neural_network.py:67:35 - Unknown word (xdata) -- forward_propagation(self, xdata):
./neural_network/back_propagation_neural_network.py:97:7 - Unknown word (BPNN) -- class BPNN:
./neural_network/convolution_neural_network.py:107:31 - Unknown word (convs) -- convolute(self, data, convs, w_convs, thre_convs
./neural_network/convolution_neural_network.py:211:25 - Unknown word (datas) -- self, patterns, datas_train, datas_teach,
./neural_network/convolution_neural_network.py:227:35 - Unknown word (conved) -- data_focus1, data_conved1 = self.convolute(
./neural_network/convolution_neural_network.py:297:13 - Unknown word (yplot) -- yplot = [error_accuracy for
./neural_network/convolution_neural_network.py:305:43 - Unknown word (Complished) -- -----------Training Complished--------------------
./neural_network/convolution_neural_network.py:42:19 - Unknown word (thre) -- self.rate_thre = rate_t
./other/davis–putnam–logemann–loveland.py:152:21 - Unknown word (uncomplemented) -- A symbol is the uncomplemented form of a literal.
./other/davis–putnam–logemann–loveland.py:257:13 - Unknown word (Fcount) -- Fcount, Ncount = 0, 0
./other/davis–putnam–logemann–loveland.py:257:21 - Unknown word (Ncount) -- Fcount, Ncount = 0, 0
./other/davis–putnam–logemann–loveland.py:275:5 - Unknown word (dpll) -- def dpll_algorithm(
./other/davis–putnam–logemann–loveland.py:4:33 - Unknown word (DPLL) -- Putnam–Logemann–Loveland (DPLL) algorithm is a complete
./other/davis–putnam–logemann–loveland.py:5:35 - Unknown word (satisfiability) -- algorithm for deciding the satisfiability of propositional logic
./other/davis–putnam–logemann–loveland.py:6:73 - Unknown word (Tisfiability) -- Conjunctive Normal Form SATisfiability
./other/dijkstra_bankers_algorithm.py:4:13 - Unknown word (Biney) -- # "Author: "Biney Kingsley (bluedistro
./other/dijkstra_bankers_algorithm.py:80:27 - Unknown word (alloc) -- max_claim[i][j] - alloc_table[i][j] <= avail
./other/doomsday.py:42:5 - Unknown word (centurian) -- centurian = year % 100
./other/gauss_easter.py:24:5 - Unknown word (metonic) -- metonic_cycle = year % 19
./other/graham_scan.py:166:54 - Unknown word (straigh) -- previous points on those straigh line is not convex hull
./other/graham_scan.py:43:5 - Unknown word (minidx) -- minidx = 0
./other/graham_scan.py:44:5 - Unknown word (miny) -- miny, minx = maxsize, maxsize
./other/graham_scan.py:86:22 - Unknown word (insteadly) -- # and you should insteadly add (minx, miny) into
./other/greedy.py:45:18 - Unknown word (Sambhar) -- ... "Sambhar", "Chicken", "Fries
./other/password_generator.py:24:3 - Unknown word (ctbi) -- # ctbi= characters that must
./other/password_generator.py:45:19 - Unknown word (generalised) -- # random is a generalised function for letters
./other/scoring_algorithm.py:24:5 - Unknown word (procentual) -- >>> procentual_proximity([[20, 60,
./other/scoring_algorithm.py:2:15 - Unknown word (markmelnic) -- developed by: markmelnic
./other/scoring_algorithm.py:51:9 - Unknown word (dlist) -- for dlist, weight in zip(data
./other/scoring_algorithm.py:53:9 - Unknown word (maxd) -- maxd = max(dlist)
./other/scoring_algorithm.py:5:34 - Unknown word (percentual) -- using a range based percentual proximity algorithm
./other/scoring_algorithm.py:81:12 - Unknown word (slist) -- for i, slist in enumerate(score_lists
./other/sdes.py:36:11 - Unknown word (sbox) -- def apply_sbox(s, data):
./other/sdes.py:97:29 - Unknown word (decypting) -- print("Plain text after decypting is:", PT)
./physics/n_body_simulation.py:229:32 - Unknown word (ylim) -- xlim=(x_start, x_end), ylim=(y_start, y_end)
./physics/n_body_simulation.py:229:9 - Unknown word (xlim) -- xlim=(x_start, x_end), ylim
./physics/n_body_simulation.py:248:41 - Unknown word (blit) -- interval=INTERVAL, blit=True
./project_euler/README.md:66:4 - Unknown word (Stackoverflow) -- - [Stackoverflow link]
./project_euler/README.md:81:6 - Unknown word (Doctest) -- [Doctest]
./project_euler/problem_001/sol4.py:27:5 - Unknown word (xmulti) -- xmulti = []
./project_euler/problem_001/sol4.py:28:5 - Unknown word (zmulti) -- zmulti = []
./project_euler/problem_001/sol5.py:16:23 - Unknown word (pythonic) -- A straightforward pythonic solution using list
./project_euler/problem_005/sol1.py:57:9 - Unknown word (nfound) -- nfound = 0
./project_euler/problem_011/sol1.py:43:13 - Unknown word (horz) -- horzProduct = grid[i][j]
./project_euler/problem_020/sol1.py:48:5 - Unknown word (nfact) -- nfact = factorial(num)
./project_euler/problem_023/sol1.py:31:8 - Unknown word (Divs) -- sumDivs = [1] * (limit + 1)
./project_euler/problem_023/sol1.py:38:5 - Unknown word (abundants) -- abundants = set()
./project_euler/problem_035/sol1.py:14:27 - Unknown word (Seive) -- 1 million using the Seive of Eratosthenes. Then
./project_euler/problem_035/sol1.py:20:1 - Unknown word (seive) -- seive = [True] * 1000001
./project_euler/problem_037/sol1.py:6:54 - Unknown word (truncatable) -- primes that are both truncatable from left to right
./project_euler/problem_038/sol1.py:21:61 - Unknown word (concactenation) -- the solution will be a concactenation of
./project_euler/problem_039/sol1.py:8:57 - Unknown word (maximised) -- number of solutions maximised?
./project_euler/problem_043/sol1.py:46:5 - Unknown word (divisiility) -- divisiility tests.
./project_euler/problem_044/sol1.py:11:37 - Unknown word (minimised) -- and D = |Pk − Pj| is minimised; what is the value of
./project_euler/problem_045/sol1.py:11:5 - Unknown word (trinagle) -- All trinagle numbers are hexagonal
./project_euler/problem_045/sol1.py:46:38 - Unknown word (traingular) -- next number which is traingular, pentagonal and hexagonal
./project_euler/problem_047/sol1.py:2:1 - Unknown word (Combinatoric) -- Combinatoric selections
./project_euler/problem_050/sol1.py:23:14 - Unknown word (Erotosthenes) -- Sieve of Erotosthenes
./project_euler/problem_050/sol1.py:55:42 - Unknown word (celing) -- biggest prime, below the celing, that can be written
./project_euler/problem_054/sol1.py:114:50 - Unknown word (ueen) -- 9, T(en), J(ack), Q(ueen), K(ing), A(ce)
./project_euler/problem_054/sol1.py:117:11 - Unknown word (pades) -- S(pades), H(earts), D(iamonds
./project_euler/problem_054/sol1.py:117:21 - Unknown word (earts) -- S(pades), H(earts), D(iamonds), C(lubs
./project_euler/problem_054/sol1.py:117:31 - Unknown word (iamonds) -- pades), H(earts), D(iamonds), C(lubs)
./project_euler/problem_054/sol1.py:117:43 - Unknown word (lubs) -- earts), D(iamonds), C(lubs)
./project_euler/problem_054/sol1.py:145:53 - Unknown word (Stright) -- 2H 3H 4H 5H 6H") # Stright flush
./project_euler/problem_054/test_poker_hand.py:140:11 - Unknown word (oppo) -- play, oppo = randrange(len(SORTED
./project_euler/problem_055/sol1.py:2:1 - Unknown word (Lychrel) -- Lychrel numbers
./project_euler/problem_055/sol1.py:58:30 - Unknown word (lychrel) -- Returns the count of all lychrel numbers below limit
./project_euler/problem_059/sol1.py:38:11 - Unknown word (INTS) -- LOWERCASE_INTS: List[int] = [ord(letter
./project_euler/problem_059/sol1.py:93:30 - Unknown word (asfla) -- filter_common_word(['asfla adf', 'I am here',
./project_euler/problem_059/sol1.py:95:30 - Unknown word (athla) -- filter_common_word(['athla amf', 'I am here',
./project_euler/problem_065/sol1.py:14:21 - Unknown word (convergents) -- Let us consider the convergents for sqrt(2).
./project_euler/problem_087/sol1.py:42:17 - Unknown word (tetr) -- tetr = prime3 * prime3 *
./project_euler/problem_089/sol1.py:13:1 - Unknown word (VVIIIIII) -- VVIIIIII
./project_euler/problem_089/sol1.py:15:1 - Unknown word (VVVI) -- VVVI
./project_euler/problem_091/sol1.py:5:43 - Unknown word (ΔOPQ) -- origin, O(0,0), to form ΔOPQ.
./project_euler/problem_101/sol1.py:132:5 - Unknown word (coeffs) -- coeffs: Matrix
./project_euler/problem_107/sol1.py:110:5 - Unknown word (adjaceny) -- adjaceny_matrix = [line.split
./project_euler/problem_113/sol1.py:50:16 - Unknown word (upto) -- def non_bouncy_upto(n: int) -> int:
./project_euler/problem_113/sol1.py:65:5 - Unknown word (Caclulate) -- Caclulate the number of non-bouncy
./project_euler/problem_135/sol1.py:45:52 - Unknown word (divisble) -- difference % 4: # d must be divisble by 4
./project_euler/problem_180/sol1.py:40:75 - Unknown word (uniquq) -- <= 0. We use a set "uniquq_s"
./project_euler/problem_188/sol1.py:23:6 - Unknown word (modexpt) -- def _modexpt(base: int, exponent
./project_euler/problem_188/sol1.py:58:39 - Unknown word (assiciative) -- base↑↑height by right-assiciative repeated modular
./project_euler/problem_191/sol1.py:15:11 - Unknown word (OOOL) -- OOOO OOOA OOOL OOAO OOAA OOAL OOLO
./project_euler/problem_191/sol1.py:15:16 - Unknown word (OOAO) -- OOOO OOOA OOOL OOAO OOAA OOAL OOLO OOLA
./project_euler/problem_191/sol1.py:15:21 - Unknown word (OOAA) -- OOOO OOOA OOOL OOAO OOAA OOAL OOLO OOLA OAOO
./project_euler/problem_191/sol1.py:15:26 - Unknown word (OOAL) -- OOOA OOOL OOAO OOAA OOAL OOLO OOLA OAOO OAOA
./project_euler/problem_191/sol1.py:15:31 - Unknown word (OOLO) -- OOOL OOAO OOAA OOAL OOLO OOLA OAOO OAOA
./project_euler/problem_191/sol1.py:15:36 - Unknown word (OOLA) -- OOAO OOAA OOAL OOLO OOLA OAOO OAOA
./project_euler/problem_191/sol1.py:15:41 - Unknown word (OAOO) -- OOAA OOAL OOLO OOLA OAOO OAOA
./project_euler/problem_191/sol1.py:15:46 - Unknown word (OAOA) -- OOAL OOLO OOLA OAOO OAOA
./project_euler/problem_191/sol1.py:15:6 - Unknown word (OOOA) -- OOOO OOOA OOOL OOAO OOAA OOAL
./project_euler/problem_191/sol1.py:16:1 - Unknown word (OAOL) -- OAOL OAAO OAAL OALO OALA
./project_euler/problem_191/sol1.py:16:11 - Unknown word (OAAL) -- OAOL OAAO OAAL OALO OALA OLOO OLOA
./project_euler/problem_191/sol1.py:16:16 - Unknown word (OALO) -- OAOL OAAO OAAL OALO OALA OLOO OLOA OLAO
./project_euler/problem_191/sol1.py:16:21 - Unknown word (OALA) -- OAOL OAAO OAAL OALO OALA OLOO OLOA OLAO OLAA
./project_euler/problem_191/sol1.py:16:26 - Unknown word (OLOO) -- OAAO OAAL OALO OALA OLOO OLOA OLAO OLAA AOOO
./project_euler/problem_191/sol1.py:16:31 - Unknown word (OLOA) -- OAAL OALO OALA OLOO OLOA OLAO OLAA AOOO
./project_euler/problem_191/sol1.py:16:36 - Unknown word (OLAO) -- OALO OALA OLOO OLOA OLAO OLAA AOOO
./project_euler/problem_191/sol1.py:16:41 - Unknown word (OLAA) -- OALA OLOO OLOA OLAO OLAA AOOO
./project_euler/problem_191/sol1.py:16:46 - Unknown word (AOOO) -- OLOO OLOA OLAO OLAA AOOO
./project_euler/problem_191/sol1.py:16:6 - Unknown word (OAAO) -- OAOL OAAO OAAL OALO OALA OLOO
./project_euler/problem_191/sol1.py:17:1 - Unknown word (AOOA) -- AOOA AOOL AOAO AOAA AOAL
./project_euler/problem_191/sol1.py:17:11 - Unknown word (AOAO) -- AOOA AOOL AOAO AOAA AOAL AOLO AOLA
./project_euler/problem_191/sol1.py:17:16 - Unknown word (AOAA) -- AOOA AOOL AOAO AOAA AOAL AOLO AOLA AAOO
./project_euler/problem_191/sol1.py:17:21 - Unknown word (AOAL) -- AOOA AOOL AOAO AOAA AOAL AOLO AOLA AAOO AAOA
./project_euler/problem_191/sol1.py:17:26 - Unknown word (AOLO) -- AOOL AOAO AOAA AOAL AOLO AOLA AAOO AAOA AAOL
./project_euler/problem_191/sol1.py:17:31 - Unknown word (AOLA) -- AOAO AOAA AOAL AOLO AOLA AAOO AAOA AAOL
./project_euler/problem_191/sol1.py:17:36 - Unknown word (AAOO) -- AOAA AOAL AOLO AOLA AAOO AAOA AAOL
./project_euler/problem_191/sol1.py:17:41 - Unknown word (AAOA) -- AOAL AOLO AOLA AAOO AAOA AAOL
./project_euler/problem_191/sol1.py:17:46 - Unknown word (AAOL) -- AOLO AOLA AAOO AAOA AAOL
./project_euler/problem_191/sol1.py:17:6 - Unknown word (AOOL) -- AOOA AOOL AOAO AOAA AOAL AOLO
./project_euler/problem_191/sol1.py:18:1 - Unknown word (AALO) -- AALO AALA ALOO ALOA ALAO
./project_euler/problem_191/sol1.py:18:11 - Unknown word (ALOO) -- AALO AALA ALOO ALOA ALAO ALAA LOOO
./project_euler/problem_191/sol1.py:18:16 - Unknown word (ALOA) -- AALO AALA ALOO ALOA ALAO ALAA LOOO LOOA
./project_euler/problem_191/sol1.py:18:21 - Unknown word (ALAO) -- AALO AALA ALOO ALOA ALAO ALAA LOOO LOOA LOAO
./project_euler/problem_191/sol1.py:18:26 - Unknown word (ALAA) -- AALA ALOO ALOA ALAO ALAA LOOO LOOA LOAO LOAA
./project_euler/problem_191/sol1.py:18:31 - Unknown word (LOOO) -- ALOO ALOA ALAO ALAA LOOO LOOA LOAO LOAA
./project_euler/problem_191/sol1.py:18:36 - Unknown word (LOOA) -- ALOA ALAO ALAA LOOO LOOA LOAO LOAA
./project_euler/problem_191/sol1.py:18:41 - Unknown word (LOAO) -- ALAO ALAA LOOO LOOA LOAO LOAA
./project_euler/problem_191/sol1.py:18:46 - Unknown word (LOAA) -- ALAA LOOO LOOA LOAO LOAA
./project_euler/problem_191/sol1.py:18:6 - Unknown word (AALA) -- AALO AALA ALOO ALOA ALAO ALAA
./project_euler/problem_191/sol1.py:19:1 - Unknown word (LAOO) -- LAOO LAOA LAAO
./project_euler/problem_191/sol1.py:19:11 - Unknown word (LAAO) -- LAOO LAOA LAAO
./project_euler/problem_191/sol1.py:19:6 - Unknown word (LAOA) -- LAOO LAOA LAAO
./project_euler/problem_191/sol1.py:82:11 - Unknown word (ontime) -- state_ontime = _calculate(days -
./project_euler/problem_551/sol1.py:34:20 - Unknown word (calulcated) -- Term are calulcated until c > 10^k or the
./quantum/README.md:8:3 - Unknown word (Rigetti) -- * Rigetti: https://rigetti.com
./quantum/deutsch_jozsa.py:107:11 - Unknown word (Aer's) -- # Use Aer's qasm_simulator
./quantum/deutsch_jozsa.py:107:17 - Unknown word (qasm) -- # Use Aer's qasm_simulator
./quantum/deutsch_jozsa.py:25:8 - Unknown word (qiskit) -- import qiskit as q
./quantum/deutsch_jozsa.py:28:30 - Unknown word (qubits) -- oracle(case: str, num_qubits: int) -> q.QuantumCircuit
./quantum/deutsch_jozsa.py:35:23 - Unknown word (qubit) -- # plus one output qubit
./quantum/deutsch_jozsa.py:3:9 - Unknown word (Josza) -- Deutsch-Josza Algorithm is one of
./quantum/deutsch_jozsa.py:40:62 - Unknown word (CNOTs) -- that tells us which CNOTs to
./quantum/deutsch_jozsa.py:46:11 - Unknown word (correspopnds) -- # correspopnds to a qubit, if the digit
./quantum/deutsch_jozsa.py:75:26 - Unknown word (Deustch) -- Returns the complete Deustch-Jozsa Quantum Circuit
./quantum/deutsch_jozsa.py:76:41 - Unknown word (Hadamard) -- Output registers and Hadamard & Measurement Gates
./quantum/deutsch_jozsa.py:98:13 - Unknown word (jozsa) -- def deutsch_jozsa(case: str, num_qubits
./quantum/half_adder.py:38:11 - Unknown word (cnots) -- # use cnots to write XOR of the
./quantum/half_adder.py:42:17 - Unknown word (toffoli) -- # use ccx / toffoli gate to write AND of
./quantum/not_gate.py:25:29 - Unknown word (Qubits) -- Apply X (NOT) Gate to Qubits 0 & 1
./quantum/not_gate.py:6:1 - Unknown word (Qiskit) -- Qiskit Docs: https://qiskit
./quantum/quantum_entanglement.py:42:22 - Unknown word (CNOT) -- # Adding CX (CNOT) gate
./quantum/ripple_adder_classic.py:64:50 - Unknown word (hadamard'd) -- from doing this with hadamard'd bits :)
./scheduling/shortest_job_first.py:126:43 - Unknown word (brust) -- the arrival time and brust time for process:--
./scheduling/shortest_job_first.py:138:5 - Unknown word (fcfs) -- fcfs = pd.DataFrame(
./scheduling/shortest_job_first.py:32:5 - Unknown word (minm) -- minm = 999999999
./scheduling/shortest_job_first.py:63:13 - Unknown word (finar) -- finar = finish_time - arrival
./scripts/build_directory_md.py:15:59 - Unknown word (ipynb) -- filename)[1] in (".py", ".ipynb"):
./scripts/validate_filenames.py:27:1 - Unknown word (nodir) -- nodir_files = [file for file
./searches/fibonacci_search.py:109:13 - Unknown word (fibb) -- fibb_k = i
./sorts/bead_sort.py:2:39 - Unknown word (nonegative) -- works for sequences of nonegative integers.
./sorts/bitonic_sort.py:40:5 - Unknown word (bitonic) -- def bitonic_merge(array: List[int
./sorts/bogo_sort.py:2:45 - Unknown word (bogosort) -- implementation of the bogosort algorithm,
./sorts/bogo_sort.py:4:1 - Unknown word (Bogosort) -- Bogosort generates random permutations
./sorts/bogo_sort.py:9:22 - Unknown word (bogo) -- python -m doctest -v bogo_sort.py
./sorts/comb_sort.py:3:75 - Unknown word (Wlodzimierz) -- originally designed by Wlodzimierz
./sorts/comb_sort.py:4:1 - Unknown word (Dobosiewicz) -- Dobosiewicz in 1980. It was rediscovered
./sorts/counting_sort.py:62:6 - Unknown word (eghhiiinrsssttt) -- 'eghhiiinrsssttt'
./sorts/external_sort.py:85:9 - Unknown word (unshift) -- def unshift(self, index):
./sorts/gnome_sort.py:34:8 - Unknown word (Gadeimnoprstu) -- ' !Gadeimnoprstu'
./sorts/iterative_merge_sort.py:3:9 - Unknown word (Aman) -- Author: Aman Gupta
./sorts/msd_radix_sort.py:79:5 - Unknown word (Inplace) -- Inplace implementation of the
./sorts/natural_sort.py:27:9 - Unknown word (alphanum) -- def alphanum_key(key):
./sorts/normal_distribution_quick_sort.md:16:12 - Unknown word (numpy) -- >>> import numpy as np
./sorts/normal_distribution_quick_sort.md:17:10 - Unknown word (tempfile) -- >>> from tempfile import TemporaryFile
./sorts/normal_distribution_quick_sort.md:18:5 - Unknown word (outfile) -- >>> outfile = TemporaryFile()
./sorts/normal_distribution_quick_sort.md:36:97 - Unknown word (linewidth) -- / (2 * sigma**2) ),linewidth=2, color='r')
./sorts/normal_distribution_quick_sort.md:58:11 - Unknown word (matplotlib) -- >>>import matplotlib.pyplot as plt
./sorts/normal_distribution_quick_sort.md:61:14 - Unknown word (Disrtibution) -- # Normal Disrtibution QuickSort is red
./sorts/odd_even_transposition_single_threaded.py:4:55 - Unknown word (transpostiion) -- implementation of odd-even transpostiion sort.
./sorts/quick_sort_3_partition.py:21:16 - Unknown word (lomuto) -- def quick_sort_lomuto_partition(sorting: list
./sorts/quick_sort_3_partition.py:24:10 - Unknown word (Lomuto) -- with Lomuto partition scheme:
./sorts/shell_sort.py:19:14 - Unknown word (Ciura's) -- # Marcin Ciura's gap sequence
./sorts/shell_sort.py:19:7 - Unknown word (Marcin) -- # Marcin Ciura's gap sequence
./sorts/slowsort.py:5:53 - Unknown word (Stolfi) -- Andrei Broder and Jorge Stolfi
./sorts/slowsort.py:6:40 - Unknown word (Simplexity) -- Pessimal Algorithms and Simplexity Analysis
./sorts/topological_sort.py:13:16 - Unknown word (topolical) -- """Perform topolical sort on a directed acyclic
./strings/aho_corasick.py:7:14 - Unknown word (adlist) -- self.adlist = list()
./strings/alternative_string_arrange.py:10:6 - Unknown word (XAYBCD) -- 'XAYBCD'
./strings/alternative_string_arrange.py:12:6 - Unknown word (AXBYZ) -- 'AXBYZ'
./strings/alternative_string_arrange.py:8:6 - Unknown word (AXBYCD) -- 'AXBYCD'
./strings/anagrams.py:17:6 - Unknown word (bysig) -- word_bysig = collections.defaultdict
./strings/can_string_be_rearranged_as_palindrome.py:17:57 - Unknown word (Momo) -- palindrome_counter("Momo")
./strings/can_string_be_rearranged_as_palindrome.py:1:14 - Unknown word (susmith) -- # Created by susmith98
./strings/detecting_english_programmatically.py:48:20 - Unknown word (llold) -- >>> isEnglish('llold HorWd')
./strings/frequency_finder.py:32:1 - Unknown word (ETAOIN) -- ETAOIN = "ETAOINSHRDLCUMWFGYPBVKJXQZ
./strings/frequency_finder.py:32:11 - Unknown word (ETAOINSHRDLCUMWFGYPBVKJXQZ) -- ETAOIN = "ETAOINSHRDLCUMWFGYPBVKJXQZ"
./strings/jaro_winkler.py:10:33 - Unknown word (marhta) -- jaro_winkler("martha", "marhta")
./strings/jaro_winkler.py:14:31 - Unknown word (dbdbdbdb) -- jaro_winkler("test", "dbdbdbdb")
./strings/jaro_winkler.py:4:10 - Unknown word (winkler) -- def jaro_winkler(str1: str, str2: str
./strings/jaro_winkler.py:4:5 - Unknown word (jaro) -- def jaro_winkler(str1: str, str
./strings/knuth_morris_pratt.py:62:14 - Unknown word (alskfjaldsabc) -- text1 = "alskfjaldsabc1abc1abc12k23adsfabcabc
./strings/knuth_morris_pratt.py:62:40 - Unknown word (adsfabcabc) -- alskfjaldsabc1abc1abc12k23adsfabcabc"
./strings/knuth_morris_pratt.py:63:14 - Unknown word (alskfjaldsk) -- text2 = "alskfjaldsk23adsfabcabc"
./strings/knuth_morris_pratt.py:67:16 - Unknown word (ABABX) -- pattern = "ABABX"
./strings/knuth_morris_pratt.py:68:13 - Unknown word (ABABZABABYABABX) -- text = "ABABZABABYABABX"
./strings/knuth_morris_pratt.py:72:16 - Unknown word (AAAB) -- pattern = "AAAB"
./strings/knuth_morris_pratt.py:73:13 - Unknown word (ABAAAAAB) -- text = "ABAAAAAB"
./strings/knuth_morris_pratt.py:77:16 - Unknown word (abcdabcy) -- pattern = "abcdabcy"
./strings/knuth_morris_pratt.py:78:13 - Unknown word (abcxabcdabxabcdabcdabcy) -- text = "abcxabcdabxabcdabcdabcy"
./strings/knuth_morris_pratt.py:82:16 - Unknown word (aabaabaaa) -- pattern = "aabaabaaa"
./strings/lower.py:8:6 - Unknown word (hellzo) -- 'hellzo'
./strings/manacher.py:4:6 - Unknown word (abbba) -- 'abbba'
./strings/manacher.py:5:29 - Unknown word (ababa) -- palindromic_string('ababa')
./strings/naive_string_search.py:14:31 - Unknown word (ABAAABCDBBABCDDEBCABC) -- naive_pattern_search("ABAAABCDBBABCDDEBCABC", "ABC")
./strings/naive_string_search.py:22:31 - Unknown word (ABCDEGFTEST) -- naive_pattern_search("ABCDEGFTEST", "TEST")
./strings/prefix_function.py:17:60 - Unknown word (sufix) -- coincidence of prefix and sufix
./strings/prefix_function.py:22:26 - Unknown word (aabcdaabc) -- >> prefix_function("aabcdaabc")
./strings/prefix_function.py:24:26 - Unknown word (asdasdad) -- >> prefix_function("asdasdad")
./strings/prefix_function.py:54:25 - Unknown word (abcab) -- >>> longest_prefix("abcab")
./strings/rabin_karp.py:7:11 - Unknown word (karp) -- def rabin_karp(pattern: str, text:
./strings/rabin_karp.py:82:13 - Unknown word (Lüsai) -- text = "Lüsai"
./strings/reverse_letters.py:11:13 - Unknown word (nohty) -- 'I evol nohtyP'
./strings/reverse_letters.py:11:8 - Unknown word (evol) -- 'I evol nohtyP'
./strings/reverse_letters.py:7:10 - Unknown word (kciuq) -- 'ehT kciuq nworb xof depmuj revo
./strings/reverse_letters.py:7:16 - Unknown word (nworb) -- 'ehT kciuq nworb xof depmuj revo eht
./strings/reverse_letters.py:7:26 - Unknown word (depmuj) -- ehT kciuq nworb xof depmuj revo eht yzal .god'
./strings/reverse_letters.py:7:33 - Unknown word (revo) -- kciuq nworb xof depmuj revo eht yzal .god'
./strings/reverse_letters.py:7:42 - Unknown word (yzal) -- xof depmuj revo eht yzal .god'
./strings/reverse_letters.py:9:15 - Unknown word (eurt) -- 'sI siht ?eurt'
./strings/reverse_letters.py:9:9 - Unknown word (siht) -- 'sI siht ?eurt'
./strings/swap_case.py:10:38 - Unknown word (mayur) -- sentence: github.com/mayur200
./strings/swap_case.py:11:14 - Unknown word (MAYUR) -- GITHUB.COM/MAYUR200
./strings/word_occurrence.py:1:14 - Unknown word (sarathkaul) -- # Created by sarathkaul on 17/11/19
./strings/word_occurrence.py:2:15 - Unknown word (Arkadip) -- # Modified by Arkadip Bhattacharya(@darkmatter
./strings/word_occurrence.py:2:23 - Unknown word (Bhattacharya) -- Modified by Arkadip Bhattacharya(@darkmatter18) on 2
./strings/word_occurrence.py:6:10 - Unknown word (occurence) -- def word_occurence(sentence: str) -> dict
./strings/z_function.py:27:21 - Unknown word (zxxzxxz) -- >>> z_function("zxxzxxz")
./web_programming/covid_stats_via_xpath.py:2:51 - Unknown word (worldometers) -- info fetching from worldometers site using lxml
./web_programming/covid_stats_via_xpath.py:2:75 - Unknown word (lxml) -- worldometers site using lxml
./web_programming/currency_converter.py:102:14 - Unknown word (Ariary) -- MGA Malagasy Ariary
./web_programming/currency_converter.py:104:5 - Unknown word (Myanma) -- MMK Myanma Kyat
./web_programming/currency_converter.py:11:14 - Unknown word (getenv) -- TESTING = os.getenv("CI", False)
./web_programming/currency_converter.py:122:14 - Unknown word (Nuevo) -- PEN Peruvian Nuevo Sol
./web_programming/currency_converter.py:135:5 - Unknown word (Seychellois) -- SCR Seychellois Rupee
./web_programming/currency_converter.py:140:12 - Unknown word (Leonean) -- SLL Sierra Leonean Leone
./web_programming/currency_converter.py:148:16 - Unknown word (Somoni) -- TJS Tajikistan Somoni
./web_programming/currency_converter.py:149:5 - Unknown word (Turkmenistani) -- TMT Turkmenistani Manat
./web_programming/currency_converter.py:151:11 - Unknown word (Paanga) -- TOP Tonga Paanga
./web_programming/currency_converter.py:27:5 - Unknown word (Aruban) -- AWG Aruban Florin
./web_programming/currency_converter.py:50:11 - Unknown word (Rican) -- CRC Costa Rican Colon
./web_programming/currency_converter.py:52:10 - Unknown word (Verdean) -- CVE Cape Verdean Escudo
./web_programming/currency_converter.py:54:5 - Unknown word (Djiboutian) -- DJF Djiboutian Franc
./web_programming/currency_converter.py:86:5 - Unknown word (Kyrgystani) -- KGS Kyrgystani Som
./web_programming/current_weather.py:12:32 - Unknown word (Kolkata) -- weather_forecast(q: str = "Kolkata, India", appid: str
./web_programming/emails_from_url.py:2:24 - Unknown word (Umer) -- author__ = "Muhammad Umer Farooq"
./web_programming/emails_from_url.py:2:29 - Unknown word (Farooq) -- author__ = "Muhammad Umer Farooq"
./web_programming/fetch_github_info.py:4:12 - Unknown word (lawric) -- Updated by lawric1 on 24/11/20
./web_programming/get_imdb_top_250_movies_csv.py:9:9 - Unknown word (imdb) -- def get_imdb_top_250_movies(url:
./web_programming/instagram_video.py:13:30 - Unknown word (IGTV) -- input("Enter Video/IGTV url: ").strip()