代码搜索：自举升压结构
找到约 10,000 项符合「自举升压结构」的源代码
代码结果 10,000
www.eeworm.com/read/467224/7020525
h huffman.h
//存储霍夫曼树节点的数据结构
typedef struct treenode
{
char data; //存储要编码的字符
int weight; //存储要编码的字符的权重
struct treenode* parent; //父节点
struct treenode*
www.eeworm.com/read/466955/7024717
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/466955/7024935
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/350896/7092171
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/461110/7233570
h c2-3.h
// c2-3.h 线性表的静态单链表存储结构
#define MAX_SIZE 100 // 链表的最大长度
typedef struct
{
ElemType data;
int cur;
}component,SLinkList[MAX_SIZE];
www.eeworm.com/read/460348/7253002
h lstack.h
/* 栈链接表示：类型和界面函数声明 */
typedef int DataType;
struct Node; /* 单链表结点 */
typedef struct Node *PNode; /* 指向结点的指针类型 */
struct Node { /* 单链表结点结构 */
DataType info;
www.eeworm.com/read/455289/7374606
cpp main.cpp
#include
#include
//学生结构体
struct Student{
char* name;
int year;
char* addr;
};
//比较函数
struct StudentLess{
bool operator()(const Student& s1, const Student& s2) const
www.eeworm.com/read/455145/7377256
cpp main.cpp
#include "scanner.h"
#include "parser.h"
void main()
{
//fp为指向文件类型结构体的指针变量
scanner sc;
sc.scan();
parser ps;
Treenode * Tree;
Tree=ps.parse();
www.eeworm.com/read/449197/7516841
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