--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/main/strings/str2double.m	Fri Jan 23 08:22:24 2004 +0000
@@ -0,0 +1,172 @@
+function [num,status,strarray] = str2double(s,cdelim,rdelim)
+## STR2DOUBLE converts strings into numeric values
+##    [NUM, status] = STR2DOUBLE(STR) 
+##  
+##    STR can be the form '[+-]d[.]dd[[eE][+-]ddd]' 
+##	d can be any of digit from 0 to 0
+##       [] indicate optional elements
+##    NUM is the corresponding numeric value. 
+##       if the conversion fails, status is -1 and NUM is NaN.  
+##    status = 0: conversion was successful
+##    status = -1: couldnot convert string into numeric value
+##
+##    STR can also contain multiple elements. 
+##        Then, NUM and status return matrices of appropriate size. 
+##    Row-delimiters are: 
+##        NEWLINE, CARRIAGE RETURN and SEMICOLON i.e. ASCII 10, 13 and 59. 
+##    Column-delimiters are: 
+##        TAB, SPACE and COMMA i.e. ASCII 9, 32, and 44.
+##    Elements which are not defined or not valid return NaN and 
+##        the status flag becomes -1 
+##
+##    For compatibility with previous versions, 
+##      NUM = STR2NUM(STR) 
+##	returns empty matrix [] if conversion fails. 
+##
+##    Examples: 
+##	str2num('-.1e-5')
+##	   ans = -1.0000e-006
+##
+## 	str2num('.314e1, 44.44e-1, .7; -1e+1')
+##	ans =
+##	    3.1400    4.4440    0.7000
+##	  -10.0000       NaN       NaN
+##
+##	line ='200,300,400,cd,yes,no,999,maybe,do_something_bad';
+##	[x,status]=str2num(line)
+##	x =
+##	   200   300   400   NaN   NaN   NaN   999   NaN   NaN
+##	status =
+##	   0   0   0  -1  -1  -1   0  -1  -1
+##
+##	x=str2num(line)
+##	   x = [](0x0)
+
+
+## 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., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
+
+##	Copyright (C) 2004 by Alois Schloegl
+##	a.schloegl@ieee.org	
+
+
+%%valid_char='0123456789eE+-.nNaAiIfF';	% digits, sign, exponent,NaN,Inf
+cdelim = char([9,32,abs(',')]);		% column delimiter
+rdelim = char([10,13,abs(';')]);	% row delimiter
+
+num = [];
+status = 0;
+strarray = {};
+
+k1 = 0; % current row
+nc = 0;	% number of columns 
+if size(s,1)>1,				%% char array transformed into a string. 
+	s = [s';char(repmat(13,1,size(s,1)))];
+	s = s(:).';
+end;
+while ~isempty(s),
+        [u,s] = strtok(s,rdelim);	%% get next row 
+        if isempty(u), return; end;
+        k1 = k1 + 1;
+        num(k1,:) = nan;		%% add row to output matrix 
+        status(k1,:) = 0;
+	k2 = 0;
+
+while ~isempty(u),
+        [t,u] = strtok(u,cdelim);	%% get next element
+        if ~isempty(t),
+        k2 = k2 + 1;
+        if k2 > nc,			%% add column if neccessary
+                num(:,k2) = nan;
+                status(:,k2) = 0;
+                nc = k2;
+        end;
+        strarray{k1,k2} = t;
+        
+        epos=find((t=='e') | (t=='E'));		%% positon of E 
+        if (length(epos)>1), 			%% if more than one E is found 
+		status(k1,k2) = -1;		%% return error code
+        else				
+                if length(epos)==0, 		%% no E found 
+                        e = 0;
+                        epos = length(t)+1;	
+                elseif (length(epos)==1), 	%% one E found
+                        l = epos+1;
+                        if ~any(t(length(t))=='0123456789'); %last character must be a digit
+                                e = nan;
+                                status(k1,k2) = -1;
+                        else
+                                % get exponent
+                                v = 0;
+                                g = 1;
+                                if t(l)=='-',
+                                        g=-1; l = l+1;
+                                elseif t(l)=='+',
+                                        l = l+1;
+                                end;
+                                while (t(l)==0), l=l+1; end;	%% skip leading zeros
+                                while l<=length(t),
+                                        if any(t(l)=='0123456789');
+                                                v = v*10+t(l)-48;        
+                                        else
+                                                v = nan;        
+		                                status(k1,k2) = -1;
+                                        end;
+                                        l = l+1;
+                                end;
+                                e = g*v;
+                        end;
+                end;
+                
+                %% get mantisse
+                g = 0;
+                v = 1;
+                if t(1)=='-',
+                        v = -1; l = 2;
+                elseif t(1)=='+',
+                        l = 2;
+                else
+                        l = 1;
+                end;
+                
+                if strcmpi(t(l:epos-1),'inf')
+                        v = v*inf;
+                        
+                elseif strcmpi(t,'NaN');
+                        v = NaN;
+                        
+        	elseif all(sum(t(1:epos-1)=='.')<[2,epos-1]), 	% at most one dot, and at least one digit is needed 
+                        while (t(l)==0), l=l+1; end;	%skip leading zeros
+                        p = 0;
+                        while l<epos,
+                                if any(t(l)=='0123456789');
+                                        g = g*10 + t(l) - 48;        
+                                elseif t(l)=='.',
+                                        p = epos-1-l;
+                                else
+                                        v = nan;        
+					status(k1,k2) = -1;
+                                end;
+                                l=l+1;        
+                        end;
+                        v = g*v*10^(e-p);
+                else
+			status(k1,k2) = -1;
+                        v = NaN;
+                end;
+                num(k1,k2) = v;
+	end;
+        end;
+end;        
+end;