From 6a320264c2de3d6dd8cc1d1327b3c30df4c8cb26 Mon Sep 17 00:00:00 2001
From: Siddhesh Wani
Date: Mon, 25 May 2015 14:46:31 +0530
Subject: Original Version

---
 2.3-1/src/c/auxiliaryFunctions/find2d/zfind2da.c | 36 ++++++++++++++++++++++++
 1 file changed, 36 insertions(+)
 create mode 100644 2.3-1/src/c/auxiliaryFunctions/find2d/zfind2da.c

(limited to '2.3-1/src/c/auxiliaryFunctions/find2d/zfind2da.c')

diff --git a/2.3-1/src/c/auxiliaryFunctions/find2d/zfind2da.c b/2.3-1/src/c/auxiliaryFunctions/find2d/zfind2da.c
new file mode 100644
index 00000000..a8fa4962
--- /dev/null
+++ b/2.3-1/src/c/auxiliaryFunctions/find2d/zfind2da.c
@@ -0,0 +1,36 @@
+/*
+ *  Scilab ( http://www.scilab.org/ ) - This file is part of Scilab
+ *  Copyright (C) 2007-2008 - INRIA - Arnaud TORSET
+ *
+ *  This file must be used under the terms of the CeCILL.
+ *  This source file is licensed as described in the file COPYING, which
+ *  you should have received as part of this distribution.  The terms
+ *  are also available at
+ *  http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
+ *
+ */
+
+#include "find2d.h"
+
+void zfind2da(doubleComplex* x, int rows, int columns, double* out1,int* indiceOut1, double* out2,int* indiceOut2,int max) {
+  int i = 0, j=0;
+  indiceOut1[1] = 0;
+  
+  /* if out are empties */
+  out1[0]=-1;
+  out2[0]=-1;
+  
+  for	(j = 0; j < columns ; ++j){
+  	 for (i = 0; i < rows ; ++i) {
+            /*to avoid useless search if we only want to find the  max first founded value   */
+            if (indiceOut1[1] == max  ) return ;
+	    if ((zreals(x[j*rows+i]) != 0) || (zimags(x[j*rows+i])!=0) ) {
+	    	
+		out1[indiceOut1[1]] = (double)(i+1);
+		out2[indiceOut1[1]] = (double)(j+1);
+		indiceOut1[1]++;
+	    }
+	}
+  }
+  indiceOut2[1]=indiceOut1[1];
+}
-- 
cgit