资源列表
EZW编码与解码
- 嵌入式零树编码程序(包括编码，解码，vc语言开发）-application-embeded zero tree code program(including code,decode ,vc language developing.)
ActiveLock V1.7
- 你是否曾经为要做一个试用软件而苦苦写很多代码，这个控件为你解决了写共享软件的麻烦，它可以把你的软件加一把锁，让用户注册，在规定期限内如果用户不注册就会不能试用或丧失一些功能。它自己是一个免费控件。-Have you ever written a lot of code just because you wanted to build a trial version of a program. This ActiveX control can make you free from that. It
cpucounter
- Intel提供的获取某台机器CPU数量的源代码-It showed how to get the CPU count of your computer. it come from Intel.
2catwork0506
- 计算MDI子窗口数,仅显示文件夹的打开对话框-calculate the numbers of MDI subwindows, only display the dialog box of the folders.
Bresenham_Middle_line
- 图形直线中点生成算法,Bresenham画直线,Bresenham画椭圆-This is a arithmetic of Bresenham_Middle_line.It draw line and ellipse acrossed Bresenham.
middle_bresenham_Line0
- 图形画椭圆与圆弧中点算法类似：确定一个象素后，接着在两个候选象素的中点计算一个判别式的值，由判别式的符号确定更近的点-To draw a ellipse,similar to the middle point of arc:after determine a pixel,calculate the value of a judge expression,according to its sign,determine the nearer point.
middle_bresenham_Arc
- 基本原理 假定初始点P0 ∈G0，沿某方 向(假定为X轴）前进△X时，到 达G+或G-(假定为G-)中的P1,在 沿另外一方向(Y轴)前进△Y,到 达P2。若P2 ∈G+，则改变前进 方向，否则继续向G+前进。-Basic Principle: First ,initial point Pzero,assumed that Pzero belong to Gzero,moves the distance deltaX along one direction,assuming X axes,a
middle_bresenham_Circle
- 基本原理 假定初始点P0 ∈G0，沿某方 向(假定为X轴）前进△X时，到 达G+或G-(假定为G-)中的P1,在 沿另外一方向(Y轴)前进△Y,到 达P2。若P2 ∈G+，则改变前进 方向，否则继续向G+前进。-functional:assume orient point P0 in G0,go along cX on some direction(assume x axial),arrive P1 in G+ or G-(assume G-),go along cY on another di
Javadoc的应用例子
- /** * This class maintain the time in 24-hour format. * @see java.lang.Object * @author Deitei & Associates, Inc */
Java的数据库操作
- Java的数据库操作 该数据库只有一个表addresss,它有11列.先把数据库注册为ODBC数据源.-Operation of database in Java.The database only has a table named address ,having 11 columns. Register the database to a ODBC datasource first.
Java二叉树的后续遍历
- Java二叉树的后续遍历 Java二叉树的后续遍历主要应用于逆波兰式的求解,在编译中很重要.-Java two following forks the tree traversal Java two following to fork the tree traversal mainly applies in goes against the Poland -like solution,Is very important in the translation
Java写的泥波兰式
- Java写的泥波兰式 A栈中存放的是逆波兰式结果。 B栈中存放的是操作符 B栈初始状态为@-Reverse Polish Notation by Java.In the A stack deposits goes against the Polish type result. In the B stack deposits is the instruction character B stack original state is @