Location:
Search - link by stack
Search list
Description: 汇编编写的ARM启动代码，包括中断向量、运行域搬移、堆栈设置等代码的演示，还包括了一个scatter文件，注释详细。麻雀虽小五脏俱全，对于ARM编程的初学者，有助于理解ARM的代码链接和生成，以及启动过程。代码使用ADS1.2编写，可以直接运行查看。-Compilation prepared by ARM startup code, including the interrupt vector, run the domain move, stack setup code demonstration, but also a scatter file, comments in detail. Sparrows are small is a fully-equipped, for ARM programming for beginners, help to understand the link ARM code and generation, as well as the boot process. Code uses ADS1.2 prepared, you can directly run the Show.
Platform: |
Size: 26624 |
Author: halk xia |
Hits:
Description: this program is link list that writted with c++.
this program create a link list with stack.
Platform: |
Size: 293888 |
Author: ssss |
Hits:
Description: 采用JPcap来实现ipv6数据包的捕获和分析。由于JPcap提供的函数可以深入到数据链路层去捕获数据包，因此无论是IPv4数据包还是IPv6数据包都是被封装在以太帧头中，因此都能够被捕获。本程序利用JPcap提供的函数，实现了捕获并解析在纯IPv6环境或双协议栈环境下传输的IPv6数据包-JPcap used to achieve ipv6 packet capture and analysis. JPcap because of the function can provide depth to the data link layer to capture packets, so regardless of the packet are IPv4 or IPv6 data packets have been encapsulated in the Ethernet header, and therefore are able to be arrested. This procedure provided by the use of JPcap function, implementation of the capture and analysis in a pure IPv6 or dual stack environment environment IPv6 packet transmission
Platform: |
Size: 5120 |
Author: chenjie |
Hits:
Description: Qo S参 考 模型是一个端到端加层次的概念。端到端之间可能包括一个或多个
中介网络，每个网络具有多个节点。各个中介网络的QoS是由中介网络协议栈
垂直方向的各个协议层的协作实现的，如MAC层、数据链路层和网络层提供的
QoS保障机制的综合。各个中介网络的QoS的综合实现端到端QoS。理论上，
用户不必考虑中介网络数量极其特性，只关心端到端的QoS能否保证-Qo S Reference Model is an end-to-end add-level concept. Between end-to-end may include one or more intermediary network, each network with multiple nodes. Various intermediary network QoS is the network protocol stack by an intermediary in all the vertical direction of the collaboration protocol layer implementation, such as the MAC layer, data link layer and network layer QoS guarantee mechanism provided by the General. Various intermediary network QoS end-to-end implementation of an integrated QoS. In theory, users do not have to consider the number of extremely intermediary network characteristics, is concerned only about the end-to-end QoS guarantee
Platform: |
Size: 11340800 |
Author: gnfang |
Hits:
Description: 编写C语言程序，模拟UNIX磁盘空间管理中使用的分组链接法。
1.定义一个记录磁盘块号的堆栈S—free[10]，以及记录栈中现有磁盘块数的变量S—nfree。
2.定义一个由40个元素构成的结构数组block[40]用作磁盘块存放。
struct size
{ int blocl[10]
}
struct blocd
{ struct size a[10]
//用于在空闲磁盘块号链中存放磁盘块号
}block[40]
3. 假设系统中文件的最大容量为100个磁盘块，且最多只有5个文件，定义一个由5个元素构成的结构数组file[5]用于记录各个文件占用的磁盘块，。
struct File
{ int fileblocd[100]
//用于记录分别分配给文件的磁盘块号
}file[5]
-Procedures for the preparation of C language to simulate the UNIX disk space used in the management of sub-link method. 1. The definition of a record number of disk blocks stack S-free [10], as well as the record of the existing disk block stack variable number of S-nfree. 2. The definition of a 40 element array structure consisting of block [40] for block storage disk. struct size (int blocl [10] ) struct blocd (struct size a [10] // used to free disk blocks in its store chain in its disk block) block [40] 3. the assumption that the system' s maximum capacity of paper disk blocks for the 100, and a maximum of only five documents, the definition of five elements of a structure consisting of an array of file [5] used to record all the disk blocks occupied by files,. struct File (int fileblocd [100] // used to record files were assigned to the disk block number) file [5]
Platform: |
Size: 8192 |
Author: 陈媛 |
Hits:
Description: this the source code of the link list .it is stack ,queue ,and other file .this is a full source code by a write and it can be used any compiler-this is the source code of the link list .it is stack ,queue ,and other file .this is a full source code by a write and it can be used any compiler
Platform: |
Size: 1024 |
Author: crystal |
Hits:
Description: Simple Stack example. Which show you how to implement LIFO in stack using link list.
Platform: |
Size: 2048 |
Author: shahid |
Hits:
Description: 用到Queue和Stack這兩個資料結構 ,已經寫好放在同個資料夾底下 , 有兩個檔案 : ADT.h 和 ADT.cpp , 同時還提供了一個洗牌的函式
1. 連結Header Files
- 首先我們要同時使用多個檔案來跑程式的話 , 就需要建立一個專案檔。
VS.net 2005 因為一定要建專案才能跑 , 所以只要在標頭檔(Header Files)按
右鍵 , 把這兩個檔案加進來就可以了。在主程式要記得 #include “ADT.h” ,
才可以使用喔~
-Queue and Stack uses two data structures, have been written on the bottom with a folder, there are two files: ADT.h and ADT.cpp, while also providing a reshuffle of the function
1. Link Header Files
- First, we want to use multiple files to run the program, then you need to build a project file.
VS.net 2005 for the construction project must be run, so long as the header files (Header Files) by
Right, these two files add to the mix on it. In the main program to remember# include "ADT.h",
Oh can use!
Platform: |
Size: 3072 |
Author: zelda |
Hits:
Description: 本文将排课五要素绑定、封装成课元、课栈两个向量，并以二维权值矩阵描述课元
和课栈之间的关联系。
提出了最佳匹配和遗传算法的排课算法，以随机生成的二维数字矩阵来反映课元和
课栈的关联权重，对数字矩阵组处理和最佳匹配得到的匹配偶图组为遗传算法的初始种
群，以排课各种原则的加权和为目标函数，在遗传算子控制下迭代来寻求更优的匹配结
果即使目标函数最小的偶图匹配结构，进而得到满意的排课结果。
提出了关联匹配和禁忌搜索的排课算法，以随机二维数字矩阵描述课元和课栈之问
的关联权重，按照重权优先并根据正确性原则进行约简，获得课元和课栈之间的匹配偶
图。在此基础上，引入禁忌搜索算法，以排课的完备性原则、合理性原则和人性化原则
的加权和为目标函数，以随机二维权值矩阵生成的匹配偶图为初始解，对二维权值矩阵
进行扰动构成搜索邻域，以生成的匹配偶图为禁忌对象，采用全局藐视准则，获得最优
的排课方案。
以Matlab为平台，利用Excd数据库和Mallab的互联实现数据交换，编写了两套
算法的应用程序，通过实例来验证两套排课算法，结果表明两套算法是可行的。-Arranging the five elements of this paper, binding, packaging into a class element, class stack of two vectors and matrices described by two classes per Rights
And the relationship between class stack link.
Offers the best match and Genetic Algorithm Platoon algorithm to randomly generated two-dimensional figures to reflect the class element and matrix
Class stack associated with weight, the digital matrix group received treatment and the best matching group bipartite graph matching the initial kind of genetic algorithm
Group to the weighted course arrangement of principles and the objective function, under the control of the genetic operator iteration to seek the better match Results
Results even if the objective function structure of the smallest bipartite graph matching, and then Timetabling satisfactory results.
Match the proposed association Timetabling algorithm and tabu search, a random two-dimensional digital matrix element and the class description class stack of Q
Platform: |
Size: 1812480 |
Author: 张林杰 |
Hits:
Description: 编写C语言程序，模拟UNIX磁盘空间管理中使用的分组链接法。
1.定义一个记录磁盘块号的堆栈S—free[10]，以及记录栈中现有磁盘块数的变量S—nfree。
2.定义一个由40个元素构成的结构数组block[40]用作磁盘块存放。
struct size
{ int blocl[10]
}
struct blocd
{ struct size a[10]
//用于在空闲磁盘块号链中存放磁盘块号
}block[40]
3. 假设系统中文件的最大容量为100个磁盘块，且最多只有5个文件，定义一个由5个元素构成的结构数组file[5]用于记录各个文件占用的磁盘块，。
struct File
{ int fileblocd[100]
//用于记录分别分配给文件的磁盘块号
}file[5]
4. 编写函数init( )完成空闲磁盘块号堆栈、空闲磁盘块号队列及记录文件占用磁盘块状态的file结构数组。
5. 编写函数alloc(fileno,blockd),完成磁盘块的分配操作。其中的参数fileno为文件序号，用于指定需要分配的文件。
6. 编写函数free(fileno),完成文件占用磁盘块的释放操作。其中的参数fileno为文件序号，用于指定需要释放磁盘块的文件。
7. 编写main( )函数完成下列操作：
调用init( )函数完成初始设置。
从终端输入命令，控制磁盘块的分配与回收操作。
-Write C language programs to simulate UNIX disk space management group used the link method.
1. The definition of a record number of disk blocks stack S-free [10], and the record number of disk blocks stack variables in the existing S-nfree.
2. The definition of a structure consisting of 40 elements in the array block [40] for disk blocks for storage.
struct size
{Int blocl [10]
}
struct blocd
{Struct size a [10]
// Used in the chain of free disk block number stored in the disk block number
} Block [40]
3. Assuming that the system files in the maximum capacity of 100 disk blocks, and only a maximum of 5 files, defined by the five elements of a
Array of structures file [5] used to record the disk blocks occupied by each file.
struct File
{Int fileblocd [100]
// Used to record files were assigned to the disk block number
} File [5]
4. Write a function init () to complete the stack of free disk block number, block number of free disk queue an
Platform: |
Size: 2048 |
Author: fdsf |
Hits:
Description: Make stack by single link list and array
Platform: |
Size: 1024 |
Author: Shang |
Hits:
Description: 基于ARM CORTEX M3 的lwip 程序设计-//! This example application demonstrates the operation of the Stellaris
//! Ethernet controller using the lwIP TCP/IP Stack. DHCP is used to obtain
//! an Ethernet address. If DHCP times out without obtaining an address,
//! AUTOIP will be used to obtain a link-local address. The address that is
//! selected will be shown on the QVGA display.
//!
//! The file system code will first check to see if an SD card has been plugged
//! into the microSD slot. If so, all file requests from the web server will
//! be directed to the SD card. Otherwise, a default set of pages served up
//! by an internal file system will be used.
//!
//! For additional details on lwIP, refer to the lwIP web page at:
//! http://savannah.nongnu.org/projects/lwip/
Platform: |
Size: 2015232 |
Author: guan |
Hits:
Description: 简单实现链路层ARQ协议，特点在于使用栈来实现。在windows下使用VC++6.0可以运行-Simple link layer ARQ protocol, characterized by the use of stack. The use windows VC++6.0 can run
Platform: |
Size: 306176 |
Author: 后市太 |
Hits:
Description: 基于uC_OS且开放源码的TCP_IP协议栈——uC_IP
uC/IP是由Guy Lancaster编写的一套基于uC/OS且开放源码的TCP/IP协议栈，亦可移植到其它操作系统，是一套完全免费的、可供研究的TCP/IP协议栈，uC/IP大部分源码是从公开源码BSD发布站点和KA9Q（一个基于DOS单任务环境运行的TCP/IP协议栈）移植过来。uC/IP具有如下一些特点：带身份验证和报头压缩支持的PPP协议，优化的单一请求/回复交互过程，支持IP/TCP/UDP协议，可实现的网络功能较为强大，并可裁减。UCIP协议栈被设计为一个带最小化用户接口及可应用串行链路网络模块。根据采用CPU、编译器和系统所需实现协议的多少，协议栈需要的代码容量空间在30-60KB之间-And open-source based uC_OS TCP_IP protocol stack- uC_IP
uC/IP is written by a Guy Lancaster set based on uC/OS and open source TCP/IP protocol stack, can be ported to other operating systems, is a completely free, available for study of TCP/IP protocol stack, uC/IP source code is mostly released from the open source BSD sites and KA9Q (a DOS-based single-tasking environment running on TCP/IP protocol stack) transplant. uC/IP has the following features: header with authentication and compression support the PPP, optimized single request/response interaction, support for IP/TCP/UDP protocol, which enables a more powerful network function, and can be cut. UCIP protocol stack is designed with a user interface, and can minimize application serial link network module. Pursuant to the adoption CPU, compiler and systems required to achieve agreement on how much stack space required for code size between 30-60KB
Platform: |
Size: 403456 |
Author: 小萌 |
Hits:
Description: 数据结构中采用链式存储堆栈实现数制之间的转换的c++完整源程序-In c++ language to achieve the data structure of system is realized by using chain stack conversion between
Platform: |
Size: 1024 |
Author: 邢玉娟 |
Hits:
Description: tun驱动程序实现了虚拟网卡的功能，利用tun驱动可以实现linux 下虚拟网卡的创建与管理。-tun/tap driver implements a virtual NIC functionality, tun represents a virtual point to point device, tap represents a virtual Ethernet devices, both devices for network packet implement different packages. Use tun/tap driver can be tcp/ip protocol stack processing subcontractor pass any good network using tun/tap-driven process, and then re-processed by the process sent to a physical link.
Platform: |
Size: 4096 |
Author: DUAN |
Hits:
Description: 模拟JVM虚拟机和基础指令集设计的JAVA语言模拟的JVM
(invoke,rt_obj,dst_obj,dst_method,obj_args)：方法调用指令，dst_obj为被调用的目标对象，dst_method为被调用的目标方法，obj_args是输入的对象引用参数，只能是在当前栈帧能够访问的对象。一个方法所传入的对象参数个数一旦确定不能变，不超过3个。rt_obj为接收dst_method运行返回值的变量。同理，一个方法是否会返回对象引用，以及返回对象的类型一旦确定不能变。
(run,dst_thread,obj_args)：启动线程执行指令，dst_thread为目标线程，obj_args为传入的对象引用参数，规定同上。
(return, rt_obj):方法执行返回指令，rt_obj为返回的对象引用。
(exit, dst_thread)：线程执行终止指令，一个线程执行终止意味该线程所拥有的栈资源将被释放。
(new, tar_class, tar_obj)：构造对象指令，构造一个类型为tar_class的对象，并使用变量tar_obj来引用。默认所有对象的size都相同，比如20个byte，输入不提供相应信息。
(create, tar_thread)：创建一个线程，但是不启动。
(link, src_obj, dst_obj)：表示从src_obj到dst_obj有一个引用
(assign, src_obj, dst_obj)：对象引用赋值，让dst_obj指向src_obj引用的对象
-Simulation of JAVA language simulation of JVM by simulating JVM virtual machine and basic instruction set design
(invoke, RT obj, DST obj, DST method, obj args): method call instruction and DST obj to be the target of the call object, the DST method to be the target of the call method, obj args is input object reference parameters can only be in the current stack frame to be able to access the object. Once the number of parameters passed by a method is determined not to change, no more than 3. Rt_obj variable that returns the value of the dst_method operation to the receiver. Similarly, whether a method returns an object reference, and a type once the object is returned.
(run, dst_thread, obj_args): the boot thread s the instruction, dst_thread is the target thread, the obj_args is the incoming object reference parameter, the same as above.
(return, rt_obj): the method s the return instruction, and rt_obj is a reference to the returned object.
(exit, dst_thread): the thread s th
Platform: |
Size: 30720 |
Author: 任我行 |
Hits:
Description: 用链栈求解迷宫问题。这是数据结构学习过程中的一个重要实例，我写的代码可供学习者参考-Deal with Maze by Link Stack.
Platform: |
Size: 1024 |
Author: 周福南 |
Hits: