Submit
Path:
~
/
/
proc
/
thread-self
/
root
/
opt
/
alt
/
python35
/
lib64
/
python3.5
/
site-packages
/
scipy
/
sparse
/
__pycache__
/
File Content:
compressed.cpython-35.opt-1.pyc
0��W�� � @ s d Z d d l m Z m Z m Z g Z d d l m Z d d l Z d d l Z d d l m Z d d l m Z m Z m Z d d l m Z m Z d d l m Z d d l m Z d d l m Z m Z m Z m Z m Z m Z m Z m! Z! m" Z" m# Z# m$ Z$ Gd d � d e e e! � Z% d S)z>Base class for sparse matrix formats using compressed storage.� )�division�print_function�absolute_import)�warnN)�zip� )�spmatrix� isspmatrix�SparseEfficiencyWarning)� _data_matrix� _minmax_mixin)� dia_matrix)� _sparsetools) �upcast� upcast_char� to_native�isdense�isshape�getdtype� isscalarlike� IndexMixin�get_index_dtype�downcast_intp_index� get_sum_dtypec @ s� e Z d Z d Z d d d d d � Z d d d � Z e j j e _ d d d � Z d d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z d d � Z d! d" � Z d# d$ � Z d% d& � Z d' d( � Z d) d* � Z d+ d, � Z d- d. � Z d/ d0 � Z d1 d2 � Z d3 d4 � Z d d d d5 d6 � Z e j j e _ d7 d8 � Z d9 d: � Z d; d< � Z d= d> � Z! d? d@ � Z" dA dB � Z# dC dD � Z$ dE dF � Z% dG dH � Z& d dI dJ � Z' e j' j e' _ d d dK dL � Z( dM dN � Z) dO dP � Z* dQ dR � Z+ e, dS e* dT e+ � Z- dU dV � Z. dW dX � Z/ dY dZ � Z0 e, dS e/ dT e0 � Z1 d[ d\ � Z2 d] d^ � Z3 d_ d` � Z4 d da db � Z5 dc dd � Z6 de df � Z7 d S)g� _cs_matrixzAbase matrix class for compressed row and column oriented matricesNFc C sP t j | � t | � rb | j | j k r@ | r@ | j � } n | j | j � } | j | � n3t | t � r2t | � r| | _ | j \ } } t d t | | � � } t j d t | d t �� | _ t j d | � | _ t j | j | | f � d d d | �| _ q�t | � d k rbd d l m } | j | | d | �� } | j | � q�t | � d k r | \ } } } d } | d k r�t | � } t | | f d | d d �} t j | d | d | �| _ t j | d | d | �| _ t j | d | d | �| _ q�t d | j � � nc y t j | � } Wn t d | j � � Yn Xd d l m } | j | j | | d | �� � | d k r�| | _ nh | j d k ry* t | j � d } | j j � d } Wn t d � � Yn X| j | | f � | _ | d k r<t j | j d | �| _ | j d d � d S)N�maxvalr �defaultr �dtype� )� coo_matrix�shape� Zcheck_contentsT�copyz(unrecognized %s_matrix constructor usagez!unable to infer matrix dimensions� full_checkF) r �__init__r �formatr" �asformat� _set_self� isinstance�tupler r r �max�np�zerosr �float�data�indices�_swap�indptr�len�coor � __class__�array� ValueError�asarray� check_format)�selfZarg1r r r" �M�N� idx_dtyper �otherr. r/ r1 r � major_dim� minor_dim� r@ �/compressed.pyr$ s` !2 !" z_cs_matrix.__init__c C s� | d k r t | j d � S| d k r3 | d 7} | j | d | f � \ } } | j | j � \ } } | d k r� t j t | j � d | �S| d k r� t j | j � St d � � d S)Nr r r Z minlengthzaxis out of bounds���) �intr1 r0 r r+ Zbincountr r/ �diffr6 )r9 �axis�_r; r@ r@ rA �getnnzc s z_cs_matrix.getnnzc C sF | r | j � } | j | _ | j | _ | j | _ | j | _ d S)z:take the member variables of other and assign them to selfN)r" r. r/ r1 r )r9 r= r" r@ r@ rA r' t s z_cs_matrix._set_selfTc C sq | j d � \ } } | j | j � \ } } | j j j d k rY t d | j j j � | j j j d k r� t d | j j j � t | j | j f � } t j | j d | �| _ t j | j d | �| _ t | j � | _ | j j d k s| j j d k s| j j d k r't d � � t | j � | d k rct d t | j � | d f � � | j d d k r�t d � � t | j � t | j � k r�t d � � | j d t | j � k r�t d � � | j � | rm| j d k rm| j j � | k r t d | | f � � | j j � d k rCt d | � � t j | j � j � d k rmt d � � d S)z�check whether the matrix format is valid Parameters ---------- full_check : bool, optional If `True`, rigorous check, O(N) operations. Otherwise basic check, O(1) operations (default True). �row�column�iz'indptr array has non-integer dtype (%s)z(indices array has non-integer dtype (%s)r r z'data, indices, and indptr should be 1-Dz&index pointer size (%d) should be (%d)r z!index pointer should start with 0z*indices and data should have the same sizezQLast value of index pointer should be less than the size of index and data arraysz %s index values must be < %dz %s index values must be >= 0z8index pointer values must form a non-decreasing sequenceN)rH rI rB )r0 r r1 r �kindr �namer/ r r+ r7 r r. �ndimr6 r2 �prune�nnzr* �minrD )r9 r# Z major_nameZ minor_namer> r? r< r@ r@ rA r8 sD 6 z_cs_matrix.check_formatc C s9 | j � | j | | j | � d d �} | j � | S)z�Scalar version of self._binopt, for cases in which no new nonzeros are added. Produces a new spmatrix in canonical form. r" T)�sum_duplicates� _with_datar. �eliminate_zeros)r9 r= �op�resr@ r@ rA �_scalar_binopt� s ! z_cs_matrix._scalar_binoptc C sY t | � r� t j | � r4 | j | j d t j �S| d k r� t d t � | j t j | j d t j �� } | j | t j � } | | S| j | t j � Sn� t | � r� | j � | k St | � rQt d t � | j | j k r� d S| j | j k r| j | j � } | j | d � } | j t j | j d t j �� } | | Sd Sd S)Nr r zOComparing a sparse matrix with 0 using == is inefficient, try using != instead.zHComparing sparse matrices using == is inefficient, try using != instead.F�_ne_)r r+ �isnanr4 r �bool_r r �onesrV �operator�ne�eqr �todenser r% r& �_binopt)r9 r= �all_true�invrU r@ r@ rA �__eq__� s. $ $z_cs_matrix.__eq__c C s: t | � r� t j | � rP t d t � | j t j | j d t j �� } | S| d k r� t d t � | j t j | j � d t j �} | j | t j � } | | S| j | t j � Snv t | � r� | j � | k St | � r2| j | j k r� d S| j | j k r"| j | j � } | j | d � Sd Sd S)Nz:Comparing a sparse matrix with nan using != is inefficientr r z^Comparing a sparse matrix with a nonzero scalar using != is inefficient, try using == instead.TrW )r r+ rX r r r4 rZ r rY rV r[ r] r\ r r^ r r% r& r_ )r9 r= r` ra r@ r@ rA �__ne__� s, $ $ z_cs_matrix.__ne__c C s� t | � r� d | k r3 | d k r3 t d � � q�| d | � r� t | t � t j | j d t j | � �} | j | � | j | � } | j | | � S| j | | � Sn� t | � r� | | j � | � St | � r�| j | j k r� t d � � n$ | j | j k r | j | j � } | d k r;| j | | � St d t � | j t j | j � � } | j | | d k r~d n d � } | | St d � � d S) Nr �_le_�_ge_z >= and <= don't work with 0.r zinconsistent shapeszUComparing sparse matrices using >= and <= is inefficient, using <, >, or !=, instead.�_gt_�_lt_z Operands could not be compared.)rd re )re rd )r �NotImplementedErrorr r r+ �emptyr Z result_type�fillr4 r_ rV r r^ r r6 r% r& rZ )r9 r= rT �op_nameZbad_scalar_msg� other_arrr` rU r@ r@ rA � _inequality s2 ! $z_cs_matrix._inequalityc C s | j | t j d d � S)Nrg zgComparing a sparse matrix with a scalar greater than zero using < is inefficient, try using >= instead.)rm r[ �lt)r9 r= r@ r@ rA �__lt__- s z_cs_matrix.__lt__c C s | j | t j d d � S)Nrf zdComparing a sparse matrix with a scalar less than zero using > is inefficient, try using <= instead.)rm r[ �gt)r9 r= r@ r@ rA �__gt__3 s z_cs_matrix.__gt__c C s | j | t j d d � S)Nrd zgComparing a sparse matrix with a scalar greater than zero using <= is inefficient, try using > instead.)rm r[ �le)r9 r= r@ r@ rA �__le__9 s z_cs_matrix.__le__c C s | j | t j d d � S)Nre zdComparing a sparse matrix with a scalar less than zero using >= is inefficient, try using < instead.)rm r[ �ge)r9 r= r@ r@ rA �__ge__? s z_cs_matrix.__ge__c C s� t | � r1 | d k r" | j � St d � � nX t | � rk | j | j k r[ t d � � | j | d � St | � r� | j � | St Sd S)Nr z;adding a nonzero scalar to a sparse matrix is not supportedzinconsistent shapesZ_plus_) r r" rh r r r6 r_ r r^ �NotImplemented)r9 r= r@ r@ rA �__add__I s z_cs_matrix.__add__c C s | j | � S)N)rw )r9 r= r@ r@ rA �__radd__\ s z_cs_matrix.__radd__c C s� t | � r1 | d k r" | j � St d � � nX t | � rk | j | j k r[ t d � � | j | d � St | � r� | j � | St Sd S)Nr z;adding a nonzero scalar to a sparse matrix is not supportedzinconsistent shapesZ_minus_) r r" rh r r r6 r_ r r^ rv )r9 r= r@ r@ rA �__sub___ s z_cs_matrix.__sub__c C sT t | � r2 | d k r# | j � St d � � n t | � rL | | j � St Sd S)Nr z;adding a nonzero scalar to a sparse matrix is not supported)r r" rh r r^ rv )r9 r= r@ r@ rA �__rsub__r s z_cs_matrix.__rsub__c C s� t | � r | j | � St | � r| j | j k rV | j | � } | j | d � S| j d k r| | j | j � d � S| j d k r� | j | j � d � S| j d | j d k r� | j d d k r� | j | j � � S| j d | j d k r"| j d d k r"| j | j � � S| j d d k r�| j d | j d k r�t | j � j � d g f d | j d | j d f �} | j | � S| j d d k r | j d | j d k r t | j � j � d g f d | j d | j d f �} | j | � S| j d d k r�| j d | j d k r�t | j � j � d g f d | j d | j d f �} | j | � S| j d d k r�| j d | j d k r�t | j � j � d g f d | j d | j d f �} | j | � St d � � t | � r�| j | j k rj| j � } t j | j | | j | j f � j t j � j � | _ | S| j d k r�| j | j d � St j | j � | � S) zPPoint-wise multiplication by another matrix, vector, or scalar. Z_elmul_r r r zinconsistent shapes)r r )r r )r r )r r )r Z _mul_scalarr r r4 r_ �toarray�_mul_sparse_matrixZtocscr �ravelr6 r �tocoor+ �multiplyr. rH �col�viewZndarray�sizeZflatr^ )r9 r= r" �retr@ r@ rA r � sP --- - - - %z_cs_matrix.multiplyc C sx | j \ } } t j | d t | j j | j j � �} t t | j d � } | | | | j | j | j | | � | S)Nr Z_matvec) r r+ r, r r �char�getattrr r% r1 r/ r. )r9 r= r: r; �result�fnr@ r@ rA � _mul_vector� s %z_cs_matrix._mul_vectorc C s� | j \ } } | j d } t j | | f d t | j j | j j � �} t t | j d � } | | | | | j | j | j | j � | j � � | S)Nr r Z_matvecs) r r+ r, r r r� r� r r% r1 r/ r. r} )r9 r= r: r; Zn_vecsr� r� r@ r@ rA �_mul_multivector� s 4z_cs_matrix._mul_multivectorc C s7 | j \ } } | j \ } } | j | | f � d } | j | � } t | j | j | j | j f d | | �} t j | d d | �} t t | j d � } | | | t j | j d | �t j | j d | �t j | j d | �t j | j d | �| � | d } t | j | j | j | j f d | �} t j | d | �} t j | d | �} t j | d t | j | j � �} t t | j d � } | | | t j | j d | �t j | j d | �| j t j | j d | �t j | j d | �| j | | | � | j | | | f d | | f �S) Nr r r r Z _matmat_pass1Z _matmat_pass2r rB )r r0 r4 r r1 r/ r+ ri r� r r% r7 r r r. ) r9 r= r: ZK1ZK2r; Z major_axisr< r1 r� rO r/ r. r@ r@ rA r| � s> $ z _cs_matrix._mul_sparse_matrixc C sq t t | j d � } t j t | j � d t | j � �} | | j d | j d | j | j | j | � | S)z0Returns the main diagonal of the matrix Z _diagonalr r r ) r� r r% r+ ri rP r r r r1 r/ r. )r9 r� �yr@ r@ rA �diagonal� s '0z_cs_matrix.diagonalc C s t | � r� | | � ru t d t � t j | j d t j | � j �} | j | � | j | � } | j | | � S| j � | | j t j | � � } | j | | j | j f d | j d | j �} | SnG t | � r� | | j � | � St | � r | j | | � St d � � d S)NzITaking maximum (minimum) with > 0 (< 0) number results to a dense matrix.r r zOperands not compatible.)r r r r+ ri r r7 r rj r4 r_ rQ r. r/ r1 r r^ r r6 )r9 r= Znpoprk Z dense_checkrl Znew_dataZmatr@ r@ rA �_maximum_minimum s$ $ z_cs_matrix._maximum_minimumc C s | j | t j d d d � � S)NZ _maximum_c S s t j | � d k S)Nr )r+ r7 )�xr@ r@ rA �<lambda># s z$_cs_matrix.maximum.<locals>.<lambda>)r� r+ �maximum)r9 r= r@ r@ rA r� " s z_cs_matrix.maximumc C s | j | t j d d d � � S)NZ _minimum_c S s t j | � d k S)Nr )r+ r7 )r� r@ r@ rA r� & s z$_cs_matrix.minimum.<locals>.<lambda>)r� r+ �minimum)r9 r= r@ r@ rA r� % s z_cs_matrix.minimumc C s t | d � r� | | j d � d k r� t | j � } t j t | j � d d | �} | j t j � \ } } | | | <t j | � } | d d k r� | j } | d k r� | j | j k r� t d � � | j d f d | d | � St j | d | d | d | �Sd S)z~Sum the matrix over the given axis. If the axis is None, sum over both rows and columns, returning a scalar. � blocksizer r r r Nzdimensions do not matchrE �outrB �r rB �r r )r� r� )�hasattrr0 r r r+ r, r2 r1 � _minor_reduce�addZasmatrix�Tr r6 �sumr )r9 rE r r� Z res_dtyper� � major_index�valuer@ r@ rA r� , s " z_cs_matrix.sumc C s} t j t j | j � � } | j j d k rQ | j d k rQ t j | j � } n" | j | j t | j | � � } | | f S)aK Reduce nonzeros with a ufunc over the minor axis when non-empty Warning: this does not call sum_duplicates() Returns ------- major_index : array of ints Major indices where nonzero value : array of self.dtype Reduce result for nonzeros in each major_index r ) r+ Z flatnonzerorD r1 r. r� Z zeros_likeZreduceatr )r9 Zufuncr� r� r@ r@ rA r� I s ! z_cs_matrix._minor_reducec C s� | j | � \ } } | j | | � \ } } t | � r%| j d d k o\ | j d d k } | j d d k o� | j d d k } | s� | j d | j d k o� | p� | j d | j d k s� t d � � | j | j � | j � f � \ } } | j | | � | j � } | j | j } } t j | j d | j �} | r�t j t j | j d � t | � � } t j | | j d � } t j | | j d � } | rt j | | j d � } t j t j | j d � t | � � } t j | | j d � } | | | f } | | | f } nN t j | d | j �} t j | | � \ } } | j | j k rst d � � t j | � d k r�d S| j | j � | j � f � \ } } | j | | | j � � d S)Nr r z shape mismatch in assignmentr )Z _unpack_indexZ_index_to_arraysr r r6 r0 r} � _zero_manyr~ rH r� r+ r7 r. r �repeat�aranger2 ZtileZbroadcast_arraysr� � _set_many) r9 �indexr� rJ �jZ broadcast_rowZ broadcast_colZciZcj�r�crF r@ r@ rA � __setitem__c s> && ' (( 'z_cs_matrix.__setitem__c C s` d | j k r d S| j \ } } | j d k } | d k r� | rY t | | | � } n t | | | t | � � } t j | d | j j �} t j | d | j j �} | | 8} nx | r� t | | | � } n t | | | t | � � } t j | d | j j �} t j | d | j j �} | | 7} | sL| d t | � � } | | | | f <d S)Nr r )r rM rP r2 r+ r� r/ r ) r9 �values�kr: r; Z broadcastZ max_indexrJ r� r@ r@ rA �_setdiag� s( z_cs_matrix._setdiagc C s� | j | j � \ } } d d � } | | | � | | | � t j | d | j j �} t j | d | j j �} | | | | f S)Nc S sa | j � } | | k r. t d | | f � � | j � } | | k r] t d | | f � � d S)Nz index (%d) out of range (>= %d)z index (%d) out of range (< -%d))r* � IndexErrorrP )r/ Zbound�idxr@ r@ rA � check_bounds� s z1_cs_matrix._prepare_indices.<locals>.check_boundsr )r0 r r+ r7 r/ r )r9 rJ r� r: r; r� r@ r@ rA �_prepare_indices� s z_cs_matrix._prepare_indicesc C s] | j | | � \ } } } } t | � } t j | d | j j �} t j | | | j | j | | | | � } | d k r� | j � t j | | | j | j | | | | � d | k r� | | j | <d St d | j t � | d k } | | | j | | <| } | | } | | d k | 7<| | } | | d k | 7<| j | | | | � d S)z_Sets value at each (i, j) to x Here (i,j) index major and minor respectively. r r NzZChanging the sparsity structure of a %s_matrix is expensive. lil_matrix is more efficient.r rB rB )r� r2 r+ ri r/ r r �csr_sample_offsetsr1 rQ r. r r% r � _insert_many) r9 rJ r� r� r: r; � n_samples�offsetsr� �maskr@ r@ rA r� � s0 z_cs_matrix._set_manyc C s� | j | | � \ } } } } t | � } t j | d | j j �} t j | | | j | j | | | | � } | d k r� | j � t j | | | j | j | | | | � d | j | | d k <d S)z�Sets value at each (i, j) to zero, preserving sparsity structure. Here (i,j) index major and minor respectively. r r r NrB ) r� r2 r+ ri r/ r r r� r1 rQ r. )r9 rJ r� r: r; r� r� r� r@ r@ rA r� � s z_cs_matrix._zero_manyc C s� t j | d d �} | j | d d �} | j | d d �} | j | d d �} | j } t | j | j f d | j d | j �} t j | j d | �| _ t j | j d | �| _ t j | d | �} t j | d | �} g } g } t j | d d �\ } } t j | t | � � } t j | � } d } xft t | | | d d � � � D]B\ } \ } } } | j | } | j | } | j | j | | � � | j | j | | � � t j | | | � d d d � d d �\ } } t | � | | k r<| j | | | � � | j | | | � � n` | j | | | � d d d � | � | j | | | � d d d � | � t | � | | <| } q`W| j | } | j | j | d � � | j | j | d � � t j | � | _ t j | � | _ t j t j | j d d �d | �} | d d � | | 7<t j | d | �| _ | r{d | _ | j � | j d d � d S)a: Inserts new nonzero at each (i, j) with value x Here (i,j) index major and minor respectively. i, j and x must be non-empty, 1d arrays. Inserts each major group (e.g. all entries per row) at a time. Maintains has_sorted_indices property. Modifies i, j, x in place. rK Z mergesort�modeZclipr r r Z return_indexTr NZto_beginr� Fr# rB rB rB rB )r+ ZargsortZtake�has_sorted_indicesr r/ r1 r� r7 �unique�appendr2 rD � enumerate�izipr. Z concatenateZediff1dZcumsum� sort_indicesr8 )r9 rJ r� r� �orderZdo_sortr< Z indices_partsZ data_partsZuiZ ui_indptrZnew_nnzs�prevr� ZiiZjsZje�start�stopZujZ uj_indptrZnnzsr@ r@ rA r� � sT 8 2(( ' z_cs_matrix._insert_manyc C s� | j \ } } | d k r% | | 7} | d k r; | | 7} d | k oR | k n su d | k oo | k n r� t d � � | j | | f � \ } } | j | } | j | d } t j | | j | | � k | j | | � � j d | j � S)Nr zindex out of boundsr r ) r r� r0 r1 r+ �compressr/ r. r� r ) r9 rH r� r: r; r� Z minor_indexr� �endr@ r@ rA �_get_single_element@ s : z _cs_matrix._get_single_elementc C s | j | | f � \ } } | j | j � \ } } d d � } d d � } | | | � \ } } | | | � \ } } | | | | � | | | | � t j | | | j | j | j | | | | � } | d | d | d } } } | j | | | | f � } | j | | | f d | �S) z:Return a submatrix of this matrix (new matrix is created).c S s� t | t � r� | j | j } } | d k r7 d } n | d k rM | | } | d k rb | } n | d k rx | | } | | f St j | � r� | d k r� | | 7} | | d f S| d | d f Sd S)Nr r )r( �slicer� r� r+ Zisscalar)Zsl�num�i0�i1r@ r@ rA �_process_sliceY s z1_cs_matrix._get_submatrix.<locals>._process_slicec S sm d | k o | k n sG d | k o4 | k n sG | | k ri t d | | | | | | f � � d S)Nr z.index out of bounds: 0<=%d<%d, 0<=%d<%d, %d<%d)r� )r� r� r� r@ r@ rA � _in_boundsq s Gz-_cs_matrix._get_submatrix.<locals>._in_boundsr r r r )r0 r r Zget_csr_submatrixr1 r/ r. r4 )r9 Zslice0Zslice1Zshape0Zshape1r� r� r� r� Zj0Zj1Zauxr. r/ r1 r r@ r@ rA �_get_submatrixS s z_cs_matrix._get_submatrixc C s� | j | j � \ } } | j } t j t | � d | j j �} t j | | j | � | j | | f � \ } } d d l m } | | j | | f f | j d | d | j �S)Nr r )r r" ) r0 r r/ r+ ri r2 r r Z expandptrr1 r3 r r. ) r9 r" r> r? Z minor_indicesZ major_indicesrH r� r r@ r@ rA r~ � s !$z_cs_matrix.tocooc C s" | j d d � j d | d | � S)z)See the docstring for `spmatrix.toarray`.r" Fr� r� )r~ r{ )r9 r� r� r@ r@ rA r{ � s z_cs_matrix.toarrayc C sH | j | j � \ } } t j | | | j | j | j � | j � d S)zURemove zero entries from the matrix This is an *in place* operation N)r0 r r Zcsr_eliminate_zerosr1 r/ r. rN )r9 r: r; r@ r@ rA rS � s z_cs_matrix.eliminate_zerosc C s_ t | d d � s d | _ n: t | d � sX t j t | j � d | j | j � | _ | j S)a^ Determine whether the matrix has sorted indices and no duplicates Returns - True: if the above applies - False: otherwise has_canonical_format implies has_sorted_indices, so if the latter flag is False, so will the former be; if the former is found True, the latter flag is also set. �_has_sorted_indicesTF�_has_canonical_formatr ) r� r� r� r Zcsr_has_canonical_formatr2 r1 r/ �has_canonical_format)r9 r@ r@ rA Z__get_has_canonical_format� s %z%_cs_matrix.__get_has_canonical_formatc C s" t | � | _ | r d | _ d S)NT)�boolr� r� )r9 �valr@ r@ rA Z__set_has_canonical_format� s z%_cs_matrix.__set_has_canonical_format�fget�fsetc C sh | j r d S| j � | j | j � \ } } t j | | | j | j | j � | j � d | _ d S)zkEliminate duplicate matrix entries by adding them together The is an *in place* operation NT) r� r� r0 r r Zcsr_sum_duplicatesr1 r/ r. rN )r9 r: r; r@ r@ rA rQ � s z_cs_matrix.sum_duplicatesc C sA t | d � s: t j t | j � d | j | j � | _ | j S)z�Determine whether the matrix has sorted indices Returns - True: if the indices of the matrix are in sorted order - False: otherwise r� r )r� r Zcsr_has_sorted_indicesr2 r1 r/ r� )r9 r@ r@ rA Z __get_sorted� s %z_cs_matrix.__get_sortedc C s t | � | _ d S)N)r� r� )r9 r� r@ r@ rA Z __set_sorted� s z_cs_matrix.__set_sortedc C s | j � } | j � | S)z9Return a copy of this matrix with sorted indices )r" r� )r9 �Ar@ r@ rA �sorted_indices� s z_cs_matrix.sorted_indicesc C sB | j s> t j t | j � d | j | j | j � d | _ d S)z3Sort the indices of this matrix *in place* r TN)r� r Zcsr_sort_indicesr2 r1 r/ r. )r9 r@ r@ rA r� � s z_cs_matrix.sort_indicesc C s� | j | j � d } t | j � | d k r; t d � � t | j � | j k r_ t d � � t | j � | j k r� t d � � | j d | j � | _ | j d | j � | _ d S)z8Remove empty space after all non-zero elements. r r z index pointer has invalid lengthz)indices array has fewer than nnz elementsz&data array has fewer than nnz elementsN)r0 r r2 r1 r6 r/ rO r. )r9 r> r@ r@ rA rN � s z_cs_matrix.prunec C sr | r@ | j | | j j � | j j � f d | j d | j �S| j | | j | j f d | j d | j �Sd S)z�Returns a matrix with the same sparsity structure as self, but with different data. By default the structure arrays (i.e. .indptr and .indices) are copied. r r N)r4 r/ r" r1 r r )r9 r. r" r@ r@ rA rR s 'z_cs_matrix._with_datac C s� | j | � } t t | j | | j � } | j | j } t | j | j | j | j f d | �} t j | j j d | �} t j | d | �} d d d d d g } | | k r� t j | d t j �} n$ t j | d t | j | j � �} | | j d | j d t j | j d | �t j | j d | �| j t j | j d | �t j | j d | �| j | | | � | d } | d | � } | d | � } | | d k r�| j � } | j � } | j | | | f d | j �} | S)z5apply the binary operation fn to two sparse matrices.r r rW rg rf rd re r r Nr r rB )r4 r� r r% rO r r1 r/ r+ ri r rY r r r7 r. r" ) r9 r= rT r� Zmaxnnzr< r1 r/ Zbool_opsr. Z actual_nnzr� r@ r@ rA r_ s8 $ !z_cs_matrix._binoptc C s� | j | j k r t d � � | j | d � } t j | j t j � r� t j | j d | j �} | j t j � | j � \ } } d | | | f <| j � } | j | | j | j f <t j | � } n | } | S)z? Divide this matrix by a second sparse matrix. zinconsistent shapesZ_eldiv_r r )r r6 r_ r+ Z issubdtyper Zinexactri rj �nanZnonzeror~ r. rH r� Zmatrix)r9 r= r� r� rH r� r@ r@ rA �_divide_sparseF s z_cs_matrix._divide_sparse)8�__name__� __module__� __qualname__�__doc__r$ rG r r' r8 rV rb rc rm ro rq rs ru rw rx ry rz r r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r~ r{ rS Z$_cs_matrix__get_has_canonical_formatZ$_cs_matrix__set_has_canonical_format�propertyr� rQ Z_cs_matrix__get_sortedZ_cs_matrix__set_sortedr� r� r� rN rR r_ r� r@ r@ r@ rA r sn K E " = ' + & E 6 )r )&r� Z __future__r r r �__all__�warningsr r[ Znumpyr+ Zscipy._lib.sixr r� �baser r r r. r r Zdiar � r Zsputilsr r r r r r r r r r r r r@ r@ r@ rA �<module> s L
Submit
FILE
FOLDER
Name
Size
Permission
Action
__init__.cpython-35.opt-1.pyc
6603 bytes
0644
__init__.cpython-35.pyc
6603 bytes
0644
base.cpython-35.opt-1.pyc
34287 bytes
0644
base.cpython-35.pyc
34287 bytes
0644
bsr.cpython-35.opt-1.pyc
18341 bytes
0644
bsr.cpython-35.pyc
18341 bytes
0644
compressed.cpython-35.opt-1.pyc
30815 bytes
0644
compressed.cpython-35.pyc
30815 bytes
0644
construct.cpython-35.opt-1.pyc
22666 bytes
0644
construct.cpython-35.pyc
22666 bytes
0644
coo.cpython-35.opt-1.pyc
15485 bytes
0644
coo.cpython-35.pyc
15485 bytes
0644
csc.cpython-35.opt-1.pyc
6762 bytes
0644
csc.cpython-35.pyc
6762 bytes
0644
csr.cpython-35.opt-1.pyc
13129 bytes
0644
csr.cpython-35.pyc
13173 bytes
0644
data.cpython-35.opt-1.pyc
8454 bytes
0644
data.cpython-35.pyc
8454 bytes
0644
dia.cpython-35.opt-1.pyc
10965 bytes
0644
dia.cpython-35.pyc
10965 bytes
0644
dok.cpython-35.opt-1.pyc
15532 bytes
0644
dok.cpython-35.pyc
15567 bytes
0644
extract.cpython-35.opt-1.pyc
4997 bytes
0644
extract.cpython-35.pyc
4997 bytes
0644
generate_sparsetools.cpython-35.opt-1.pyc
10483 bytes
0644
generate_sparsetools.cpython-35.pyc
10483 bytes
0644
lil.cpython-35.opt-1.pyc
15956 bytes
0644
lil.cpython-35.pyc
15956 bytes
0644
setup.cpython-35.opt-1.pyc
1957 bytes
0644
setup.cpython-35.pyc
1957 bytes
0644
sparsetools.cpython-35.opt-1.pyc
672 bytes
0644
sparsetools.cpython-35.pyc
672 bytes
0644
spfuncs.cpython-35.opt-1.pyc
2264 bytes
0644
spfuncs.cpython-35.pyc
2264 bytes
0644
sputils.cpython-35.opt-1.pyc
10713 bytes
0644
sputils.cpython-35.pyc
10713 bytes
0644
N4ST4R_ID | Naxtarrr
