The Pages 2.0 specification is one of the most exciting Java Community Process releases of the year. Chances are you picked this book to learn more about the new features of 2.0. Or you may be interested in using for the first time in your next project. Regardless of your interest, we ve put together a book that tries to bring you up to speed fast. The goal of has been to make it easier to create sophisticated, well-designed Web applications. We feel that the authors of the specification have achieved their goal. Working with databases or XML has never been simpler. Your applications can be functionally well-organized. You can create your own reusable components.
标签： specification Community the exciting
上传时间： 2017-08-02
上传用户：liglechongchong
Solve the 8-puzzle problem using A * algorithme. Input: Program reads start state and goal state and heuristic (N or S) from EightPuzzle.INP file.0 representing blank. There are 2 Heuristic: 1. N: Number of misplaced tiles 2. S: Sum of Manhattan distance of current location and target location. Format: The first line write type of heuristic (N or S). next is the status of departing and landing status. Between 2 states of 1 line blank. See examples EightPuzzle.INP
标签： state algorithme Program problem
上传时间： 2017-08-12
上传用户：jjj0202
Main program running when workpiece is ready on deferent belt(deferent_ready=ture). * Call Square_Wave subroutine to generate 0.5ms square wave on P1.2 to drive * electromotor,then drive deferent belt step forward. When it steps to the measure * zone, it stops to be measured. Then call A_D subroutine to transform analog * signals to digital signals , after then call serial subroutine to transfer * digital signals to PC. Call square wave subroutine to drive deferent belt step to * original position waitting for defere ready flag to run the next circle.
标签： deferent_ready workpiece deferent program
上传时间： 2017-08-31
上传用户：baiom
利用KMP算法，求的模式字符串的next[]数组
上传时间： 2017-09-02
上传用户：plsee
The book uses a task-oriented structure that allows you to work through the steps necessary to install MySQL 4.1 on Linux and Windows platforms, create and manage MySQL databases, query and manipulate data stored in those databases, administer the MySQL database management system, and connect to MySQL databases from your PHP, JSP/Java, and ASP.NET/C# applications. The next section, which describes the book’s structure, provides additional details about the specifics of what the book covers.
标签： task-oriented structure necessary through
上传时间： 2017-09-06
上传用户：a673761058
这是KMP字符串匹配算法的实现代码，其中next数组的求解算法也是该进型的，避免了重复搜索的问题
上传时间： 2014-01-09
上传用户：gtzj
两个链表的交集 #include<stdio.h> #include<stdlib.h> typedef struct Node{ int data; struct Node *next; }Node; void initpointer(struct Node *p){ p=NULL; } int printlist(struct Node* head){ int flag=1; head=head->next; /* 因为标记1的地方你用了头结点，所以第一个数据域无效，应该从下一个头元结点开始 */ if(head==NULL) printf("NULL\n"); else { while(head!=NULL) { if(flag==1) { printf("%d",head->data); flag=0; } else { printf(" %d",head->data); } head=head->next; } printf("\n"); } return 0; } struct Node *creatlist(struct Node *head) { int n; struct Node *p1=(struct Node *)malloc(sizeof(struct Node)); p1->next=NULL; while(scanf("%d",&n),n!=-1) { struct Node *pnode=(struct Node *)malloc(sizeof(struct Node)); pnode->next=NULL; pnode->data=n; if(head==NULL) head=pnode; p1->next=pnode; p1=pnode; } return head; } struct Node *Intersect(struct Node *head1, struct Node *head2) { struct Node *p1=head1,*p2=head2;/*我这里没有用头指针和头结点，这里是首元结点head1里面就是第一个数据，一定要理解什么事头指针， 头结点，和首元结点 具体你一定要看这个博客：http://blog.sina.com.cn/s/blog_71e7e6fb0101lipz.html*/ struct Node *head,*p,*q; head = (struct Node *)malloc(sizeof(struct Node)); head->next = NULL; p = head; while( (p1!=NULL)&&(p2!=NULL) ) { if (p1->data == p2->data) { q = (struct Node *)malloc(sizeof(struct Node)); q->data = p1->data; q->next = NULL; p->next = q;//我可以认为你这里用了头结点，也就是说第一个数据域无效 **标记1** p = q; p1 = p1->next; p2 = p2->next; } else if (p1->data < p2->data) { p1 = p1->next; } else { p2 = p2->next; } } return head; } int main() { struct Node *head=NULL,*headt=NULL,*t; //initpointer(head);//这里的函数相当于head=NULL; // initpointer(headt);//上面已经写了headt=NULL那么这里可以不用调用这个函数 head=creatlist(head); headt=creatlist(headt); t=Intersect(head,headt); printlist(t); }
标签： c语言编程
上传时间： 2015-04-27
上传用户：coco2017co
keil C51 v6.12 完全解密版的安装说明 安装方法是先将V6.12安装程序用复制到某个目录下，如复制到D:\keilC51 然后执行D:\keilC51\setup\setup.exe 安装程序，选择安装Eval Version版进 行安装。 注册码：K199U-20071-12A9U 当出现Please insert the add-on disk的提示画面，可按next按钮（不用 插入软盘）。 安装好之后就可以使用，没有代码大小的限制，这是完全版，比 Eval版增 加浮点库等内容。
标签： keilC51v612
上传时间： 2015-07-17
上传用户：f29876
[开源 绿色软件] [运行环境 Windows XP/7/8/10] [语言 简体/繁體/English/Unicode] A cool music player. Powered by Bass and BassVis. 极简本地音乐播放器，透明、纯文本界面。支持轻媒体库、歌词、可视化。最小化到托盘，占用资源少，适合边听音乐边工作。 应网友要求，加入了Tag编辑、自动切换列表、播放队列、鼠标手势、均衡器、音频设备选择、全局音量滚轮（托盘区域）、字体设置、极简模式、鼠标穿透、嵌入桌面、简单布局等功能。 homepage> mcool.appinn.me ==================================================== 音频格式APE、FLAC、WavPack、MP3、OGG、TTA、TAK、Musepack、AAC、AC3、WMA、Wav、CD、ALAC、Aiff、MOD、CUE ==================================================== 更新历史: 3336 -2016.3.25 点睛之笔：任意布局（追上foobar2000）。Arbitrary layout (all in one). 3330 -2016.3.10 一体布局之比例调节（初具foobar2000风貌）。Ratio adjust (all in one). 3308 -2015.11.28 歌词微调（在选项>常规>鼠标手势里设置）。Adds function of lyrics tuning. 3306 -2015.11.15 电台模式（整点时切换歌曲或列表，并非在线音乐），以及多声卡支持。Adds radio mode, and multi sound card support. 3300 -2015.10.15 完善细节，修复切歌卡住bug。完美版。Fixes some bugs. 3280 -2015.8.1 简单布局功能。Layout (all in one) function. 3260 -2015.6.1 Win10模式。Win10 mode. 3252 -2015.5.10 任务栏进度条。Taskbar progress display. 3236 -2015.4.10 点睛之笔：透明度调节。Adds function of transparency tuning. 3232 -2015.3.25 自定义软件名（请在mcool.ini中手动修改）。Adds function of customizing app name. 3230 -2015.3.12 Airplay复刻界面。Airplay interface copy. 3218 -2015.1.20 桌面歌词。Desktop lyrics. 3216 -2015.1.12 一体化界面（学习Foobar2000和豆瓣FM）。All in one interface. 3212 -2015.1.6 新增Winamp音效插件支持（学习千千静听），以及滚轮穿透功能（学习Airplay3）。Adds Winamp DSP plugins support, and adds function of wheel transparent. Winamp音效插件下载：http://uploadgeneration.info/Winamp/www.winamp.com/plugins/dsp-effect/5/top-rated.html 3210 -2014.12.28 重要更新：本地音量调节、自定义鼠标键/手势。Adds local volume control, and adds fuction of customizing mouse control / gesture. 3208 -2014.11.25 简化右键菜单，常规项目移到选项窗口。Simplifies the popup menu, moves the general items to option window. 3206 -2014.11.22 新增文本对齐选项，重新设计导航按钮。Adds option of text alignment, and redesigns the buttons of playback. 3202 -2014.11.10 新增播放记忆、片段循环（Hotkey: Ctrl+1/2）和贴边隐藏功能。Adds functions of playback memory, AB repeat and screen side hide. 3200 -2014.11.5 新增无界面选项（先去掉托盘图标，然后Ctrl+Alt+W隐藏界面，Ctrl+Alt+X关闭）。Adds option of no interface. 3191 -2014.8.26 嵌入桌面。Pins to desktop. 3190 -2014.8.19 音乐管理第一步：列表分组。Playlists grouping. 3186 -2014.8.10 基于列表的分级系统（Hotkey:0..5）。Rating system based on playlist. 3181 -2014.8.1 启用新图标（由虹吸墨作者BGLL友情制作）。Uses the new icon. 3180 -2014.7.22 新增Win7任务栏特效。Adds windows 7 taskbar effect. 3166 -2014.6.29 重要更新：自动下载专辑封面（源于歌词迷）。Downloads album covers from geci.me. 3160 -2014.6.1 重要更新：新增极简模式，以及OGG/Opus内置封面显示功能。Adds minimalist mode, and adds function of displaying cover embedded in OGG/Opus. 3152 -2014.5.18 添加托盘右键菜单，新增MP4/M4A(ALAC)内置封面显示功能。Adds systray popup menu, and adds function of displaying cover embedded in MP4/M4A(ALAC). 3151 -2014.5.1 重新设计可视化效果，新增示波器效果。Redesigns visual effects, and adds oscilloscope effect. 3150 -2014.4.20 采用歌词迷API下载歌词。Downloads lyrics from geci.me. 3136 -2014.3.30 加入可选的按钮，以及鼠标穿透功能。Adds function of transparent window. 3132 -2014.3.6 简化界面，向Foobar2K看齐；增加正在播放面板。Simplifies the interface, and adds now playing panel. 3130 -2014.2.26 重要更新：按照专辑分组。Grouping by album. 3120 -2014.2.18 优化字体渲染（Windows7/8下）。Optimizes font rendering in Windows 7/8. 3110 -2014.1.26 点睛之笔：自定义字体颜色。Adds function of customizing font color. 3108 -2013.11.16 Last.fm同步功能（请到主页下载插件）。Last.fm scrobbler support. 3106 -2013.11.8 可回溯的随机播放（学习Airplay 2）。Random playback can be traced back. 3103 -2013.10.12 优化右键菜单。Optimizes popup menu. 3102 -2013.9.30 修改滚动条样式，增加音频缓冲选项。Modifies style of scroll bar, and adds option of audio buffer length. 3100 -2013.9.10 无边框设计；迷你模式也可以不置顶（Hotkey:T）。Borderless designs. 3086 -2013.8.20 增加歌词面板功能。Adds function of lyrics panel. 3082 -2013.8.08 增加在可视化界面显示歌词功能。Adds function of displaying lyrics on visual interface. 3080 -2013.8.01 新增设置字体功能，恢复简单的自动关机功能。Adds function of setting font, and re-adds simple function of auto shutdown. 3060 -2013.6.26 修复在迷你模式停止响应的Bug，去掉自动关机、歌词调整功能。Fixes bug of stop responding in mini mode, and removes functions of auto shutdown and lyrics trimming. 3050 -2013.5.23 增加手势功能。Adds gesture function. 3030 -2013.3.10 增加Aero磨砂玻璃效果[如需源码请联系我]，XP/Win7/8无差别显示，按Insert键开启。Adds aero glass effect. 3020 -2013.2.23 增加简易Tag编辑功能（选中并单击即可，相当于资源管理器中的重命名，按照[歌手 - 歌名][专辑]格式进行编辑）。Adds function of editing audio tags (select and click, edit with [artist - title][album] format). 3010 -2013.1.23 应网友要求，加入读取内嵌CUE、歌词及专辑封面功能。Adds function of reading CUE, LRC and album cover built in media. 3002 -2012.11.03 无按钮设计；微调进度条尺寸。Buttonless design; modifies the size of the progress bar. 3001 -2012.10.15 重要改进，界面即按钮：单击 - 播放/暂停，按住 - 前进。Important update, the interface is a button: Click - Play/Pause, Hold Down - next. 3000 -2012.9.28 增加Win8模式。Adds Win8 mode option. 2982 -2012.8.26 在Win8下使用微软雅黑字体。Uses Microsoft YaHei font in Windows 8 CHS. 2981 -2012.8.20 视频以插件提供（请到主页下载），增加单曲循环功能。Adds function of repeat track. 2980 -2012.7.26 简化代码，去掉视频和MIDI支持。Removes the video and MIDI support. 2970 -2012.7.20 增加媒体信息显示功能。Adds function of displaying media info. 2960 -2012.6.28 增加专辑封面显示功能（Hotkey:Ins）。Adds function of displaying album cover. 2956 -2012.6.01 再次简化界面。Simplifies the interface again. 2952 -2012.4.28 增加音频设备选择功能：DS、ASIO、WASAPI。Adds function of selecting playback device. 2950 -2012.3.30 *增加滚轮调节音量功能（在托盘，中键静音）和媒体键支持。Adds function of setting volume by mouse wheel (over systray, middle click to mute), and adds multimedia keys support. 2936 -2012.3.17 微调界面，修复物理删除失效的BUG。Fine-tunes the interface, and restores the physical delete function. 2930 -2012.2.27 增加TAK格式支持。Adds TAK format support. 2923 -2012.2.12 紧急修复上一版出现的字体模糊BUG（Vista/Win7下），增加在任务栏显/隐图标功能（Ctrl+T）。Fixes font vague bug for Vista/Win7, and adds showing/hiding icon on taskbar function. 2920 -2012.2.08 微调界面，优化CPU占用（启用背景图片时）。Fine-tunes the interface, and optimizes CPU utilization (while enable background image). 2912 -2012.1.12 增加播放队列功能。Adds playback queue function. 2910 -2011.12.25 改进迷你模式，增加查找功能。Improves mini mode, and adds find function. *注：此功能对杀毒软件过敏，开启方法：按F1进入选项，勾选全局快捷键。The feature is allergic to the anti-virus software.
上传时间： 2016-06-10
上传用户：fanghua
#include <malloc.h> #include <stdio.h> #include <stdlib.h> #include <string.h> #define NULL 0 #define MaxSize 30 typedef struct athletestruct /*运动员*/ { char name[20]; int score; /*分数*/ int range; /**/ int item; /*项目*/ }ATH; typedef struct schoolstruct /*学校*/ { int count; /*编号*/ int serial; /**/ int menscore; /*男选手分数*/ int womenscore; /*女选手分数*/ int totalscore; /*总分*/ ATH athlete[MaxSize]; /**/ struct schoolstruct *next; }SCH; int nsc,msp,wsp; int ntsp; int i,j; int overgame; int serial,range; int n; SCH *head,*pfirst,*psecond; int *phead=NULL,*pafirst=NULL,*pasecond=NULL; void create(); void input () { char answer; head = (SCH *)malloc(sizeof(SCH)); /**/ head->next = NULL; pfirst = head; answer = 'y'; while ( answer == 'y' ) { Is_Game_DoMain: printf("\nGET Top 5 when odd\nGET Top 3 when even"); printf("\n输入运动项目序号 (x<=%d):",ntsp); scanf("%d",pafirst); overgame = *pafirst; if ( pafirst != phead ) { for ( pasecond = phead ; pasecond < pafirst ; pasecond ++ ) { if ( overgame == *pasecond ) { printf("\n这个项目已经存在请选择其他的数字\n"); goto Is_Game_DoMain; } } } pafirst = pafirst + 1; if ( overgame > ntsp ) { printf("\n项目不存在"); printf("\n请重新输入"); goto Is_Game_DoMain; } switch ( overgame%2 ) { case 0: n = 3;break; case 1: n = 5;break; } for ( i = 1 ; i <= n ; i++ ) { Is_Serial_DoMain: printf("\n输入序号 of the NO.%d (0<x<=%d): ",i,nsc); scanf("%d",&serial); if ( serial > nsc ) { printf("\n超过学校数目,请重新输入"); goto Is_Serial_DoMain; } if ( head->next == NULL ) { create(); } psecond = head->next ; while ( psecond != NULL ) { if ( psecond->serial == serial ) { pfirst = psecond; pfirst->count = pfirst->count + 1; goto Store_Data; } else { psecond = psecond->next; } } create(); Store_Data: pfirst->athlete[pfirst->count].item = overgame; pfirst->athlete[pfirst->count].range = i; pfirst->serial = serial; printf("Input name:) : "); scanf("%s",pfirst->athlete[pfirst->count].name); } printf("\n继续输入运动项目(y&n)？"); answer = getchar(); printf("\n"); } } void calculate() /**/ { pfirst = head->next; while ( pfirst->next != NULL ) { for (i=1;i<=pfirst->count;i++) { if ( pfirst->athlete[i].item % 2 == 0 ) { switch (pfirst->athlete[i].range) { case 1:pfirst->athlete[i].score = 5;break; case 2:pfirst->athlete[i].score = 3;break; case 3:pfirst->athlete[i].score = 2;break; } } else { switch (pfirst->athlete[i].range) { case 1:pfirst->athlete[i].score = 7;break; case 2:pfirst->athlete[i].score = 5;break; case 3:pfirst->athlete[i].score = 3;break; case 4:pfirst->athlete[i].score = 2;break; case 5:pfirst->athlete[i].score = 1;break; } } if ( pfirst->athlete[i].item <=msp ) { pfirst->menscore = pfirst->menscore + pfirst->athlete[i].score; } else { pfirst->womenscore = pfirst->womenscore + pfirst->athlete[i].score; } } pfirst->totalscore = pfirst->menscore + pfirst->womenscore; pfirst = pfirst->next; } } void output() { pfirst = head->next; psecond = head->next; while ( pfirst->next != NULL ) { // clrscr(); printf("\n第%d号学校的结果成绩:",pfirst->serial); printf("\n\n项目的数目\t学校的名字\t分数"); for (i=1;i<=ntsp;i++) { for (j=1;j<=pfirst->count;j++) { if ( pfirst->athlete[j].item == i ) { printf("\n %d\t\t\t\t\t\t%s\n %d",i,pfirst->athlete[j].name,pfirst->athlete[j].score);break; } } } printf("\n\n\n\t\t\t\t\t\t按任意建 进入下一页"); getchar(); pfirst = pfirst->next; } // clrscr(); printf("\n运动会结果:\n\n学校编号\t男运动员成绩\t女运动员成绩\t总分"); pfirst = head->next; while ( pfirst->next != NULL ) { printf("\n %d\t\t %d\t\t %d\t\t %d",pfirst->serial,pfirst->menscore,pfirst->womenscore,pfirst->totalscore); pfirst = pfirst->next; } printf("\n\n\n\t\t\t\t\t\t\t按任意建结束"); getchar(); } void create() { pfirst = (struct schoolstruct *)malloc(sizeof(struct schoolstruct)); pfirst->next = head->next ; head->next = pfirst ; pfirst->count = 1; pfirst->menscore = 0; pfirst->womenscore = 0; pfirst->totalscore = 0; } void Save() {FILE *fp; if((fp = fopen("school.dat","wb"))==NULL) {printf("can't open school.dat\n"); fclose(fp); return; } fwrite(pfirst,sizeof(SCH),10,fp); fclose(fp); printf("文件已经成功保存\n"); } void main() { system("cls"); printf("\n\t\t\t 运动会分数统计\n"); printf("输入学校数目 (x>= 5):"); scanf("%d",&nsc); printf("输入男选手的项目(x<=20):"); scanf("%d",&msp); printf("输入女选手项目(<=20):"); scanf("%d",&wsp); ntsp = msp + wsp; phead = (int *)calloc(ntsp,sizeof(int)); pafirst = phead; pasecond = phead; input(); calculate(); output(); Save(); }
标签： 源代码
上传时间： 2016-12-28
上传用户：150501
