/*! * NY 问卷考试系统数据平台 - 随机抽取页逻辑 * * 功能:来源切换 / 班级组别筛选 / 分组均衡抽取(5:5) / 排除已抽中 / * 排除名单管理 / 历史记录(重置不丢失) / 白名单下载(登陆账号优先) */ (function () { 'use strict'; const $ = s => document.querySelector(s); const $$ = s => Array.prototype.slice.call(document.querySelectorAll(s)); function esc(s) { return String(s == null ? '' : s).replace(/[&<>"']/g, c => ({ '&': '&', '<': '<', '>': '>', '"': '"', "'": ''' }[c])); } const sleep = ms => new Promise(r => setTimeout(r, ms)); const LS_RESULT = 'ny_draw_result'; // 当前抽取结果(刷新后仍可下载) const LS_HISTORY = 'ny_draw_history'; // 累计抽中学号(「重置结果」清零) const LS_EXCLUDED = 'ny_draw_excluded'; // 手动排除的学号 const LS_LOG = 'ny_draw_log'; // 历史批次(重置不清,上限 50 条) const LS_SETTINGS = 'ny_draw_settings'; // 来源 / 项目 / 班级 / 组别 / 人数 / 开关 const LOG_MAX = 50; const state = { roster: [], projects: [], answers: [], source: 'roster', picked: [], history: new Set(), // 累计抽中(重置结果时清零) excluded: new Set(), // 手动排除 log: [], // 历史批次,新的在前 customRatios: {}, // 自定义比例:{ 组名: 权重 } drawing: false, }; /* ---------------- 接口 ---------------- */ async function api(action, params) { const q = new URLSearchParams(Object.assign({ action: action }, params || {})); const r = await fetch('api.php?' + q.toString(), { credentials: 'same-origin' }); let j; try { j = await r.json(); } catch (e) { throw new Error('接口返回异常(HTTP ' + r.status + ')'); } if (r.status === 401 || (j && j.ok === false && /未登录/.test(j.msg || ''))) { location.href = 'login.php'; throw new Error('未登录'); } if (!j || !j.ok) { throw new Error((j && j.msg) || '请求失败'); } return j.data; } function showAlert(msg, type) { const el = $('#alert'); if (!el) return; if (!msg) { el.classList.add('hidden'); return; } el.textContent = msg; el.className = 'alert' + (type === 'info' ? ' info' : ''); } /* ================= 抽取核心(纯函数,供测试) ================= */ /** Fisher-Yates 洗牌(返回新数组) */ function shuffle(arr) { const a = arr.slice(); for (let i = a.length - 1; i > 0; i--) { const j = Math.floor(Math.random() * (i + 1)); const t = a[i]; a[i] = a[j]; a[j] = t; } return a; } /** * 名额分配: * - sizes 各组容量 * - n 要抽的总人数 * - weights 各组权重(null=均分;数组=按权重,权重<=0 视为 0) * 算法:最大余额法(largest remainder)—— raw_i = n * w_i / Σw;floor 后把剩余名额 * 按小数部分降序分给还没满的组。均分模式是 weights=null 的特例(每组权重 1), * 余数时按"组容量小者优先"补齐,保证每组都有代表。 */ function allocQuotas(sizes, n, weights) { const g = sizes.length; const quota = new Array(g).fill(0); if (g === 0 || n <= 0) return quota; const total = sizes.reduce((a, b) => a + b, 0); if (n >= total) return sizes.slice(); // 全量 const base = new Array(g).fill(0); const frac = new Array(g).fill(0); if (Array.isArray(weights) && weights.length === g) { const w = weights.map(x => (Number(x) > 0 ? Number(x) : 0)); const wsum = w.reduce((a, b) => a + b, 0); if (wsum > 0) { // 按权重分配:最大余额法 for (let i = 0; i < g; i++) { const raw = n * w[i] / wsum; base[i] = Math.floor(raw); frac[i] = raw - base[i]; } } else { // 全 0 权重 → 退化为均分 const b = Math.floor(n / g); for (let i = 0; i < g; i++) base[i] = b; const rem = n - b * g; const bySmall = sizes.map((s, i) => i) .sort((a, b2) => sizes[a] - sizes[b2] || a - b2); for (let k = 0; k < rem; k++) base[bySmall[k % g]]++; } } else { // 名额均分:每组 n/g,余数小组优先(保证每组都有代表) const b = Math.floor(n / g); for (let i = 0; i < g; i++) base[i] = b; const rem = n - b * g; const bySmall = sizes.map((s, i) => i) .sort((a, b2) => sizes[a] - sizes[b2] || a - b2); for (let k = 0; k < rem; k++) base[bySmall[k % g]]++; } // 余数补齐:frac 大的优先;同 frac 时剩余容量大的优先 let rest = n - base.reduce((a, b) => a + b, 0); if (rest > 0) { const order = sizes.map((s, i) => i).sort((a, b) => (frac[b] - frac[a]) || ((sizes[b] - base[b]) - (sizes[a] - base[a])) || (a - b)); for (let k = 0; rest > 0 && k < g; k++) { const i = order[k % g]; if (base[i] < sizes[i]) { base[i]++; rest--; } } // 若仍有余数(组容量限制),继续按剩余容量大者分配 while (rest > 0) { let progress = false; const byRoom = sizes.map((s, i) => i) .sort((a, b) => ((sizes[b] - base[b]) - (sizes[a] - base[a])) || (a - b)); for (const i of byRoom) { if (rest <= 0) break; if (base[i] < sizes[i]) { base[i]++; rest--; progress = true; } } if (!progress) break; } } // 超容量退回(极端比例时兜底) let overflow = 0; for (let i = 0; i < g; i++) { if (base[i] > sizes[i]) { overflow += base[i] - sizes[i]; base[i] = sizes[i]; } } while (overflow > 0) { let progress = false; const byRoom = sizes.map((s, i) => i) .sort((a, b) => ((sizes[b] - base[b]) - (sizes[a] - base[a])) || (a - b)); for (const i of byRoom) { if (overflow <= 0) break; if (base[i] < sizes[i]) { base[i]++; overflow--; progress = true; } } if (!progress) break; } return base; } /** * 选择均衡维度:组别(>=2 个非空组)优先,其次班级,否则不均衡 */ function balanceKeyOf(pool) { const grps = new Set(pool.map(m => String(m.grp || '').trim()).filter(Boolean)); if (grps.size >= 2) return 'grp'; const clss = new Set(pool.map(m => String(m.cls || '').trim()).filter(Boolean)); if (clss.size >= 2) return 'cls'; return ''; } /** * 分组均衡抽取:返回 { picked, detail, sizes, weights } * weights 数组为各组实际权重(默认加权时=各组人数) * detail 例:["A 6人", "B 4人"],用于提示与历史记录 */ function pickBalanced(pool, n, key, weights) { const label = key === 'grp' ? '(未分组)' : '(未分班)'; const groups = new Map(); pool.forEach(m => { const k = String(m[key] || '').trim() || label; if (!groups.has(k)) groups.set(k, []); groups.get(k).push(m); }); const gk = Array.from(groups.keys()) .sort((a, b) => String(a).localeCompare(String(b), 'zh', { numeric: true })); const sizes = gk.map(k => groups.get(k).length); const w = (Array.isArray(weights) && weights.length === gk.length) ? weights : null; const quotas = allocQuotas(sizes, n, w); const picked = []; const detail = []; gk.forEach((k, i) => { const part = shuffle(groups.get(k)).slice(0, quotas[i]); picked.push(...part); if (quotas[i] > 0) detail.push(k + ' ' + quotas[i] + '人'); }); return { picked, detail, sizes, weights: w || sizes.slice() }; } // 测试钩子(node 端 eval 后通过 window.__nyDrawTest 调用) if (typeof window !== 'undefined') { window.__nyDrawTest = { shuffle, allocQuotas, balanceKeyOf, pickBalanced }; } /* ================= 数据加载 ================= */ async function loadRoster() { const d = await api('roster'); state.roster = (d && d.students ? d.students : []).map(s => ({ sid: String(s.sid || ''), name: String(s.name || ''), cls: String(s.cls || ''), grp: String(s.grp || ''), login: String(s.login || ''), })); const badge = $('#rosterBadge'); if (badge) badge.textContent = state.roster.length; } async function loadProjects() { try { state.projects = (await api('projects')) || []; } catch (e) { state.projects = []; } const sel = $('#projectSel'); if (!sel) return; const isFolder = p => (p.mode || '').toLowerCase().indexOf('folder') >= 0; const parentIds = new Set(); state.projects.forEach(p => { const pid = String(p.parent_id || '0'); if (pid !== '0' && pid !== '') parentIds.add(pid); }); const folderSet = new Set(); state.projects.forEach(p => { if (isFolder(p) || parentIds.has(p.id)) folderSet.add(p.id); }); const nameOf = id => { const f = state.projects.filter(p => p.id === id)[0]; return f ? String(f.name || '') : ''; }; const items = state.projects.filter(p => !folderSet.has(p.id)); if (!items.length) { sel.innerHTML = ''; return; } sel.innerHTML = items.map(p => { const pid = String(p.parent_id || '0'); const fn = (pid !== '0' && pid !== '' && folderSet.has(pid)) ? nameOf(pid) : ''; const label = fn ? fn + ' / ' + p.name : p.name; return ''; }).join(''); } async function loadAnswers(pid) { const d = await api('data', { projectId: pid }); const loginOf = {}; state.roster.forEach(s => { if (s.login) loginOf[s.sid] = s.login; }); state.answers = ((d && d.rows) ? d.rows : []).map(r => ({ sid: String(r.sid || ''), name: String(r.name || ''), cls: String(r.cls || ''), grp: String(r.grp || ''), login: String(loginOf[r.sid] || ''), })); } /* ================= 候选池 ================= */ function baseList() { return state.source === 'project' ? state.answers : state.roster; } function currentPool() { let list = baseList().slice(); const cls = $('#clsSel').value; const grp = $('#grpSel').value; if (cls) list = list.filter(x => (x.cls || '') === cls); if (grp) list = list.filter(x => (x.grp || '') === grp); list = list.filter(x => !state.excluded.has(String(x.sid))); if ($('#excludePicked').checked) { list = list.filter(x => !state.history.has(String(x.sid))); } return list; } function uniqSorted(arr) { const seen = {}; const out = []; arr.forEach(v => { if (v && !seen[v]) { seen[v] = 1; out.push(v); } }); out.sort((a, b) => String(a).localeCompare(String(b), 'zh', { numeric: true })); return out; } function fillSel(sel, values, allLabel) { if (!sel) return; const cur = sel.value; sel.innerHTML = '' + values.map(v => '').join(''); sel.value = (values.indexOf(cur) >= 0) ? cur : ''; } function populateFilters() { const list = baseList(); fillSel($('#clsSel'), uniqSorted(list.map(x => x.cls || '')), '全部班级'); fillSel($('#grpSel'), uniqSorted(list.map(x => x.grp || '')), '全部组别'); } function rangeText() { const cls = $('#clsSel').value, grp = $('#grpSel').value; const parts = []; if (cls) parts.push(cls); if (grp) parts.push(grp + '组'); return parts.length ? parts.join(' / ') : '全部'; } function renderStats() { const pool = currentPool(); $('#dPool').textContent = pool.length; $('#dPicked').textContent = state.picked.length; $('#dHistory').textContent = state.history.size; $('#dExcluded').textContent = state.excluded.size; $('#dSource').textContent = state.source === 'project' ? '已提交人员' : '学号名单'; $('#drawHint').textContent = '候选 ' + pool.length + ' 人(' + rangeText() + ')'; const lb = $('#logBadge'); if (lb) lb.textContent = state.log.length; const ec = $('#exclCount'); if (ec) ec.textContent = '已排除 ' + state.excluded.size + ' 人'; } /** * 计算当前候选池的分组信息:{ key, gk[], sizes[] } * key = 'grp' | 'cls' | '' * gk 按字典序排序后的组名 * sizes 每组成员数 */ function poolGroups(pool) { const key = balanceKeyOf(pool); if (!key) return { key: '', gk: [], sizes: [] }; const label = key === 'grp' ? '(未分组)' : '(未分班)'; const groups = new Map(); pool.forEach(m => { const k = String(m[key] || '').trim() || label; if (!groups.has(k)) groups.set(k, 0); groups.set(k, groups.get(k) + 1); }); const gk = Array.from(groups.keys()) .sort((a, b) => String(a).localeCompare(String(b), 'zh', { numeric: true })); return { key, gk, sizes: gk.map(k => groups.get(k)) }; } /** 把对象 {gk:weight} 读成与当前池分组顺序一致的数组,缺组视为 0 */ function readCustomWeights(gk) { const src = state.customRatios || {}; return gk.map(k => { const v = parseFloat(src[k]); return Number.isFinite(v) && v > 0 ? v : 0; }); } /* ================= 抽取 ================= */ async function doDraw() { if (state.drawing) return; const pool = currentPool(); if (!pool.length) { showAlert('当前筛选下没有可抽取的人员(可关闭「排除已抽中」、调整班级 / 组别或排除名单)'); return; } let n = parseInt($('#numInput').value, 10); if (!n || n < 1) n = 1; if (n > pool.length) n = pool.length; state.drawing = true; const stage = $('#drawStage'); const btn = $('#btnDraw'); btn.disabled = true; showAlert(''); // 滚动动画:先快速闪动若干次 stage.className = 'draw-stage rolling'; const rounds = Math.min(24, 10 + n); for (let i = 0; i < rounds; i++) { const p = pool[Math.floor(Math.random() * pool.length)]; stage.textContent = p.name || p.sid || '—'; await sleep(40 + i * 7); } // 真正抽取:均衡(按模式分组) 或整池随机 let picked, detail = []; const mode = $('#balanceMode').value; if (mode === 'off') { picked = shuffle(pool).slice(0, n); } else { const g = poolGroups(pool); if (g.key) { let weights = null; if (mode === 'weight') weights = g.sizes.slice(); // 默认按组人数加权 else if (mode === 'custom') weights = readCustomWeights(g.gk); // mode === 'even' 走 allocQuotas(null) → 均分 const res = pickBalanced(pool, n, g.key, weights); picked = res.picked; detail = res.detail; } else { picked = shuffle(pool).slice(0, n); } } state.picked = picked; picked.forEach(m => state.history.add(String(m.sid))); stage.className = 'draw-stage done'; stage.textContent = n === 1 ? (picked[0].name || picked[0].sid) : ('🎉 已抽取 ' + n + ' 人'); renderResult(); renderStats(); pushLog(picked, detail, mode); saveState(); state.drawing = false; btn.disabled = false; const tail = detail.length ? '(' + detail.join(' / ') + ')' : ''; showAlert('已抽取 ' + n + ' 人' + tail + (n > 1 ? ',可点击右上角按钮下载白名单' : ''), 'info'); } function renderResult() { const tb = $('#drawBody'); if (!state.picked.length) { tb.innerHTML = '
暂无历史记录
'; return; } box.innerHTML = state.log.map((e, i) => { const rows = (e.members || []).map((m, j) => '| 序号 | 学号 | 姓名 | 班级 | 组别 |
|---|
按上面分组的顺序填写权重,例:组A=3,组B=1。留空=不计该组。
' + g.gk.map((k, i) => { const def = (state.customRatios && Number.isFinite(parseFloat(state.customRatios[k]))) ? state.customRatios[k] : g.sizes[i]; return '