X-Git-Url: https://git.creatis.insa-lyon.fr/pubgit/?a=blobdiff_plain;f=packages%2Fstd%2Fsrc%2FbbstdVectorFilterDouble.cxx;h=c132e918a19f4bdf67b98d34977c885849eeb50b;hb=8e21d66a76ff9117acc7dbbaec9123c56115ff56;hp=30798dffb8d168dd85123b3f04c2f38627fae647;hpb=fc51206edaff3b433039cb38969d308e750fc277;p=bbtk.git

diff --git a/packages/std/src/bbstdVectorFilterDouble.cxx b/packages/std/src/bbstdVectorFilterDouble.cxx
index 30798df..c132e91 100644
--- a/packages/std/src/bbstdVectorFilterDouble.cxx
+++ b/packages/std/src/bbstdVectorFilterDouble.cxx
@@ -15,7 +15,6 @@ BBTK_BLACK_BOX_IMPLEMENTATION(VectorFilterDouble,bbtk::AtomicBlackBox);
 //===== 
 void VectorFilterDouble::Process()
 {
-
 // THE MAIN PROCESSING METHOD BODY
 //   Here we simply set the input 'In' value to the output 'Out'
 //   And print out the output value
@@ -27,7 +26,6 @@ void VectorFilterDouble::Process()
 //      (the one provided in the attribute 'name' of the tag 'input')
 //    * TYPE is the C++ type of the input/output
 //      (the one provided in the attribute 'type' of the tag 'input')
-
 	std::vector< std::vector<double> * >  pLstVec;  
 	std::vector< std::vector<double> * >  pLstVecOut;  
 	std::vector<double> In0 = bbGetInputIn0();
@@ -40,7 +38,6 @@ void VectorFilterDouble::Process()
 	std::vector<double> In7 = bbGetInputIn7();
 	std::vector<double> In8 = bbGetInputIn8();
 	std::vector<double> In9 = bbGetInputIn9();
-
 	if (bbGetInputIn0().size()!=0) { pLstVec.push_back( &In0 ); }
 	if (bbGetInputIn1().size()!=0) { pLstVec.push_back( &In1 ); }
 	if (bbGetInputIn2().size()!=0) { pLstVec.push_back( &In2 ); }
@@ -51,7 +48,6 @@ void VectorFilterDouble::Process()
 	if (bbGetInputIn7().size()!=0) { pLstVec.push_back( &In7 ); }
 	if (bbGetInputIn8().size()!=0) { pLstVec.push_back( &In8 ); }
 	if (bbGetInputIn9().size()!=0) { pLstVec.push_back( &In9 ); }
-
 	std::vector<double> Out0;
 	std::vector<double> Out1;
 	std::vector<double> Out2;
@@ -62,7 +58,6 @@ void VectorFilterDouble::Process()
 	std::vector<double> Out7;
 	std::vector<double> Out8;
 	std::vector<double> Out9;
-
 	pLstVecOut.push_back( &Out0 );
 	pLstVecOut.push_back( &Out1 );
 	pLstVecOut.push_back( &Out2 );
@@ -73,49 +68,48 @@ void VectorFilterDouble::Process()
 	pLstVecOut.push_back( &Out7 );
 	pLstVecOut.push_back( &Out8 );
 	pLstVecOut.push_back( &Out9 );
-
-
 	if (bbGetInputType()==0)  // Erase duplicate lines
 	{
-		bool okSizeVec=true;
-		int ipLstvec; 
-		for (ipLstvec=1;ipLstvec<pLstVec.size();ipLstvec++)
-		{
-			if ( (*pLstVec[ipLstvec]).size()!=(*pLstVec[0]).size() )  { okSizeVec=false; }
-		}
-		if ( okSizeVec==false)
+		if (bbGetInputIn0().size()!=0)  // At least one element 
 		{
-			printf("EED VectorFilterDouble::Process WARNING! vectors are not of the same size.\n");
-		} else {
-			int iLine;
-			int ipLstvec2; 
-			bool okLine;
-			for (iLine=0 ; iLine < (*pLstVec[0]).size() ; iLine++ ) 
+			bool okSizeVec=true;
+			int ipLstvec; 
+			for (ipLstvec=1;ipLstvec<pLstVec.size();ipLstvec++)
 			{
-				okLine=false;
-				for ( ipLstvec2=0 ; ipLstvec2<pLstVec.size() ; ipLstvec2++)
-				{
-					if ( (*pLstVec[ipLstvec2])[iLine]!=(*pLstVec[ipLstvec2])[iLine-1] )  { okLine=true; }
-				} // for ipLstVec2
-						
-				if ( (okLine==true) || (iLine==0) ) 
+				if ( (*pLstVec[ipLstvec]).size()!=(*pLstVec[0]).size() )  { okSizeVec=false; }
+			}
+			if ( okSizeVec==false)
+			{
+				printf("EED VectorFilterDouble::Process WARNING! vectors are not of the same size.\n");
+			} else {
+				int iLine;
+				int ipLstvec2; 
+				bool okLine;
+				for (iLine=0 ; iLine < (*pLstVec[0]).size() ; iLine++ ) 
 				{
-					for (ipLstvec2=0 ; ipLstvec2<pLstVec.size() ; ipLstvec2++)
+					okLine=false;
+					for ( ipLstvec2=0 ; ipLstvec2<pLstVec.size() ; ipLstvec2++)
+					{
+						if ( (*pLstVec[ipLstvec2])[iLine]!=(*pLstVec[ipLstvec2])[iLine-1] )  { okLine=true; }
+					} // for ipLstVec2
+							
+					if ( (okLine==true) || (iLine==0) ) 
 					{
-						(*pLstVecOut[ipLstvec2]).push_back( (*pLstVec[ipLstvec2])[iLine] );
-					} // for
-				} // if okLine
-			} // for iLine
-		} // if okSizeVec
+						for (ipLstvec2=0 ; ipLstvec2<pLstVec.size() ; ipLstvec2++)
+						{
+							(*pLstVecOut[ipLstvec2]).push_back( (*pLstVec[ipLstvec2])[iLine] );
+						} // for
+					} // if okLine
+				} // for iLine
+			} // if okSizeVec
+		} // bbGetInputIn0()  size
 	} // Type==0
-
-
 	if (bbGetInputType()==1) // Resize vector
 	{
 		int		ipLstvec2;
 		double	iLine;
 		int 	sizeLines	= (*pLstVec[0]).size();
-		double 	step		= (double)sizeLines/((double)bbGetInputk1()-1);
+		double 	step		= (double)sizeLines/((double)bbGetInputk1()[0]-1);
 		for (iLine=0 ; iLine<sizeLines ; iLine=iLine+step)
 		{
 			for (ipLstvec2=0 ; ipLstvec2<pLstVec.size() ; ipLstvec2++)
@@ -123,15 +117,12 @@ void VectorFilterDouble::Process()
 				(*pLstVecOut[ipLstvec2]).push_back( (*pLstVec[ipLstvec2])[(int)iLine] );
 			} // for			
 		} // for ipLstVec
-
 		// adding the lastone
 		for (ipLstvec2=0 ; ipLstvec2<pLstVec.size() ; ipLstvec2++)
 		{
 			(*pLstVecOut[ipLstvec2]).push_back( (*pLstVec[ipLstvec2])[(int)(sizeLines-1)] );
-		} // for			
-
+		} // for
 	} // Type==1
-
 	if (bbGetInputType()==2) // Insert intermediate points
 	{
 		int		ipLstvec;
@@ -153,9 +144,7 @@ void VectorFilterDouble::Process()
 			} // if size>=2
 		} // for pLstVec		
 	} // Type==2
-
-
-	if (bbGetInputType()==3) // Addition  k1
+	if (bbGetInputType()==3) // Addition  k1[0]
 	{
 		int		ipLstvec;
 		int 	i;
@@ -166,13 +155,12 @@ void VectorFilterDouble::Process()
 			size=(*pLstVec[ipLstvec]).size();
 			for (i=0;i<size;i++)
 			{
-				result= (*pLstVec[ipLstvec])[i] + bbGetInputk1() ;
+				result= (*pLstVec[ipLstvec])[i] + bbGetInputk1()[0] ;
 				(*pLstVecOut[ipLstvec]).push_back( result );				
 			}// for size
 		} // for pLstVec		
 	} // Type==3
-
-	if (bbGetInputType()==4) // Substraction  k1
+	if (bbGetInputType()==4) // Substraction  k1[0]
 	{
 		int		ipLstvec;
 		int 	i;
@@ -183,13 +171,12 @@ void VectorFilterDouble::Process()
 			size=(*pLstVec[ipLstvec]).size();
 			for (i=0;i<size;i++)
 			{
-				result= (*pLstVec[ipLstvec])[i] - bbGetInputk1() ;
+				result= (*pLstVec[ipLstvec])[i] - bbGetInputk1()[0] ;
 				(*pLstVecOut[ipLstvec]).push_back( result );				
 			}// for size
 		} // for pLstVec		
 	} // Type==4
-
-	if (bbGetInputType()==5) // Multiplication  k1
+	if (bbGetInputType()==5) // Multiplication  k1[0]
 	{
 		int	ipLstvec;
 		int 	i;
@@ -200,15 +187,12 @@ void VectorFilterDouble::Process()
 			size=(*pLstVec[ipLstvec]).size();
 			for (i=0;i<size;i++)
 			{
-				result= (*pLstVec[ipLstvec])[i] * bbGetInputk1() ;
+				result= (*pLstVec[ipLstvec])[i] * bbGetInputk1()[0] ;
 				(*pLstVecOut[ipLstvec]).push_back( result );				
 			}// for size
 		} // for pLstVec		
 	} // Type==5
-
-	if (bbGetInputType()==6) // Division  k1ng gadget (node check, owner GtkCheckButton)
-
-
+	if (bbGetInputType()==6) // Division  k1
 	{
 		int	ipLstvec;
 		int 	i;
@@ -219,9 +203,9 @@ void VectorFilterDouble::Process()
 			size=(*pLstVec[ipLstvec]).size();
 			for (i=0;i<size;i++)
 			{
-				if (bbGetInputk1()!=0)
+				if (bbGetInputk1()[0]!=0)
 				{
-					result= (*pLstVec[ipLstvec])[i] / bbGetInputk1() ;
+					result= (*pLstVec[ipLstvec])[i] / bbGetInputk1()[0] ;
 					(*pLstVecOut[ipLstvec]).push_back( result );				
 				} else {
 					printf("EED VectorFilterDouble::Process  Warning!! Div by 0 in Type 6 \n");
@@ -230,9 +214,6 @@ void VectorFilterDouble::Process()
 			}// for size
 		} // for pLstVec		
 	} // Type==6
-
-
-
 	if (bbGetInputType()==7) 
 	{
 		int i,j;
@@ -242,18 +223,13 @@ void VectorFilterDouble::Process()
 			Out1.push_back( In5[j] );
 			Out2.push_back( In6[j] );
 		} //
-
-
 		int iGeneral=0,sizeI,sizeLst1Indexes=In3.size();
 		for (i=0; i<sizeLst1Indexes-1;i++) { iGeneral=iGeneral+In3[i]; }
 		sizeI=iGeneral+In3[ sizeLst1Indexes-1 ];
-
 		int jGeneral = 0;
 		int sizeJ	 = In7[ 0 ];
-
 		double dist2,dist2Min,dx,dy,dz;
 		int iBack;
-
 		for (j=jGeneral;j<sizeJ;j++) 
 		{
 			dist2Min=1000000;
@@ -273,19 +249,12 @@ void VectorFilterDouble::Process()
 			Out1[j]=In1[iBack]; 
 			Out2[j]=In2[iBack]; 
 		} // for i
-
-
 	}	// Type 7
-
-
-
 	if (bbGetInputType()==8)   // order all vectors using as base the vector In0
 	{
 		double tmp;
 		int i,j,ii,sizeII;
 		sizeII=pLstVec.size();
-
-
 		int size=In0.size();
 		for (i=0;i<size; i++)
 		{
@@ -299,8 +268,7 @@ void VectorFilterDouble::Process()
 			for (j=i;j<size;j++)
 			{
 				if ((*pLstVecOut[0])[j] <= (*pLstVecOut[0])[i] ) 
-				{	
-					
+				{
 					for (ii=0;ii<sizeII;ii++)
 					{
 						tmp = (*pLstVecOut[ii])[i]; 
@@ -311,14 +279,11 @@ void VectorFilterDouble::Process()
 			} // for j
 		} // for i
  	} // Type 8
-
-
 	if (bbGetInputType()==9)   // Invert vectors
 	{
 		double tmp;
 		int i,j,ii,sizeII;
 		sizeII=pLstVec.size();
-
 		int size=In0.size();
 		int size2=size/2;
 		for (i=0;i<size; i++)
@@ -328,7 +293,6 @@ void VectorFilterDouble::Process()
 				 (*pLstVecOut[ii]).push_back( (*pLstVec[ii])[i] ); 
 			} // for ii
 		} // i
-
 		for (i=0;i<size2;i++)
 		{
 			for (ii=0;ii<sizeII;ii++)
@@ -340,14 +304,11 @@ void VectorFilterDouble::Process()
 			} // for ii
 		} // for i
  	} // Type 9
-
-
-	if (bbGetInputType()==10)   // Invert vectors
+	if (bbGetInputType()==10)   // Nearest point in vector
 	{
 		int	sizeLstX	=	In0.size();   // lstX
 		int	sizeLstY	=	In1.size();   // lstY
 		int	sizeLstZ	=	In2.size();   // lstZ
-		printf("EED Warnning VectorFilterDouble::Process() %d  %d  %d  %d\n", sizeLstX,sizeLstY,sizeLstZ,In3.size() );
 		if ( (sizeLstX==sizeLstY) && (sizeLstY==sizeLstZ) && (sizeLstX>0) && (In3.size()==3) )
 		{
 			int i;
@@ -382,8 +343,130 @@ void VectorFilterDouble::Process()
 			printf("EED Warnning VectorFilterDouble::Process()   For Type 10 the size of the vectors are not coherent.\n");
 		}// if size
  	} // Type 10
-
-
+    if (bbGetInputType()==11)   // Nearest point in vector
+    {
+        int i;
+        int    sizeLstX    =    In0.size();   // lstX
+        int    sizeLstY    =    In1.size();   // lstY
+        int    sizeLstZ    =    In2.size();   // lstZ
+        std::vector<double> spc = bbGetInputk1();
+        if (spc.size()>=1)
+        {
+            for (i=0;i<sizeLstX; i++)
+            {
+                Out0.push_back( In0[i]*spc[0] );
+            } // for i
+        } else {
+            printf("EED Warnning VectorFilterDouble::Process()   For Type 11 the K1 vector (spacing) is not coherent.\n");
+        }// if size
+        if (spc.size()>=2)
+        {
+            for (i=0;i<sizeLstY; i++)
+            {
+                Out1.push_back( In1[i]*spc[1] );
+            } // for i
+        } else {
+            printf("EED Warnning VectorFilterDouble::Process()   For Type 11 the K1 vector (spacing) is not coherent.\n");
+        }// if size
+        if (spc.size()>=3)
+        {
+            for (i=0;i<sizeLstZ; i++)
+            {
+                Out2.push_back( In2[i]*spc[2] );
+            } // for i
+        } else {
+            printf("EED Warnning VectorFilterDouble::Process()   For Type 11 the K1 vector (spacing) is not coherent.\n");
+        }// if size
+     } // Type 11
+    if (bbGetInputType()==12)   // Nearest point in vector
+    {
+        int i;
+        int sizeLstX    =    In0.size();   // lstX
+        int sizeLstY    =    In1.size();   // lstY
+        int sizeLstZ    =    In2.size();   // lstZ
+        std::vector<double> spc = bbGetInputk1();
+        if (spc.size()>=1)
+        {
+            if (spc[0]!=0)
+            {
+                for (i=0;i<sizeLstX; i++)
+                {
+                    Out0.push_back( In0[i]/spc[0] );
+                } // for i
+            } // if spc !=0
+        } else {
+            printf("EED Warnning VectorFilterDouble::Process()   For Type 12 the K1 vector (spacing) is not coherent.\n");
+        }// if size
+        if (spc.size()>=2)
+        {
+            if (spc[0]!=0)
+            {
+                for (i=0;i<sizeLstY; i++)
+                {
+                    Out1.push_back( In1[i]/spc[1] );
+                } // for i
+            } // if spc !=0
+        } else {
+            printf("EED Warnning VectorFilterDouble::Process()   For Type 12 the K1 vector (spacing) is not coherent.\n");
+        }// if size
+        if (spc.size()>=3)
+        {
+            if (spc[0]!=0)
+            {
+                for (i=0;i<sizeLstZ; i++)
+                {
+                    Out2.push_back( In2[i]/spc[2] );
+                } // for i
+            } // if spc !=0
+        } else {
+            printf("EED Warnning VectorFilterDouble::Process()   For Type 12 the K1 vector (spacing) is not coherent.\n");
+        }// if size
+     } // Type 12
+    if (bbGetInputType()==13)   // Distance point 3D between In0 and In1
+    {
+        if ( In0.size()==3 and In1.size()==3)
+        {
+            double x = In0[0] - In1[0];
+            double y = In0[1] - In1[1];
+            double z = In0[2] - In1[2];
+            Out0.push_back( sqrt( x*x +y*y +z*z ) );
+        }
+     } // Type 13
+    if (bbGetInputType()==14)   // Select segments
+    {
+        if ( (In0.size()==In1.size()) && (In0.size()==In2.size() ) )
+        {
+            if (bbGetInputk1().size()==0)  // not filter , just passing all segmentes
+            {
+                Out0 = In0;
+                Out1 = In1;
+                Out2 = In2;
+                Out3 = In3;
+            } else {
+                std::vector<double> k1 =bbGetInputk1();
+                int iSeg, sizeLstIndex = In3.size();
+                int iGeneral=0;
+                int i, size;
+                for (iSeg = 0; iSeg<sizeLstIndex; iSeg++)
+                {
+                    size = In3[iSeg];
+                    if (std::find(k1.begin(), k1.end(),iSeg)!=k1.end() )  // checking if element exist inside
+                    {
+                        Out3.push_back(size);
+                        for (i=0; i<size; i++)
+                        {
+                            Out0.push_back( In0[iGeneral] );
+                            Out1.push_back( In1[iGeneral] );
+                            Out2.push_back( In2[iGeneral] );
+                            iGeneral++;
+                        } // for i
+                    } else {
+                        iGeneral=iGeneral+size;
+                    }
+                } // for iSeg
+            } // if k1 not empty
+        }
+     } // Type 14
 
 	bbSetOutputOut0( Out0 );
 	bbSetOutputOut1( Out1 );
@@ -396,44 +479,42 @@ void VectorFilterDouble::Process()
 	bbSetOutputOut8( Out8 );
 	bbSetOutputOut9( Out9 );
 }
+
 //===== 
 // Before editing this file, make sure it's a file of your own (i.e.: it wasn't generated from xml description; if so : your modifications will be lost)
 //===== 
 void VectorFilterDouble::bbUserSetDefaultValues()
 {
-
 //  SET HERE THE DEFAULT INPUT/OUTPUT VALUES OF YOUR BOX 
 //    Here we initialize the input 'In' to 0
-   bbSetInputType(0);
-   bbSetInputk1(0);
-  
+    bbSetInputType(0);
+    std::vector<double> k1;
+    k1.push_back(0);
+    bbSetInputk1(k1);
 }
+
 //===== 
 // Before editing this file, make sure it's a file of your own (i.e.: it wasn't generated from xml description; if so : your modifications will be lost)
 //===== 
 void VectorFilterDouble::bbUserInitializeProcessing()
 {
-
 //  THE INITIALIZATION METHOD BODY :
 //    Here does nothing 
 //    but this is where you should allocate the internal/output pointers 
-//    if any 
-
-  
+//    if any
 }
+
 //===== 
 // Before editing this file, make sure it's a file of your own (i.e.: it wasn't generated from xml description; if so : your modifications will be lost)
 //===== 
 void VectorFilterDouble::bbUserFinalizeProcessing()
 {
-
 //  THE FINALIZATION METHOD BODY :
 //    Here does nothing 
 //    but this is where you should desallocate the internal/output pointers 
 //    if any
-  
-}
 }
-// EO namespace bbstd
+
+}// EO namespace bbstd