This a class that convert HTML to xml, ready to be used by other applicaiton.

最长公共子序列的个人实验，输入两个不同的字符序列（要求必须是字母），将输出这两个字符序列的最长公共子序列。(Individual experiments longest common subsequence, enter two different sequences of characters (letters must be required), the output of the longest common subsequence of the two-character sequence.)

opencv2.4.10+vs2013+win10环境下

一个自动画折线图的DEMO，需要这方面的同学可以下载下来看看(A self-animated line graph DEMO, this need can be downloaded the students look)

说明：  stm32f4 use pinyin input

说明：  AD7190 STM32 差分电路完成电子秤软件开发；(ctronic balance/scale AD7190)

c++ code for forward modeling in transverse electromagnetic wave propagation.

implementation of AODV in c

说明：  最好用的PDF阅读器，已经破解，无需注册码，安装即可使用……(The best use of the PDF reader, have been cracked, no key, the installation can be used ... ...)

MODBUS通信协议，用VC6.0调试通过，非常好用，做上位机用这个很好(MODBUS communication protocol with VC6.0 debugging through, very easy to do well with this PC)

#ifndef  __MY_SEQLIST_H__  #define __MY_SEQLIST_H__ typedef void SeqList; typedef void SeqListNode; //链表 创建 SeqList* SeqList_Create(int capacity); //链表 销毁 void SeqList_Destroy(SeqList* list); //链表 清空 void SeqList_Clear(SeqList* list); //链表 长度 int SeqList_Length(SeqList* list); //链表 容量  int SeqList_Capacity(SeqList* list); //链表 在某一个位置 插入元素 int SeqList_Insert(SeqList* list, SeqListNode* node, int pos); //获取某一个位置的链表结点 SeqListNode* SeqList_Get(SeqList* list, int pos); //删除某一个位置的结点 SeqListNode* SeqList_Delete(SeqList* list, int pos); #endif  //__MY_SEQLIST_H__