代码搜索：intersect
找到约 481 项符合「intersect」的源代码
代码结果 481
www.eeworm.com/read/219349/14886963
m examp10_2.m
A={'skhsak','ssd','ssfa'}; B={'sdsd','ssd','sssf'}; F=union(A,B) % 并集
D=intersect(A,B) % 交集
C={'jsg','sjjfs','ssd'}; % 可以由下面的集合运算验证结合律
E=setdiff(union(intersect(A,B),intersect(C,B)),interse
www.eeworm.com/read/219349/14887255
m examp10_3.m
A={'skhsak','ssd','ssfa'}; B={'sdsd','ssd','sssf'}; F=union(A,B) % 并集
E=union(A,B); F=intersect(A,B); key=all(ismember(F,E))
key=all(ismember(A,A)) & (length(setdiff(A,A))>0);
key1=all(ismember(
www.eeworm.com/read/115326/15018045
c intersectionmanuel.c
/*
ACM International Collegiate Programming Contest
1995-96 Southwestern European Regional Contest
ETH Zurich, Switzerland
Decmeber 9, 1995
Problem: Intersection
Idea: Andrea Kennel, ETH Zurich
www.eeworm.com/read/393250/8302444
txt 2.26.txt
//hc的初始状态是没有头结点的！
void Intersect(LinkList &hc, LinkList ha, LinkList hb)
{
LNode *pa,*pb,*pc,*prea;
pa=ha->next;
pb=hb->next;
hc=ha;
pc=hc;
while(pa&&pb){
if(pa->
www.eeworm.com/read/210839/15191734
il cdw_axllinexline.il
; line segment intersection determining SKILL function
; Written by: Chris Walters Nvidia 2002/06/19
;
; Description:
; This SKILL function will determine whether two 2D line segments intersect
www.eeworm.com/read/385008/8824418
m smith_circles.m
function smith_circles(centre, radius, colour_linestyle, segments)
%SMITH_CIRCLES Draw circles on a Smith Chart.
% SMITH_CIRCLES(CENTRE, RADIUS, COLOUR_LINESTYLE, SEGMENTS) has the
% following par
www.eeworm.com/read/169988/9826006
cpp nonrobustlineintersector.cpp
/**********************************************************************
* $Id: NonRobustLineIntersector.cpp,v 1.9.2.1 2005/05/23 17:10:08 strk Exp $
*
* GEOS - Geometry Engine Open Source
* http:/
www.eeworm.com/read/361531/10047967
m constructsgirth-sixqc-ldpc.m
% This program constructs coumn-weight three girth six quasi-cyclic LDPC codes given
% k( row weight, j(column-weight) is fixed at 3) and m (size of each sub-matrix). The
% program constructs a dist
www.eeworm.com/read/279550/10421010
txt noj 线段相交.txt
#include
#include
#include
using namespace std;
//NOJ 线段相交
/*
输入：
1234567890123456 9876543210987654
1234567890123457 9876543210987655
1234567890123457 98765432
www.eeworm.com/read/455592/7369764
txt noj 线段相交.txt
#include
#include
#include
using namespace std;
//NOJ 线段相交
/*
输入：
1234567890123456 9876543210987654
1234567890123457 9876543210987655
1234567890123457 98765432