solveur/src/sl_update.cpp

#include "gestionversion.h"
//---------------------------------------------------------------------------

#pragma hdrstop

#include "sl_update.h"
//---------------------------------------------------------------------------
#pragma package(smart_init)


SL_UPDATE::SL_UPDATE()
{
}

SL_UPDATE::~SL_UPDATE()
{
}


void SL_UPDATE::get_new_val(double*old_val,double*add_val)
{

for(int i=0;i<6;i++)
 {
 old_val[i]+=add_val[i];
 }

}


void SL_UPDATE::extract_solution(FEM_SOLUTION* mgsol,double*sol,int lgxcl,int a,int b)
{

 for(int i=0;i<lgxcl;i++)
 {
 sol[i]=mgsol->lire(a,lgxcl*b+i);
 }

}


void SL_UPDATE::remettre_a_zeros(double*t,int taille)
{
 for(int i=0;i<taille;i++)
 {
 t[i]=0.0;
 }

}


void SL_UPDATE::update_la_solution(FEM_SOLUTION* mgsol,double* t,int lgxcl, int a,int b)
{
for(int i=0;i<lgxcl;i++)
 {
   double val_sol=mgsol->lire(a,lgxcl*b+i);
   val_sol+=t[i];
   mgsol->ecrire(a,lgxcl*b+i,val_sol);
 }

}


void SL_UPDATE::get_list_trie(int* llst1,int* lst2,int dim)
{

int* lst1=new int[dim];
  for(int i=0;i<dim;i++)
  {
  lst1[i]=llst1[i];
  lst2[i]=i;
  }
int min=lst1[0];
for(int i=0;i<dim;i++)
 {
  for(int j=dim-1;j>i;j--)
  {
    if(lst1[j]<lst1[i])
    {
     min=lst1[j];
     lst1[j]=lst1[i];
     lst1[i]=min;
     int val=lst2[j];
     lst2[j]=lst2[i];
     lst2[i]=val;
    }
   }
  }


delete [] lst1;
 }


Revision:	5
Committed:	Tue Jun 12 20:26:34 2007 UTC (17 years, 11 months ago)
Original Path:	*magic/lib/solveur/solveur/src/sl_update.cpp*
File size:	1441 byte(s)
Log Message:
#	Rev	Content
1	5	#include "gestionversion.h"
2		//---------------------------------------------------------------------------
3
4		#pragma hdrstop
5
6		#include "sl_update.h"
7		//---------------------------------------------------------------------------
8		#pragma package(smart_init)
9
10
11
12		SL_UPDATE::SL_UPDATE()
13		{
14		}
15
16		SL_UPDATE::~SL_UPDATE()
17		{
18		}
19
20
21		void SL_UPDATE::get_new_val(doubleold_val,doubleadd_val)
22		{
23
24		for(int i=0;i<6;i++)
25		{
26		old_val[i]+=add_val[i];
27		}
28
29		}
30
31
32		void SL_UPDATE::extract_solution(FEM_SOLUTION* mgsol,double*sol,int lgxcl,int a,int b)
33		{
34
35		for(int i=0;i<lgxcl;i++)
36		{
37		sol[i]=mgsol->lire(a,lgxcl*b+i);
38		}
39
40		}
41
42
43		void SL_UPDATE::remettre_a_zeros(double*t,int taille)
44		{
45		for(int i=0;i<taille;i++)
46		{
47		t[i]=0.0;
48		}
49
50		}
51
52
53		void SL_UPDATE::update_la_solution(FEM_SOLUTION* mgsol,double* t,int lgxcl, int a,int b)
54		{
55		for(int i=0;i<lgxcl;i++)
56		{
57		double val_sol=mgsol->lire(a,lgxcl*b+i);
58		val_sol+=t[i];
59		mgsol->ecrire(a,lgxcl*b+i,val_sol);
60		}
61
62		}
63
64
65		void SL_UPDATE::get_list_trie(int* llst1,int* lst2,int dim)
66		{
67
68		int* lst1=new int[dim];
69		for(int i=0;i<dim;i++)
70		{
71		lst1[i]=llst1[i];
72		lst2[i]=i;
73		}
74		int min=lst1[0];
75		for(int i=0;i<dim;i++)
76		{
77		for(int j=dim-1;j>i;j--)
78		{
79		if(lst1[j]<lst1[i])
80		{
81		min=lst1[j];
82		lst1[j]=lst1[i];
83		lst1[i]=min;
84		int val=lst2[j];
85		lst2[j]=lst2[i];
86		lst2[i]=val;
87		}
88		}
89		}
90
91
92		delete [] lst1;
93		}
94
95
96
97