switch to MPL license

1 files changed, 3 insertions, 47 deletions

diff --git a/Eigen/src/SparseLU/SparseLU_Memory.h b/Eigen/src/SparseLU/SparseLU_Memory.h
index 7a2ab93df..531c2dba6 100644
--- a/Eigen/src/SparseLU/SparseLU_Memory.h
+++ b/Eigen/src/SparseLU/SparseLU_Memory.h
@@ -3,24 +3,9 @@
 //
 // Copyright (C) 2012 Désiré Nuentsa-Wakam <desire.nuentsa_wakam@inria.fr>
 //
-// Eigen is free software; you can redistribute it and/or
-// modify it under the terms of the GNU Lesser General Public
-// License as published by the Free Software Foundation; either
-// version 3 of the License, or (at your option) any later version.
-//
-// Alternatively, you can redistribute it and/or
-// modify it under the terms of the GNU General Public License as
-// published by the Free Software Foundation; either version 2 of
-// the License, or (at your option) any later version.
-//
-// Eigen is distributed in the hope that it will be useful, but WITHOUT ANY
-// WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
-// FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License or the
-// GNU General Public License for more details.
-//
-// You should have received a copy of the GNU Lesser General Public
-// License and a copy of the GNU General Public License along with
-// Eigen. If not, see <http://www.gnu.org/licenses/>.
+// This Source Code Form is subject to the terms of the Mozilla
+// Public License v. 2.0. If a copy of the MPL was not distributed
+// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
 
 /* 
  
@@ -125,35 +110,6 @@ int  expand(VectorType& vec, int& length, int nbElts, int keep_prev, int& num_ex
   length  = new_len;
   if(num_expansions) ++num_expansions;
   return 0; 
-  
-  /* 
-   * Test if the memory has been well allocated  
-   * otherwise reduce the size and try to reallocate
-   * copy data from previous vector (if exists) to the newly allocated vector 
-   */
-//   if ( num_expansions != 0 ) // The memory has been expanded before
-//   {
-//     int tries = 0; 
-//     if (keep_prev) 
-//     {
-//       if (!vec.size()) return new_len ;
-//     }
-//     else 
-//     {
-//       while (!vec.size())
-//       {
-//        // Reduce the size and allocate again
-//         if ( ++tries > 10) return new_len;  
-//         alpha = LU_Reduce(alpha); 
-//         new_len = alpha * length ; 
-//         vec.resize(new_len); //FIXME Should be in a try catch section
-//       }
-//     } // end allocation 
-//     
-//     //Copy the previous values to the newly allocated space 
-//     if (nbElts > 0)
-//       vec.segment(0, nbElts) = old_vec;   
-//   } // end expansion
 }
 
 /**