sdmauxfill.c

来自「斯坦福大学Grant和Boyd教授等开发的凸优化matlab工具箱」· C语言 代码 · 共 67 行

/* ************************************************************
   MODULE sdmaux*.c  -- Several low-level subroutines for the
   mex-files in the Self-Dual-Minimization package.

    This file is part of SeDuMi 1.04BETA
    Copyright (C) 2000 Jos F. Sturm
    Dept. Quantitative Economics, Maastricht University, the Netherlands.
    Affiliations up to SeDuMi 1.02 (AUG1998):
      CRL, McMaster University, Canada.
      Supported by the Netherlands Organization for Scientific Research (NWO).
  
    This program is free software; 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.
  
    This program 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 General Public License for more details.
  
    You should have received a copy of the GNU General Public License
    along with this program; if not, write to the Free Software
    Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
   ************************************************************ */

#include "blksdp.h"
/* ============================================================
   ARRAY FILLING
   ============================================================ */
/* ************************************************************
   TIME CRITICAL PROCEDURE fromto -- x = i:n-1
   INPUT
     i, n - first and just beyond last integer to write in x.
   OUTPUT
     x - (n-i) array, will contain x = i:(n-1)
   ************************************************************ */
void fromto(int *x, int i, const int n)
{
  x -= i;                /* makes x(i:n-1) valid */
  for(; i < n; i++)
    x[i] = i;
}

/* ************************************************************
   PROCEDURE fzeros -- z = zeros(n,1)
   INPUT  n = length(z)
   OUTPUT z = zeros(n,1)
   ************************************************************ */
void fzeros(double *z,const int n)
{
  int k;
  
  for(k=0; k < n - 3; k++){           /* LEVEL 4 */
    z[k] = 0.0; k++;
    z[k] = 0.0; k++;
    z[k] = 0.0; k++;
    z[k] = 0.0;
  }
  if(k < n - 1){                      /* LEVEL 2 */
    z[k] = 0.0; k++;
    z[k] = 0.0; k++;
  }
  if(k < n)                           /* LEVEL 1 */
    z[k] = 0.0;
}