var searchIndex = {};
searchIndex["matrix"] = {"doc":"Matrix storage schemes.","items":[[0,"banded","matrix","The banded storage.",null,null],[3,"Banded","matrix::banded","A banded matrix.",null,null],[12,"rows","","The number of rows.",0,null],[12,"columns","","The number of columns.",0,null],[12,"superdiagonals","","The number of superdiagonals.",0,null],[12,"subdiagonals","","The number of subdiagonals.",0,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.",0,null],[3,"Iterator","","A sparse iterator.",null,null],[11,"eq","","",0,null],[11,"ne","","",0,null],[11,"fmt","","",0,null],[11,"clone","","",0,null],[11,"rows","","",0,null],[11,"columns","","",0,null],[11,"new","","Create a zero matrix.",0,{"inputs":[{"name":"s"},{"name":"usize"},{"name":"usize"}],"output":{"name":"self"}}],[11,"diagonals","","Return the number of diagonals.",0,null],[11,"iter","","Return a sparse iterator.",0,null],[11,"nonzeros","","",0,null],[11,"transpose","","",0,null],[11,"zero","","",0,{"inputs":[{"name":"s"}],"output":{"name":"self"}}],[11,"next","","",1,null],[0,"compressed","matrix","The compressed storage.",null,null],[3,"Compressed","matrix::compressed","A compressed matrix.",null,null],[12,"rows","","The number of rows.",2,null],[12,"columns","","The number of columns.",2,null],[12,"nonzeros","","The number of nonzero elements.",2,null],[12,"format","","The storage format.",2,null],[12,"values","","The values of the nonzero elements.",2,null],[12,"indices","","The indices of rows when `format = Column` or columns when `format =\nRow` of the nonzero elements.",2,null],[12,"offsets","","The offsets of columns when `format = Column` or rows when `format =\nRow` such that the values and indices of the `i`th column when `format =\nColumn` or the `i`th row when `format = 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`.",2,null],[3,"Iterator","","A sparse iterator.",null,null],[3,"IteratorMut","","A sparse iterator allowing mutation.",null,null],[4,"Format","","A format of a compressed matrix.",null,null],[13,"Column","","The compressed-column format.",3,null],[13,"Row","","The compressed-row format.",3,null],[11,"eq","","",2,null],[11,"ne","","",2,null],[11,"fmt","","",2,null],[11,"clone","","",2,null],[11,"eq","","",3,null],[11,"fmt","","",3,null],[11,"clone","","",3,null],[11,"rows","","",2,null],[11,"columns","","",2,null],[11,"new","","Create a zero matrix.",2,{"inputs":[{"name":"s"},{"name":"format"}],"output":{"name":"self"}}],[11,"with_capacity","","Create a zero matrix with a specific capacity.",2,{"inputs":[{"name":"s"},{"name":"format"},{"name":"usize"}],"output":{"name":"self"}}],[11,"get","","Read an element.",2,null],[11,"set","","Assign a value to an element.",2,null],[11,"iter","","Return a sparse iterator.",2,null],[11,"iter_mut","","Return a sparse iterator allowing mutation.",2,null],[11,"resize","","Resize the matrix.",2,null],[11,"retain","","Retain the elements that satisfy a condition and discard the rest.",2,null],[11,"nonzeros","","",2,null],[11,"transpose","","",2,null],[11,"zero","","",2,{"inputs":[{"name":"s"}],"output":{"name":"self"}}],[11,"from","","",2,{"inputs":[{"name":"conventional"}],"output":{"name":"self"}}],[11,"from","","",2,{"inputs":[{"name":"conventional"}],"output":{"name":"self"}}],[11,"flip","","Return the other format.",3,null],[11,"next","","",4,null],[11,"next","","",5,null],[0,"conventional","matrix","The conventional storage.",null,null],[3,"Conventional","matrix::conventional","A conventional matrix.",null,null],[12,"rows","","The number of rows.",6,null],[12,"columns","","The number of columns.",6,null],[12,"values","","The values stored in the column-major order.",6,null],[11,"eq","","",6,null],[11,"ne","","",6,null],[11,"fmt","","",6,null],[11,"clone","","",6,null],[11,"rows","","",6,null],[11,"columns","","",6,null],[11,"new","","Create a zero matrix.",6,{"inputs":[{"name":"s"}],"output":{"name":"self"}}],[11,"from_slice","","Create a matrix from a slice.",6,null],[11,"from_vec","","Create a matrix from a vector.",6,{"inputs":[{"name":"vec"},{"name":"s"}],"output":{"name":"self"}}],[11,"nonzeros","","",6,null],[11,"transpose","","",6,null],[11,"zero","","",6,{"inputs":[{"name":"s"}],"output":{"name":"self"}}],[11,"index","","",6,null],[11,"index_mut","","",6,null],[11,"into","","",6,null],[11,"deref","","",6,null],[11,"deref_mut","","",6,null],[0,"diagonal","matrix","The diagonal storage.",null,null],[3,"Diagonal","matrix::diagonal","A diagonal matrix.",null,null],[12,"rows","","The number of rows.",7,null],[12,"columns","","The number of columns.",7,null],[12,"values","","The values of the diagonal elements.",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,"from_slice","","Create a matrix from a slice.",7,null],[11,"from_vec","","Create a matrix from a vector.",7,{"inputs":[{"name":"vec"},{"name":"s"}],"output":{"name":"self"}}],[11,"nonzeros","","",7,null],[11,"transpose","","",7,null],[11,"zero","","",7,{"inputs":[{"name":"s"}],"output":{"name":"self"}}],[11,"from","matrix::banded","",0,{"inputs":[{"name":"diagonal"}],"output":{"name":"self"}}],[11,"from","","",0,{"inputs":[{"name":"diagonal"}],"output":{"name":"self"}}],[11,"from","matrix::compressed","",2,{"inputs":[{"name":"diagonal"}],"output":{"name":"self"}}],[11,"from","","",2,{"inputs":[{"name":"diagonal"}],"output":{"name":"self"}}],[11,"from","matrix::conventional","",6,{"inputs":[{"name":"diagonal"}],"output":{"name":"self"}}],[11,"from","","",6,{"inputs":[{"name":"diagonal"}],"output":{"name":"self"}}],[11,"into","matrix::diagonal","",7,null],[11,"deref","","",7,null],[11,"deref_mut","","",7,null],[0,"packed","matrix","The packed storage.",null,null],[3,"Packed","matrix::packed","A packed matrix.",null,null],[12,"size","","The number of rows or columns.",8,null],[12,"format","","The storage format.",8,null],[12,"values","","The values of the lower triangle when `format = Lower` or upper triangle\nwhen `format = Upper` stored by columns.",8,null],[4,"Format","","A format of a packed matrix.",null,null],[13,"Lower","","The lower-triangular format.",9,null],[13,"Upper","","The upper-triangular format.",9,null],[11,"eq","","",8,null],[11,"ne","","",8,null],[11,"fmt","","",8,null],[11,"clone","","",8,null],[11,"eq","","",9,null],[11,"fmt","","",9,null],[11,"clone","","",9,null],[11,"rows","","",8,null],[11,"columns","","",8,null],[11,"new","","Create a zero matrix.",8,{"inputs":[{"name":"s"},{"name":"format"}],"output":{"name":"self"}}],[11,"nonzeros","","",8,null],[11,"transpose","","",8,null],[11,"zero","","",8,{"inputs":[{"name":"s"}],"output":{"name":"self"}}],[11,"from","matrix::conventional","",6,{"inputs":[{"name":"packed"}],"output":{"name":"self"}}],[11,"from","","",6,{"inputs":[{"name":"packed"}],"output":{"name":"self"}}],[11,"flip","matrix::packed","Return the other format.",9,null],[8,"Matrix","matrix","A matrix.",null,null],[16,"Element","","The element type.",10,null],[10,"nonzeros","","Count the number of nonzero elements.",10,null],[10,"transpose","","Transpose the matrix.",10,null],[10,"zero","","Create a zero matrix.",10,{"inputs":[{"name":"s"}],"output":{"name":"self"}}],[8,"Element","","An element.",null,null],[10,"is_zero","","Check if the element is zero.",11,null],[10,"zero","","Return the zero element.",11,{"inputs":[],"output":{"name":"self"}}],[8,"Position","","A position.",null,null],[10,"row","","Return the row.",12,null],[10,"column","","Return the column.",12,null],[11,"coordinates","","Return the row and column.",12,null],[8,"Size","","A size.",null,null],[10,"rows","","Return the number of rows.",13,null],[10,"columns","","Return the number of columns.",13,null],[11,"dimensions","","Return the number of rows and columns.",13,null],[11,"coordinates","","Return the row and column.",12,null],[11,"dimensions","","Return the number of rows and columns.",13,null],[11,"from","matrix::conventional","",6,{"inputs":[{"name":"banded"}],"output":{"name":"self"}}],[11,"from","","",6,{"inputs":[{"name":"banded"}],"output":{"name":"self"}}],[11,"from","","",6,{"inputs":[{"name":"compressed"}],"output":{"name":"self"}}],[11,"from","","",6,{"inputs":[{"name":"compressed"}],"output":{"name":"self"}}]],"paths":[[3,"Banded"],[3,"Iterator"],[3,"Compressed"],[4,"Format"],[3,"Iterator"],[3,"IteratorMut"],[3,"Conventional"],[3,"Diagonal"],[3,"Packed"],[4,"Format"],[8,"Matrix"],[8,"Element"],[8,"Position"],[8,"Size"]]};
initSearch(searchIndex);