+
    ùäûjÖ  ã                   óÐ   € ^ RI t ^RIHt ^RIHt ^RIHtHtHtHtH	t	  ! R R]P                  4      t ! R R]P                  4      t ! R	 R
]P                  4      tRR R lltR# )é    N)Úbrownian_base)Úbrownian_interval)ÚOptionalÚScalarÚTensorÚTupleÚUnionc                   ó‚   a a€ ] tR t^t oV 3R ltR	R ltR t]R 4       t]R 4       t	]R 4       t
]R 4       tRtVtV ;t# )
ÚReverseBrownianc                ó8   <€ \         \        V `  4        Wn        R # ©N)Úsuperr   Ú__init__Úbase_brownian)Úselfr   Ú	__class__s   &&€ÚVC:\Ai_Coding\apps\studio\ComfyUI\.venv\Lib\site-packages\torchsde\_brownian\derived.pyr   ÚReverseBrownian.__init__   s   ø€ ÜŒo˜tÑ-Ô/Ø*Öó    c                ó.   € V P                  V) V) W4R 7      # ©)Úreturn_UÚreturn_A©r   )r   ÚtaÚtbr   r   s   &&&&&r   Ú__call__ÚReverseBrownian.__call__   s    € ð ×!Ñ! 2 #¨ s°XÐ!ÓQÐQr   c                óN   € V P                   P                   R V P                   R2# )z(base_brownian=Ú))r   Ú__name__r   ©r   s   &r   Ú__repr__ÚReverseBrownian.__repr__    s'   € Ø—.‘.×)Ñ)Ð*¨/¸$×:LÑ:LÐ9MÈQÐOÐOr   c                ó.   € V P                   P                  # r   )r   Údtyper"   s   &r   r&   ÚReverseBrownian.dtype#   ó   € à×!Ñ!×'Ñ'Ð'r   c                ó.   € V P                   P                  # r   )r   Údevicer"   s   &r   r*   ÚReverseBrownian.device'   s   € à×!Ñ!×(Ñ(Ð(r   c                ó.   € V P                   P                  # r   )r   Úshaper"   s   &r   r-   ÚReverseBrownian.shape+   r(   r   c                ó.   € V P                   P                  # r   )r   Úlevy_area_approximationr"   s   &r   r0   Ú'ReverseBrownian.levy_area_approximation/   s   € à×!Ñ!×9Ñ9Ð9r   r   ©NFF)r!   Ú
__module__Ú__qualname__Ú__firstlineno__r   r   r#   Úpropertyr&   r*   r-   r0   Ú__static_attributes__Ú__classdictcell__Ú__classcell__©r   Ú__classdict__s   @@r   r   r      sk   ù‡ € õ+ôRò
Pð ñ(ó ð(ð ñ)ó ð)ð ñ(ó ð(ð ñ:ó ÷:ð :r   r   c                   ó–   a a€ ] tR t^4t oRtRV3R lV 3R llltRR ltR t]R 4       t	]R 4       t
]R 4       t]R	 4       tR
tVtV ;t# )ÚBrownianPathz÷Brownian path, storing every computed value.

Useful for speed, when memory isn't a concern.

To use:
>>> bm = BrownianPath(t0=0.0, w0=torch.zeros(4, 1))
>>> bm(0., 0.5)
tensor([[ 0.0733],
        [-0.5692],
        [ 0.1872],
        [-0.3889]])
c                ó,   <€ V ^8„  d   QhRS[ RS[RS[/# )é   Út0Úw0Úwindow_size)r   r   Úint)Úformatr;   s   "€r   Ú__annotate__ÚBrownianPath.__annotate__B   s"   ø€ ÷ -ñ -™6ð -¡vð -¹Cñ -r   c           	     óÆ   <€ V^,           pW n         \        P                  ! WVP                  VP                  VP
                  RR7      V n        \        \        V `'  4        R# )zwInitialize Brownian path.
Arguments:
    t0: Initial time.
    w0: Initial state.
    window_size: Unused; deprecated.
N)r@   Út1Úsizer&   r*   Ú
cache_size)
Ú_w0r   ÚBrownianIntervalr-   r&   r*   Ú	_intervalr   r=   r   )r   r@   rA   rB   rH   r   s   &&&& €r   r   ÚBrownianPath.__init__B   sN   ø€ ð �!�VˆØŒÜ*×;Ò;¸rÈrÏxÉxÐ_a×_gÑ_gØCEÇ9Á9ÐY]ô_ˆŒäŒl˜DÑ*Ö,r   c                óx   € V P                  WW4R 7      pVf#   V'       g   V'       g   WPP                  ,           pV# r   ©rM   rK   ©r   Útr   r   r   Úouts   &&&&& r   r   ÚBrownianPath.__call__O   ó-   € à�n‰n˜Q¨XˆnÓIˆØŠ:Ÿh¯xØŸ™•.ˆCØˆ
r   c                óN   € V P                   P                   R V P                   R2# ©z
(interval=r    ©r   r!   rM   r"   s   &r   r#   ÚBrownianPath.__repr__V   ó%   € Ø—.‘.×)Ñ)Ð*¨*°T·^±^Ð4DÀAÐFÐFr   c                ó.   € V P                   P                  # r   ©rM   r&   r"   s   &r   r&   ÚBrownianPath.dtypeY   ó   € à�~‰~×#Ñ#Ð#r   c                ó.   € V P                   P                  # r   ©rM   r*   r"   s   &r   r*   ÚBrownianPath.device]   ó   € à�~‰~×$Ñ$Ð$r   c                ó.   € V P                   P                  # r   ©rM   r-   r"   s   &r   r-   ÚBrownianPath.shapea   r^   r   c                ó.   € V P                   P                  # r   ©rM   r0   r"   s   &r   r0   Ú$BrownianPath.levy_area_approximatione   ó   € à�~‰~×5Ñ5Ð5r   rP   )é   r2   ©r!   r3   r4   r5   Ú__doc__r   r   r#   r6   r&   r*   r-   r0   r7   r8   r9   r:   s   @@r   r=   r=   4   st   ù‡ € ñ÷-õ -ôòGð ñ$ó ð$ð ñ%ó ð%ð ñ$ó ð$ð ñ6ó ÷6ð 6r   r=   c                   ó–   a a€ ] tR t^jt oRtRV3R lV 3R llltRR ltR t]R 4       t	]R 4       t
]R 4       t]R	 4       tR
tVtV ;t# )ÚBrownianTreeaŸ  Brownian tree with fixed entropy.

Useful when the map from entropy -> Brownian motion shouldn't depend on the
locations and order of the query points. (As the usual BrownianInterval
does - note that BrownianTree is slower as a result though.)

To use:
>>> bm = BrownianTree(t0=0.0, w0=torch.zeros(4, 1))
>>> bm(0., 0.5)
tensor([[ 0.0733],
        [-0.5692],
        [ 0.1872],
        [-0.3889]], device='cuda:0')
c                ó�   <€ V ^8„  d   QhRS[ RS[RS[S[ ,          RS[S[,          RS[S[,          RS[RS[RS[R	S[S[,          /	# )
r?   r@   rA   rH   Úw1ÚentropyÚtolÚ	pool_sizeÚcache_depthÚsafety)r   r   r   rC   Úfloat)rD   r;   s   "€r   rE   ÚBrownianTree.__annotate__z   sr   ø€ ÷ +-ñ +-™6ð +-Ùð+-á™fÕ%ð+-ñ ™fÕ%ð+-ñ #¡3�-ð	+-ñ
 ð+-ñ  ð+-ñ "ð+-ñ "¡%�ñ+-r   c
                óö   <€ Vf
   V^,           pVf   Rp
MWB,
          p
W n         \        P                  ! VVVP                  VP                  VP
                  VVVRV
R7
      V n        \        \        V `'  4        R# )a|  Initialize the Brownian tree.

The random value generation process exploits the parallel random number paradigm and uses
`numpy.random.SeedSequence`. The default generator is PCG64 (used by `default_rng`).

Arguments:
    t0: Initial time.
    w0: Initial state.
    t1: Terminal time.
    w1: Terminal state.
    entropy: Global seed, defaults to `None` for random entropy.
    tol: Error tolerance before the binary search is terminated; the search depth ~ log2(tol).
    pool_size: Size of the pooled entropy. This parameter affects the query speed significantly.
    cache_depth: Unused; deprecated.
    safety: Unused; deprecated.
NT)
r@   rH   rI   r&   r*   rq   rr   rs   Úhalfway_treeÚW)
rK   r   rL   r-   r&   r*   rM   r   rn   r   )r   r@   rA   rH   rp   rq   rr   rs   rt   ru   rz   r   s   &&&&&&&&&& €r   r   ÚBrownianTree.__init__z   st   ø€ ð4 Š:Ø�a•ˆBØŠ:Ø‰Aà•ˆAØŒÜ*×;Ò;¸rØ?AØACÇÁØBDÇ(Á(ØCEÇ9Á9ØDKØ@CØFOØIMØ>?ô	AˆŒô 	Œl˜DÑ*Ö,r   c                óx   € V P                  WW4R 7      pVf#   V'       g   V'       g   WPP                  ,           pV# r   rP   rQ   s   &&&&& r   r   ÚBrownianTree.__call__§   rU   r   c                óN   € V P                   P                   R V P                   R2# rW   rX   r"   s   &r   r#   ÚBrownianTree.__repr__®   rZ   r   c                ó.   € V P                   P                  # r   r\   r"   s   &r   r&   ÚBrownianTree.dtype±   r^   r   c                ó.   € V P                   P                  # r   r`   r"   s   &r   r*   ÚBrownianTree.deviceµ   rb   r   c                ó.   € V P                   P                  # r   rd   r"   s   &r   r-   ÚBrownianTree.shape¹   r^   r   c                ó.   € V P                   P                  # r   rg   r"   s   &r   r0   Ú$BrownianTree.levy_area_approximation½   ri   r   rP   )NNNg�íµ ÷Æ°>é   é	   Nr2   rk   r:   s   @@r   rn   rn   j   su   ù‡ € ñ÷+-õ +-ôZòGð ñ$ó ð$ð ñ%ó ð%ð ñ$ó ð$ð ñ6ó ÷6ð 6r   rn   c                ó2  € V ^8„  d   QhR\         R\        \        ,          R\        \        ,          R\        \        \        R3,          ,          R\        \
        P                  ,          R\        \        \        \
        P                  3,          ,          /# )r?   Úyr@   rH   rI   .r&   r*   )
r   r   r   r   rC   Útorchr&   r	   Ústrr*   )rD   s   "r   rE   rE   Â   s|   € ÷ mñ mœfð mÜ'¬Õ/ðmä'¬Õ/ðmô "*¬%´°S°­/Õ!:ðmô #+¬5¯;©;Õ"7ð	mô
 $,¬E´#´u·|±|Ð2CÕ,DÕ#Eñmr   c                ó®   € Vf   V P                   MTpVf   V P                  MTpVf   V P                  MTp\        P                  ! RRVRVRVRVRV/VB # )zZReturns a BrownianInterval object with the same size, device, and dtype as a given tensor.r@   rH   rI   r&   r*   © )r-   r&   r*   r   rL   )r‹   r@   rH   rI   r&   r*   Úkwargss   &&&&&&,r   Úbrownian_interval_liker‘   Â   s`   € ð ’lˆ1�7Š7¨€DØ’}ˆA�GŠG¨%€EØšˆQ�XŠX¨V€FÜ×-Ò-Ñl°Ðl¸ÐlÀÐlÈUÐlÐ[aÐlÐekÑlÐlr   )g        g      ð?NNN)rŒ   Ú r   r   Útypesr   r   r   r   r	   ÚBaseBrownianr   r=   rn   r‘   r�   r   r   Ú<module>r•      s\   ðó å Ý ß :Õ :ô:�m×0Ñ0ô :ô<36�=×-Ñ-ô 36ôlU6�=×-Ñ-ô U6÷pmñ mr   