//===========================================================================
// Copyright (C) 1998, 2000-2007, 2010, 2011, 2012 SINTEF ICT, Applied
// Mathematics, Norway.
//
// This file is part of GoTools
//
// 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 version 2 of the License. 
//
// 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, see <http://www.gnu.org/licenses>
//
// Contact information: E-mail: tor.dokken@sintef.no                      
// SINTEF ICT, Department of Applied Mathematics,                         
// P.O. Box 124 Blindern,                                                 
// 0314 Oslo, Norway.                                                     
//
// Other licenses are also available for this software, notably licenses
// for:
// - Building commercial software.                                        
// - Building software whose source code you wish to keep private.        
//===========================================================================

#include "sisl-copyright.h"

/*
 *
 * $Id: shcheckput.c,v 1.2 2001-03-19 16:06:04 afr Exp $
 *
 */


#define SHCHECKPUT

#include "sislP.h"                            


#if defined (SISLNEEDPROTOTYPES)
void
     shcheckput(SISLObject *po1,SISLIntdat **rintdat,
		SISLIntdat *pintdat,int inr,double apar,int *jstat)
#else
void shcheckput(po1,rintdat,pintdat,inr,apar,jstat)
     SISLObject *po1;
     SISLIntdat **rintdat;
     SISLIntdat *pintdat;
     int    inr;
     double apar;
     int    *jstat;
#endif
/*
*********************************************************************
*
*********************************************************************
*                                                                   
* PURPOSE    : To insert all points in one intdat with one less number
*              of parameters into rintdat. New copies is made with
*              the missing parameter. All listes is also to
*              be uppdated. This is a special version in hp relaxation.
*              The difference from s6idput is that this version
*              is to be used only when upgrading from curve maxima
*              to surface maxima. We use the function checktype to
*              examin if the maxima from the curve is a maxima
*              for the surface.
*
*
*
* INPUT      : po1      - Pointer to the surface object.
*              pintdat  - Pointer to intersection data with one less
*                         parameter than rintdat.
*              inr      - Number of the parameter that is missing in pintdat.
*              apar     - Parameter value of the missing parameter.
*
*
* OUTPUT     : rintdat  - Pointer to a pointer to intersection data.
*              jstat    - status messages  
*                               > 0      : No of points transmitted.
*                               = 0      : No points transmitted !
*                               < 0      : error
*
*
* METHOD     : 
*
*
* REFERENCES :
*
*-
* CALLS      : s6err      - Gives error message.
*              s6idnpt    - Insert a new intpt structure.
*              copyIntpt  - Copy an intpt structure.
*              newIntdat  - Create new intdat structure.
*
* WRITTEN BY : Arne Laksaa, 05.89.
*              UJK, 01.91 Changed a call to newIntpt, copying the
*                         attribute adist.
*********************************************************************
*/                                     
{

  int ktype;                    /* Local extremum desciptor.            */
  int kstat;                    /* Local status variable.               */
/*guen  int kpos=0;  */                  /* Position of error.                   */
/*guen changed into: */
  int kpos=0;                   /* Position of error.                   */
  int ki,kj;                    /* Counters                             */
  int kant;                     /* Number of parameters in new points.  */
  int knum;                     /* Number of points transmitted.        */
  int *perm_arr = SISL_NULL;         /* Permutation array used in transmit.  */
  double *spar   = SISL_NULL;        /* Storing uppdated parametervalues.    */
  SISLIntpt **uintpt = SISL_NULL;    /* Pointers to new intersection points. */
  /* ------------------------------------------------------------------ */
  
  /* Initiate to no points transmitted */
  *jstat = 0;

  /* Test if object is a surface                          */
    if (po1->iobj != SISLSURFACE) goto err192;
			       
  /* We have to be sure that we have an intdat structure. */
  if (pintdat == SISL_NULL) goto out;
   
  /* Computing number of new parameter direction. */
  
  kant = pintdat->vpoint[0]->ipar + 1;
  
  
  if (inr<0 || inr>=kant) goto err191;
  
  
  /* Allocating an array for intersection points. */
  
  if ((uintpt = newarray(pintdat->ipoint,SISLIntpt *)) == SISL_NULL)
    goto err101;
  
  /* Allocating an array for index relation between pintdat
     and the selected points.      . */
  
  if ((perm_arr = newarray(pintdat->ipoint,int)) == SISL_NULL)
    goto err101;
  
  /* Allocating an array for parametervalues. */
  
  if ((spar = newarray(kant,double)) == SISL_NULL)
    goto err101;
  
  
  /* Making copies of all intersection points. */
  
  for (ki=0,knum=0; ki<pintdat->ipoint; ki++)
  {
     /* First we have to insert the missing parameter value. */
     
     for(kj=0; kj<inr; kj++) spar[kj] = pintdat->vpoint[ki]->epar[kj];
     spar[kj] = apar;
     for(kj++; kj<kant; kj++) spar[kj] = pintdat->vpoint[ki]->epar[kj-1];
     
     /* Select the ones which are surface maximas */
     ktype = shchecktype(po1,spar);
     if (ktype < 0) goto error;
     if (ktype == 1 || ktype == 3 || ktype == 4) 
     {
	/* UJK,01-91 bringing over the adist value ! */
	uintpt[knum] = newIntpt(kant,spar,pintdat->vpoint[ki]->adist);
 	perm_arr[ki] = knum;
 	knum++;
     }
     else perm_arr[ki] = -1;
  }
  
  if (knum == 0) goto out;
		 
  /* Than we can insert all new intersection points in rintdat. */
  
  for (ki=0; ki<knum; ki++)
    {
      s6idnpt(rintdat,&uintpt[ki],1,&kstat);
      if (kstat < 0) goto error;
    }
  
  /* Than we can uppdate all pcurve pointers (lists). */
  
  for (ki=0; ki<pintdat->ipoint; ki++)
    if (pintdat->vpoint[ki]->pcurve != SISL_NULL)
      {
	for (kj=0;kj<pintdat->ipoint;kj++)
	  if (pintdat->vpoint[ki]->pcurve == pintdat->vpoint[kj])
	    break;
	
	if (kj == pintdat->ipoint) goto err190;
	
	if (perm_arr[ki] >=0 && perm_arr[kj] >= 0)
	   {
	   s6idcon(rintdat,&uintpt[perm_arr[ki]],&uintpt[perm_arr[kj]],&kstat);
	   if (kstat < 0) goto error;
           }
      }
  
  
  *jstat = knum;
  goto out;
  

/* Error, wrong object type.  */

err192: *jstat = -192;
        s6err("shcheckput",*jstat,kpos);
        goto out;

/* Error in inserted parameter number.  */

err191: *jstat = -191;
        s6err("shcheckput",*jstat,kpos);
        goto out;
/* Error in intersection list.  */

err190: *jstat = -190;
        s6err("shcheckput",*jstat,kpos);
        goto out;

/* Error in space allocation.  */

err101: *jstat = -101;
        s6err("shcheckput",*jstat,kpos);
        goto out;

/* Error in sub function.  */

error: *jstat = kstat;
        s6err("shcheckput",*jstat,kpos);
        goto out;

 out: if (uintpt     != SISL_NULL) freearray(uintpt);
      if (spar       != SISL_NULL) freearray(spar);
      if (perm_arr   != SISL_NULL) freearray(perm_arr);
}
