代码搜索:split

找到约 9,328 项符合「split」的源代码

代码结果 9,328
www.eeworm.com/read/38039/1091742

mnu sectools.mnu

SEC#TOOLS. 截面工具 Tools provided for Sketcher. # Intersect 求交 Choose two entities to be split at their intersection point. 选取两个图元在其交点处分割. Trim 修剪 Trim entities (cut or extend them) to other entities or
www.eeworm.com/read/250243/4439840

h mach_reboot.h

/* * arch/i386/mach-generic/mach_reboot.h * * Machine specific reboot functions for generic. * Split out from reboot.c by Osamu Tomita */ #ifndef _MACH_REBOOT_H #define _M
www.eeworm.com/read/242732/4541428

c iputils.c

#include #include #include #include int split_ip( char *text, u8b *dest, int place ) { int dotcount; /* Don't touch this, unless you like
www.eeworm.com/read/242657/4550175

pl webstone-common.pl

#!/pkg/gnu/bin//perl5 # #$Id: WebStone-common.pl 32986 2000-06-04 22:02:08Z brunsch $ # 1; sub show_model { $model = `head -1 $wd/conf/filelist`; $model =~ s/\#//; ( $model ) = split(':'
www.eeworm.com/read/239567/4597755

py testregexcompiler.py

import re # These statements dont require a AST regular expression node m = re.search('(?
www.eeworm.com/read/216802/4882190

c iputils.c

#include #include #include #include int split_ip( char *text, u8b *dest, int place ) { int dotcount; /* Don't touch this, unless you like
www.eeworm.com/read/209559/4970112

h mach_reboot.h

/* * arch/i386/mach-generic/mach_reboot.h * * Machine specific reboot functions for generic. * Split out from reboot.c by Osamu Tomita */ #ifndef _MACH_REBOOT_H #define _M
www.eeworm.com/read/205824/5017104

c iputils.c

#include #include #include #include int split_ip( char *text, u8b *dest, int place ) { int dotcount; /* Don't touch this, unless you like
www.eeworm.com/read/199943/5074755

c lexer.c

/* $Id: lexer.c,v 1.149 2006/06/20 22:10:41 relson Exp $ */ /** * \file lexer.c * bogofilter's lexical analyzer (control routines) * * \date 2003-01-01 split out of lexer.l */ #include "common.
www.eeworm.com/read/195829/5107157

txt 8_15.txt

void split (Mbtree oldp, Mbtree *newp) {/* B_树的分裂过程 */ int s,n,i; s=ceil((float)m/2); /* s= */ n=m-s; *newp=(Mbtree)malloc(sizeof(Mbtnode)); (*newp)->keynum=n; (*newp)->parent=o