var searchIndex = {};
searchIndex["sprs"] = {"doc":"sprs\n====","items":[[0,"sparse","sprs","",null,null],[3,"CsMat","sprs::sparse","",null,null],[4,"CompressedStorage","","",null,null],[13,"CSR","","",0,null],[13,"CSC","","",0,null],[11,"fmt","","",0,null],[11,"eq","","",0,null],[11,"clone","","",0,null],[11,"from_slices","","Create a borrowed CsMat matrix from sliced data,\nchecking their validity",1,null],[11,"empty","","Create an empty CsMat for building purposes",1,{"inputs":[{"name":"compressedstorage"},{"name":"usize"}],"output":{"name":"csmat"}}],[11,"reserve_outer_dim","","Reserve the storage for the given additional number of nonzero data",1,null],[11,"reserve_nnz","","Reserve the storage for the given additional number of nonzero data",1,null],[11,"reserve_outer_dim_exact","","Reserve the storage for the given number of nonzero data",1,null],[11,"reserve_nnz_exact","","Reserve the storage for the given number of nonzero data",1,null],[11,"from_vecs","","Create an owned CsMat matrix from moved data,\nchecking their validity",1,{"inputs":[{"name":"compressedstorage"},{"name":"usize"},{"name":"usize"},{"name":"vec"},{"name":"vec"},{"name":"vec"}],"output":{"name":"option"}}],[11,"append_outer","","Append an outer dim to an existing matrix, compressing it in the process",1,null],[11,"append_outer_csvec","","Append an outer dim to an existing matrix, provided by a sparse vector",1,null],[11,"eye","","Identity matrix",1,{"inputs":[{"name":"compressedstorage"},{"name":"usize"}],"output":{"name":"csmat"}}],[11,"outer_iterator","","Return an outer iterator for the matrix",1,null],[11,"outer_iterator_perm","","Return an outer iterator over P*A, as well as the proper permutation\nfor iterating over the inner dimension of P*A*P^T",1,null],[11,"storage_type","","",1,null],[11,"rows","","",1,null],[11,"cols","","",1,null],[11,"nb_nonzero","","",1,null],[11,"outer_dims","","",1,null],[11,"inner_dims","","",1,null],[11,"at","","",1,null],[11,"indptr","","",1,null],[11,"indices","","",1,null],[11,"data","","",1,null],[11,"at_outer_inner","","",1,null],[11,"borrowed","","Return a view into the current matrix",1,null],[0,"vec","","",null,null],[3,"CsVec","sprs::sparse::vec","",null,null],[3,"VectorIterator","","",null,null],[3,"VectorIteratorPerm","","",null,null],[3,"NnzOrZip","","An iterator over the non zeros of either of two vector iterators, ordered,\nsuch that the sum of the vectors may be computed",null,null],[4,"NnzEither","","",null,null],[13,"Both","","",2,null],[13,"Left","","",2,null],[13,"Right","","",2,null],[11,"next","","",3,null],[11,"size_hint","","",3,null],[11,"next","","",4,null],[11,"size_hint","","",4,null],[11,"nnz_zip","","Iterate over the matching non-zero elements of both vectors\nUseful for vector dot product",3,null],[11,"nnz_or_zip","","",3,null],[11,"fmt","","",2,null],[11,"eq","","",2,null],[11,"ne","","",2,null],[11,"next","","",5,null],[11,"size_hint","","",5,null],[11,"new_borrowed","","",6,null],[11,"new_owned","","",6,{"inputs":[{"name":"usize"},{"name":"vec"},{"name":"vec"}],"output":{"name":"csvec"}}],[11,"empty","","",6,{"inputs":[{"name":"usize"}],"output":{"name":"csvec"}}],[11,"append","","Append an element to the sparse vector. Used for incremental\nbuilding of the CsVec. The append should preserve the structure\nof the vector, ie the newly added index should be strictly greater\nthan the last element of indices.",6,null],[11,"reserve","","",6,null],[11,"reserve_exact","","",6,null],[11,"clear","","",6,null],[11,"borrowed","","",6,null],[11,"iter","","",6,null],[11,"iter_perm","","",6,null],[11,"indices","","",6,null],[11,"data","","",6,null],[11,"dim","","",6,null],[11,"nnz","","",6,null],[11,"check_structure","","",6,null],[0,"permutation","sprs::sparse","",null,null],[4,"Permutation","sprs::sparse::permutation","",null,null],[13,"Identity","","",7,null],[13,"FinitePerm","","",7,null],[12,"perm","sprs::sparse::permutation::Permutation","",7,null],[12,"perm_inv","","",7,null],[11,"new","sprs::sparse::permutation","",7,{"inputs":[{"name":"vec"}],"output":{"name":"permutation"}}],[11,"identity","","",7,{"inputs":[],"output":{"name":"permutation"}}],[11,"inv","","",7,null],[11,"borrowed","","",7,null],[11,"owned_clone","","",7,null],[11,"at","","",7,null],[11,"at_inv","","",7,null],[0,"prod","sprs::sparse","",null,null],[5,"mul_acc_mat_vec_csc","sprs::sparse::prod","",null,null],[5,"mul_acc_mat_vec_csr","","",null,null],[5,"csr_mul_csr","","Perform a matrix multiplication for matrices sharing the same storage order.",null,null],[5,"csr_mul_csr_impl","","",null,null],[0,"add","sprs::sparse","",null,null],[5,"add_mat_same_storage","sprs::sparse::add","",null,{"inputs":[{"name":"csmat"},{"name":"csmat"}],"output":{"name":"csmat"}}],[0,"linalg","sprs::sparse","",null,null],[0,"cholesky","sprs::sparse::linalg","",null,null],[4,"SymmetryCheck","sprs::sparse::linalg::cholesky","",null,null],[13,"CheckSymmetry","","",8,null],[13,"DontCheckSymmetry","","",8,null],[5,"ldl_symbolic","","Perform a symbolic LDLt decomposition of a symmetric sparse matrix",null,null],[5,"ldl_numeric","","",null,null],[5,"ldl_lsolve","","",null,null],[5,"ldl_ltsolve","","",null,null],[5,"ldl_dsolve","","",null,null],[0,"symmetric","sprs::sparse","",null,null],[5,"is_symmetric","sprs::sparse::symmetric","",null,{"inputs":[{"name":"csmat"}],"output":{"name":"bool"}}]],"paths":[[4,"CompressedStorage"],[3,"CsMat"],[4,"NnzEither"],[3,"VectorIterator"],[3,"VectorIteratorPerm"],[3,"NnzOrZip"],[3,"CsVec"],[4,"Permutation"],[4,"SymmetryCheck"]]};
initSearch(searchIndex);