代码搜索：intersect
找到约 481 项符合「intersect」的源代码
代码结果 481
www.eeworm.com/read/181930/9225197
txt readme.txt
编译：mpicc intersect.c –o intersect
运行：可以使用命令 mpirun –np SIZE intersect来运行该串匹配程序，其中SIZE是所使用的处理器个数，本实例中使用了SIZE=3个处理器。
mpirun –np 3 intersect
运行结果：
输入：
please input first polygon
please input the coun
www.eeworm.com/read/376593/9312520
m examp10_1.m
A=[1,4,5,8,7,3]; B=[2,4,6,8,10]; C=[1,7,4,2,7,9,8]; % 集合定义
D=unique(C) % 求解唯一运算，可见从 C 中剔除了重复的 7
E=union(A,B) % 求出并集
F=intersect(A,B) % 求出交集
G=setdiff(intersect(union(A,B),C),union(inte
www.eeworm.com/read/376593/9313057
m supc.m
function b=supc(c,x)
[pm,pn]=size(c); b=[]; d=[0];
for i=1:pm
[q,w]=size(intersect(c(i,:),x));
if w~=0, b=cat(2,b,c(i,:)); end
end
bb=unique(b); b=setdiff(bb,0);
www.eeworm.com/read/372757/9494587
m pmxindexxover.m
function [c1,c2] = pmxIndexXover(p1,p2,bounds,Ops)
%there is an PMX xover
pm=Ops(2); %the probility of xover
rN=rand
www.eeworm.com/read/362501/9995550
m findcommon.m
function c = findcommon(a,b)
%*************************************************************************
%* Copyright c 2001 The board of trustees of the Leland Stanford *
%*
www.eeworm.com/read/361532/10047963
m girth-eightqc-ldpc.m
% This program constructs coumn-weight four girth 8 quasi-cyclic LDPC codes given
% k( row weight, j(column weight) is fixed at 4) and m (size of each sub-matrix). The
% program constructs a distanc
www.eeworm.com/read/421211/10750508
h box.h
/* ColDet - C++ 3D Collision Detection Library
* Copyright (C) 2000 Amir Geva
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Li
www.eeworm.com/read/469138/6978166
txt 矩形切割.txt
//矩形切割
//intersect函数构造矩形a和b的交集
//cut函数将b关于a进行切割,用切下的矩形作参数调用dummy函数
struct rect{
int x1,x2,y1,y2;
rect(){}
rect(int a,int b,int c,int d):x1(a),x2(b),y1(c),y2(d){}
};
inline rect intersect(
www.eeworm.com/read/460783/7240733
txt 矩形切割.txt
//矩形切割
//intersect函数构造矩形a和b的交集
//cut函数将b关于a进行切割,用切下的矩形作参数调用dummy函数
struct rect{
int x1,x2,y1,y2;
rect(){}
rect(int a,int b,int c,int d):x1(a),x2(b),y1(c),y2(d){}
};
inline rect intersect(
www.eeworm.com/read/457804/7317604
txt 矩形切割.txt
//矩形切割
//intersect函数构造矩形a和b的交集
//cut函数将b关于a进行切割,用切下的矩形作参数调用dummy函数
struct rect{
int x1,x2,y1,y2;
rect(){}
rect(int a,int b,int c,int d):x1(a),x2(b),y1(c),y2(d){}
};
inline rect intersect(