package nx
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
N-dimensional arrays for OCaml
Install
dune-project
Dependency
Authors
Maintainers
Sources
raven-1.0.0.alpha3.tbz
sha256=96d35ce03dfbebd2313657273e24c2e2d20f9e6c7825b8518b69bd1d6ed5870f
sha512=90c5053731d4108f37c19430e45456063e872b04b8a1bbad064c356e1b18e69222de8bfcf4ec14757e71f18164ec6e4630ba770dbcb1291665de5418827d1465
doc/src/nx.effect/nx_effect.ml.html
Source file nx_effect.ml
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(*--------------------------------------------------------------------------- Copyright (c) 2026 The Raven authors. All rights reserved. SPDX-License-Identifier: ISC ---------------------------------------------------------------------------*) open Nx_core (* Types *) type context = Nx_backend.context (* OCaml extensible GADT constructors (the [E_add], [E_mul], ... below) require that type variables in the payload be deducible from the return type. With a transparent alias [type ('a,'b) t = ('a,'b) Nx_backend.t], the compiler sees through to the concrete record and concludes that ['a] and ['b] are not injective — so every effect definition fails with "type variable cannot be deduced". Wrapping in a single-constructor GADT restores injectivity: [T] is a fresh constructor whose parameters are, by definition, determined by the return type. At runtime this is a zero-cost box (single-field constructor). *) type ('a, 'b) t = T : ('a, 'b) Nx_backend.t -> ('a, 'b) t (* Effects *) type _ Effect.t += | E_view : ('a, 'b) t -> View.t Effect.t | E_buffer : { context : context; dtype : ('a, 'b) Dtype.t; size_in_elements : int; } -> ('a, 'b) t Effect.t | E_const_scalar : { context : context; value : 'a; dtype : ('a, 'b) Dtype.t; } -> ('a, 'b) t Effect.t | E_from_host : { context : context; array : ('a, 'b) Nx_buffer.t; } -> ('a, 'b) t Effect.t | E_add : { out : ('a, 'b) t; a : ('a, 'b) t; b : ('a, 'b) t; } -> unit Effect.t | E_sub : { out : ('a, 'b) t; a : ('a, 'b) t; b : ('a, 'b) t; } -> unit Effect.t | E_mul : { out : ('a, 'b) t; a : ('a, 'b) t; b : ('a, 'b) t; } -> unit Effect.t | E_idiv : { out : ('a, 'b) t; a : ('a, 'b) t; b : ('a, 'b) t; } -> unit Effect.t | E_fdiv : { out : ('a, 'b) t; a : ('a, 'b) t; b : ('a, 'b) t; } -> unit Effect.t | E_max : { out : ('a, 'b) t; a : ('a, 'b) t; b : ('a, 'b) t; } -> unit Effect.t | E_min : { out : ('a, 'b) t; a : ('a, 'b) t; b : ('a, 'b) t; } -> unit Effect.t | E_mod : { out : ('a, 'b) t; a : ('a, 'b) t; b : ('a, 'b) t; } -> unit Effect.t | E_pow : { out : ('a, 'b) t; a : ('a, 'b) t; b : ('a, 'b) t; } -> unit Effect.t | E_xor : { out : ('a, 'b) t; a : ('a, 'b) t; b : ('a, 'b) t; } -> unit Effect.t | E_or : { out : ('a, 'b) t; a : ('a, 'b) t; b : ('a, 'b) t } -> unit Effect.t | E_and : { out : ('a, 'b) t; a : ('a, 'b) t; b : ('a, 'b) t; } -> unit Effect.t | E_atan2 : { out : ('a, 'b) t; a : ('a, 'b) t; b : ('a, 'b) t; } -> unit Effect.t | E_cmpeq : { out : (bool, Dtype.bool_elt) t; a : ('a, 'b) t; b : ('a, 'b) t; } -> unit Effect.t | E_cmpne : { out : (bool, Dtype.bool_elt) t; a : ('a, 'b) t; b : ('a, 'b) t; } -> unit Effect.t | E_cmplt : { out : (bool, Dtype.bool_elt) t; a : ('a, 'b) t; b : ('a, 'b) t; } -> unit Effect.t | E_cmple : { out : (bool, Dtype.bool_elt) t; a : ('a, 'b) t; b : ('a, 'b) t; } -> unit Effect.t | E_neg : { out : ('a, 'b) t; t_in : ('a, 'b) t } -> unit Effect.t | E_sin : { out : ('a, 'b) t; t_in : ('a, 'b) t } -> unit Effect.t | E_sqrt : { out : ('a, 'b) t; t_in : ('a, 'b) t } -> unit Effect.t | E_recip : { out : ('a, 'b) t; t_in : ('a, 'b) t } -> unit Effect.t | E_log : { out : ('a, 'b) t; t_in : ('a, 'b) t } -> unit Effect.t | E_exp : { out : ('a, 'b) t; t_in : ('a, 'b) t } -> unit Effect.t | E_cos : { out : ('a, 'b) t; t_in : ('a, 'b) t } -> unit Effect.t | E_abs : { out : ('a, 'b) t; t_in : ('a, 'b) t } -> unit Effect.t | E_sign : { out : ('a, 'b) t; t_in : ('a, 'b) t } -> unit Effect.t | E_tan : { out : ('a, 'b) t; t_in : ('a, 'b) t } -> unit Effect.t | E_asin : { out : ('a, 'b) t; t_in : ('a, 'b) t } -> unit Effect.t | E_acos : { out : ('a, 'b) t; t_in : ('a, 'b) t } -> unit Effect.t | E_atan : { out : ('a, 'b) t; t_in : ('a, 'b) t } -> unit Effect.t | E_sinh : { out : ('a, 'b) t; t_in : ('a, 'b) t } -> unit Effect.t | E_cosh : { out : ('a, 'b) t; t_in : ('a, 'b) t } -> unit Effect.t | E_tanh : { out : ('a, 'b) t; t_in : ('a, 'b) t } -> unit Effect.t | E_trunc : { out : ('a, 'b) t; t_in : ('a, 'b) t } -> unit Effect.t | E_ceil : { out : ('a, 'b) t; t_in : ('a, 'b) t } -> unit Effect.t | E_floor : { out : ('a, 'b) t; t_in : ('a, 'b) t } -> unit Effect.t | E_round : { out : ('a, 'b) t; t_in : ('a, 'b) t } -> unit Effect.t | E_erf : { out : ('a, 'b) t; t_in : ('a, 'b) t } -> unit Effect.t | E_where : { out : ('a, 'b) t; condition : (bool, Dtype.bool_elt) t; if_true : ('a, 'b) t; if_false : ('a, 'b) t; } -> unit Effect.t | E_reduce_sum : { out : ('a, 'b) t; t_in : ('a, 'b) t; axes : int array; keepdims : bool; } -> unit Effect.t | E_reduce_max : { out : ('a, 'b) t; t_in : ('a, 'b) t; axes : int array; keepdims : bool; } -> unit Effect.t | E_reduce_min : { out : ('a, 'b) t; t_in : ('a, 'b) t; axes : int array; keepdims : bool; } -> unit Effect.t | E_reduce_prod : { out : ('a, 'b) t; t_in : ('a, 'b) t; axes : int array; keepdims : bool; } -> unit Effect.t | E_argmax : { out : (int32, Dtype.int32_elt) t; t_in : ('a, 'b) t; axis : int; keepdims : bool; } -> unit Effect.t | E_argmin : { out : (int32, Dtype.int32_elt) t; t_in : ('a, 'b) t; axis : int; keepdims : bool; } -> unit Effect.t | E_sort : { out : ('a, 'b) t; t_in : ('a, 'b) t; axis : int; descending : bool; } -> unit Effect.t | E_argsort : { out : (int32, Dtype.int32_elt) t; t_in : ('a, 'b) t; axis : int; descending : bool; } -> unit Effect.t | E_associative_scan : { t_in : ('a, 'b) t; axis : int; op : [ `Sum | `Prod | `Max | `Min ]; } -> ('a, 'b) t Effect.t | E_permute : { t_in : ('a, 'b) t; axes : int array } -> ('a, 'b) t Effect.t | E_reshape : { t_in : ('a, 'b) t; new_shape : int array; } -> ('a, 'b) t Effect.t | E_expand : { t_in : ('a, 'b) t; new_target_shape : int array; } -> ('a, 'b) t Effect.t | E_pad : { t_in : ('a, 'b) t; padding_config : (int * int) array; fill_value : 'a; } -> ('a, 'b) t Effect.t | E_shrink : { t_in : ('a, 'b) t; limits : (int * int) array; } -> ('a, 'b) t Effect.t | E_flip : { t_in : ('a, 'b) t; dims_to_flip : bool array; } -> ('a, 'b) t Effect.t | E_cat : { t_list : ('a, 'b) t list; axis : int } -> ('a, 'b) t Effect.t | E_cast : { t_in : ('a, 'b) t; target_dtype : ('c, 'd) Dtype.t; } -> ('c, 'd) t Effect.t | E_contiguous : { t_in : ('a, 'b) t } -> ('a, 'b) t Effect.t | E_copy : { t_in : ('a, 'b) t } -> ('a, 'b) t Effect.t | E_assign : { dst : ('a, 'b) t; src : ('a, 'b) t } -> unit Effect.t | E_threefry : { key : (int32, Dtype.int32_elt) t; ctr : (int32, Dtype.int32_elt) t; } -> (int32, Dtype.int32_elt) t Effect.t | E_gather : { data : ('a, 'b) t; indices : (int32, Dtype.int32_elt) t; axis : int; } -> ('a, 'b) t Effect.t | E_scatter : { data_template : ('a, 'b) t; indices : (int32, Dtype.int32_elt) t; updates : ('a, 'b) t; axis : int; } -> ('a, 'b) t Effect.t | E_to_device : { context : context; t_in : ('a, 'b) t; } -> ('a, 'b) t Effect.t | E_unfold : { t_in : ('a, 'b) t; kernel_size : int array; stride : int array; dilation : int array; padding : (int * int) array; } -> ('a, 'b) t Effect.t | E_fold : { t_in : ('a, 'b) t; output_size : int array; kernel_size : int array; stride : int array; dilation : int array; padding : (int * int) array; } -> ('a, 'b) t Effect.t | E_matmul : { out : ('a, 'b) t; a : ('a, 'b) t; b : ('a, 'b) t; } -> unit Effect.t | E_fft : { t : (Complex.t, 'b) t; axes : int array; } -> (Complex.t, 'b) t Effect.t | E_ifft : { t : (Complex.t, 'b) t; axes : int array; } -> (Complex.t, 'b) t Effect.t | E_rfft : { t : (float, 'b) t; axes : int array; } -> (Complex.t, Dtype.complex64_elt) t Effect.t | E_irfft : { t : (Complex.t, 'b) t; axes : int array; s : int array option; } -> (float, Dtype.float64_elt) t Effect.t | E_psum : { t_in : ('a, 'b) t } -> ('a, 'b) t Effect.t | E_cholesky : { t_in : ('a, 'b) t; upper : bool } -> ('a, 'b) t Effect.t | E_qr : { t_in : ('a, 'b) t; reduced : bool; } -> (('a, 'b) t * ('a, 'b) t) Effect.t | E_svd : { t_in : ('a, 'b) t; full_matrices : bool; } -> (('a, 'b) t * (float, Dtype.float64_elt) t * ('a, 'b) t) Effect.t | E_eig : { t_in : ('a, 'b) t; vectors : bool; } -> ((Complex.t, Dtype.complex64_elt) t * (Complex.t, Dtype.complex64_elt) t option) Effect.t | E_eigh : { t_in : ('a, 'b) t; vectors : bool; } -> ((float, Dtype.float64_elt) t * ('a, 'b) t option) Effect.t | E_triangular_solve : { a : ('a, 'b) t; b : ('a, 'b) t; upper : bool; transpose : bool; unit_diag : bool; } -> ('a, 'b) t Effect.t (* Unwrap *) let unwrap (T t) = t (* Lenses *) let create_context () : context = Nx_backend.create_context () let context (type a b) (T t : (a, b) t) = Nx_backend.context t let to_device (_ctx : context) (t : ('a, 'b) t) : ('a, 'b) t = t let view (type a b) (x : (a, b) t) : View.t = try Effect.perform (E_view x) with Effect.Unhandled _ -> Nx_backend.view (unwrap x) let dtype (type a b) (T t : (a, b) t) = Nx_backend.dtype t let to_host (type a b) (T t : (a, b) t) = Nx_backend.to_host t (* Fallback dispatch helpers. Each helper performs an effect. When no handler is installed, it falls back to the C backend. The pattern is uniform: try the effect, on [Unhandled] unwrap the [T] and call [Nx_backend]. *) let binary_op ~out eff cpu_op a b = try Effect.perform (eff ()) with Effect.Unhandled _ -> cpu_op ~out:(unwrap out) (unwrap a) (unwrap b) let unary_op ~out eff cpu_op t_in = try Effect.perform (eff ()) with Effect.Unhandled _ -> cpu_op ~out:(unwrap out) (unwrap t_in) let reduce_op ~out eff cpu_op ~axes ~keepdims t_in = try Effect.perform (eff ()) with Effect.Unhandled _ -> cpu_op ~out:(unwrap out) ~axes ~keepdims (unwrap t_in) let movement_op eff cpu_op t_in arg = try Effect.perform (eff ()) with Effect.Unhandled _ -> T (cpu_op (unwrap t_in) arg) let assign dst src = try Effect.perform (E_assign { dst; src }) with Effect.Unhandled _ -> Nx_backend.assign (unwrap dst) (unwrap src) (* Binary operations *) let add ~out a b = binary_op ~out (fun () -> E_add { out; a; b }) Nx_backend.add a b let sub ~out a b = binary_op ~out (fun () -> E_sub { out; a; b }) Nx_backend.sub a b let mul ~out a b = binary_op ~out (fun () -> E_mul { out; a; b }) Nx_backend.mul a b let max ~out a b = binary_op ~out (fun () -> E_max { out; a; b }) Nx_backend.max a b let min ~out a b = binary_op ~out (fun () -> E_min { out; a; b }) Nx_backend.min a b let mod_ ~out a b = binary_op ~out (fun () -> E_mod { out; a; b }) Nx_backend.mod_ a b let pow ~out a b = binary_op ~out (fun () -> E_pow { out; a; b }) Nx_backend.pow a b let xor ~out a b = binary_op ~out (fun () -> E_xor { out; a; b }) Nx_backend.xor a b let or_ ~out a b = binary_op ~out (fun () -> E_or { out; a; b }) Nx_backend.or_ a b let and_ ~out a b = binary_op ~out (fun () -> E_and { out; a; b }) Nx_backend.and_ a b let atan2 ~out a b = binary_op ~out (fun () -> E_atan2 { out; a; b }) Nx_backend.atan2 a b let div ~out a b = let dt = dtype out in if Dtype.is_int dt || Dtype.is_uint dt then binary_op ~out (fun () -> E_idiv { out; a; b }) Nx_backend.div a b else binary_op ~out (fun () -> E_fdiv { out; a; b }) Nx_backend.div a b (* Comparison operations *) let cmpeq ~out a b = binary_op ~out (fun () -> E_cmpeq { out; a; b }) Nx_backend.cmpeq a b let cmpne ~out a b = binary_op ~out (fun () -> E_cmpne { out; a; b }) Nx_backend.cmpne a b let cmplt ~out a b = binary_op ~out (fun () -> E_cmplt { out; a; b }) Nx_backend.cmplt a b let cmple ~out a b = binary_op ~out (fun () -> E_cmple { out; a; b }) Nx_backend.cmple a b (* Unary operations *) let neg ~out t = unary_op ~out (fun () -> E_neg { out; t_in = t }) Nx_backend.neg t let sin ~out t = unary_op ~out (fun () -> E_sin { out; t_in = t }) Nx_backend.sin t let sqrt ~out t = unary_op ~out (fun () -> E_sqrt { out; t_in = t }) Nx_backend.sqrt t let recip ~out t = unary_op ~out (fun () -> E_recip { out; t_in = t }) Nx_backend.recip t let log ~out t = unary_op ~out (fun () -> E_log { out; t_in = t }) Nx_backend.log t let exp ~out t = unary_op ~out (fun () -> E_exp { out; t_in = t }) Nx_backend.exp t let cos ~out t = unary_op ~out (fun () -> E_cos { out; t_in = t }) Nx_backend.cos t let abs ~out t = unary_op ~out (fun () -> E_abs { out; t_in = t }) Nx_backend.abs t let sign ~out t = unary_op ~out (fun () -> E_sign { out; t_in = t }) Nx_backend.sign t let tan ~out t = unary_op ~out (fun () -> E_tan { out; t_in = t }) Nx_backend.tan t let asin ~out t = unary_op ~out (fun () -> E_asin { out; t_in = t }) Nx_backend.asin t let acos ~out t = unary_op ~out (fun () -> E_acos { out; t_in = t }) Nx_backend.acos t let atan ~out t = unary_op ~out (fun () -> E_atan { out; t_in = t }) Nx_backend.atan t let sinh ~out t = unary_op ~out (fun () -> E_sinh { out; t_in = t }) Nx_backend.sinh t let cosh ~out t = unary_op ~out (fun () -> E_cosh { out; t_in = t }) Nx_backend.cosh t let tanh ~out t = unary_op ~out (fun () -> E_tanh { out; t_in = t }) Nx_backend.tanh t let trunc ~out t = unary_op ~out (fun () -> E_trunc { out; t_in = t }) Nx_backend.trunc t let ceil ~out t = unary_op ~out (fun () -> E_ceil { out; t_in = t }) Nx_backend.ceil t let floor ~out t = unary_op ~out (fun () -> E_floor { out; t_in = t }) Nx_backend.floor t let round ~out t = unary_op ~out (fun () -> E_round { out; t_in = t }) Nx_backend.round t let erf ~out t = unary_op ~out (fun () -> E_erf { out; t_in = t }) Nx_backend.erf t let op_psum t_in = try Effect.perform (E_psum { t_in }) with Effect.Unhandled _ -> failwith "psum must be used under vmap" (* Reduction operations *) let reduce_sum ~out ~axes ~keepdims t_in = reduce_op ~out (fun () -> E_reduce_sum { out; t_in; axes; keepdims }) Nx_backend.reduce_sum ~axes ~keepdims t_in let reduce_max ~out ~axes ~keepdims t_in = reduce_op ~out (fun () -> E_reduce_max { out; t_in; axes; keepdims }) Nx_backend.reduce_max ~axes ~keepdims t_in let reduce_min ~out ~axes ~keepdims t_in = reduce_op ~out (fun () -> E_reduce_min { out; t_in; axes; keepdims }) Nx_backend.reduce_min ~axes ~keepdims t_in let reduce_prod ~out ~axes ~keepdims t_in = reduce_op ~out (fun () -> E_reduce_prod { out; t_in; axes; keepdims }) Nx_backend.reduce_prod ~axes ~keepdims t_in let argmax ~out ~axis ~keepdims t_in = try Effect.perform (E_argmax { out; t_in; axis; keepdims }) with Effect.Unhandled _ -> Nx_backend.argmax ~out:(unwrap out) ~axis ~keepdims (unwrap t_in) let argmin ~out ~axis ~keepdims t_in = try Effect.perform (E_argmin { out; t_in; axis; keepdims }) with Effect.Unhandled _ -> Nx_backend.argmin ~out:(unwrap out) ~axis ~keepdims (unwrap t_in) let associative_scan ~out ~axis ~op t_in = try let result = Effect.perform (E_associative_scan { t_in; axis; op }) in assign out result with Effect.Unhandled _ -> Nx_backend.associative_scan ~out:(unwrap out) ~axis ~op (unwrap t_in) let sort ~out ~axis ~descending t_in = try Effect.perform (E_sort { out; t_in; axis; descending }) with Effect.Unhandled _ -> Nx_backend.sort ~out:(unwrap out) ~axis ~descending (unwrap t_in) let argsort ~out ~axis ~descending t_in = try Effect.perform (E_argsort { out; t_in; axis; descending }) with Effect.Unhandled _ -> Nx_backend.argsort ~out:(unwrap out) ~axis ~descending (unwrap t_in) (* Movement operations *) let reshape t_in new_shape = movement_op (fun () -> E_reshape { t_in; new_shape }) Nx_backend.reshape t_in new_shape let expand t_in new_target_shape = movement_op (fun () -> E_expand { t_in; new_target_shape }) Nx_backend.expand t_in new_target_shape let permute t_in axes = movement_op (fun () -> E_permute { t_in; axes }) Nx_backend.permute t_in axes let shrink t_in limits = movement_op (fun () -> E_shrink { t_in; limits }) Nx_backend.shrink t_in limits let flip t_in dims_to_flip = movement_op (fun () -> E_flip { t_in; dims_to_flip }) Nx_backend.flip t_in dims_to_flip let pad t_in padding_config fill_value = try Effect.perform (E_pad { t_in; padding_config; fill_value }) with Effect.Unhandled _ -> T (Nx_backend.pad (unwrap t_in) padding_config fill_value) (* Creation operations *) let buffer ctx dtype shape_arr = let size_in_elements = Array.fold_left ( * ) 1 shape_arr in let flat = try Effect.perform (E_buffer { context = ctx; dtype; size_in_elements }) with Effect.Unhandled _ -> T (Nx_backend.buffer ctx dtype shape_arr) in reshape flat shape_arr let const_scalar ctx value dtype = try Effect.perform (E_const_scalar { context = ctx; value; dtype }) with Effect.Unhandled _ -> T (Nx_backend.full ctx dtype [||] value) let full ctx dtype shape_arr value = T (Nx_backend.full ctx dtype shape_arr value) let from_host ctx array = try Effect.perform (E_from_host { context = ctx; array }) with Effect.Unhandled _ -> T (Nx_backend.from_host ctx array) (* Copy operations *) let contiguous t_in = try Effect.perform (E_contiguous { t_in }) with Effect.Unhandled _ -> T (Nx_backend.contiguous (unwrap t_in)) let copy t_in = try Effect.perform (E_copy { t_in }) with Effect.Unhandled _ -> T (Nx_backend.copy (unwrap t_in)) (* Ternary operations *) let where ~out condition if_true if_false = try Effect.perform (E_where { out; condition; if_true; if_false }) with Effect.Unhandled _ -> Nx_backend.where ~out:(unwrap out) (unwrap condition) (unwrap if_true) (unwrap if_false) (* Cat *) let cat ~out t_list ~axis = try let result = Effect.perform (E_cat { t_list; axis }) in assign out result with Effect.Unhandled _ -> Nx_backend.cat ~out:(unwrap out) (List.map unwrap t_list) ~axis (* Cast *) let cast : type a b c d. out:(c, d) t -> (a, b) t -> unit = fun ~out t_in -> let target_dtype = dtype out in try let result = Effect.perform (E_cast { t_in; target_dtype }) in assign out result with Effect.Unhandled _ -> Nx_backend.cast ~out:(unwrap out) (unwrap t_in) (* Indexed access *) let gather ~out data indices ~axis = try let result = Effect.perform (E_gather { data; indices; axis }) in assign out result with Effect.Unhandled _ -> Nx_backend.gather ~out:(unwrap out) (unwrap data) (unwrap indices) ~axis let scatter ?(mode = `Set) ?(unique_indices = false) data_template ~indices ~updates ~axis = try Effect.perform (E_scatter { data_template; indices; updates; axis }) with Effect.Unhandled _ -> T (Nx_backend.scatter ~mode ~unique_indices (unwrap data_template) ~indices:(unwrap indices) ~updates:(unwrap updates) ~axis) (* Random *) let threefry ~out key ctr = try let result = Effect.perform (E_threefry { key; ctr }) in assign out result with Effect.Unhandled _ -> Nx_backend.threefry ~out:(unwrap out) (unwrap key) (unwrap ctr) (* Window operations *) let unfold t_in ~kernel_size ~stride ~dilation ~padding = try Effect.perform (E_unfold { t_in; kernel_size; stride; dilation; padding }) with Effect.Unhandled _ -> T (Nx_backend.unfold (unwrap t_in) ~kernel_size ~stride ~dilation ~padding) let fold t_in ~output_size ~kernel_size ~stride ~dilation ~padding = try Effect.perform (E_fold { t_in; output_size; kernel_size; stride; dilation; padding }) with Effect.Unhandled _ -> T (Nx_backend.fold (unwrap t_in) ~output_size ~kernel_size ~stride ~dilation ~padding) (* Matrix operations *) let matmul ~out a b = try Effect.perform (E_matmul { out; a; b }) with Effect.Unhandled _ -> Nx_backend.matmul ~out:(unwrap out) (unwrap a) (unwrap b) (* FFT operations *) let fft ?out t ~axes = try Effect.perform (E_fft { t; axes }) with Effect.Unhandled _ -> T (Nx_backend.fft ?out:(Option.map unwrap out) (unwrap t) ~axes) let ifft ?out t ~axes = try Effect.perform (E_ifft { t; axes }) with Effect.Unhandled _ -> T (Nx_backend.ifft ?out:(Option.map unwrap out) (unwrap t) ~axes) let rfft (type a c) ?out (t : (float, a) t) ~(dtype : (Complex.t, c) Dtype.t) ~axes : (Complex.t, c) t = let result = Nx_backend.rfft ?out:(Option.map unwrap out) (unwrap t) ~dtype ~axes in (T result : (Complex.t, c) t) let irfft (type a c) ?out ?s (t : (Complex.t, a) t) ~(dtype : (float, c) Dtype.t) ~axes : (float, c) t = let result = Nx_backend.irfft ?out:(Option.map unwrap out) ?s (unwrap t) ~dtype ~axes in (T result : (float, c) t) (* Linear algebra *) let cholesky ~upper t_in = try Effect.perform (E_cholesky { t_in; upper }) with Effect.Unhandled _ -> T (Nx_backend.cholesky ~upper (unwrap t_in)) let qr ~reduced t_in = try Effect.perform (E_qr { t_in; reduced }) with Effect.Unhandled _ -> let q, r = Nx_backend.qr ~reduced (unwrap t_in) in (T q, T r) let svd ~full_matrices t_in = try Effect.perform (E_svd { t_in; full_matrices }) with Effect.Unhandled _ -> let u, s, vt = Nx_backend.svd ~full_matrices (unwrap t_in) in (T u, T s, T vt) let eig ~vectors t_in = try Effect.perform (E_eig { t_in; vectors }) with Effect.Unhandled _ -> let vals, vecs_opt = Nx_backend.eig ~vectors (unwrap t_in) in (T vals, Option.map (fun v -> T v) vecs_opt) let eigh ~vectors t_in = try Effect.perform (E_eigh { t_in; vectors }) with Effect.Unhandled _ -> let vals, vecs_opt = Nx_backend.eigh ~vectors (unwrap t_in) in (T vals, Option.map (fun v -> T v) vecs_opt) let triangular_solve ~upper ~transpose ~unit_diag a b = try Effect.perform (E_triangular_solve { a; b; upper; transpose; unit_diag }) with Effect.Unhandled _ -> T (Nx_backend.triangular_solve ~upper ~transpose ~unit_diag (unwrap a) (unwrap b))
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>