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

146 lines
4.4 KiB
JavaScript

/*
Copyright 2021 Google LLC
Use of this source code is governed by an MIT-style
license that can be found in the LICENSE file or at
https://opensource.org/licenses/MIT.
*/
import { openDB } from 'idb';
import '../_version.js';
const DB_VERSION = 3;
const DB_NAME = 'workbox-background-sync';
const REQUEST_OBJECT_STORE_NAME = 'requests';
const QUEUE_NAME_INDEX = 'queueName';
/**
* A class to interact directly an IndexedDB created specifically to save and
* retrieve QueueStoreEntries. This class encapsulates all the schema details
* to store the representation of a Queue.
*
* @private
*/
export class QueueDb {
constructor() {
this._db = null;
}
/**
* Add QueueStoreEntry to underlying db.
*
* @param {UnidentifiedQueueStoreEntry} entry
*/
async addEntry(entry) {
const db = await this.getDb();
const tx = db.transaction(REQUEST_OBJECT_STORE_NAME, 'readwrite', {
durability: 'relaxed',
});
await tx.store.add(entry);
await tx.done;
}
/**
* Returns the first entry id in the ObjectStore.
*
* @return {number | undefined}
*/
async getFirstEntryId() {
const db = await this.getDb();
const cursor = await db
.transaction(REQUEST_OBJECT_STORE_NAME)
.store.openCursor();
return cursor === null || cursor === void 0 ? void 0 : cursor.value.id;
}
/**
* Get all the entries filtered by index
*
* @param queueName
* @return {Promise<QueueStoreEntry[]>}
*/
async getAllEntriesByQueueName(queueName) {
const db = await this.getDb();
const results = await db.getAllFromIndex(REQUEST_OBJECT_STORE_NAME, QUEUE_NAME_INDEX, IDBKeyRange.only(queueName));
return results ? results : new Array();
}
/**
* Returns the number of entries filtered by index
*
* @param queueName
* @return {Promise<number>}
*/
async getEntryCountByQueueName(queueName) {
const db = await this.getDb();
return db.countFromIndex(REQUEST_OBJECT_STORE_NAME, QUEUE_NAME_INDEX, IDBKeyRange.only(queueName));
}
/**
* Deletes a single entry by id.
*
* @param {number} id the id of the entry to be deleted
*/
async deleteEntry(id) {
const db = await this.getDb();
await db.delete(REQUEST_OBJECT_STORE_NAME, id);
}
/**
*
* @param queueName
* @returns {Promise<QueueStoreEntry | undefined>}
*/
async getFirstEntryByQueueName(queueName) {
return await this.getEndEntryFromIndex(IDBKeyRange.only(queueName), 'next');
}
/**
*
* @param queueName
* @returns {Promise<QueueStoreEntry | undefined>}
*/
async getLastEntryByQueueName(queueName) {
return await this.getEndEntryFromIndex(IDBKeyRange.only(queueName), 'prev');
}
/**
* Returns either the first or the last entries, depending on direction.
* Filtered by index.
*
* @param {IDBCursorDirection} direction
* @param {IDBKeyRange} query
* @return {Promise<QueueStoreEntry | undefined>}
* @private
*/
async getEndEntryFromIndex(query, direction) {
const db = await this.getDb();
const cursor = await db
.transaction(REQUEST_OBJECT_STORE_NAME)
.store.index(QUEUE_NAME_INDEX)
.openCursor(query, direction);
return cursor === null || cursor === void 0 ? void 0 : cursor.value;
}
/**
* Returns an open connection to the database.
*
* @private
*/
async getDb() {
if (!this._db) {
this._db = await openDB(DB_NAME, DB_VERSION, {
upgrade: this._upgradeDb,
});
}
return this._db;
}
/**
* Upgrades QueueDB
*
* @param {IDBPDatabase<QueueDBSchema>} db
* @param {number} oldVersion
* @private
*/
_upgradeDb(db, oldVersion) {
if (oldVersion > 0 && oldVersion < DB_VERSION) {
if (db.objectStoreNames.contains(REQUEST_OBJECT_STORE_NAME)) {
db.deleteObjectStore(REQUEST_OBJECT_STORE_NAME);
}
}
const objStore = db.createObjectStore(REQUEST_OBJECT_STORE_NAME, {
autoIncrement: true,
keyPath: 'id',
});
objStore.createIndex(QUEUE_NAME_INDEX, QUEUE_NAME_INDEX, { unique: false });
}
}