代码搜索：数据存储
找到约 10,000 项符合「数据存储」的源代码
代码结果 10,000
www.eeworm.com/read/240535/13214802
swf 串的顺序存储.swf
www.eeworm.com/read/324959/13235884
txt 取消订票存储过程.txt
www.eeworm.com/read/315835/13535508
c 线性顺序存储结构.c
#include
#include
#define MAX 20
#define ELEMTP int
#define v (*p)
struct sequnce
{
ELEMTP elem[MAX];
int len;
};
main()
{
struct sequnce *pz;
int i,y,cord;
v
www.eeworm.com/read/315750/13536941
cpp 栈的顺序存储.cpp
#include
#include
#include
typedef int selemtype;
int ok=0;
#define STACK_INIT_SIZE 20
#define STACKINCREMENT 10
typedef struct {
selemtype *base;
sele
www.eeworm.com/read/311535/13629641
c 线性顺序存储结构.c
#include
#include
#define MAX 20
#define ELEMTP int
#define v (*p)
struct sequnce
{
ELEMTP elem[MAX];
int len;
};
main()
{
struct sequnce *pz;
int i,y,cord;
v
www.eeworm.com/read/308157/13707164
c 线性顺序存储结构.c
#include
#include
#define MAX 20
#define ELEMTP int
#define v (*p)
struct sequnce
{
ELEMTP elem[MAX];
int len;
};
main()
{
struct sequnce *pz;
int i,y,cord;
v
www.eeworm.com/read/306600/13741485
h 栈的存储结构.h
//文件名：栈的存储结构
#define STACK_INIT_SIZE 10 /* 存储空间初始分配量 */
#define STACK_INCREMENT 2 /* 存储空间分配增量 */
typedef struct SqStack
{
SElemType *base; /* 在栈构造之前和销毁之后，base的值为NULL */
SElemType *
www.eeworm.com/read/301756/13848971
txt 存储过程2.txt
create procedure zdel is
v_jsl base.jsl%type;
cursor cur_1 is select jsl from base
where jsl=0;
begin
open cur_1;
loop
fetch cur_1 into v_jsl;
exit when cur_1%NOTFOUND;
delete from bas
www.eeworm.com/read/301236/13863138
doc 实验08 存储过程.doc
www.eeworm.com/read/301164/13865044
sql 生成存储过程脚本.sql
select id=identity(int),text=cast(
N'if exists(select * from sysobjects where id=object_id(N'
+quotename(name)+N')
drop proc '+quotename(name)+N'
GO' as nvarchar(4000))
into ## from sysobject