这是一个简单的软件开发包（SDK），你可以利用这个 GPSLIB 在自己的32位 Windows 应用程序中加入全球定位系统的支持。源代码压缩文件中包含有 GP...

　在一个类中，C++用三个关键词设置访问界限：public, private和protected。它们决定了跟在他们后面的标识符的被使用情况：public意味着其后的标识符可以被用户定义的其实例引用 而private则说明其后的标识符除了类的成员函数之外，用户定义的其实例不能引用 protected为类的继承提供了接口，同时保护其不被外界访问。-In a class, C++ using the three keywords set to visit boundaries: public, private and protected. They decided to follow behind in their use of the identifier: public means the following can be user-defined identifier of the examples cited and private identifier is illustrated in the following categories of members in addition to function, the user the definition of its instances can not be invoked protected to provide the type of interface inheritance, at the same time not to be outside the protection of their visit.

cb轻松锁屏，得到屏幕图像。-cb easily lock screen, the screen image to be.

进程调度算法演示,程序中含有一些对控制台输出和事件进行控制的API函数-This is a display of process assigned algorithm. It includes some API functions for the control of console output and events.

中国节日对照的源码，还有阴阳历转换，用于51单片机-Chinese festival of the source control, as well as conversion阴阳历for 51 single-chip

 MEMORY { PAGE 0: VECS: org=0x0080, len=0x80 PROM: org=0x1000, len=0x1000 /* 4k words */ PAGE 1: STACK: org=0x100, len=0x400 /* 1k words */ DARAM: org=0x2000, len=0x1000 /* 4k words */ } SECTIONS { .text :> PROM PAGE 0 vectors :> VECS PAGE 0 .bss :> DARAM PAGE 1 .data :>  DARAM PAGE 1 } 

VB滚轮补丁的功能是VB程序中滚轮的设置方便应用-VB function wheel patch VB programs are set up to facilitate the application of wheel

boot codes from a project being worked on

this a relatively simple program. -this is a relatively simple program.

象棋是一款比较有智商的游戏。适合现代人的娱乐需求，尤其是网络对战，更是大快人心。。

A*算法属于一种启发式搜索。它扩展结点的次序类似于广度优先搜索，但不同的是每生成一个子结点需要计算估价函数F，以估算起始结点到该结点的代价及它到达目标结点的代价的和；每当扩展结点时，总是在所有待扩展结点中选择具有最小F值的结点作为扩展对象，以便使搜索尽量沿最有希望的方向进行。 -A* algorithm is a heuristic search. It extended node in the order of priority similar to the breadth of search, but in every generation is a sub-node calculated valuation function F, to estimate initial node to the node, the price and it arrived at the target node, and the price; Whenever expansion node, the question has always extended to all nodes with the smallest choosing F value of the node as expansion targets, in order to search as far as possible along the most promising direction.