about summary refs log tree commit diff
path: root/sourcecodes/bnt-master/KPMtools/myintersect.m
diff options
context:
space:
mode:
authorziejd22018-03-14 23:23:33 -0500
committerGitHub2018-03-14 23:23:33 -0500
commit1ff6baa44e22b91eefb48aea6f3befa078c0489b (patch)
treee0fd79d2e32fd2aedda2eadaed0f19af3514c520 /sourcecodes/bnt-master/KPMtools/myintersect.m
parent6882395afdadf4e982b25b5215071a0932730950 (diff)
parentc80226899f5cdd9f11c163817d59445213f5bef0 (diff)
downloadBNW-1ff6baa44e22b91eefb48aea6f3befa078c0489b.tar.gz
Merge pull request #1 from ziejd2/octave_php_separate
Octave php separate
Diffstat (limited to 'sourcecodes/bnt-master/KPMtools/myintersect.m')
-rw-r--r--sourcecodes/bnt-master/KPMtools/myintersect.m28
1 files changed, 28 insertions, 0 deletions
diff --git a/sourcecodes/bnt-master/KPMtools/myintersect.m b/sourcecodes/bnt-master/KPMtools/myintersect.m
new file mode 100644
index 00000000..c1886efb
--- /dev/null
+++ b/sourcecodes/bnt-master/KPMtools/myintersect.m
@@ -0,0 +1,28 @@
+function C = myintersect(A,B)
+% MYINTERSECT Intersection of two sets of positive integers (much faster than built-in intersect)
+% C = myintersect(A,B)
+
+A = A(:)'; B = B(:)';
+
+if isempty(A)
+  ma = 0;
+else
+  ma = max(A);
+end
+
+if isempty(B)
+  mb = 0;
+else
+  mb = max(B);
+end
+
+if ma==0 || mb==0
+  C = [];
+else
+  %bits = sparse(1, max(ma,mb));
+  bits = zeros(1, max(ma,mb));
+  bits(A) = 1;
+  C = B(logical(bits(B)));  
+end
+
+%sum( bitget( bitand( cliquesb(i), cliquesb(j) ), 1:52 ) );