Submit
Path:
~
/
/
proc
/
thread-self
/
root
/
opt
/
alt
/
python35
/
lib64
/
python3.5
/
site-packages
/
scipy
/
sparse
/
__pycache__
/
File Content:
bsr.cpython-35.opt-1.pyc
0��W0Z � @ s! d Z d d l m Z m Z m Z d Z d d g Z d d l m Z d d l Z d d l m Z m Z d d l m Z d d l m Z m Z m Z d d l m Z m Z m Z m Z m Z d d l m Z d d l m Z m Z m Z m Z m Z m! Z! Gd d � d e e � Z" d d � Z# d S)z)Compressed Block Sparse Row matrix format� )�division�print_function�absolute_importzrestructuredtext en� bsr_matrix�isspmatrix_bsr)�warnN� )� _data_matrix� _minmax_mixin)� _cs_matrix)� isspmatrix�_formats�spmatrix)�isshape�getdtype� to_native�upcast�get_index_dtype)� _sparsetools)� bsr_matvec� bsr_matvecs�csr_matmat_pass1�bsr_matmat_pass2� bsr_transpose�bsr_sort_indicesc @ s� e Z d Z d Z d Z d d d d d d � Z d d d � Z d d � Z e d e � Z d d d � Z e j j e _ 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 d# d$ � Z d d% d& � Z e j j e _ d d' d( � Z e j j e _ d d) d* � Z d d d+ d, � Z e j j e _ d- d. � Z d/ d0 � Z d1 d2 � Z d3 d4 � Z d d d5 d6 � Z d d7 d8 � Z d S)9r a� Block Sparse Row matrix This can be instantiated in several ways: bsr_matrix(D, [blocksize=(R,C)]) where D is a dense matrix or 2-D ndarray. bsr_matrix(S, [blocksize=(R,C)]) with another sparse matrix S (equivalent to S.tobsr()) bsr_matrix((M, N), [blocksize=(R,C), dtype]) to construct an empty matrix with shape (M, N) dtype is optional, defaulting to dtype='d'. bsr_matrix((data, ij), [blocksize=(R,C), shape=(M, N)]) where ``data`` and ``ij`` satisfy ``a[ij[0, k], ij[1, k]] = data[k]`` bsr_matrix((data, indices, indptr), [shape=(M, N)]) is the standard BSR representation where the block column indices for row i are stored in ``indices[indptr[i]:indptr[i+1]]`` and their corresponding block values are stored in ``data[ indptr[i]: indptr[i+1] ]``. If the shape parameter is not supplied, the matrix dimensions are inferred from the index arrays. 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 Number of nonzero elements data Data array of the matrix indices BSR format index array indptr BSR format index pointer array blocksize Block size of the matrix has_sorted_indices Whether indices are sorted Notes ----- Sparse matrices can be used in arithmetic operations: they support addition, subtraction, multiplication, division, and matrix power. **Summary of BSR format** The Block Compressed Row (BSR) format is very similar to the Compressed Sparse Row (CSR) format. BSR is appropriate for sparse matrices with dense sub matrices like the last example below. Block matrices often arise in vector-valued finite element discretizations. In such cases, BSR is considerably more efficient than CSR and CSC for many sparse arithmetic operations. **Blocksize** The blocksize (R,C) must evenly divide the shape of the matrix (M,N). That is, R and C must satisfy the relationship ``M % R = 0`` and ``N % C = 0``. If no blocksize is specified, a simple heuristic is applied to determine an appropriate blocksize. Examples -------- >>> from scipy.sparse import bsr_matrix >>> bsr_matrix((3, 4), dtype=np.int8).toarray() array([[0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]], dtype=int8) >>> row = np.array([0, 0, 1, 2, 2, 2]) >>> col = np.array([0, 2, 2, 0, 1, 2]) >>> data = np.array([1, 2, 3 ,4, 5, 6]) >>> bsr_matrix((data, (row, col)), shape=(3, 3)).toarray() array([[1, 0, 2], [0, 0, 3], [4, 5, 6]]) >>> indptr = np.array([0, 2, 3, 6]) >>> indices = np.array([0, 2, 2, 0, 1, 2]) >>> data = np.array([1, 2, 3, 4, 5, 6]).repeat(4).reshape(6, 2, 2) >>> bsr_matrix((data,indices,indptr), shape=(6, 6)).toarray() array([[1, 1, 0, 0, 2, 2], [1, 1, 0, 0, 2, 2], [0, 0, 0, 0, 3, 3], [0, 0, 0, 0, 3, 3], [4, 4, 5, 5, 6, 6], [4, 4, 5, 5, 6, 6]]) ZbsrNFc C s) t j | � t | � r\ t | � r: | r: | j � } n | j d | � } | j | � n�t | t � r�t | � r�| | _ | j \ } } | d k r� d } n( t | � s� t d | � � t | � } t j d | t | d t �� | _ | \ } } | | d k s | | d k r)t d � � t d t | | | | | | � � } t j d d | �| _ t j | | d d | �| _ q3t | � d k r�d d l m } | j | | d | �j d | � � q3t | � d k r�| \ } } } d } | d k rt | � } | d k r4t | t | � � } t | | f d | d d �} t j | d | d | �| _ t j | d | d | �| _ t j | d | d t | | � �| _ q3t d � � nl y t j | � } Wn t d | j � � Yn Xd d l m } | | d | �j d | � } | j | � | d k rK| | _ nv | j d k r�y* t | j � d } | j j � d } Wn t d � � Yn' X| j \ } } | | | | f | _ | j d k r�| d k r�t d � � n | | _ | d k r| j j | � | _ | j d d � d S)N� blocksizer zinvalid blocksize=%sr �defaultz#shape must be multiple of blocksize�maxval�dtype� )� coo_matrix� Zcheck_contentsT�copyz)unrecognized bsr_matrix constructor usagez+unrecognized form for %s_matrix constructorz!unable to infer matrix dimensionszneed to infer shape� full_checkF)r r )r ) r �__init__r r r" �tobsrZ _set_self� isinstance�tupler �shape� ValueError�np�zerosr �float�datar �max�indices�indptr�len�coor �array�asarray�formatr �astype� check_format)�selfZarg1r( r r" r �M�N�R�C� idx_dtyper r- r/ r0 r � r> �/bsr.pyr$ x s| % &#( * zbsr_matrix.__init__Tc C s� | j \ } } | j \ } } | j j j d k rJ t d | j j j � | j j j d k rv 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 rt d � � | j j d k r$t d � � t | j � | | d k rht 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 � | r| j d k r| j j � | | k r4t d | | | j j � f � � | j j � d k rUt d � � t j | j � j � d k rt d � � d S)z�check whether the matrix format is valid *Parameters*: full_check: True - rigorous check, O(N) operations : default False - basic check, O(1) operations �iz'indptr array has non-integer dtype (%s)z(indices array has non-integer dtype (%s)r r z!indices, and indptr should be 1-Dr! zdata should be 3-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-column index values must be < %d (now max %d)z column index values must be >= 0z8index pointer values must form a non-decreasing sequenceN���)r( r r0 r �kindr �namer/ r r* r4 r r- �ndimr) r1 �prune�nnzr. �min�diff)r8 r# r9 r: r; r< r= r> r> r? r7 � sD $ ! # zbsr_matrix.check_formatc C s | j j d d � S)Nr )r- r( )r8 r> r> r? �_get_blocksize s zbsr_matrix._get_blocksize�fgetc C s@ | d k r t d � � | j \ } } t | j d | | � S)Nz5getnnz over an axis is not implemented for BSR formatr rA )�NotImplementedErrorr �intr0 )r8 �axisr; r< r> r> r? �getnnz s zbsr_matrix.getnnzc C s@ t | j � d } d | j | j j | j f | j | f S)Nr z\<%dx%d sparse matrix of type '%s' with %d stored elements (blocksize = %dx%d) in %s format>)r Z getformatr( r �typerF r )r8 r5 r> r> r? �__repr__! s zbsr_matrix.__repr__c C s� | j \ } } | j \ } } t j t | | � d t | j � �} t j | | | | | | | j | j t j | j � | � | S)z0Returns the main diagonal of the matrix r ) r( r r* �emptyrG r r r Z bsr_diagonalr0 r/ �ravelr- )r8 r9 r: r; r< �yr> r> r? �diagonal( s ' zbsr_matrix.diagonalc C s t � d S)N)rK )r8 Zindr> r> r? �getdata7 s zbsr_matrix.getdatac C s t � d S)N)rK )r8 �keyr> r> r? � __getitem__: s zbsr_matrix.__getitem__c C s t � d S)N)rK )r8 rV �valr> r> r? � __setitem__= s zbsr_matrix.__setitem__c C s | | S)Nr> )r8 �otherr> r> r? �matvecD s zbsr_matrix.matvecc C s | | S)Nr> )r8 rZ r> r> r? �matmatG s zbsr_matrix.matmatc C s� | j \ } } | j \ } } t j | j d d t | j | j � �} t | | | | | | | j | j | j j � | | � | S)Nr r ) r( r r* r+ r r r r0 r/ r- rR )r8 rZ r9 r: r; r< �resultr> r> r? � _mul_vectorJ s + zbsr_matrix._mul_vectorc C s� | j \ } } | j \ } } | j d } t j | | f d t | j | j � �} t | | | | | | | | j | j | j j � | j � | j � � | S)Nr r ) r r( r* r+ r r r r0 r/ r- rR )r8 rZ r; r< r9 r: Zn_vecsr] r> r> r? �_mul_multivectorV s *zbsr_matrix._mul_multivectorc C s� | j \ } } | j \ } } | j \ } } t | � rI | j d } n d } d d l m } | | � r� | d k r� | j d | | f d d � } n | j d | | f � } t | j | j | j | j f d | | | | �} t j | j j d | �} t | | | | | j j | � | j j | � | j j | � | j j | � | � | d } t | j | j | j | j f d | �} | j | � } t j | d | �} t j | | | d t | j | j � �} t | | | | | | | | j j | � | j j | � t j | j � | j j | � | j j | � t j | j � | | | � | j d | | � } t | | | f d | | f d | | f �S) Nr )�isspmatrix_csrr r" Fr r r( rA rA )r( r r Zcsrr` r% r r0 r/ r* rQ r r6 r r r rR r- �reshaper )r8 rZ r9 ZK1ZK2r: r; �nr< r` r= r0 �bnnzr/ r- r> r> r? �_mul_sparse_matrixc sN ! ,z bsr_matrix._mul_sparse_matrixc C sC | d | j g k r+ | j � j d | � S| r; | j � S| Sd S)a Convert this matrix into Block Sparse Row Format. With copy=False, the data/indices may be shared between this matrix and the resultant bsr_matrix. If blocksize=(R, C) is provided, it will be used for determining block size of the bsr_matrix. Nr )r �tocsrr% r" )r8 r r" r> r> r? r% � s zbsr_matrix.tobsrc C s | j d d � j d | � S)Nr" F)�tocoore )r8 r" r> r> r? re � s zbsr_matrix.tocsrc C s | j d d � j d | � S)Nr" F)rf �tocsc)r8 r" r> r> r? rg � s zbsr_matrix.tocscc C s� | j \ } } | j \ } } t j | j � } | j j t j t j � j k r� | j t j � } t j | | k � r� t d � � | } | t j | | � j | � } | j | | � j d | | � } | t j t j | � j d d � d | f � 7} | j d � } | | j j | | � j d | | � } | t j t j | � | d f � 7} | j d � } | j j d � } | r�| j � } d d l m } | | | | f f d | j �S) z�Convert this matrix to COOrdinate format. When copy=False the data array will be shared between this matrix and the resultant coo_matrix. zMatrix too big to convertr )r r( rA rA rA rA rA rA )r( r r* rH r0 r �itemsizeZintpr6 �anyr) Zarange�repeatra Ztiler/ r- r" r2 r ) r8 r" r9 r: r; r< Z indptr_diffZindptr_diff_limited�row�colr- r r> r> r? rf � s( ! "1)% zbsr_matrix.tocooc C sJ | d k r t d � � | j \ } } | j \ } } | j | | } | j d k r� t | | f d | | f d | j d | �St j | | d d | j j �} t j | d | j j �} t j | | | f d | j j �} t | | | | | | | j | j | j j � | | | j � � t | | | f d | | f d | �S)NzoSparse matrices do not support an 'axes' parameter because swapping dimensions is the only logical permutation.r r r r" r r( ) r) r r( rF r r r* rQ r0 r/ r- r rR ) r8 Zaxesr" r; r< r9 r: ZNBLKr0 r/ r- r> r> r? � transpose� s #$zbsr_matrix.transposec C s� | j \ } } | j \ } } | j d k j d | | � j d d � } | j � d } t | � d k ro d S| j | | j d t | � � <t j | | | | | j | j | � | j � d S)Nr r rM rA ) r r( r- ra �sumZnonzeror1 r Zcsr_eliminate_zerosr0 r/ rE )r8 r; r< r9 r: �maskZnonzero_blocksr> r> r? �eliminate_zeros� s + zbsr_matrix.eliminate_zerosc C s= | j r d S| j � | j \ } } | j \ } } | | } d } d } x� t | � D]� } | } | j | d } x� | | k r| j | } | j | } | d 7} x> | | k r� | j | | k r� | | j | 7} | d 7} q� W| | j | <| | j | <| d 7} qx W| | j | d <qX W| j � d | _ d S)zkEliminate duplicate matrix entries by adding them together The is an *in place* operation Nr r T) Zhas_canonical_format� sort_indicesr r( �ranger0 r/ r- rE ) r8 r; r< r9 r: Zn_rowrF Zrow_endr@ Zjj�j�xr> r> r? �sum_duplicates s0 " zbsr_matrix.sum_duplicatesc C sk | j r d S| j \ } } | j \ } } t | | | | | | | j | j | j j � � d | _ d S)z3Sort the indices of this matrix *in place* NT)Zhas_sorted_indicesr r( r r0 r/ r- rR )r8 r; r< r9 r: r> r> r? rq 0 s 3zbsr_matrix.sort_indicesc C s� | j \ } } | j \ } } t | j � | | d k rG t d � � | j d } t | j � | k ru t d � � t | j � | k r� t d � � | j d | � | _ | j d | � | _ d S)z9 Remove empty space after all non-zero elements. r z index pointer has invalid lengthz"indices array has too few elementsz data array has too few elementsNrA )r r( r1 r0 r) r/ r- )r8 r; r< r9 r: rc r> r> r? rE = s zbsr_matrix.prunec C s; | j | d | j �} t t | j | | j � } | j \ } } t | j � t | 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 | | | | j j | � | j j | � | j | j j | � | j j | � t j | j � | | | � | d } | d | � } | d | | | � } | | d k r| j � } | j � } | j d | | � } | j | | | f d | j �S)z5Apply the binary operation fn to two sparse matrices.r r r Z_ne_Z_lt_Z_gt_Z_le_Z_ge_r r Nr r( rA rA )� __class__r �getattrr r5 r1 r- r r0 r/ r* rQ r( Zbool_r r r6 rR r" ra )r8 rZ �opZin_shapeZ out_shape�fnr; r< Zmax_bnnzr= r0 r/ Zbool_opsr- Z actual_bnnzr> r> r? �_binoptR s> #,% zbsr_matrix._binoptc 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)rv r/ r" r0 r( r )r8 r- r" r> r> r? � _with_data� s 'zbsr_matrix._with_data)!�__name__� __module__� __qualname__�__doc__r5 r$ r7 rI �propertyr rN r rP rT rU rW rY r[ r\ r^ r_ rd r% re rg rf rm rp ru rq rE rz r{ r> r> r> r? r s@ _^> =# ! 1c C s t | t � S)N)r& r )rt r> r> r? r � s )$r Z __future__r r r Z __docformat__�__all__�warningsr Znumpyr* r- r r � compressedr �baser r r Zsputilsr r r r r � r r r r r r r r r r> r> r> r? �<module> s (.� � �
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
