Welcome![Sign In][Sign Up]
Location:
Search - list.h

Search list

[mpeg mp3EZW_example

Description: EZW举例 该源代码包含有6个文件: EZW.H - EZW编码器头文件 EZW.C - EZW编码器文件 MATRIX2D.H MATRIX2D.C - 编码器数据结果定义和数据操作 FIFO.H FIFO.C - 扫描方式定义:先入先出原则 LIST.H LIST.C - 零树结构定义和操作 UNEZW.C - EZW解码器-EZW For the source code contains six documents : EZW.H - EZW-headers EZW.C - EZW MATRIX2D.H M-paper ATRIX2D.C-encoder data definitions and data results of operations FIFO.H FIFO.C-side scanning Type definitions : first-first-out principle LIST.H LIST.C-zero tree structure definition and operation UNEZW.C - EZW Solutions vocoders
Platform: | Size: 11265 | Author: 赵俊 | Hits:

[Compress-Decompress algrithmsEZWVCcode

Description: 介绍EZW编解码算法的全部代码,该源代码包含有6个文件: EZW.H - EZW编码器头文件 EZW.C - EZW编码器文件 MATRIX2D.H MATRIX2D.C - 编码器数据结果定义和数据操作 FIFO.H FIFO.C - 扫描方式定义:先入先出原则 LIST.H LIST.C - 零树结构定义和操作 UNEZW.C - EZW解码器 -introduced EZW coding of all the code, the source code includes six documents : EZW.H - EZW EZW.C document for the first-EZW for documents MATRIX2D.H M ATRIX2D.C-encoder data definitions and outcome data operation FIFO.H FIFO.C-side scanning Type definitions : first-in-first-out principle LIST.H LIST.C-zero-tree structure definition and operation UNEZW.C - EZW Solutions Device
Platform: | Size: 9352 | Author: 爱玛 | Hits:

[Other resourcelist-lianbiaodejiandanshilicaozuo

Description: 内核中链表结构的实现,并通过实例对每个链表操作接口进行了详尽的讲解。 一、 链表数据结构简介 链表是一种常用的...这些链表大多采用在[include/linux/list.h]实现的一个相当精彩的链表数据结构
Platform: | Size: 9340 | Author: 白霞 | Hits:

[Compress-Decompress algrithmsEZW

Description: EZW举例 该源代码包含有6个文件: EZW.H - EZW编码器头文件 EZW.C - EZW编码器文件 MATRIX2D.H MATRIX2D.C - 编码器数据结果定义和数据操作 FIFO.H FIFO.C - 扫描方式定义:先入先出原则 LIST.H LIST.C - 零树结构定义和操作 UNEZW.C - EZW解码器 这里,读者重点要掌握的是EZW.C和LIST.C中的内容,充分理解零树的概念。
Platform: | Size: 11415 | Author: yang | Hits:

[Windows Developyszs

Description: 编程步骤: 1, 创建新工程(Win32 Console Application)。 2, 添加如下源文件: List.cpp ?链表类的实现 Operater.cpp ?操作类的实现 Main.cpp ?程序入口 添加如下头文件: List.h ?链表类的头文件 Operater.h ?操作类的头文件 3, 添加代码......... 4, 编译,调试,除错,完成.-Programming steps: 1.Create a new project(Win32 Console Application) 2.Add source codes as following:List.cpp__the implementation of list type Operater.cpp__the implementation of operater type Main.cpp__the start point of the program Then, Add head file as following:List.h__the head file of list type Operater.h__the head file of operater type. 3. Add code......... 4. compile, debug,correct and the finish
Platform: | Size: 1031913 | Author: 李楠 | Hits:

[Windows Kernelbanned.h

Description: banned.h - list of Microsoft Security Development Lifecycle banned APIs
Platform: | Size: 1402 | Author: ak4900 | Hits:

[Windows Developyszs

Description: 编程步骤: 1, 创建新工程(Win32 Console Application)。 2, 添加如下源文件: List.cpp ?链表类的实现 Operater.cpp ?操作类的实现 Main.cpp ?程序入口 添加如下头文件: List.h ?链表类的头文件 Operater.h ?操作类的头文件 3, 添加代码......... 4, 编译,调试,除错,完成.-Programming steps: 1.Create a new project(Win32 Console Application) 2.Add source codes as following:List.cpp__the implementation of list type Operater.cpp__the implementation of operater type Main.cpp__the start point of the program Then, Add head file as following:List.h__the head file of list type Operater.h__the head file of operater type. 3. Add code......... 4. compile, debug,correct and the finish
Platform: | Size: 1031168 | Author: 李楠 | Hits:

[source in ebookdatastr

Description: 数据结构 array.h: 安全数组,可自动增长大小(随机访问,但扩充时效率低) linkedlist.h: 普通链表(可随机访问,但访问效率低) dclinkedlist: 双向循环链表(不可随机访问,但插入、遍历的效率都比普通链表高) hashtable.h: 哈希表(使用键值标识元素,键值一样的元素即认为相等,需重载 == 运算符并由用户定义哈希函数) binstree.h: 二叉搜索树(需重载 == 和 < 运算符) avltree.h: AVL 树(需重载 == 和 < 运算符)-data structure array.h : security arrays can be automatically size (random access, but expanded inefficient) linkedlist.h : General Linked List (available random access, the visit inefficient) dclinkedlist : two-way cycle Chain (non-random access, insertion, Traversing the efficiency higher than ordinary Chain) hashtable.h : Hash Table (using keys logo elements, keys to the same element that is considered equal. take Heavy == Operators Hash with user-defined functions) binstree.h : Binary Tree Search (and required heavy ==
Platform: | Size: 15360 | Author: 许愿 | Hits:

[Crack Hack200561673082201

Description: DES,MD5,ZLIB算法源代码 文件列表: Adler32.cpp ArithDLL.cpp ArithDLL.def ArithDLL.dll ArithDLL.dsp ArithDLL.dsw ArithDLL.h ArithDLL.lib ArithDLL.ncb ArithDLL.opt ArithDLL.plg Arithzxz.h Arithzxz.h.BAK Compress.cpp CRC.cpp Deflate.cpp Deflate.h Des.cpp Des.h Infblock.cpp Infblock.h Infcodes.cpp Infcodes.h Inffast.cpp Inffast.h Inffixed.h Inflate.cpp Inftrees.cpp Inftrees.h Infutil.cpp Infutil.h md5.cpp md5.h ReadMe.txt StdAfx.cpp StdAfx.h String.cpp Trees.cpp Zlib.h Zutil.cpp Zutil.h-DES, MD5, ZLIB algorithm source code files list : Adler32.cpp ArithDLL.cpp ArithDLL.def Arith DLL.dll ArithDLL.dsp ArithDLL.dsw ArithDLL. h ArithDLL.lib Ari ArithDLL.ncb ArithDLL.opt thDLL.plg Arithzxz.h Arithzxz.h.BAK Compres s.cpp CRC.cpp Deflate.cpp Deflate.h Des.cpp D es.h Infblock.cpp In Infblock.h Infcodes.cpp fcodes.h Inffast.cpp In Inffast.h Inffixed.h flate.cpp Inftrees.cpp Inftrees.h Infutil.c pp Infutil.h md5.cpp StdAfx md5.h ReadMe.txt file. cpp StdAfx.h String.cpp Trees.cpp Zlib.h Zuti l.cpp Zutil.h
Platform: | Size: 138240 | Author: water1974 | Hits:

[SCMSDTest

Description: WinCE环境下检测SD卡序列号,编程环境: eVC4.0 + PPC2003。 文件清单: newres.h ReadMe.txt Resource.h SDTest.aps SDTest.cpp SDTest.h SDTest.rc SDTest.vcc SDTest.vcl SDTest.vcp SDTestDlg.cpp SDTestDlg.h StdAfx.cpp StdAfx.h-WinCE environment Sequence Detection SD card, programming environment : eVC4.0 PPC2003. The list of documents : newres.h ReadMe.txt file Resource.h SDTest.aps SD Test.cpp SDTest.h SDTest.rc SDTest.vcc SDTes t.vcl SDTest.vcp SDTestDlg.cpp SDTestDlg.h S tdAfx.cpp StdAfx.h
Platform: | Size: 135168 | Author: water1974 | Hits:

[File OperateCCeFileFind_src

Description: WinCE环境下文件查找源码。 文件清单: CeFileFind.cpp CeFileFind.h-environment WinCE source document search. The list of documents : CeFileFind.cpp CeFileFind.h
Platform: | Size: 3072 | Author: water1974 | Hits:

[DirextXVODDemo1

Description: VODDemo: 视频点播演示程序。一个服务器程序,一个客户机程序。服务器端 维持一个供点播的节目列表。客户机与服务器建立连接之后,可以得到服务器上 可供点播的节目列表,然后选择一个感兴趣的节目进行播放。目前支持点播的媒 体类型有MPEG1、MP3、MPEG2、AVI等。 Bin\VODServer.exe是服务器程序。 Bin\VODClient.exe是客户机程序。 FilterNetReceiver是一个实现了网络数据接收的模式Source Filter。Filter 的注册名为“HQ Net Receiver”。 打开VODDemo目录下的WsClientServer.dsw文件,可以同时浏览该目录下所有 项目。-VODDemo : video-on-demand demonstration program. A server, a client process. Maintaining a server for on-demand programming list. Client and server connectivity, the server can be available for on-demand programs list, then select a program for interested players. Current support on-demand media types MPEG1, MP3, MPEG2, AVI. Bin \ VODServer.exe server procedures. Bin \ VODClient.exe is client procedures. FilterNetReceiver is one of the network data reception mode Source Filter. Filter the registration called "HQ Net Receiver." Open VODDemo WsClientServer.dsw directory of documents, they can browse the directory all projects.
Platform: | Size: 80896 | Author: 王恩文 | Hits:

[mpeg mp3EZW_example

Description: EZW举例 该源代码包含有6个文件: EZW.H - EZW编码器头文件 EZW.C - EZW编码器文件 MATRIX2D.H MATRIX2D.C - 编码器数据结果定义和数据操作 FIFO.H FIFO.C - 扫描方式定义:先入先出原则 LIST.H LIST.C - 零树结构定义和操作 UNEZW.C - EZW解码器-EZW For the source code contains six documents : EZW.H- EZW-headers EZW.C- EZW MATRIX2D.H M-paper ATRIX2D.C-encoder data definitions and data results of operations FIFO.H FIFO.C-side scanning Type definitions : first-first-out principle LIST.H LIST.C-zero tree structure definition and operation UNEZW.C- EZW Solutions vocoders
Platform: | Size: 11264 | Author: 赵俊 | Hits:

[Data structslist-lianbiaodejiandanshilicaozuo

Description: 内核中链表结构的实现,并通过实例对每个链表操作接口进行了详尽的讲解。 一、 链表数据结构简介 链表是一种常用的...这些链表大多采用在[include/linux/list.h]实现的一个相当精彩的链表数据结构-Kernel list realize the structure, and list examples of each interface in detail explanation. First, list data structure is a commonly used brief list of the list ... these are mostly used in [include/linux/list.h] achieved a very exciting list data structure
Platform: | Size: 9216 | Author: 白霞 | Hits:

[Compress-Decompress algrithmsEZW

Description: EZW举例 该源代码包含有6个文件: EZW.H - EZW编码器头文件 EZW.C - EZW编码器文件 MATRIX2D.H MATRIX2D.C - 编码器数据结果定义和数据操作 FIFO.H FIFO.C - 扫描方式定义:先入先出原则 LIST.H LIST.C - 零树结构定义和操作 UNEZW.C - EZW解码器 这里,读者重点要掌握的是EZW.C和LIST.C中的内容,充分理解零树的概念。 -EZW For the source code contains six files: EZW.H- EZW encoder header files EZW.C- EZW encoder document MATRIX2D.H MATRIX2D.C- encoder data definition and data manipulation FIFO.H FIFO.C-- scanning definition: the principle of FIFO LIST.H LIST.C- definition of zero-tree structure and operation of UNEZW.C- EZW decoder here, readers should have a focus EZW.C and LIST.C content, fully understand the zero- tree concept.
Platform: | Size: 11264 | Author: yang | Hits:

[Linux-Unixlist

Description: list.h中的例子运用。对里面的只是简单的运用-list.h example in the use of
Platform: | Size: 1024 | Author: jian | Hits:

[source in ebooklinear-list

Description: 在带头结点的单链表h中第i个数据元素之前插入一个数据元素x ,首先需要在单链表中寻找到第i-1个结点并用指针p指示,然后申请一个由指针s 指示的结点空间,并置x为其数据域值,最后修改第i-1个结点,并使x结点的指针指向第i个结点,要在带头结点的单链表h中删除第i个结点,首先要计数寻找到第i个结点并使指针p指向其前驱第i-1个结点,然后删除第i个结点并释放被删除结点空间。-Take the lead junction point of the singly-linked list h prior to the i-th data elements insert a data element x, single linked list, you first need to find the first i-1 junction point and indicated pointer p, and then apply for a pointer s instructions the knot point of space, and set the x its data field values, last modified i-1 nodes, and x node pointer to the i-th node, delete the i-th to take the lead in a single linked list node h node, we must first count and looking to the i-th node pointer p points to its precursor i-1 nodes, then delete the i-th node and release deleted node space.
Platform: | Size: 7168 | Author: | Hits:

[Windows Developlist

Description: 关于顺序表的实现,分为三个文件夹,list.h stdafx.h main.c-for list table
Platform: | Size: 3072 | Author: 王军 | Hits:

[Data structsdouble-linked-list

Description: 初始化双链表H; 依次采用尾插法插入a,b,c,d,e元素; 输出双链表H; 输出双链表H长度; 判断双链表H是否为空; 输出双链表H的第三个元素; 输出元素’a’的位置; 在第四元素位置上插入’f’元素; 输出双链表H; 删除双链表H的第三个元素; 输出双链表H; -Initialize the double linked list H Turn the tail interpolation into the A, B, C, D, e elements The output of double linked list H The output of double linked list length H The third element output double linked list H The output element a position In the fourth elements into the f element position The output of double linked list H The output of double linked list H The third element deletion double linked list H The output of double linked list H
Platform: | Size: 1024 | Author: 许泽达 | Hits:

[Otherlist

Description: 包含list.h link.h list.h(incude list.h link.h list.h)
Platform: | Size: 4096 | Author: yyruuu | Hits:
« 12 3 4 5 6 7 8 9 10 »

CodeBus www.codebus.net