&`ipddlZddlmZmZGddZGddeZGddeZdS) N)AnyOptionalceZdZdZ ddededeefdZdded eed efd Zd ed e d dfdZ d ed efdZ dZ dZ dS) SegmentTreeamA Segment Tree data structure. https://en.wikipedia.org/wiki/Segment_tree Can be used as regular array, but with two important differences: a) Setting an item's value is slightly slower. It is O(lg capacity), instead of O(1). b) Offers efficient `reduce` operation which reduces the tree's values over some specified contiguous subsequence of items in the array. Operation could be e.g. min/max/sum. The data is stored in a list, where the length is 2 * capacity. The second half of the list stores the actual values for each index, so if capacity=8, values are stored at indices 8 to 15. The first half of the array contains the reduced-values of the different (binary divided) segments, e.g. (capacity=4): 0=not used 1=reduced-value over all elements (array indices 4 to 7). 2=reduced-value over array indices (4 and 5). 3=reduced-value over array indices (6 and 7). 4-7: values of the tree. NOTE that the values of the tree are accessed by indices starting at 0, so `tree[0]` accesses `internal_array[4]` in the above example. Ncapacity operationneutral_elementc"|dkr ||dz zdks Jd|_|7|tjurdn&|turt dnt d}|_fdt d |zD_|_dS) a>Initializes a Segment Tree object. Args: capacity: Total size of the array - must be a power of two. operation: Lambda obj, obj -> obj The operation for combining elements (eg. sum, max). Must be a mathematical group together with the set of possible values for array elements. neutral_element (Optional[obj]): The neutral element for `operation`. Use None for automatically finding a value: max: float("-inf"), min: float("inf"), sum: 0.0. rz+Capacity must be positive and a power of 2!Ngz-infinfcg|] }j S)r ).0_selfs t/home/jaya/work/projects/VOICE-AGENT/VIET/agent-env/lib/python3.11/site-packages/ray/rllib/execution/segment_tree.py z(SegmentTree.__init__..=sHHHqd*HHH) roperatoraddmaxfloatr rangevaluer)rrrr s` r__init__zSegmentTree.__init__ s" qLLXA6!;;; 8<; ;   " ,,##6]]]5\\  /HHHHE!h,4G4GHHH "rrstartendreturncH||j}n|dkr ||jz }|j}||jz }||jz }||krf|dzr&|||j|}|dz }|dzr&|dz}|||j|}|dz}|dz}||kf|S)aApplies `self.operation` to subsequence of our values. Subsequence is contiguous, includes `start` and excludes `end`. self.operation( arr[start], operation(arr[start+1], operation(... arr[end]))) Args: start: Start index to apply reduction to. end (Optional[int]): End index to apply reduction to (excluded). Returns: any: The result of reducing self.operation over the specified range of `self._value` elements. Nrr r)rr rr)rrrresults rreducezSegmentTree.reduce@s ;-CC 1WW 4= C%  t}*ckkqy  50ABB  Qw Aq 3@@ aKE AIC%ckk, ridxvalc(d|cxkr |jksnJd|d|j||jz }||j|<|dz }|dkrId|z}||j||j|dz|j|<|dz }|dkGdSdS)z Inserts/overwrites a value in/into the tree. Args: idx: The index to insert to. Must be in [0, `self.capacity`) val: The value to insert. rzidx=z capacity=r rN)rrr)rr#r$ update_idxs r __setitem__zSegmentTree.__setitem__sC''''$-''''')N)N)Nt})N)N''' t} 3QhQhhSJ"nn :& :>(BDJsO(C QhhhhhhrcXd|cxkr |jksnJ|j||jzS)Nr)rr)rr#s r __getitem__zSegmentTree.__getitem__s=C''''$-''''''z# -..rc|jSN)r)rs r get_statezSegmentTree.get_states zrcNt||jdzksJ||_dS)Nr)lenrr)rstates r set_statezSegmentTree.set_states+5zzT]Q..... rr+rN)__name__ __module__ __qualname____doc__intrrrr"rr'r)r,r0rrrrrs6OS###(+#>Fsm####@DDCD(3-D3DDDDLs44/s/s////rrcZeZdZdZdeffd Zd dedeedefd Zd e defd Z xZ S) SumSegmentTreez:A SegmentTree with the reduction `operation`=operator.add.rcptt||tjdSN)rr)superr8rrrrr __class__s rrzSumSegmentTree.__init__s. nd##,,h(,,WWWWWrrNrrrc.|||S)z/Returns the sum over a sub-segment of the tree.r"rrrs rsumzSumSegmentTree.sum{{5#&&&r prefixsumc0d|cxkr|dzksnJd}||j|kr|j|dz }||jkr9d|z}|j||kr|}n||j|z}|dz}||jk9||jz S)zFinds highest i, for which: sum(arr[0]+..+arr[i - i]) <= prefixsum. Args: prefixsum: `prefixsum` upper bound in above constraint. Returns: int: Largest possible index (i) satisfying above constraint. rgh㈵>r r)rArr)rrCr#r&s rfind_prefixsum_idxz!SumSegmentTree.find_prefixsum_idxsI2222d!2222222  3 ' ' 3$.IDM!!SJz*% 11 TZ 33  1n DM!!T]""rr1) r2r3r4r5r6rrrrArrE __classcell__r=s@rr8r8sDDXXXXXXX'''x}'''''#E#c########rr8cFeZdZdeffd Zd dedeedefdZxZS) MinSegmentTreercftt||tdSr:)r;rIrminr<s rrzMinSegmentTree.__init__s, nd##,,h#,NNNNNrrNrrrc.|||S)z'Returns min(arr[start], ..., arr[end])r?r@s rrKzMinSegmentTree.minrBrr1) r2r3r4r6rrrrKrFrGs@rrIrIs}OOOOOOO'''x}'''''''''rrI)rtypingrrrr8rIrrrrNs ddddddddN$#$#$#$#$#[$#$#$#N'''''['''''r