代码搜索：splitting

找到约 525 项符合「splitting」的源代码

代码结果 525
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/215323/15065119

c split.c

/* Split.c determine optimal cuts for splitting a region this file is part of Divonne last modified 7 Mar 05 th */ #define BNDTOL .05 #define FRACT .5 #define BIG 1e10 #define SINGTOL 1e-4 #
·
www.eeworm.com/read/144212/5752919

bash xfind.bash

#! /bin/bash #From: kaz@cafe.net (Kaz Kylheku) #Newsgroups: comp.unix.shell #Subject: Why not roll your own @#$% find! (was: splitting directory off from filename) #Message-ID:
·
www.eeworm.com/read/16793/690875

bash xfind.bash

#! /bin/bash #From: kaz@cafe.net (Kaz Kylheku) #Newsgroups: comp.unix.shell #Subject: Why not roll your own @#$% find! (was: splitting directory off from filename) #Message-ID:
·
www.eeworm.com/read/134479/5892491

br fractal.br

// fractal.br // tests kernel splitting of an iterative construct kernel void mandelbrotIterate( float4 x, float4 y, float4 cx, float4 cy, out float4 outX, out float4 outY ) { outX =
·
www.eeworm.com/read/134479/5892295

br fractal.br

// fractal.br // tests kernel splitting of an iterative construct #include kernel void mandelbrotIterate( float4 x, float4 y, float4 cx, float4 cy, out float4 outX, out float4
·
www.eeworm.com/read/463777/1535328

in brazil_2d_nl.t3d.in

############################### # brazilian splitting test 2D # ############################### # # R = 40mm # B = 10mm # b = 3mm # t3d -d 5 vertex 1 xyz 0 0 0 vertex 2 xyz 40 0 0 vertex 1003 xyz 0
·
www.eeworm.com/read/463777/1535359

in brazil_3d_nl.t3d.in

############################### # brazilian splitting test 3D # ############################### # # R = 40mm # B = 10mm # b = 3mm # L = 80mm # t3d -d 10 vertex 1 xyz 0 0 0 vertex 2 xyz 40 0 0 verte
·
www.eeworm.com/read/356084/3042716

m getrpnode.m

% GetRPnode -- Rect Tree indexing % Usage % val = GetRPnode(RPtree,d1,d2,b1,b2) % Inputs % RPtree RPTree data structure % d1,d2 depth in splitting % b1,b2 box coordinates a
·
www.eeworm.com/read/356084/3042741

m rpkids.m

% RPkids -- index Dyadic Children of node in RP Tree % Usage % [kid1,kid2] = ARChildNode(Gender,i1,i2) % Inputs % Gender 1==coor-1 Kids; 2==coor-2 Kids % i1,i2 depth in splitting %
·
www.eeworm.com/read/367675/2834118

txt 3.txt

发信人: ashun (阿顺), 信区: DataMining 标 题: 数据挖掘术语简介（三） 发信站: 南京大学小百合站 (Wed Aug 29 14:44:23 2001) CART Classification And Regression Trees. CART is a method of splitting the indepen dent variables
·