代码名称：资料管理系统 一个资料管理系统的源程序，VB+ACCESS2000+ADO，功能强大...

Realiza inventarios no terminado

演示如何利用f90接口读出已经创建了4维数组的nc文件，并检查文件的正确与否-Demonstrates how to use the f90 interface to read out has created a four-dimensional array of nc file, and check the correctness of documents

RAD XE5 C++ 開發, 用於設定資料庫連線參數, 可設定 MSSQL 及 MYSQL, 並可將設定後的參數以DES編碼後存成檔案

回文数的判断，用栈和队列做的！希望大家可以互相交流一下-Palindrome number of judgments, with stacks and queues to do! Hope that we can exchange what

树的数据结构源代码-tree data structure source code

OCI（Oracle Call Interface）是ORACLE公司开发的一个应用程序开发工具，是一个通过访问Oracle数据库的服务器，控制各类SQL语句的执行，进而创建应用程序的的应用程序接口（API）。它支持SQL所有的数据定义，数据操作，查询，事务管理等操作，支持C和C++的数据类型，调用，语法和语义。它提供了一组可对Oracle数据库进行存取的接口子例程(函数)。 OCI程序实质上就是用高级语言写的程序，其特点是内部含有对OCI子函数库的调用，通过在第三代程序设计语言(如C语言)中进行调用可达到存取ORACLE数据库的目的。 本工程包含一个简单的oci封装，封装oci的基本操作，日常开发中对速度要求比较高而ado和普通的odbc方法满足不了要求的情况下可以考虑使用-OCI (Oracle Call Interface) was developed by an ORACLE application development tool, one by accessing the Oracle database server and control the implementation of various types of SQL statements, thereby creating the application s application program interface (API). It supports all SQL data definition, data manipulation, query, transaction management, operation, support C and C++, data types, call, syntax and semantics. It provides a set of Oracle database can access the interface sub-routines (functions). OCI program in essence is to use high-level language to write programs, characterized by an internal subroutine library that con

同时rear和len分别指示环形队列中队尾元素的位置和内含元素的个数。设计相应的入队和出队算法。-At the same time, rear and len, respectively, annular instructions squadron tail queue element containing the location and the number of elements. Design corresponding to the team and the team algorithm.

数据库的一点点小常试 转别人的希望哪个有收获 谢谢大家哦-The database a little bit of small regular test to others which have a harvest of hope Oh I would like to thank everyone

C++编程设计 关于数据结构 本书是一本无需任何程序设计基础累的书籍-C++ Programming on the data structure of this book is a foundation without any programming tired of books

strassen算法的扩展，可以计算任何偶数阶矩阵的相乘，一般strassen只能计算2的n次方阶（自己编写，英文注释~）-Strassen expansion algorithm can even order any calculation of matrix multiplication, general Strassen only two terms of the n-th-order (to prepare themselves, English Notes ~)