NexusDB manual (chm format)

实时曲线类的改进增加功能: 1)采样数据存盘和加载 2)演示程序中可以实现图形的打印预览和打印功能,曲线从原点开始-Improvement of real-time curve of increasing the number of functional categories: 1) sampling data to disk and load 2) presentation graphics program can print and print preview function, curve from the origin to start

一个很叨 的算法作业,很强大的源代码 很强大的源代码很强大的源代码-A very garrulous operation of the algorithm, it is a powerful source code is a powerful source code is a powerful source code

多项式相加 pascal源程序-polynomial combined source

在视频处理中经常要用到Zigzag序号及其逆序号，本文提供了一个新的类CZigzag，可以求任意m×n块的Zigzag序号及其逆序号。 由于所求的Zigzag序号及其逆序号为一次性遍历生成，其时间复杂度仅为O（m×n）。-In video often use to deal with the serial number and its reverse No. Zigzag, the paper provides a new category CZigzag, can seek arbitrary m × n block Zigzag its serial number and its reverse. Zigzag As the demand for its serial number and its reverse traversal generates one-time, its time complexity is only O (m × n).

PostgreSQL7.4.6 for Linux

是一个很好的c++家族管理系统-is a good family management system c

B-树的创建、插入、删除等一系列操作！-B-tree creation, insert, delete a series of manipulations!

1、 用随机数生成的方式（要求用户输入随机数）产生一个迷宫：“1”表示墙，“0”表示路，最后的路径用“8”表示，若没有路径则打印报文，若有路径则打印出路径。 2、 通过堆栈及判断实现迷宫的自动寻找路径功能 -1, the random number generator of (requiring user input random number) produces a maze : "a" Wall said, "0" Lu said, the final path with "8" that if no path was reportedly Print text, if it were printed out trails path. 2, stack and judgment to achieve the labyrinth path function to automatically search

C++ Builder程序员学习数据结构 第1章源码-Builder C programmers to learn data structure source Chapter 1

哈夫曼树和哈夫曼编码： 从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编码。 设计要求： ⑴ 哈夫曼殊和哈夫曼编码的存储表示参考教材事例 ⑵ 在程序中构造四个子程序为 ① int createhtree(HTree *t) /*根据输入的字符及其权值建立哈夫曼树*/ ② void coding(HTree *t, char *code) /*对哈夫曼树进行编码*/ ③ void printhtree(HTree *t, int* path) /*中序打印树*/ ④ void printcode(HTree *t) /*输出个字符的哈夫曼编码*/ -Huffman tree and the Huffman coding: input from the terminal a number of characters and their corresponding integer, will be an integer as node weights, the establishment of Huffman tree, and then on the characters Huffman. Finally print Huffman tree and the corresponding Huffman. Design requirements: ⑴ Huffman and Huffman coding is that the reference materials storage ⑵ examples constructed in the procedure for the four subroutines ① int createhtree (HTree* t)/* input characters in accordance with its right value the establishment of Huffman tree*/② void coding (HTree* t, char* code)/* Huffman tree to encode*/③ void printhtree (HTree* t, int* path)/* Pri