//修改员工信息函数 int change(Node *worker) { Node *p; char find[20]; p = worker->next; if (p == NULL) { printf("\n提示:没有资料可以修改!\n"); return 0; } printf("请输入要修改的员工号"); scanf("%s", find); while (p != NULL) { if (strcmp(p->data.jobNo, find) == 0) { break; } p = p->next; } if (p!=NULL) { int x; while (1) { printf("完成修改请输入0,否则输入非0数字进行修改!"); scanf("%d", &x); if (x == 0) { break; } printf(" 请输入新员工号: "); scanf("%s", p->data.jobNo); printf(" 请输入新员工姓名: "); scanf("%s", p->data.name); printf(" 请输入新员工性别: "); scanf("%s", p->data.sex); printf(" 请输入新员工出生年月: "); scanf("%s", p->data.birthday); printf(" 请输入新员工职务: "); scanf("%s", p->data.position); printf(" 请输入新员工工资: "); scanf("%s", p->data.salary); printf(" \n提示:该职工资料已经修改!\n "); } } else printf("\n提示:没有你要修改的资料!\n "); }

void Linklist::insert_tail(string name)// 尾插 { worker* p = head; // 指针变量 p 指向 head 所指向的内存地址。 worker* new_worker = new worker(name);//创建一个名为 new_worker 的 worker 对象，并将其 next 指针设置为 NULL。 new_worker->next = NULL; if (p == NULL) { p = new_worker; } else { while (p->next != NULL) { p = p->next; } p->next = new_worker; } }

具体实现是先创建一个新的工人对象 new_worker，然后将其 next 指针设置为 NULL。接着判断链表是否为空，如果为空，则将头指针指向新的工人对象；否则，遍历链表找到最后一个工人对象，将其 next 指针指向新的工人...

int Disp(Node worker) { Node p; p = worker->next; if (p == NULL) { printf(" \n提示:没有信息可以显示!\n "); return 0; }

这段代码是用来显示链表中所有员工信息的函数。具体来说，函数的参数是一个链表节点指针worker，表示链表的头节点。首先，代码定义一个指针变量p，将其指向链表的第一个节点，即worker节点的下一个节点。如果p指向...

int Linklist::find_ID(int ID) //按编号查找 { worker* p = head; if (ID > worker::m_id || ID < 1000) { cout << "该编号不存在" << endl; return -1; } while (p->next != NULL) { if (p->next->m_ID == ID) { p->next->print(); return 0; } else { p = p->next; } } }解释

这是一段 C++ 代码，用于在链表中按照编号查找对应的节点。如果输入的编号不在链表中，会输出“该编号不存在”，并返回-1。如果找到了对应的节点，会输出该节点的信息，并返回0。作为 AI，我可以回答这个问题。

#include"stdio.h" #include <iostream> #include <malloc.h> #include<windows.h> using namespace std; typedef struct employee { int no; char name[10]; int depno; float salary; } Worker; typedef struct node { Worker data; struct node next; } WorkerList; static void destroy_employee( WorkerList &L) { WorkerList pre = L; WorkerList p = pre->next; while(p != NULL) { free(pre); pre = p; p = p->next; } free(pre); } static void delete_all( WorkerList &L) { FILE fp = NULL; fp = fopen("emp.dat", "wb"); if(fp == NULL) { cout<<"不能打开职工文件\n\n\n"; return; } fclose(fp); destroy_employee(L); L = ( WorkerList )malloc(sizeof( WorkerList)); L->next = NULL; cout<<"职工数据清除完毕\n\n\n"; } static void read_file( WorkerList &L) { FILE fp; Worker emp; WorkerList p; WorkerList r; int n = 0; L = ( WorkerList )malloc(sizeof( WorkerList)); r = L; if((fp = fopen("emp.dat", "rb")) == NULL) { if((fp = fopen("emp.dat", "wb")) == NULL) { cout<<"不能创建emp.dat文件\n\n\n"; } } else { while(fread(&emp, sizeof( Worker), 1, fp) == 1) { p = ( WorkerList )malloc(sizeof( WorkerList)); p->data = emp; r->next = p; r = p; n++; } } r->next = NULL; cout<<"职工单链表L建立完毕,有"<<n<<"个记录\n"; fclose(fp); } static void display_employee( WorkerList L) { WorkerList *p = L->next; if(p == NULL) { cout<<"没有任何职工记录\n"; } else { cout<<" 职工号姓名部门号薪水\n"; printf(" ----------------------------------------------\n"); while(p != NULL) { printf(" %3d %10s %-8d %7.2f\n", p->data.no, p->data.name, p->data.depno, p->data.salary); p = p->next; } cout<<" ------------------------把这段代码用自然语言描述

这段代码是一个职工管理系统，使用了链表来存储职工的信息。其中定义了一个职工结构体，包括职工号、姓名、部门号和薪水。另外还定义了一个链表结构体，包括职工信息和指向下一个节点的指针。代码中实现了一些功能，...

struct workers { char jobNo[15]; //员工号 char name[15]; //姓名 char sex[15]; //性别 char birthday[15]; //出生年月 char degree[15]; //学历 char position[15]; //职务 char salary[15]; //工资 char addr[15]; //住址 char tel[15]; //电话 }; //类型定义语句 typedef struct node { struct workers data; struct node next; }Node; //添加信息函数 "尾插法建表" void Add(Node worker) { Node p, q; char n[10]; q = worker; while (q->next != NULL) { q = q->next; } while (1) { printf("提示:输入0返回主菜单!\n"); printf("请输入员工号："); scanf("%s", n); if (strcmp(n, "0") == 0) { break; } p = (Node *)malloc(sizeof(Node)); strcpy(p->data.jobNo, n); printf("请输入姓名："); scanf("%s", p->data.name); printf("请输入性别："); scanf("%s", p->data.sex); printf("请输入出生年月："); scanf("%s", p->data.birthday); printf("请输入学历："); scanf("%s", p->data.degree); printf("请输入职务："); scanf("%s", p->data.position); printf("请输入工资："); scanf("%s", p->data.salary); printf("请输入住址："); scanf("%s", p->data.addr); printf("请输入电话："); scanf("%s", p->data.tel); printf("提示：已经完成一条记录的添加！"); p->next = NULL; q->next = p; q = p; } }对每一句进行解释

这段代码是定义了一个结构体 workers，其中包含了员工的基本信息，如员工号、姓名、性别、出生年月、学历、职务、工资、住址、电话。接着定义了一个链表结构体 node，包含了 workers 结构体以及指向下一个节点...

Node p, q; char n[10]; q = worker; while (q->next != NULL) { q = q->next; }

1. 定义了两个指向Node类型的指针p和q以及一个字符数组n。 2. 将指针q指向了链表的头节点worker。 3. 进入while循环，判断q指向的节点是否为最后一个节点，即该节点的next指针是否为NULL。 4. 如果不是最后一个节点...

Node p, q; char n[10]; q = worker; while (q->next != NULL) { q = q->next; }指针P的作用是什么

在这段代码中，指针p并没有被使用，因此它的存在是多余的，可以删除。代码可以简化为： Node *q; q = worker; while (q->next != NULL) { q = q->next; } 这样就可以找到链表中最后一个节点了。

void S1mmeSession::CuOutputNode(S1APNode* p_node, uint8_t worker_id,bool timeout) { bool output_ue_release = true, out_put_pdn_connect = true; time_t last_kqi_sec = 0; for (std::vector<CuKqiInfo_T>::iterator it = p_node->cu_kqi_.begin(); it != p_node->cu_kqi_.end();) { CuOutputKqi(p_node, it->msg_type, it->ebi, last_kqi_sec, output_ue_release,worker_id); it = p_node->cu_kqi_.erase(it); } S1MMEKQI* kqi_main = p_node->FindKqi(kS1mmeProcTypeERABModification); if(kqi_main){ CuEncodeErabModification(kqi_main, p_node->GetCommonInfo(), p_node->GetUserInfo(), current_time_.tv_sec,worker_id); } kqi_main = p_node->FindKqi(kS1mmeProcTypeSecondaryRatDataUsage); if(kqi_main){ CuEncodeSecondaryRatDataUsageReport(kqi_main, p_node->GetCommonInfo(), p_node->GetUserInfo(), current_time_.tv_sec,worker_id); } kqi_main = p_node->FindKqi(kS1mmeProcTypeAttach); if (kqi_main && ((timeout && nas_default_encrypt_alg_) || (!timeout))) { S1MMEKQI* kqi_ue_release = p_node->FindKqi(kS1mmeProcTypeUEContextRelease); S1MMEKQI* kqi_pdn_connect = p_node->FindKqi(kS1mmeProcTypePdnConnect, 5); if (1) { for (uint8_t i=0; i<1; i++) { //KQIBearer* p_bearer = kqi_initial_context->GetBearer(i); //if (p_bearer == NULL) break; //p_node->GetUserInfo()->FillKQIBearer(p_bearer->ebi, p_bearer); } } CuEncodeAttach(kqi_main, p_node->GetCommonInfo(), p_node->GetUserInfo(), current_time_.tv_sec,worker_id,kqi_ue_release,kqi_pdn_connect); //output attach if (output_ue_release && kqi_ue_release && kqi_ue_release->complete_time_.tv_sec - kqi_main->complete_time_.tv_sec > 15) { //output UEContextRelease; CuEncodeUEContextRelease(kqi_ue_release,p_node->GetCommonInfo(),p_node->GetUserInfo(),current_time_.tv_sec,worker_id); output_ue_release = false; } out_put_pdn_connect = false; }什么意思

首先，它会遍历p_node->cu_kqi_中的每个CuKqiInfo_T对象，并调用CuOutputKqi()函数将KQI信息编码并输出到CU中。接着，它会查找S1MMEKQI对象，并调用CuEncodeErabModification()、...

void S1mmeSession::CtOutputKqi(S1MMEKQI* kqi, S1APNode* p_node, uint8_t worker_id) { SPUserInfo& sp_user_info = p_node->GetUserInfo(); //先填充kqi中承载信息 for (uint8_t i=0; i<kqi->GetBearerNum(); i++) { KQIBearer* p_bearer = kqi->GetBearer(i); if (p_bearer == NULL) break; sp_user_info->FillKQIBearer(p_bearer->ebi, p_bearer); } //再执行该信令功能 switch (kqi->kqi_type_) { case kS1mmeProcTypeEPSBearerContextDeactivation: //删除释放的承载 sp_user_info->EraseEBI(kqi->GetBearer1()->ebi); break; case kS1mmeProcTypeERABRelease: case kS1mmeProcTypeERABReleaseIndication: //删除需要释放的承载 for (uint8_t i=0; i<kqi->GetBearerNum(); i++) { KQIBearer* p_bearer = kqi->GetBearer(i); if (p_bearer == NULL) break; sp_user_info->EraseEBI(p_bearer->ebi); } break; case kS1mmeProcTypePathSwitch: case kS1mmeProcTypeS1SwitchOut: case kS1mmeProcTypeS1SwitchIn: kqi->bearer_num_ = 0;//暂不输出切换相关的承载信息 //删除没有切换过来的承载 break; } if (!(kqi->kqi_type_ >= kS1mmeProcTypeAttach && kqi->kqi_type_ <= kS1mmeProcTypeMax)) { return; } // CtEncodeKqi(kqi, p_node, worker_id); update_test(p_node); return; }什么意思

该函数的作用是根据传入的 S1MMEKQI 类型的参数 kqi，向 sp_user_info 对象中填充一些信息，然后根据 kqi 的类型执行不同的功能。具体来说，如果 kqi 的类型是 kS1mmeProcTypeEPSBearerContextDeactivation，则删除...

void S1mmeSession::CheckTimeout(uint64_t second, uint8_t worker_id) { //主map 超时, 同时伴随辅助map 超时 bool dead_loop_major,dead_loop_hoc,dead_loop_stmsi; { S1APNode* p_cur = (S1APNode)(p_major_map_->GetHead()); S1APKey_T p_cur_key = p_major_map_->GetCursorKey(); S1APNode* p_next = (S1APNode)(p_major_map_->Next()); S1APKey_T p_next_key = p_major_map_->GetCursorKey(); while (p_next != NULL) { if (current_time_.tv_sec - p_cur->GetLastTime().tv_sec > timeout_major_) { if (handle_session_version_ == S1MME_SESSION_VERSION_CHINA_TELECOM) { CtOutputNode(p_cur,true); } else { CuOutputNode(p_cur,s1mme_worker_id_,true); } p_path_switch_map_->DeleteData(p_cur->GetMMEKey(), p_s1ap_node_allocator_); p_handover_container_map_->DeleteData(p_cur->GetContainerKey(), p_s1ap_node_allocator_); SPUserInfo& sp_user_info = p_cur->GetUserInfo(); //Todo@ydzy:超时stmsi _map p_major_map_->DeleteData(p_cur_key, p_s1ap_node_allocator_); p_cur = p_next; p_next = (S1APNode)(p_major_map_->Next()); p_cur_key = p_next_key; p_next_key = p_major_map_->GetCursorKey(); } else { break; } } dead_loop_major = p_major_map_->CheckDeadLoop(); }什么意思

这是一个函数定义，函数名为CheckTimeout，参数列表包括一个uint64_t类型的second和一个uint8_t类型的worker_id。函数的主要作用是检查主map和辅助map是否超时，如果超时则进行相应的操作。其中，p_major_map_是主...

void S1mmeSession::CtEncodeKqi(S1MMEKQI* kqi, S1APNode* p_node, uint8_t worker_id) { MsgCommonInfo& common = p_node->GetCommonInfo(); SPUserInfo& sp_user_info = p_node->GetUserInfo(); //获取 buf TlvEncoder* p_encoder_cur = g_p_encoder_[worker_id]; YdCDR_T* p_dst_data = (YdCDR_T)malloc(sizeof(YdCDR_T)); if (p_dst_data == NULL) { return; } p_dst_data->not_associate = 0; if ((common.not_associate & 0x03) == 0x03) p_dst_data->not_associate = 1; p_encoder_cur->Set(p_dst_data->cdr_data,kMaxOneCdrBufLen); uint64_t imsi = sp_user_info->GetIMSI(); if(common.eci == 0) { common.eci = sp_user_info->GetEci(); } uint16_t tmp_enbid = common.tac;//>>8; //uint32_t tmp_enbid = (common.eci >> 8)&0xfffff; char xdrid_str[32]={0}; #ifdef OPEN_NEW_HUISU convert_xdrid_to_string(xdrid_str, kqi->xdrid, s_xdr_id_len); #else #ifdef OPENCTPR g4sigtran::pr::ProcBlock p_blk = kqi->binary_block_in_xdr_.GetBlock(); p_blk->SerializeXid(xdrid_str, sizeof(xdrid_str)); #else uint64_t subcdrid = g_ct_xdr_id.GetXid(); //reverse subend; if(::is_open_reverse) { SetReverseSubend(p_node, subcdrid); } #ifdef ONE_THIRD_YUNNAN_MRO g_ct_xdr_id.Serialize((uint8_t)xdrid_str, s_xdr_id_len, imsi); #else g_ct_xdr_id.Serialize((uint8_t)xdrid_str, s_xdr_id_len); #endif #endif #endif struct timespec start_time = kqi->request_time_, end_time = kqi->response_time_; if (kqi->request_time_.tv_sec == 0) { if (!(kqi->response_time_.tv_sec == 0)) { start_time = kqi->response_time_; } else if (!(kqi->complete_time_.tv_sec == 0)) { start_time = kqi->complete_time_; } } if (!(kqi->complete_time_.tv_sec == 0)) { end_time = kqi->complete_time_; } if (end_time.tv_sec == 0) { end_time = start_time; } p_encoder_cur->SetHdr(kEncoderCdr, kqi->kqi_type_, current_time_.tv_sec, worker_id); //child_kqi //p_encoder_cur->Add("0", kExportTagChildKqi);什么意思

这是一个函数的实现，函数名为S1mmeSession::CtEncodeKqi。该函数的作用是将S1MMEKQI结构体编码为TLV格式，并存储到缓冲区中。在函数中，先获取S1APNode的common和userInfo信息，然后获取TLV编码器和YdCDR_T类型的...

p = worker->next是什么意思

"p = worker->next" 是一条赋值语句，它的含义是将变量 worker 所指向的链表的下一个节点的地址赋值给变量 p。在程序中，我们经常需要使用指针来访问和操作数据结构，例如这里的 worker 是一个指向 Node 类型的...

解释并补充这段代码#include<iostream> using namespace std; #include<string.h> const int N=10000; #define NAMECHARS 10 class Worker{ public: Worker(); Worker(char* _name,int _level); // virtual ~Worker(); protected: // const float baseSalary; char name[NAMECHARS+1]; int level; unsigned int ID; // float salary; static unsigned int count; float reward; public: // static float total; void setName(char* _name); virtual void infoList()=0; void setLevel(int _level); void sum(); static float Average(); friend void setReward(Worker* pWorker,float reward); // friend void setReward(Worker& wk,float reward); void setReward(float _reward); virtual float getSalary()=0; };// 在此处补充你的代码int main() { Worker* pWorkerArr[N] = {NULL}; int n; cin >> n; for(int i=0; i<n; i++) { char name[NAMECHARS+1]; int level; int choice; cin >> name >> level >> choice; switch (choice ) { case 1: { float hour; cin >> hour; if (choice%2) pWorkerArr[i] = (Worker) new HourWorker(name,level,hour); else { HourWorker p = new HourWorker(name, level); p->setHour(hour); pWorkerArr[i] = (Worker)p; } } break; case 2: { int piece; cin >> piece; if (choice % 2) pWorkerArr[i] = (Worker) new PieceWorker(name,level,piece); else { PieceWorker p = new PieceWorker(); p->setName(name); p->setLevel(level); p->setPiece(piece); pWorkerArr[i] = (Worker)p; } } break; } } int index; float reward; cin >> index>>reward; if (index >= 0 && index < n) setReward(pWorkerArr[index], reward); float totalSalary = 0.0f; for( int i=0;i<n;i++) { if (pWorkerArr[i] != NULL) { totalSalary += pWorkerArr[i]->getSalary(); pWorkerArr[i]->infoList(); } } cout << totalSalary << endl; for (int i = 0; i<N; i++) { if (pWorkerArr[i] != NULL) delete pWorkerArr[i]; } return 0; }

这段代码是一个简单的Python程序实现了一个函数，这个函数用于判断一个字符串是否为回文字符串。所谓回文字符串就是从左往右读和从右往左读都是一样的字符串。具体实现是，将字符串按照字符的顺序反转，然后与原...

写一下在工人类Worker基础上，派生出两个类：PieceWorker计件工人和HourWorker计时工人。在PieceWorker中添加数据成员piece件数（整数），假设完成每件的报酬20元，并根据piece计算薪水。在HourWorker中添加数据成员hour计时数（浮点数），假设每个工作时的报酬50元，并根据hour计算薪水。 Worker类中已有纯虚函数GetSalary()返回工人薪水，在派生类继承实现计件和计时工人的薪水获取函数。工人自动编号，从1开始。给工人发奖金，金额为float。根据#include<iostream> using namespace std; #include<string.h> const int N=10000; #define NAMECHARS 10 class Worker{ public: Worker(); Worker(char* _name,int _level); // virtual ~Worker(); protected: // const float baseSalary; char name[NAMECHARS+1]; int level; unsigned int ID; // float salary; static unsigned int count; float reward; public: // static float total; void setName(char* _name); virtual void infoList()=0; void setLevel(int _level); void sum(); static float Average(); friend void setReward(Worker* pWorker,float reward); // friend void setReward(Worker& wk,float reward); void setReward(float _reward); virtual float getSalary()=0; };// 在此处补充你的代码int main() { Worker* pWorkerArr[N] = {NULL}; int n; cin >> n; for(int i=0; i<n; i++) { char name[NAMECHARS+1]; int level; int choice; cin >> name >> level >> choice; switch (choice ) { case 1: { float hour; cin >> hour; if (choice%2) pWorkerArr[i] = (Worker) new HourWorker(name,level,hour); else { HourWorker p = new HourWorker(name, level); p->setHour(hour); pWorkerArr[i] = (Worker)p; } } break; case 2: { int piece; cin >> piece; if (choice % 2) pWorkerArr[i] = (Worker) new PieceWorker(name,level,piece); else { PieceWorker p = new PieceWorker(); p->setName(name); p->setLevel(level); p->setPiece(piece); pWorkerArr[i] = (Worker)p; } } break; } } int index; float reward; cin >> index>>reward; if (index >= 0 && index < n) setReward(pWorkerArr[index], reward); float totalSalary = 0.0f; for( int i=0;i<n;i++) { if (pWorkerArr[i] != NULL) { totalSalary += pWorkerArr[i]->getSalary(); pWorkerArr[i]->infoList(); } } cout << totalSalary << endl; for (int i = 0; i<N; i++) { if (pWorkerArr[i] != NULL) delete pWorkerArr[i]; } return 0; }补充

派生出的PieceWorker和HourWorker类的特点，可以分别实现GetSalary()函数，用于计算他们的薪水。 PieceWorker类的GetSalary()函数实现如下： float GetSalary() { return piece * 20.0; } HourWorker类的...

int Disp(Node *worker)

这段代码定义了一个名为 Disp 的函数，该函数的参数为一个指向 Node 类型的指针 worker，表示链表的头节点。函数的返回值为 int 类型。该函数的作用是遍历链表中的所有节点，并将每个节点的数据打印输出。...

worker* Linklist::find_name(string name) //按姓名查找 { worker* p = head; while (p->next != NULL) { if (p->next->m_name == name) { p->next->print(); return p->next; } else { p = p->next; } } cout << "该员工不存在！" << endl; }解释这段代码的原理

相关推荐

worker* Linklist::find_name(string name) //按姓名查找 { worker* p = head; while (p->next != NULL) { if (p->next->m_name == name) { p->next->print(); return p->next; } else { p = p->next; } } cout << "该员工不存在！" << endl; }解释这段代码的原理

相关推荐

java 修改员工信息

实现对员工信息的增删改查实例（全注解）

员工信息查询修改管理信息系统

int Disp(Node *worker) { Node *p; p = worker->next; if (p == NULL) { printf(" \n提示:没有信息可以显示!\n "); return 0; }

int Linklist::find_ID(int ID) //按编号查找 { worker* p = head; if (ID > worker::m_id || ID < 1000) { cout << "该编号不存在" << endl; return -1; } while (p->next != NULL) { if (p->next->m_ID == ID) { p->next->print(); return 0; } else { p = p->next; } } }解释

Node *p, *q; char n[10]; q = worker; while (q->next != NULL) { q = q->next; }

Node *p, *q; char n[10]; q = worker; while (q->next != NULL) { q = q->next; }指针P的作用是什么

p = worker->next是什么意思

int Disp(Node *worker)

大家在看

Indesign插件合集(支持ID CS6~CC 2021)

爬取招行外汇网站数据.pdf

ORCAD库管理.rar

mapinfo详细教程

.NET frxamework v2.0 64位

最新推荐

基于西门子S7-300 PLC的全自动生产线包装机设计与实现

Visual C++.NET编程技术实战指南

HarmonyOS内核深度探秘：优化自由行旅游系统的策略

tkinter模块所有控件

局域网五子棋游戏：娱乐与聊天的完美结合

自由行旅游新篇章：HarmonyOS技术融合与系统架构深度解析

足底支撑相到达73%是什么问题

宾馆预约系统开发与优化建议

HarmonyOS在旅游领域的创新：揭秘最前沿应用实践

数据架构师需要具备什么能力

int Disp(Node worker) { Node p; p = worker->next; if (p == NULL) { printf(" \n提示:没有信息可以显示!\n "); return 0; }

Node p, q; char n[10]; q = worker; while (q->next != NULL) { q = q->next; }

Node p, q; char n[10]; q = worker; while (q->next != NULL) { q = q->next; }指针P的作用是什么