代码搜索：intersect
找到约 481 项符合「intersect」的源代码
代码结果 481
www.eeworm.com/read/102395/6233564
h button32.h
/*******************************************************************************
+
+ LEDA 4.5
+
+
+ button32.h
+
+
+ Copyright (c) 1995-2004
+ by Algorithmic Solutions Software GmbH
+ All right
www.eeworm.com/read/38039/1094729
mnu depth.mnu
DEPTH
#
Blind
Create with an adjustable depth.
#
Thru#Next
Intersect to next surface.
#
Thru#All
Intersect all surfaces.
#
Thru#Until
Intersect until the selected surface.
#
From#To
Intersect between
www.eeworm.com/read/241364/13151272
sql 10g_setops.sql
DECLARE
TYPE nested_type IS TABLE OF NUMBER;
nt1 nested_type := nested_type(1,2,3);
nt2 nested_type := nested_type(3,2,1);
nt3 nested_type := nested_type(2,3,1,3);
nt4 nested_
www.eeworm.com/read/130382/5958737
h searchfilter.h
/*____________________________________________________________________________
Copyright (C) 1998 Network Associates, Inc.
All rights reserved.
$Id: SearchFilter.h,v 1.3 1998/08/11 15:20:19 p
www.eeworm.com/read/338832/12278720
pl steiner2.pl
/*
By Neng-Fa Zhou
Use specialized propagator
The ternary Steiner problem of order n is to find n(n-1)/6 sets of elements in {1,2,...,n} such that
each set contains three elements and any two sets h
www.eeworm.com/read/127767/14336606
txt e658. combining shapes.txt
Area shape = new Area(shape1);
shape.add(new Area(shape2));
shape.subtract(new Area(shape3));
shape.intersect(new Area(shape4));
shape.exclusiveOr(new Area(shape5));
www.eeworm.com/read/490329/1201672
hxx ivu_geometry.hxx
// GLOBE (C) 1995-97, oliver & oliver
#define P_EPS_PARALLEL 0.000000001f
enum IVP_U_INTERSECT_TYPE {
IVP_U_INTERSECT_OK = 0,
IVP_U_INTERSECT_NO_INTERSECTION = 1,
IVP_U_INTERSECT_
www.eeworm.com/read/100285/6271519
h analyze.h
/*-------------------------------------------------------------------------
*
* analyze.h
*
*
* Copyright (c) 1994, Regents of the University of California
*
* $Id: analyze.h,v 1.7 1999/05/25 1
www.eeworm.com/read/347945/11623329
m robust_classify_variables.m
function [x,w,x_variables,w_variables,aux_variables,F,failure] = robust_classify_variables(F,h,ops,w);
failure = 0;
% Variables before expanding nonlinear operators
initial_variables = unique([de
www.eeworm.com/read/193277/8241802
m robust_classify_variables.m
function [x,w,x_variables,w_variables,aux_variables,F,failure] = robust_classify_variables(F,h,ops,w);
failure = 0;
% Variables before expanding nonlinear operators
initial_variables = unique([de