var searchIndex = {};
searchIndex["matrix"] = {"doc":"Matrix laboratory.","items":[[3,"Error","matrix","An error.",null,null],[0,"decomposition","","Decompositions.",null,null],[8,"SymmetricEigen","matrix::decomposition","The eigendecomposition of a symmetric matrix.",null,null],[10,"decompose","","Perform the decomposition.",0,{"inputs":[{"name":"self"}],"output":{"name":"result"}}],[0,"format","matrix","Storage formats.",null,null],[0,"banded","matrix::format","The banded format.",null,null],[3,"Banded","matrix::format::banded","A banded matrix.",null,null],[12,"rows","","The number of rows.",1,null],[12,"columns","","The number of columns.",1,null],[12,"superdiagonals","","The number of superdiagonals.",1,null],[12,"subdiagonals","","The number of subdiagonals.",1,null],[12,"values","","The values of the diagonal elements stored as a `(superdiagonals + 1 +\nsubdiagonals) × columns` matrix such that the first row corresponds to\nthe uppermost superdiagonal whereas the last row corresponds to the\nlowest supdiagonal.",1,null],[3,"Iterator","","A sparse iterator.",null,null],[11,"from","","",1,{"inputs":[{"name":"diagonal"}],"output":{"name":"self"}}],[11,"from","","",1,{"inputs":[{"name":"diagonal"}],"output":{"name":"self"}}],[11,"transpose","","",1,null],[11,"eq","","",1,null],[11,"ne","","",1,null],[11,"fmt","","",1,null],[11,"clone","","",1,null],[11,"rows","","",1,null],[11,"columns","","",1,null],[11,"new","","Create a zero matrix.",1,{"inputs":[{"name":"s"},{"name":"usize"},{"name":"usize"}],"output":{"name":"self"}}],[11,"diagonals","","Return the number of diagonals.",1,null],[11,"iter","","Return a sparse iterator.",1,null],[11,"nonzeros","","",1,null],[11,"zero","","",1,{"inputs":[{"name":"s"}],"output":{"name":"self"}}],[11,"next","","",2,null],[0,"compressed","matrix::format","The compressed format.",null,null],[3,"Compressed","matrix::format::compressed","A compressed matrix.",null,null],[12,"rows","","The number of rows.",3,null],[12,"columns","","The number of columns.",3,null],[12,"nonzeros","","The number of nonzero elements.",3,null],[12,"variant","","The format variant.",3,null],[12,"values","","The values of the nonzero elements.",3,null],[12,"indices","","The indices of rows when `variant = Column` or columns when `variant =\nRow` of the nonzero elements.",3,null],[12,"offsets","","The offsets of columns when `variant = Column` or rows when `variant =\nRow` such that the values and indices of the `i`th column when `variant\n= Column` or the `i`th row when `variant = Row` are stored starting from\n`values[j]` and `indices[j]`, respectively, where `j = offsets[i]`. The\nvector has one additional element, which is always equal to `nonzeros`.",3,null],[3,"Iterator","","A sparse iterator.",null,null],[3,"IteratorMut","","A sparse iterator allowing mutation.",null,null],[4,"Variant","","A variant of a compressed matrix.",null,null],[13,"Column","","The compressed-column variant.",4,null],[13,"Row","","The compressed-row variant.",4,null],[11,"from","","",3,{"inputs":[{"name":"conventional"}],"output":{"name":"self"}}],[11,"from","","",3,{"inputs":[{"name":"conventional"}],"output":{"name":"self"}}],[11,"from","","",3,{"inputs":[{"name":"diagonal"}],"output":{"name":"self"}}],[11,"from","","",3,{"inputs":[{"name":"diagonal"}],"output":{"name":"self"}}],[11,"multiply","","",3,null],[11,"multiply_into","","",3,null],[11,"multiply_self","","",3,null],[11,"transpose","","",3,null],[11,"eq","","",3,null],[11,"ne","","",3,null],[11,"fmt","","",3,null],[11,"clone","","",3,null],[11,"eq","","",4,null],[11,"fmt","","",4,null],[11,"clone","","",4,null],[11,"rows","","",3,null],[11,"columns","","",3,null],[11,"new","","Create a zero matrix.",3,{"inputs":[{"name":"s"},{"name":"variant"}],"output":{"name":"self"}}],[11,"with_capacity","","Create a zero matrix with a specific capacity.",3,{"inputs":[{"name":"s"},{"name":"variant"},{"name":"usize"}],"output":{"name":"self"}}],[11,"get","","Read an element.",3,null],[11,"set","","Assign a value to an element.",3,null],[11,"iter","","Return a sparse iterator.",3,null],[11,"iter_mut","","Return a sparse iterator allowing mutation.",3,null],[11,"resize","","Resize the matrix.",3,null],[11,"retain","","Retain the elements that satisfy a condition and discard the rest.",3,null],[11,"nonzeros","","",3,null],[11,"zero","","",3,{"inputs":[{"name":"s"}],"output":{"name":"self"}}],[11,"flip","","Return the other variant.",4,null],[11,"next","","",5,null],[11,"next","","",6,null],[0,"conventional","matrix::format","The conventional format.",null,null],[3,"Conventional","matrix::format::conventional","A conventional matrix.",null,null],[12,"rows","","The number of rows.",7,null],[12,"columns","","The number of columns.",7,null],[12,"values","","The values stored in the column-major order.",7,null],[11,"into","","",7,null],[11,"multiply","","",7,null],[11,"multiply_into","","",7,null],[11,"multiply_into","","",7,null],[11,"multiply_self","","",7,null],[11,"transpose","","",7,null],[11,"eq","","",7,null],[11,"ne","","",7,null],[11,"fmt","","",7,null],[11,"clone","","",7,null],[11,"rows","","",7,null],[11,"columns","","",7,null],[11,"new","","Create a zero matrix.",7,{"inputs":[{"name":"s"}],"output":{"name":"self"}}],[11,"from_slice","","Create a matrix from a slice.",7,null],[11,"from_vec","","Create a matrix from a vector.",7,{"inputs":[{"name":"s"},{"name":"vec"}],"output":{"name":"self"}}],[11,"with_uninitialized","","Create a matrix with uninitialized elements.",7,{"inputs":[{"name":"s"}],"output":{"name":"self"}}],[11,"erase","","Zero out the content.",7,null],[11,"resize","","Resize.",7,null],[11,"nonzeros","","",7,null],[11,"zero","","",7,{"inputs":[{"name":"s"}],"output":{"name":"self"}}],[11,"index","","",7,null],[11,"index_mut","","",7,null],[11,"deref","","",7,null],[11,"deref_mut","","",7,null],[0,"diagonal","matrix::format","The diagonal format.",null,null],[3,"Diagonal","matrix::format::diagonal","A diagonal matrix.",null,null],[12,"rows","","The number of rows.",8,null],[12,"columns","","The number of columns.",8,null],[12,"values","","The values of the diagonal elements.",8,null],[11,"from","matrix::format::conventional","",7,{"inputs":[{"name":"diagonal"}],"output":{"name":"self"}}],[11,"from","","",7,{"inputs":[{"name":"diagonal"}],"output":{"name":"self"}}],[11,"into","matrix::format::diagonal","",8,null],[11,"transpose","","",8,null],[11,"eq","","",8,null],[11,"ne","","",8,null],[11,"fmt","","",8,null],[11,"clone","","",8,null],[11,"rows","","",8,null],[11,"columns","","",8,null],[11,"from_slice","","Create a matrix from a slice.",8,null],[11,"from_vec","","Create a matrix from a vector.",8,{"inputs":[{"name":"s"},{"name":"vec"}],"output":{"name":"self"}}],[11,"nonzeros","","",8,null],[11,"zero","","",8,{"inputs":[{"name":"s"}],"output":{"name":"self"}}],[11,"deref","","",8,null],[11,"deref_mut","","",8,null],[0,"packed","matrix::format","The packed format.",null,null],[3,"Packed","matrix::format::packed","A packed matrix.",null,null],[12,"size","","The number of rows or columns.",9,null],[12,"variant","","The format variant.",9,null],[12,"values","","The values of the lower triangle when `variant = Lower` or upper\ntriangle when `variant = Upper` stored by columns.",9,null],[4,"Variant","","A variant of a packed matrix.",null,null],[13,"Lower","","The lower-triangular variant.",10,null],[13,"Upper","","The upper-triangular variant.",10,null],[11,"from","matrix::format::conventional","",7,{"inputs":[{"name":"packed"}],"output":{"name":"self"}}],[11,"from","","",7,{"inputs":[{"name":"packed"}],"output":{"name":"self"}}],[11,"transpose","matrix::format::packed","",9,null],[11,"eq","","",9,null],[11,"ne","","",9,null],[11,"fmt","","",9,null],[11,"clone","","",9,null],[11,"eq","","",10,null],[11,"fmt","","",10,null],[11,"clone","","",10,null],[11,"rows","","",9,null],[11,"columns","","",9,null],[11,"new","","Create a zero matrix.",9,{"inputs":[{"name":"s"},{"name":"variant"}],"output":{"name":"self"}}],[11,"nonzeros","","",9,null],[11,"zero","","",9,{"inputs":[{"name":"s"}],"output":{"name":"self"}}],[11,"flip","","Return the other variant.",10,null],[0,"operation","matrix","Basic operations.",null,null],[8,"Multiply","matrix::operation","A multiplication.",null,null],[10,"multiply","","Perform the multiplication.",11,null],[8,"MultiplyInto","","A multiplication that adds the result to a third object.",null,null],[10,"multiply_into","","Perform the multiplication.",12,null],[8,"MultiplySelf","","A multiplication that overwrites the receiver with the result.",null,null],[10,"multiply_self","","Perform the multiplication.",13,null],[8,"ScaleSelf","","A scaling that overwrites the receiver with the result.",null,null],[10,"scale_self","","Perform the scaling.",14,null],[8,"Transpose","","The transpose.",null,null],[10,"transpose","","Perform the transpose.",15,null],[0,"prelude","matrix","Reexports of modules, traits, and types.",null,null],[8,"Element","matrix::prelude","An element.",null,null],[10,"is_zero","","Check if the element is zero.",16,null],[10,"zero","","Return the zero element.",16,{"inputs":[],"output":{"name":"self"}}],[8,"Position","","A position.",null,null],[10,"row","","Return the row.",17,null],[10,"column","","Return the column.",17,null],[11,"coordinates","","Return the row and column.",17,null],[8,"Size","","A size.",null,null],[10,"rows","","Return the number of rows.",18,null],[10,"columns","","Return the number of columns.",18,null],[11,"dimensions","","Return the number of rows and columns.",18,null],[6,"Result","matrix","A result.",null,null],[8,"Matrix","","A matrix.",null,null],[16,"Element","","The element type.",19,null],[10,"nonzeros","","Count nonzero elements.",19,null],[10,"zero","","Create a zero matrix.",19,{"inputs":[{"name":"s"}],"output":{"name":"self"}}],[8,"Element","","An element.",null,null],[10,"is_zero","","Check if the element is zero.",16,null],[10,"zero","","Return the zero element.",16,{"inputs":[],"output":{"name":"self"}}],[8,"Number","","A number.",null,null],[8,"Position","","A position.",null,null],[10,"row","","Return the row.",17,null],[10,"column","","Return the column.",17,null],[11,"coordinates","matrix::prelude","Return the row and column.",17,null],[8,"Size","matrix","A size.",null,null],[10,"rows","","Return the number of rows.",18,null],[10,"columns","","Return the number of columns.",18,null],[11,"dimensions","matrix::prelude","Return the number of rows and columns.",18,null],[11,"eq","matrix","",20,null],[11,"ne","","",20,null],[11,"fmt","","",20,null],[11,"clone","","",20,null],[11,"fmt","","",20,null],[11,"description","","",20,null],[14,"matrix!","","A macro for composing matrices in the natural order.",null,null],[11,"coordinates","matrix::prelude","Return the row and column.",17,null],[11,"dimensions","","Return the number of rows and columns.",18,null],[11,"from","matrix::format::conventional","",7,{"inputs":[{"name":"banded"}],"output":{"name":"self"}}],[11,"from","","",7,{"inputs":[{"name":"banded"}],"output":{"name":"self"}}],[11,"from","","",7,{"inputs":[{"name":"compressed"}],"output":{"name":"self"}}],[11,"from","","",7,{"inputs":[{"name":"compressed"}],"output":{"name":"self"}}],[11,"multiply_into","","",7,null]],"paths":[[8,"SymmetricEigen"],[3,"Banded"],[3,"Iterator"],[3,"Compressed"],[4,"Variant"],[3,"Iterator"],[3,"IteratorMut"],[3,"Conventional"],[3,"Diagonal"],[3,"Packed"],[4,"Variant"],[8,"Multiply"],[8,"MultiplyInto"],[8,"MultiplySelf"],[8,"ScaleSelf"],[8,"Transpose"],[8,"Element"],[8,"Position"],[8,"Size"],[8,"Matrix"],[3,"Error"]]};
initSearch(searchIndex);