📄 approx_unique.m
字号:
function [B, keep] = approx_unique(A, thresh, flag)% APPROX_UNIQUE Return elements of A that differ from the rest by less than thresh% B = approx_unique(A, thresh)% B = approx_unique(A, thresh, 'rows')keep = [];if nargin < 3 | isempty(flag) A = sort(A) B = A(1); for i=2:length(A) if ~approxeq(A(i), A(i-1), thresh) B = [B A(i)]; keep = [keep i]; end endelse% A = sortrows(A);% B = A(1,:);% for i=2:size(A,1)% if ~approxeq(A(i,:), A(i-1,:), thresh)% B = [B; A(i,:)];% keep = [keep i];% end% end B = []; for i=1:size(A,1) duplicate = 0; for j=i+1:size(A,1) if approxeq(A(i,:), A(j,:), thresh) duplicate = 1; break; end end if ~duplicate B = [B; A(i,:)]; keep = [keep i]; end endend
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -