B q\K@sddlZddlZGdddZGdddZGdddZGdd d ZGd d d ZGd d d Zy4ddl m Z m Z GdddeZ GdddeZ Wnek reZ eZ YnXdS)Nc@sDeZdZdZddZddZddZdd Zd d ZeZeZeZ d S) MaxValuezL Represents an infinite value for purposes of tuple comparison. cCsdS)NT)selfotherrr0lib/python3.7/site-packages/astropy/table/bst.py__gt__ szMaxValue.__gt__cCsdS)NTr)rrrrr__ge__szMaxValue.__ge__cCsdS)NFr)rrrrr__lt__szMaxValue.__lt__cCsdS)NFr)rrrrr__le__szMaxValue.__le__cCsdS)NMAXr)rrrr__repr__szMaxValue.__repr__N) __name__ __module__ __qualname____doc__rrr r r __str__rrrrrsrc@sDeZdZdZddZddZddZdd Zd d ZeZeZeZ d S) MinValuezS The opposite of MaxValue, i.e. a representation of negative infinity. cCsdS)NTr)rrrrrr &szMinValue.__lt__cCsdS)NTr)rrrrrr )szMinValue.__le__cCsdS)NFr)rrrrrr,szMinValue.__gt__cCsdS)NFr)rrrrrr/szMinValue.__ge__cCsdS)NZMINr)rrrrr 2szMinValue.__repr__N) r rrrr r rrr rrrrrr src@s<eZdZdZdZddZddZddZd d Zd d Z d S)Epsilona  Represents the "next largest" version of a given value, so that for all valid comparisons we have x < y < Epsilon(y) < z whenever x < y < z and x, z are not Epsilon objects. Parameters ---------- val : object Original value )valcCs ||_dS)N)r)rrrrr__init__HszEpsilon.__init__cCs|j|krdS|j|kS)NF)r)rrrrrr Ks zEpsilon.__lt__cCs|j|krdS|j|kS)NT)r)rrrrrrPs zEpsilon.__gt__cCsdS)NFr)rrrrr__eq__UszEpsilon.__eq__cCst|jdS)Nz + epsilon)reprr)rrrrr XszEpsilon.__repr__N) r rrr __slots__rr rrr rrrrr:s rc@steZdZdZddZddZddZddZddZddZ d Z d d Z d d Z ddZ ddZddZddZdS)Nodez An element in a binary search tree, containing a key, data, and references to children nodes and a parent node. Parameters ---------- key : tuple Node key data : list or int Node data cCs |j|jkS)N)key)xyrrrisz Node.cCs |j|jkS)N)r)rrrrrrjscCs |j|jkS)N)r)rrrrrrkscCs |j|jkS)N)r)rrrrrrlscCs |j|jkS)N)r)rrrrrrmscCs |j|jkS)N)r)rrrrrrns)rdataleftrightcCs,||_t|tr|n|g|_d|_d|_dS)N)r isinstancelistrrr )rrrrrrrrsz Node.__init__cCsD|jdk r|j|kr||_n$|jdk r8|j|kr8||_ntddS)z= Replace this node's child with a new child. Nz"Cannot call replace() on non-child)rr ValueError)rchild new_childrrrreplacexs z Node.replacecCs||ddS)z) Remove the given child. N)r&)rr$rrrremovesz Node.removecCs|j|_|jdd|_dS)z& Copy the given node. N)rr)rrrrrsetszNode.setcCst|j|jfS)N)strrr)rrrrrsz Node.__str__cCst|S)N)r))rrrrr sz Node.__repr__N)r rrrr r rrr__ne__rrr&r'r(rr rrrrr\s  rc@s eZdZdZeZd@ddZdAddZdd Zd d Z d d Z ddZ ddZ dBddZ ddZddZddZddZddZdd Zd!d"ZdCd#d$Zd%d&Zd'd(ZdDd*d+ZdEd,d-Zd.d/Zd0d1Zd2d3Zd4d5Zd6d7Zd8d9Ze d:d;Z!dd?Z#dS)FBSTab A basic binary search tree in pure Python, used as an engine for indexing. Parameters ---------- data : Table Sorted columns of the original table row_index : Column object Row numbers corresponding to data columns unique : bool (defaults to False) Whether the values of the index must be unique FcCs>d|_d|_||_x&t||D]\}}|t||qWdS)Nr)rootsizeuniquezipaddtuple)rr row_indexr.rrowrrrrs z BST.__init__NcCs|dkr |}|jd7_|||}|j}|dkr>||_dSxv||krb|jdkrZ||_P|j}q@||kr|jdkr|||_P|j}q@|jrtdq@|j|jt |j|_dSq@WdS)z' Add a key, data pair. NzCannot insert non-unique value) r- NodeClassr,rr r.r#rextendsorted)rrrnode curr_noderrrr0s0     zBST.addcCs ||\}}|dk r|jSgS)a  Return all data values corresponding to a given key. Parameters ---------- key : tuple Input key Returns ------- data_vals : list List of rows corresponding to the input key N) find_noder)rrr8parentrrrfindszBST.findcCs|jdkrdS|||jdS)z> Find the node associated with the given key. N)NN)r,_find_recursive)rrrrrr:s z BST.find_nodecs,x&|D]}fdd|jD|_q WdS)z? Decrement all rows larger than the given row. cs g|]}|kr|dn|qS)r4r).0r)r3rr sz"BST.shift_left..N)traverser)rr3r8r)r3r shift_leftszBST.shift_leftcs,x&|D]}fdd|jD|_q WdS)zL Increment all rows greater than or equal to the given row. cs g|]}|kr|dn|qS)r4r)r>r)r3rrr?sz#BST.shift_right..N)r@r)rr3r8r)r3r shift_rightszBST.shift_rightcCsvy\||jkr||fS||jkr<|jdkr,dS|||j|S|jdkrJdS|||j|SWntk rpdSXdS)N)NN)rr r=r TypeError)rrr8r;rrrr=s    zBST._find_recursiveinordercCsT|dkr||jgS|dkr,||jgS|dkrB||jgStd|dS)a Return nodes of the BST in the given order. Parameters ---------- order : str The order in which to recursively search the BST. Possible values are: "preorder": current node, left subtree, right subtree "inorder": left subtree, current node, right subtree "postorder": left subtree, right subtree, current node ZpreorderrDZ postorderzInvalid traversal method: "{0}"N) _preorderr,_inorder _postorderr#format)rorderrrrr@s z BST.traversecCsdd|DS)zA Return BST items in order as (key, data) pairs. cSsg|]}|j|jfqSr)rr)r>rrrrr?szBST.items..)r@)rrrritemssz BST.itemscCsFd}x<|D]0}t|j}ddt|||D|_||7}qWdS)z6 Make row order align with key order. rcSsg|]}|qSrr)r>rrrrr?%szBST.sort..N)r@lenrrange)rir8num_rowsrrrsorts  zBST.sortcCsdd|DS)z7 Return BST rows sorted by key values. cSsg|]}|jD]}|qqSr)r)r>r8rrrrr?,sz#BST.sorted_data..)r@)rrrr sorted_data(szBST.sorted_datacCs6|dkr |S||||j|||j||S)N)appendrErr )rr8lstrrrrE.s  z BST._preordercCs6|dkr |S||j|||||j||S)N)rFrrQr )rr8rRrrrrF6s  z BST._inordercCs6|dkr |S||j|||j||||S)N)rGrr rQ)rr8rRrrrrG>s  zBST._postordercCs"||jkr||_n |||dS)N)r,r&)rr8r;Znew_noderrr _substituteFs zBST._substitutecCs||\}}|dkrdS|dk rT||jkr6tdnt|jdkrT|j|dS|jdkrx|jdkrx|||dn|jdkr|jdk r||||jnd|jdkr|jdk r||||jn>|j}|}x|jdk r|}|j}qW||||j|||j d8_ dS)a Remove data corresponding to the given key. Parameters ---------- key : tuple The key to remove data : int or None If None, remove the node corresponding to the given key. If not None, remove only the given data value from the node. Returns ------- successful : bool True if removal was successful, false otherwise NFz$Data does not belong to correct noder4T) r:rr#rKr'rr rSr(r-)rrrr8r;r9rrrr'Ls0      z BST.removecCs ||jS)z6 Returns whether this is a valid BST. ) _is_validr,)rrrris_validxsz BST.is_validcCsL|dkr dS|jdks |j|koJ|jdks4|j|koJ||joJ||jS)NT)rr rT)rr8rrrrT~s z BST._is_validTTcCs||||}dd|DS)a Return all nodes with keys in the given range. Parameters ---------- lower : tuple Lower bound upper : tuple Upper bound bounds : tuple (x, y) of bools Indicates whether the search should be inclusive or exclusive with respect to the endpoints. The first argument x corresponds to an inclusive lower bound, and the second argument y to an inclusive upper bound. cSsg|]}|jD]}|qqSr)r)r>r8rrrrr?szBST.range..) range_nodes)rlowerupperboundsnodesrrrrLsz BST.rangecCsL|jdkrgS|drtjntj}|dr0tjntj}||||||jgS)z2 Return nodes in the given range. Nrr4)r,operatorleltgegt_range)rrXrYrZop1op2rrrrWs  zBST.range_nodescCs,|jdkrgS|||jg}dd|DS)z Assuming the given value has smaller length than keys, return nodes whose keys have this value as a prefix. NcSsg|]}|jD]}|qqSr)r)r>r8rrrrr?sz#BST.same_prefix..)r, _same_prefix)rrr[rrr same_prefixs zBST.same_prefixcCsz|||jr"|||jr"||||jkrL|jdk rL||||||j|||jkrv|jdk rv||||||j||S)N)rrQr rar)rrXrYrbrcr8rRrrrras z BST._rangecCsl|jdt|}||kr$||||krF|jdk rF|||j|||krh|jdk rh|||j||S)N)rrKrQr rdr)rrr8rRprefixrrrrds zBST._same_prefixcCs|jdkrdS||jdS)NZEmptyr)r,_print)rrrrrs z BST.__str__cCst|S)N)r))rrrrr sz BST.__repr__cCsXd|t|d}|jdk r4|||j|d7}|jdk rT|||j|d7}|S)N  r4)r)rrgr )rr8levellinerrrrgs   z BST._printcCs ||jS)z( Return the BST height. )_heightr,)rrrrheightsz BST.heightcCs*|dkr dSt||j||jdS)Nr4)maxrlrr )rr8rrrrls z BST._heightcs4x.|D]"\}}fdd|D|dd<q WdS)a) Replace all rows with the values they map to in the given dictionary. Any rows not present as keys in the dictionary will have their nodes deleted. Parameters ---------- row_map : dict Mapping of row numbers to new row numbers csg|]}|kr|qSrr)r>r)row_maprrr?sz$BST.replace_rows..N)rJ)rrprrr)rpr replace_rowss zBST.replace_rows)F)N)rD)N)rV)rV)$r rrrrr5rr0r<r:rArBr=r@rJrOrPrErFrGrSr'rUrTrLrWrerardrr rgpropertyrmrlrqrrrrr+s>      ,      r+c@seZdZdZd!ddZddZddZd"d d Zd d ZddZ ddZ ddZ ddZ ddZ d#ddZddZddZdd Zd S)$FastBaseaj A fast binary search tree implementation for indexing, using the bintrees library. Parameters ---------- data : Table Sorted columns of the original table row_index : Column object Row numbers corresponding to data columns unique : bool (defaults to False) Whether the values of the index must be unique FcCs<||_||_x&t||D]\}}|t||qWdS)N)enginerr.r/r0r1)rrr2r.rr3rrrrs zFastBase.__init__cCsP|jr*||jkrtd|||j|<n"|j|g}|t|||dS)z( Add a key, value pair. z2Cannot add duplicate value "{0}" in a unique indexN)r.rr#rHZ set_defaultinsertnpZ searchsorted)rrrrowsrrrr0s  z FastBase.addcCs|j|g}|jr|g}|S)z; Find rows corresponding to the given key. )rgetr.)rrrwrrrr<sz FastBase.findNcCs|jr.y|j|Wqtk r*dSXnh|j|d}|dksPt|dkrTdS|dkrl|j|dS||krt|dkrdStd||dS)z1 Remove data from the given key. FNrTz$Data does not belong to correct node)r.rpopKeyErrorrxrKr#r')rrrr8rrrr's"   zFastBase.removecsj|jr6x^|jD]\}}|kr|d|j|<qWn0x.|jD] \}}fdd|D|j|<qBWdS)z; Decrement rows larger than the given row. r4cs g|]}|kr|dn|qS)r4r)r>r)r3rrr?;sz'FastBase.shift_left..N)r.rrJ)rr3rrr8r)r3rrA1s zFastBase.shift_leftcsj|jr6x^|jD]\}}|kr|d|j|<qWn0x.|jD] \}}fdd|D|j|<qBWdS)zH Increment rows greater than or equal to the given row. r4cs g|]}|kr|dn|qS)r4r)r>r)r3rrr?Gsz(FastBase.shift_right..N)r.rrJ)rr3rrr8r)r3rrB=s zFastBase.shift_rightcCs:g}x0|jD]"\}}t||}||_||qW|S)z/ Return all nodes in this BST. )rrJrrQ)rlrrnrrrr@Is  zFastBase.traversecCs$|jr|jSdd|jDS)z4 Return a list of key, data tuples. cSs g|]}t|ddkr|qS)r4r)rK)r>rrrrr?Zsz"FastBase.items..)r.rrJ)rrrrrJTs zFastBase.itemscCs|jr2xtt|jD]\}\}}||j|<qWnJd}xD|jD]6\}}t|}ddt|||D|j|<||7}qBWdS)z6 Make row order align with key order. rcSsg|]}|qSrr)r>rrrrr?gsz!FastBase.sort..N)r. enumeraterrJrKrL)rrMrr3rwrNrrrrO\sz FastBase.sortcCs.|jrdd|jDSdd|jDS)z? Return a list of rows in order sorted by key. cSsg|]}|qSrr)r>rrrrr?osz(FastBase.sorted_data..cSsg|]}|D]}|q qSrr)r>r8rrrrr?ps)r.rvalues)rrrrrPjszFastBase.sorted_dataTTcCsP|dst|}|dr t|}dd|j||D}|jrB|Sdd|DS)z7 Return row values in the given range. rr4cSsg|]}|qSrr)r>vrrrr?}sz"FastBase.range..cSsg|]}|D]}|q qSrr)r>Zsublistrrrrr?s)rrZ value_slicer.)rrXrYrZr{rrrrLrszFastBase.rangecs|jr`g}x8|jD]*\}}|kr6||j|<q||qWxH|D]}|j|qJWn.x,|jD]}fdd|D|dd<qlWdS)z: Replace rows with the values in row_map. csg|]}|kr|qSrr)r>r)rprrr?sz)FastBase.replace_rows..N)r.rrJrQryr~)rrpZdel_keysrrr)rprrqs zFastBase.replace_rowscCs t|jS)N)r)r)rrrrrszFastBase.__str__cCst|S)N)r))rrrrr szFastBase.__repr__)F)N)r)r rrrrr0r<r'rArBr@rJrOrPrLrqrr rrrrrss       rs)FastBinaryTree FastRBTreec@seZdZeZdS)FastBSTN)r rrrrtrrrrrsrc@seZdZeZdS)FastRBTN)r rrrrtrrrrrsr)r\Znumpyrvrrrrr+rsZbintreesrrrr ImportErrorrrrrs"";W/