代码搜索:自举升压结构
找到约 10,000 项符合「自举升压结构」的源代码
代码结果 10,000
www.eeworm.com/read/477696/6731421
java example03_circle.java
package example;
/* 类结构示例程序 */
public class Example03_Circle
{
double r, s;
// r = 5.5;
void setR(double r1)
{
r = r1;
}
double getR()
{
return r;
}
double getS
www.eeworm.com/read/476169/6763704
cpp hf.cpp
#include
#include
#include
#include
#include
#include
//定义结点结构
typedef struct {
char ch;
unsigned int weig
www.eeworm.com/read/405765/11457742
c fatinit.c
#ifndef _FAT_DEFINE
#include "FAT.c"
#endif
void FATInit(void);
void FATInit(void)
{
register BYTE i;
DPT = (struct DPTStr *)(DiskBuffer+0x1be); //分区表结构指针
BOOTSEC = (struct BootSec
www.eeworm.com/read/401642/11552619
h c3-2.h
/* c3-2.h 单链队列--队列的链式存储结构 */
typedef struct QNode
{
QElemType data;
struct QNode *next;
}QNode,*QueuePtr;
typedef struct
{
QueuePtr front,rear; /* 队头、队尾指针 */
}LinkQueue;
www.eeworm.com/read/401519/11556577
cpp cpp1.cpp
#include
#include
#include
#include
struct Disk //关于Disk结构的定义
{
HANDLE handle;
DISK_GEOMETRY disk_info;
};
Disk disk;
HANDLE
www.eeworm.com/read/401423/11557800
cpp theoperaterofcars.cpp
#include
#include
#define stack_init_size 100
#define stackincrement 10
#define error 0
#define ok 1
#define overflow -2
//栈结构的定义
struct sqstack
{
int *bas
www.eeworm.com/read/400154/11582088
h graphl.h
//*************** Link.h **************//
#define UNVISITED 0
#define VISITED 1
#define INFINITE 0xffffffff
#define N 5 // 定义图的顶点数
struct listUnit { //邻接表表目中数据部分的结构定义
int vertex; /
www.eeworm.com/read/262111/11606640
h c3-2.h
/* c3-2.h 单链队列--队列的链式存储结构 */
typedef struct QNode
{
QElemType data;
struct QNode *next;
}QNode,*QueuePtr;
typedef struct
{
QueuePtr front,rear; /* 队头、队尾指针 */
}LinkQueue;
www.eeworm.com/read/262048/11609222
c fatinit.c
#ifndef _FAT_DEFINE
#include "FAT.c"
#endif
void FATInit(void);
void FATInit(void)
{
register BYTE i;
DPT = (struct DPTStr *)(DiskBuffer+0x1be); //分区表结构指针
BOOTSEC = (struct BootSec
www.eeworm.com/read/158241/11630878
m ex0508.m
% EX0508 用try... catch... end结构来进行计算
n=4;
a=magic(n);
m=3;
b=eye(3);
try
c=a*b
catch
c=a(1:m,1:m)*b
end
lasterr