-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathnumba_optimized.html
More file actions
3319 lines (3118 loc) · 556 KB
/
numba_optimized.html
File metadata and controls
3319 lines (3118 loc) · 556 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
<!doctype html>
<html lang="en">
<head>
<meta charset="utf-8">
<meta name="viewport" content="width=device-width, initial-scale=1">
<meta name="generator" content="pdoc 16.0.0"/>
<title>models.numba_optimized API documentation</title>
<style>/*! * Bootstrap Reboot v5.0.0 (https://getbootstrap.com/) * Copyright 2011-2021 The Bootstrap Authors * Copyright 2011-2021 Twitter, Inc. * Licensed under MIT (https://github.com/twbs/bootstrap/blob/main/LICENSE) * Forked from Normalize.css, licensed MIT (https://github.com/necolas/normalize.css/blob/master/LICENSE.md) */*,::after,::before{box-sizing:border-box}@media (prefers-reduced-motion:no-preference){:root{scroll-behavior:smooth}}body{margin:0;font-family:system-ui,-apple-system,"Segoe UI",Roboto,"Helvetica Neue",Arial,"Noto Sans","Liberation Sans",sans-serif,"Apple Color Emoji","Segoe UI Emoji","Segoe UI Symbol","Noto Color Emoji";font-size:1rem;font-weight:400;line-height:1.5;color:#212529;background-color:#fff;-webkit-text-size-adjust:100%;-webkit-tap-highlight-color:transparent}hr{margin:1rem 0;color:inherit;background-color:currentColor;border:0;opacity:.25}hr:not([size]){height:1px}h1,h2,h3,h4,h5,h6{margin-top:0;margin-bottom:.5rem;font-weight:500;line-height:1.2}h1{font-size:calc(1.375rem + 1.5vw)}@media (min-width:1200px){h1{font-size:2.5rem}}h2{font-size:calc(1.325rem + .9vw)}@media (min-width:1200px){h2{font-size:2rem}}h3{font-size:calc(1.3rem + .6vw)}@media (min-width:1200px){h3{font-size:1.75rem}}h4{font-size:calc(1.275rem + .3vw)}@media (min-width:1200px){h4{font-size:1.5rem}}h5{font-size:1.25rem}h6{font-size:1rem}p{margin-top:0;margin-bottom:1rem}abbr[data-bs-original-title],abbr[title]{-webkit-text-decoration:underline dotted;text-decoration:underline dotted;cursor:help;-webkit-text-decoration-skip-ink:none;text-decoration-skip-ink:none}address{margin-bottom:1rem;font-style:normal;line-height:inherit}ol,ul{padding-left:2rem}dl,ol,ul{margin-top:0;margin-bottom:1rem}ol ol,ol ul,ul ol,ul ul{margin-bottom:0}dt{font-weight:700}dd{margin-bottom:.5rem;margin-left:0}blockquote{margin:0 0 1rem}b,strong{font-weight:bolder}small{font-size:.875em}mark{padding:.2em;background-color:#fcf8e3}sub,sup{position:relative;font-size:.75em;line-height:0;vertical-align:baseline}sub{bottom:-.25em}sup{top:-.5em}a{color:#0d6efd;text-decoration:underline}a:hover{color:#0a58ca}a:not([href]):not([class]),a:not([href]):not([class]):hover{color:inherit;text-decoration:none}code,kbd,pre,samp{font-family:SFMono-Regular,Menlo,Monaco,Consolas,"Liberation Mono","Courier New",monospace;font-size:1em;direction:ltr;unicode-bidi:bidi-override}pre{display:block;margin-top:0;margin-bottom:1rem;overflow:auto;font-size:.875em}pre code{font-size:inherit;color:inherit;word-break:normal}code{font-size:.875em;color:#d63384;word-wrap:break-word}a>code{color:inherit}kbd{padding:.2rem .4rem;font-size:.875em;color:#fff;background-color:#212529;border-radius:.2rem}kbd kbd{padding:0;font-size:1em;font-weight:700}figure{margin:0 0 1rem}img,svg{vertical-align:middle}table{caption-side:bottom;border-collapse:collapse}caption{padding-top:.5rem;padding-bottom:.5rem;color:#6c757d;text-align:left}th{text-align:inherit;text-align:-webkit-match-parent}tbody,td,tfoot,th,thead,tr{border-color:inherit;border-style:solid;border-width:0}label{display:inline-block}button{border-radius:0}button:focus:not(:focus-visible){outline:0}button,input,optgroup,select,textarea{margin:0;font-family:inherit;font-size:inherit;line-height:inherit}button,select{text-transform:none}[role=button]{cursor:pointer}select{word-wrap:normal}select:disabled{opacity:1}[list]::-webkit-calendar-picker-indicator{display:none}[type=button],[type=reset],[type=submit],button{-webkit-appearance:button}[type=button]:not(:disabled),[type=reset]:not(:disabled),[type=submit]:not(:disabled),button:not(:disabled){cursor:pointer}::-moz-focus-inner{padding:0;border-style:none}textarea{resize:vertical}fieldset{min-width:0;padding:0;margin:0;border:0}legend{float:left;width:100%;padding:0;margin-bottom:.5rem;font-size:calc(1.275rem + .3vw);line-height:inherit}@media (min-width:1200px){legend{font-size:1.5rem}}legend+*{clear:left}::-webkit-datetime-edit-day-field,::-webkit-datetime-edit-fields-wrapper,::-webkit-datetime-edit-hour-field,::-webkit-datetime-edit-minute,::-webkit-datetime-edit-month-field,::-webkit-datetime-edit-text,::-webkit-datetime-edit-year-field{padding:0}::-webkit-inner-spin-button{height:auto}[type=search]{outline-offset:-2px;-webkit-appearance:textfield}::-webkit-search-decoration{-webkit-appearance:none}::-webkit-color-swatch-wrapper{padding:0}::file-selector-button{font:inherit}::-webkit-file-upload-button{font:inherit;-webkit-appearance:button}output{display:inline-block}iframe{border:0}summary{display:list-item;cursor:pointer}progress{vertical-align:baseline}[hidden]{display:none!important}</style>
<style>/*! syntax-highlighting.css */pre{line-height:125%;}span.linenos{color:inherit; background-color:transparent; padding-left:5px; padding-right:20px;}.pdoc-code .hll{background-color:#ffffcc}.pdoc-code{background:#f8f8f8;}.pdoc-code .c{color:#3D7B7B; font-style:italic}.pdoc-code .err{border:1px solid #FF0000}.pdoc-code .k{color:#008000; font-weight:bold}.pdoc-code .o{color:#666666}.pdoc-code .ch{color:#3D7B7B; font-style:italic}.pdoc-code .cm{color:#3D7B7B; font-style:italic}.pdoc-code .cp{color:#9C6500}.pdoc-code .cpf{color:#3D7B7B; font-style:italic}.pdoc-code .c1{color:#3D7B7B; font-style:italic}.pdoc-code .cs{color:#3D7B7B; font-style:italic}.pdoc-code .gd{color:#A00000}.pdoc-code .ge{font-style:italic}.pdoc-code .gr{color:#E40000}.pdoc-code .gh{color:#000080; font-weight:bold}.pdoc-code .gi{color:#008400}.pdoc-code .go{color:#717171}.pdoc-code .gp{color:#000080; font-weight:bold}.pdoc-code .gs{font-weight:bold}.pdoc-code .gu{color:#800080; font-weight:bold}.pdoc-code .gt{color:#0044DD}.pdoc-code .kc{color:#008000; font-weight:bold}.pdoc-code .kd{color:#008000; font-weight:bold}.pdoc-code .kn{color:#008000; font-weight:bold}.pdoc-code .kp{color:#008000}.pdoc-code .kr{color:#008000; font-weight:bold}.pdoc-code .kt{color:#B00040}.pdoc-code .m{color:#666666}.pdoc-code .s{color:#BA2121}.pdoc-code .na{color:#687822}.pdoc-code .nb{color:#008000}.pdoc-code .nc{color:#0000FF; font-weight:bold}.pdoc-code .no{color:#880000}.pdoc-code .nd{color:#AA22FF}.pdoc-code .ni{color:#717171; font-weight:bold}.pdoc-code .ne{color:#CB3F38; font-weight:bold}.pdoc-code .nf{color:#0000FF}.pdoc-code .nl{color:#767600}.pdoc-code .nn{color:#0000FF; font-weight:bold}.pdoc-code .nt{color:#008000; font-weight:bold}.pdoc-code .nv{color:#19177C}.pdoc-code .ow{color:#AA22FF; font-weight:bold}.pdoc-code .w{color:#bbbbbb}.pdoc-code .mb{color:#666666}.pdoc-code .mf{color:#666666}.pdoc-code .mh{color:#666666}.pdoc-code .mi{color:#666666}.pdoc-code .mo{color:#666666}.pdoc-code .sa{color:#BA2121}.pdoc-code .sb{color:#BA2121}.pdoc-code .sc{color:#BA2121}.pdoc-code .dl{color:#BA2121}.pdoc-code .sd{color:#BA2121; font-style:italic}.pdoc-code .s2{color:#BA2121}.pdoc-code .se{color:#AA5D1F; font-weight:bold}.pdoc-code .sh{color:#BA2121}.pdoc-code .si{color:#A45A77; font-weight:bold}.pdoc-code .sx{color:#008000}.pdoc-code .sr{color:#A45A77}.pdoc-code .s1{color:#BA2121}.pdoc-code .ss{color:#19177C}.pdoc-code .bp{color:#008000}.pdoc-code .fm{color:#0000FF}.pdoc-code .vc{color:#19177C}.pdoc-code .vg{color:#19177C}.pdoc-code .vi{color:#19177C}.pdoc-code .vm{color:#19177C}.pdoc-code .il{color:#666666}</style>
<style>/*! theme.css */:root{--pdoc-background:#fff;}.pdoc{--text:#212529;--muted:#6c757d;--link:#3660a5;--link-hover:#1659c5;--code:#f8f8f8;--active:#fff598;--accent:#eee;--accent2:#c1c1c1;--nav-hover:rgba(255, 255, 255, 0.5);--name:#0066BB;--def:#008800;--annotation:#007020;}</style>
<style>/*! layout.css */html, body{width:100%;height:100%;}html, main{scroll-behavior:smooth;}body{background-color:var(--pdoc-background);}@media (max-width:769px){#navtoggle{cursor:pointer;position:absolute;width:50px;height:40px;top:1rem;right:1rem;border-color:var(--text);color:var(--text);display:flex;opacity:0.8;z-index:999;}#navtoggle:hover{opacity:1;}#togglestate + div{display:none;}#togglestate:checked + div{display:inherit;}main, header{padding:2rem 3vw;}header + main{margin-top:-3rem;}.git-button{display:none !important;}nav input[type="search"]{max-width:77%;}nav input[type="search"]:first-child{margin-top:-6px;}nav input[type="search"]:valid ~ *{display:none !important;}}@media (min-width:770px){:root{--sidebar-width:clamp(12.5rem, 28vw, 22rem);}nav{position:fixed;overflow:auto;height:100vh;width:var(--sidebar-width);}main, header{padding:3rem 2rem 3rem calc(var(--sidebar-width) + 3rem);width:calc(54rem + var(--sidebar-width));max-width:100%;}header + main{margin-top:-4rem;}#navtoggle{display:none;}}#togglestate{position:absolute;height:0;opacity:0;}nav.pdoc{--pad:clamp(0.5rem, 2vw, 1.75rem);--indent:1.5rem;background-color:var(--accent);border-right:1px solid var(--accent2);box-shadow:0 0 20px rgba(50, 50, 50, .2) inset;padding:0 0 0 var(--pad);overflow-wrap:anywhere;scrollbar-width:thin; scrollbar-color:var(--accent2) transparent; z-index:1}nav.pdoc::-webkit-scrollbar{width:.4rem; }nav.pdoc::-webkit-scrollbar-thumb{background-color:var(--accent2); }nav.pdoc > div{padding:var(--pad) 0;}nav.pdoc .module-list-button{display:inline-flex;align-items:center;color:var(--text);border-color:var(--muted);margin-bottom:1rem;}nav.pdoc .module-list-button:hover{border-color:var(--text);}nav.pdoc input[type=search]{display:block;outline-offset:0;width:calc(100% - var(--pad));}nav.pdoc .logo{max-width:calc(100% - var(--pad));max-height:35vh;display:block;margin:0 auto 1rem;transform:translate(calc(-.5 * var(--pad)), 0);}nav.pdoc ul{list-style:none;padding-left:0;}nav.pdoc > div > ul{margin-left:calc(0px - var(--pad));}nav.pdoc li a{padding:.2rem 0 .2rem calc(var(--pad) + var(--indent));}nav.pdoc > div > ul > li > a{padding-left:var(--pad);}nav.pdoc li{transition:all 100ms;}nav.pdoc li:hover{background-color:var(--nav-hover);}nav.pdoc a, nav.pdoc a:hover{color:var(--text);}nav.pdoc a{display:block;}nav.pdoc > h2:first-of-type{margin-top:1.5rem;}nav.pdoc .class:before{content:"class ";color:var(--muted);}nav.pdoc .function:after{content:"()";color:var(--muted);}nav.pdoc footer:before{content:"";display:block;width:calc(100% - var(--pad));border-top:solid var(--accent2) 1px;margin-top:1.5rem;padding-top:.5rem;}nav.pdoc footer{font-size:small;}</style>
<style>/*! content.css */.pdoc{color:var(--text);box-sizing:border-box;line-height:1.5;background:none;}.pdoc .pdoc-button{cursor:pointer;display:inline-block;border:solid black 1px;border-radius:2px;font-size:.75rem;padding:calc(0.5em - 1px) 1em;transition:100ms all;}.pdoc .alert{padding:1rem 1rem 1rem calc(1.5rem + 24px);border:1px solid transparent;border-radius:.25rem;background-repeat:no-repeat;background-position:.75rem center;margin-bottom:1rem;}.pdoc .alert > em{display:none;}.pdoc .alert > *:last-child{margin-bottom:0;}.pdoc .alert.note{color:#084298;background-color:#cfe2ff;border-color:#b6d4fe;background-image:url("data:image/svg+xml,%3Csvg%20xmlns%3D%22http%3A//www.w3.org/2000/svg%22%20width%3D%2224%22%20height%3D%2224%22%20fill%3D%22%23084298%22%20viewBox%3D%220%200%2016%2016%22%3E%3Cpath%20d%3D%22M8%2016A8%208%200%201%200%208%200a8%208%200%200%200%200%2016zm.93-9.412-1%204.705c-.07.34.029.533.304.533.194%200%20.487-.07.686-.246l-.088.416c-.287.346-.92.598-1.465.598-.703%200-1.002-.422-.808-1.319l.738-3.468c.064-.293.006-.399-.287-.47l-.451-.081.082-.381%202.29-.287zM8%205.5a1%201%200%201%201%200-2%201%201%200%200%201%200%202z%22/%3E%3C/svg%3E");}.pdoc .alert.tip{color:#0a3622;background-color:#d1e7dd;border-color:#a3cfbb;background-image:url("data:image/svg+xml,%3Csvg%20xmlns%3D%22http%3A//www.w3.org/2000/svg%22%20width%3D%2224%22%20height%3D%2224%22%20fill%3D%22%230a3622%22%20viewBox%3D%220%200%2016%2016%22%3E%3Cpath%20d%3D%22M2%206a6%206%200%201%201%2010.174%204.31c-.203.196-.359.4-.453.619l-.762%201.769A.5.5%200%200%201%2010.5%2013a.5.5%200%200%201%200%201%20.5.5%200%200%201%200%201l-.224.447a1%201%200%200%201-.894.553H6.618a1%201%200%200%201-.894-.553L5.5%2015a.5.5%200%200%201%200-1%20.5.5%200%200%201%200-1%20.5.5%200%200%201-.46-.302l-.761-1.77a2%202%200%200%200-.453-.618A5.98%205.98%200%200%201%202%206m6-5a5%205%200%200%200-3.479%208.592c.263.254.514.564.676.941L5.83%2012h4.342l.632-1.467c.162-.377.413-.687.676-.941A5%205%200%200%200%208%201%22/%3E%3C/svg%3E");}.pdoc .alert.important{color:#055160;background-color:#cff4fc;border-color:#9eeaf9;background-image:url("data:image/svg+xml,%3Csvg%20xmlns%3D%22http%3A//www.w3.org/2000/svg%22%20width%3D%2224%22%20height%3D%2224%22%20fill%3D%22%23055160%22%20viewBox%3D%220%200%2016%2016%22%3E%3Cpath%20d%3D%22M2%200a2%202%200%200%200-2%202v12a2%202%200%200%200%202%202h12a2%202%200%200%200%202-2V2a2%202%200%200%200-2-2zm6%204c.535%200%20.954.462.9.995l-.35%203.507a.552.552%200%200%201-1.1%200L7.1%204.995A.905.905%200%200%201%208%204m.002%206a1%201%200%201%201%200%202%201%201%200%200%201%200-2%22/%3E%3C/svg%3E");}.pdoc .alert.warning{color:#664d03;background-color:#fff3cd;border-color:#ffecb5;background-image:url("data:image/svg+xml,%3Csvg%20xmlns%3D%22http%3A//www.w3.org/2000/svg%22%20width%3D%2224%22%20height%3D%2224%22%20fill%3D%22%23664d03%22%20viewBox%3D%220%200%2016%2016%22%3E%3Cpath%20d%3D%22M8.982%201.566a1.13%201.13%200%200%200-1.96%200L.165%2013.233c-.457.778.091%201.767.98%201.767h13.713c.889%200%201.438-.99.98-1.767L8.982%201.566zM8%205c.535%200%20.954.462.9.995l-.35%203.507a.552.552%200%200%201-1.1%200L7.1%205.995A.905.905%200%200%201%208%205zm.002%206a1%201%200%201%201%200%202%201%201%200%200%201%200-2z%22/%3E%3C/svg%3E");}.pdoc .alert.caution{color:#842029;background-color:#f8d7da;border-color:#f5c2c7;background-image:url("data:image/svg+xml,%3Csvg%20xmlns%3D%22http%3A//www.w3.org/2000/svg%22%20width%3D%2224%22%20height%3D%2224%22%20fill%3D%22%23842029%22%20viewBox%3D%220%200%2016%2016%22%3E%3Cpath%20d%3D%22M11.46.146A.5.5%200%200%200%2011.107%200H4.893a.5.5%200%200%200-.353.146L.146%204.54A.5.5%200%200%200%200%204.893v6.214a.5.5%200%200%200%20.146.353l4.394%204.394a.5.5%200%200%200%20.353.146h6.214a.5.5%200%200%200%20.353-.146l4.394-4.394a.5.5%200%200%200%20.146-.353V4.893a.5.5%200%200%200-.146-.353zM8%204c.535%200%20.954.462.9.995l-.35%203.507a.552.552%200%200%201-1.1%200L7.1%204.995A.905.905%200%200%201%208%204m.002%206a1%201%200%201%201%200%202%201%201%200%200%201%200-2%22/%3E%3C/svg%3E");}.pdoc .alert.danger{color:#842029;background-color:#f8d7da;border-color:#f5c2c7;background-image:url("data:image/svg+xml,%3Csvg%20xmlns%3D%22http%3A//www.w3.org/2000/svg%22%20width%3D%2224%22%20height%3D%2224%22%20fill%3D%22%23842029%22%20viewBox%3D%220%200%2016%2016%22%3E%3Cpath%20d%3D%22M5.52.359A.5.5%200%200%201%206%200h4a.5.5%200%200%201%20.474.658L8.694%206H12.5a.5.5%200%200%201%20.395.807l-7%209a.5.5%200%200%201-.873-.454L6.823%209.5H3.5a.5.5%200%200%201-.48-.641l2.5-8.5z%22/%3E%3C/svg%3E");}.pdoc .visually-hidden{position:absolute !important;width:1px !important;height:1px !important;padding:0 !important;margin:-1px !important;overflow:hidden !important;clip:rect(0, 0, 0, 0) !important;white-space:nowrap !important;border:0 !important;}.pdoc h1, .pdoc h2, .pdoc h3{font-weight:300;margin:.3em 0;padding:.2em 0;}.pdoc > section:not(.module-info) h1{font-size:1.5rem;font-weight:500;}.pdoc > section:not(.module-info) h2{font-size:1.4rem;font-weight:500;}.pdoc > section:not(.module-info) h3{font-size:1.3rem;font-weight:500;}.pdoc > section:not(.module-info) h4{font-size:1.2rem;}.pdoc > section:not(.module-info) h5{font-size:1.1rem;}.pdoc a{text-decoration:none;color:var(--link);}.pdoc a:hover{color:var(--link-hover);}.pdoc blockquote{margin-left:2rem;}.pdoc pre{border-top:1px solid var(--accent2);border-bottom:1px solid var(--accent2);margin-top:0;margin-bottom:1em;padding:.5rem 0 .5rem .5rem;overflow-x:auto;background-color:var(--code);}.pdoc code{color:var(--text);padding:.2em .4em;margin:0;font-size:85%;background-color:var(--accent);border-radius:6px;}.pdoc a > code{color:inherit;}.pdoc pre > code{display:inline-block;font-size:inherit;background:none;border:none;padding:0;}.pdoc > section:not(.module-info){margin-bottom:1.5rem;}.pdoc .modulename{margin-top:0;font-weight:bold;}.pdoc .modulename a{color:var(--link);transition:100ms all;}.pdoc .git-button{float:right;border:solid var(--link) 1px;}.pdoc .git-button:hover{background-color:var(--link);color:var(--pdoc-background);}.view-source-toggle-state,.view-source-toggle-state ~ .pdoc-code{display:none;}.view-source-toggle-state:checked ~ .pdoc-code{display:block;}.view-source-button{display:inline-block;float:right;font-size:.75rem;line-height:1.5rem;color:var(--muted);padding:0 .4rem 0 1.3rem;cursor:pointer;text-indent:-2px;}.view-source-button > span{visibility:hidden;}.module-info .view-source-button{float:none;display:flex;justify-content:flex-end;margin:-1.2rem .4rem -.2rem 0;}.view-source-button::before{position:absolute;content:"View Source";display:list-item;list-style-type:disclosure-closed;}.view-source-toggle-state:checked ~ .attr .view-source-button::before,.view-source-toggle-state:checked ~ .view-source-button::before{list-style-type:disclosure-open;}.pdoc .docstring{margin-bottom:1.5rem;}.pdoc section:not(.module-info) .docstring{margin-left:clamp(0rem, 5vw - 2rem, 1rem);}.pdoc .docstring .pdoc-code{margin-left:1em;margin-right:1em;}.pdoc h1:target,.pdoc h2:target,.pdoc h3:target,.pdoc h4:target,.pdoc h5:target,.pdoc h6:target,.pdoc .pdoc-code > pre > span:target{background-color:var(--active);box-shadow:-1rem 0 0 0 var(--active);}.pdoc .pdoc-code > pre > span:target{display:block;}.pdoc div:target > .attr,.pdoc section:target > .attr,.pdoc dd:target > a{background-color:var(--active);}.pdoc *{scroll-margin:2rem;}.pdoc .pdoc-code .linenos{user-select:none;}.pdoc .attr:hover{filter:contrast(0.95);}.pdoc section, .pdoc .classattr{position:relative;}.pdoc .headerlink{--width:clamp(1rem, 3vw, 2rem);position:absolute;top:0;left:calc(0rem - var(--width));transition:all 100ms ease-in-out;opacity:0;}.pdoc .headerlink::before{content:"#";display:block;text-align:center;width:var(--width);height:2.3rem;line-height:2.3rem;font-size:1.5rem;}.pdoc .attr:hover ~ .headerlink,.pdoc *:target > .headerlink,.pdoc .headerlink:hover{opacity:1;}.pdoc .attr{display:block;margin:.5rem 0 .5rem;padding:.4rem .4rem .4rem 1rem;background-color:var(--accent);overflow-x:auto;}.pdoc .classattr{margin-left:2rem;}.pdoc .decorator-deprecated{color:#842029;}.pdoc .decorator-deprecated ~ span{filter:grayscale(1) opacity(0.8);}.pdoc .name{color:var(--name);font-weight:bold;}.pdoc .def{color:var(--def);font-weight:bold;}.pdoc .signature{background-color:transparent;}.pdoc .param, .pdoc .return-annotation{white-space:pre;}.pdoc .signature.multiline .param{display:block;}.pdoc .signature.condensed .param{display:inline-block;}.pdoc .annotation{color:var(--annotation);}.pdoc .view-value-toggle-state,.pdoc .view-value-toggle-state ~ .default_value{display:none;}.pdoc .view-value-toggle-state:checked ~ .default_value{display:inherit;}.pdoc .view-value-button{font-size:.5rem;vertical-align:middle;border-style:dashed;margin-top:-0.1rem;}.pdoc .view-value-button:hover{background:white;}.pdoc .view-value-button::before{content:"show";text-align:center;width:2.2em;display:inline-block;}.pdoc .view-value-toggle-state:checked ~ .view-value-button::before{content:"hide";}.pdoc .inherited{margin-left:2rem;}.pdoc .inherited dt{font-weight:700;}.pdoc .inherited dt, .pdoc .inherited dd{display:inline;margin-left:0;margin-bottom:.5rem;}.pdoc .inherited dd:not(:last-child):after{content:", ";}.pdoc .inherited .class:before{content:"class ";}.pdoc .inherited .function a:after{content:"()";}.pdoc .search-result .docstring{overflow:auto;max-height:25vh;}.pdoc .search-result.focused > .attr{background-color:var(--active);}.pdoc .attribution{margin-top:2rem;display:block;opacity:0.5;transition:all 200ms;filter:grayscale(100%);}.pdoc .attribution:hover{opacity:1;filter:grayscale(0%);}.pdoc .attribution img{margin-left:5px;height:27px;vertical-align:bottom;width:50px;transition:all 200ms;}.pdoc table{display:block;width:max-content;max-width:100%;overflow:auto;margin-bottom:1rem;}.pdoc table th{font-weight:600;}.pdoc table th, .pdoc table td{padding:6px 13px;border:1px solid var(--accent2);}</style>
<style>/*! custom.css */</style></head>
<body>
<nav class="pdoc">
<label id="navtoggle" for="togglestate" class="pdoc-button"><svg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 30 30'><path stroke-linecap='round' stroke="currentColor" stroke-miterlimit='10' stroke-width='2' d='M4 7h22M4 15h22M4 23h22'/></svg></label>
<input id="togglestate" type="checkbox" aria-hidden="true" tabindex="-1">
<div> <a class="pdoc-button module-list-button" href="../index.html">
<svg xmlns="http://www.w3.org/2000/svg" width="16" height="16" fill="currentColor" class="bi bi-box-arrow-in-left" viewBox="0 0 16 16">
<path fill-rule="evenodd" d="M10 3.5a.5.5 0 0 0-.5-.5h-8a.5.5 0 0 0-.5.5v9a.5.5 0 0 0 .5.5h8a.5.5 0 0 0 .5-.5v-2a.5.5 0 0 1 1 0v2A1.5 1.5 0 0 1 9.5 14h-8A1.5 1.5 0 0 1 0 12.5v-9A1.5 1.5 0 0 1 1.5 2h8A1.5 1.5 0 0 1 11 3.5v2a.5.5 0 0 1-1 0v-2z"/>
<path fill-rule="evenodd" d="M4.146 8.354a.5.5 0 0 1 0-.708l3-3a.5.5 0 1 1 .708.708L5.707 7.5H14.5a.5.5 0 0 1 0 1H5.707l2.147 2.146a.5.5 0 0 1-.708.708l-3-3z"/>
</svg>
Module Index
</a>
<input type="search" placeholder="Search..." role="searchbox" aria-label="search"
pattern=".+" required>
<h2>Contents</h2>
<ul>
<li><a href="#numba-optimized-kernels">Numba-Optimized Kernels</a></li>
</ul>
<h2>API Documentation</h2>
<ul class="memberlist">
<li>
<a class="function" href="#set_numba_seed">set_numba_seed</a>
</li>
<li>
<a class="class" href="#PPKernel">PPKernel</a>
<ul class="memberlist">
<li>
<a class="function" href="#PPKernel.update">update</a>
</li>
</ul>
</li>
<li>
<a class="function" href="#measure_cluster_sizes_fast">measure_cluster_sizes_fast</a>
</li>
<li>
<a class="function" href="#detect_clusters_fast">detect_clusters_fast</a>
</li>
<li>
<a class="function" href="#get_cluster_stats_fast">get_cluster_stats_fast</a>
</li>
<li>
<a class="function" href="#compute_pcf_periodic_fast">compute_pcf_periodic_fast</a>
</li>
<li>
<a class="function" href="#compute_all_pcfs_fast">compute_all_pcfs_fast</a>
</li>
<li>
<a class="function" href="#warmup_numba_kernels">warmup_numba_kernels</a>
</li>
<li>
<a class="function" href="#benchmark_kernels">benchmark_kernels</a>
</li>
<li>
<a class="function" href="#benchmark_cluster_detection">benchmark_cluster_detection</a>
</li>
</ul>
<a class="attribution" title="pdoc: Python API documentation generator" href="https://pdoc.dev" target="_blank">
built with <span class="visually-hidden">pdoc</span><img
alt="pdoc logo"
src="data:image/svg+xml,%3Csvg%20xmlns%3D%22http%3A//www.w3.org/2000/svg%22%20role%3D%22img%22%20aria-label%3D%22pdoc%20logo%22%20width%3D%22300%22%20height%3D%22160%22%20viewBox%3D%220%200%20150%2080%22%3E%3Ctitle%3Epdoc%3C/title%3E%3Cpath%20d%3D%22M132.316%2048.886c.276-4.679%202.342-6.698%204.409-7.982s4.27-1.165%206.751-1.055c1.586.07%203.044.156%204.222-.482%201.142-.619%202.026-1.932%202.162-3.739.268-3.576-1.929-5.368-5.006-5.551s-7.599.524-10.517%201.606c-4.455%201.652-8.588%206.606-9.552%208.992s-2.342%206.193-1.745%2010.873%202.664%209.221%205.878%2011.79%205.878%203.808%2010.103%204.312%203.444.229%206.062.229%205.006-2.202%204.914-4.909-2.296-5.001-4.501-4.863-3.077.505-5.281.229-7.715-2.064-7.899-9.451z%22%20fill%3D%22%23198754%22/%3E%3Ccircle%20cx%3D%22101.504%22%20cy%3D%2248.943%22%20r%3D%2214.208%22%20fill%3D%22none%22%20stroke%3D%22%23198754%22%20stroke-width%3D%229.354%22/%3E%3Cpath%20d%3D%22M87.81.002c-3.637.065-5.001.454-7.014%201.232s-3.443%201.363-6.3%204.282c-1.723%201.76-3.148%205.019-3.776%207.329-.413%201.521-.316%202.63-.316%202.63l-.195%2034.612c.065%205.774-6.755%208.305-9.612%208.37s-9.678-1.038-9.743-9.408%207.128-9.521%208.362-9.521c1.413-.13%202.526-.021%203.718-.016%202.071.009%204.157-.778%204.092-4.671s-4.157-4.736-4.157-4.736c-6.3-.843-11.43%202.206-11.43%202.206S40.917%2038.15%2041.372%2049.634%2051.568%2068.19%2061.311%2068.125s18.316-7.007%2018.445-17.193l.13-22.772c.046-2.291%202.683-3.644%204.476-4.203.745-.232%201.694-.274%201.694-.274l10.457-.13s4.871-.324%207.729-3.114%204.352-6.294%204.352-6.294.974-3.049.13-4.606-.195-1.233-2.792-3.309-8.573-4.477-8.573-4.477S91.447-.063%2087.81.002zM0%2047.169l.065%2028.417S0%2080.127%204.481%2079.997s5.072-3.866%205.049-4.152l-.113-28.482s1.624-7.656%209.937-7.721%2010.002%206.942%2010.002%208.499-.909%2010.51-9.093%2010.51c-.948%200-2.99-.567-4.145-.272-3.919%201-3.194%204.554-3.194%204.554s.065%205.061%207.404%204.996%2018.575-6.034%2018.575-19.074S26.953%2030.04%2019.549%2029.91%201.234%2035.296%200%2047.169z%22%20fill%3D%22%23198754%22/%3E%3Cg%20transform%3D%22matrix%28.325601%200%200%20.325256%20-10.32669%20-45.802786%29%22%3E%3Ccircle%20cx%3D%22297.554%22%20cy%3D%22172.286%22%20r%3D%2216.5%22%20fill%3D%22%23fff%22/%3E%3Cellipse%20cx%3D%22297.709%22%20cy%3D%22172.642%22%20rx%3D%2211.071%22%20ry%3D%2210.871%22%20fill%3D%22%23105a48%22/%3E%3Ccircle%20cx%3D%22304.104%22%20cy%3D%22167.667%22%20r%3D%224.5%22%20fill%3D%22%23fff%22/%3E%3C/g%3E%3Cpath%20d%3D%22M94.661%2017.032l.893-1.476s.99.714%201.916.925%201.575.114%202.955.114l14.565-.162c1.283-.032%203.085-.762%203.02-3.293s-.373-3.503-.373-3.503l1.283-.487s.52.503.877%201.573.309%201.995.292%202.66-.227%201.541-.227%201.541%201.564-.308%202.359-1.038.823-.779%201.489-1.508.812-.86.812-.86.552-.13.877.26.341.957.065%201.46-1.672%202.206-3.247%203.066-2.76%201.427-3.929%201.768-3.848.73-7.063.714l-10.944-.114s-2.143-.081-3.02-.373-2.241-.973-2.598-1.265z%22%20fill%3D%22%23d36d49%22/%3E%3Cg%20fill%3D%22%23105a48%22%3E%3Cellipse%20cx%3D%2293.052%22%20cy%3D%2243.567%22%20rx%3D%22.869%22%20ry%3D%221.014%22%20transform%3D%22rotate%28341.022%29%22/%3E%3Cellipse%20cx%3D%22104.3%22%20cy%3D%22-16.184%22%20rx%3D%22.865%22%20ry%3D%221.009%22%20transform%3D%22rotate%2814.786%29%22/%3E%3C/g%3E%3C/svg%3E"/>
</a>
</div>
</nav>
<main class="pdoc">
<section class="module-info">
<h1 class="modulename">
models<wbr>.numba_optimized </h1>
<div class="docstring"><h1 id="numba-optimized-kernels">Numba-Optimized Kernels</h1>
<p>This module provides Numba-accelerated kernels for the predator-prey
cellular automaton, including update kernels and spatial analysis functions.</p>
<h6 id="classes">Classes</h6>
<p>PPKernel
Wrapper for predator-prey update kernels with pre-allocated buffers.</p>
<h6 id="cluster-analysis">Cluster Analysis</h6>
<div class="pdoc-code codehilite">
<pre><span></span><code><span class="n">measure_cluster_sizes_fast</span> <span class="c1"># Fast cluster size measurement (sizes only).</span>
<span class="n">detect_clusters_fast</span> <span class="c1"># Full cluster detection with labels.</span>
<span class="n">get_cluster_stats_fast</span> <span class="c1"># Comprehensive cluster statistics.</span>
</code></pre>
</div>
<h6 id="pair-correlation-functions">Pair Correlation Functions</h6>
<div class="pdoc-code codehilite">
<pre><span></span><code><span class="n">compute_pcf_periodic_fast</span> <span class="c1"># PCF for two position sets with periodic boundaries.</span>
<span class="n">compute_all_pcfs_fast</span> <span class="c1">#Compute prey-prey, pred-pred, and prey-pred PCFs.</span>
</code></pre>
</div>
<h6 id="utilities">Utilities</h6>
<div class="pdoc-code codehilite">
<pre><span></span><code><span class="n">set_numba_seed</span> <span class="c1"># Seed Numba's internal RNG.</span>
<span class="n">warmup_numba_kernels</span> <span class="c1"># Pre-compile kernels to avoid first-run latency.</span>
</code></pre>
</div>
<h6 id="example">Example</h6>
<div class="pdoc-code codehilite">
<pre><span></span><code><span class="kn">from</span><span class="w"> </span><span class="nn"><a href="">models.numba_optimized</a></span><span class="w"> </span><span class="kn">import</span> <span class="p">(</span>
<span class="n">PPKernel</span><span class="p">,</span>
<span class="n">get_cluster_stats_fast</span><span class="p">,</span>
<span class="n">compute_all_pcfs_fast</span><span class="p">,</span>
<span class="p">)</span>
<span class="c1"># Cluster analysis</span>
<span class="n">stats</span> <span class="o">=</span> <span class="n">get_cluster_stats_fast</span><span class="p">(</span><span class="n">grid</span><span class="p">,</span> <span class="n">species</span><span class="o">=</span><span class="mi">1</span><span class="p">)</span>
<span class="nb">print</span><span class="p">(</span><span class="sa">f</span><span class="s2">"Largest cluster: </span><span class="si">{</span><span class="n">stats</span><span class="p">[</span><span class="s1">'largest'</span><span class="p">]</span><span class="si">}</span><span class="s2">"</span><span class="p">)</span>
<span class="c1"># PCF computation</span>
<span class="n">pcfs</span> <span class="o">=</span> <span class="n">compute_all_pcfs_fast</span><span class="p">(</span><span class="n">grid</span><span class="p">,</span> <span class="n">max_distance</span><span class="o">=</span><span class="mf">20.0</span><span class="p">)</span>
<span class="n">prey_prey_dist</span><span class="p">,</span> <span class="n">prey_prey_gr</span><span class="p">,</span> <span class="n">_</span> <span class="o">=</span> <span class="n">pcfs</span><span class="p">[</span><span class="s1">'prey_prey'</span><span class="p">]</span>
</code></pre>
</div>
</div>
<input id="mod-numba_optimized-view-source" class="view-source-toggle-state" type="checkbox" aria-hidden="true" tabindex="-1">
<label class="view-source-button" for="mod-numba_optimized-view-source"><span>View Source</span></label>
<div class="pdoc-code codehilite"><pre><span></span><span id="L-1"><a href="#L-1"><span class="linenos"> 1</span></a><span class="ch">#!/usr/bin/env python3</span>
</span><span id="L-2"><a href="#L-2"><span class="linenos"> 2</span></a><span class="sd">"""</span>
</span><span id="L-3"><a href="#L-3"><span class="linenos"> 3</span></a><span class="sd">Numba-Optimized Kernels</span>
</span><span id="L-4"><a href="#L-4"><span class="linenos"> 4</span></a><span class="sd">=======================</span>
</span><span id="L-5"><a href="#L-5"><span class="linenos"> 5</span></a>
</span><span id="L-6"><a href="#L-6"><span class="linenos"> 6</span></a><span class="sd">This module provides Numba-accelerated kernels for the predator-prey</span>
</span><span id="L-7"><a href="#L-7"><span class="linenos"> 7</span></a><span class="sd">cellular automaton, including update kernels and spatial analysis functions.</span>
</span><span id="L-8"><a href="#L-8"><span class="linenos"> 8</span></a>
</span><span id="L-9"><a href="#L-9"><span class="linenos"> 9</span></a><span class="sd">Classes</span>
</span><span id="L-10"><a href="#L-10"><span class="linenos"> 10</span></a><span class="sd">-------</span>
</span><span id="L-11"><a href="#L-11"><span class="linenos"> 11</span></a><span class="sd">PPKernel</span>
</span><span id="L-12"><a href="#L-12"><span class="linenos"> 12</span></a><span class="sd"> Wrapper for predator-prey update kernels with pre-allocated buffers.</span>
</span><span id="L-13"><a href="#L-13"><span class="linenos"> 13</span></a>
</span><span id="L-14"><a href="#L-14"><span class="linenos"> 14</span></a><span class="sd">Cluster Analysis</span>
</span><span id="L-15"><a href="#L-15"><span class="linenos"> 15</span></a><span class="sd">----------------</span>
</span><span id="L-16"><a href="#L-16"><span class="linenos"> 16</span></a><span class="sd">```python</span>
</span><span id="L-17"><a href="#L-17"><span class="linenos"> 17</span></a><span class="sd">measure_cluster_sizes_fast # Fast cluster size measurement (sizes only).</span>
</span><span id="L-18"><a href="#L-18"><span class="linenos"> 18</span></a><span class="sd">detect_clusters_fast # Full cluster detection with labels.</span>
</span><span id="L-19"><a href="#L-19"><span class="linenos"> 19</span></a><span class="sd">get_cluster_stats_fast # Comprehensive cluster statistics.</span>
</span><span id="L-20"><a href="#L-20"><span class="linenos"> 20</span></a><span class="sd">```</span>
</span><span id="L-21"><a href="#L-21"><span class="linenos"> 21</span></a>
</span><span id="L-22"><a href="#L-22"><span class="linenos"> 22</span></a><span class="sd">Pair Correlation Functions</span>
</span><span id="L-23"><a href="#L-23"><span class="linenos"> 23</span></a><span class="sd">--------------------------</span>
</span><span id="L-24"><a href="#L-24"><span class="linenos"> 24</span></a><span class="sd">```python</span>
</span><span id="L-25"><a href="#L-25"><span class="linenos"> 25</span></a><span class="sd">compute_pcf_periodic_fast # PCF for two position sets with periodic boundaries.</span>
</span><span id="L-26"><a href="#L-26"><span class="linenos"> 26</span></a><span class="sd">compute_all_pcfs_fast #Compute prey-prey, pred-pred, and prey-pred PCFs.</span>
</span><span id="L-27"><a href="#L-27"><span class="linenos"> 27</span></a><span class="sd">```</span>
</span><span id="L-28"><a href="#L-28"><span class="linenos"> 28</span></a>
</span><span id="L-29"><a href="#L-29"><span class="linenos"> 29</span></a><span class="sd">Utilities</span>
</span><span id="L-30"><a href="#L-30"><span class="linenos"> 30</span></a><span class="sd">---------</span>
</span><span id="L-31"><a href="#L-31"><span class="linenos"> 31</span></a><span class="sd">```python</span>
</span><span id="L-32"><a href="#L-32"><span class="linenos"> 32</span></a><span class="sd">set_numba_seed # Seed Numba's internal RNG.</span>
</span><span id="L-33"><a href="#L-33"><span class="linenos"> 33</span></a><span class="sd">warmup_numba_kernels # Pre-compile kernels to avoid first-run latency.</span>
</span><span id="L-34"><a href="#L-34"><span class="linenos"> 34</span></a><span class="sd">```</span>
</span><span id="L-35"><a href="#L-35"><span class="linenos"> 35</span></a>
</span><span id="L-36"><a href="#L-36"><span class="linenos"> 36</span></a><span class="sd">Example</span>
</span><span id="L-37"><a href="#L-37"><span class="linenos"> 37</span></a><span class="sd">-------</span>
</span><span id="L-38"><a href="#L-38"><span class="linenos"> 38</span></a><span class="sd">```python</span>
</span><span id="L-39"><a href="#L-39"><span class="linenos"> 39</span></a><span class="sd">from models.numba_optimized import (</span>
</span><span id="L-40"><a href="#L-40"><span class="linenos"> 40</span></a><span class="sd"> PPKernel,</span>
</span><span id="L-41"><a href="#L-41"><span class="linenos"> 41</span></a><span class="sd"> get_cluster_stats_fast,</span>
</span><span id="L-42"><a href="#L-42"><span class="linenos"> 42</span></a><span class="sd"> compute_all_pcfs_fast,</span>
</span><span id="L-43"><a href="#L-43"><span class="linenos"> 43</span></a><span class="sd">)</span>
</span><span id="L-44"><a href="#L-44"><span class="linenos"> 44</span></a>
</span><span id="L-45"><a href="#L-45"><span class="linenos"> 45</span></a><span class="sd"># Cluster analysis</span>
</span><span id="L-46"><a href="#L-46"><span class="linenos"> 46</span></a><span class="sd">stats = get_cluster_stats_fast(grid, species=1)</span>
</span><span id="L-47"><a href="#L-47"><span class="linenos"> 47</span></a><span class="sd">print(f"Largest cluster: {stats['largest']}")</span>
</span><span id="L-48"><a href="#L-48"><span class="linenos"> 48</span></a>
</span><span id="L-49"><a href="#L-49"><span class="linenos"> 49</span></a><span class="sd"># PCF computation</span>
</span><span id="L-50"><a href="#L-50"><span class="linenos"> 50</span></a><span class="sd">pcfs = compute_all_pcfs_fast(grid, max_distance=20.0)</span>
</span><span id="L-51"><a href="#L-51"><span class="linenos"> 51</span></a><span class="sd">prey_prey_dist, prey_prey_gr, _ = pcfs['prey_prey']</span>
</span><span id="L-52"><a href="#L-52"><span class="linenos"> 52</span></a><span class="sd">```</span>
</span><span id="L-53"><a href="#L-53"><span class="linenos"> 53</span></a><span class="sd">"""</span>
</span><span id="L-54"><a href="#L-54"><span class="linenos"> 54</span></a>
</span><span id="L-55"><a href="#L-55"><span class="linenos"> 55</span></a><span class="kn">import</span><span class="w"> </span><span class="nn">numpy</span><span class="w"> </span><span class="k">as</span><span class="w"> </span><span class="nn">np</span>
</span><span id="L-56"><a href="#L-56"><span class="linenos"> 56</span></a><span class="kn">from</span><span class="w"> </span><span class="nn">typing</span><span class="w"> </span><span class="kn">import</span> <span class="n">Tuple</span><span class="p">,</span> <span class="n">Dict</span><span class="p">,</span> <span class="n">Optional</span>
</span><span id="L-57"><a href="#L-57"><span class="linenos"> 57</span></a>
</span><span id="L-58"><a href="#L-58"><span class="linenos"> 58</span></a><span class="k">try</span><span class="p">:</span>
</span><span id="L-59"><a href="#L-59"><span class="linenos"> 59</span></a> <span class="kn">from</span><span class="w"> </span><span class="nn">numba</span><span class="w"> </span><span class="kn">import</span> <span class="n">njit</span><span class="p">,</span> <span class="n">prange</span>
</span><span id="L-60"><a href="#L-60"><span class="linenos"> 60</span></a>
</span><span id="L-61"><a href="#L-61"><span class="linenos"> 61</span></a> <span class="n">NUMBA_AVAILABLE</span> <span class="o">=</span> <span class="kc">True</span>
</span><span id="L-62"><a href="#L-62"><span class="linenos"> 62</span></a><span class="k">except</span> <span class="ne">ImportError</span><span class="p">:</span>
</span><span id="L-63"><a href="#L-63"><span class="linenos"> 63</span></a> <span class="n">NUMBA_AVAILABLE</span> <span class="o">=</span> <span class="kc">False</span>
</span><span id="L-64"><a href="#L-64"><span class="linenos"> 64</span></a>
</span><span id="L-65"><a href="#L-65"><span class="linenos"> 65</span></a> <span class="k">def</span><span class="w"> </span><span class="nf">njit</span><span class="p">(</span><span class="o">*</span><span class="n">args</span><span class="p">,</span> <span class="o">**</span><span class="n">kwargs</span><span class="p">):</span>
</span><span id="L-66"><a href="#L-66"><span class="linenos"> 66</span></a> <span class="k">def</span><span class="w"> </span><span class="nf">decorator</span><span class="p">(</span><span class="n">func</span><span class="p">):</span>
</span><span id="L-67"><a href="#L-67"><span class="linenos"> 67</span></a> <span class="k">return</span> <span class="n">func</span>
</span><span id="L-68"><a href="#L-68"><span class="linenos"> 68</span></a>
</span><span id="L-69"><a href="#L-69"><span class="linenos"> 69</span></a> <span class="k">return</span> <span class="n">decorator</span>
</span><span id="L-70"><a href="#L-70"><span class="linenos"> 70</span></a>
</span><span id="L-71"><a href="#L-71"><span class="linenos"> 71</span></a> <span class="k">def</span><span class="w"> </span><span class="nf">prange</span><span class="p">(</span><span class="o">*</span><span class="n">args</span><span class="p">):</span>
</span><span id="L-72"><a href="#L-72"><span class="linenos"> 72</span></a> <span class="k">return</span> <span class="nb">range</span><span class="p">(</span><span class="o">*</span><span class="n">args</span><span class="p">)</span>
</span><span id="L-73"><a href="#L-73"><span class="linenos"> 73</span></a>
</span><span id="L-74"><a href="#L-74"><span class="linenos"> 74</span></a>
</span><span id="L-75"><a href="#L-75"><span class="linenos"> 75</span></a><span class="c1"># ============================================================================</span>
</span><span id="L-76"><a href="#L-76"><span class="linenos"> 76</span></a><span class="c1"># RNG SEEDING</span>
</span><span id="L-77"><a href="#L-77"><span class="linenos"> 77</span></a><span class="c1"># ============================================================================</span>
</span><span id="L-78"><a href="#L-78"><span class="linenos"> 78</span></a>
</span><span id="L-79"><a href="#L-79"><span class="linenos"> 79</span></a>
</span><span id="L-80"><a href="#L-80"><span class="linenos"> 80</span></a><span class="nd">@njit</span><span class="p">(</span><span class="n">cache</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
</span><span id="L-81"><a href="#L-81"><span class="linenos"> 81</span></a><span class="k">def</span><span class="w"> </span><span class="nf">set_numba_seed</span><span class="p">(</span><span class="n">seed</span><span class="p">:</span> <span class="nb">int</span><span class="p">)</span> <span class="o">-></span> <span class="kc">None</span><span class="p">:</span>
</span><span id="L-82"><a href="#L-82"><span class="linenos"> 82</span></a><span class="w"> </span><span class="sd">"""</span>
</span><span id="L-83"><a href="#L-83"><span class="linenos"> 83</span></a><span class="sd"> Seed Numba's internal random number generator from within a JIT context.</span>
</span><span id="L-84"><a href="#L-84"><span class="linenos"> 84</span></a>
</span><span id="L-85"><a href="#L-85"><span class="linenos"> 85</span></a><span class="sd"> This function ensures that Numba's independent random number generator</span>
</span><span id="L-86"><a href="#L-86"><span class="linenos"> 86</span></a><span class="sd"> is synchronized with the provided seed, enabling reproducibility for</span>
</span><span id="L-87"><a href="#L-87"><span class="linenos"> 87</span></a><span class="sd"> jit-compiled functions that use NumPy's random operations.</span>
</span><span id="L-88"><a href="#L-88"><span class="linenos"> 88</span></a>
</span><span id="L-89"><a href="#L-89"><span class="linenos"> 89</span></a><span class="sd"> Parameters</span>
</span><span id="L-90"><a href="#L-90"><span class="linenos"> 90</span></a><span class="sd"> ----------</span>
</span><span id="L-91"><a href="#L-91"><span class="linenos"> 91</span></a><span class="sd"> seed : int</span>
</span><span id="L-92"><a href="#L-92"><span class="linenos"> 92</span></a><span class="sd"> The integer value used to initialize the random number generator.</span>
</span><span id="L-93"><a href="#L-93"><span class="linenos"> 93</span></a>
</span><span id="L-94"><a href="#L-94"><span class="linenos"> 94</span></a><span class="sd"> Returns</span>
</span><span id="L-95"><a href="#L-95"><span class="linenos"> 95</span></a><span class="sd"> -------</span>
</span><span id="L-96"><a href="#L-96"><span class="linenos"> 96</span></a><span class="sd"> None</span>
</span><span id="L-97"><a href="#L-97"><span class="linenos"> 97</span></a>
</span><span id="L-98"><a href="#L-98"><span class="linenos"> 98</span></a><span class="sd"> Notes</span>
</span><span id="L-99"><a href="#L-99"><span class="linenos"> 99</span></a><span class="sd"> -----</span>
</span><span id="L-100"><a href="#L-100"><span class="linenos"> 100</span></a><span class="sd"> Because Numba maintains its own internal state for random number</span>
</span><span id="L-101"><a href="#L-101"><span class="linenos"> 101</span></a><span class="sd"> generation, calling `np.random.seed()` in standard Python code will not</span>
</span><span id="L-102"><a href="#L-102"><span class="linenos"> 102</span></a><span class="sd"> affect jit-compiled functions. This helper must be called to bridge</span>
</span><span id="L-103"><a href="#L-103"><span class="linenos"> 103</span></a><span class="sd"> that gap.</span>
</span><span id="L-104"><a href="#L-104"><span class="linenos"> 104</span></a><span class="sd"> """</span>
</span><span id="L-105"><a href="#L-105"><span class="linenos"> 105</span></a> <span class="n">np</span><span class="o">.</span><span class="n">random</span><span class="o">.</span><span class="n">seed</span><span class="p">(</span><span class="n">seed</span><span class="p">)</span>
</span><span id="L-106"><a href="#L-106"><span class="linenos"> 106</span></a>
</span><span id="L-107"><a href="#L-107"><span class="linenos"> 107</span></a>
</span><span id="L-108"><a href="#L-108"><span class="linenos"> 108</span></a><span class="c1"># ============================================================================</span>
</span><span id="L-109"><a href="#L-109"><span class="linenos"> 109</span></a><span class="c1"># PREDATOR-PREY KERNELS</span>
</span><span id="L-110"><a href="#L-110"><span class="linenos"> 110</span></a><span class="c1"># ============================================================================</span>
</span><span id="L-111"><a href="#L-111"><span class="linenos"> 111</span></a>
</span><span id="L-112"><a href="#L-112"><span class="linenos"> 112</span></a>
</span><span id="L-113"><a href="#L-113"><span class="linenos"> 113</span></a><span class="nd">@njit</span><span class="p">(</span><span class="n">cache</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
</span><span id="L-114"><a href="#L-114"><span class="linenos"> 114</span></a><span class="k">def</span><span class="w"> </span><span class="nf">_pp_async_kernel_random</span><span class="p">(</span>
</span><span id="L-115"><a href="#L-115"><span class="linenos"> 115</span></a> <span class="n">grid</span><span class="p">:</span> <span class="n">np</span><span class="o">.</span><span class="n">ndarray</span><span class="p">,</span>
</span><span id="L-116"><a href="#L-116"><span class="linenos"> 116</span></a> <span class="n">prey_death_arr</span><span class="p">:</span> <span class="n">np</span><span class="o">.</span><span class="n">ndarray</span><span class="p">,</span>
</span><span id="L-117"><a href="#L-117"><span class="linenos"> 117</span></a> <span class="n">p_birth_val</span><span class="p">:</span> <span class="nb">float</span><span class="p">,</span>
</span><span id="L-118"><a href="#L-118"><span class="linenos"> 118</span></a> <span class="n">p_death_val</span><span class="p">:</span> <span class="nb">float</span><span class="p">,</span>
</span><span id="L-119"><a href="#L-119"><span class="linenos"> 119</span></a> <span class="n">pred_birth_val</span><span class="p">:</span> <span class="nb">float</span><span class="p">,</span>
</span><span id="L-120"><a href="#L-120"><span class="linenos"> 120</span></a> <span class="n">pred_death_val</span><span class="p">:</span> <span class="nb">float</span><span class="p">,</span>
</span><span id="L-121"><a href="#L-121"><span class="linenos"> 121</span></a> <span class="n">dr_arr</span><span class="p">:</span> <span class="n">np</span><span class="o">.</span><span class="n">ndarray</span><span class="p">,</span>
</span><span id="L-122"><a href="#L-122"><span class="linenos"> 122</span></a> <span class="n">dc_arr</span><span class="p">:</span> <span class="n">np</span><span class="o">.</span><span class="n">ndarray</span><span class="p">,</span>
</span><span id="L-123"><a href="#L-123"><span class="linenos"> 123</span></a> <span class="n">evolve_sd</span><span class="p">:</span> <span class="nb">float</span><span class="p">,</span>
</span><span id="L-124"><a href="#L-124"><span class="linenos"> 124</span></a> <span class="n">evolve_min</span><span class="p">:</span> <span class="nb">float</span><span class="p">,</span>
</span><span id="L-125"><a href="#L-125"><span class="linenos"> 125</span></a> <span class="n">evolve_max</span><span class="p">:</span> <span class="nb">float</span><span class="p">,</span>
</span><span id="L-126"><a href="#L-126"><span class="linenos"> 126</span></a> <span class="n">evolution_stopped</span><span class="p">:</span> <span class="nb">bool</span><span class="p">,</span>
</span><span id="L-127"><a href="#L-127"><span class="linenos"> 127</span></a> <span class="n">occupied_buffer</span><span class="p">:</span> <span class="n">np</span><span class="o">.</span><span class="n">ndarray</span><span class="p">,</span>
</span><span id="L-128"><a href="#L-128"><span class="linenos"> 128</span></a><span class="p">)</span> <span class="o">-></span> <span class="n">np</span><span class="o">.</span><span class="n">ndarray</span><span class="p">:</span>
</span><span id="L-129"><a href="#L-129"><span class="linenos"> 129</span></a><span class="w"> </span><span class="sd">"""</span>
</span><span id="L-130"><a href="#L-130"><span class="linenos"> 130</span></a><span class="sd"> Asynchronous predator-prey update kernel with random neighbor selection.</span>
</span><span id="L-131"><a href="#L-131"><span class="linenos"> 131</span></a>
</span><span id="L-132"><a href="#L-132"><span class="linenos"> 132</span></a><span class="sd"> This Numba-accelerated kernel performs an asynchronous update of the</span>
</span><span id="L-133"><a href="#L-133"><span class="linenos"> 133</span></a><span class="sd"> simulation grid. It identifies all occupied cells, shuffles them to</span>
</span><span id="L-134"><a href="#L-134"><span class="linenos"> 134</span></a><span class="sd"> ensure unbiased processing, and applies stochastic rules for prey</span>
</span><span id="L-135"><a href="#L-135"><span class="linenos"> 135</span></a><span class="sd"> mortality, prey reproduction (with optional parameter evolution),</span>
</span><span id="L-136"><a href="#L-136"><span class="linenos"> 136</span></a><span class="sd"> predator mortality, and predation.</span>
</span><span id="L-137"><a href="#L-137"><span class="linenos"> 137</span></a>
</span><span id="L-138"><a href="#L-138"><span class="linenos"> 138</span></a><span class="sd"> Parameters</span>
</span><span id="L-139"><a href="#L-139"><span class="linenos"> 139</span></a><span class="sd"> ----------</span>
</span><span id="L-140"><a href="#L-140"><span class="linenos"> 140</span></a><span class="sd"> grid : np.ndarray</span>
</span><span id="L-141"><a href="#L-141"><span class="linenos"> 141</span></a><span class="sd"> 2D integer array representing the simulation grid (0: Empty, 1: Prey, 2: Predator).</span>
</span><span id="L-142"><a href="#L-142"><span class="linenos"> 142</span></a><span class="sd"> prey_death_arr : np.ndarray</span>
</span><span id="L-143"><a href="#L-143"><span class="linenos"> 143</span></a><span class="sd"> 2D float array storing the individual prey death rates for evolution tracking.</span>
</span><span id="L-144"><a href="#L-144"><span class="linenos"> 144</span></a><span class="sd"> p_birth_val : float</span>
</span><span id="L-145"><a href="#L-145"><span class="linenos"> 145</span></a><span class="sd"> Base probability of prey reproduction into an adjacent empty cell.</span>
</span><span id="L-146"><a href="#L-146"><span class="linenos"> 146</span></a><span class="sd"> p_death_val : float</span>
</span><span id="L-147"><a href="#L-147"><span class="linenos"> 147</span></a><span class="sd"> Base probability of prey death (though individual rates in `prey_death_arr` are used).</span>
</span><span id="L-148"><a href="#L-148"><span class="linenos"> 148</span></a><span class="sd"> pred_birth_val : float</span>
</span><span id="L-149"><a href="#L-149"><span class="linenos"> 149</span></a><span class="sd"> Probability of a predator reproducing after consuming prey.</span>
</span><span id="L-150"><a href="#L-150"><span class="linenos"> 150</span></a><span class="sd"> pred_death_val : float</span>
</span><span id="L-151"><a href="#L-151"><span class="linenos"> 151</span></a><span class="sd"> Probability of a predator dying.</span>
</span><span id="L-152"><a href="#L-152"><span class="linenos"> 152</span></a><span class="sd"> dr_arr : np.ndarray</span>
</span><span id="L-153"><a href="#L-153"><span class="linenos"> 153</span></a><span class="sd"> Array of row offsets defining the neighborhood.</span>
</span><span id="L-154"><a href="#L-154"><span class="linenos"> 154</span></a><span class="sd"> dc_arr : np.ndarray</span>
</span><span id="L-155"><a href="#L-155"><span class="linenos"> 155</span></a><span class="sd"> Array of column offsets defining the neighborhood.</span>
</span><span id="L-156"><a href="#L-156"><span class="linenos"> 156</span></a><span class="sd"> evolve_sd : float</span>
</span><span id="L-157"><a href="#L-157"><span class="linenos"> 157</span></a><span class="sd"> Standard deviation of the mutation applied to the prey death rate during reproduction.</span>
</span><span id="L-158"><a href="#L-158"><span class="linenos"> 158</span></a><span class="sd"> evolve_min : float</span>
</span><span id="L-159"><a href="#L-159"><span class="linenos"> 159</span></a><span class="sd"> Lower bound for the evolved prey death rate.</span>
</span><span id="L-160"><a href="#L-160"><span class="linenos"> 160</span></a><span class="sd"> evolve_max : float</span>
</span><span id="L-161"><a href="#L-161"><span class="linenos"> 161</span></a><span class="sd"> Upper bound for the evolved prey death rate.</span>
</span><span id="L-162"><a href="#L-162"><span class="linenos"> 162</span></a><span class="sd"> evolution_stopped : bool</span>
</span><span id="L-163"><a href="#L-163"><span class="linenos"> 163</span></a><span class="sd"> If True, offspring inherit the parent's death rate without mutation.</span>
</span><span id="L-164"><a href="#L-164"><span class="linenos"> 164</span></a><span class="sd"> occupied_buffer : np.ndarray</span>
</span><span id="L-165"><a href="#L-165"><span class="linenos"> 165</span></a><span class="sd"> Pre-allocated 2D array used to store and shuffle coordinates of occupied cells.</span>
</span><span id="L-166"><a href="#L-166"><span class="linenos"> 166</span></a>
</span><span id="L-167"><a href="#L-167"><span class="linenos"> 167</span></a><span class="sd"> Returns</span>
</span><span id="L-168"><a href="#L-168"><span class="linenos"> 168</span></a><span class="sd"> -------</span>
</span><span id="L-169"><a href="#L-169"><span class="linenos"> 169</span></a><span class="sd"> grid : np.ndarray</span>
</span><span id="L-170"><a href="#L-170"><span class="linenos"> 170</span></a><span class="sd"> The updated simulation grid.</span>
</span><span id="L-171"><a href="#L-171"><span class="linenos"> 171</span></a>
</span><span id="L-172"><a href="#L-172"><span class="linenos"> 172</span></a><span class="sd"> Notes</span>
</span><span id="L-173"><a href="#L-173"><span class="linenos"> 173</span></a><span class="sd"> -----</span>
</span><span id="L-174"><a href="#L-174"><span class="linenos"> 174</span></a><span class="sd"> The kernel uses periodic boundary conditions. The Fisher-Yates shuffle on</span>
</span><span id="L-175"><a href="#L-175"><span class="linenos"> 175</span></a><span class="sd"> `occupied_buffer` ensures that the asynchronous updates do not introduce</span>
</span><span id="L-176"><a href="#L-176"><span class="linenos"> 176</span></a><span class="sd"> directional bias.</span>
</span><span id="L-177"><a href="#L-177"><span class="linenos"> 177</span></a><span class="sd"> """</span>
</span><span id="L-178"><a href="#L-178"><span class="linenos"> 178</span></a> <span class="n">rows</span><span class="p">,</span> <span class="n">cols</span> <span class="o">=</span> <span class="n">grid</span><span class="o">.</span><span class="n">shape</span>
</span><span id="L-179"><a href="#L-179"><span class="linenos"> 179</span></a> <span class="n">n_shifts</span> <span class="o">=</span> <span class="nb">len</span><span class="p">(</span><span class="n">dr_arr</span><span class="p">)</span>
</span><span id="L-180"><a href="#L-180"><span class="linenos"> 180</span></a>
</span><span id="L-181"><a href="#L-181"><span class="linenos"> 181</span></a> <span class="c1"># Collect occupied cells</span>
</span><span id="L-182"><a href="#L-182"><span class="linenos"> 182</span></a> <span class="n">count</span> <span class="o">=</span> <span class="mi">0</span>
</span><span id="L-183"><a href="#L-183"><span class="linenos"> 183</span></a> <span class="k">for</span> <span class="n">r</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">rows</span><span class="p">):</span>
</span><span id="L-184"><a href="#L-184"><span class="linenos"> 184</span></a> <span class="k">for</span> <span class="n">c</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">cols</span><span class="p">):</span>
</span><span id="L-185"><a href="#L-185"><span class="linenos"> 185</span></a> <span class="k">if</span> <span class="n">grid</span><span class="p">[</span><span class="n">r</span><span class="p">,</span> <span class="n">c</span><span class="p">]</span> <span class="o">!=</span> <span class="mi">0</span><span class="p">:</span>
</span><span id="L-186"><a href="#L-186"><span class="linenos"> 186</span></a> <span class="n">occupied_buffer</span><span class="p">[</span><span class="n">count</span><span class="p">,</span> <span class="mi">0</span><span class="p">]</span> <span class="o">=</span> <span class="n">r</span>
</span><span id="L-187"><a href="#L-187"><span class="linenos"> 187</span></a> <span class="n">occupied_buffer</span><span class="p">[</span><span class="n">count</span><span class="p">,</span> <span class="mi">1</span><span class="p">]</span> <span class="o">=</span> <span class="n">c</span>
</span><span id="L-188"><a href="#L-188"><span class="linenos"> 188</span></a> <span class="n">count</span> <span class="o">+=</span> <span class="mi">1</span>
</span><span id="L-189"><a href="#L-189"><span class="linenos"> 189</span></a>
</span><span id="L-190"><a href="#L-190"><span class="linenos"> 190</span></a> <span class="c1"># Fisher-Yates shuffle</span>
</span><span id="L-191"><a href="#L-191"><span class="linenos"> 191</span></a> <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">count</span> <span class="o">-</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="o">-</span><span class="mi">1</span><span class="p">):</span>
</span><span id="L-192"><a href="#L-192"><span class="linenos"> 192</span></a> <span class="n">j</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">random</span><span class="o">.</span><span class="n">randint</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="n">i</span> <span class="o">+</span> <span class="mi">1</span><span class="p">)</span>
</span><span id="L-193"><a href="#L-193"><span class="linenos"> 193</span></a> <span class="n">occupied_buffer</span><span class="p">[</span><span class="n">i</span><span class="p">,</span> <span class="mi">0</span><span class="p">],</span> <span class="n">occupied_buffer</span><span class="p">[</span><span class="n">j</span><span class="p">,</span> <span class="mi">0</span><span class="p">]</span> <span class="o">=</span> <span class="p">(</span>
</span><span id="L-194"><a href="#L-194"><span class="linenos"> 194</span></a> <span class="n">occupied_buffer</span><span class="p">[</span><span class="n">j</span><span class="p">,</span> <span class="mi">0</span><span class="p">],</span>
</span><span id="L-195"><a href="#L-195"><span class="linenos"> 195</span></a> <span class="n">occupied_buffer</span><span class="p">[</span><span class="n">i</span><span class="p">,</span> <span class="mi">0</span><span class="p">],</span>
</span><span id="L-196"><a href="#L-196"><span class="linenos"> 196</span></a> <span class="p">)</span>
</span><span id="L-197"><a href="#L-197"><span class="linenos"> 197</span></a> <span class="n">occupied_buffer</span><span class="p">[</span><span class="n">i</span><span class="p">,</span> <span class="mi">1</span><span class="p">],</span> <span class="n">occupied_buffer</span><span class="p">[</span><span class="n">j</span><span class="p">,</span> <span class="mi">1</span><span class="p">]</span> <span class="o">=</span> <span class="p">(</span>
</span><span id="L-198"><a href="#L-198"><span class="linenos"> 198</span></a> <span class="n">occupied_buffer</span><span class="p">[</span><span class="n">j</span><span class="p">,</span> <span class="mi">1</span><span class="p">],</span>
</span><span id="L-199"><a href="#L-199"><span class="linenos"> 199</span></a> <span class="n">occupied_buffer</span><span class="p">[</span><span class="n">i</span><span class="p">,</span> <span class="mi">1</span><span class="p">],</span>
</span><span id="L-200"><a href="#L-200"><span class="linenos"> 200</span></a> <span class="p">)</span>
</span><span id="L-201"><a href="#L-201"><span class="linenos"> 201</span></a>
</span><span id="L-202"><a href="#L-202"><span class="linenos"> 202</span></a> <span class="c1"># Process each occupied cell</span>
</span><span id="L-203"><a href="#L-203"><span class="linenos"> 203</span></a> <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">count</span><span class="p">):</span>
</span><span id="L-204"><a href="#L-204"><span class="linenos"> 204</span></a> <span class="n">r</span> <span class="o">=</span> <span class="n">occupied_buffer</span><span class="p">[</span><span class="n">i</span><span class="p">,</span> <span class="mi">0</span><span class="p">]</span>
</span><span id="L-205"><a href="#L-205"><span class="linenos"> 205</span></a> <span class="n">c</span> <span class="o">=</span> <span class="n">occupied_buffer</span><span class="p">[</span><span class="n">i</span><span class="p">,</span> <span class="mi">1</span><span class="p">]</span>
</span><span id="L-206"><a href="#L-206"><span class="linenos"> 206</span></a>
</span><span id="L-207"><a href="#L-207"><span class="linenos"> 207</span></a> <span class="n">state</span> <span class="o">=</span> <span class="n">grid</span><span class="p">[</span><span class="n">r</span><span class="p">,</span> <span class="n">c</span><span class="p">]</span>
</span><span id="L-208"><a href="#L-208"><span class="linenos"> 208</span></a> <span class="k">if</span> <span class="n">state</span> <span class="o">==</span> <span class="mi">0</span><span class="p">:</span>
</span><span id="L-209"><a href="#L-209"><span class="linenos"> 209</span></a> <span class="k">continue</span>
</span><span id="L-210"><a href="#L-210"><span class="linenos"> 210</span></a>
</span><span id="L-211"><a href="#L-211"><span class="linenos"> 211</span></a> <span class="c1"># Random neighbor selection</span>
</span><span id="L-212"><a href="#L-212"><span class="linenos"> 212</span></a> <span class="n">nbi</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">random</span><span class="o">.</span><span class="n">randint</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="n">n_shifts</span><span class="p">)</span>
</span><span id="L-213"><a href="#L-213"><span class="linenos"> 213</span></a> <span class="n">nr</span> <span class="o">=</span> <span class="p">(</span><span class="n">r</span> <span class="o">+</span> <span class="n">dr_arr</span><span class="p">[</span><span class="n">nbi</span><span class="p">])</span> <span class="o">%</span> <span class="n">rows</span>
</span><span id="L-214"><a href="#L-214"><span class="linenos"> 214</span></a> <span class="n">nc</span> <span class="o">=</span> <span class="p">(</span><span class="n">c</span> <span class="o">+</span> <span class="n">dc_arr</span><span class="p">[</span><span class="n">nbi</span><span class="p">])</span> <span class="o">%</span> <span class="n">cols</span>
</span><span id="L-215"><a href="#L-215"><span class="linenos"> 215</span></a>
</span><span id="L-216"><a href="#L-216"><span class="linenos"> 216</span></a> <span class="k">if</span> <span class="n">state</span> <span class="o">==</span> <span class="mi">1</span><span class="p">:</span> <span class="c1"># PREY</span>
</span><span id="L-217"><a href="#L-217"><span class="linenos"> 217</span></a> <span class="k">if</span> <span class="n">np</span><span class="o">.</span><span class="n">random</span><span class="o">.</span><span class="n">random</span><span class="p">()</span> <span class="o"><</span> <span class="n">prey_death_arr</span><span class="p">[</span><span class="n">r</span><span class="p">,</span> <span class="n">c</span><span class="p">]:</span>
</span><span id="L-218"><a href="#L-218"><span class="linenos"> 218</span></a> <span class="n">grid</span><span class="p">[</span><span class="n">r</span><span class="p">,</span> <span class="n">c</span><span class="p">]</span> <span class="o">=</span> <span class="mi">0</span>
</span><span id="L-219"><a href="#L-219"><span class="linenos"> 219</span></a> <span class="n">prey_death_arr</span><span class="p">[</span><span class="n">r</span><span class="p">,</span> <span class="n">c</span><span class="p">]</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">nan</span>
</span><span id="L-220"><a href="#L-220"><span class="linenos"> 220</span></a> <span class="k">elif</span> <span class="n">grid</span><span class="p">[</span><span class="n">nr</span><span class="p">,</span> <span class="n">nc</span><span class="p">]</span> <span class="o">==</span> <span class="mi">0</span><span class="p">:</span>
</span><span id="L-221"><a href="#L-221"><span class="linenos"> 221</span></a> <span class="k">if</span> <span class="n">np</span><span class="o">.</span><span class="n">random</span><span class="o">.</span><span class="n">random</span><span class="p">()</span> <span class="o"><</span> <span class="n">p_birth_val</span><span class="p">:</span>
</span><span id="L-222"><a href="#L-222"><span class="linenos"> 222</span></a> <span class="n">grid</span><span class="p">[</span><span class="n">nr</span><span class="p">,</span> <span class="n">nc</span><span class="p">]</span> <span class="o">=</span> <span class="mi">1</span>
</span><span id="L-223"><a href="#L-223"><span class="linenos"> 223</span></a> <span class="n">parent_val</span> <span class="o">=</span> <span class="n">prey_death_arr</span><span class="p">[</span><span class="n">r</span><span class="p">,</span> <span class="n">c</span><span class="p">]</span>
</span><span id="L-224"><a href="#L-224"><span class="linenos"> 224</span></a> <span class="k">if</span> <span class="ow">not</span> <span class="n">evolution_stopped</span><span class="p">:</span>
</span><span id="L-225"><a href="#L-225"><span class="linenos"> 225</span></a> <span class="n">child_val</span> <span class="o">=</span> <span class="n">parent_val</span> <span class="o">+</span> <span class="n">np</span><span class="o">.</span><span class="n">random</span><span class="o">.</span><span class="n">normal</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="n">evolve_sd</span><span class="p">)</span>
</span><span id="L-226"><a href="#L-226"><span class="linenos"> 226</span></a> <span class="k">if</span> <span class="n">child_val</span> <span class="o"><</span> <span class="n">evolve_min</span><span class="p">:</span>
</span><span id="L-227"><a href="#L-227"><span class="linenos"> 227</span></a> <span class="n">child_val</span> <span class="o">=</span> <span class="n">evolve_min</span>
</span><span id="L-228"><a href="#L-228"><span class="linenos"> 228</span></a> <span class="k">if</span> <span class="n">child_val</span> <span class="o">></span> <span class="n">evolve_max</span><span class="p">:</span>
</span><span id="L-229"><a href="#L-229"><span class="linenos"> 229</span></a> <span class="n">child_val</span> <span class="o">=</span> <span class="n">evolve_max</span>
</span><span id="L-230"><a href="#L-230"><span class="linenos"> 230</span></a> <span class="n">prey_death_arr</span><span class="p">[</span><span class="n">nr</span><span class="p">,</span> <span class="n">nc</span><span class="p">]</span> <span class="o">=</span> <span class="n">child_val</span>
</span><span id="L-231"><a href="#L-231"><span class="linenos"> 231</span></a> <span class="k">else</span><span class="p">:</span>
</span><span id="L-232"><a href="#L-232"><span class="linenos"> 232</span></a> <span class="n">prey_death_arr</span><span class="p">[</span><span class="n">nr</span><span class="p">,</span> <span class="n">nc</span><span class="p">]</span> <span class="o">=</span> <span class="n">parent_val</span>
</span><span id="L-233"><a href="#L-233"><span class="linenos"> 233</span></a>
</span><span id="L-234"><a href="#L-234"><span class="linenos"> 234</span></a> <span class="k">elif</span> <span class="n">state</span> <span class="o">==</span> <span class="mi">2</span><span class="p">:</span> <span class="c1"># PREDATOR</span>
</span><span id="L-235"><a href="#L-235"><span class="linenos"> 235</span></a> <span class="k">if</span> <span class="n">np</span><span class="o">.</span><span class="n">random</span><span class="o">.</span><span class="n">random</span><span class="p">()</span> <span class="o"><</span> <span class="n">pred_death_val</span><span class="p">:</span>
</span><span id="L-236"><a href="#L-236"><span class="linenos"> 236</span></a> <span class="n">grid</span><span class="p">[</span><span class="n">r</span><span class="p">,</span> <span class="n">c</span><span class="p">]</span> <span class="o">=</span> <span class="mi">0</span>
</span><span id="L-237"><a href="#L-237"><span class="linenos"> 237</span></a> <span class="k">elif</span> <span class="n">grid</span><span class="p">[</span><span class="n">nr</span><span class="p">,</span> <span class="n">nc</span><span class="p">]</span> <span class="o">==</span> <span class="mi">1</span><span class="p">:</span>
</span><span id="L-238"><a href="#L-238"><span class="linenos"> 238</span></a> <span class="k">if</span> <span class="n">np</span><span class="o">.</span><span class="n">random</span><span class="o">.</span><span class="n">random</span><span class="p">()</span> <span class="o"><</span> <span class="n">pred_birth_val</span><span class="p">:</span>
</span><span id="L-239"><a href="#L-239"><span class="linenos"> 239</span></a> <span class="n">grid</span><span class="p">[</span><span class="n">nr</span><span class="p">,</span> <span class="n">nc</span><span class="p">]</span> <span class="o">=</span> <span class="mi">2</span>
</span><span id="L-240"><a href="#L-240"><span class="linenos"> 240</span></a> <span class="n">prey_death_arr</span><span class="p">[</span><span class="n">nr</span><span class="p">,</span> <span class="n">nc</span><span class="p">]</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">nan</span>
</span><span id="L-241"><a href="#L-241"><span class="linenos"> 241</span></a>
</span><span id="L-242"><a href="#L-242"><span class="linenos"> 242</span></a> <span class="k">return</span> <span class="n">grid</span>
</span><span id="L-243"><a href="#L-243"><span class="linenos"> 243</span></a>
</span><span id="L-244"><a href="#L-244"><span class="linenos"> 244</span></a>
</span><span id="L-245"><a href="#L-245"><span class="linenos"> 245</span></a><span class="nd">@njit</span><span class="p">(</span><span class="n">cache</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
</span><span id="L-246"><a href="#L-246"><span class="linenos"> 246</span></a><span class="k">def</span><span class="w"> </span><span class="nf">_pp_async_kernel_directed</span><span class="p">(</span>
</span><span id="L-247"><a href="#L-247"><span class="linenos"> 247</span></a> <span class="n">grid</span><span class="p">:</span> <span class="n">np</span><span class="o">.</span><span class="n">ndarray</span><span class="p">,</span>
</span><span id="L-248"><a href="#L-248"><span class="linenos"> 248</span></a> <span class="n">prey_death_arr</span><span class="p">:</span> <span class="n">np</span><span class="o">.</span><span class="n">ndarray</span><span class="p">,</span>
</span><span id="L-249"><a href="#L-249"><span class="linenos"> 249</span></a> <span class="n">p_birth_val</span><span class="p">:</span> <span class="nb">float</span><span class="p">,</span>
</span><span id="L-250"><a href="#L-250"><span class="linenos"> 250</span></a> <span class="n">p_death_val</span><span class="p">:</span> <span class="nb">float</span><span class="p">,</span>
</span><span id="L-251"><a href="#L-251"><span class="linenos"> 251</span></a> <span class="n">pred_birth_val</span><span class="p">:</span> <span class="nb">float</span><span class="p">,</span>
</span><span id="L-252"><a href="#L-252"><span class="linenos"> 252</span></a> <span class="n">pred_death_val</span><span class="p">:</span> <span class="nb">float</span><span class="p">,</span>
</span><span id="L-253"><a href="#L-253"><span class="linenos"> 253</span></a> <span class="n">dr_arr</span><span class="p">:</span> <span class="n">np</span><span class="o">.</span><span class="n">ndarray</span><span class="p">,</span>
</span><span id="L-254"><a href="#L-254"><span class="linenos"> 254</span></a> <span class="n">dc_arr</span><span class="p">:</span> <span class="n">np</span><span class="o">.</span><span class="n">ndarray</span><span class="p">,</span>
</span><span id="L-255"><a href="#L-255"><span class="linenos"> 255</span></a> <span class="n">evolve_sd</span><span class="p">:</span> <span class="nb">float</span><span class="p">,</span>
</span><span id="L-256"><a href="#L-256"><span class="linenos"> 256</span></a> <span class="n">evolve_min</span><span class="p">:</span> <span class="nb">float</span><span class="p">,</span>
</span><span id="L-257"><a href="#L-257"><span class="linenos"> 257</span></a> <span class="n">evolve_max</span><span class="p">:</span> <span class="nb">float</span><span class="p">,</span>
</span><span id="L-258"><a href="#L-258"><span class="linenos"> 258</span></a> <span class="n">evolution_stopped</span><span class="p">:</span> <span class="nb">bool</span><span class="p">,</span>
</span><span id="L-259"><a href="#L-259"><span class="linenos"> 259</span></a> <span class="n">occupied_buffer</span><span class="p">:</span> <span class="n">np</span><span class="o">.</span><span class="n">ndarray</span><span class="p">,</span>
</span><span id="L-260"><a href="#L-260"><span class="linenos"> 260</span></a><span class="p">)</span> <span class="o">-></span> <span class="n">np</span><span class="o">.</span><span class="n">ndarray</span><span class="p">:</span>
</span><span id="L-261"><a href="#L-261"><span class="linenos"> 261</span></a><span class="w"> </span><span class="sd">"""</span>
</span><span id="L-262"><a href="#L-262"><span class="linenos"> 262</span></a><span class="sd"> Asynchronous predator-prey update kernel with directed behavior.</span>
</span><span id="L-263"><a href="#L-263"><span class="linenos"> 263</span></a>
</span><span id="L-264"><a href="#L-264"><span class="linenos"> 264</span></a><span class="sd"> This kernel implements "intelligent" species behavior: prey actively search</span>
</span><span id="L-265"><a href="#L-265"><span class="linenos"> 265</span></a><span class="sd"> for empty spaces to reproduce, and predators actively search for nearby</span>
</span><span id="L-266"><a href="#L-266"><span class="linenos"> 266</span></a><span class="sd"> prey to hunt. A two-pass approach is used to stochastically select a</span>
</span><span id="L-267"><a href="#L-267"><span class="linenos"> 267</span></a><span class="sd"> valid target from the neighborhood without heap allocation.</span>
</span><span id="L-268"><a href="#L-268"><span class="linenos"> 268</span></a>
</span><span id="L-269"><a href="#L-269"><span class="linenos"> 269</span></a><span class="sd"> Parameters</span>
</span><span id="L-270"><a href="#L-270"><span class="linenos"> 270</span></a><span class="sd"> ----------</span>
</span><span id="L-271"><a href="#L-271"><span class="linenos"> 271</span></a><span class="sd"> grid : np.ndarray</span>
</span><span id="L-272"><a href="#L-272"><span class="linenos"> 272</span></a><span class="sd"> 2D integer array representing the simulation grid (0: Empty, 1: Prey, 2: Predator).</span>
</span><span id="L-273"><a href="#L-273"><span class="linenos"> 273</span></a><span class="sd"> prey_death_arr : np.ndarray</span>
</span><span id="L-274"><a href="#L-274"><span class="linenos"> 274</span></a><span class="sd"> 2D float array storing individual prey mortality rates for evolution.</span>
</span><span id="L-275"><a href="#L-275"><span class="linenos"> 275</span></a><span class="sd"> p_birth_val : float</span>
</span><span id="L-276"><a href="#L-276"><span class="linenos"> 276</span></a><span class="sd"> Probability of prey reproduction attempt.</span>
</span><span id="L-277"><a href="#L-277"><span class="linenos"> 277</span></a><span class="sd"> p_death_val : float</span>
</span><span id="L-278"><a href="#L-278"><span class="linenos"> 278</span></a><span class="sd"> Base probability of prey mortality.</span>
</span><span id="L-279"><a href="#L-279"><span class="linenos"> 279</span></a><span class="sd"> pred_birth_val : float</span>
</span><span id="L-280"><a href="#L-280"><span class="linenos"> 280</span></a><span class="sd"> Probability of a predator reproduction attempt (hunting success).</span>
</span><span id="L-281"><a href="#L-281"><span class="linenos"> 281</span></a><span class="sd"> pred_death_val : float</span>
</span><span id="L-282"><a href="#L-282"><span class="linenos"> 282</span></a><span class="sd"> Probability of predator mortality.</span>
</span><span id="L-283"><a href="#L-283"><span class="linenos"> 283</span></a><span class="sd"> dr_arr : np.ndarray</span>
</span><span id="L-284"><a href="#L-284"><span class="linenos"> 284</span></a><span class="sd"> Row offsets defining the spatial neighborhood (e.g., Moore or von Neumann).</span>
</span><span id="L-285"><a href="#L-285"><span class="linenos"> 285</span></a><span class="sd"> dc_arr : np.ndarray</span>
</span><span id="L-286"><a href="#L-286"><span class="linenos"> 286</span></a><span class="sd"> Column offsets defining the spatial neighborhood.</span>
</span><span id="L-287"><a href="#L-287"><span class="linenos"> 287</span></a><span class="sd"> evolve_sd : float</span>
</span><span id="L-288"><a href="#L-288"><span class="linenos"> 288</span></a><span class="sd"> Standard deviation for mutations in prey death rates.</span>
</span><span id="L-289"><a href="#L-289"><span class="linenos"> 289</span></a><span class="sd"> evolve_min : float</span>
</span><span id="L-290"><a href="#L-290"><span class="linenos"> 290</span></a><span class="sd"> Minimum allowable value for evolved prey death rates.</span>
</span><span id="L-291"><a href="#L-291"><span class="linenos"> 291</span></a><span class="sd"> evolve_max : float</span>
</span><span id="L-292"><a href="#L-292"><span class="linenos"> 292</span></a><span class="sd"> Maximum allowable value for evolved prey death rates.</span>
</span><span id="L-293"><a href="#L-293"><span class="linenos"> 293</span></a><span class="sd"> evolution_stopped : bool</span>
</span><span id="L-294"><a href="#L-294"><span class="linenos"> 294</span></a><span class="sd"> If True, prevents mutation during prey reproduction.</span>
</span><span id="L-295"><a href="#L-295"><span class="linenos"> 295</span></a><span class="sd"> occupied_buffer : np.ndarray</span>
</span><span id="L-296"><a href="#L-296"><span class="linenos"> 296</span></a><span class="sd"> Pre-allocated array for storing and shuffling active cell coordinates.</span>
</span><span id="L-297"><a href="#L-297"><span class="linenos"> 297</span></a>
</span><span id="L-298"><a href="#L-298"><span class="linenos"> 298</span></a><span class="sd"> Returns</span>
</span><span id="L-299"><a href="#L-299"><span class="linenos"> 299</span></a><span class="sd"> -------</span>
</span><span id="L-300"><a href="#L-300"><span class="linenos"> 300</span></a><span class="sd"> grid : np.ndarray</span>
</span><span id="L-301"><a href="#L-301"><span class="linenos"> 301</span></a><span class="sd"> The updated simulation grid.</span>
</span><span id="L-302"><a href="#L-302"><span class="linenos"> 302</span></a>
</span><span id="L-303"><a href="#L-303"><span class="linenos"> 303</span></a><span class="sd"> Notes</span>
</span><span id="L-304"><a href="#L-304"><span class="linenos"> 304</span></a><span class="sd"> -----</span>
</span><span id="L-305"><a href="#L-305"><span class="linenos"> 305</span></a><span class="sd"> The directed behavior significantly changes the system dynamics compared to</span>
</span><span id="L-306"><a href="#L-306"><span class="linenos"> 306</span></a><span class="sd"> random neighbor selection, often leading to different critical thresholds</span>
</span><span id="L-307"><a href="#L-307"><span class="linenos"> 307</span></a><span class="sd"> and spatial patterning. Periodic boundary conditions are applied.</span>
</span><span id="L-308"><a href="#L-308"><span class="linenos"> 308</span></a><span class="sd"> """</span>
</span><span id="L-309"><a href="#L-309"><span class="linenos"> 309</span></a> <span class="n">rows</span><span class="p">,</span> <span class="n">cols</span> <span class="o">=</span> <span class="n">grid</span><span class="o">.</span><span class="n">shape</span>
</span><span id="L-310"><a href="#L-310"><span class="linenos"> 310</span></a> <span class="n">n_shifts</span> <span class="o">=</span> <span class="nb">len</span><span class="p">(</span><span class="n">dr_arr</span><span class="p">)</span>
</span><span id="L-311"><a href="#L-311"><span class="linenos"> 311</span></a>
</span><span id="L-312"><a href="#L-312"><span class="linenos"> 312</span></a> <span class="c1"># Collect occupied cells</span>
</span><span id="L-313"><a href="#L-313"><span class="linenos"> 313</span></a> <span class="n">count</span> <span class="o">=</span> <span class="mi">0</span>
</span><span id="L-314"><a href="#L-314"><span class="linenos"> 314</span></a> <span class="k">for</span> <span class="n">r</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">rows</span><span class="p">):</span>
</span><span id="L-315"><a href="#L-315"><span class="linenos"> 315</span></a> <span class="k">for</span> <span class="n">c</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">cols</span><span class="p">):</span>
</span><span id="L-316"><a href="#L-316"><span class="linenos"> 316</span></a> <span class="k">if</span> <span class="n">grid</span><span class="p">[</span><span class="n">r</span><span class="p">,</span> <span class="n">c</span><span class="p">]</span> <span class="o">!=</span> <span class="mi">0</span><span class="p">:</span>
</span><span id="L-317"><a href="#L-317"><span class="linenos"> 317</span></a> <span class="n">occupied_buffer</span><span class="p">[</span><span class="n">count</span><span class="p">,</span> <span class="mi">0</span><span class="p">]</span> <span class="o">=</span> <span class="n">r</span>
</span><span id="L-318"><a href="#L-318"><span class="linenos"> 318</span></a> <span class="n">occupied_buffer</span><span class="p">[</span><span class="n">count</span><span class="p">,</span> <span class="mi">1</span><span class="p">]</span> <span class="o">=</span> <span class="n">c</span>
</span><span id="L-319"><a href="#L-319"><span class="linenos"> 319</span></a> <span class="n">count</span> <span class="o">+=</span> <span class="mi">1</span>
</span><span id="L-320"><a href="#L-320"><span class="linenos"> 320</span></a>
</span><span id="L-321"><a href="#L-321"><span class="linenos"> 321</span></a> <span class="c1"># Fisher-Yates shuffle</span>
</span><span id="L-322"><a href="#L-322"><span class="linenos"> 322</span></a> <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">count</span> <span class="o">-</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="o">-</span><span class="mi">1</span><span class="p">):</span>
</span><span id="L-323"><a href="#L-323"><span class="linenos"> 323</span></a> <span class="n">j</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">random</span><span class="o">.</span><span class="n">randint</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="n">i</span> <span class="o">+</span> <span class="mi">1</span><span class="p">)</span>
</span><span id="L-324"><a href="#L-324"><span class="linenos"> 324</span></a> <span class="n">occupied_buffer</span><span class="p">[</span><span class="n">i</span><span class="p">,</span> <span class="mi">0</span><span class="p">],</span> <span class="n">occupied_buffer</span><span class="p">[</span><span class="n">j</span><span class="p">,</span> <span class="mi">0</span><span class="p">]</span> <span class="o">=</span> <span class="p">(</span>
</span><span id="L-325"><a href="#L-325"><span class="linenos"> 325</span></a> <span class="n">occupied_buffer</span><span class="p">[</span><span class="n">j</span><span class="p">,</span> <span class="mi">0</span><span class="p">],</span>
</span><span id="L-326"><a href="#L-326"><span class="linenos"> 326</span></a> <span class="n">occupied_buffer</span><span class="p">[</span><span class="n">i</span><span class="p">,</span> <span class="mi">0</span><span class="p">],</span>
</span><span id="L-327"><a href="#L-327"><span class="linenos"> 327</span></a> <span class="p">)</span>
</span><span id="L-328"><a href="#L-328"><span class="linenos"> 328</span></a> <span class="n">occupied_buffer</span><span class="p">[</span><span class="n">i</span><span class="p">,</span> <span class="mi">1</span><span class="p">],</span> <span class="n">occupied_buffer</span><span class="p">[</span><span class="n">j</span><span class="p">,</span> <span class="mi">1</span><span class="p">]</span> <span class="o">=</span> <span class="p">(</span>
</span><span id="L-329"><a href="#L-329"><span class="linenos"> 329</span></a> <span class="n">occupied_buffer</span><span class="p">[</span><span class="n">j</span><span class="p">,</span> <span class="mi">1</span><span class="p">],</span>
</span><span id="L-330"><a href="#L-330"><span class="linenos"> 330</span></a> <span class="n">occupied_buffer</span><span class="p">[</span><span class="n">i</span><span class="p">,</span> <span class="mi">1</span><span class="p">],</span>
</span><span id="L-331"><a href="#L-331"><span class="linenos"> 331</span></a> <span class="p">)</span>
</span><span id="L-332"><a href="#L-332"><span class="linenos"> 332</span></a>
</span><span id="L-333"><a href="#L-333"><span class="linenos"> 333</span></a> <span class="c1"># Process each occupied cell</span>
</span><span id="L-334"><a href="#L-334"><span class="linenos"> 334</span></a> <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">count</span><span class="p">):</span>
</span><span id="L-335"><a href="#L-335"><span class="linenos"> 335</span></a> <span class="n">r</span> <span class="o">=</span> <span class="n">occupied_buffer</span><span class="p">[</span><span class="n">i</span><span class="p">,</span> <span class="mi">0</span><span class="p">]</span>
</span><span id="L-336"><a href="#L-336"><span class="linenos"> 336</span></a> <span class="n">c</span> <span class="o">=</span> <span class="n">occupied_buffer</span><span class="p">[</span><span class="n">i</span><span class="p">,</span> <span class="mi">1</span><span class="p">]</span>
</span><span id="L-337"><a href="#L-337"><span class="linenos"> 337</span></a>
</span><span id="L-338"><a href="#L-338"><span class="linenos"> 338</span></a> <span class="n">state</span> <span class="o">=</span> <span class="n">grid</span><span class="p">[</span><span class="n">r</span><span class="p">,</span> <span class="n">c</span><span class="p">]</span>
</span><span id="L-339"><a href="#L-339"><span class="linenos"> 339</span></a> <span class="k">if</span> <span class="n">state</span> <span class="o">==</span> <span class="mi">0</span><span class="p">:</span>
</span><span id="L-340"><a href="#L-340"><span class="linenos"> 340</span></a> <span class="k">continue</span>
</span><span id="L-341"><a href="#L-341"><span class="linenos"> 341</span></a>
</span><span id="L-342"><a href="#L-342"><span class="linenos"> 342</span></a> <span class="k">if</span> <span class="n">state</span> <span class="o">==</span> <span class="mi">1</span><span class="p">:</span> <span class="c1"># PREY - directed reproduction into empty cells</span>
</span><span id="L-343"><a href="#L-343"><span class="linenos"> 343</span></a> <span class="c1"># Check for death first</span>
</span><span id="L-344"><a href="#L-344"><span class="linenos"> 344</span></a> <span class="k">if</span> <span class="n">np</span><span class="o">.</span><span class="n">random</span><span class="o">.</span><span class="n">random</span><span class="p">()</span> <span class="o"><</span> <span class="n">prey_death_arr</span><span class="p">[</span><span class="n">r</span><span class="p">,</span> <span class="n">c</span><span class="p">]:</span>
</span><span id="L-345"><a href="#L-345"><span class="linenos"> 345</span></a> <span class="n">grid</span><span class="p">[</span><span class="n">r</span><span class="p">,</span> <span class="n">c</span><span class="p">]</span> <span class="o">=</span> <span class="mi">0</span>
</span><span id="L-346"><a href="#L-346"><span class="linenos"> 346</span></a> <span class="n">prey_death_arr</span><span class="p">[</span><span class="n">r</span><span class="p">,</span> <span class="n">c</span><span class="p">]</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">nan</span>
</span><span id="L-347"><a href="#L-347"><span class="linenos"> 347</span></a> <span class="k">continue</span>
</span><span id="L-348"><a href="#L-348"><span class="linenos"> 348</span></a>
</span><span id="L-349"><a href="#L-349"><span class="linenos"> 349</span></a> <span class="c1"># Attempt reproduction with directed selection</span>
</span><span id="L-350"><a href="#L-350"><span class="linenos"> 350</span></a> <span class="k">if</span> <span class="n">np</span><span class="o">.</span><span class="n">random</span><span class="o">.</span><span class="n">random</span><span class="p">()</span> <span class="o"><</span> <span class="n">p_birth_val</span><span class="p">:</span>
</span><span id="L-351"><a href="#L-351"><span class="linenos"> 351</span></a> <span class="c1"># Pass 1: Count empty neighbors</span>
</span><span id="L-352"><a href="#L-352"><span class="linenos"> 352</span></a> <span class="n">empty_count</span> <span class="o">=</span> <span class="mi">0</span>
</span><span id="L-353"><a href="#L-353"><span class="linenos"> 353</span></a> <span class="k">for</span> <span class="n">k</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">n_shifts</span><span class="p">):</span>
</span><span id="L-354"><a href="#L-354"><span class="linenos"> 354</span></a> <span class="n">check_r</span> <span class="o">=</span> <span class="p">(</span><span class="n">r</span> <span class="o">+</span> <span class="n">dr_arr</span><span class="p">[</span><span class="n">k</span><span class="p">])</span> <span class="o">%</span> <span class="n">rows</span>
</span><span id="L-355"><a href="#L-355"><span class="linenos"> 355</span></a> <span class="n">check_c</span> <span class="o">=</span> <span class="p">(</span><span class="n">c</span> <span class="o">+</span> <span class="n">dc_arr</span><span class="p">[</span><span class="n">k</span><span class="p">])</span> <span class="o">%</span> <span class="n">cols</span>
</span><span id="L-356"><a href="#L-356"><span class="linenos"> 356</span></a> <span class="k">if</span> <span class="n">grid</span><span class="p">[</span><span class="n">check_r</span><span class="p">,</span> <span class="n">check_c</span><span class="p">]</span> <span class="o">==</span> <span class="mi">0</span><span class="p">:</span>
</span><span id="L-357"><a href="#L-357"><span class="linenos"> 357</span></a> <span class="n">empty_count</span> <span class="o">+=</span> <span class="mi">1</span>
</span><span id="L-358"><a href="#L-358"><span class="linenos"> 358</span></a>
</span><span id="L-359"><a href="#L-359"><span class="linenos"> 359</span></a> <span class="c1"># Pass 2: Select random empty neighbor</span>
</span><span id="L-360"><a href="#L-360"><span class="linenos"> 360</span></a> <span class="k">if</span> <span class="n">empty_count</span> <span class="o">></span> <span class="mi">0</span><span class="p">:</span>
</span><span id="L-361"><a href="#L-361"><span class="linenos"> 361</span></a> <span class="n">target_idx</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">random</span><span class="o">.</span><span class="n">randint</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="n">empty_count</span><span class="p">)</span>
</span><span id="L-362"><a href="#L-362"><span class="linenos"> 362</span></a> <span class="n">found</span> <span class="o">=</span> <span class="mi">0</span>
</span><span id="L-363"><a href="#L-363"><span class="linenos"> 363</span></a> <span class="n">nr</span><span class="p">,</span> <span class="n">nc</span> <span class="o">=</span> <span class="n">r</span><span class="p">,</span> <span class="n">c</span> <span class="c1"># Initialize (will be overwritten)</span>
</span><span id="L-364"><a href="#L-364"><span class="linenos"> 364</span></a> <span class="k">for</span> <span class="n">k</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">n_shifts</span><span class="p">):</span>
</span><span id="L-365"><a href="#L-365"><span class="linenos"> 365</span></a> <span class="n">check_r</span> <span class="o">=</span> <span class="p">(</span><span class="n">r</span> <span class="o">+</span> <span class="n">dr_arr</span><span class="p">[</span><span class="n">k</span><span class="p">])</span> <span class="o">%</span> <span class="n">rows</span>
</span><span id="L-366"><a href="#L-366"><span class="linenos"> 366</span></a> <span class="n">check_c</span> <span class="o">=</span> <span class="p">(</span><span class="n">c</span> <span class="o">+</span> <span class="n">dc_arr</span><span class="p">[</span><span class="n">k</span><span class="p">])</span> <span class="o">%</span> <span class="n">cols</span>
</span><span id="L-367"><a href="#L-367"><span class="linenos"> 367</span></a> <span class="k">if</span> <span class="n">grid</span><span class="p">[</span><span class="n">check_r</span><span class="p">,</span> <span class="n">check_c</span><span class="p">]</span> <span class="o">==</span> <span class="mi">0</span><span class="p">:</span>
</span><span id="L-368"><a href="#L-368"><span class="linenos"> 368</span></a> <span class="k">if</span> <span class="n">found</span> <span class="o">==</span> <span class="n">target_idx</span><span class="p">:</span>
</span><span id="L-369"><a href="#L-369"><span class="linenos"> 369</span></a> <span class="n">nr</span><span class="p">,</span> <span class="n">nc</span> <span class="o">=</span> <span class="n">check_r</span><span class="p">,</span> <span class="n">check_c</span>
</span><span id="L-370"><a href="#L-370"><span class="linenos"> 370</span></a> <span class="k">break</span>
</span><span id="L-371"><a href="#L-371"><span class="linenos"> 371</span></a> <span class="n">found</span> <span class="o">+=</span> <span class="mi">1</span>
</span><span id="L-372"><a href="#L-372"><span class="linenos"> 372</span></a>
</span><span id="L-373"><a href="#L-373"><span class="linenos"> 373</span></a> <span class="c1"># Reproduce into selected empty cell</span>
</span><span id="L-374"><a href="#L-374"><span class="linenos"> 374</span></a> <span class="n">grid</span><span class="p">[</span><span class="n">nr</span><span class="p">,</span> <span class="n">nc</span><span class="p">]</span> <span class="o">=</span> <span class="mi">1</span>
</span><span id="L-375"><a href="#L-375"><span class="linenos"> 375</span></a> <span class="n">parent_val</span> <span class="o">=</span> <span class="n">prey_death_arr</span><span class="p">[</span><span class="n">r</span><span class="p">,</span> <span class="n">c</span><span class="p">]</span>
</span><span id="L-376"><a href="#L-376"><span class="linenos"> 376</span></a> <span class="k">if</span> <span class="ow">not</span> <span class="n">evolution_stopped</span><span class="p">:</span>
</span><span id="L-377"><a href="#L-377"><span class="linenos"> 377</span></a> <span class="n">child_val</span> <span class="o">=</span> <span class="n">parent_val</span> <span class="o">+</span> <span class="n">np</span><span class="o">.</span><span class="n">random</span><span class="o">.</span><span class="n">normal</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="n">evolve_sd</span><span class="p">)</span>
</span><span id="L-378"><a href="#L-378"><span class="linenos"> 378</span></a> <span class="k">if</span> <span class="n">child_val</span> <span class="o"><</span> <span class="n">evolve_min</span><span class="p">:</span>
</span><span id="L-379"><a href="#L-379"><span class="linenos"> 379</span></a> <span class="n">child_val</span> <span class="o">=</span> <span class="n">evolve_min</span>
</span><span id="L-380"><a href="#L-380"><span class="linenos"> 380</span></a> <span class="k">if</span> <span class="n">child_val</span> <span class="o">></span> <span class="n">evolve_max</span><span class="p">:</span>
</span><span id="L-381"><a href="#L-381"><span class="linenos"> 381</span></a> <span class="n">child_val</span> <span class="o">=</span> <span class="n">evolve_max</span>
</span><span id="L-382"><a href="#L-382"><span class="linenos"> 382</span></a> <span class="n">prey_death_arr</span><span class="p">[</span><span class="n">nr</span><span class="p">,</span> <span class="n">nc</span><span class="p">]</span> <span class="o">=</span> <span class="n">child_val</span>
</span><span id="L-383"><a href="#L-383"><span class="linenos"> 383</span></a> <span class="k">else</span><span class="p">:</span>
</span><span id="L-384"><a href="#L-384"><span class="linenos"> 384</span></a> <span class="n">prey_death_arr</span><span class="p">[</span><span class="n">nr</span><span class="p">,</span> <span class="n">nc</span><span class="p">]</span> <span class="o">=</span> <span class="n">parent_val</span>
</span><span id="L-385"><a href="#L-385"><span class="linenos"> 385</span></a>
</span><span id="L-386"><a href="#L-386"><span class="linenos"> 386</span></a> <span class="k">elif</span> <span class="n">state</span> <span class="o">==</span> <span class="mi">2</span><span class="p">:</span> <span class="c1"># PREDATOR - directed hunting</span>
</span><span id="L-387"><a href="#L-387"><span class="linenos"> 387</span></a> <span class="c1"># Check for death first</span>
</span><span id="L-388"><a href="#L-388"><span class="linenos"> 388</span></a> <span class="k">if</span> <span class="n">np</span><span class="o">.</span><span class="n">random</span><span class="o">.</span><span class="n">random</span><span class="p">()</span> <span class="o"><</span> <span class="n">pred_death_val</span><span class="p">:</span>
</span><span id="L-389"><a href="#L-389"><span class="linenos"> 389</span></a> <span class="n">grid</span><span class="p">[</span><span class="n">r</span><span class="p">,</span> <span class="n">c</span><span class="p">]</span> <span class="o">=</span> <span class="mi">0</span>
</span><span id="L-390"><a href="#L-390"><span class="linenos"> 390</span></a> <span class="k">continue</span>
</span><span id="L-391"><a href="#L-391"><span class="linenos"> 391</span></a>
</span><span id="L-392"><a href="#L-392"><span class="linenos"> 392</span></a> <span class="c1"># Attempt hunting with directed selection</span>
</span><span id="L-393"><a href="#L-393"><span class="linenos"> 393</span></a> <span class="k">if</span> <span class="n">np</span><span class="o">.</span><span class="n">random</span><span class="o">.</span><span class="n">random</span><span class="p">()</span> <span class="o"><</span> <span class="n">pred_birth_val</span><span class="p">:</span>
</span><span id="L-394"><a href="#L-394"><span class="linenos"> 394</span></a> <span class="c1"># Pass 1: Count prey neighbors</span>
</span><span id="L-395"><a href="#L-395"><span class="linenos"> 395</span></a> <span class="n">prey_count</span> <span class="o">=</span> <span class="mi">0</span>
</span><span id="L-396"><a href="#L-396"><span class="linenos"> 396</span></a> <span class="k">for</span> <span class="n">k</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">n_shifts</span><span class="p">):</span>
</span><span id="L-397"><a href="#L-397"><span class="linenos"> 397</span></a> <span class="n">check_r</span> <span class="o">=</span> <span class="p">(</span><span class="n">r</span> <span class="o">+</span> <span class="n">dr_arr</span><span class="p">[</span><span class="n">k</span><span class="p">])</span> <span class="o">%</span> <span class="n">rows</span>
</span><span id="L-398"><a href="#L-398"><span class="linenos"> 398</span></a> <span class="n">check_c</span> <span class="o">=</span> <span class="p">(</span><span class="n">c</span> <span class="o">+</span> <span class="n">dc_arr</span><span class="p">[</span><span class="n">k</span><span class="p">])</span> <span class="o">%</span> <span class="n">cols</span>
</span><span id="L-399"><a href="#L-399"><span class="linenos"> 399</span></a> <span class="k">if</span> <span class="n">grid</span><span class="p">[</span><span class="n">check_r</span><span class="p">,</span> <span class="n">check_c</span><span class="p">]</span> <span class="o">==</span> <span class="mi">1</span><span class="p">:</span>
</span><span id="L-400"><a href="#L-400"><span class="linenos"> 400</span></a> <span class="n">prey_count</span> <span class="o">+=</span> <span class="mi">1</span>
</span><span id="L-401"><a href="#L-401"><span class="linenos"> 401</span></a>
</span><span id="L-402"><a href="#L-402"><span class="linenos"> 402</span></a> <span class="c1"># Pass 2: Select random prey neighbor</span>
</span><span id="L-403"><a href="#L-403"><span class="linenos"> 403</span></a> <span class="k">if</span> <span class="n">prey_count</span> <span class="o">></span> <span class="mi">0</span><span class="p">:</span>
</span><span id="L-404"><a href="#L-404"><span class="linenos"> 404</span></a> <span class="n">target_idx</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">random</span><span class="o">.</span><span class="n">randint</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="n">prey_count</span><span class="p">)</span>
</span><span id="L-405"><a href="#L-405"><span class="linenos"> 405</span></a> <span class="n">found</span> <span class="o">=</span> <span class="mi">0</span>
</span><span id="L-406"><a href="#L-406"><span class="linenos"> 406</span></a> <span class="n">nr</span><span class="p">,</span> <span class="n">nc</span> <span class="o">=</span> <span class="n">r</span><span class="p">,</span> <span class="n">c</span> <span class="c1"># Initialize (will be overwritten)</span>
</span><span id="L-407"><a href="#L-407"><span class="linenos"> 407</span></a> <span class="k">for</span> <span class="n">k</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">n_shifts</span><span class="p">):</span>
</span><span id="L-408"><a href="#L-408"><span class="linenos"> 408</span></a> <span class="n">check_r</span> <span class="o">=</span> <span class="p">(</span><span class="n">r</span> <span class="o">+</span> <span class="n">dr_arr</span><span class="p">[</span><span class="n">k</span><span class="p">])</span> <span class="o">%</span> <span class="n">rows</span>
</span><span id="L-409"><a href="#L-409"><span class="linenos"> 409</span></a> <span class="n">check_c</span> <span class="o">=</span> <span class="p">(</span><span class="n">c</span> <span class="o">+</span> <span class="n">dc_arr</span><span class="p">[</span><span class="n">k</span><span class="p">])</span> <span class="o">%</span> <span class="n">cols</span>
</span><span id="L-410"><a href="#L-410"><span class="linenos"> 410</span></a> <span class="k">if</span> <span class="n">grid</span><span class="p">[</span><span class="n">check_r</span><span class="p">,</span> <span class="n">check_c</span><span class="p">]</span> <span class="o">==</span> <span class="mi">1</span><span class="p">:</span>
</span><span id="L-411"><a href="#L-411"><span class="linenos"> 411</span></a> <span class="k">if</span> <span class="n">found</span> <span class="o">==</span> <span class="n">target_idx</span><span class="p">:</span>
</span><span id="L-412"><a href="#L-412"><span class="linenos"> 412</span></a> <span class="n">nr</span><span class="p">,</span> <span class="n">nc</span> <span class="o">=</span> <span class="n">check_r</span><span class="p">,</span> <span class="n">check_c</span>
</span><span id="L-413"><a href="#L-413"><span class="linenos"> 413</span></a> <span class="k">break</span>
</span><span id="L-414"><a href="#L-414"><span class="linenos"> 414</span></a> <span class="n">found</span> <span class="o">+=</span> <span class="mi">1</span>
</span><span id="L-415"><a href="#L-415"><span class="linenos"> 415</span></a>
</span><span id="L-416"><a href="#L-416"><span class="linenos"> 416</span></a> <span class="c1"># Hunt: prey cell becomes predator</span>
</span><span id="L-417"><a href="#L-417"><span class="linenos"> 417</span></a> <span class="n">grid</span><span class="p">[</span><span class="n">nr</span><span class="p">,</span> <span class="n">nc</span><span class="p">]</span> <span class="o">=</span> <span class="mi">2</span>
</span><span id="L-418"><a href="#L-418"><span class="linenos"> 418</span></a> <span class="n">prey_death_arr</span><span class="p">[</span><span class="n">nr</span><span class="p">,</span> <span class="n">nc</span><span class="p">]</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">nan</span>
</span><span id="L-419"><a href="#L-419"><span class="linenos"> 419</span></a>
</span><span id="L-420"><a href="#L-420"><span class="linenos"> 420</span></a> <span class="k">return</span> <span class="n">grid</span>
</span><span id="L-421"><a href="#L-421"><span class="linenos"> 421</span></a>
</span><span id="L-422"><a href="#L-422"><span class="linenos"> 422</span></a>
</span><span id="L-423"><a href="#L-423"><span class="linenos"> 423</span></a><span class="k">class</span><span class="w"> </span><span class="nc">PPKernel</span><span class="p">:</span>
</span><span id="L-424"><a href="#L-424"><span class="linenos"> 424</span></a><span class="w"> </span><span class="sd">"""</span>
</span><span id="L-425"><a href="#L-425"><span class="linenos"> 425</span></a><span class="sd"> Wrapper for predator-prey kernel with pre-allocated buffers.</span>
</span><span id="L-426"><a href="#L-426"><span class="linenos"> 426</span></a>
</span><span id="L-427"><a href="#L-427"><span class="linenos"> 427</span></a><span class="sd"> This class manages the spatial configuration and memory buffers required</span>
</span><span id="L-428"><a href="#L-428"><span class="linenos"> 428</span></a><span class="sd"> for the Numba-accelerated update kernels. By pre-allocating the</span>
</span><span id="L-429"><a href="#L-429"><span class="linenos"> 429</span></a><span class="sd"> `occupied_buffer`, it avoids expensive memory allocations during the</span>
</span><span id="L-430"><a href="#L-430"><span class="linenos"> 430</span></a><span class="sd"> simulation loop.</span>
</span><span id="L-431"><a href="#L-431"><span class="linenos"> 431</span></a>
</span><span id="L-432"><a href="#L-432"><span class="linenos"> 432</span></a><span class="sd"> Parameters</span>
</span><span id="L-433"><a href="#L-433"><span class="linenos"> 433</span></a><span class="sd"> ----------</span>
</span><span id="L-434"><a href="#L-434"><span class="linenos"> 434</span></a><span class="sd"> rows : int</span>
</span><span id="L-435"><a href="#L-435"><span class="linenos"> 435</span></a><span class="sd"> Number of rows in the simulation grid.</span>
</span><span id="L-436"><a href="#L-436"><span class="linenos"> 436</span></a><span class="sd"> cols : int</span>
</span><span id="L-437"><a href="#L-437"><span class="linenos"> 437</span></a><span class="sd"> Number of columns in the simulation grid.</span>
</span><span id="L-438"><a href="#L-438"><span class="linenos"> 438</span></a><span class="sd"> neighborhood : {'moore', 'von_neumann'}, optional</span>
</span><span id="L-439"><a href="#L-439"><span class="linenos"> 439</span></a><span class="sd"> The neighborhood type determining adjacent cells. 'moore' includes</span>
</span><span id="L-440"><a href="#L-440"><span class="linenos"> 440</span></a><span class="sd"> diagonals (8 neighbors), 'von_neumann' does not (4 neighbors).</span>
</span><span id="L-441"><a href="#L-441"><span class="linenos"> 441</span></a><span class="sd"> Default is 'moore'.</span>
</span><span id="L-442"><a href="#L-442"><span class="linenos"> 442</span></a><span class="sd"> directed_hunting : bool, optional</span>
</span><span id="L-443"><a href="#L-443"><span class="linenos"> 443</span></a><span class="sd"> If True, uses the directed behavior kernel where species search for</span>
</span><span id="L-444"><a href="#L-444"><span class="linenos"> 444</span></a><span class="sd"> targets. If False, uses random neighbor selection. Default is False.</span>
</span><span id="L-445"><a href="#L-445"><span class="linenos"> 445</span></a>
</span><span id="L-446"><a href="#L-446"><span class="linenos"> 446</span></a><span class="sd"> Attributes</span>
</span><span id="L-447"><a href="#L-447"><span class="linenos"> 447</span></a><span class="sd"> ----------</span>
</span><span id="L-448"><a href="#L-448"><span class="linenos"> 448</span></a><span class="sd"> rows : int</span>
</span><span id="L-449"><a href="#L-449"><span class="linenos"> 449</span></a><span class="sd"> Grid row count.</span>
</span><span id="L-450"><a href="#L-450"><span class="linenos"> 450</span></a><span class="sd"> cols : int</span>
</span><span id="L-451"><a href="#L-451"><span class="linenos"> 451</span></a><span class="sd"> Grid column count.</span>
</span><span id="L-452"><a href="#L-452"><span class="linenos"> 452</span></a><span class="sd"> directed_hunting : bool</span>
</span><span id="L-453"><a href="#L-453"><span class="linenos"> 453</span></a><span class="sd"> Toggle for intelligent behavior logic.</span>
</span><span id="L-454"><a href="#L-454"><span class="linenos"> 454</span></a><span class="sd"> """</span>
</span><span id="L-455"><a href="#L-455"><span class="linenos"> 455</span></a>
</span><span id="L-456"><a href="#L-456"><span class="linenos"> 456</span></a> <span class="k">def</span><span class="w"> </span><span class="fm">__init__</span><span class="p">(</span>
</span><span id="L-457"><a href="#L-457"><span class="linenos"> 457</span></a> <span class="bp">self</span><span class="p">,</span>
</span><span id="L-458"><a href="#L-458"><span class="linenos"> 458</span></a> <span class="n">rows</span><span class="p">:</span> <span class="nb">int</span><span class="p">,</span>
</span><span id="L-459"><a href="#L-459"><span class="linenos"> 459</span></a> <span class="n">cols</span><span class="p">:</span> <span class="nb">int</span><span class="p">,</span>
</span><span id="L-460"><a href="#L-460"><span class="linenos"> 460</span></a> <span class="n">neighborhood</span><span class="p">:</span> <span class="nb">str</span> <span class="o">=</span> <span class="s2">"moore"</span><span class="p">,</span>
</span><span id="L-461"><a href="#L-461"><span class="linenos"> 461</span></a> <span class="n">directed_hunting</span><span class="p">:</span> <span class="nb">bool</span> <span class="o">=</span> <span class="kc">False</span><span class="p">,</span>
</span><span id="L-462"><a href="#L-462"><span class="linenos"> 462</span></a> <span class="p">):</span>
</span><span id="L-463"><a href="#L-463"><span class="linenos"> 463</span></a> <span class="bp">self</span><span class="o">.</span><span class="n">rows</span> <span class="o">=</span> <span class="n">rows</span>
</span><span id="L-464"><a href="#L-464"><span class="linenos"> 464</span></a> <span class="bp">self</span><span class="o">.</span><span class="n">cols</span> <span class="o">=</span> <span class="n">cols</span>
</span><span id="L-465"><a href="#L-465"><span class="linenos"> 465</span></a> <span class="bp">self</span><span class="o">.</span><span class="n">directed_hunting</span> <span class="o">=</span> <span class="n">directed_hunting</span>
</span><span id="L-466"><a href="#L-466"><span class="linenos"> 466</span></a> <span class="bp">self</span><span class="o">.</span><span class="n">_occupied_buffer</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">empty</span><span class="p">((</span><span class="n">rows</span> <span class="o">*</span> <span class="n">cols</span><span class="p">,</span> <span class="mi">2</span><span class="p">),</span> <span class="n">dtype</span><span class="o">=</span><span class="n">np</span><span class="o">.</span><span class="n">int32</span><span class="p">)</span>
</span><span id="L-467"><a href="#L-467"><span class="linenos"> 467</span></a>
</span><span id="L-468"><a href="#L-468"><span class="linenos"> 468</span></a> <span class="k">if</span> <span class="n">neighborhood</span> <span class="o">==</span> <span class="s2">"moore"</span><span class="p">:</span>
</span><span id="L-469"><a href="#L-469"><span class="linenos"> 469</span></a> <span class="bp">self</span><span class="o">.</span><span class="n">_dr</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">array</span><span class="p">([</span><span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">1</span><span class="p">],</span> <span class="n">dtype</span><span class="o">=</span><span class="n">np</span><span class="o">.</span><span class="n">int32</span><span class="p">)</span>
</span><span id="L-470"><a href="#L-470"><span class="linenos"> 470</span></a> <span class="bp">self</span><span class="o">.</span><span class="n">_dc</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">array</span><span class="p">([</span><span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="mi">1</span><span class="p">],</span> <span class="n">dtype</span><span class="o">=</span><span class="n">np</span><span class="o">.</span><span class="n">int32</span><span class="p">)</span>
</span><span id="L-471"><a href="#L-471"><span class="linenos"> 471</span></a> <span class="k">else</span><span class="p">:</span> <span class="c1"># von Neumann</span>
</span><span id="L-472"><a href="#L-472"><span class="linenos"> 472</span></a> <span class="bp">self</span><span class="o">.</span><span class="n">_dr</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">array</span><span class="p">([</span><span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="mi">0</span><span class="p">],</span> <span class="n">dtype</span><span class="o">=</span><span class="n">np</span><span class="o">.</span><span class="n">int32</span><span class="p">)</span>
</span><span id="L-473"><a href="#L-473"><span class="linenos"> 473</span></a> <span class="bp">self</span><span class="o">.</span><span class="n">_dc</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">array</span><span class="p">([</span><span class="mi">0</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="mi">1</span><span class="p">],</span> <span class="n">dtype</span><span class="o">=</span><span class="n">np</span><span class="o">.</span><span class="n">int32</span><span class="p">)</span>
</span><span id="L-474"><a href="#L-474"><span class="linenos"> 474</span></a>
</span><span id="L-475"><a href="#L-475"><span class="linenos"> 475</span></a> <span class="k">def</span><span class="w"> </span><span class="nf">update</span><span class="p">(</span>
</span><span id="L-476"><a href="#L-476"><span class="linenos"> 476</span></a> <span class="bp">self</span><span class="p">,</span>
</span><span id="L-477"><a href="#L-477"><span class="linenos"> 477</span></a> <span class="n">grid</span><span class="p">:</span> <span class="n">np</span><span class="o">.</span><span class="n">ndarray</span><span class="p">,</span>
</span><span id="L-478"><a href="#L-478"><span class="linenos"> 478</span></a> <span class="n">prey_death_arr</span><span class="p">:</span> <span class="n">np</span><span class="o">.</span><span class="n">ndarray</span><span class="p">,</span>
</span><span id="L-479"><a href="#L-479"><span class="linenos"> 479</span></a> <span class="n">prey_birth</span><span class="p">:</span> <span class="nb">float</span><span class="p">,</span>
</span><span id="L-480"><a href="#L-480"><span class="linenos"> 480</span></a> <span class="n">prey_death</span><span class="p">:</span> <span class="nb">float</span><span class="p">,</span>
</span><span id="L-481"><a href="#L-481"><span class="linenos"> 481</span></a> <span class="n">pred_birth</span><span class="p">:</span> <span class="nb">float</span><span class="p">,</span>
</span><span id="L-482"><a href="#L-482"><span class="linenos"> 482</span></a> <span class="n">pred_death</span><span class="p">:</span> <span class="nb">float</span><span class="p">,</span>
</span><span id="L-483"><a href="#L-483"><span class="linenos"> 483</span></a> <span class="n">evolve_sd</span><span class="p">:</span> <span class="nb">float</span> <span class="o">=</span> <span class="mf">0.1</span><span class="p">,</span>
</span><span id="L-484"><a href="#L-484"><span class="linenos"> 484</span></a> <span class="n">evolve_min</span><span class="p">:</span> <span class="nb">float</span> <span class="o">=</span> <span class="mf">0.001</span><span class="p">,</span>
</span><span id="L-485"><a href="#L-485"><span class="linenos"> 485</span></a> <span class="n">evolve_max</span><span class="p">:</span> <span class="nb">float</span> <span class="o">=</span> <span class="mf">0.1</span><span class="p">,</span>
</span><span id="L-486"><a href="#L-486"><span class="linenos"> 486</span></a> <span class="n">evolution_stopped</span><span class="p">:</span> <span class="nb">bool</span> <span class="o">=</span> <span class="kc">True</span><span class="p">,</span>
</span><span id="L-487"><a href="#L-487"><span class="linenos"> 487</span></a> <span class="p">)</span> <span class="o">-></span> <span class="n">np</span><span class="o">.</span><span class="n">ndarray</span><span class="p">:</span>
</span><span id="L-488"><a href="#L-488"><span class="linenos"> 488</span></a><span class="w"> </span><span class="sd">"""</span>
</span><span id="L-489"><a href="#L-489"><span class="linenos"> 489</span></a><span class="sd"> Execute a single asynchronous update step using the configured kernel.</span>
</span><span id="L-490"><a href="#L-490"><span class="linenos"> 490</span></a>
</span><span id="L-491"><a href="#L-491"><span class="linenos"> 491</span></a><span class="sd"> Parameters</span>
</span><span id="L-492"><a href="#L-492"><span class="linenos"> 492</span></a><span class="sd"> ----------</span>
</span><span id="L-493"><a href="#L-493"><span class="linenos"> 493</span></a><span class="sd"> grid : np.ndarray</span>
</span><span id="L-494"><a href="#L-494"><span class="linenos"> 494</span></a><span class="sd"> The current 2D simulation grid.</span>
</span><span id="L-495"><a href="#L-495"><span class="linenos"> 495</span></a><span class="sd"> prey_death_arr : np.ndarray</span>
</span><span id="L-496"><a href="#L-496"><span class="linenos"> 496</span></a><span class="sd"> 2D array of individual prey mortality rates.</span>
</span><span id="L-497"><a href="#L-497"><span class="linenos"> 497</span></a><span class="sd"> prey_birth : float</span>
</span><span id="L-498"><a href="#L-498"><span class="linenos"> 498</span></a><span class="sd"> Prey reproduction probability.</span>
</span><span id="L-499"><a href="#L-499"><span class="linenos"> 499</span></a><span class="sd"> prey_death : float</span>
</span><span id="L-500"><a href="#L-500"><span class="linenos"> 500</span></a><span class="sd"> Base prey mortality probability.</span>
</span><span id="L-501"><a href="#L-501"><span class="linenos"> 501</span></a><span class="sd"> pred_birth : float</span>
</span><span id="L-502"><a href="#L-502"><span class="linenos"> 502</span></a><span class="sd"> Predator reproduction (hunting success) probability.</span>
</span><span id="L-503"><a href="#L-503"><span class="linenos"> 503</span></a><span class="sd"> pred_death : float</span>
</span><span id="L-504"><a href="#L-504"><span class="linenos"> 504</span></a><span class="sd"> Predator mortality probability.</span>
</span><span id="L-505"><a href="#L-505"><span class="linenos"> 505</span></a><span class="sd"> evolve_sd : float, optional</span>
</span><span id="L-506"><a href="#L-506"><span class="linenos"> 506</span></a><span class="sd"> Mutation standard deviation (default 0.1).</span>
</span><span id="L-507"><a href="#L-507"><span class="linenos"> 507</span></a><span class="sd"> evolve_min : float, optional</span>
</span><span id="L-508"><a href="#L-508"><span class="linenos"> 508</span></a><span class="sd"> Minimum evolved death rate (default 0.001).</span>
</span><span id="L-509"><a href="#L-509"><span class="linenos"> 509</span></a><span class="sd"> evolve_max : float, optional</span>
</span><span id="L-510"><a href="#L-510"><span class="linenos"> 510</span></a><span class="sd"> Maximum evolved death rate (default 0.1).</span>
</span><span id="L-511"><a href="#L-511"><span class="linenos"> 511</span></a><span class="sd"> evolution_stopped : bool, optional</span>
</span><span id="L-512"><a href="#L-512"><span class="linenos"> 512</span></a><span class="sd"> Whether to disable mutation during this step (default True).</span>
</span><span id="L-513"><a href="#L-513"><span class="linenos"> 513</span></a>
</span><span id="L-514"><a href="#L-514"><span class="linenos"> 514</span></a><span class="sd"> Returns</span>
</span><span id="L-515"><a href="#L-515"><span class="linenos"> 515</span></a><span class="sd"> -------</span>
</span><span id="L-516"><a href="#L-516"><span class="linenos"> 516</span></a><span class="sd"> np.ndarray</span>
</span><span id="L-517"><a href="#L-517"><span class="linenos"> 517</span></a><span class="sd"> The updated grid after one full asynchronous pass.</span>
</span><span id="L-518"><a href="#L-518"><span class="linenos"> 518</span></a><span class="sd"> """</span>
</span><span id="L-519"><a href="#L-519"><span class="linenos"> 519</span></a> <span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">directed_hunting</span><span class="p">:</span>
</span><span id="L-520"><a href="#L-520"><span class="linenos"> 520</span></a> <span class="k">return</span> <span class="n">_pp_async_kernel_directed</span><span class="p">(</span>
</span><span id="L-521"><a href="#L-521"><span class="linenos"> 521</span></a> <span class="n">grid</span><span class="p">,</span>
</span><span id="L-522"><a href="#L-522"><span class="linenos"> 522</span></a> <span class="n">prey_death_arr</span><span class="p">,</span>
</span><span id="L-523"><a href="#L-523"><span class="linenos"> 523</span></a> <span class="n">prey_birth</span><span class="p">,</span>
</span><span id="L-524"><a href="#L-524"><span class="linenos"> 524</span></a> <span class="n">prey_death</span><span class="p">,</span>
</span><span id="L-525"><a href="#L-525"><span class="linenos"> 525</span></a> <span class="n">pred_birth</span><span class="p">,</span>
</span><span id="L-526"><a href="#L-526"><span class="linenos"> 526</span></a> <span class="n">pred_death</span><span class="p">,</span>
</span><span id="L-527"><a href="#L-527"><span class="linenos"> 527</span></a> <span class="bp">self</span><span class="o">.</span><span class="n">_dr</span><span class="p">,</span>
</span><span id="L-528"><a href="#L-528"><span class="linenos"> 528</span></a> <span class="bp">self</span><span class="o">.</span><span class="n">_dc</span><span class="p">,</span>
</span><span id="L-529"><a href="#L-529"><span class="linenos"> 529</span></a> <span class="n">evolve_sd</span><span class="p">,</span>
</span><span id="L-530"><a href="#L-530"><span class="linenos"> 530</span></a> <span class="n">evolve_min</span><span class="p">,</span>
</span><span id="L-531"><a href="#L-531"><span class="linenos"> 531</span></a> <span class="n">evolve_max</span><span class="p">,</span>
</span><span id="L-532"><a href="#L-532"><span class="linenos"> 532</span></a> <span class="n">evolution_stopped</span><span class="p">,</span>
</span><span id="L-533"><a href="#L-533"><span class="linenos"> 533</span></a> <span class="bp">self</span><span class="o">.</span><span class="n">_occupied_buffer</span><span class="p">,</span>
</span><span id="L-534"><a href="#L-534"><span class="linenos"> 534</span></a> <span class="p">)</span>
</span><span id="L-535"><a href="#L-535"><span class="linenos"> 535</span></a> <span class="k">else</span><span class="p">:</span>
</span><span id="L-536"><a href="#L-536"><span class="linenos"> 536</span></a> <span class="k">return</span> <span class="n">_pp_async_kernel_random</span><span class="p">(</span>
</span><span id="L-537"><a href="#L-537"><span class="linenos"> 537</span></a> <span class="n">grid</span><span class="p">,</span>
</span><span id="L-538"><a href="#L-538"><span class="linenos"> 538</span></a> <span class="n">prey_death_arr</span><span class="p">,</span>
</span><span id="L-539"><a href="#L-539"><span class="linenos"> 539</span></a> <span class="n">prey_birth</span><span class="p">,</span>
</span><span id="L-540"><a href="#L-540"><span class="linenos"> 540</span></a> <span class="n">prey_death</span><span class="p">,</span>
</span><span id="L-541"><a href="#L-541"><span class="linenos"> 541</span></a> <span class="n">pred_birth</span><span class="p">,</span>
</span><span id="L-542"><a href="#L-542"><span class="linenos"> 542</span></a> <span class="n">pred_death</span><span class="p">,</span>
</span><span id="L-543"><a href="#L-543"><span class="linenos"> 543</span></a> <span class="bp">self</span><span class="o">.</span><span class="n">_dr</span><span class="p">,</span>
</span><span id="L-544"><a href="#L-544"><span class="linenos"> 544</span></a> <span class="bp">self</span><span class="o">.</span><span class="n">_dc</span><span class="p">,</span>
</span><span id="L-545"><a href="#L-545"><span class="linenos"> 545</span></a> <span class="n">evolve_sd</span><span class="p">,</span>
</span><span id="L-546"><a href="#L-546"><span class="linenos"> 546</span></a> <span class="n">evolve_min</span><span class="p">,</span>
</span><span id="L-547"><a href="#L-547"><span class="linenos"> 547</span></a> <span class="n">evolve_max</span><span class="p">,</span>
</span><span id="L-548"><a href="#L-548"><span class="linenos"> 548</span></a> <span class="n">evolution_stopped</span><span class="p">,</span>
</span><span id="L-549"><a href="#L-549"><span class="linenos"> 549</span></a> <span class="bp">self</span><span class="o">.</span><span class="n">_occupied_buffer</span><span class="p">,</span>
</span><span id="L-550"><a href="#L-550"><span class="linenos"> 550</span></a> <span class="p">)</span>
</span><span id="L-551"><a href="#L-551"><span class="linenos"> 551</span></a>
</span><span id="L-552"><a href="#L-552"><span class="linenos"> 552</span></a>
</span><span id="L-553"><a href="#L-553"><span class="linenos"> 553</span></a><span class="c1"># ============================================================================</span>
</span><span id="L-554"><a href="#L-554"><span class="linenos"> 554</span></a><span class="c1"># CLUSTER DETECTION (ENHANCED)</span>
</span><span id="L-555"><a href="#L-555"><span class="linenos"> 555</span></a><span class="c1"># ============================================================================</span>
</span><span id="L-556"><a href="#L-556"><span class="linenos"> 556</span></a>
</span><span id="L-557"><a href="#L-557"><span class="linenos"> 557</span></a>
</span><span id="L-558"><a href="#L-558"><span class="linenos"> 558</span></a><span class="nd">@njit</span><span class="p">(</span><span class="n">cache</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
</span><span id="L-559"><a href="#L-559"><span class="linenos"> 559</span></a><span class="k">def</span><span class="w"> </span><span class="nf">_flood_fill</span><span class="p">(</span>
</span><span id="L-560"><a href="#L-560"><span class="linenos"> 560</span></a> <span class="n">grid</span><span class="p">:</span> <span class="n">np</span><span class="o">.</span><span class="n">ndarray</span><span class="p">,</span>
</span><span id="L-561"><a href="#L-561"><span class="linenos"> 561</span></a> <span class="n">visited</span><span class="p">:</span> <span class="n">np</span><span class="o">.</span><span class="n">ndarray</span><span class="p">,</span>
</span><span id="L-562"><a href="#L-562"><span class="linenos"> 562</span></a> <span class="n">start_r</span><span class="p">:</span> <span class="nb">int</span><span class="p">,</span>
</span><span id="L-563"><a href="#L-563"><span class="linenos"> 563</span></a> <span class="n">start_c</span><span class="p">:</span> <span class="nb">int</span><span class="p">,</span>
</span><span id="L-564"><a href="#L-564"><span class="linenos"> 564</span></a> <span class="n">target</span><span class="p">:</span> <span class="nb">int</span><span class="p">,</span>
</span><span id="L-565"><a href="#L-565"><span class="linenos"> 565</span></a> <span class="n">rows</span><span class="p">:</span> <span class="nb">int</span><span class="p">,</span>
</span><span id="L-566"><a href="#L-566"><span class="linenos"> 566</span></a> <span class="n">cols</span><span class="p">:</span> <span class="nb">int</span><span class="p">,</span>
</span><span id="L-567"><a href="#L-567"><span class="linenos"> 567</span></a> <span class="n">moore</span><span class="p">:</span> <span class="nb">bool</span><span class="p">,</span>
</span><span id="L-568"><a href="#L-568"><span class="linenos"> 568</span></a><span class="p">)</span> <span class="o">-></span> <span class="nb">int</span><span class="p">:</span>
</span><span id="L-569"><a href="#L-569"><span class="linenos"> 569</span></a><span class="w"> </span><span class="sd">"""</span>
</span><span id="L-570"><a href="#L-570"><span class="linenos"> 570</span></a><span class="sd"> Perform a stack-based flood fill to measure the size of a connected cluster.</span>
</span><span id="L-571"><a href="#L-571"><span class="linenos"> 571</span></a>
</span><span id="L-572"><a href="#L-572"><span class="linenos"> 572</span></a><span class="sd"> This Numba-accelerated function identifies all contiguous cells of a</span>
</span><span id="L-573"><a href="#L-573"><span class="linenos"> 573</span></a><span class="sd"> specific target value starting from a given coordinate. It supports</span>
</span><span id="L-574"><a href="#L-574"><span class="linenos"> 574</span></a><span class="sd"> both Moore and von Neumann neighborhoods and implements periodic</span>
</span><span id="L-575"><a href="#L-575"><span class="linenos"> 575</span></a><span class="sd"> boundary conditions (toroidal topology).</span>
</span><span id="L-576"><a href="#L-576"><span class="linenos"> 576</span></a>
</span><span id="L-577"><a href="#L-577"><span class="linenos"> 577</span></a><span class="sd"> Parameters</span>
</span><span id="L-578"><a href="#L-578"><span class="linenos"> 578</span></a><span class="sd"> ----------</span>
</span><span id="L-579"><a href="#L-579"><span class="linenos"> 579</span></a><span class="sd"> grid : np.ndarray</span>
</span><span id="L-580"><a href="#L-580"><span class="linenos"> 580</span></a><span class="sd"> 2D integer array representing the simulation environment.</span>
</span><span id="L-581"><a href="#L-581"><span class="linenos"> 581</span></a><span class="sd"> visited : np.ndarray</span>
</span><span id="L-582"><a href="#L-582"><span class="linenos"> 582</span></a><span class="sd"> 2D boolean array tracked across calls to avoid re-processing cells.</span>
</span><span id="L-583"><a href="#L-583"><span class="linenos"> 583</span></a><span class="sd"> start_r : int</span>
</span><span id="L-584"><a href="#L-584"><span class="linenos"> 584</span></a><span class="sd"> Starting row index for the flood fill.</span>
</span><span id="L-585"><a href="#L-585"><span class="linenos"> 585</span></a><span class="sd"> start_c : int</span>
</span><span id="L-586"><a href="#L-586"><span class="linenos"> 586</span></a><span class="sd"> Starting column index for the flood fill.</span>
</span><span id="L-587"><a href="#L-587"><span class="linenos"> 587</span></a><span class="sd"> target : int</span>
</span><span id="L-588"><a href="#L-588"><span class="linenos"> 588</span></a><span class="sd"> The cell value (e.g., 1 for Prey, 2 for Predator) to include in the cluster.</span>
</span><span id="L-589"><a href="#L-589"><span class="linenos"> 589</span></a><span class="sd"> rows : int</span>
</span><span id="L-590"><a href="#L-590"><span class="linenos"> 590</span></a><span class="sd"> Total number of rows in the grid.</span>
</span><span id="L-591"><a href="#L-591"><span class="linenos"> 591</span></a><span class="sd"> cols : int</span>
</span><span id="L-592"><a href="#L-592"><span class="linenos"> 592</span></a><span class="sd"> Total number of columns in the grid.</span>
</span><span id="L-593"><a href="#L-593"><span class="linenos"> 593</span></a><span class="sd"> moore : bool</span>
</span><span id="L-594"><a href="#L-594"><span class="linenos"> 594</span></a><span class="sd"> If True, use a Moore neighborhood (8 neighbors). If False, use a</span>
</span><span id="L-595"><a href="#L-595"><span class="linenos"> 595</span></a><span class="sd"> von Neumann neighborhood (4 neighbors).</span>
</span><span id="L-596"><a href="#L-596"><span class="linenos"> 596</span></a>
</span><span id="L-597"><a href="#L-597"><span class="linenos"> 597</span></a><span class="sd"> Returns</span>
</span><span id="L-598"><a href="#L-598"><span class="linenos"> 598</span></a><span class="sd"> -------</span>
</span><span id="L-599"><a href="#L-599"><span class="linenos"> 599</span></a><span class="sd"> size : int</span>
</span><span id="L-600"><a href="#L-600"><span class="linenos"> 600</span></a><span class="sd"> The total number of connected cells belonging to the cluster.</span>
</span><span id="L-601"><a href="#L-601"><span class="linenos"> 601</span></a>
</span><span id="L-602"><a href="#L-602"><span class="linenos"> 602</span></a><span class="sd"> Notes</span>
</span><span id="L-603"><a href="#L-603"><span class="linenos"> 603</span></a><span class="sd"> -----</span>
</span><span id="L-604"><a href="#L-604"><span class="linenos"> 604</span></a><span class="sd"> The function uses a manual stack implementation to avoid recursion limit</span>
</span><span id="L-605"><a href="#L-605"><span class="linenos"> 605</span></a><span class="sd"> issues and is optimized for use within JIT-compiled loops.</span>
</span><span id="L-606"><a href="#L-606"><span class="linenos"> 606</span></a><span class="sd"> """</span>
</span><span id="L-607"><a href="#L-607"><span class="linenos"> 607</span></a> <span class="n">max_stack</span> <span class="o">=</span> <span class="n">rows</span> <span class="o">*</span> <span class="n">cols</span>
</span><span id="L-608"><a href="#L-608"><span class="linenos"> 608</span></a> <span class="n">stack_r</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">empty</span><span class="p">(</span><span class="n">max_stack</span><span class="p">,</span> <span class="n">dtype</span><span class="o">=</span><span class="n">np</span><span class="o">.</span><span class="n">int32</span><span class="p">)</span>
</span><span id="L-609"><a href="#L-609"><span class="linenos"> 609</span></a> <span class="n">stack_c</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">empty</span><span class="p">(</span><span class="n">max_stack</span><span class="p">,</span> <span class="n">dtype</span><span class="o">=</span><span class="n">np</span><span class="o">.</span><span class="n">int32</span><span class="p">)</span>
</span><span id="L-610"><a href="#L-610"><span class="linenos"> 610</span></a> <span class="n">stack_ptr</span> <span class="o">=</span> <span class="mi">0</span>
</span><span id="L-611"><a href="#L-611"><span class="linenos"> 611</span></a>
</span><span id="L-612"><a href="#L-612"><span class="linenos"> 612</span></a> <span class="n">stack_r</span><span class="p">[</span><span class="n">stack_ptr</span><span class="p">]</span> <span class="o">=</span> <span class="n">start_r</span>
</span><span id="L-613"><a href="#L-613"><span class="linenos"> 613</span></a> <span class="n">stack_c</span><span class="p">[</span><span class="n">stack_ptr</span><span class="p">]</span> <span class="o">=</span> <span class="n">start_c</span>
</span><span id="L-614"><a href="#L-614"><span class="linenos"> 614</span></a> <span class="n">stack_ptr</span> <span class="o">+=</span> <span class="mi">1</span>
</span><span id="L-615"><a href="#L-615"><span class="linenos"> 615</span></a> <span class="n">visited</span><span class="p">[</span><span class="n">start_r</span><span class="p">,</span> <span class="n">start_c</span><span class="p">]</span> <span class="o">=</span> <span class="kc">True</span>
</span><span id="L-616"><a href="#L-616"><span class="linenos"> 616</span></a>
</span><span id="L-617"><a href="#L-617"><span class="linenos"> 617</span></a> <span class="n">size</span> <span class="o">=</span> <span class="mi">0</span>
</span><span id="L-618"><a href="#L-618"><span class="linenos"> 618</span></a>
</span><span id="L-619"><a href="#L-619"><span class="linenos"> 619</span></a> <span class="k">if</span> <span class="n">moore</span><span class="p">:</span>
</span><span id="L-620"><a href="#L-620"><span class="linenos"> 620</span></a> <span class="n">dr</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">array</span><span class="p">([</span><span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">1</span><span class="p">],</span> <span class="n">dtype</span><span class="o">=</span><span class="n">np</span><span class="o">.</span><span class="n">int32</span><span class="p">)</span>
</span><span id="L-621"><a href="#L-621"><span class="linenos"> 621</span></a> <span class="n">dc</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">array</span><span class="p">([</span><span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="mi">1</span><span class="p">],</span> <span class="n">dtype</span><span class="o">=</span><span class="n">np</span><span class="o">.</span><span class="n">int32</span><span class="p">)</span>
</span><span id="L-622"><a href="#L-622"><span class="linenos"> 622</span></a> <span class="n">n_neighbors</span> <span class="o">=</span> <span class="mi">8</span>
</span><span id="L-623"><a href="#L-623"><span class="linenos"> 623</span></a> <span class="k">else</span><span class="p">:</span>
</span><span id="L-624"><a href="#L-624"><span class="linenos"> 624</span></a> <span class="n">dr</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">array</span><span class="p">([</span><span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="mi">0</span><span class="p">],</span> <span class="n">dtype</span><span class="o">=</span><span class="n">np</span><span class="o">.</span><span class="n">int32</span><span class="p">)</span>
</span><span id="L-625"><a href="#L-625"><span class="linenos"> 625</span></a> <span class="n">dc</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">array</span><span class="p">([</span><span class="mi">0</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="mi">1</span><span class="p">],</span> <span class="n">dtype</span><span class="o">=</span><span class="n">np</span><span class="o">.</span><span class="n">int32</span><span class="p">)</span>
</span><span id="L-626"><a href="#L-626"><span class="linenos"> 626</span></a> <span class="n">n_neighbors</span> <span class="o">=</span> <span class="mi">4</span>
</span><span id="L-627"><a href="#L-627"><span class="linenos"> 627</span></a>
</span><span id="L-628"><a href="#L-628"><span class="linenos"> 628</span></a> <span class="k">while</span> <span class="n">stack_ptr</span> <span class="o">></span> <span class="mi">0</span><span class="p">:</span>
</span><span id="L-629"><a href="#L-629"><span class="linenos"> 629</span></a> <span class="n">stack_ptr</span> <span class="o">-=</span> <span class="mi">1</span>
</span><span id="L-630"><a href="#L-630"><span class="linenos"> 630</span></a> <span class="n">r</span> <span class="o">=</span> <span class="n">stack_r</span><span class="p">[</span><span class="n">stack_ptr</span><span class="p">]</span>
</span><span id="L-631"><a href="#L-631"><span class="linenos"> 631</span></a> <span class="n">c</span> <span class="o">=</span> <span class="n">stack_c</span><span class="p">[</span><span class="n">stack_ptr</span><span class="p">]</span>
</span><span id="L-632"><a href="#L-632"><span class="linenos"> 632</span></a> <span class="n">size</span> <span class="o">+=</span> <span class="mi">1</span>
</span><span id="L-633"><a href="#L-633"><span class="linenos"> 633</span></a>
</span><span id="L-634"><a href="#L-634"><span class="linenos"> 634</span></a> <span class="k">for</span> <span class="n">k</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">n_neighbors</span><span class="p">):</span>
</span><span id="L-635"><a href="#L-635"><span class="linenos"> 635</span></a> <span class="n">nr</span> <span class="o">=</span> <span class="p">(</span><span class="n">r</span> <span class="o">+</span> <span class="n">dr</span><span class="p">[</span><span class="n">k</span><span class="p">])</span> <span class="o">%</span> <span class="n">rows</span>
</span><span id="L-636"><a href="#L-636"><span class="linenos"> 636</span></a> <span class="n">nc</span> <span class="o">=</span> <span class="p">(</span><span class="n">c</span> <span class="o">+</span> <span class="n">dc</span><span class="p">[</span><span class="n">k</span><span class="p">])</span> <span class="o">%</span> <span class="n">cols</span>
</span><span id="L-637"><a href="#L-637"><span class="linenos"> 637</span></a>
</span><span id="L-638"><a href="#L-638"><span class="linenos"> 638</span></a> <span class="k">if</span> <span class="ow">not</span> <span class="n">visited</span><span class="p">[</span><span class="n">nr</span><span class="p">,</span> <span class="n">nc</span><span class="p">]</span> <span class="ow">and</span> <span class="n">grid</span><span class="p">[</span><span class="n">nr</span><span class="p">,</span> <span class="n">nc</span><span class="p">]</span> <span class="o">==</span> <span class="n">target</span><span class="p">:</span>
</span><span id="L-639"><a href="#L-639"><span class="linenos"> 639</span></a> <span class="n">visited</span><span class="p">[</span><span class="n">nr</span><span class="p">,</span> <span class="n">nc</span><span class="p">]</span> <span class="o">=</span> <span class="kc">True</span>
</span><span id="L-640"><a href="#L-640"><span class="linenos"> 640</span></a> <span class="n">stack_r</span><span class="p">[</span><span class="n">stack_ptr</span><span class="p">]</span> <span class="o">=</span> <span class="n">nr</span>
</span><span id="L-641"><a href="#L-641"><span class="linenos"> 641</span></a> <span class="n">stack_c</span><span class="p">[</span><span class="n">stack_ptr</span><span class="p">]</span> <span class="o">=</span> <span class="n">nc</span>
</span><span id="L-642"><a href="#L-642"><span class="linenos"> 642</span></a> <span class="n">stack_ptr</span> <span class="o">+=</span> <span class="mi">1</span>
</span><span id="L-643"><a href="#L-643"><span class="linenos"> 643</span></a>
</span><span id="L-644"><a href="#L-644"><span class="linenos"> 644</span></a> <span class="k">return</span> <span class="n">size</span>
</span><span id="L-645"><a href="#L-645"><span class="linenos"> 645</span></a>
</span><span id="L-646"><a href="#L-646"><span class="linenos"> 646</span></a>
</span><span id="L-647"><a href="#L-647"><span class="linenos"> 647</span></a><span class="nd">@njit</span><span class="p">(</span><span class="n">cache</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
</span><span id="L-648"><a href="#L-648"><span class="linenos"> 648</span></a><span class="k">def</span><span class="w"> </span><span class="nf">_measure_clusters</span><span class="p">(</span><span class="n">grid</span><span class="p">:</span> <span class="n">np</span><span class="o">.</span><span class="n">ndarray</span><span class="p">,</span> <span class="n">species</span><span class="p">:</span> <span class="nb">int</span><span class="p">,</span> <span class="n">moore</span><span class="p">:</span> <span class="nb">bool</span> <span class="o">=</span> <span class="kc">True</span><span class="p">)</span> <span class="o">-></span> <span class="n">np</span><span class="o">.</span><span class="n">ndarray</span><span class="p">:</span>
</span><span id="L-649"><a href="#L-649"><span class="linenos"> 649</span></a><span class="w"> </span><span class="sd">"""</span>
</span><span id="L-650"><a href="#L-650"><span class="linenos"> 650</span></a><span class="sd"> Identify and measure the sizes of all connected clusters for a specific species.</span>
</span><span id="L-651"><a href="#L-651"><span class="linenos"> 651</span></a>
</span><span id="L-652"><a href="#L-652"><span class="linenos"> 652</span></a><span class="sd"> This function scans the entire grid and initiates a flood-fill algorithm</span>
</span><span id="L-653"><a href="#L-653"><span class="linenos"> 653</span></a><span class="sd"> whenever an unvisited cell of the target species is encountered. It</span>
</span><span id="L-654"><a href="#L-654"><span class="linenos"> 654</span></a><span class="sd"> returns an array containing the size (cell count) of each identified cluster.</span>
</span><span id="L-655"><a href="#L-655"><span class="linenos"> 655</span></a>
</span><span id="L-656"><a href="#L-656"><span class="linenos"> 656</span></a><span class="sd"> Parameters</span>
</span><span id="L-657"><a href="#L-657"><span class="linenos"> 657</span></a><span class="sd"> ----------</span>
</span><span id="L-658"><a href="#L-658"><span class="linenos"> 658</span></a><span class="sd"> grid : np.ndarray</span>
</span><span id="L-659"><a href="#L-659"><span class="linenos"> 659</span></a><span class="sd"> 2D integer array representing the simulation environment.</span>
</span><span id="L-660"><a href="#L-660"><span class="linenos"> 660</span></a><span class="sd"> species : int</span>
</span><span id="L-661"><a href="#L-661"><span class="linenos"> 661</span></a><span class="sd"> The target species identifier (e.g., 1 for Prey, 2 for Predator).</span>
</span><span id="L-662"><a href="#L-662"><span class="linenos"> 662</span></a><span class="sd"> moore : bool, optional</span>
</span><span id="L-663"><a href="#L-663"><span class="linenos"> 663</span></a><span class="sd"> Determines the connectivity logic. If True, uses the Moore neighborhood</span>
</span><span id="L-664"><a href="#L-664"><span class="linenos"> 664</span></a><span class="sd"> (8 neighbors); if False, uses the von Neumann neighborhood (4 neighbors).</span>
</span><span id="L-665"><a href="#L-665"><span class="linenos"> 665</span></a><span class="sd"> Default is True.</span>
</span><span id="L-666"><a href="#L-666"><span class="linenos"> 666</span></a>
</span><span id="L-667"><a href="#L-667"><span class="linenos"> 667</span></a><span class="sd"> Returns</span>
</span><span id="L-668"><a href="#L-668"><span class="linenos"> 668</span></a><span class="sd"> -------</span>
</span><span id="L-669"><a href="#L-669"><span class="linenos"> 669</span></a><span class="sd"> cluster_sizes : np.ndarray</span>
</span><span id="L-670"><a href="#L-670"><span class="linenos"> 670</span></a><span class="sd"> A 1D array of integers where each element represents the size of</span>
</span><span id="L-671"><a href="#L-671"><span class="linenos"> 671</span></a><span class="sd"> one connected cluster.</span>
</span><span id="L-672"><a href="#L-672"><span class="linenos"> 672</span></a>
</span><span id="L-673"><a href="#L-673"><span class="linenos"> 673</span></a><span class="sd"> Notes</span>
</span><span id="L-674"><a href="#L-674"><span class="linenos"> 674</span></a><span class="sd"> -----</span>
</span><span id="L-675"><a href="#L-675"><span class="linenos"> 675</span></a><span class="sd"> This function is Numba-optimized and utilizes an internal `visited` mask</span>
</span><span id="L-676"><a href="#L-676"><span class="linenos"> 676</span></a><span class="sd"> to ensure each cell is processed only once, maintaining $O(N)$</span>
</span><span id="L-677"><a href="#L-677"><span class="linenos"> 677</span></a><span class="sd"> complexity relative to the number of cells.</span>
</span><span id="L-678"><a href="#L-678"><span class="linenos"> 678</span></a><span class="sd"> """</span>
</span><span id="L-679"><a href="#L-679"><span class="linenos"> 679</span></a> <span class="n">rows</span><span class="p">,</span> <span class="n">cols</span> <span class="o">=</span> <span class="n">grid</span><span class="o">.</span><span class="n">shape</span>
</span><span id="L-680"><a href="#L-680"><span class="linenos"> 680</span></a> <span class="n">visited</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">zeros</span><span class="p">((</span><span class="n">rows</span><span class="p">,</span> <span class="n">cols</span><span class="p">),</span> <span class="n">dtype</span><span class="o">=</span><span class="n">np</span><span class="o">.</span><span class="n">bool_</span><span class="p">)</span>
</span><span id="L-681"><a href="#L-681"><span class="linenos"> 681</span></a>
</span><span id="L-682"><a href="#L-682"><span class="linenos"> 682</span></a> <span class="n">max_clusters</span> <span class="o">=</span> <span class="n">rows</span> <span class="o">*</span> <span class="n">cols</span>
</span><span id="L-683"><a href="#L-683"><span class="linenos"> 683</span></a> <span class="n">sizes</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">empty</span><span class="p">(</span><span class="n">max_clusters</span><span class="p">,</span> <span class="n">dtype</span><span class="o">=</span><span class="n">np</span><span class="o">.</span><span class="n">int32</span><span class="p">)</span>
</span><span id="L-684"><a href="#L-684"><span class="linenos"> 684</span></a> <span class="n">n_clusters</span> <span class="o">=</span> <span class="mi">0</span>
</span><span id="L-685"><a href="#L-685"><span class="linenos"> 685</span></a>
</span><span id="L-686"><a href="#L-686"><span class="linenos"> 686</span></a> <span class="k">for</span> <span class="n">r</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">rows</span><span class="p">):</span>
</span><span id="L-687"><a href="#L-687"><span class="linenos"> 687</span></a> <span class="k">for</span> <span class="n">c</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">cols</span><span class="p">):</span>
</span><span id="L-688"><a href="#L-688"><span class="linenos"> 688</span></a> <span class="k">if</span> <span class="n">grid</span><span class="p">[</span><span class="n">r</span><span class="p">,</span> <span class="n">c</span><span class="p">]</span> <span class="o">==</span> <span class="n">species</span> <span class="ow">and</span> <span class="ow">not</span> <span class="n">visited</span><span class="p">[</span><span class="n">r</span><span class="p">,</span> <span class="n">c</span><span class="p">]:</span>
</span><span id="L-689"><a href="#L-689"><span class="linenos"> 689</span></a> <span class="n">size</span> <span class="o">=</span> <span class="n">_flood_fill</span><span class="p">(</span><span class="n">grid</span><span class="p">,</span> <span class="n">visited</span><span class="p">,</span> <span class="n">r</span><span class="p">,</span> <span class="n">c</span><span class="p">,</span> <span class="n">species</span><span class="p">,</span> <span class="n">rows</span><span class="p">,</span> <span class="n">cols</span><span class="p">,</span> <span class="n">moore</span><span class="p">)</span>
</span><span id="L-690"><a href="#L-690"><span class="linenos"> 690</span></a> <span class="n">sizes</span><span class="p">[</span><span class="n">n_clusters</span><span class="p">]</span> <span class="o">=</span> <span class="n">size</span>
</span><span id="L-691"><a href="#L-691"><span class="linenos"> 691</span></a> <span class="n">n_clusters</span> <span class="o">+=</span> <span class="mi">1</span>
</span><span id="L-692"><a href="#L-692"><span class="linenos"> 692</span></a>
</span><span id="L-693"><a href="#L-693"><span class="linenos"> 693</span></a> <span class="k">return</span> <span class="n">sizes</span><span class="p">[:</span><span class="n">n_clusters</span><span class="p">]</span>
</span><span id="L-694"><a href="#L-694"><span class="linenos"> 694</span></a>
</span><span id="L-695"><a href="#L-695"><span class="linenos"> 695</span></a>
</span><span id="L-696"><a href="#L-696"><span class="linenos"> 696</span></a><span class="nd">@njit</span><span class="p">(</span><span class="n">cache</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span>
</span><span id="L-697"><a href="#L-697"><span class="linenos"> 697</span></a><span class="k">def</span><span class="w"> </span><span class="nf">_detect_clusters_numba</span><span class="p">(</span>
</span><span id="L-698"><a href="#L-698"><span class="linenos"> 698</span></a> <span class="n">grid</span><span class="p">:</span> <span class="n">np</span><span class="o">.</span><span class="n">ndarray</span><span class="p">,</span>
</span><span id="L-699"><a href="#L-699"><span class="linenos"> 699</span></a> <span class="n">species</span><span class="p">:</span> <span class="nb">int</span><span class="p">,</span>
</span><span id="L-700"><a href="#L-700"><span class="linenos"> 700</span></a> <span class="n">moore</span><span class="p">:</span> <span class="nb">bool</span><span class="p">,</span>
</span><span id="L-701"><a href="#L-701"><span class="linenos"> 701</span></a><span class="p">)</span> <span class="o">-></span> <span class="n">Tuple</span><span class="p">[</span><span class="n">np</span><span class="o">.</span><span class="n">ndarray</span><span class="p">,</span> <span class="n">np</span><span class="o">.</span><span class="n">ndarray</span><span class="p">]:</span>
</span><span id="L-702"><a href="#L-702"><span class="linenos"> 702</span></a><span class="w"> </span><span class="sd">"""</span>
</span><span id="L-703"><a href="#L-703"><span class="linenos"> 703</span></a><span class="sd"> Full cluster detection returning labels and sizes (Numba-accelerated).</span>
</span><span id="L-704"><a href="#L-704"><span class="linenos"> 704</span></a>
</span><span id="L-705"><a href="#L-705"><span class="linenos"> 705</span></a><span class="sd"> Returns:</span>
</span><span id="L-706"><a href="#L-706"><span class="linenos"> 706</span></a><span class="sd"> labels: 2D int32 array where each cell contains its cluster ID (0 = non-target)</span>
</span><span id="L-707"><a href="#L-707"><span class="linenos"> 707</span></a><span class="sd"> sizes: 1D int32 array of cluster sizes (index i = size of cluster i+1)</span>
</span><span id="L-708"><a href="#L-708"><span class="linenos"> 708</span></a><span class="sd"> """</span>
</span><span id="L-709"><a href="#L-709"><span class="linenos"> 709</span></a> <span class="n">rows</span><span class="p">,</span> <span class="n">cols</span> <span class="o">=</span> <span class="n">grid</span><span class="o">.</span><span class="n">shape</span>
</span><span id="L-710"><a href="#L-710"><span class="linenos"> 710</span></a> <span class="n">labels</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">zeros</span><span class="p">((</span><span class="n">rows</span><span class="p">,</span> <span class="n">cols</span><span class="p">),</span> <span class="n">dtype</span><span class="o">=</span><span class="n">np</span><span class="o">.</span><span class="n">int32</span><span class="p">)</span>
</span><span id="L-711"><a href="#L-711"><span class="linenos"> 711</span></a>
</span><span id="L-712"><a href="#L-712"><span class="linenos"> 712</span></a> <span class="k">if</span> <span class="n">moore</span><span class="p">:</span>
</span><span id="L-713"><a href="#L-713"><span class="linenos"> 713</span></a> <span class="n">dr</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">array</span><span class="p">([</span><span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">1</span><span class="p">],</span> <span class="n">dtype</span><span class="o">=</span><span class="n">np</span><span class="o">.</span><span class="n">int32</span><span class="p">)</span>
</span><span id="L-714"><a href="#L-714"><span class="linenos"> 714</span></a> <span class="n">dc</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">array</span><span class="p">([</span><span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="mi">1</span><span class="p">],</span> <span class="n">dtype</span><span class="o">=</span><span class="n">np</span><span class="o">.</span><span class="n">int32</span><span class="p">)</span>
</span><span id="L-715"><a href="#L-715"><span class="linenos"> 715</span></a> <span class="n">n_neighbors</span> <span class="o">=</span> <span class="mi">8</span>
</span><span id="L-716"><a href="#L-716"><span class="linenos"> 716</span></a> <span class="k">else</span><span class="p">:</span>
</span><span id="L-717"><a href="#L-717"><span class="linenos"> 717</span></a> <span class="n">dr</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">array</span><span class="p">([</span><span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="mi">1</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="mi">0</span><span class="p">],</span> <span class="n">dtype</span><span class="o">=</span><span class="n">np</span><span class="o">.</span><span class="n">int32</span><span class="p">)</span>
</span><span id="L-718"><a href="#L-718"><span class="linenos"> 718</span></a> <span class="n">dc</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">array</span><span class="p">([</span><span class="mi">0</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="o">-</span><span class="mi">1</span><span class="p">,</span> <span class="mi">1</span><span class="p">],</span> <span class="n">dtype</span><span class="o">=</span><span class="n">np</span><span class="o">.</span><span class="n">int32</span><span class="p">)</span>
</span><span id="L-719"><a href="#L-719"><span class="linenos"> 719</span></a> <span class="n">n_neighbors</span> <span class="o">=</span> <span class="mi">4</span>
</span><span id="L-720"><a href="#L-720"><span class="linenos"> 720</span></a>
</span><span id="L-721"><a href="#L-721"><span class="linenos"> 721</span></a> <span class="n">max_clusters</span> <span class="o">=</span> <span class="n">rows</span> <span class="o">*</span> <span class="n">cols</span>
</span><span id="L-722"><a href="#L-722"><span class="linenos"> 722</span></a> <span class="n">sizes</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">empty</span><span class="p">(</span><span class="n">max_clusters</span><span class="p">,</span> <span class="n">dtype</span><span class="o">=</span><span class="n">np</span><span class="o">.</span><span class="n">int32</span><span class="p">)</span>
</span><span id="L-723"><a href="#L-723"><span class="linenos"> 723</span></a> <span class="n">n_clusters</span> <span class="o">=</span> <span class="mi">0</span>
</span><span id="L-724"><a href="#L-724"><span class="linenos"> 724</span></a> <span class="n">current_label</span> <span class="o">=</span> <span class="mi">1</span>
</span><span id="L-725"><a href="#L-725"><span class="linenos"> 725</span></a>
</span><span id="L-726"><a href="#L-726"><span class="linenos"> 726</span></a> <span class="n">max_stack</span> <span class="o">=</span> <span class="n">rows</span> <span class="o">*</span> <span class="n">cols</span>
</span><span id="L-727"><a href="#L-727"><span class="linenos"> 727</span></a> <span class="n">stack_r</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">empty</span><span class="p">(</span><span class="n">max_stack</span><span class="p">,</span> <span class="n">dtype</span><span class="o">=</span><span class="n">np</span><span class="o">.</span><span class="n">int32</span><span class="p">)</span>
</span><span id="L-728"><a href="#L-728"><span class="linenos"> 728</span></a> <span class="n">stack_c</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">empty</span><span class="p">(</span><span class="n">max_stack</span><span class="p">,</span> <span class="n">dtype</span><span class="o">=</span><span class="n">np</span><span class="o">.</span><span class="n">int32</span><span class="p">)</span>
</span><span id="L-729"><a href="#L-729"><span class="linenos"> 729</span></a>
</span><span id="L-730"><a href="#L-730"><span class="linenos"> 730</span></a> <span class="k">for</span> <span class="n">start_r</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">rows</span><span class="p">):</span>
</span><span id="L-731"><a href="#L-731"><span class="linenos"> 731</span></a> <span class="k">for</span> <span class="n">start_c</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">cols</span><span class="p">):</span>
</span><span id="L-732"><a href="#L-732"><span class="linenos"> 732</span></a> <span class="k">if</span> <span class="n">grid</span><span class="p">[</span><span class="n">start_r</span><span class="p">,</span> <span class="n">start_c</span><span class="p">]</span> <span class="o">!=</span> <span class="n">species</span> <span class="ow">or</span> <span class="n">labels</span><span class="p">[</span><span class="n">start_r</span><span class="p">,</span> <span class="n">start_c</span><span class="p">]</span> <span class="o">!=</span> <span class="mi">0</span><span class="p">:</span>
</span><span id="L-733"><a href="#L-733"><span class="linenos"> 733</span></a> <span class="k">continue</span>
</span><span id="L-734"><a href="#L-734"><span class="linenos"> 734</span></a>
</span><span id="L-735"><a href="#L-735"><span class="linenos"> 735</span></a> <span class="n">stack_ptr</span> <span class="o">=</span> <span class="mi">0</span>
</span><span id="L-736"><a href="#L-736"><span class="linenos"> 736</span></a> <span class="n">stack_r</span><span class="p">[</span><span class="n">stack_ptr</span><span class="p">]</span> <span class="o">=</span> <span class="n">start_r</span>
</span><span id="L-737"><a href="#L-737"><span class="linenos"> 737</span></a> <span class="n">stack_c</span><span class="p">[</span><span class="n">stack_ptr</span><span class="p">]</span> <span class="o">=</span> <span class="n">start_c</span>
</span><span id="L-738"><a href="#L-738"><span class="linenos"> 738</span></a> <span class="n">stack_ptr</span> <span class="o">+=</span> <span class="mi">1</span>
</span><span id="L-739"><a href="#L-739"><span class="linenos"> 739</span></a> <span class="n">labels</span><span class="p">[</span><span class="n">start_r</span><span class="p">,</span> <span class="n">start_c</span><span class="p">]</span> <span class="o">=</span> <span class="n">current_label</span>
</span><span id="L-740"><a href="#L-740"><span class="linenos"> 740</span></a> <span class="n">size</span> <span class="o">=</span> <span class="mi">0</span>
</span><span id="L-741"><a href="#L-741"><span class="linenos"> 741</span></a>
</span><span id="L-742"><a href="#L-742"><span class="linenos"> 742</span></a> <span class="k">while</span> <span class="n">stack_ptr</span> <span class="o">></span> <span class="mi">0</span><span class="p">:</span>
</span><span id="L-743"><a href="#L-743"><span class="linenos"> 743</span></a> <span class="n">stack_ptr</span> <span class="o">-=</span> <span class="mi">1</span>
</span><span id="L-744"><a href="#L-744"><span class="linenos"> 744</span></a> <span class="n">r</span> <span class="o">=</span> <span class="n">stack_r</span><span class="p">[</span><span class="n">stack_ptr</span><span class="p">]</span>
</span><span id="L-745"><a href="#L-745"><span class="linenos"> 745</span></a> <span class="n">c</span> <span class="o">=</span> <span class="n">stack_c</span><span class="p">[</span><span class="n">stack_ptr</span><span class="p">]</span>
</span><span id="L-746"><a href="#L-746"><span class="linenos"> 746</span></a> <span class="n">size</span> <span class="o">+=</span> <span class="mi">1</span>
</span><span id="L-747"><a href="#L-747"><span class="linenos"> 747</span></a>
</span><span id="L-748"><a href="#L-748"><span class="linenos"> 748</span></a> <span class="k">for</span> <span class="n">k</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">n_neighbors</span><span class="p">):</span>
</span><span id="L-749"><a href="#L-749"><span class="linenos"> 749</span></a> <span class="n">nr</span> <span class="o">=</span> <span class="p">(</span><span class="n">r</span> <span class="o">+</span> <span class="n">dr</span><span class="p">[</span><span class="n">k</span><span class="p">])</span> <span class="o">%</span> <span class="n">rows</span>
</span><span id="L-750"><a href="#L-750"><span class="linenos"> 750</span></a> <span class="n">nc</span> <span class="o">=</span> <span class="p">(</span><span class="n">c</span> <span class="o">+</span> <span class="n">dc</span><span class="p">[</span><span class="n">k</span><span class="p">])</span> <span class="o">%</span> <span class="n">cols</span>
</span><span id="L-751"><a href="#L-751"><span class="linenos"> 751</span></a>
</span><span id="L-752"><a href="#L-752"><span class="linenos"> 752</span></a> <span class="k">if</span> <span class="n">grid</span><span class="p">[</span><span class="n">nr</span><span class="p">,</span> <span class="n">nc</span><span class="p">]</span> <span class="o">==</span> <span class="n">species</span> <span class="ow">and</span> <span class="n">labels</span><span class="p">[</span><span class="n">nr</span><span class="p">,</span> <span class="n">nc</span><span class="p">]</span> <span class="o">==</span> <span class="mi">0</span><span class="p">:</span>
</span><span id="L-753"><a href="#L-753"><span class="linenos"> 753</span></a> <span class="n">labels</span><span class="p">[</span><span class="n">nr</span><span class="p">,</span> <span class="n">nc</span><span class="p">]</span> <span class="o">=</span> <span class="n">current_label</span>
</span><span id="L-754"><a href="#L-754"><span class="linenos"> 754</span></a> <span class="n">stack_r</span><span class="p">[</span><span class="n">stack_ptr</span><span class="p">]</span> <span class="o">=</span> <span class="n">nr</span>
</span><span id="L-755"><a href="#L-755"><span class="linenos"> 755</span></a> <span class="n">stack_c</span><span class="p">[</span><span class="n">stack_ptr</span><span class="p">]</span> <span class="o">=</span> <span class="n">nc</span>
</span><span id="L-756"><a href="#L-756"><span class="linenos"> 756</span></a> <span class="n">stack_ptr</span> <span class="o">+=</span> <span class="mi">1</span>
</span><span id="L-757"><a href="#L-757"><span class="linenos"> 757</span></a>
</span><span id="L-758"><a href="#L-758"><span class="linenos"> 758</span></a> <span class="n">sizes</span><span class="p">[</span><span class="n">n_clusters</span><span class="p">]</span> <span class="o">=</span> <span class="n">size</span>
</span><span id="L-759"><a href="#L-759"><span class="linenos"> 759</span></a> <span class="n">n_clusters</span> <span class="o">+=</span> <span class="mi">1</span>
</span><span id="L-760"><a href="#L-760"><span class="linenos"> 760</span></a> <span class="n">current_label</span> <span class="o">+=</span> <span class="mi">1</span>
</span><span id="L-761"><a href="#L-761"><span class="linenos"> 761</span></a>
</span><span id="L-762"><a href="#L-762"><span class="linenos"> 762</span></a> <span class="k">return</span> <span class="n">labels</span><span class="p">,</span> <span class="n">sizes</span><span class="p">[:</span><span class="n">n_clusters</span><span class="p">]</span>
</span><span id="L-763"><a href="#L-763"><span class="linenos"> 763</span></a>
</span><span id="L-764"><a href="#L-764"><span class="linenos"> 764</span></a>
</span><span id="L-765"><a href="#L-765"><span class="linenos"> 765</span></a><span class="c1"># ============================================================================</span>
</span><span id="L-766"><a href="#L-766"><span class="linenos"> 766</span></a><span class="c1"># PUBLIC API - CLUSTER DETECTION</span>
</span><span id="L-767"><a href="#L-767"><span class="linenos"> 767</span></a><span class="c1"># ============================================================================</span>
</span><span id="L-768"><a href="#L-768"><span class="linenos"> 768</span></a>
</span><span id="L-769"><a href="#L-769"><span class="linenos"> 769</span></a>
</span><span id="L-770"><a href="#L-770"><span class="linenos"> 770</span></a><span class="k">def</span><span class="w"> </span><span class="nf">measure_cluster_sizes_fast</span><span class="p">(</span>
</span><span id="L-771"><a href="#L-771"><span class="linenos"> 771</span></a> <span class="n">grid</span><span class="p">:</span> <span class="n">np</span><span class="o">.</span><span class="n">ndarray</span><span class="p">,</span>
</span><span id="L-772"><a href="#L-772"><span class="linenos"> 772</span></a> <span class="n">species</span><span class="p">:</span> <span class="nb">int</span><span class="p">,</span>
</span><span id="L-773"><a href="#L-773"><span class="linenos"> 773</span></a> <span class="n">neighborhood</span><span class="p">:</span> <span class="nb">str</span> <span class="o">=</span> <span class="s2">"moore"</span><span class="p">,</span>
</span><span id="L-774"><a href="#L-774"><span class="linenos"> 774</span></a><span class="p">)</span> <span class="o">-></span> <span class="n">np</span><span class="o">.</span><span class="n">ndarray</span><span class="p">:</span>
</span><span id="L-775"><a href="#L-775"><span class="linenos"> 775</span></a><span class="w"> </span><span class="sd">"""</span>
</span><span id="L-776"><a href="#L-776"><span class="linenos"> 776</span></a><span class="sd"> Measure cluster sizes for a specific species using Numba-accelerated flood fill.</span>
</span><span id="L-777"><a href="#L-777"><span class="linenos"> 777</span></a>
</span><span id="L-778"><a href="#L-778"><span class="linenos"> 778</span></a><span class="sd"> This function provides a high-performance interface for calculating cluster</span>
</span><span id="L-779"><a href="#L-779"><span class="linenos"> 779</span></a><span class="sd"> size statistics without the overhead of generating a full label map. It is</span>
</span><span id="L-780"><a href="#L-780"><span class="linenos"> 780</span></a><span class="sd"> optimized for large-scale simulation analysis where only distribution</span>
</span><span id="L-781"><a href="#L-781"><span class="linenos"> 781</span></a><span class="sd"> metrics (e.g., mean size, max size) are required.</span>
</span><span id="L-782"><a href="#L-782"><span class="linenos"> 782</span></a>
</span><span id="L-783"><a href="#L-783"><span class="linenos"> 783</span></a><span class="sd"> Parameters</span>
</span><span id="L-784"><a href="#L-784"><span class="linenos"> 784</span></a><span class="sd"> ----------</span>
</span><span id="L-785"><a href="#L-785"><span class="linenos"> 785</span></a><span class="sd"> grid : np.ndarray</span>
</span><span id="L-786"><a href="#L-786"><span class="linenos"> 786</span></a><span class="sd"> A 2D array representing the simulation environment.</span>
</span><span id="L-787"><a href="#L-787"><span class="linenos"> 787</span></a><span class="sd"> species : int</span>
</span><span id="L-788"><a href="#L-788"><span class="linenos"> 788</span></a><span class="sd"> The target species identifier (e.g., 1 for Prey, 2 for Predator).</span>
</span><span id="L-789"><a href="#L-789"><span class="linenos"> 789</span></a><span class="sd"> neighborhood : {'moore', 'neumann'}, optional</span>
</span><span id="L-790"><a href="#L-790"><span class="linenos"> 790</span></a><span class="sd"> The connectivity rule. 'moore' uses 8-way connectivity (including diagonals);</span>
</span><span id="L-791"><a href="#L-791"><span class="linenos"> 791</span></a><span class="sd"> 'neumann' uses 4-way connectivity. Default is 'moore'.</span>
</span><span id="L-792"><a href="#L-792"><span class="linenos"> 792</span></a>
</span><span id="L-793"><a href="#L-793"><span class="linenos"> 793</span></a><span class="sd"> Returns</span>
</span><span id="L-794"><a href="#L-794"><span class="linenos"> 794</span></a><span class="sd"> -------</span>
</span><span id="L-795"><a href="#L-795"><span class="linenos"> 795</span></a><span class="sd"> cluster_sizes : np.ndarray</span>
</span><span id="L-796"><a href="#L-796"><span class="linenos"> 796</span></a><span class="sd"> A 1D array of integers, where each element is the cell count of an</span>
</span><span id="L-797"><a href="#L-797"><span class="linenos"> 797</span></a><span class="sd"> identified cluster.</span>
</span><span id="L-798"><a href="#L-798"><span class="linenos"> 798</span></a>
</span><span id="L-799"><a href="#L-799"><span class="linenos"> 799</span></a><span class="sd"> Notes</span>
</span><span id="L-800"><a href="#L-800"><span class="linenos"> 800</span></a><span class="sd"> -----</span>
</span><span id="L-801"><a href="#L-801"><span class="linenos"> 801</span></a><span class="sd"> The input grid is cast to `int32` to ensure compatibility with the</span>
</span><span id="L-802"><a href="#L-802"><span class="linenos"> 802</span></a><span class="sd"> underlying JIT-compiled `_measure_clusters` kernel.</span>
</span><span id="L-803"><a href="#L-803"><span class="linenos"> 803</span></a>
</span><span id="L-804"><a href="#L-804"><span class="linenos"> 804</span></a><span class="sd"> Examples</span>
</span><span id="L-805"><a href="#L-805"><span class="linenos"> 805</span></a><span class="sd"> --------</span>
</span><span id="L-806"><a href="#L-806"><span class="linenos"> 806</span></a><span class="sd"> >>> sizes = measure_cluster_sizes_fast(grid, species=1, neighborhood='moore')</span>
</span><span id="L-807"><a href="#L-807"><span class="linenos"> 807</span></a><span class="sd"> >>> if sizes.size > 0:</span>
</span><span id="L-808"><a href="#L-808"><span class="linenos"> 808</span></a><span class="sd"> ... print(f"Largest cluster: {sizes.max()}")</span>
</span><span id="L-809"><a href="#L-809"><span class="linenos"> 809</span></a><span class="sd"> """</span>
</span><span id="L-810"><a href="#L-810"><span class="linenos"> 810</span></a> <span class="n">grid_int</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">asarray</span><span class="p">(</span><span class="n">grid</span><span class="p">,</span> <span class="n">dtype</span><span class="o">=</span><span class="n">np</span><span class="o">.</span><span class="n">int32</span><span class="p">)</span>
</span><span id="L-811"><a href="#L-811"><span class="linenos"> 811</span></a> <span class="n">moore</span> <span class="o">=</span> <span class="n">neighborhood</span> <span class="o">==</span> <span class="s2">"moore"</span>
</span><span id="L-812"><a href="#L-812"><span class="linenos"> 812</span></a> <span class="k">return</span> <span class="n">_measure_clusters</span><span class="p">(</span><span class="n">grid_int</span><span class="p">,</span> <span class="n">np</span><span class="o">.</span><span class="n">int32</span><span class="p">(</span><span class="n">species</span><span class="p">),</span> <span class="n">moore</span><span class="p">)</span>
</span><span id="L-813"><a href="#L-813"><span class="linenos"> 813</span></a>
</span><span id="L-814"><a href="#L-814"><span class="linenos"> 814</span></a>
</span><span id="L-815"><a href="#L-815"><span class="linenos"> 815</span></a><span class="k">def</span><span class="w"> </span><span class="nf">detect_clusters_fast</span><span class="p">(</span>
</span><span id="L-816"><a href="#L-816"><span class="linenos"> 816</span></a> <span class="n">grid</span><span class="p">:</span> <span class="n">np</span><span class="o">.</span><span class="n">ndarray</span><span class="p">,</span>
</span><span id="L-817"><a href="#L-817"><span class="linenos"> 817</span></a> <span class="n">species</span><span class="p">:</span> <span class="nb">int</span><span class="p">,</span>
</span><span id="L-818"><a href="#L-818"><span class="linenos"> 818</span></a> <span class="n">neighborhood</span><span class="p">:</span> <span class="nb">str</span> <span class="o">=</span> <span class="s2">"moore"</span><span class="p">,</span>
</span><span id="L-819"><a href="#L-819"><span class="linenos"> 819</span></a><span class="p">)</span> <span class="o">-></span> <span class="n">Tuple</span><span class="p">[</span><span class="n">np</span><span class="o">.</span><span class="n">ndarray</span><span class="p">,</span> <span class="n">Dict</span><span class="p">[</span><span class="nb">int</span><span class="p">,</span> <span class="nb">int</span><span class="p">]]:</span>
</span><span id="L-820"><a href="#L-820"><span class="linenos"> 820</span></a><span class="w"> </span><span class="sd">"""</span>
</span><span id="L-821"><a href="#L-821"><span class="linenos"> 821</span></a><span class="sd"> Perform full cluster detection with labels using Numba acceleration.</span>
</span><span id="L-822"><a href="#L-822"><span class="linenos"> 822</span></a>
</span><span id="L-823"><a href="#L-823"><span class="linenos"> 823</span></a><span class="sd"> This function returns a label array for spatial analysis and a dictionary</span>
</span><span id="L-824"><a href="#L-824"><span class="linenos"> 824</span></a><span class="sd"> of cluster sizes. It is significantly faster than standard Python or</span>
</span><span id="L-825"><a href="#L-825"><span class="linenos"> 825</span></a><span class="sd"> SciPy equivalents for large simulation grids.</span>
</span><span id="L-826"><a href="#L-826"><span class="linenos"> 826</span></a>
</span><span id="L-827"><a href="#L-827"><span class="linenos"> 827</span></a><span class="sd"> Parameters</span>
</span><span id="L-828"><a href="#L-828"><span class="linenos"> 828</span></a><span class="sd"> ----------</span>
</span><span id="L-829"><a href="#L-829"><span class="linenos"> 829</span></a><span class="sd"> grid : np.ndarray</span>
</span><span id="L-830"><a href="#L-830"><span class="linenos"> 830</span></a><span class="sd"> A 2D array representing the simulation environment.</span>
</span><span id="L-831"><a href="#L-831"><span class="linenos"> 831</span></a><span class="sd"> species : int</span>
</span><span id="L-832"><a href="#L-832"><span class="linenos"> 832</span></a><span class="sd"> The target species identifier (e.g., 1 for Prey, 2 for Predator).</span>
</span><span id="L-833"><a href="#L-833"><span class="linenos"> 833</span></a><span class="sd"> neighborhood : {'moore', 'neumann'}, optional</span>
</span><span id="L-834"><a href="#L-834"><span class="linenos"> 834</span></a><span class="sd"> The connectivity rule. 'moore' uses 8-way connectivity; 'neumann'</span>
</span><span id="L-835"><a href="#L-835"><span class="linenos"> 835</span></a><span class="sd"> uses 4-way connectivity. Default is 'moore'.</span>
</span><span id="L-836"><a href="#L-836"><span class="linenos"> 836</span></a>
</span><span id="L-837"><a href="#L-837"><span class="linenos"> 837</span></a><span class="sd"> Returns</span>
</span><span id="L-838"><a href="#L-838"><span class="linenos"> 838</span></a><span class="sd"> -------</span>
</span><span id="L-839"><a href="#L-839"><span class="linenos"> 839</span></a><span class="sd"> labels : np.ndarray</span>
</span><span id="L-840"><a href="#L-840"><span class="linenos"> 840</span></a><span class="sd"> A 2D int32 array where each cell contains its unique cluster ID.</span>
</span><span id="L-841"><a href="#L-841"><span class="linenos"> 841</span></a><span class="sd"> Cells not belonging to the target species are 0.</span>
</span><span id="L-842"><a href="#L-842"><span class="linenos"> 842</span></a><span class="sd"> sizes : dict</span>
</span><span id="L-843"><a href="#L-843"><span class="linenos"> 843</span></a><span class="sd"> A dictionary mapping cluster IDs to their respective cell counts.</span>
</span><span id="L-844"><a href="#L-844"><span class="linenos"> 844</span></a>
</span><span id="L-845"><a href="#L-845"><span class="linenos"> 845</span></a><span class="sd"> Notes</span>
</span><span id="L-846"><a href="#L-846"><span class="linenos"> 846</span></a><span class="sd"> -----</span>
</span><span id="L-847"><a href="#L-847"><span class="linenos"> 847</span></a><span class="sd"> The underlying Numba kernel uses a stack-based flood fill to avoid</span>
</span><span id="L-848"><a href="#L-848"><span class="linenos"> 848</span></a><span class="sd"> recursion limits and handles periodic boundary conditions.</span>
</span><span id="L-849"><a href="#L-849"><span class="linenos"> 849</span></a>
</span><span id="L-850"><a href="#L-850"><span class="linenos"> 850</span></a><span class="sd"> Examples</span>