a CCCf)P@sdZdZgdZddlmZddlZddlmZddl m Z m Z m Z dd l mZmZmZdd lmZmZmZmZmZmZdd lmZGd d d e eZdddZddZGdddee ZGdddeeZdS)z"List of Lists sparse matrix class zrestructuredtext en) lil_array lil_matrixisspmatrix_lil) bisect_leftN)spmatrix)_spbasesparrayissparse) IndexMixin INT_TYPES_broadcast_arrays)getdtypeisshape isscalarlike upcast_scalar check_shapecheck_reshape_kwargs) _csparsetoolsc@seZdZdZdLddZddZdd Zd d Zd d ZdMddZ ddZ e j j e _ e j j e _ ddZ ddZddZddZddZddZddZd d!Zd"d#Zd$d%Zd&d'Zd(d)Zd*d+Zd,d-Zd.d/Zd0d1Zd2d3Zd4d5Zd6d7Zd8d9Z d:d;Z!dd?Z#e j#j e#_ d@dAZ$e j$j e$_ dBdCZ%e j%j e%_ dNdDdEZ&e j&j e&_ dOdFdGZ'e j'j e'_ dPdHdIZ(e j(j e(_ dQdJdKZ)e j)j e)_ dS)R _lil_baselilNFc Cst|t||td|_t|r|jdkr:|r:|}n|}|durX|j |dd}t |j |_ |j|_|j |_ |j|_nt|trt|r|durtd|\}}t ||f|_ tj|ftd|_ tj|ftd|_t|D]}g|j |<g|j|<qntdnvz||}Wn0tyL} ztd| WYd} ~ n@d} ~ 00|j||d}t |j |_ |j|_|j |_ |j|_dS) N)defaultrFcopyzinvalid use of shape parameterdtypez(unrecognized lil_array constructor usagezunsupported matrix type)r__init__rfloatrr formatrtolilastypershape_shaperowsdata isinstancetupler ValueErrornpemptyobjectrange TypeErrorZ _ascontainer_csr_container) selfZarg1r!rrAMNier4M/var/www/html/django/DPS/env/lib/python3.9/site-packages/scipy/sparse/_lil.pyrsB           z_lil_base.__init__cCs|||ddddf<|SNr4r.otherr4r4r5__iadd__Dsz_lil_base.__iadd__cCs|||ddddf<|Sr6r4r7r4r4r5__isub__Hsz_lil_base.__isub__cCs,t|r$|||ddddf<|StSdSr6rNotImplementedr7r4r4r5__imul__Lsz_lil_base.__imul__cCs,t|r$|||ddddf<|StSdSr6r;r7r4r4r5 __itruediv__Ssz_lil_base.__itruediv__cCs|durtdd|jDS|dkr,|d7}|dkrjtj|jdtjd}|jD]}||d7<qP|S|dkrtjdd|jDtjdStddS) NcSsg|] }t|qSr4len.0rowvalsr4r4r5 _z%_lil_base._getnnz..rrrcSsg|] }t|qSr4r?rAr4r4r5rDhrEzaxis out of bounds) sumr$r(Zzerosr!intpr#arrayr')r.Zaxisoutrowr4r4r5_getnnz]s z_lil_base._getnnzcCstdd|jDS)Ncss|]}t|VqdSr6)r( count_nonzerorAr4r4r5 mrEz*_lil_base.count_nonzero..)rGr$)r.r4r4r5rMlsz_lil_base.count_nonzeroc Csbd}t|jD]F\}}t|D]4\}}|dt||fdt|j||d7}qq|ddS)Nz   ) enumerater#strr$)r.valr2rKposjr4r4r5__str__rs 0z_lil_base.__str__cCs>|jd|jdf|jd}|j||jd<|j||jd<|S)z;Returns a view of the 'i'th row (without copying). rrr)_lil_containerr!rr#r$)r.r2newr4r4r5 getrowviewysz_lil_base.getrowviewcCsz|j\}}|dkr||7}|dks*||kr2td|jd|f|jd}|j|dd|jd<|j|dd|jd<|S)z)Returns a copy of the 'i'th row. rzrow index out of boundsrrN)r! IndexErrorrYrr#r$)r.r2r0r1rZr4r4r5getrows z_lil_base.getrowcCsHt|tr.)rYr!rrrr rSr$)r.r8rZZ res_dtyperWrCr4rr5 _mul_scalars  z_lil_base._mul_scalarcs^trN|}t||_t|jD] \}}fdd|D|j|<q(|S|SdS)Ncsg|] }|qSr4r4rrr4r5rD%rEz)_lil_base.__truediv__..)rrr(Z result_typerrSr$tocsr)r.r8rZrWrCr4rr5 __truediv__sz_lil_base.__truediv__c CsJ|j\}}|j|j|jd}t|||j|j|j|jt|d|d| |Srz)r!rYrrr~r#r$r+)r.r0r1rZr4r4r5r*s z_lil_base.copycOst||j}t|\}}||jkr2|r.|S|S|j||jd}|dkr|jd}t|jD]F\}} t| D]4\} } t ||| |\} } ||| f|| | f<qnq^nr|dkr|jd}t|jD]H\}} t| D]6\} } t || |||\} } ||| f|| | f<qqnt d|S)NrCrFrz'order' must be 'C' or 'F') rr!rrrYrrSr#r(Z unravel_indexr')r.argskwargsr!orderrrZZncolsr2rKrirWZnew_rZnew_cZnrowsr4r4r5reshape5s*      z_lil_base.reshapec Gst|}|\}}|j\}}||krD|jd||_|jd||_nL||krt|j||_t|j||_t||D]}g|j|<g|j|<qv||krt|j|jD]&\}}t||} || d=|| d=q||_ dSr6) rr!r#r$r(resizer+ziprr") r.r!Znew_MZnew_Nr0r1r2rKr$truncr4r4r5rUs$      z_lil_base.resizecCsL|||}t|jD]0\}}t|D]\}}|j|||||f<q&q|Sr6)Z_process_toarray_argsrSr#r$)r.rrJdr2rKrVrWr4r4r5rns  z_lil_base.toarraycCs|j|dj|ddjddS)NrF)axesr)r transposer)r.rrr4r4r5rwsz_lil_base.transposecCs|r |S|SdSr6r)r.rr4r4r5r|sz_lil_base.tolilc Cs\|j\}}|dks|dkr.|j||f|jdS||ttjjkrtj}tj|d|d}d|d<t |j |ddtj ||d|d}nz|j |d}tj||d}t |j ||j tjd}|j t||d}tj|d|d}d|d<tj |||dddtj||d}tj||jd} t|j |t|j| |j| ||f|jdS) Nrrr)rJrR)maxval)rrJ)r!)r!r-rr(Ziinfoint32maxr)rZlil_get_lengthsr#ZcumsumZ_get_index_dtyperGint64Zlil_flatten_to_arrayr$) r.rr0r1Z idx_dtypeZindptrZnnzlengthsrkr$r4r4r5rs.   z_lil_base.tocsr)NNF)N)NN)NF)F)F)*__name__ __module__ __qualname___formatrr9r:r=r>rLrMr__doc__rXr[r]r_rfr^rorprrrtrurwrxrvryrlrrrrrrrrrrrrrr4r4r4r5rs\ -                  rcCs|j|jkr||j}n|j|jkr2||j}|jjrL|jtjtjfvrX|tj}|jjrr|jtjtjfvr~|tj}|dur|jjs|}|||fS||fSdS)a Convert index and data arrays to form suitable for passing to the Cython fancy getset routines. The conversions are necessary since to (i) ensure the integer index arrays are in one of the accepted types, and (ii) to ensure the arrays are writable so that Cython memoryview support doesn't choke on them. Parameters ---------- i, j Index arrays x : optional Data arrays Returns ------- i, j, x Re-formatted arrays (x is omitted, if input was None) N) rr flagsZ writeabler(rrrHr)r2rWrer4r4r5r}s      r}cCs t|tS)aIs `x` of lil_matrix type? Parameters ---------- x object to check for being a lil matrix Returns ------- bool True if `x` is a lil matrix, False otherwise Examples -------- >>> from scipy.sparse import lil_array, lil_matrix, coo_matrix, isspmatrix_lil >>> isspmatrix_lil(lil_matrix([[5]])) True >>> isspmatrix_lil(lil_array([[5]])) False >>> isspmatrix_lil(coo_matrix([[5]])) False )r%r)rer4r4r5rsrc@seZdZdZdS)ra Row-based LIst of Lists sparse array. This is a structure for constructing sparse arrays incrementally. Note that inserting a single item can take linear time in the worst case; to construct the array efficiently, make sure the items are pre-sorted by index, per row. This can be instantiated in several ways: lil_array(D) where D is a 2-D ndarray lil_array(S) with another sparse array or matrix S (equivalent to S.tolil()) lil_array((M, N), [dtype]) to construct an empty array with shape (M, N) dtype is optional, defaulting to dtype='d'. Attributes ---------- dtype : dtype Data type of the array shape : 2-tuple Shape of the array ndim : int Number of dimensions (this is always 2) nnz size data LIL format data array of the array rows LIL format row index array of the array T Notes ----- Sparse arrays can be used in arithmetic operations: they support addition, subtraction, multiplication, division, and matrix power. Advantages of the LIL format - supports flexible slicing - changes to the array sparsity structure are efficient Disadvantages of the LIL format - arithmetic operations LIL + LIL are slow (consider CSR or CSC) - slow column slicing (consider CSC) - slow matrix vector products (consider CSR or CSC) Intended Usage - LIL is a convenient format for constructing sparse arrays - once an array has been constructed, convert to CSR or CSC format for fast arithmetic and matrix vector operations - consider using the COO format when constructing large arrays Data Structure - An array (``self.rows``) of rows, each of which is a sorted list of column indices of non-zero elements. - The corresponding nonzero values are stored in similar fashion in ``self.data``. Nrrrrr4r4r4r5rsrc@seZdZdZdS)ra Row-based LIst of Lists sparse matrix. This is a structure for constructing sparse matrices incrementally. Note that inserting a single item can take linear time in the worst case; to construct the matrix efficiently, make sure the items are pre-sorted by index, per row. This can be instantiated in several ways: lil_matrix(D) where D is a 2-D ndarray lil_matrix(S) with another sparse array or matrix S (equivalent to S.tolil()) lil_matrix((M, N), [dtype]) to construct an empty matrix with shape (M, N) dtype is optional, defaulting to dtype='d'. Attributes ---------- dtype : dtype Data type of the matrix shape : 2-tuple Shape of the matrix ndim : int Number of dimensions (this is always 2) nnz size data LIL format data array of the matrix rows LIL format row index array of the matrix T Notes ----- Sparse matrices can be used in arithmetic operations: they support addition, subtraction, multiplication, division, and matrix power. Advantages of the LIL format - supports flexible slicing - changes to the matrix sparsity structure are efficient Disadvantages of the LIL format - arithmetic operations LIL + LIL are slow (consider CSR or CSC) - slow column slicing (consider CSC) - slow matrix vector products (consider CSR or CSC) Intended Usage - LIL is a convenient format for constructing sparse matrices - once a matrix has been constructed, convert to CSR or CSC format for fast arithmetic and matrix vector operations - consider using the COO format when constructing large matrices Data Structure - An array (``self.rows``) of rows, each of which is a sorted list of column indices of non-zero elements. - The corresponding nonzero values are stored in similar fashion in ``self.data``. Nrr4r4r4r5r,sr)N)r __docformat____all__bisectrnumpyr(Z_matrixr_baserr r _indexr r r Z_sputilsrrrrrrrOrrr}rrrr4r4r4r5s"     )A