nxxy335
d2f0908385
- DataService::build 新增 aggregateByStudent 按学号聚合： dedupe=true 仅保留最新一份；false 则每学号一行（代表成绩取最高分） 附 attempts(次数) 与 attempts_list(每次提交明细)，修正提交人数被多次提交inflate的问题 - api.php dashboard 透传 attempts/attempts_list；statOf 增加 attempts 求和；export 增加刷题次数列 - dashboard.php 成员榜加"刷N次"徽标，点击下钻弹窗看每次提交（时间/成绩/时长/暂存）；hero 显示总提交次数 - 主统计页成绩明细同样加"刷N次"徽标与下钻弹窗 - stats 新增 attempts_total
376 lines
14 KiB
PHP
376 lines
14 KiB
PHP
<?php
|
||
/**
|
||
* 数据组装：卷王答卷 -> 学号 / 姓名 / 成绩 / 提交时间 / 考试时长
|
||
*/
|
||
declare(strict_types=1);
|
||
|
||
class DataService
|
||
{
|
||
/** 容器型题目（分页、题组、说明）不参与取值 */
|
||
private const CONTAINER_TYPES = [
|
||
'pagination', 'page', 'group', 'survey', 'divider', 'tree',
|
||
];
|
||
|
||
/** 题目标题可能是富文本，去掉标签便于展示与匹配 */
|
||
private static function cleanTitle(string $t): string
|
||
{
|
||
$t = strip_tags($t);
|
||
$t = html_entity_decode($t, ENT_QUOTES | ENT_HTML5, 'UTF-8');
|
||
return trim(preg_replace('/\s+/u', ' ', $t) ?? '');
|
||
}
|
||
|
||
/**
|
||
* 展平题目树
|
||
* @return array<int,array{id:string,title:string,type:string,path:string}>
|
||
*/
|
||
public static function flattenQuestions(mixed $node, string $path = ''): array
|
||
{
|
||
$out = [];
|
||
if (!is_array($node)) {
|
||
return $out;
|
||
}
|
||
|
||
// children 在根或子节点
|
||
$self = $node;
|
||
$children = (isset($node['children']) && is_array($node['children'])) ? $node['children'] : null;
|
||
|
||
$id = isset($self['id']) ? (string)$self['id'] : '';
|
||
$title = isset($self['title']) ? self::cleanTitle((string)$self['title']) : '';
|
||
$type = isset($self['type']) ? (string)$self['type'] : '';
|
||
|
||
$isRoot = ($path === '');
|
||
if (!$isRoot && $id !== '' && !in_array(strtolower($type), self::CONTAINER_TYPES, true)) {
|
||
$out[] = [
|
||
'id' => $id,
|
||
'title' => $title !== '' ? $title : $id,
|
||
'type' => $type,
|
||
'path' => $path,
|
||
];
|
||
}
|
||
|
||
if ($children !== null) {
|
||
foreach ($children as $idx => $child) {
|
||
$subPath = $path === '' ? (string)($idx + 1) : $path . '-' . ($idx + 1);
|
||
foreach (self::flattenQuestions($child, $subPath) as $q) {
|
||
$out[] = $q;
|
||
}
|
||
}
|
||
}
|
||
return $out;
|
||
}
|
||
|
||
/** 根据关键词猜测"姓名"题 */
|
||
public static function guessNameQuestion(array $questions, string $keywords): array
|
||
{
|
||
$kws = array_values(array_filter(array_map('trim', preg_split('/[,，]/u', $keywords) ?: [])));
|
||
$candidates = [];
|
||
foreach ($questions as $q) {
|
||
$t = (string)$q['title'];
|
||
foreach ($kws as $kw) {
|
||
if ($kw !== '' && mb_stripos($t, $kw) !== false) {
|
||
$candidates[] = $q;
|
||
break;
|
||
}
|
||
}
|
||
}
|
||
return $candidates;
|
||
}
|
||
|
||
/**
|
||
* 组装结果
|
||
*/
|
||
public static function build(array $cfg, string $projectId, string $nameQid = ''): array
|
||
{
|
||
$client = new SurveyKingClient($cfg);
|
||
|
||
$students = Roster::all();
|
||
// 姓名 -> 学号 / 班级（规范化）
|
||
$studentInfo = [];
|
||
foreach ($students as $s) {
|
||
$k = ny_norm_name((string)$s['name']);
|
||
if ($k !== '') {
|
||
$studentInfo[$k] = [
|
||
'sid' => (string)$s['sid'],
|
||
'cls' => (string)($s['cls'] ?? ''),
|
||
'grp' => (string)($s['grp'] ?? ''),
|
||
];
|
||
}
|
||
}
|
||
|
||
$project = $client->getProject($projectId);
|
||
$survey = $project['survey'] ?? null;
|
||
if (is_string($survey) && $survey !== '') {
|
||
$decoded = json_decode($survey, true);
|
||
if (is_array($decoded)) {
|
||
$survey = $decoded;
|
||
}
|
||
}
|
||
$questions = self::flattenQuestions($survey);
|
||
|
||
$keywords = (string)($cfg['name_keywords'] ?? '姓名');
|
||
$nameCandidates = self::guessNameQuestion($questions, $keywords);
|
||
$autoQid = $nameCandidates[0]['id'] ?? '';
|
||
|
||
// 指定优先
|
||
$pickedQid = $nameQid !== '' ? $nameQid : $autoQid;
|
||
$candidateIds = [];
|
||
if ($pickedQid !== '') {
|
||
$candidateIds[] = $pickedQid;
|
||
}
|
||
foreach ($nameCandidates as $q) {
|
||
if (!in_array($q['id'], $candidateIds, true)) {
|
||
$candidateIds[] = $q['id'];
|
||
}
|
||
}
|
||
|
||
$answers = $client->listAnswers($projectId);
|
||
|
||
$includeTemp = !empty($cfg['include_temp_save']);
|
||
$dedupe = !empty($cfg['dedupe']);
|
||
|
||
$rawRows = []; // 已匹配学号的原始 row（每条 = 一次提交）
|
||
$unmatched = [];
|
||
|
||
foreach ($answers as $a) {
|
||
$tempSave = isset($a['tempSave']) ? (int)$a['tempSave'] : 1;
|
||
if (!$includeTemp && $tempSave === 0) {
|
||
continue; // 跳过暂存
|
||
}
|
||
$answerMap = isset($a['answer']) && is_array($a['answer']) ? $a['answer'] : [];
|
||
|
||
// 姓名：优先关键词命中的题目 -> 全量扫描能匹配名单的答案 -> 登录用户名
|
||
$name = '';
|
||
foreach ($candidateIds as $qid) {
|
||
if (isset($answerMap[$qid])) {
|
||
$v = ny_flatten_value($answerMap[$qid]);
|
||
if ($v !== '') {
|
||
$name = $v;
|
||
break;
|
||
}
|
||
}
|
||
}
|
||
if ($name === '') {
|
||
foreach ($questions as $q) {
|
||
$qid = (string)$q['id'];
|
||
if (!array_key_exists($qid, $answerMap)) {
|
||
continue;
|
||
}
|
||
$v = ny_flatten_value($answerMap[$qid]);
|
||
if ($v !== '' && isset($nameMap[ny_norm_name($v)])) {
|
||
$name = $v;
|
||
break;
|
||
}
|
||
}
|
||
}
|
||
if ($name === '' && $questions === []) {
|
||
foreach ($answerMap as $v) {
|
||
$s = ny_flatten_value($v);
|
||
if ($s !== '' && isset($nameMap[ny_norm_name($s)])) {
|
||
$name = $s;
|
||
break;
|
||
}
|
||
}
|
||
}
|
||
if ($name === '') {
|
||
$name = ny_str($a['createByName'] ?? '');
|
||
}
|
||
if ($name === '') {
|
||
$name = '（未填写姓名）';
|
||
}
|
||
|
||
// 成绩
|
||
$score = null;
|
||
if (isset($a['examScore']) && is_numeric($a['examScore'])) {
|
||
$score = (float)$a['examScore'];
|
||
}
|
||
|
||
// 提交时间
|
||
$ts = ny_to_timestamp($a['createAt'] ?? null);
|
||
if ($ts === 0) {
|
||
$ts = ny_to_timestamp($a['updateAt'] ?? null);
|
||
}
|
||
|
||
// 考试时长
|
||
$ai = $a['metaInfo']['answerInfo'] ?? [];
|
||
$start = is_array($ai) ? (int)($ai['startTime'] ?? 0) : 0;
|
||
$end = is_array($ai) ? (int)($ai['endTime'] ?? 0) : 0;
|
||
$dur = null;
|
||
if ($start > 0 && $end > $start) {
|
||
$dur = (int)round(($end - $start) / 1000);
|
||
}
|
||
|
||
$key = ny_norm_name($name);
|
||
$info = $studentInfo[$key] ?? null;
|
||
$sid = $info['sid'] ?? '';
|
||
$cls = $info['cls'] ?? '';
|
||
$grp = $info['grp'] ?? '';
|
||
|
||
$row = [
|
||
'sid' => $sid,
|
||
'name' => $name,
|
||
'cls' => $cls,
|
||
'grp' => $grp,
|
||
'score' => $score,
|
||
'submit_ts' => $ts,
|
||
'submit_at' => $ts > 0 ? date('Y-m-d H:i:s', $ts) : '-',
|
||
'duration' => $dur,
|
||
'duration_txt'=> ny_format_duration($dur),
|
||
'answer_id' => ny_str($a['id'] ?? ''),
|
||
'matched' => $sid !== '',
|
||
'temp_save' => $tempSave === 0,
|
||
];
|
||
|
||
if ($sid === '') {
|
||
$unmatched[] = $row;
|
||
continue;
|
||
}
|
||
|
||
$rawRows[] = $row;
|
||
}
|
||
|
||
// 按学号聚合：dedupe=true 仅保留最新一份；false 则每名一行（代表=最高分）
|
||
// 并附带 attempts(次数) / attempts_list(每次提交明细)，供看板展示"多次刷题"
|
||
$agg = self::aggregateByStudent($rawRows, $dedupe);
|
||
$rows = $agg['rows'];
|
||
$attemptsTotal = $agg['attempts_total'];
|
||
|
||
// 成绩明细默认按提交时间降序（最新在前），学号作为次级排序
|
||
usort($rows, static function (array $x, array $y): int {
|
||
$d = ($y['submit_ts'] ?? 0) <=> ($x['submit_ts'] ?? 0);
|
||
if ($d !== 0) {
|
||
return $d;
|
||
}
|
||
$a = (string)$x['sid'];
|
||
$b = (string)$y['sid'];
|
||
if (is_numeric($a) && is_numeric($b)) {
|
||
return $a <=> $b;
|
||
}
|
||
return strnatcmp($a, $b);
|
||
});
|
||
|
||
// 缺考名单
|
||
$submittedSids = [];
|
||
foreach ($rows as $r) {
|
||
$submittedSids[(string)$r['sid']] = true;
|
||
}
|
||
$absent = [];
|
||
foreach ($students as $s) {
|
||
if (!isset($submittedSids[(string)$s['sid']])) {
|
||
$absent[] = [
|
||
'sid' => (string)$s['sid'],
|
||
'name' => (string)$s['name'],
|
||
'cls' => (string)($s['cls'] ?? ''),
|
||
'grp' => (string)($s['grp'] ?? ''),
|
||
];
|
||
}
|
||
}
|
||
usort($absent, static function (array $x, array $y): int {
|
||
$a = (string)$x['sid'];
|
||
$b = (string)$y['sid'];
|
||
if (is_numeric($a) && is_numeric($b)) {
|
||
return $a <=> $b;
|
||
}
|
||
return strnatcmp($a, $b);
|
||
});
|
||
|
||
// 统计
|
||
$scores = array_values(array_filter(array_map(static fn($r) => $r['score'], $rows), static fn($v) => $v !== null));
|
||
$durs = array_values(array_filter(array_map(static fn($r) => $r['duration'], $rows), static fn($v) => $v !== null));
|
||
$stats = [
|
||
'roster_total' => count($students),
|
||
'submitted' => count($rows),
|
||
'absent' => count($absent),
|
||
'unmatched' => count($unmatched),
|
||
'submit_rate' => count($students) > 0 ? round(count($rows) / count($students) * 100, 1) : 0,
|
||
'avg_score' => $scores !== [] ? round(array_sum($scores) / count($scores), 2) : null,
|
||
'max_score' => $scores !== [] ? max($scores) : null,
|
||
'min_score' => $scores !== [] ? min($scores) : null,
|
||
'avg_duration' => $durs !== [] ? (int)round(array_sum($durs) / count($durs)) : null,
|
||
'answer_total' => count($answers),
|
||
'attempts_total'=> $attemptsTotal,
|
||
];
|
||
|
||
return [
|
||
'project' => [
|
||
'id' => ny_str($project['id'] ?? $projectId),
|
||
'name' => ny_str($project['name'] ?? ''),
|
||
'mode' => ny_str($project['mode'] ?? ''),
|
||
],
|
||
'questions' => $questions,
|
||
'name_qid' => $pickedQid,
|
||
'name_candidates' => array_map(static fn($q) => ['id' => $q['id'], 'title' => $q['title']], $nameCandidates),
|
||
'rows' => $rows,
|
||
'absent' => $absent,
|
||
'unmatched' => $unmatched,
|
||
'stats' => $stats,
|
||
'roster' => $students,
|
||
'roster_count' => count($students),
|
||
'updated_at' => date('Y-m-d H:i:s'),
|
||
];
|
||
}
|
||
|
||
/**
|
||
* 按学号聚合一次提交的答卷记录，解决"同人多次刷卷"在看板中被当成多个人的问题。
|
||
* - dedupe=true：每学号仅保留提交时间最新的一份（原行为）
|
||
* - dedupe=false：每学号一行，代表成绩取最高分，附 attempts(次数) / attempts_list(每次提交明细)
|
||
*
|
||
* @param array $rows 已匹配学号的原始 row（每条 = 一次提交）
|
||
* @return array{rows:array, attempts_total:int}
|
||
*/
|
||
public static function aggregateByStudent(array $rows, bool $dedupe): array
|
||
{
|
||
$bySid = [];
|
||
foreach ($rows as $r) {
|
||
$bySid[(string)($r['sid'] ?? '')][] = $r;
|
||
}
|
||
$agg = [];
|
||
$attemptsTotal = 0;
|
||
foreach ($bySid as $sid => $list) {
|
||
$attemptsTotal += count($list);
|
||
// 升序：旧 -> 新
|
||
$sorted = $list;
|
||
usort($sorted, static function (array $x, array $y): int {
|
||
return ($x['submit_ts'] ?? 0) <=> ($y['submit_ts'] ?? 0);
|
||
});
|
||
$attemptsList = array_map(static function (array $a): array {
|
||
return [
|
||
'submit_at' => $a['submit_at'],
|
||
'submit_ts' => $a['submit_ts'],
|
||
'score' => $a['score'],
|
||
'duration' => $a['duration'],
|
||
'duration_txt' => $a['duration_txt'],
|
||
'answer_id' => $a['answer_id'],
|
||
'temp_save' => $a['temp_save'],
|
||
];
|
||
}, $sorted);
|
||
|
||
if ($dedupe) {
|
||
// 仅保留提交时间最新的一份（明细列表也只留这一份，与"只保留最新"语义一致）
|
||
$row = $sorted[count($sorted) - 1];
|
||
$row['attempts'] = 1;
|
||
$row['best_score'] = $row['score'];
|
||
$row['attempts_list'] = [$attemptsList[count($attemptsList) - 1]];
|
||
} else {
|
||
// 代表成绩取最高分（null 成绩不参与比较，全部为 null 时回退为最近一份）
|
||
$best = null;
|
||
$bestScore = null;
|
||
foreach ($sorted as $a) {
|
||
if ($a['score'] !== null && ($bestScore === null || $a['score'] > $bestScore)) {
|
||
$bestScore = $a['score'];
|
||
$best = $a;
|
||
}
|
||
}
|
||
if ($best === null) {
|
||
$best = $sorted[count($sorted) - 1];
|
||
}
|
||
$row = $best;
|
||
$row['attempts'] = count($list);
|
||
$row['best_score'] = $bestScore;
|
||
$row['attempts_list'] = $attemptsList;
|
||
}
|
||
$agg[] = $row;
|
||
}
|
||
return ['rows' => $agg, 'attempts_total' => $attemptsTotal];
|
||
}
|
||
}
|