-
WinSocketAPI
使用Winsocket API实现的网络通信功能，分客户端和服务器端。(Winsocket API to achieve the use of the network communication function, sub-client and server.)
- 2009-05-19 12:30:43下载
- 积分：1
-
Force-Feedback-with-DirectInput
This is a code stub from a game I am working on. You will need to have DirectX 7.0 installed or higher. I will give you two sample effects when using a force-feedback joystick. The first one is an Explosion force feedback effect, the other one is a Gunfire effect. You will have to enum your own Joystick object.
- 2014-07-13 14:06:31下载
- 积分：1
-
2
说明： 地球处理多边体的重磁异常的正演，主要是地球数据处理的课程的实验项目2(The forward modeling of gravity and magnetic anomalies in the earth s processing of the multilateral body is mainly the experimental project of the earth data processing course 2)
- 2016-03-14 21:28:38下载
- 积分：1
-
DPT-Test-Board
C code, Pressure sensor
- 2011-11-16 08:53:32下载
- 积分：1
-
2_Brusselator_Heun_period_boundary
经典非线性动力学模型，布鲁塞尔子模型，可直接运行，运算效率高。(nonlinear dynamics Brusselator model)
- 2014-01-18 22:16:57下载
- 积分：1
-
simplec++codeforp2p
说明： C++的一个P2P程序，支持流媒体的传输(a P2P C procedures, streaming media transmission)
- 2006-05-07 15:53:54下载
- 积分：1
-
TimeTransform
本程序得到当前系统时间，然后将其转化为4个字节十六进制表示的整数，这个整数表示从1970年1月1日0点0分0秒以来所经过的秒数，这种转换符合MFC规定的时间转换标准，便于嵌入式系统的时间存储与计算(This procedure has been the current system time, and then into four-byte hexadecimal integer, the integer that from at 00:00:00 on January 1, 1970 after the number of seconds since this conversion MFC time to comply with the provisions of the conversion standard time embedded systems to facilitate storage and computing)
- 2008-12-22 20:33:30下载
- 积分：1
-
maze
迷宫求解一般采用“穷举法”，逐一沿顺时针方向查找相邻块（一共四块－东(右)、南(下)，西(左)、北(上)）是否可通，即该相邻块既是通道块，且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)
- 2013-12-13 17:55:45下载
- 积分：1
-
compare
int compare(const char* a, const char* b, int size)
{
for (int i = 0 i < size i ++)
{
if (a[i] != b[i])
{
return i
}
}
return -1
}
(int compare(const char* a, const char* b, int size)
{
for (int i = 0 i < size i++)
{
if (a[i] != b[i])
{
return i
}
}
return-1
}
)
- 2014-09-02 13:53:50下载
- 积分：1
-
juzhenleiyingyong
这是关于C++的矩阵类的应用源码，包括矩阵各类应用.(This is about the application source code C++ matrix class, including all types of applications matrix.)
- 2016-01-12 12:11:54下载
- 积分：1
