compressed1d.html

一个通用的数学库

    </TR>

    <TR><TD VALIGN="TOP"><TT>
     
    <TT>compressed1D () </TT>
    
    
    </TT></TD>
    <TD><FONT FACE=Times SIZE=3>
      &nbsp; 
    </FONT></TD>
    <TD><FONT FACE=Times SIZE=3>
      Default Constructor  
    </FONT></TD>	
    </TR>

    <TR><TD VALIGN="TOP"><TT>
     
    <TT>compressed1D (size_type n) </TT>
    
    
    </TT></TD>
    <TD><FONT FACE=Times SIZE=3>
      &nbsp; 
    </FONT></TD>
    <TD><FONT FACE=Times SIZE=3>
      Length N Constructor  
    </FONT></TD>	
    </TR>

    <TR><TD VALIGN="TOP"><TT>
     
    <TT>compressed1D (const self&#38; x) </TT>
    
    
    </TT></TD>
    <TD><FONT FACE=Times SIZE=3>
      &nbsp; 
    </FONT></TD>
    <TD><FONT FACE=Times SIZE=3>
      Copy Constructor  
    </FONT></TD>	
    </TR>

    <TR><TD VALIGN="TOP"><TT>
    template &#60;class IndexIter&#62;<br>  
    <TT>compressed1D (IndexIter first, IndexIter last, size_type n) </TT>
    
    
    </TT></TD>
    <TD><FONT FACE=Times SIZE=3>
      &nbsp; 
    </FONT></TD>
    <TD><FONT FACE=Times SIZE=3>
      Index Array Constructor  
    </FONT></TD>	
    </TR>

    <TR><TD VALIGN="TOP"><TT>
     self&#38; 
    <TT>operator= (const self&#38; x) </TT>
    
    
    </TT></TD>
    <TD><FONT FACE=Times SIZE=3>
      &nbsp; 
    </FONT></TD>
    <TD><FONT FACE=Times SIZE=3>
      Assignment Operator  
    </FONT></TD>	
    </TR>

    <TR><TD VALIGN="TOP"><TT>
     iterator 
    <TT>begin () </TT>
    
    
    </TT></TD>
    <TD><FONT FACE=Times SIZE=3>
      Container
  
    </FONT></TD>
    <TD><FONT FACE=Times SIZE=3>
      Return an iterator pointing to the beginning of the vector  
    </FONT></TD>	
    </TR>

    <TR><TD VALIGN="TOP"><TT>
     iterator 
    <TT>end () </TT>
    
    
    </TT></TD>
    <TD><FONT FACE=Times SIZE=3>
      Container
  
    </FONT></TD>
    <TD><FONT FACE=Times SIZE=3>
      Return an iterator pointing past the end of the vector  
    </FONT></TD>	
    </TR>

    <TR><TD VALIGN="TOP"><TT>
     const_iterator 
    <TT>begin () const</TT>
    
    
    </TT></TD>
    <TD><FONT FACE=Times SIZE=3>
      Container
  
    </FONT></TD>
    <TD><FONT FACE=Times SIZE=3>
      Return a const iterator pointing to the begining of the vector  
    </FONT></TD>	
    </TR>

    <TR><TD VALIGN="TOP"><TT>
     const_iterator 
    <TT>end () const</TT>
    
    
    </TT></TD>
    <TD><FONT FACE=Times SIZE=3>
      Container
  
    </FONT></TD>
    <TD><FONT FACE=Times SIZE=3>
      Return a const iterator pointing past the end of the vector  
    </FONT></TD>	
    </TR>

    <TR><TD VALIGN="TOP"><TT>
     reverse_iterator 
    <TT>rbegin () </TT>
    
    
    </TT></TD>
    <TD><FONT FACE=Times SIZE=3>
      Reversible Container
  
    </FONT></TD>
    <TD><FONT FACE=Times SIZE=3>
      Return a reverse iterator pointing to the last element of the vector  
    </FONT></TD>	
    </TR>

    <TR><TD VALIGN="TOP"><TT>
     reverse_iterator 
    <TT>rend () </TT>
    
    
    </TT></TD>
    <TD><FONT FACE=Times SIZE=3>
      Reversible Container
  
    </FONT></TD>
    <TD><FONT FACE=Times SIZE=3>
      Return a reverse iterator pointing past the end of the vector  
    </FONT></TD>	
    </TR>

    <TR><TD VALIGN="TOP"><TT>
     const_reverse_iterator 
    <TT>rbegin () const</TT>
    
    
    </TT></TD>
    <TD><FONT FACE=Times SIZE=3>
      Reversible Container
  
    </FONT></TD>
    <TD><FONT FACE=Times SIZE=3>
      Return a const reverse iterator pointing to the last element of the vector  
    </FONT></TD>	
    </TR>

    <TR><TD VALIGN="TOP"><TT>
     const_reverse_iterator 
    <TT>rend () const</TT>
    
    
    </TT></TD>
    <TD><FONT FACE=Times SIZE=3>
      Reversible Container
  
    </FONT></TD>
    <TD><FONT FACE=Times SIZE=3>
      Return a const reverse iterator pointing past the end of the vector  
    </FONT></TD>	
    </TR>

    <TR><TD VALIGN="TOP"><TT>
     reference 
    <TT>operator[] (size_type i) </TT>
    
    
    </TT></TD>
    <TD><FONT FACE=Times SIZE=3>
      &nbsp; 
    </FONT></TD>
    <TD><FONT FACE=Times SIZE=3>
      Access the element with index i  
    </FONT></TD>	
    </TR>

    <TR><TD VALIGN="TOP"><TT>
     const_reference 
    <TT>operator[] (size_type i) const</TT>
    
    
    </TT></TD>
    <TD><FONT FACE=Times SIZE=3>
      &nbsp; 
    </FONT></TD>
    <TD><FONT FACE=Times SIZE=3>
      Access the element with index i  
    </FONT></TD>	
    </TR>

    <TR><TD VALIGN="TOP"><TT>
     iterator 
    <TT>insert (size_type i, const T&#38; val) </TT>
    
    
    </TT></TD>
    <TD><FONT FACE=Times SIZE=3>
      &nbsp; 
    </FONT></TD>
    <TD><FONT FACE=Times SIZE=3>
      Insert val into the vector at index i  
    </FONT></TD>	
    </TR>

    <TR><TD VALIGN="TOP"><TT>
     void 
    <TT>push_back (size_type i, const T&#38; val) </TT>
    
    
    </TT></TD>
    <TD><FONT FACE=Times SIZE=3>
      &nbsp; 
    </FONT></TD>
    <TD><FONT FACE=Times SIZE=3>
      Push back, warning: must insert elements ordered by index.  
    </FONT></TD>	
    </TR>

    <TR><TD VALIGN="TOP"><TT>
     void 
    <TT>clear () </TT>
    
    
    </TT></TD>
    <TD><FONT FACE=Times SIZE=3>
      &nbsp; 
    </FONT></TD>
    <TD><FONT FACE=Times SIZE=3>
      Erase the vector  
    </FONT></TD>	
    </TR>

    <TR><TD VALIGN="TOP"><TT>
     size_type 
    <TT>size () const</TT>
    
    
    </TT></TD>
    <TD><FONT FACE=Times SIZE=3>
      &nbsp; 
    </FONT></TD>
    <TD><FONT FACE=Times SIZE=3>
      The size of the vector (including non-zeroes)  
    </FONT></TD>	
    </TR>

    <TR><TD VALIGN="TOP"><TT>
     size_type 
    <TT>nnz () const</TT>
    
    
    </TT></TD>
    <TD><FONT FACE=Times SIZE=3>
      &nbsp; 
    </FONT></TD>
    <TD><FONT FACE=Times SIZE=3>
      The number of non-zero elements (the number stored)  
    </FONT></TD>	
    </TR>

    <TR><TD VALIGN="TOP"><TT>
     void 
    <TT>resize (size_type n) </TT>
    
    
    </TT></TD>
    <TD><FONT FACE=Times SIZE=3>
      &nbsp; 
    </FONT></TD>
    <TD><FONT FACE=Times SIZE=3>
      Resize the vector to size n  
    </FONT></TD>	
    </TR>

    <TR><TD VALIGN="TOP"><TT>
     void 
    <TT>reserve (size_type n) </TT>
    
    
    </TT></TD>
    <TD><FONT FACE=Times SIZE=3>
      &nbsp; 
    </FONT></TD>
    <TD><FONT FACE=Times SIZE=3>
      Reserve storage for n non-zero elements  
    </FONT></TD>	
    </TR>

    <TR><TD VALIGN="TOP"><TT>
     IndexArrayRef 
    <TT>nz_struct () const</TT>
    
    
    </TT></TD>
    <TD><FONT FACE=Times SIZE=3>
      &nbsp; 
    </FONT></TD>
    <TD><FONT FACE=Times SIZE=3>
      Returns the <A HREF="array.html" >array</A> of indices  
    </FONT></TD>	
    </TR>

    <TR><TD VALIGN="TOP"><TT>
     IndexArrayRef 
    <TT>nz_struct () </TT>
    
    
    </TT></TD>
    <TD><FONT FACE=Times SIZE=3>
      &nbsp; 
    </FONT></TD>
    <TD><FONT FACE=Times SIZE=3>
      Returns the <A HREF="array.html" >array</A> of indices  
    </FONT></TD>	
    </TR>

</TABLE>
</TD></TR>



<TR><TD><IMG SRC="whitespace.gif" Alt="" WIDTH="32" HEIGHT="15" ALIGN="TOP"></TD></TR>
<TR BGCOLOR=#e0e0e0>
<TD VALIGN=BOTTOM><FONT FACE=arial,helvetica SIZE=+1><B>New members</B></FONT>
</TD></TR><TR><TD>

</TD></TR>


<TR><TD><IMG SRC="whitespace.gif" Alt="" WIDTH="32" HEIGHT="15" ALIGN="TOP"></TD></TR>
<TR BGCOLOR=#e0e0e0>
<TD VALIGN=BOTTOM><FONT FACE=arial,helvetica SIZE=+1><B>Notes</B></FONT>
</TD></TR><TR><TD>

</TD></TR>


<TR><TD><IMG SRC="whitespace.gif" Alt="" WIDTH="32" HEIGHT="15" ALIGN="TOP"></TD></TR>
<TR BGCOLOR=#e0e0e0>
<TD VALIGN=BOTTOM><FONT FACE=arial,helvetica SIZE=+1><B>See also</B></FONT>
</TD></TR><TR><TD>

</TD></TR>


</TABLE>

<!--start footer--> 
<P>
<CENTER>
<CENTER><IMG SRC="./blue-bar.jpg" width=640></CENTER>
</CENTER>

<P>
<A HREF="http://www.nd.edu">
<IMG BORDER=0 SRC="./ndtoclogo.gif" ALT="[MTL Home]" ALIGN=absmiddle></A>
</A>

<FONT SIZE="-2">
<A HREF="../LICENSE.htm">
Copyright &copy;
1998,1999 University of Notre Dame.  All Rights Reserved.</FONT>


</FONT>
</BODY>
</HTML>