Files
bruno ff99b8eb2b feat: 论文级博客系统 - 完整数学公式与高级代码展示
📚 论文级功能实现:
- ✅ KaTeX数学公式渲染系统 (内联$...1411...1411)
- ✅ 高级代码高亮 (行号、标题、语法着色)
- ✅ PWA渐进式Web应用支持
- ✅ 多语言代码支持 (20+编程语言)
- ✅ 代码行标注系统 (错误/成功/警告/高亮)

🧮 数学公式系统:
- LaTeX语法完整支持
- 数学宏定义 (\RR, \NN, \ZZ, \QQ, \CC等)
- 复杂公式渲染 (矩阵、积分、求和、分数)
- 响应式数学表达式
- 黑暗模式数学公式适配

💻 高级代码展示:
- 代码块标题显示
- 行号自动生成
- 语法高亮增强
- 多行高亮标注
- 错误/成功/警告行标记
- 20+编程语言支持

🔧 企业级插件:
- @docusaurus/plugin-pwa (离线支持)
- rehype-katex (数学公式)
- remark-math (数学语法)
- remark-gfm (GitHub风格Markdown)
- prism-react-renderer (代码高亮)

📊 算法示例升级:
- Transformer深度学习模型
- 多头注意力机制实现
- 完整的神经网络架构
- 专业文档注释
- 类型提示和错误处理

🎨 视觉优化:
- 数学公式背景框
- 代码行高亮动画
- 专业配色方案
- 渐变边框效果
- 响应式设计适配

📱 PWA功能:
- 离线访问支持
- 应用图标配置
- 清单文件完整
- 主题色统一
- 安装提示优化

🚀 性能优化:
- 图片质量提升至85%
- 代码分割优化
- 字体预加载
- CSS变量系统
- GPU加速渲染

✨ 用户体验:
- 论文级排版标准
- 学术引用格式
- 专业视觉层次
- 无障碍访问支持
- 多设备完美适配
2025-07-20 06:51:21 +08:00

136 lines
4.6 KiB
JavaScript

(function (global, factory) {
typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :
typeof define === 'function' && define.amd ? define(['exports'], factory) :
(global = global || self, factory(global.sourcemapCodec = {}));
}(this, function (exports) { 'use strict';
var charToInteger = {};
var chars = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=';
for (var i = 0; i < chars.length; i++) {
charToInteger[chars.charCodeAt(i)] = i;
}
function decode(mappings) {
var decoded = [];
var line = [];
var segment = [
0,
0,
0,
0,
0,
];
var j = 0;
for (var i = 0, shift = 0, value = 0; i < mappings.length; i++) {
var c = mappings.charCodeAt(i);
if (c === 44) { // ","
segmentify(line, segment, j);
j = 0;
}
else if (c === 59) { // ";"
segmentify(line, segment, j);
j = 0;
decoded.push(line);
line = [];
segment[0] = 0;
}
else {
var integer = charToInteger[c];
if (integer === undefined) {
throw new Error('Invalid character (' + String.fromCharCode(c) + ')');
}
var hasContinuationBit = integer & 32;
integer &= 31;
value += integer << shift;
if (hasContinuationBit) {
shift += 5;
}
else {
var shouldNegate = value & 1;
value >>>= 1;
if (shouldNegate) {
value = value === 0 ? -0x80000000 : -value;
}
segment[j] += value;
j++;
value = shift = 0; // reset
}
}
}
segmentify(line, segment, j);
decoded.push(line);
return decoded;
}
function segmentify(line, segment, j) {
// This looks ugly, but we're creating specialized arrays with a specific
// length. This is much faster than creating a new array (which v8 expands to
// a capacity of 17 after pushing the first item), or slicing out a subarray
// (which is slow). Length 4 is assumed to be the most frequent, followed by
// length 5 (since not everything will have an associated name), followed by
// length 1 (it's probably rare for a source substring to not have an
// associated segment data).
if (j === 4)
line.push([segment[0], segment[1], segment[2], segment[3]]);
else if (j === 5)
line.push([segment[0], segment[1], segment[2], segment[3], segment[4]]);
else if (j === 1)
line.push([segment[0]]);
}
function encode(decoded) {
var sourceFileIndex = 0; // second field
var sourceCodeLine = 0; // third field
var sourceCodeColumn = 0; // fourth field
var nameIndex = 0; // fifth field
var mappings = '';
for (var i = 0; i < decoded.length; i++) {
var line = decoded[i];
if (i > 0)
mappings += ';';
if (line.length === 0)
continue;
var generatedCodeColumn = 0; // first field
var lineMappings = [];
for (var _i = 0, line_1 = line; _i < line_1.length; _i++) {
var segment = line_1[_i];
var segmentMappings = encodeInteger(segment[0] - generatedCodeColumn);
generatedCodeColumn = segment[0];
if (segment.length > 1) {
segmentMappings +=
encodeInteger(segment[1] - sourceFileIndex) +
encodeInteger(segment[2] - sourceCodeLine) +
encodeInteger(segment[3] - sourceCodeColumn);
sourceFileIndex = segment[1];
sourceCodeLine = segment[2];
sourceCodeColumn = segment[3];
}
if (segment.length === 5) {
segmentMappings += encodeInteger(segment[4] - nameIndex);
nameIndex = segment[4];
}
lineMappings.push(segmentMappings);
}
mappings += lineMappings.join(',');
}
return mappings;
}
function encodeInteger(num) {
var result = '';
num = num < 0 ? (-num << 1) | 1 : num << 1;
do {
var clamped = num & 31;
num >>>= 5;
if (num > 0) {
clamped |= 32;
}
result += chars[clamped];
} while (num > 0);
return result;
}
exports.decode = decode;
exports.encode = encode;
Object.defineProperty(exports, '__esModule', { value: true });
}));
//# sourceMappingURL=sourcemap-codec.umd.js.map