xxHash-dev

1、这是我自己做的最详细的枚举全部协议的基本信息最完美版。 2、采用树型控件加个图标，也显得好读。-1, this is my own to do the most detailed enumeration of all the basic information about the agreement the most perfect version. 2, using tree controls to add the icon, it seems a good time.

有很多的漏洞。有兴趣找茬的同志们可以下载来玩玩(There are many loopholes. Are interested in finding fault comrades can download to play)

Nucleus内核源码,包括任务的创建,任务间通信,中断处理.(Nucleus kernel source code, including task creation, task inter-communication, interrupt handling.)

方便好用的声学多普勒海流剖面仪（ADCP）海流数据Matlab处理程序。程序文件头信息有详细的使用说明。( ADCP=RDRADCP(NAME) reads the raw binary RDI BB/Workhorse ADCP file NAME and puts all the relevant configuration and measured data into a data structure ADCP (which is self-explanatory). This program is designed for handling data recorded by moored instruments (primarily Workhorse-type but can also read Broadband) and then downloaded post-deployment.)

说明：  Pokeface 题目描述 魔术师将一叠扑克顺次在桌上排成一行，初始全部正面朝上。随后，他每次挥一挥衣袖，都会翻转一连串的扑克，改变它们的正反朝向。从古代传下来的规矩，魔术师皆有师傅，他们要随时准备回答师傅的问题。问题形如：目前从第i张扑克牌到第j张扑克牌中，有几张正面朝上？ 作为魔术师的助手，你被要求学习程序设计、算法与数据结构。现在，魔术师把这个问题交给了你，你需要编写一个程序，维护相应的数据结构来保存桌子上牌面的情况，同时对于师傅的每一个问题，你要用尽量快的速度计算出答案。 输入 第一行包含三个正整数n、p和q。n表示扑克牌的数量，p表示魔术师的挥一挥次数，q表示师傅的问话次数。 接下来共p+q行，每行包含一个操作，操作分为2种： H i j 魔术师挥一挥，改变了第i张牌到第j张牌的正反 Q i j 师傅问话：截至目前，第i张到第j张牌中有多少张正面朝上 操作中恰好包含p次H操作，q次Q操作，与第一行的p和q吻合。H操作和Q操作的范围均包含边界（即第i张和第j张牌）。 对于每个操作，输入保证1 ≤ i ≤ j ≤ n。 输出 对于每次Q操作，输出一行，包含一个整数，表示问题的答案。 提示：线段树(Pokeface Title Description The magician will stack poker table sequentially in a row, all the initial face-up. He then every wisp will flip a series of poker pros and cons of changing their orientation. The rules handed down ancient times, the master magician Jie, they be ready to answer the teacher s questions. Question of the form: Currently playing cards i to j-card poker, there are a few face-up? As a magician s assistant, you are required to learn programming, algorithms and data structures. Now, the magician put this question to you, you need to write a program to maintain appropriate data structure to hold the cards on the table face the situation, while the master for each question, and you want to use as quickly calculate the answer. Enter The first line contains three positive integers n, p and q. n represents the number of poker, p represents the wave of the magic number, q represents the number of master s questioning. Next, a total of p+ q rows, each containi)

uiOne的介绍 手机以后ui开发的趋向(Introduction to uiOne: the trend of ui Development after Mobile phone)

vc++通过串口控制设备，来实现开关灯。是VC的一个串中应用设备例子。自己做的一个项目。(vc++ through the serial port control equipment to achieve the switch lights. VC are a string of examples of applications. Their own to do a project.)

说明：  多重网格法、线接触、弹流润滑、Fortran(Multigrid method, line contact, elastohydrodynamic lubrication, Fortran)

直接用winsock api实现寻呼功能 支持完全自控的聊天服务。支持中国联通,河北国信,万声寻呼,中铁寻呼,斯壮寻呼,国讯寻呼等主要干线-Realize the direct use of winsock api paging features fully automatic control of the chat support service. Support of China Unicom, Hebei Guoxin, million voice paging, iron paging, Sizhuang paging, paging inquiry States and other major trunk

《c 和指针》课后习题第五章答案源代码，包含多个习题的答案和说明。(the sourcecode of C&pointers chapter 3)