Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - INT 1
Search - INT 1 - List
RTP: Audio and Video for the Internet-RTP : Audio and Video for the Internet
Date : 2026-01-06 Size : 2.87mb User : llx

Cisco Certified Network Professional 642-801 Course Notes - Building Scalable Cisco Internetworks-Cisco Certified Network Professional 642-801 Course Notes-Building Scalable Cisco Int ernetworks
Date : 2026-01-06 Size : 5.28mb User : li

dive int python document
Date : 2026-01-06 Size : 1.71mb User : 几分

DL : 0
DEELX 正则表达式引擎(v1.2) DEELX 是一个在 C++ 环境下的与 Perl 兼容的正则表达式引擎。是 RegExLab 开展的一个研究开发项目。 基本特点: 支持与 Perl 兼容的正则表达式语法。 支持 IGNORECASE, SINGLELINE, MULTILINE 等常见匹配模式。 兼容性强,能在 vc6, vc7, vc8, gcc, Turbo C++ 等大多数 C++ 环境编译。 支持命名分组,条件表达式,递归表达式等多种高级特性。(1.2版本新特点) 与 GRETA、boost 相比,DEELX 独到之处: 完全使用模版库编写,支持 char, wchar_t, int 等以及其他基类型版本。 全部代码位于一个头文件(.h)中, 比任何引擎都使用简单和方便。 支持从右向左匹配模式,可从文本结束位置向前搜索匹配。 可防止零长度子匹配循环无限次而产生的死循环。(1.2版本新特点) -DEELX Regular Expression Engine (v1.2) DEELX is a C environment and Perl-compatible regular expression engine. Is RegExLab carried out a research and development projects. Basic characteristics: the support and Perl-compatible regular expression syntax. Support IGNORECASE, SINGLELINE, MULTILINE common pattern matching. Compatibility, in vc6, vc7, vc8, gcc, Turbo C , such as the majority of C compiler environment. Support for named groups, conditional expression
Date : 2026-01-06 Size : 63kb User : 钱斌

SQL Server 2000范例代码5.2.1 -- 创建“整型数据”数据表 CREATE TABLE 整型数据 (bigint_number bigint, int_number int, smallint_number smallint, tinyint_number tinyint) GO -- 向“整型数据”数据表中添加两行数据 INSERT INTO 整型数据 VALUES (9223372036854775807, 2147483647, 32767, 255) INSERT INTO 整型数据 VALUES (-9223372036854775808, -2147483648, -32768, 0) GO -- 从“整型数据”数据表中检索数据 SELECT * FROM 整型数据 GO -SQL Server 2000 sample code 5.2.1- Create " integer data" integer data table CREATE TABLE data (bigint_number bigint, int_number int, smallint_number smallint, tinyint_number tinyint) GO- to the " integer data" data table to add two INSERT INTO line integer data data VALUES (9223372036854775807, 2147483647, 32767, 255) INSERT INTO integer data VALUES (-9223372036854775808,-2147483648,-32768, 0) GO- from the " integer data" data table SELECT to retrieve data GO integer* FROM data
Date : 2026-01-06 Size : 41kb User : 浅浅舟

DL : 0
本题要删除的是ASCII值为偶数的字符即要将ASCII值为奇数的留下。注意if( )中表示奇数的方式:采用的是s[i] 2而不是s[i] 2==1由于在C语言中当s[i]为奇数时s [i] 2的值为1(即为逻辑真,它与s[i] 2==1的效果是一样的。在一点要注意,它在笔试 考中也常出现。*/ 49、这是一道典型的迭代算法题。迭代算法就是x0和x1反复求值反复交换值直到两 值小于其个被认为0的数时,在浮点型中由于存在精确度的问题,所以认为一个很小的数 (如:1e-006即0.000001)与0相当。故本题的fabs(x0-x1)>1e-006不用fabs(x0-x1 )==0.0,若是用后面的表达式将会出现永无成立的时候。*/ - void fun( char*s, char t[]) { int i,j=0,n=strlen(s) for(i=0 i<n i++) if(s[i] 2) t[j++]=s[i] t[j]= \0 } 49、 float fun() { float x0,x1=0 do { x0=x1 x1=cos(x0) }while( fabs(x0-x1)>1e-006) return x1 }
Date : 2026-01-06 Size : 29kb User : 林坤

Windows 中断大全,HLP格式,很全的中断代码,方便查阅,适合作为资料保存。-Windows INT Taiquan, HLP format, it is the interruption of the whole code, easy access, suitable as a data storage.
Date : 2026-01-06 Size : 4.48mb User : fanicy

DL : 0
C语言函数大全 例如:函数名: bar 功 能: 画一个二维条形图 用 法: void far bar(int left, int top, int right, int bottom) -C language function Daquan
Date : 2026-01-06 Size : 840kb User : 张三

DL : 0
在这册以通俗易懂的技术导读为主的四柱预测的学习前,为了不至于让众多的爱好者陷入迷误,本章将理论性较强的以中国古代预测术为表象的古代中国对世界的认识和体验作一个介绍,并与近代科学相比较,独立一章以解许多读者的心头之疑虑和迷惑,便于大家对学习中的神奇的一面有一个新的认识。言不能心意之处也期望达到抛砖引玉的作用。*本章参阅《天人象阴阳五行学说史导论》、《周易与中医学》。 -main() { int i,j,k printf("\n") for(i=1 i<5 i++)     for(j=1 j<5 j++)    for (k=1 k<5 k++)    {     if (i!=k&&i!=j&&j!=k)    /*     printf(" d, d, d\n",i,j,k)    } }
Date : 2026-01-06 Size : 261kb User : pusaboo

DL : 0
给出定点化技术的细致介绍。在dsp开发,和其他定点工程中很重要-digitalize make float to int
Date : 2026-01-06 Size : 272kb User : 王天宝

Tne Notes_IV of Digital Image Processing book by Gonzales and Woods
Date : 2026-01-06 Size : 210kb User : serhatb

面向对象程序设计课程设计公司人事管理1.void tiquxinxi()/ /从文件中提取出全部信息 2.void write()/ /输入信息 3.void seach(char NAME[]) / /按姓名查找职工信息 4.void allprint() / /全部输出在厂职工的信息 5.void delet() / /删除职工信息 6.void oneprint() / /显示要查找的职工的信息 7.void change_infor() / /修改职工的信息 8.void mune1() / /管理员的功能菜单 9.void mune2() / /普通职工的功能菜单 10.int queding() / /管理员的密码确定函数 11.void select() / /功能菜单的选择函数 12.int main() / /主函数 -Object-oriented programming course design company personnel management 1.void tiquxinxi ()// extract from the document all information 2.void write ()// input 3.void seach (char NAME [])// search by name employee information 4.void allprint ()// all output in the plant employees information 5.void delet ()// delete staff information 6.void oneprint ()// show information workers to find 7.void change_infor ()// modify employee information 8.void mune1 ()// administrator function menu 9.void mune2 ()// regular employees of the function menu 10.int queding ()// administrator' s password to determine the function 11.void select ( )// function menu selection function 12.int main ()// main function
Date : 2026-01-06 Size : 3kb User : 王巍

relations for the details maintained by a book dealer. AUTHOR (Author-id: int, Name: string, City: string, Country: string) PUBLISHER (Publisher-id: int, Name: string, City: string, Country: string) CATALOG (Book-id: int, title: string, author-id: int, Publisher-id: int, Category-id: int, Year: int, Price: int) CATEGORY (Category-id: int, Description: string)- relations for the details maintained by a book dealer. AUTHOR (Author-id: int, Name: string, City: string, Country: string) PUBLISHER (Publisher-id: int, Name: string, City: string, Country: string) CATALOG (Book-id: int, title: string, author-id: int, Publisher-id: int, Category-id: int, Year: int, Price: int) CATEGORY (Category-id: int, Description: string)
Date : 2026-01-06 Size : 15kb User : arun.n

DL : 0
委托类型 D1 和 D2 都与方法 A.M1 和 B.M1 兼容,这是因为它们具有相同的返回类型和参数列表;但是,这些委托类型是两个不同的类型,所以它们是不可互换的。委托类型 D1 和 D2 与方法 B.M2、B.M3 和 B.M4 不兼容,这是因为它们具有不同的返回类型或参数列表。-class A { public static int M1(int a, double b) {...} } class B { delegate int D2(int c, double d) public static int M1(int f, double g) {...} public static void M2(int k, double l) {...} public static int M3(int g) {...} public static void M4(int g) {...} }
Date : 2026-01-06 Size : 11kb User : Anjie

DL : 0
根据SAR 图像的概率密度函数获得图像的似然函数, 然后将似然函数和边界约束方程结合 起来, 提出适合于SAR 图像分割的代价函数, 其中边界约束方程引入邻域结构信息来保证区域边 界的规则性, 通过使代价函数最小来获得图像的最优分割-In this paper , w e f ir st int roduce the probability dist ribut ion function of SAR imag e, and get the likelihood function o f this image.
Date : 2026-01-06 Size : 236kb User : aa

DL : 0
Intégration numérique
Date : 2026-01-06 Size : 130kb User : amine_gourari

DL : 1
变频器完整电路原理图(9页)高清晰,值得一看!-High-definition inverter full circuit schematic (9)
Date : 2026-01-06 Size : 511kb User : 张治积

DL : 0
I am trying to implement IDEA algorithm in C#, just to learn how it works. I have taken a 128 bit binary key and generated the 52 encryption keys using the following code: static ushort[] getKeys(string binaryKey) { ushort[] keys = new ushort[52] int index = 0 while (true) { int bitPos = 0 keys[index++] = Convert.ToUInt16(binaryKey.Substring(bitPos, 16), 2) bitPos += 16 keys[index++] = Convert.ToUInt16(binaryKey.Substring(bitPos, 16), 2) bitPos += 16 keys[index++] = Convert.ToUInt16(binaryKey.Substring(bitPos, 16), 2) bitPos += 16 keys[index++] = -I am trying to implement IDEA algorithm in C#, just to learn how it works. I have taken a 128 bit binary key and generated the 52 encryption keys using the following code: static ushort[] getKeys(string binaryKey) { ushort[] keys = new ushort[52] int index = 0 while (true) { int bitPos = 0 keys[index++] = Convert.ToUInt16(binaryKey.Substring(bitPos, 16), 2) bitPos += 16 keys[index++] = Convert.ToUInt16(binaryKey.Substring(bitPos, 16), 2) bitPos += 16 keys[index++] = Convert.ToUInt16(binaryKey.Substring(bitPos, 16), 2) bitPos += 16 keys[index++] =
Date : 2026-01-06 Size : 1.12mb User : Tanusree Saha

DL : 0
International Journal of Emerging Electric Power Systems:Optimization Methods for Electric Power Systems: An Overview
Date : 2026-01-06 Size : 404kb User : ahmed salem

Hcl C Programming Skills Test STRUCT DOUBLELIST { DOUBLE CLINKED INT DET LIST VOID STRUCT PREVIOUS (BE GIVEN AND A PROCEDURE TO DELETE) STRUCT NEW (AN ELEMENT WILL BE GIVEN)-Hcl C Programming Skills Test STRUCT DOUBLELIST { DOUBLE CLINKED INT DET LIST VOID STRUCT PREVIOUS (BE GIVEN AND A PROCEDURE TO DELETE) STRUCT NEW (AN ELEMENT WILL BE GIVEN)
Date : 2026-01-06 Size : 8kb User : arjun
« 12 »
CodeBus is one of the largest source code repositories on the Internet!
Contact us :
1999-2046 CodeBus All Rights Reserved.