h#&2ddlZd dZd dZd dZdZdZdS) Nc<|j||krtj|Stdgt |jz}td| ||<tjj|t||dfdd}|S)aaRight shift an array of binary values. Parameters: ----------- binary: An ndarray of binary values. k: The number of bits to shift. Default 1. axis: The axis along which to shift. Default -1. Returns: -------- Returns an ndarray with zero prepended and the ends truncated, along whatever axis was specified.Nrconstant)modevalue) shapetorch zeros_likeslicelennn functionalpadtuple)binarykaxisslicingshifteds X/data/cameron/tmprepos/2unirig/src/model/pointcept/models/utils/serialization/hilbert.py right_shiftrs"|DQ'''T{{mc&,///G$OOGDMh!%%uW~~AZq&G NcRt||}tj||}|S)aSConvert an array of binary values into Gray codes. This uses the classic X ^ (X >> 1) trick to compute the Gray code. Parameters: ----------- binary: An ndarray of binary values. axis: The axis along which to compute the gray code. Default=-1. Returns: -------- Returns an ndarray of Gray codes. )r)rr logical_xor)rrrgrays r binary2grayr&s/&t,,,G  VW - -D KrcJdtj|j|gdz z}|dkr@tj|t||}tj|dd}|dk@|S)aConvert an array of Gray codes back into binary values. Parameters: ----------- gray: An ndarray of gray codes. axis: The axis along which to perform Gray decoding. Default=-1. Returns: -------- Returns an ndarray of binary values. rrfloor) rounding_mode) r Tensorr log2ceilintrrdiv)rrshifts r gray2binaryr(=s %, 4 01227799>>@@DDFFJ KE !)) {4'?'?@@ %'::: !)) Krc |j}dtjdd|jz}|d}|d|krt d|d|fz||zdkrt d||||zfz|tj  d|dfd}| d | dddd | d f}t!d|D]N}t!d|D]9} |d d | |f} tj|d d d|dzd f| d d d f|d d d|dzd f<tjtj| d d d fd|jd |z dz tj|d d d|dzd f|d d | |dzd f} tj|d d | |dzd f| |d d | |dzd f<tj|d d d|dzd f| |d d d|dzd f<;P|dd  d||zf}t-|} d ||zz } tjj| | dfd d}|d d|zd tj }|tj}|S)aDecode an array of locations in a hypercube into a Hilbert integer. This is a vectorized-ish version of the Hilbert curve implementation by John Skilling as described in: Skilling, J. (2004, April). Programming the Hilbert curve. In AIP Conference Proceedings (Vol. 707, No. 1, pp. 381-387). American Institute of Physics. Params: ------- locs - An ndarray of locations in a hypercube of num_dims dimensions, in which each dimension runs from 0 to 2**num_bits-1. The shape can be arbitrary, as long as the last dimension of the same has size num_dims. num_dims - The dimensionality of the hypercube. Integer. num_bits - The number of bits for each dimension. Integer. Returns: -------- The output is an ndarray of uint64 integers with the same shape as the input, excluding the last dimension, which needs to be num_dims. rrrz The shape of locs was surprising in that the last dimension was of size %d, but num_dims=%d. These need to be equal. ?z num_dims=%d and num_bits=%d for %d bits total, which can't be encoded into a int64. Are you sure you need that many points on your Hilbert curve? .Nr@r)rr*r*)r r arangetodeviceflip ValueErrorlongviewuint8reshape unsqueeze bitwise_andnebyteflattenranger logical_and logical_notrepeatswapaxesr(rrrsumsqueezetypeint64)locsnum_dimsnum_bits orig_shape bitpack_maskbitpack_mask_rev locs_uint8rbitdimmaskto_fliphh_bin extra_dimspaddedhh_uint8 hh_uint64s rencoderUSs6J Q**--dk:::L#((,,"~!! "~x(  )   (R 8h#67  8   !!%+..66Ha7HIINNrRRJ R  % & & A  Rxijj  * Q!!VVH%% V VC3 $D%*$5QQQ3799_%tAAAtG}%%DAsQwyy ! '!$qqq$w-00774:a=3;NQR;RSS!$qqq!S1WYY"7aaacAgii>O9PQQG',&7QQQS1WYY&'''DCq" #%*$5d111aq?6KW$U$UDAsQwyy ! !# V( ==A   & &Hx,?'@ A AD  Fh))J X $ $Vj!_j! L LF R  , ,| ; Q  ek     ek**2244I rc v||zdkrtd||fztj|}|j}dtjdd|jz}|d}| tj  tj  dd}|d|dddd d | |zd f}t'|}| d||fd d}t+|d z ddD]-} t+|d z ddD]} |d d | | f} tj|d d d| d zd f| d d d f|d d d| d zd f<tjtj| d d d ftj|d d d| d zd f|d d | | d zd f} tj|d d | | d zd f| |d d | | d zd f<tj|d d d| d zd f| |d d d| d zd f</d|z } tjj|| dfd d}|d d|ddf}||zd  tj }| tj }| g||RS) a(Decode an array of Hilbert integers into locations in a hypercube. This is a vectorized-ish version of the Hilbert curve implementation by John Skilling as described in: Skilling, J. (2004, April). Programming the Hilbert curve. In AIP Conference Proceedings (Vol. 707, No. 1, pp. 381-387). American Institute of Physics. Params: ------- hilberts - An ndarray of Hilbert integers. Must be an integer dtype and cannot have fewer bits than num_dims * num_bits. num_dims - The dimensionality of the hypercube. Integer. num_bits - The number of bits for each dimension. Integer. Returns: -------- The output is an ndarray of unsigned integers with the same shape as hilberts but with an additional dimension of size num_dims. r-z num_dims=%d and num_bits=%d for %d bits total, which can't be encoded into a uint64. Are you sure you need that many points on your Hilbert curve? rrr*r)rr*r,Nrr)r2r atleast_1dr r.r/r0r1ravelrCrDr4r5r6r7r8r9r:r;rr@r<rr=r>rrrrArB)hilbertsrFrGrHrIrJrShh_bitsrrLrMrNrOrQrR locs_choppedrK flat_locss rdecoder^s0(R "  #   ))HJ Q**--ho>>>L#((,, ek**// <<DDWMMRRSUVV  2 % & & A  RXI0222  4  w  D <<Xx0 1 1 : :1a @ @DX\2r**VVAr2.. V VC3 $D%*$5QQQ3799_%tAAAtG}%%DAsQwyy ! '!$qqq$w-00!$qqq!S1WYY"7aaacAgii>O9PQQG',&7QQQS1WYY&'''DCq" #%*$5d111aq?6KW$U$UDAsQwyy ! !# V(hJ X $ $TJ?J J JF;;r??**B!Q+?@@L-22155==??DDU[QQJ ,,I   4z4844 5 55r)rr)r)r rrr(rUr^rrr`s| D.,kkk\f6f6f6f6f6r