Mercurial > hg > camir-aes2014
view toolboxes/FullBNT-1.0.7/KPMtools/find_equiv_posns.m @ 0:e9a9cd732c1e tip
first hg version after svn
author | wolffd |
---|---|
date | Tue, 10 Feb 2015 15:05:51 +0000 |
parents | |
children |
line wrap: on
line source
function p = find_equiv_posns(vsmall, vlarge) % FIND_EQUIV_POSNS p[i] = the place where vsmall[i] occurs in vlarge. % p = find_equiv_posns(vsmall, vlarge) % THE VECTORS ARE ASSUMED TO BE SORTED. % % e.g., vsmall=[2,8], vlarge=[2,7,8,4], p=[1,3] % % In R/S, this function is called 'match' %if ~mysubset(vsmall, vlarge) % error('small domain must occur in large domain'); %end if isempty(vsmall) | isempty(vlarge) p = []; return; end bitvec = sparse(1, max(vlarge)); %bitvec = zeros(1, max(vlarge)); bitvec(vsmall) = 1; p = find(bitvec(vlarge)); %p = find(ismember(vlarge, vsmall)); % slower