Sophie

Sophie

distrib > Fedora > 15 > i386 > by-pkgid > c5653a35bb94fee65ffe21230992c863 > files > 413

linbox-doc-1.2.1-1.fc15.noarch.rpm

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>linbox: examples/smithvalence.C</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.4 -->
<script type="text/javascript">
function hasClass(ele,cls) {
  return ele.className.match(new RegExp('(\\s|^)'+cls+'(\\s|$)'));
}

function addClass(ele,cls) {
  if (!this.hasClass(ele,cls)) ele.className += " "+cls;
}

function removeClass(ele,cls) {
  if (hasClass(ele,cls)) {
    var reg = new RegExp('(\\s|^)'+cls+'(\\s|$)');
    ele.className=ele.className.replace(reg,' ');
  }
}

function toggleVisibility(linkObj) {
 var base = linkObj.getAttribute('id');
 var summary = document.getElementById(base + '-summary');
 var content = document.getElementById(base + '-content');
 var trigger = document.getElementById(base + '-trigger');
 if ( hasClass(linkObj,'closed') ) {
   summary.style.display = 'none';
   content.style.display = 'block';
   trigger.src = 'open.png';
   removeClass(linkObj,'closed');
   addClass(linkObj,'opened');
 } else if ( hasClass(linkObj,'opened') ) {
   summary.style.display = 'block';
   content.style.display = 'none';
   trigger.src = 'closed.png';
   removeClass(linkObj,'opened');
   addClass(linkObj,'closed');
 }
 return false;
}
</script>
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td style="padding-left: 0.5em;">
   <div id="projectname">linbox</div>
  </td>
 </tr>
 </tbody>
</table>
</div>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="pages.html"><span>Related&#160;Pages</span></a></li>
      <li><a href="modules.html"><span>Modules</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Data&#160;Structures</span></a></li>
      <li><a href="files.html"><span>Files</span></a></li>
      <li><a href="dirs.html"><span>Directories</span></a></li>
      <li><a href="examples.html"><span>Examples</span></a></li>
    </ul>
  </div>
</div>
<div class="header">
  <div class="headertitle">
<div class="title">examples/smithvalence.C</div>  </div>
</div>
<div class="contents">
<p>Valence of sparse matrix over Z or Zp.</p>
<div class="fragment"><pre class="fragment"><span class="comment">/* -*- mode: C++; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */</span>
<span class="comment">// vim:sts=8:sw=8:ts=8:noet:sr:cino=&gt;s,f0,{0,g0,(0,\:0,t0,+0,=s</span>
<span class="comment">/*</span>
<span class="comment"> * examples/smithvalence.C</span>
<span class="comment"> *</span>
<span class="comment"> * Copyright (C) 2010  J-G Dumas</span>
<span class="comment"> *</span>
<span class="comment"> * This file is part of LinBox.</span>
<span class="comment"> *</span>
<span class="comment"> *   LinBox is free software: you can redistribute it and/or modify</span>
<span class="comment"> *   it under the terms of the GNU Lesser General Public License as</span>
<span class="comment"> *   published by the Free Software Foundation, either version 2 of</span>
<span class="comment"> *   the License, or (at your option) any later version.</span>
<span class="comment"> *</span>
<span class="comment"> *   LinBox is distributed in the hope that it will be useful,</span>
<span class="comment"> *   but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<span class="comment"> *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span>
<span class="comment"> *   GNU Lesser General Public License for more details.</span>
<span class="comment"> *</span>
<span class="comment"> *   You should have received a copy of the GNU Lesser General Public</span>
<span class="comment"> *   License along with LinBox.  If not, see</span>
<span class="comment"> *   &lt;http://www.gnu.org/licenses/&gt;.</span>
<span class="comment"> */</span>

<span class="comment">//#include &quot;linbox-config.h&quot;</span>
<span class="preprocessor">#include &lt;iostream&gt;</span>

<span class="preprocessor">#include &quot;linbox/field/gf2.h&quot;</span>
<span class="preprocessor">#include &quot;<a class="code" href="modular-double_8h.html" title="Standard representation of Z/mZ over double .">linbox/field/modular-double.h</a>&quot;</span>
<span class="preprocessor">#include &quot;linbox/field/givaro-zpz.h&quot;</span>
<span class="preprocessor">#include &quot;linbox/field/field-traits.h&quot;</span>
<span class="preprocessor">#include &quot;linbox/blackbox/transpose.h&quot;</span>
<span class="preprocessor">#include &quot;linbox/blackbox/compose.h&quot;</span>
<span class="preprocessor">#include &quot;linbox/blackbox/sparse.h&quot;</span>
<span class="preprocessor">#include &quot;linbox/solutions/rank.h&quot;</span>
<span class="preprocessor">#include &quot;linbox/solutions/valence.h&quot;</span>
<span class="preprocessor">#include &quot;linbox/algorithms/smith-form-sparseelim-local.h&quot;</span>
<span class="preprocessor">#include &quot;linbox/util/matrix-stream.h&quot;</span>
<span class="preprocessor">#include &quot;<a class="code" href="integer_8h.html" title="This is a representation of arbitrary integers.">linbox/integer.h</a>&quot;</span>

<span class="preprocessor">#include &lt;givaro/givintnumtheo.h&gt;</span>

<span class="keyword">using</span> <a name="a0"></a><a class="code" href="group__integers.html#gad62eceb96963b157a2357aba991f6d6e" title="Integers in LinBox.">LinBox::integer</a>;

<span class="keyword">template</span>&lt;<span class="keyword">class</span> Field&gt;
<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span>&amp; TempLRank(<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span>&amp; r, <span class="keywordtype">char</span> * filename, <span class="keyword">const</span> <a name="_a1"></a><a class="code" href="class_lin_box_1_1_modular_3_01uint32__t_01_4.html" title="Specialization of class Modular for uint32_t element type.">Field</a>&amp; F)
{
    std::ifstream input(filename);
    <a name="_a2"></a><a class="code" href="class_lin_box_1_1_matrix_stream.html" title="MatrixStream.">LinBox::MatrixStream&lt; Field &gt;</a> msf( F, input );
    <a name="_a3"></a><a class="code" href="class_lin_box_1_1_sparse_matrix.html" title="vector of sparse rows.">LinBox::SparseMatrix&lt;Field,typename LinBox::Vector&lt;Field&gt;::SparseSeq</a>&gt; FA(msf);
    input.close();
    ::Givaro::Timer tim; tim.start();
    <a name="a4"></a><a class="code" href="namespace_lin_box.html#ac9442bdcae8ef5fc90e5a255630bffa7" title="Rank of A.">LinBox::rankin</a>(r, FA);
    tim.stop();
    F.write(std::cout &lt;&lt; <span class="stringliteral">&quot;Rank over &quot;</span>) &lt;&lt; <span class="stringliteral">&quot; is &quot;</span> &lt;&lt; r &lt;&lt; <span class="charliteral">&#39; &#39;</span> &lt;&lt; tim &lt;&lt; std::endl;
    <span class="keywordflow">return</span> r;
}

<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span>&amp; TempLRank(<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span>&amp; r, <span class="keywordtype">char</span> * filename, <span class="keyword">const</span> LinBox::GF2&amp; F2)
{
    std::ifstream input(filename);
    <a name="_a5"></a><a class="code" href="class_lin_box_1_1_zero_one.html" title="Time and space efficient representation of sparse {0,1}-matrices.">LinBox::ZeroOne&lt;LinBox::GF2&gt;</a> A;
    A.<a name="a6"></a><a class="code" href="class_lin_box_1_1_zero_one.html#a7f1e7ece6c12a9a3feb091f90c7c9ac1" title="Read the matrix from a stream in the JGD&#39;s SMS format.">read</a>(input);
    input.close();
    ::Givaro::Timer tim; tim.start();
    <a class="code" href="namespace_lin_box.html#ac9442bdcae8ef5fc90e5a255630bffa7" title="Rank of A.">LinBox::rankin</a>(r, A, <a class="code" href="struct_lin_box_1_1_method.html#abc071c5d851893868ab7a0c0d8ee34cb" title="Method::SparseElimination : no doc.">LinBox::Method::SparseElimination</a>() );
    tim.stop();
    F2.write(std::cout &lt;&lt; <span class="stringliteral">&quot;Rank over &quot;</span>) &lt;&lt; <span class="stringliteral">&quot; is &quot;</span> &lt;&lt; r &lt;&lt; <span class="charliteral">&#39; &#39;</span> &lt;&lt; tim &lt;&lt; std::endl;
    <span class="keywordflow">return</span> r;
}



<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span>&amp; LRank(<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span>&amp; r, <span class="keywordtype">char</span> * filename, <a class="code" href="group__integers.html#gad62eceb96963b157a2357aba991f6d6e" title="Integers in LinBox.">integer</a> p)
{

    <a class="code" href="group__integers.html#gad62eceb96963b157a2357aba991f6d6e" title="Integers in LinBox.">integer</a> maxmod16; LinBox::FieldTraits&lt;LinBox::GivaroZpz&lt; ::Givaro::Std16&gt; &gt;::maxModulus(maxmod16);
    <a class="code" href="group__integers.html#gad62eceb96963b157a2357aba991f6d6e" title="Integers in LinBox.">integer</a> maxmod32; LinBox::FieldTraits&lt;LinBox::GivaroZpz&lt; ::Givaro::Std32&gt; &gt;::maxModulus(maxmod32);
    <a class="code" href="group__integers.html#gad62eceb96963b157a2357aba991f6d6e" title="Integers in LinBox.">integer</a> maxmod53; LinBox::FieldTraits&lt;LinBox::Modular&lt;double&gt; &gt;::maxModulus(maxmod53);
    <a class="code" href="group__integers.html#gad62eceb96963b157a2357aba991f6d6e" title="Integers in LinBox.">integer</a> maxmod64; LinBox::FieldTraits&lt;LinBox::GivaroZpz&lt; ::Givaro::Std64&gt; &gt;::maxModulus(maxmod64);
    <span class="keywordflow">if</span> (p == 2) {
        LinBox::GF2 F2;
        <span class="keywordflow">return</span> TempLRank(r, filename, F2);
    }
    <span class="keywordflow">else</span> <span class="keywordflow">if</span> (p &lt;= maxmod16) {
        <span class="keyword">typedef</span> <a name="_a7"></a><a class="code" href="class_lin_box_1_1_givaro_zpz.html">LinBox::GivaroZpz&lt; ::Givaro::Std16&gt;</a> <a class="code" href="class_lin_box_1_1_modular_3_01uint32__t_01_4.html" title="Specialization of class Modular for uint32_t element type.">Field</a>;
        Field F(p);
        <span class="keywordflow">return</span> TempLRank(r, filename, F);
    }
    <span class="keywordflow">else</span> <span class="keywordflow">if</span> (p &lt;= maxmod32) {
        <span class="keyword">typedef</span> <a name="_a8"></a><a class="code" href="class_lin_box_1_1_givaro_zpz.html">LinBox::GivaroZpz&lt; ::Givaro::Std32&gt;</a> <a class="code" href="class_lin_box_1_1_modular_3_01uint32__t_01_4.html" title="Specialization of class Modular for uint32_t element type.">Field</a>;
        Field F(p);
        <span class="keywordflow">return</span> TempLRank(r, filename, F);
    }
    <span class="keywordflow">else</span> <span class="keywordflow">if</span> (p &lt;= maxmod53) {
        <span class="keyword">typedef</span> <a name="_a9"></a><a class="code" href="class_lin_box_1_1_modular_3_01double_01_4.html" title="Standard representation of .">LinBox::Modular&lt;double&gt;</a> <a class="code" href="class_lin_box_1_1_modular_3_01uint32__t_01_4.html" title="Specialization of class Modular for uint32_t element type.">Field</a>;
        Field F(p);
        <span class="keywordflow">return</span> TempLRank(r, filename, F);
    }
    <span class="keywordflow">else</span> <span class="keywordflow">if</span> (p &lt;= maxmod64) {
        <span class="keyword">typedef</span> <a name="_a10"></a><a class="code" href="class_lin_box_1_1_givaro_zpz.html" title="wrapper of Givaro&#39;s ZpzDom.">LinBox::GivaroZpz&lt; ::Givaro::Std64&gt;</a> <a class="code" href="class_lin_box_1_1_modular_3_01uint32__t_01_4.html" title="Specialization of class Modular for uint32_t element type.">Field</a>;
        Field F(p);
        <span class="keywordflow">return</span> TempLRank(r, filename, F);
    }
    <span class="keywordflow">else</span> {
        <span class="keyword">typedef</span> <a class="code" href="class_lin_box_1_1_givaro_zpz.html" title="wrapper of Givaro&#39;s ZpzDom.">LinBox::GivaroZpz&lt;integer&gt;</a> <a class="code" href="class_lin_box_1_1_modular_3_01uint32__t_01_4.html" title="Specialization of class Modular for uint32_t element type.">Field</a>;
        Field F(p);
        <span class="keywordflow">return</span> TempLRank(r, filename, F);
    }
    <span class="keywordflow">return</span> r;
}

std::vector&lt;size_t&gt;&amp; PRank(std::vector&lt;size_t&gt;&amp; ranks, <span class="keywordtype">char</span> * filename, <a class="code" href="group__integers.html#gad62eceb96963b157a2357aba991f6d6e" title="Integers in LinBox.">integer</a> p, <span class="keywordtype">size_t</span> e, <span class="keywordtype">size_t</span> intr)
{
    <a class="code" href="group__integers.html#gad62eceb96963b157a2357aba991f6d6e" title="Integers in LinBox.">integer</a> maxmod;
    LinBox::FieldTraits&lt;LinBox::GivaroZpz&lt; ::Givaro::Std64&gt; &gt;::maxModulus(maxmod);
    <span class="keywordflow">if</span> (p &lt;= maxmod) {
        <span class="keyword">typedef</span> <a class="code" href="class_lin_box_1_1_givaro_zpz.html" title="wrapper of Givaro&#39;s ZpzDom.">LinBox::GivaroZpz&lt; ::Givaro::Std64&gt;</a> Ring;
        int64_t lp(p);
        <a class="code" href="group__integers.html#gad62eceb96963b157a2357aba991f6d6e" title="Integers in LinBox.">integer</a> q = pow(p,e); int64_t lq(q);
        <span class="keywordflow">if</span> (q &gt; <a class="code" href="group__integers.html#gad62eceb96963b157a2357aba991f6d6e" title="Integers in LinBox.">integer</a>(lq)) {
            std::cerr &lt;&lt; <span class="stringliteral">&quot;Sorry power rank mod large composite not yet implemented&quot;</span> &lt;&lt; std::endl;
            q = p;
            <span class="keywordflow">do</span> {
                q *= p; lq = (int64_t)q;
            } <span class="keywordflow">while</span> (q == <a class="code" href="group__integers.html#gad62eceb96963b157a2357aba991f6d6e" title="Integers in LinBox.">integer</a>(lq));
            q/=p; lq = (int64_t)q;
            std::cerr &lt;&lt; <span class="stringliteral">&quot;Trying: &quot;</span> &lt;&lt; lq &lt;&lt; std::endl;
        }
        Ring F(lq);
        std::ifstream input(filename);
        <a class="code" href="class_lin_box_1_1_matrix_stream.html" title="MatrixStream.">LinBox::MatrixStream&lt;Ring&gt;</a> ms( F, input );
        <a class="code" href="class_lin_box_1_1_sparse_matrix.html" title="vector of sparse rows.">LinBox::SparseMatrix&lt;Ring, LinBox::Vector&lt;Ring&gt;::SparseSeq</a> &gt; A (ms);
        input.close();
        <a name="_a11"></a><a class="code" href="class_lin_box_1_1_power_gauss_domain.html" title="Repository of functions for rank modulo a prime power by elimination on sparse matrices.">LinBox::PowerGaussDomain&lt; Ring &gt;</a> PGD( F );

        PGD.prime_power_rankin( lq, lp, ranks, A, A.<a name="a12"></a>rowdim(), A.<a name="a13"></a>coldim(), std::vector&lt;size_t&gt;());
        F.write(std::cout &lt;&lt; <span class="stringliteral">&quot;Ranks over &quot;</span>) &lt;&lt; <span class="stringliteral">&quot; are &quot;</span> ;
        <span class="keywordflow">for</span>(std::vector&lt;size_t&gt;::const_iterator rit=ranks.begin(); rit != ranks.end(); ++rit)
            std::cout &lt;&lt; *rit &lt;&lt; <span class="charliteral">&#39; &#39;</span>;
        std::cout &lt;&lt; std::endl;
    }
    <span class="keywordflow">else</span> {
        std::cerr &lt;&lt; <span class="stringliteral">&quot;Sorry power rank mod large composite not yet implemented&quot;</span> &lt;&lt; std::endl;
        std::cerr &lt;&lt; <span class="stringliteral">&quot;Assuming integer rank&quot;</span> &lt;&lt; std::endl;
        ranks.resize(0); ranks.push_back(intr);
    }
    <span class="keywordflow">return</span> ranks;
}




<span class="keyword">using namespace </span>LinBox;

<span class="keywordtype">int</span> main (<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> **argv)
{
    <span class="comment">//     commentator.setMaxDetailLevel (-1);</span>
    <span class="comment">//     commentator.setMaxDepth (-1);</span>
    <span class="comment">//     commentator.setReportStream (std::cerr);</span>


    <span class="keywordflow">if</span> (argc &lt; 2 || argc &gt; 4) {
        std::cerr &lt;&lt; <span class="stringliteral">&quot;Usage: valence &lt;matrix-file-in-supported-format&gt; [-ata|-aat|valence] [coprime]&quot;</span> &lt;&lt; std::endl;
        <span class="keywordflow">return</span> -1;
    }

    std::ifstream input (argv[1]);
    <span class="keywordflow">if</span> (!input) { std::cerr &lt;&lt; <span class="stringliteral">&quot;Error opening matrix file &quot;</span> &lt;&lt; argv[1] &lt;&lt; std::endl; <span class="keywordflow">return</span> -1; }

    <a name="_a14"></a><a class="code" href="class_lin_box_1_1_p_i_d__integer.html" title="Domain for integer operations.">PID_integer</a> ZZ;
    <a class="code" href="class_lin_box_1_1_matrix_stream.html" title="MatrixStream.">MatrixStream&lt; PID_integer &gt;</a> ms( ZZ, input );
    <span class="keyword">typedef</span> <a class="code" href="class_lin_box_1_1_sparse_matrix.html" title="vector of sparse rows.">SparseMatrix&lt;PID_integer&gt;</a>  Blackbox;
    Blackbox A (ms);
    input.close();

    std::cout &lt;&lt; <span class="stringliteral">&quot;A is &quot;</span> &lt;&lt; A.rowdim() &lt;&lt; <span class="stringliteral">&quot; by &quot;</span> &lt;&lt; A.coldim() &lt;&lt; std::endl;

    PID_integer::Element val_A;

    ::Givaro::Timer chrono; chrono.start();
    <span class="keywordflow">if</span> (argc &gt;= 3) {
        <a name="_a15"></a><a class="code" href="class_lin_box_1_1_transpose.html" title="transpose matrix without copying.">Transpose&lt;Blackbox&gt;</a> T(&amp;A);
        <span class="keywordflow">if</span> (strcmp(argv[2],<span class="stringliteral">&quot;-ata&quot;</span>) == 0) {
            <a name="_a16"></a><a class="code" href="class_lin_box_1_1_compose.html" title="Blackbox of a product: , i.e .">Compose&lt; Transpose&lt;Blackbox&gt;</a>, Blackbox &gt; C (&amp;T, &amp;A);
            std::cout &lt;&lt; <span class="stringliteral">&quot;A^T A is &quot;</span> &lt;&lt; C.rowdim() &lt;&lt; <span class="stringliteral">&quot; by &quot;</span> &lt;&lt; C.coldim() &lt;&lt; std::endl;
            valence(val_A, C);
        }
        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (strcmp(argv[2],<span class="stringliteral">&quot;-aat&quot;</span>) == 0) {
            <a class="code" href="class_lin_box_1_1_compose.html" title="Blackbox of a product: , i.e .">Compose&lt; Blackbox, Transpose&lt;Blackbox&gt;</a> &gt; C (&amp;A, &amp;T);
            std::cout &lt;&lt; <span class="stringliteral">&quot;A A^T is &quot;</span> &lt;&lt; C.rowdim() &lt;&lt; <span class="stringliteral">&quot; by &quot;</span> &lt;&lt; C.coldim() &lt;&lt; std::endl;
            valence(val_A, C);
        }
        <span class="keywordflow">else</span> {
            std::cout &lt;&lt; <span class="stringliteral">&quot;Suppose primes are contained in &quot;</span> &lt;&lt; argv[2] &lt;&lt; std::endl;
            val_A = <a class="code" href="group__integers.html#gad62eceb96963b157a2357aba991f6d6e" title="Integers in LinBox.">integer</a>(argv[2]);
        }
    }
    <span class="keywordflow">else</span> {
        <span class="keywordflow">if</span> (A.rowdim() != A.coldim()) {
            std::cerr &lt;&lt; <span class="stringliteral">&quot;Valence works only on square matrices, try either to change the dimension in the matrix file, or to compute the valence of A A^T or A^T A, via the -aat or -ata options.&quot;</span>  &lt;&lt; std::endl;
            exit(0);
        }
        <span class="keywordflow">else</span>
            valence (val_A, A);
    }

    std::cout &lt;&lt; <span class="stringliteral">&quot;Valence is &quot;</span> &lt;&lt; val_A &lt;&lt; std::endl;

    std::vector&lt;integer&gt; Moduli;
    std::vector&lt;size_t&gt; exponents;
    ::Givaro::IntFactorDom&lt;&gt; FTD;

    <span class="keyword">typedef</span> std::pair&lt;integer,unsigned long&gt; PairIntRk;
    std::vector&lt; PairIntRk &gt; smith;


    <a class="code" href="group__integers.html#gad62eceb96963b157a2357aba991f6d6e" title="Integers in LinBox.">integer</a> coprimeV=2;
    <span class="keywordflow">if</span> (argc &gt;= 4) {
        coprimeV = <a class="code" href="group__integers.html#gad62eceb96963b157a2357aba991f6d6e" title="Integers in LinBox.">integer</a>(argv[3]);
    }
    <span class="keywordflow">while</span> ( gcd(val_A,coprimeV) &gt; 1 ) {
        FTD.nextprimein(coprimeV);
    }

    <span class="keywordflow">if</span> (argc &gt;= 4) {
        std::cout &lt;&lt; <span class="stringliteral">&quot;Suppose &quot;</span> &lt;&lt; argv[3] &lt;&lt; <span class="stringliteral">&quot; is coprime with Smith form&quot;</span> &lt;&lt; std::endl;
    }

    std::cout &lt;&lt; <span class="stringliteral">&quot;integer rank: &quot;</span> &lt;&lt; std::endl;

    <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> coprimeR; LRank(coprimeR, argv[1], coprimeV);
    smith.push_back(PairIntRk(coprimeV, coprimeR));
    <span class="comment">//         std::cerr &lt;&lt; &quot;Rank mod &quot; &lt;&lt; coprimeV &lt;&lt; &quot; is &quot; &lt;&lt; coprimeR &lt;&lt; std::endl;</span>

    std::cout &lt;&lt; <span class="stringliteral">&quot;Some factors (5000 factoring loop bound): &quot;</span>;
    FTD.set(Moduli, exponents, val_A, 5000);
    std::vector&lt;size_t&gt;::const_iterator eit=exponents.begin();
    <span class="keywordflow">for</span>(std::vector&lt;integer&gt;::const_iterator mit=Moduli.begin();
        mit != Moduli.end(); ++mit,++eit)
        std::cout &lt;&lt; *mit &lt;&lt; <span class="charliteral">&#39;^&#39;</span> &lt;&lt; *eit &lt;&lt; <span class="charliteral">&#39; &#39;</span>;
    std::cout &lt;&lt; std::endl;

    std::vector&lt;integer&gt; SmithDiagonal(coprimeR,<a class="code" href="group__integers.html#gad62eceb96963b157a2357aba991f6d6e" title="Integers in LinBox.">integer</a>(1));


    <span class="keywordflow">for</span>(std::vector&lt;integer&gt;::const_iterator mit=Moduli.begin();
        mit != Moduli.end(); ++mit) {
        <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> r; LRank(r, argv[1], *mit);
        <span class="comment">//             std::cerr &lt;&lt; &quot;Rank mod &quot; &lt;&lt; *mit &lt;&lt; &quot; is &quot; &lt;&lt; r &lt;&lt; std::endl;</span>
        smith.push_back(PairIntRk(*mit, r));
        <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i=r; i &lt; coprimeR; ++i)
            SmithDiagonal[i] *= *mit;
    }


    eit=exponents.begin();
    std::vector&lt;PairIntRk&gt;::const_iterator sit=smith.begin();
    <span class="keywordflow">for</span>( ++sit; sit != smith.end(); ++sit, ++eit) {
        <span class="keywordflow">if</span> (sit-&gt;second != coprimeR) {
            std::vector&lt;size_t&gt; ranks;
            ranks.push_back(sit-&gt;second);
            <span class="keywordflow">if</span> (*eit &gt; 1) {
                PRank(ranks, argv[1], sit-&gt;first, *eit, coprimeR);
            }
            <span class="keywordflow">else</span> {
                PRank(ranks, argv[1], sit-&gt;first, 2, coprimeR);
            }
            <span class="keywordflow">if</span> (ranks.size() == 1) ranks.push_back(coprimeR);
            <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> expo = (*eit)&lt;&lt;1; ranks.back() &lt; coprimeR; expo&lt;&lt;=1) {
                PRank(ranks, argv[1], sit-&gt;first, expo, coprimeR);
                <span class="keywordflow">if</span> (ranks.size() &lt; expo) {
                    std::cerr &lt;&lt; <span class="stringliteral">&quot;Larger prime power not yet implemented&quot;</span> &lt;&lt; std::endl;
                    <span class="keywordflow">break</span>;
                }
            }
            std::vector&lt;size_t&gt;::const_iterator rit=ranks.begin();
            <span class="comment">// unsigned long modrank = *rit;</span>
            <span class="keywordflow">for</span>(++rit; rit!= ranks.end(); ++rit) {
                <span class="keywordflow">if</span> ((*rit)&gt;= coprimeR) <span class="keywordflow">break</span>;
                <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i=(*rit); i &lt; coprimeR; ++i)
                    SmithDiagonal[i] *= sit-&gt;first;
                <span class="comment">// modrank = *rit;</span>
            }
        }
    }

    <a class="code" href="group__integers.html#gad62eceb96963b157a2357aba991f6d6e" title="Integers in LinBox.">integer</a> si=1;
    <span class="keywordtype">size_t</span> num=0;
    <span class="keywordflow">for</span>( std::vector&lt;integer&gt;::const_iterator dit=SmithDiagonal.begin();
         dit != SmithDiagonal.end(); ++dit) {
        <span class="keywordflow">if</span> (*dit == si) ++num;
        <span class="keywordflow">else</span> {
            std::cerr &lt;&lt; <span class="charliteral">&#39;[&#39;</span> &lt;&lt; si &lt;&lt; <span class="charliteral">&#39;,&#39;</span> &lt;&lt; num &lt;&lt; <span class="stringliteral">&quot;] &quot;</span>;
            num=1;
            si = *dit;
        }
    }
    std::cerr &lt;&lt; <span class="charliteral">&#39;[&#39;</span> &lt;&lt; si &lt;&lt; <span class="charliteral">&#39;,&#39;</span> &lt;&lt; num &lt;&lt; <span class="stringliteral">&quot;] &quot;</span> &lt;&lt; std::endl;
    chrono.stop();
    std::cerr &lt;&lt; chrono &lt;&lt; std::endl;


    <span class="keywordflow">return</span> 0;
}
</pre></div> </div>
</div>
<hr class="footer"/><address class="footer"><small>Generated on Tue Aug 30 2011 for linbox by&#160;
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.4 </small></address>
</body>
</html>