Search - INT 1 - CodeBus

Search - INT 1 - List

[Other resource] 餐饮源吗 DL : 0: 餐饮管理系统数据库设计文档表名：bzqbj（保质期报警表）字段名字段类型字段长度（0表示不允许NULL，1为允许） id bigint 8 0 id ylid varchar 50 1 原料id ylmc varchar 50 1 原料名称 diffbzq bigint 8 1 距离保质期的时间 diffbzqyj bigint 8 1 距离保质预警期的时间 bzq bigint 8 1 保质期表名：cdb（菜单表） id varchar 50 1 mc varchar 50 1 名称 price float 8 1 价格 lbbh bigint 8 1 类别编号（typelist） dlmc varchar 50 1 大类名称 tj float 8 1 特价 sftj int 4 1 是否特价 sfjl int 4 0 是否酒类-Food Management System database design document table name : bzqbj (durability Alarm table) field names of the type field length (0 indicates not NULL, to allow a) id bigint id 8 0 50 1 ylid varchar materials id ylmc varchar 50 1 raw materials names diffbzq bigint 8 1 from the durability of time diffbzqyj bigint 8 1 warning from the durability period of time bzq bigint 8 1 durability table name : cdb (Table menu) id varchar 50 1 50 1 mc varchar name price float price lbbh 8 1 8 1 bigint category number (typelist) dlmc varchar 50 1 largest category name tj float special sftj 8 1 4 1 int whether special sfjl int whether alcoholic 4 0
Date : 2008-10-13 Size : 4.53mb User : ccf
[Other resource] 同色球游戏 DL : 0: 游戏开发,用到direct等.Ball 球类，包含球的颜色(0,1,2)，球的状态(int),球的外部标识。 MapNode 网结类，定义了一个专用的二维链表类的节点，包含该节点的挂球位，该节点的组号，节点的外部标识。 SameBallMap 包含二维链表(由15*10个节点组成)，实现对游戏的球对象的完全管理. -game developers, such as direct use. Ball sports, including the color of the ball (0,1,2), the state - (int), the ball external logo. MapNode network node categories, the definition of a dedicated 2D objectlist nodes, the nodes contain pegged the ball, the group of nodes, the nodes external logo. SameBallMap include 2D List (15 * 10 nodes), the realization of the ball game completely object management.
Date : 2008-10-13 Size : 804.31kb User : 石飞
[Other resource] int dfsSweep DL : 0: 深度搜索算法，求解从起源点s到点j的最短路径算法的基本过程-depth search algorithm, solved from the point of origin j s close of the shortest path algorithm for the basic process
Date : 2008-10-13 Size : 3.24kb User : Bill
[Other resource] MyPaint1.0 DL : 0: 设计思路：对Windows XP自带的画笔程序进行分析，一般User画图过程：首先鼠标选择绘图工具，然后选择颜色，接着按User需要作图。User对产出的图像进行操作。对图形元素抽象出公共属性，设计我的画板的作图过程：选择工具、画预览效果、User满意并确定、绘制效果。下面是程序用到主要变量：当前绘图点粒度：int iGranularity 当前使用颜色：COLORREF curColor 当前绘图状态：int iPaintStatus 当前绘图状态属性：int iPaintProperty 前一个鼠标坐标：CPoint pOldPoint 多边形起点：CPoint pStartPoint 多边形终点：CPoint pEndPoint 当前鼠标坐标：CPoint pCurPoint 输出文本字符串缓存：CString strTextOut 对典型操作过程（画矩形）描述：用户选择工具_RECTANGLE(使iPaintStatus＝_RECTANGLE)、选择绘图颜色（设定curColor）、用户按下鼠标左键使绘图状态属性为预览（iPaintProperty＝_PREVIEW）、用户移动鼠标（绘制图形的橡皮线效果）用户放开左键（绘制图形的实线效果） -design : Windows XP's own brush analysis procedures, the general User drawing process : first choice mouse drawing tool, then select colors, followed by Graphic User needs. User to output images to operate. Right abstract graphic elements from the public properties, design I slate of mapping process : select tools, painting preview effects, User satisfaction and identification, mapping results. Below is a procedure used mainly variables : the current drawing point size : int iGranularity current use of color : COLORREF curColor current graphics state : int iPaintStatus current graphics state attributes : int iPaintProperty before a mouse coordinates : jumping pOldPoint polygon starting point : jumping pStartPoint polygon end : When the redemption pEndPoint before the mouse coordinates
Date : 2008-10-13 Size : 52.52kb User : mars
[Other resource] finish01 DL : 0: 一般来说用int型变量超过2^31的数就会溢出。此程序是利用数组对长度很长的整形字符串进行加减操作，并且进行自动测试的例子-int type generally used more than two variables ^ 31 a few will overflow. This procedure is the use of an array of very long length of plastic strings Modified operation, as well as automatic test case
Date : 2008-10-13 Size : 15.21kb User : 蔡雷
[Other resource] 存储管理源代码 DL : 0: 分区式存储管理源代码一、可变分区存储管理的基本策略 1)不预先划分几个固定分区，分区的建立是在作业的处理过程中进行的，各分区的大小由作业的空间需求量决定。 2)采用指针方式将各个空闲分区链接而成的链表，用以记录主存分配现状。 3)分配与回收算法按空闲分区链接方式的不同分类，有最佳、最坏、首次和下次适应四种算法。二、程序模拟的设计 1、基本思想采用事件驱动模型。事件有： 1)申请主存事件，表示一个作业创建时提出的主存资源要求； 2)释放主存事件，表示一个作业结束时其占用主存被回收。 2、数据结构设计 ...... typedef struct Event_DataType{事件数据类型的定义intEventType事件的类型申请ASK或释放RELEASE int OccurTime 事件发生的时间 char JobName 申请主存或被回收主存的作业名 int JobId 进入系统的作业在作业表中相应表项的编号 int SizeOfMemoryForAsk 作业申请占用主存的尺寸 int OccupyTimeOfMemoryForAsk 作业申请占用主存的时间长度 int WaitFlag 该事件是否等待过TRUE或FALSE-storage management through source code one, Variable storage management through the basic strategy of a) not divided into several pre-fixed Division, through the establishment of operations in the processing of the district by the size of demand for space operations decision. 2) use of the various methods pointer idle through link from the linked list, to record the status quo distribution of the main deposit. 3) the allocation and recovery algorithm by idle through links to the different classifications, the best and the worst, the first four and the next adaptation algorithms. Two, the program simulates a design, the basic idea using event-driven model. Events are : a) for the main deposit, said an operation created when the main deposit resource requirements; 2) The release of the main
Date : 2008-10-13 Size : 5.96kb User : Joly
[Other resource] 飞翔网络办公系统 DL : 0: *** ***** 系统进入 *** ** 系统主文件为index.htm 系统超级用户用户名:lhh 密码:lhh *** ***** 系统功能说明 *** * 1 进入系统后请先阅读帮助! 2 本系统取自网上某成熟的OA进行二次开发,功能有: 2.1 行政文件管理组件,如即见即所得的文件编辑功能,文件阅读对象设置, 文件级别设置,文件批复流程. 2.2 员工交流功能,如网络会议,讨论中心(BBS),仿QQ的即时聊天功能. 2.3 邮件系统,如收邮件,发邮件,写邮件等. 2.4 单位管理,如人员审核,考勤查看,车辆设置等. 2.5 个人中心,如日程安排,通讯录,个人资料等. 2.6 公共信息,如常用网址,软件下载,手机区号,万年历,邮政号查询等. 2.7 系统管理,如数据备份,恢复,系统设置等.-*** *** *** *** *** *** ** system into *** *** *** *** *** *** ** main file system for inde http://www.who.int/child-adolescent-health/publications/NUTRITION/ISBN_92_4_159120_X.htm system super-users Username : lhh Password : lhh ************************************** note API functions into one system Read help! two-line system from a mature secondary OA development functions : 2.1 administrative document management components, such as that see that the document editing, document reading public settings, document-level settings, document approval process. the exchange of 2.2 features, such as Network, the discussion centers (BBS). imitation QQ instant chat. 2.3-mail systems, such as access to e-mail, mail, write mail. 2.4 units management, if the audit staff, the a
Date : 2008-10-13 Size : 2.35mb User : wei
[Other resource] 5510dedaima DL : 0: /*** *5510单片机测试程序基本测试成功 2005-8-25 write By CW *** *** *** ****/ #include <reg52.h> #include <absacc.h> #define uint unsigned int #define uchar unsigned char-/******* 5510 microcontroller basic test procedure successfully tested 2005-8-25 wr ite By CW ***************************************** * / # include
Date : 2008-10-13 Size : 15.39kb User : wangxing
[Other resource] DSPprogram DL : 0: 1、（1）32bit乘法的指令解释（2）volume1的load.asm基础上实现一个 16bit数组的乘法累加的函数，并进行 -o2 / -o3 / 手工优化 2、c环境 C调用汇编函数，汇编函数调用c函数 addarr3(int * arr1, int * arr2, int * arr3, int * arr4, n) //汇编函数，3个数组的对应位置相加，结果放在arr4[n]中，汇编函数调用C的子函数，它把arr1和arr2相加放到arr3[n]中； addarr2(int * arr1, int * arr2, int * arr3, n)-1, (1) 32bit multiplication instructions explained (2) the load.asm volume1 on the basis of a a 16bit multiplication cumulative array of functions, and-o2 /-o3 / 2 manual optimization, c environment compilation called C function, the compilation function call c function addarr3 (int * arr1. int * arr2, arr3 int *, int * arr4, n) / / compilation function, 3 arrays corresponding location together, the results on arr4 [n], the compilation of the C function call function, arr1 put it together and put arr2 arr3 [n]; addarr2 (int * arr1, int * arr2, int * arr3, n)
Date : 2008-10-13 Size : 19.06kb User : 郭春吉
[Other resource] cmoban DL : 0: 参照栈类模板的例子编写一个队列类模板class <T> Queue，私有成员包括：队首指针Front，队尾指针Tail，队列容积max。实现：构造函数Queue，析构函数，入队函数In，出队函数Out（每次出队，后面的元素自动前移一位），判队列空函数Empty。并分别用队列类模板定义int和float对象，调用各个成员函数-reference stack class template examples of the preparation of a class template class Queue
Date : 2008-10-13 Size : 3.46kb User : gongwen
[Other resource] 0.0121 DL : 0: 后台管理用户名 admin 密码 admin --------------------------------------------------- 功能说明系统本着简洁实用的原则开发，便于使用者查询浏览，以及查看药品库存情况和经营情况，实时操作药品库存数据。前台部分：药品信息、查询、库存操作、销售统计后台管理部分：管理员管理、分类管理、规格管理、产地管理、进货商管理、药厂管理、药品添加、药品管理 --------------------------------------------------- 相关说明本系统基于WEB浏览，须上传到服务器或自行建立IIS 本系统系自行设计自行开发，内部使用而制作，无后续升级版本-background management user name admin password admin ----------------- ---------------------------------- system functionality In simple practical principles developed to facilitate users of Wikipedia, and check inventory of drugs and the operation of Real-time operating medicine inventory data. Prospects : drug information, inquiries, and inventory operations, the sale of statistical background management component : Administrators management, management, management specifications, production management, purchase management of pharmaceutical management, chemical additives, Drug Management ------------------------------------ --------------- note of the system based on Web browsing, to be uploaded to the server or set up their own system of the IIS system to design its own development, int
Date : 2008-10-13 Size : 172.89kb User : 李顺
[Other resource] Expression-D.S.Report2 DL : 0: 数据结构课程设计报告,算术表达式求值,自动辨别算符优先级,括号,将char型转换成int计算,再将结果显示,具有精美用户界面-data structure curriculum design, arithmetic expression evaluates automatically identify operator precedence, in brackets, char to int conversion type, the result shows that the user interface is attractive
Date : 2008-10-13 Size : 229.33kb User : 杜
[Other resource] jisuanjituxing DL : 0: 根据多边形区域的填充原理可以推广到圆域的填充，由于圆的特殊属性，即可根据任何欲填充的像素点与圆心的距离是否大于或小于半径来判断是否在圆内或圆外，具体实现程序如下；利用中点画圆算法实现边界程序： void CArea_FillData::MidpointCircle(int xc, int yc, int r, int color) {//画八分之一的圆 int x,y,d x=0 y=r d=1-r WholeCircle(xc,yc,x,y,color) while(x<y) -According to the regional polygon filling principle can be extended to the domain filled round, a round of special attributes, can be filled under any wishes to the central pixel and the distance is greater than or less than the radius to determine whether the circle or round, realize the procedure is as follows; Midpoint Circle Algorithm border procedures : void CArea_FillData : : MidpointCircle (int xc. yc int, int r, int color) (/ / painting of the eighth round int x, y, d x = 0 y = r d = 1-r WholeCircle (xc, yc, x, y, color) while (x
Date : 2008-10-13 Size : 79.84kb User : 周林
[Other resource] 1 DL : 0: 哈夫曼树和哈夫曼编码：从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编码。设计要求： ⑴ 哈夫曼殊和哈夫曼编码的存储表示参考教材事例 ⑵ 在程序中构造四个子程序为 ① int createhtree(HTree *t) /*根据输入的字符及其权值建立哈夫曼树*/ ② void coding(HTree *t, char *code) /*对哈夫曼树进行编码*/ ③ void printhtree(HTree *t, int* path) /*中序打印树*/ ④ void printcode(HTree *t) /*输出个字符的哈夫曼编码*/
Date : 2008-10-13 Size : 1.24kb User : 秋
[Other resource] chazhao DL : 0: [问题描述] 在二叉排序树中查找关键字为KEY的记录 [输入] 有序表输入要查找元素的关键字 [输出] 查找成功是即可显示查找成功 #include <stdlib.h> #include <stdio.h> typedef int KeyType typedef struct{ -[Problem Description] Binary Tree ranking keyword search for the records KEY [imported] ordered to investigate the importation of table find elements of the keyword search [output] is successful you can show success # include
Date : 2008-10-13 Size : 13.33kb User : Demonic
[Other resource] neipaixu DL : 0: [问题描述] 将N个关键字去整数的记录进行整序，以使所有关键字为非负数的记录排在关键字为负数的记录之前，要求使用最少的附加空间，且算法的时间复杂度为O（N） [输入] 待排序记录个数，各关键字的值。 [输出] 关键字从正负分开，正数在前 [存储结构] 待排序记录顺序存储。 [算法的基本思想] 快速排序算法每次任取一个记录的关键字为标准，将其余记录分为两组将，N个关键字去整数的记录进行整序，以使所有关键字为非负数的记录排在关键字为负数的记录之前。 #include <iostream> using namespace std #define MAXNUM 100//设文件的最长可能长度 void sort(int* keys, const int len)//排序 -[Problem Description] N keyword to the integer sequence the entire record. keyword so that all non-negative Records with the keyword for the negative record, at least require the use of the additional space and time complexity of the algorithm is O (N) [imported] to be sort record number, The value of the keyword. [Output] keyword separate from the pluses and minuses are several former [storage structure] scheduling records to be stored sequence. [Algorithm for the basic idea] quick sort algorithm each time a record for any keyword as a standard, The remaining records will be divided into two groups, N-keyword integral to the entire sequence record. keyword so that all non-negative Records with the keyword for the record before negative. # Include
Date : 2008-10-13 Size : 7.42kb User : Demonic
[Other resource] Merge2Array DL : 0: this package contains two .c files.One file implements the merge of two int arrays.The other one implements the merge of two linkage array.
Date : 2008-10-13 Size : 2.92kb User : tony chen
[Other resource] equ DL : 0: 编写具有如下函数原型的递归与非递归两种函数equ，负责判断数组a与b的前n个元素值是否按下标对应完全相同，是则返回true，否则返回false。并编制主函数对它们进行调用，以验证其正确性。 bool equ(int a[], int b[], int n) 提示：递归函数中可按如下方式来分解并处理问题，先判断最后一个元素是否相同，不同则返false；相同则看n是否等于1，是则返回true，否则进行递归调用（传去实参a、b与 n-1，去判断前n-1个元素的相等性），并返回递归调用的结果（与前n-1个元素的是否相等性相同）。
Date : 2008-10-13 Size : 557byte User : 常玉香
[Other resource] Interface PC KEYBOARD using 8051 INT pin DL : 0: Interface PC KEYBOARD using 8051 INT pin
Date : 2008-10-13 Size : 2.49kb User : 高威
[Other resource] lexica DL : 0: 词法分析器!内有文档!本程序识别的关键字为int real if then else while，仅当单独出现以上标识符时识别为关键字，对于inta,ifb等识别为标识符。操作符分隔符! -lexical analyzer! Have documentation! The procedures for the identification of the keyword int el real if then se while, and only if there alone at the above identifier for the keyword identification, inta. ifb identified as such identifier. Operator separation!
Date : 2026-01-05 Size : 74kb User : gavinioro

« 12 3 4 5 »