if-else多级嵌套,输入3/4/5个数寻找最大值(太多了容易乱!!!)

本文通过多级if-else嵌套的方式,展示了如何在3、4、5个数中寻找最大值的过程,虽然代码复杂,但清晰地体现了逻辑判断的思路。

哎呀呀,心累啊,玩这个多级嵌套,眼花~

多级嵌套有序3个数(找最大值) 

a,b,c=eval(input("a,b,c"))
if a>b:
    pass  #a (a,b)
    if a>c:
        print("max",a)
        if b>c:
            print(b,c)
        else:
            print(c,b)
    else:
        print("max",c)
        if b>a:
            print(b,a)
        else:
            print(a,b)
else:
    pass  #a (a,b)
    if b>c:
        print("max",b)
        if c>a:
            print(c,a)
        else:
            print(a,c)
    else:
        print("max",c)
        if b>a:
            print(b,a)
        else:
            print(a,b)

 多级嵌套有序4个数(找最大值) 

a,b,c,d=eval(input("a,b,c,d"))
if a>b:
    if a>c:
        if a>d:
            print("max",a)#a>b,c,d max=a
        else:
            print("max",d)#d>a,b,c max=d
    else: #c>a
        if c>d:
            print("max", c) # c>a,b,d max=c
        else:
            print("max", d)# d>a,b,c max=d
else:#b>a
    if b>c:
        if b>d:
            print("max", b)#b>a,c,d max=b
        else:
            print("max", d)#d>a,c,b max=d
    else:# c>b
        if c>d:
            print("max", c)#c>a,b,d max=c
        else:
            print("max", d)#d>a,b,c max=d

多级嵌套有序5个数(找最大值) 

a,b,c,d,e=eval(input("a,b,c,d,e"))
if a>b:
    if a>c:
        if a>d:
            if a>e:
                print("max",a)
            else:
                print("max",e)
        else:#d>a
            if d>e:
                pass
                print("max",d)
            else:#d<e
                print("max",e)
    else: #c>a
        if c>d:
            if c>e:
                print("max",c)
            else:
                print("max",e)
        else:#c<d
            if d>e:
                print("max", d)
            else:
                print("max", e)
else:#b>a
    if b>c:
        if b>d:
            if b>e:
                print("max", b)
            else:
                print("max", e)
        else:#b<d
            if d>e:
                print("max", d)
            else:
                print("max", e)
    else:#c>b
        if c>d:
            if c>e:
                print("max", c)
            else:
                print("max", e)
        else:#d>c
            if d>e:
                print("max", d)
            else:
                print("max", e)

当然,if-else看的眼花,哈哈哈 ,其实有max()函数可以直接找最大值,笑-----哭--------------------O(∩_∩)O---------- 

a,b,c,d,e=eval(input("a,b,c,d,e"))
max=max(a,b,c,d,e)
print("最大值是%s"%max)

 

module sliding_window_filter #( parameter M = 100, // 窗口深度 parameter L = 10, // 排除极值数量 parameter N = 16, // 数据位宽 parameter DIVIDER = 80 // 除数 M - 2*L )( input wire clk, input wire rst_n, input wire wr_en, input wire [N-1:0] wr_data, output reg [N-1:0] filtered_avg ); // =============================== // 状态定义 // =============================== localparam [2:0] IDLE = 3&#39;b000, INDATA = 3&#39;b001, PROCESS = 3&#39;b010, AVERAGE = 3&#39;b011; reg [2:0] current_state, next_state; // =============================== // FIFO相关信号 // =============================== reg [N-1:0] fifo_data [0:M-1]; // 数据存储器 reg [N+6:0] all_sum; // 窗口数据和 reg [6:0] ptr; // 当前写指针 (0-99) reg [6:0] ptr_next; // 下一个写指针 reg full; // 满信号 - 改为reg类型 reg data_valid; // 数据有效脉冲 // =============================== // maxl模块信号 // =============================== reg [6:0] maxl_index [0:L-1]; // 最大值索引存储 reg [N+3:0] max_sum; // 最大值之和 reg [3:0] valid_count_max; // 有效索引计数 (0-10) reg ptr_maxl_done; // maxl处理完成标志 reg ptr_in_maxl; // ptr是否在maxl中 // maxl搜索相关信号 reg [3:0] search_max_cnt; // 搜索计数器 reg [6:0] found_max_index; // 找到的最大值索引 reg [N-1:0] found_max_value; // 找到的最大值 reg maxl_search_done; // maxl搜索完成 // =============================== // minl模块信号 // =============================== reg [6:0] minl_index [0:L-1]; // 最小值索引存储 reg [N+3:0] min_sum; // 最小值之和 reg [3:0] valid_count_min; // 有效索引计数 reg ptr_minl_done; // minl处理完成标志 reg ptr_in_minl; // ptr是否在minl中 // minl搜索相关信号 reg [3:0] search_min_cnt; reg [6:0] found_min_index; reg [N-1:0] found_min_value; reg minl_search_done; // =============================== // 平均值计算信号 // =============================== reg [N-1:0] filtered_sum; // 过滤后的和 // =============================== // 主状态机 // =============================== always @(posedge clk or negedge rst_n) begin if (!rst_n) begin current_state <= IDLE; end else begin current_state <= next_state; end end always @(*) begin case (current_state) IDLE: begin next_state = wr_en ? INDATA : IDLE; end INDATA: begin next_state = PROCESS; end PROCESS: begin if (ptr_maxl_done && ptr_minl_done) begin next_state = full ? AVERAGE : IDLE; end else begin next_state = PROCESS; end end AVERAGE: begin next_state = IDLE; end default: next_state = IDLE; endcase end // =============================== // FIFO逻辑 // =============================== integer i; always @(posedge clk or negedge rst_n) begin if (!rst_n) begin // 复位所有寄存器 ptr <= 7&#39;d0; ptr_next <= 7&#39;d0; all_sum <= {N{1&#39;b0}}; data_valid <= 1&#39;b0; full <= 1&#39;b0; // 初始化FIFO数据 for (i = 0; i < M; i = i + 1) begin fifo_data[i] <= {N{1&#39;b0}}; end end else begin data_valid <= 1&#39;b0; // 默认值 if (ptr_next == 7&#39;d99) full<=1&#39;b1; case (current_state) INDATA: begin // 写入数据 fifo_data[ptr_next] <= wr_data; // 迭代求和 all_sum <= all_sum + wr_data - fifo_data[ptr_next]; // 更新指针 ptr <= ptr_next; if (ptr_next == 7&#39;d99) begin ptr_next <= 7&#39;d0; end else begin ptr_next <= ptr_next + 1; end // 更新full信号 - 当ptr==99时置1 // 产生数据有效脉冲 data_valid <= 1&#39;b1; end default: ; // 其他状态保持 endcase end end // =============================== // maxl处理逻辑 - 状态机优化版本 // =============================== integer j, k; reg [6:0] scan_addr; // 主扫描地址 (0 ~ M-1) reg [2:0] idx_scan; // 遍历 maxl 的索引 reg finding_max_in_pool; // 正在搜索外部最大值(用于 ptr 在 maxl 中的情况) reg finding_min_in_maxl; // 正在寻找 maxl 中最小值 reg comparing_ptr_with_min; // 比较 ptr 和 min 后决定替换 reg update_done; reg in_maxl; always @(posedge clk or negedge rst_n) begin if (!rst_n) begin ptr_maxl_done <= 1&#39;b0; max_sum <= {N{1&#39;b0}}; valid_count_max <= 4&#39;d0; found_max_value <= {N{1&#39;b0}}; found_max_index <= 7&#39;d0; ptr_in_maxl <= 1&#39;b0; for (j = 0; j < L; j = j + 1) maxl_index[j] <= 7&#39;d0; // 控制标志复位 scan_addr <= 7&#39;d0; idx_scan <= 3&#39;d0; finding_max_in_pool <= 1&#39;b0; finding_min_in_maxl <= 1&#39;b0; comparing_ptr_with_min <= 1&#39;b0; update_done <= 1&#39;b0; end else begin ptr_maxl_done <= 1&#39;b0; // 默认未完成 case (current_state) PROCESS: begin if (!update_done) begin // ------------------------------- // Step 1: 检查 ptr 是否在 maxl 中 // ------------------------------- if (idx_scan < valid_count_max && !finding_min_in_maxl && !finding_max_in_pool && !comparing_ptr_with_min) begin if (maxl_index[idx_scan] == ptr) begin ptr_in_maxl <= 1&#39;b1; end idx_scan <= idx_scan + 1; end else if (idx_scan == valid_count_max && !ptr_in_maxl && !update_done) begin // ptr 不在 maxl 中 idx_scan <= 3&#39;d0; if (valid_count_max < L) begin // 插入新项 maxl_index[valid_count_max] <= ptr; max_sum <= max_sum + fifo_data[ptr]; valid_count_max <= valid_count_max + 1; update_done <= 1&#39;b1; ptr_maxl_done <= 1&#39;b1; end else begin // 开始查找 maxl 中最小值 finding_min_in_maxl <= 1&#39;b1; found_max_value <= fifo_data[maxl_index[0]]; found_max_index <= 3&#39;d0; idx_scan <= 3&#39;d1; end end else if (finding_min_in_maxl && idx_scan < L) begin if (fifo_data[maxl_index[idx_scan]] < found_max_value) begin found_max_value <= fifo_data[maxl_index[idx_scan]]; found_max_index <= idx_scan; end idx_scan <= idx_scan + 1; end else if (finding_min_in_maxl && idx_scan >= L) begin finding_min_in_maxl <= 1&#39;b0; comparing_ptr_with_min <= 1&#39;b1; idx_scan <= 3&#39;d0; if (fifo_data[ptr] > found_max_value) begin // 替换最小值 max_sum <= max_sum - found_max_value + fifo_data[ptr]; maxl_index[found_max_index] <= ptr; update_done <= 1&#39;b1; ptr_maxl_done <= 1&#39;b1; end else begin // 不替换 update_done <= 1&#39;b1; ptr_maxl_done <= 1&#39;b1; end end else if (ptr_in_maxl && !update_done) begin // ptr 在 maxl 中 → 需要从外部找最大值替换 finding_max_in_pool <= 1&#39;b1; found_max_value <= {N{1&#39;b0}}; // -inf 等效 found_max_index <= 7&#39;d0; scan_addr <= 7&#39;d0; // 开始扫描所有地址 while (scan_addr < M) begin in_maxl = 1&#39;b0; for (k = 0; k < valid_count_max; k = k + 1) begin if (maxl_index[k] == scan_addr) in_maxl = 1&#39;b1; end if (!in_maxl && scan_addr != ptr) begin if (fifo_data[scan_addr] > found_max_value) begin found_max_value <= fifo_data[scan_addr]; found_max_index <= scan_addr; end end scan_addr <= scan_addr + 1; end // 扫描结束,执行替换 max_sum <= max_sum - fifo_data[ptr] + found_max_value; // 查找 ptr 所在位置进行替换 for (k = 0; k < valid_count_max; k = k + 1) begin if (maxl_index[k] == ptr) maxl_index[k] <= found_max_index; end update_done <= 1&#39;b1; ptr_maxl_done <= 1&#39;b1; end end end // PROCESS default: begin // 复位控制信号 ptr_maxl_done <= 1&#39;b0; update_done <= 1&#39;b0; finding_max_in_pool <= 1&#39;b0; finding_min_in_maxl <= 1&#39;b0; comparing_ptr_with_min <= 1&#39;b0; end endcase end end // =============================== // minl处理逻辑 - 状态机优化版本 // =============================== // =============================== // minl处理逻辑 - 简化版本(无深层状态机) // =============================== integer m, n; reg [6:0] scan_addr_min; // 主扫描地址 (0 ~ M-1) reg [2:0] idx_scan_min; // 遍历 minl 的索引 reg finding_min_in_pool; // 正在从外部找最小值(用于 ptr 在 minl 中的情况) reg finding_max_in_minl; // 正在寻找 minl 中的最大值 reg comparing_ptr_with_max; // 比较 ptr 和 max 后决定是否替换 reg update_done_min; reg in_minl; always @(posedge clk or negedge rst_n) begin if (!rst_n) begin // 复位所有寄存器 ptr_minl_done <= 1&#39;b0; min_sum <= {N{1&#39;b0}}; valid_count_min <= 4&#39;d0; found_min_value <= {N{1&#39;b1}}; // 初始化为全1(即最大值) found_min_index <= 7&#39;d0; ptr_in_minl <= 1&#39;b0; for (m = 0; m < L; m = m + 1) minl_index[m] <= 7&#39;d0; // 控制标志复位 scan_addr_min <= 7&#39;d0; idx_scan_min <= 3&#39;d0; finding_min_in_pool <= 1&#39;b0; finding_max_in_minl <= 1&#39;b0; comparing_ptr_with_max <= 1&#39;b0; update_done_min <= 1&#39;b0; end else begin ptr_minl_done <= 1&#39;b0; // 默认未完成 case (current_state) PROCESS: begin if (!update_done_min) begin // ------------------------------- // Step 1: 检查 ptr 是否在 minl 中 // ------------------------------- if (idx_scan_min < valid_count_min && !finding_max_in_minl && !finding_min_in_pool && !comparing_ptr_with_max) begin if (minl_index[idx_scan_min] == ptr) begin ptr_in_minl <= 1&#39;b1; end idx_scan_min <= idx_scan_min + 1; end else if (idx_scan_min == valid_count_min && !ptr_in_minl && !update_done_min) begin // ptr 不在 minl 中 idx_scan_min <= 3&#39;d0; if (valid_count_min < L) begin // 直接插入 minl_index[valid_count_min] <= ptr; min_sum <= min_sum + fifo_data[ptr]; valid_count_min <= valid_count_min + 1; update_done_min <= 1&#39;b1; ptr_minl_done <= 1&#39;b1; end else begin // 已满,开始查找 minl 中最大值 finding_max_in_minl <= 1&#39;b1; found_min_value <= fifo_data[minl_index[0]]; // 初始化为第一个值 found_min_index <= 3&#39;d0; idx_scan_min <= 3&#39;d1; end end else if (finding_max_in_minl && idx_scan_min < L) begin // 查找 minl 中最大的元素(准备淘汰它) if (fifo_data[minl_index[idx_scan_min]] > found_min_value) begin found_min_value <= fifo_data[minl_index[idx_scan_min]]; found_min_index <= idx_scan_min; end idx_scan_min <= idx_scan_min + 1; end else if (finding_max_in_minl && idx_scan_min >= L) begin finding_max_in_minl <= 1&#39;b0; comparing_ptr_with_max <= 1&#39;b1; if (fifo_data[ptr] < found_min_value) begin // 替换掉最大值 min_sum <= min_sum - found_min_value + fifo_data[ptr]; minl_index[found_min_index] <= ptr; update_done_min <= 1&#39;b1; ptr_minl_done <= 1&#39;b1; end else begin // 不需要替换 update_done_min <= 1&#39;b1; ptr_minl_done <= 1&#39;b1; end end else if (ptr_in_minl && !update_done_min) begin // ptr 在 minl 中 → 需要从外部找最小值替换 finding_min_in_pool <= 1&#39;b1; found_min_value <= {N{1&#39;b1}}; // 初始化为最大值(相当于 +∞) found_min_index <= 7&#39;d0; scan_addr_min <= 7&#39;d0; // 注意:下面 while 是不可综合的,仅示意;实际应拆成每拍递增 // 我们改为逐拍扫描方式(见下方改进) end end // !update_done_min // ---------------------------------------- // 追加:逐拍扫描外部空间找最小值(可综合) // ---------------------------------------- if (finding_min_in_pool) begin if (scan_addr_min < M) begin // 检查该地址是否不在 minl 中且不是 ptr in_minl = 1&#39;b0; for (n = 0; n < valid_count_min; n = n + 1) begin if (minl_index[n] == scan_addr_min) in_minl = 1&#39;b1; end if (!in_minl && scan_addr_min != ptr) begin if (fifo_data[scan_addr_min] < found_min_value) begin found_min_value <= fifo_data[scan_addr_min]; found_min_index <= scan_addr_min; end end scan_addr_min <= scan_addr_min + 1; end else begin // 扫描结束 finding_min_in_pool <= 1&#39;b0; // 查找 ptr 所在位置并替换 for (n = 0; n < valid_count_min; n = n + 1) begin if (minl_index[n] == ptr) begin min_sum <= min_sum - fifo_data[ptr] + found_min_value; minl_index[n] <= found_min_index; end end update_done_min <= 1&#39;b1; ptr_minl_done <= 1&#39;b1; end end end // PROCESS default: begin // 复位相关信号 ptr_minl_done <= 1&#39;b0; update_done_min <= 1&#39;b0; finding_min_in_pool <= 1&#39;b0; finding_max_in_minl <= 1&#39;b0; comparing_ptr_with_max <= 1&#39;b0; end endcase end end // =============================== // 平均值计算 // =============================== always @(posedge clk or negedge rst_n) begin if (!rst_n) begin filtered_avg <= {N{1&#39;b0}}; end else if (current_state == AVERAGE) begin filtered_sum <= all_sum - max_sum - min_sum; filtered_avg <= filtered_sum / DIVIDER; end end endmodule 这个代码在仿真的时候,ptr=8后就不动了,但是我的wr_en设置成了1000个系统时钟,时间是非常多的。说明寻找最值的程序存在问题,导致循环太久。寻找下是哪里的问题
最新发布
10-13
//classDiagram // class Bancai { // Integer id // Caizhi caizhi // Mupi mupi1 // Mupi mupi2 // Double houdu // Kucun kucun // } // // class Caizhi { // String name // List~Bancai~ bancai // } // // class Mupi { // String name // Boolean you // List~Bancai~ bancaisForMupi1 // List~Bancai~ bancaisForMupi2 // } // // class Chanpin { // String bianhao // List~Chanpin_zujian~ chanpin_zujian // List~Dingdan_chanpin~ dingdan_chanpin // } // // class Zujian { // String name // List~Chanpin_zujian~ chanping_zujian // } // // class Chanpin_zujian { // Bancai bancai // Double one_howmany // Double zujianshu // } // // class Dingdan { // String number // Date xiadan // Date jiaohuo // List~Dingdan_chanpin~ dingdan_chanpin // } // // class Dingdan_chanpin { // Integer shuliang // } // // class Kucun { // Integer shuliang // Dingdan reservedOrder // } // // class Jinhuo { // Integer shuliang // Date date // } // // class User { // String name // String andy // String pass // int role // } // // Bancai “1” – “1” Caizhi // Bancai “1” – “1” Mupi : mupi1 // Bancai “1” – “1” Mupi : mupi2 // Bancai “1” – “1” Kucun // Caizhi “1” – “" Bancai // Mupi “1” – “” Bancai : mupi1 // Mupi “1” – “” Bancai : mupi2 // Chanpin “1” – “” Chanpin_zujian // Chanpin “1” – “” Dingdan_chanpin // Zujian “1” – "” Chanpin_zujian // Chanpin_zujian “1” – “1” Bancai // Dingdan “1” – “*” Dingdan_chanpin // Dingdan_chanpin “1” – “1” Chanpin // Kucun “0…1” – “1” Dingdan : reservedOrder // Jinhuo “1” – “1” Dingdan_bancai // Jinhuo “1” – “1” User function resolveDataReferences(data) { // 获取 data 对象的所有顶层键 const keys = Object.keys(data); // 遍历每个顶层键(如 users, posts 等) for (const key of keys) { const entities = data[key]; // 遍历该顶层键下的每个实体(如每个 user 或 post) for (const entity of entities) { // 遍历实体的每个属性 for (const attribute in entity) { if (entity?.hasOwnProperty(attribute)) { var trpe=attribute?.replace(/\d/g, ‘’); // 确保属性属于当前实体 if (Array.isArray(entity[attribute])) { if(data[trpe]null){ trpe+=“s” } // 如果属性是一个数组,则将数组中的每个 ID 替换为对应的实际对象 entity[attribute] = entity[attribute].map(item => data[trpe ]?.find(updateItem => updateItem.id === item.id) || item ); } else if (typeof entity[attribute] === “object” && entity[attribute] ! null) { // 如果属性是一个对象,则将其替换为对应的实际对象 entity[attribute] = data[trpe + “s”]?.find(updateItem => updateItem.id === entity[attribute].id); } } } } } console.log(data) return data; } /** 数据管理器类,负责与后端API通信并管理数据 */ class DataManager { constructor(baseUrl) { this.baseUrl = baseUrl; this.data = { bancais: [], dingdans: [], mupis: [], chanpins: [], kucuns: [], dingdan_bancais:[], chanpin_zujians: [], zujians: [], caizhis: [], dingdan_chanpins: [], users: [], jinhuos: [] }; this.isSyncing = false; this.lastSync = null; this.callbacks = { all: [], bancais: [], dingdan: [], mupi: [], chanpin: [], kucun: [], chanpin_zujian: [], dingdan_bancai:[], zujian: [], caizhi: [], dingdan_chanpin: [], user: [], jinhuo: [] }; this.syncQueue = Promise.resolve(); } /** 获取所有数据 @returns {Promise} 是否成功 */ async fetchAll() { console.log(this) try { const response = await fetch(${this.baseUrl}/app/all); if (!response.ok) throw new Error(‘Network response was not ok’); const result = await response.json(); if (result.status !== 200) throw new Error(result.text || ‘API error’); const resolvedData = resolveDataReferences(result.data); // 更新本地数据 Object.keys(this.data).forEach(key => { if (resolvedData[key]) { this.data[key] = resolvedData[key]; } }); this.lastSync = new Date(); // 关键改进:数据更新后触发刷新回调 this.triggerCallbacks(‘refresh’, ‘all’, this.data); return true; } catch (error) { console.error(‘Fetch error:’, error); // 触发错误回调 this.triggerCallbacks(‘fetch_error’, ‘all’, { error }); return false; } } /** 注册回调函数 @param {string} entity - 实体类型(如’bancai’)或’all’表示全局回调 @param {Function} callback - 回调函数,参数为(operation, data) */ registerCallback(entity, callback) { if (!this.callbacks[entity]) { this.callbacks[entity] = []; } this.callbacks[entity].push(callback); } /** 移除回调函数 @param {string} entity - 实体类型单数性质 @param {Function} callback - 要移除的回调函数 */ unregisterCallback(entity, callback) { if (!this.callbacks[entity]) return; const index = this.callbacks[entity].indexOf(callback); if (index !== -1) { this.callbacks[entity].splice(index, 1); } } /** 触发回调 @param {string} operation - 操作类型(‘add’, ‘update’, ‘delete’) @param {string} entity - 实体类型单数性质 @param {Object} data - 相关数据 */ triggerCallbacks(operation, entity, data) { // 触发全局回调 this.callbacks.all.forEach(cb => cb(operation, entity, data)); // 触发特定实体回调 if (this.callbacks[entity]) { this.callbacks[entity].forEach(cb => cb(operation, data)); } } /** 执行CRUD操作并触发回调 */ async crudOperation(operation, entity, data) { try { const response = await fetch( � ℎ � � . � � � � � � � / � � � / this.baseUrl/app/{operation}/${entity}, { method: ‘POST’, headers: {‘Content-Type’: ‘application/json’}, body: JSON.stringify(data) }); if (!response.ok) throw new Error(‘Network response was not ok’); const result = await response.json(); if (result.status !== 200) throw new Error(result.text || ‘API error’); // 自动同步数据 this.syncData(); // 触发操作成功的回调 this.triggerCallbacks(operation, entity, data); return result; } catch (error) { console.error(‘CRUD error:’, error); // 触发操作失败的回调 this.triggerCallbacks(${operation}_error, entity, { data, error: error.message }); throw error; } } /** 执行CRUD操作 @param {string} operation - ‘add’, ‘delete’, ‘update’ @param {string} entity - 实体名称单数性质(小写) @param {Object} data - 要发送的数据 后端要求数据格式为{属性: “值”, 关联对象: {id:0}, 关联对象集: [{id:0}]} @returns {Promise} 响应结果 */ async crudOperation(operation, entity, data) { try { const response = await fetch( � ℎ � � . � � � � � � � / � � � / this.baseUrl/app/{operation}/${entity}, { method: ‘POST’, headers: {‘Content-Type’: ‘application/json’}, body: JSON.stringify(data) }); if (!response.ok) throw new Error(‘Network response was not ok’); const result = await response.json(); if (result.status !== 200) throw new Error(result.text || ‘API error’); // 自动同步数据 this.syncQueue = this.syncQueue.then(async () => { await this.syncData(); // 同步完成后触发操作回调 this.triggerCallbacks(operation, entity, data); }); return result; } catch (error) { console.error(‘CRUD error:’, error); // 触发操作失败的回调 this.triggerCallbacks(${operation}_error, entity, { data, error: error.message }); throw error; } } /** 自动同步数据(防止频繁请求) */ async syncData() { if (this.isSyncing) { this.pendingSync = true; return; } this.isSyncing = true; try { await this.fetchAll(); } catch (error) { console.error(‘Sync failed:’, error); } finally { this.isSyncing = false; // 处理等待中的同步请求 if (this.pendingSync) { this.pendingSync = false; setTimeout(() => this.syncData(), 1000); } } } /** 添加实体 @param {string} entity - 实体名称单数性质 @param {Object} data - 实体数据 */ async addEntity(entity, data) { return this.crudOperation(‘add’, entity, data); } /** 更新实体 @param {string} entity - 实体名称单数性质 @param {Object} data - 实体数据(必须包含id) */ async updateEntity(entity, data) { return this.crudOperation(‘update’, entity, data); } /** 删除实体 @param {string} entity - 实体名称单数性质 @param {number} id - 实体ID */ async deleteEntity(entity, id) { return this.crudOperation(‘delete’, entity, {id}); } /** 新增方法:手动触发数据刷新 */ async refreshData() { return this.syncQueue = this.syncQueue.then(() => this.syncData()); } } export { DataManager }; // 创建单例实例 //const dataManager = new DataManager(‘http://127.0.0.1:8080/KuCun2’); //// 初始化时获取所有数据 //dataManager.fetchAll().then(() => { // console.log(‘Initial data loaded’); //}); // 导出数据对象,外部可以直接访问 data.bancais, data.dingdans 等 //export const data = dataManager.data; //// 导出操作方法 //export const addEntity = dataManager.addEntity.bind(dataManager); //export const updateEntity = dataManager.updateEntity.bind(dataManager); //export const deleteEntity = dataManager.deleteEntity.bind(dataManager); //export const fetchAll = dataManager.fetchAll.bind(dataManager); <html lang="zh-CN"> <head> <meta charset="UTF-8"> <meta name="viewport" content="width=device-width, initial-scale=1.0"> <title>板材库存查询系统</title> <!-- 引入外部CSS --> <link rel="stylesheet" href="../css/dingdan.css"> <!-- 引入jQuery --> <script src="https://code.jquery.com/jquery-3.6.0.min.js"></script> <!-- 引入Bootstrap --> <link href="../js/bootstrap-5.3.0-alpha1-dist/css/bootstrap.min.css" rel="stylesheet"> <script src="../js/bootstrap-5.3.0-alpha1-dist/umd/popper.min.js"></script> <script src="../js/bootstrap-5.3.0-alpha1-dist/js/bootstrap.min.js"></script> <!-- 引入Bootstrap Icons --> <link rel="stylesheet" href="../js/bootstrap-icons-1.8.1/bootstrap-icons.css"> <!-- 引入主JS文件 --> <script src="../js/main.js"></script> </head> <body> <div class="container py-4"> <!-- 标题部分 --> <div class="text-center mb-4"> <h1 class="text-primary"><i class="bi bi-boxes"></i> 板材库存管理系统</h1> <p class="text-muted">查询订单、产品、板材及库存信息</p> </div> <!-- 统计卡片 --> <div class="row mb-4"> <div class="col-md-3"> <div class="card stats-card border-primary"> <div class="card-body"> <h5 class="card-title">订单总数</h5> <p class="card-text fs-3 text-primary" id="orderCount">0</p> </div> </div> </div> <div class="col-md-3"> <div class="card stats-card border-info"> <div class="card-body"> <h5 class="card-title">产品种类</h5> <p class="card-text fs-3 text-info" id="productCount">0</p> </div> </div> </div> <div class="col-md-3"> <div class="card stats-card border-success"> <div class="card-body"> <h5 class="card-title">板材库存</h5> <p class="card-text fs-3 text-success" id="materialCount">0</p> </div> </div> </div> <div class="col-md-3"> <div class="card stats-card border-warning"> <div class="card-body"> <h5 class="card-title">库存总量</h5> <p class="card-text fs-3 text-warning" id="totalStock">0</p> </div> </div> </div> </div> <!-- 搜索区域 --> <div class="card search-section mb-4"> <div class="card-header"> <h5 class="mb-0"><i class="bi bi-search me-2"></i>高级搜索</h5> </div> <div class="card-body"> <div class="row g-3"> <!-- 订单搜索 --> <div class="col-md-4"> <div class="search-control"> <i class="bi bi-clipboard-search search-icon"></i> <input type="text" class="form-control with-icon" id="orderSearch" placeholder="搜索订单号..." aria-label="订单号搜索"> </div> </div> <!-- 产品搜索 --> <div class="col-md-4"> <div class="search-control"> <i class="bi bi-grid search-icon"></i> <input type="text" class="form-control with-icon" id="productSearch" placeholder="搜索产品编号..." aria-label="产品编号搜索"> </div> </div> <!-- 板材搜索 --> <div class="col-md-4"> <div class="search-control"> <i class="bi bi-box search-icon"></i> <input type="text" class="form-control with-icon" id="materialSearch" placeholder="搜索板材ID或材质..." aria-label="板材搜索"> </div> </div> <!-- 木皮搜索 --> <div class="col-md-4"> <div class="search-control"> <i class="bi bi-tree search-icon"></i> <input type="text" class="form-control with-icon" id="woodSearch" placeholder="搜索木皮名称..." aria-label="木皮搜索"> </div> </div> <!-- 厚度搜索 --> <div class="col-md-4"> <div class="search-control"> <i class="bi bi-arrows-vertical search-icon"></i> <input type="number" class="form-control with-icon" id="thicknessSearch" placeholder="厚度(mm)" min="0" step="0.1"> </div> </div> <!-- 库存范围搜索 --> <div class="col-md-4"> <div class="input-group"> <span class="input-group-text"><i class="bi bi-box"></i></span> <input type="number" class="form-control" id="minStock" placeholder="最小库存" min="0"> <input type="number" class="form-control" id="maxStock" placeholder="最大库存" min="0"> <button class="btn btn-primary" type="button" id="stockStatusBtn"> <i class="bi bi-search"></i> </button> </div> </div> </div> </div> </div> <!-- 结果区域 --> <div class="card"> <div class="card-header d-flex justify-content-between align-items-center"> <h5 class="mb-0"><i class="bi bi-table me-2"></i>查询结果</h5> <div class="text-secondary"> <span id="resultCount">0</span> 条记录 <span class="ms-2"><i class="bi bi-info-circle"></i> <small>实时数据更新时间: <span id="lastUpdate">--:--:--</span></small></span> </div> </div> <div class="card-body result-section"> <div class="table-responsive"> <table class="table table-hover" id="resultsTable"> <thead class="table-light sticky-top"> <tr> <th data-sortable>订单号 <span class="sort-indicator"></span></th> <th data-sortable>产品信息 <span class="sort-indicator"></span></th> <th data-sortable>产品数量 <span class="sort-indicator"></span></th> <th data-sortable>组件 <span class="sort-indicator"></span></th> <th data-sortable>板材 <span class="sort-indicator"></span></th> <th data-sortable>单件用量 <span class="sort-indicator"></span></th> <th data-sortable>订单用量 <span class="sort-indicator"></span></th> <th data-sortable>库存数量 <span class="sort-indicator"></span></th> <th>操作</th> </tr> </thead> <tbody id="resultBody"> <!-- 数据加载中 --> <tr id="loadingRow"> <td colspan="9" class="text-center py-5"> <div class="d-flex align-items-center justify-content-center"> <div class="spinner-border text-primary" role="status"> <span class="visually-hidden">加载中...</span> </div> <div class="ms-3">正在加载数据,请稍候...</div> </div> </td> </tr> </tbody> </table> </div> <!-- 空结果提示 --> <div id="noResults" class="no-results text-center py-5" style="display: none;"> <div> <i class="bi bi-inboxes text-muted" style="font-size: 3rem;"></i> <h4 class="mt-3 text-muted">没有找到匹配的记录</h4> <p class="text-muted">请尝试调整您的搜索条件</p> </div> </div> </div> </div> </div> <!-- 引入订单JS --> <script src="../js/test.js"></script> </body> </html>DataManager为数据管理 实现页面功能,DataManager已经在父级页面加载过了,直接到父级调用,js和css分开文件。 业务基本逻辑 一个订单有很多产品不同数量,每个产品可以再很多订单中,一个产品有很多组件,一个组件可以在很多产品中,因为每个组件因为在不同的产品中有不同的生产工艺,所以使用不同的板材和板材能生产组件数量,每个板材有不同的材质和两面木皮,木皮表面可能有油漆, 订购时可能直接购入板材,也可能按订单和产品订购板材,也用可能按订单产品组件订购板材,每次采购不标准,一个订单可能订购几次,用户有姓名 账号 密码 权限, 一个记录进货和消耗,查看的时候会查看订单下有多少板材可用
06-24
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

Dig_beautiful

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值