33 |
end; |
end; |
34 |
else; |
else; |
35 |
KK=varargin{(iSub-1)*2+2}; |
KK=varargin{(iSub-1)*2+2}; |
36 |
prof_sub=[1:MITprofSub.np]'; |
prof_sub=[1:length(MITprofSub.prof_lon)]'; |
37 |
if iSub~=1; error('''list'' subset should come first'); end; |
if iSub~=1; error('''list'' subset should come first'); end; |
38 |
end; |
end; |
39 |
|
KK=reshape(KK,length(KK),1); |
40 |
|
|
41 |
% [varargin{(iSub-1)*2+1} ' -- ' num2str(length(KK))] |
% [varargin{(iSub-1)*2+1} ' -- ' num2str(length(KK))] |
42 |
for iFld=1:length(fldNames); |
for iFld=1:length(fldNames); |
44 |
if strcmp('depth',varargin{(iSub-1)*2+1}) & strcmp(fldNames{iFld},'prof_depth'); |
if strcmp('depth',varargin{(iSub-1)*2+1}) & strcmp(fldNames{iFld},'prof_depth'); |
45 |
tmp1=tmp1(KK); |
tmp1=tmp1(KK); |
46 |
elseif strcmp('depth',varargin{(iSub-1)*2+1}); |
elseif strcmp('depth',varargin{(iSub-1)*2+1}); |
47 |
if size(tmp1,2)==length(MITprofSub.prof_depth); tmp1=tmp1(:,KK); end; |
if size(tmp1,2)==length(MITprof.prof_depth); tmp1=tmp1(:,KK); end; |
48 |
else; |
else; |
49 |
if size(tmp1,1)==size(prof_sub,1); tmp1=tmp1(KK,:); end; |
if size(tmp1,1)==size(prof_sub,1); tmp1=tmp1(KK,:); end; |
50 |
end; |
end; |