├── .eslintrc.js
├── .github
├── dependabot.yml
└── workflows
│ └── publish.yml
├── .gitignore
├── .prettierrc
├── LICENSE
├── Logo.png
├── README.md
├── README_CN.md
├── bookmark
├── lib
│ └── fuse.js
├── logo.png
├── manifest.json
├── manifest_firefox.json
├── popup.html
├── popup.js
└── utils
│ ├── debounce.js
│ ├── element.js
│ ├── favicon.js
│ ├── i18n.js
│ └── notification.js
├── newtab
├── bg.json
├── logo.png
├── manifest.json
├── newtab.html
└── newtab.js
├── package.json
├── theme
└── manifest.json
└── yarn.lock
/.eslintrc.js:
--------------------------------------------------------------------------------
1 | module.exports = {
2 | parserOptions: {
3 | ecmaVersion: 2020, // 改为ES2020
4 | sourceType: "module",
5 | },
6 | env: {
7 | browser: true,
8 | es6: true,
9 | node: true,
10 | },
11 | extends: ["eslint:recommended", "plugin:prettier/recommended", "plugin:import/errors", "plugin:import/warnings"],
12 | plugins: ["prettier", "import"],
13 | rules: {
14 | "prettier/prettier": "error",
15 | "no-useless-escape": "off",
16 | "no-undef": "off",
17 | },
18 | };
19 |
--------------------------------------------------------------------------------
/.github/dependabot.yml:
--------------------------------------------------------------------------------
1 | # To get started with Dependabot version updates, you'll need to specify which
2 | # package ecosystems to update and where the package manifests are located.
3 | # Please see the documentation for all configuration options:
4 | # https://docs.github.com/github/administering-a-repository/configuration-options-for-dependency-updates
5 |
6 | version: 2
7 | updates:
8 | - package-ecosystem: "npm" # See documentation for possible values
9 | directory: "/" # Location of package manifests
10 | schedule:
11 | interval: "weekly"
12 | open-pull-requests-limit: 100
13 |
--------------------------------------------------------------------------------
/.github/workflows/publish.yml:
--------------------------------------------------------------------------------
1 | name: publish
2 |
3 | permissions:
4 | contents: write
5 |
6 | on:
7 | push:
8 | tags:
9 | - '*'
10 |
11 | jobs:
12 | publish:
13 | runs-on: ubuntu-latest
14 | steps:
15 | - uses: actions/checkout@v3
16 | with:
17 | submodules: recursive
18 |
19 | - uses: actions/setup-node@v3
20 | with:
21 | node-version: 20
22 |
23 | - name: Run install
24 | uses: borales/actions-yarn@v4
25 | with:
26 | cmd: install # will run `yarn install` command
27 |
28 | - name: Build
29 | uses: borales/actions-yarn@v4
30 | with:
31 | cmd: build
32 |
33 | - name: Create Release and Upload Release Asset
34 | uses: softprops/action-gh-release@v1
35 | with:
36 | name: Auto Release
37 | tag_name: ${{ github.ref }}
38 | body: Auto Release
39 | draft: false
40 | prerelease: false
41 | files: dist/*
42 |
43 | # - uses: wdzeng/chrome-extension@v1
44 | # with:
45 | # extension-id: lgncmpklmepncbjpiebhdoejhmbcnjad
46 | # zip-path: dist/Maple.zip
47 | # tester-only: false
48 | # client-id: ${{ secrets.CHROME_CLIENT_ID }}
49 | # client-secret: ${{ secrets.CHROME_CLIENT_SECRET }}
50 | # refresh-token: ${{ secrets.CHROME_REFRESH_TOKEN }}
51 |
--------------------------------------------------------------------------------
/.gitignore:
--------------------------------------------------------------------------------
1 | .DS_Store
2 | .idea/
3 | /node_modules/
4 | /dist/
5 |
--------------------------------------------------------------------------------
/.prettierrc:
--------------------------------------------------------------------------------
1 | {
2 | "singleQuote": false,
3 | "trailingComma": "es5",
4 | "semi": true,
5 | "tabWidth": 2,
6 | "printWidth": 120
7 | }
8 |
--------------------------------------------------------------------------------
/LICENSE:
--------------------------------------------------------------------------------
1 | MIT License
2 |
3 | Copyright (c) 2023 Tw93
4 |
5 | Permission is hereby granted, free of charge, to any person obtaining a copy
6 | of this software and associated documentation files (the "Software"), to deal
7 | in the Software without restriction, including without limitation the rights
8 | to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
9 | copies of the Software, and to permit persons to whom the Software is
10 | furnished to do so, subject to the following conditions:
11 |
12 | The above copyright notice and this permission notice shall be included in all
13 | copies or substantial portions of the Software.
14 |
15 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
18 | AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 | LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20 | OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
21 | SOFTWARE.
22 |
--------------------------------------------------------------------------------
/Logo.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/tw93/Maple/8e844afd83cfdccf52ae5cb83f97685838db4dd0/Logo.png
--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
1 | English | 中文
3 |
Maple Bookmarks
5 |
15 | Hide the bookmark bar, use Maple Bookmarks to surf smoothly.
16 |
17 |
18 | ## Introduction
19 |
20 | The bookmarks bar can occupy the browsing window and affect concentration, so I often hide it. However, this makes accessing bookmarks inconvenient. Therefore, I developed the Maple Bookmarks extension. By just using the shortcut, you can quickly access your bookmarks, even input can be searched instantly, which is practical and convenient.
21 |
22 |
23 |
25 |
27 | 🏂 More effects can be expanded to view.
28 |
29 |
30 |
33 |
34 |
37 |
38 |
39 |
40 |
41 | ## Installation
42 |
43 | - Install [**Maple Bookmarks**](https://chrome.google.com/webstore/detail/maple-bookmarks/lgncmpklmepncbjpiebhdoejhmbcnjad) from the Chrome Web Store, If you are a Firefox user, please install and use [Firefox Addon](https://addons.mozilla.org/zh-CN/firefox/addon/maple-bookmarks/). If you find it useful, we'd appreciate your review.
44 | - If you're unable to access the Chrome Web Store, you can download [Maple.zip](https://github.com/tw93/Maple/releases/latest/download/Maple.zip). After unzipping, refer to [Loading an unpacked extension](https://developer.chrome.com/docs/extensions/mv3/getstarted/development-basics/#load-unpacked) to use the local package.
45 |
46 | ## More
47 |
48 | 1. Due to Chrome's limitations, even if the bookmarks bar is hidden, it will still appear on the default tab page. At this time, you can use [Maple NewTab](https://chrome.google.com/webstore/detail/maple-newtab/fobmbldflolfooglijmbibmnhoflbjlb/related?hl=en&authuser=0) to replace the default tab page, thus completely hiding the bookmarks bar.
49 | 2. `Maple NewTab` currently supports four types of displays: `Blank pure page`,`Unsplash`,`Trendy weekly picture`, and `Bing image`. Place the cursor on the background image, wait for 2 seconds, and a switch box will appear. Click to switch.
50 | 3. If you prefer your current tab page, you can remove the `Maple NewTab` extension. This way, you can revert to the default tab page.
51 |
52 | ## White Theme
53 |
54 | Since the default new theme of Chrome is not very appealing to me, I prefer a simple and clean effect, so I developed a [Maple Theme](https://chromewebstore.google.com/detail/cghofkeabdkcdoanmjhkadklfdlelaao) on the side. It doesn't include any other messy colors, making your browser look very clean.
55 |
56 | some canned food 🥩 .
71 | 2. If you like Maple, you can star it on GitHub. Also, welcome to recommend Maple to your friends.
72 | 3. You can follow my [Twitter](https://twitter.com/HiTw93) to get the latest news or join our [Telegram](https://t.me/+GclQS9ZnxyI2ODQ1) chat group.
73 |
--------------------------------------------------------------------------------
/README_CN.md:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
枫叶书签
6 |
16 | 隐藏书签栏，使用 枫叶书签 让你行云流水。
17 |
18 |
19 | ## 介绍
20 |
21 | 书签栏会占据浏览窗口且影响专注力，我常将其隐藏。但这使得访问书签很不方便，因此我开发了枫叶书签扩展，只需使用快捷键 `Command + E`(Mac)、`Ctrl+B`(Windows) 就能快速访问书签，甚至可以输入即搜索，实用且方便。
22 |
23 |
24 |
26 |
28 | 🏂 更多效果可以展开查看
29 |
30 |
31 |
34 |
35 |
38 |
39 |
40 |
41 |
42 | ## 安装
43 |
44 | - 使用 Chrome Web Store 来安装 [**Maple Bookmarks**](https://chrome.google.com/webstore/detail/maple-bookmarks/lgncmpklmepncbjpiebhdoejhmbcnjad)，假如你是火狐用户，请通过 [Firefox Addon](https://addons.mozilla.org/zh-CN/firefox/addon/maple-bookmarks/) 来安装使用，好用很欢迎评价。
45 | - 假如你不可访问，可以下载 [Maple.zip](https://github.com/tw93/Maple/releases/latest/download/Maple.zip)，解压以后，参考 [Loading an unpacked extension](https://developer.chrome.com/docs/extensions/mv3/getstarted/development-basics/#load-unpacked) 来使用本地包。
46 |
47 | ## 标签页
48 |
49 | 1. 由于 Chrome 的原因，即使隐藏掉书签栏，在默认标签页上还有，可以用 [Maple NewTab](https://chrome.google.com/webstore/detail/maple-newtab/fobmbldflolfooglijmbibmnhoflbjlb/related?hl=en&authuser=0) 扩展来替换掉，这样就可彻底隐藏掉书签栏了。
50 | 2. `Maple NewTab` 当前支持`空白纯净页`、`潮流周刊图`、`Bing 图`、`Unsplash` 4 种形式的效果，光标放置背景图上，等待 2s 会出现切换框，点击即可切换。
51 | 3. 假如你更喜欢现在自己的标签页，可以在扩展中移除掉 `Maple NewTab`，这样就能恢复到默认标签页了。
52 |
53 | ## 白色主题
54 |
55 | 由于Chrome的默认新主题不是很好看，我比较喜欢简单纯净的效果，就顺便开发了一个 [Maple Theme](https://chromewebstore.google.com/detail/cghofkeabdkcdoanmjhkadklfdlelaao)，没有其他乱七八糟的颜色，让你的浏览器看着很干净。
56 |
57 | 喂罐头 🥩 。
72 | 2. 如果你喜欢枫叶书签，可以在 Github Star 它，更欢迎推荐给你志同道合的朋友。
73 | 3. 可以关注我的 [Twitter](https://twitter.com/HiTw93) 获取到版本更新消息，也欢迎加入 [Telegram](https://t.me/+GclQS9ZnxyI2ODQ1) 聊天群。
74 |
--------------------------------------------------------------------------------
/bookmark/lib/fuse.js:
--------------------------------------------------------------------------------
1 | /**
2 | * Fuse.js v6.6.2 - Lightweight fuzzy-search (http://fusejs.io)
3 | *
4 | * Copyright (c) 2023 Kino Risk (http://kiro.me)
5 | * All Rights Reserved. Apache Software License 2.0
6 | *
7 | * http://www.apache.org/licenses/LICENSE-2.0
8 | */
9 |
10 | function isArray(value) {
11 | return !Array.isArray ? getTag(value) === "[object Array]" : Array.isArray(value);
12 | }
13 |
14 | // Adapted from: https://github.com/lodash/lodash/blob/master/.internal/baseToString.js
15 | const INFINITY = 1 / 0;
16 | function baseToString(value) {
17 | // Exit early for strings to avoid a performance hit in some environments.
18 | if (typeof value == "string") {
19 | return value;
20 | }
21 | let result = value + "";
22 | return result == "0" && 1 / value == -INFINITY ? "-0" : result;
23 | }
24 |
25 | function toString(value) {
26 | return value == null ? "" : baseToString(value);
27 | }
28 |
29 | function isString(value) {
30 | return typeof value === "string";
31 | }
32 |
33 | function isNumber(value) {
34 | return typeof value === "number";
35 | }
36 |
37 | // Adapted from: https://github.com/lodash/lodash/blob/master/isBoolean.js
38 | function isBoolean(value) {
39 | return value === true || value === false || (isObjectLike(value) && getTag(value) == "[object Boolean]");
40 | }
41 |
42 | function isObject(value) {
43 | return typeof value === "object";
44 | }
45 |
46 | // Checks if `value` is object-like.
47 | function isObjectLike(value) {
48 | return isObject(value) && value !== null;
49 | }
50 |
51 | function isDefined(value) {
52 | return value !== undefined && value !== null;
53 | }
54 |
55 | function isBlank(value) {
56 | return !value.trim().length;
57 | }
58 |
59 | // Gets the `toStringTag` of `value`.
60 | // Adapted from: https://github.com/lodash/lodash/blob/master/.internal/getTag.js
61 | function getTag(value) {
62 | return value == null
63 | ? value === undefined
64 | ? "[object Undefined]"
65 | : "[object Null]"
66 | : Object.prototype.toString.call(value);
67 | }
68 |
69 | const EXTENDED_SEARCH_UNAVAILABLE = "Extended search is not available";
70 |
71 | const INCORRECT_INDEX_TYPE = "Incorrect 'index' type";
72 |
73 | const LOGICAL_SEARCH_INVALID_QUERY_FOR_KEY = (key) => `Invalid value for key ${key}`;
74 |
75 | const PATTERN_LENGTH_TOO_LARGE = (max) => `Pattern length exceeds max of ${max}.`;
76 |
77 | const MISSING_KEY_PROPERTY = (name) => `Missing ${name} property in key`;
78 |
79 | const INVALID_KEY_WEIGHT_VALUE = (key) => `Property 'weight' in key '${key}' must be a positive integer`;
80 |
81 | const hasOwn = Object.prototype.hasOwnProperty;
82 |
83 | class KeyStore {
84 | constructor(keys) {
85 | this._keys = [];
86 | this._keyMap = {};
87 |
88 | let totalWeight = 0;
89 |
90 | keys.forEach((key) => {
91 | let obj = createKey(key);
92 |
93 | this._keys.push(obj);
94 | this._keyMap[obj.id] = obj;
95 |
96 | totalWeight += obj.weight;
97 | });
98 |
99 | // Normalize weights so that their sum is equal to 1
100 | this._keys.forEach((key) => {
101 | key.weight /= totalWeight;
102 | });
103 | }
104 | get(keyId) {
105 | return this._keyMap[keyId];
106 | }
107 | keys() {
108 | return this._keys;
109 | }
110 | toJSON() {
111 | return JSON.stringify(this._keys);
112 | }
113 | }
114 |
115 | function createKey(key) {
116 | let path = null;
117 | let id = null;
118 | let src = null;
119 | let weight = 1;
120 | let getFn = null;
121 |
122 | if (isString(key) || isArray(key)) {
123 | src = key;
124 | path = createKeyPath(key);
125 | id = createKeyId(key);
126 | } else {
127 | if (!hasOwn.call(key, "name")) {
128 | throw new Error(MISSING_KEY_PROPERTY("name"));
129 | }
130 |
131 | const name = key.name;
132 | src = name;
133 |
134 | if (hasOwn.call(key, "weight")) {
135 | weight = key.weight;
136 |
137 | if (weight <= 0) {
138 | throw new Error(INVALID_KEY_WEIGHT_VALUE(name));
139 | }
140 | }
141 |
142 | path = createKeyPath(name);
143 | id = createKeyId(name);
144 | getFn = key.getFn;
145 | }
146 |
147 | return { path, id, weight, src, getFn };
148 | }
149 |
150 | function createKeyPath(key) {
151 | return isArray(key) ? key : key.split(".");
152 | }
153 |
154 | function createKeyId(key) {
155 | return isArray(key) ? key.join(".") : key;
156 | }
157 |
158 | function get(obj, path) {
159 | let list = [];
160 | let arr = false;
161 |
162 | const deepGet = (obj, path, index) => {
163 | if (!isDefined(obj)) {
164 | return;
165 | }
166 | if (!path[index]) {
167 | // If there's no path left, we've arrived at the object we care about.
168 | list.push(obj);
169 | } else {
170 | let key = path[index];
171 |
172 | const value = obj[key];
173 |
174 | if (!isDefined(value)) {
175 | return;
176 | }
177 |
178 | // If we're at the last value in the path, and if it's a string/number/bool,
179 | // add it to the list
180 | if (index === path.length - 1 && (isString(value) || isNumber(value) || isBoolean(value))) {
181 | list.push(toString(value));
182 | } else if (isArray(value)) {
183 | arr = true;
184 | // Search each item in the array.
185 | for (let i = 0, len = value.length; i < len; i += 1) {
186 | deepGet(value[i], path, index + 1);
187 | }
188 | } else if (path.length) {
189 | // An object. Recurse further.
190 | deepGet(value, path, index + 1);
191 | }
192 | }
193 | };
194 |
195 | // Backwards compatibility (since path used to be a string)
196 | deepGet(obj, isString(path) ? path.split(".") : path, 0);
197 |
198 | return arr ? list : list[0];
199 | }
200 |
201 | const MatchOptions = {
202 | // Whether the matches should be included in the result set. When `true`, each record in the result
203 | // set will include the indices of the matched characters.
204 | // These can consequently be used for highlighting purposes.
205 | includeMatches: false,
206 | // When `true`, the matching function will continue to the end of a search pattern even if
207 | // a perfect match has already been located in the string.
208 | findAllMatches: false,
209 | // Minimum number of characters that must be matched before a result is considered a match
210 | minMatchCharLength: 1,
211 | };
212 |
213 | const BasicOptions = {
214 | // When `true`, the algorithm continues searching to the end of the input even if a perfect
215 | // match is found before the end of the same input.
216 | isCaseSensitive: false,
217 | // When true, the matching function will continue to the end of a search pattern even if
218 | includeScore: false,
219 | // List of properties that will be searched. This also supports nested properties.
220 | keys: [],
221 | // Whether to sort the result list, by score
222 | shouldSort: true,
223 | // Default sort function: sort by ascending score, ascending index
224 | sortFn: (a, b) => (a.score === b.score ? (a.idx < b.idx ? -1 : 1) : a.score < b.score ? -1 : 1),
225 | };
226 |
227 | const FuzzyOptions = {
228 | // Approximately where in the text is the pattern expected to be found?
229 | location: 0,
230 | // At what point does the match algorithm give up. A threshold of '0.0' requires a perfect match
231 | // (of both letters and location), a threshold of '1.0' would match anything.
232 | threshold: 0.6,
233 | // Determines how close the match must be to the fuzzy location (specified above).
234 | // An exact letter match which is 'distance' characters away from the fuzzy location
235 | // would score as a complete mismatch. A distance of '0' requires the match be at
236 | // the exact location specified, a threshold of '1000' would require a perfect match
237 | // to be within 800 characters of the fuzzy location to be found using a 0.8 threshold.
238 | distance: 100,
239 | };
240 |
241 | const AdvancedOptions = {
242 | // When `true`, it enables the use of unix-like search commands
243 | useExtendedSearch: false,
244 | // The get function to use when fetching an object's properties.
245 | // The default will search nested paths *ie foo.bar.baz*
246 | getFn: get,
247 | // When `true`, search will ignore `location` and `distance`, so it won't matter
248 | // where in the string the pattern appears.
249 | // More info: https://fusejs.io/concepts/scoring-theory.html#fuzziness-score
250 | ignoreLocation: false,
251 | // When `true`, the calculation for the relevance score (used for sorting) will
252 | // ignore the field-length norm.
253 | // More info: https://fusejs.io/concepts/scoring-theory.html#field-length-norm
254 | ignoreFieldNorm: false,
255 | // The weight to determine how much field length norm effects scoring.
256 | fieldNormWeight: 1,
257 | };
258 |
259 | var Config = {
260 | ...BasicOptions,
261 | ...MatchOptions,
262 | ...FuzzyOptions,
263 | ...AdvancedOptions,
264 | };
265 |
266 | const SPACE = /[^ ]+/g;
267 |
268 | // Field-length norm: the shorter the field, the higher the weight.
269 | // Set to 3 decimals to reduce index size.
270 | function norm(weight = 1, mantissa = 3) {
271 | const cache = new Map();
272 | const m = Math.pow(10, mantissa);
273 |
274 | return {
275 | get(value) {
276 | const numTokens = value.match(SPACE).length;
277 |
278 | if (cache.has(numTokens)) {
279 | return cache.get(numTokens);
280 | }
281 |
282 | // Default function is 1/sqrt(x), weight makes that variable
283 | const norm = 1 / Math.pow(numTokens, 0.5 * weight);
284 |
285 | // In place of `toFixed(mantissa)`, for faster computation
286 | const n = parseFloat(Math.round(norm * m) / m);
287 |
288 | cache.set(numTokens, n);
289 |
290 | return n;
291 | },
292 | clear() {
293 | cache.clear();
294 | },
295 | };
296 | }
297 |
298 | class FuseIndex {
299 | constructor({ getFn = Config.getFn, fieldNormWeight = Config.fieldNormWeight } = {}) {
300 | this.norm = norm(fieldNormWeight, 3);
301 | this.getFn = getFn;
302 | this.isCreated = false;
303 |
304 | this.setIndexRecords();
305 | }
306 | setSources(docs = []) {
307 | this.docs = docs;
308 | }
309 | setIndexRecords(records = []) {
310 | this.records = records;
311 | }
312 | setKeys(keys = []) {
313 | this.keys = keys;
314 | this._keysMap = {};
315 | keys.forEach((key, idx) => {
316 | this._keysMap[key.id] = idx;
317 | });
318 | }
319 | create() {
320 | if (this.isCreated || !this.docs.length) {
321 | return;
322 | }
323 |
324 | this.isCreated = true;
325 |
326 | // List is Array
327 | if (isString(this.docs[0])) {
328 | this.docs.forEach((doc, docIndex) => {
329 | this._addString(doc, docIndex);
330 | });
331 | } else {
332 | // List is Array
333 | this.docs.forEach((doc, docIndex) => {
334 | this._addObject(doc, docIndex);
335 | });
336 | }
337 |
338 | this.norm.clear();
339 | }
340 | // Adds a doc to the end of the index
341 | add(doc) {
342 | const idx = this.size();
343 |
344 | if (isString(doc)) {
345 | this._addString(doc, idx);
346 | } else {
347 | this._addObject(doc, idx);
348 | }
349 | }
350 | // Removes the doc at the specified index of the index
351 | removeAt(idx) {
352 | this.records.splice(idx, 1);
353 |
354 | // Change ref index of every subsquent doc
355 | for (let i = idx, len = this.size(); i < len; i += 1) {
356 | this.records[i].i -= 1;
357 | }
358 | }
359 | getValueForItemAtKeyId(item, keyId) {
360 | return item[this._keysMap[keyId]];
361 | }
362 | size() {
363 | return this.records.length;
364 | }
365 | _addString(doc, docIndex) {
366 | if (!isDefined(doc) || isBlank(doc)) {
367 | return;
368 | }
369 |
370 | let record = {
371 | v: doc,
372 | i: docIndex,
373 | n: this.norm.get(doc),
374 | };
375 |
376 | this.records.push(record);
377 | }
378 | _addObject(doc, docIndex) {
379 | let record = { i: docIndex, $: {} };
380 |
381 | // Iterate over every key (i.e, path), and fetch the value at that key
382 | this.keys.forEach((key, keyIndex) => {
383 | let value = key.getFn ? key.getFn(doc) : this.getFn(doc, key.path);
384 |
385 | if (!isDefined(value)) {
386 | return;
387 | }
388 |
389 | if (isArray(value)) {
390 | let subRecords = [];
391 | const stack = [{ nestedArrIndex: -1, value }];
392 |
393 | while (stack.length) {
394 | const { nestedArrIndex, value } = stack.pop();
395 |
396 | if (!isDefined(value)) {
397 | continue;
398 | }
399 |
400 | if (isString(value) && !isBlank(value)) {
401 | let subRecord = {
402 | v: value,
403 | i: nestedArrIndex,
404 | n: this.norm.get(value),
405 | };
406 |
407 | subRecords.push(subRecord);
408 | } else if (isArray(value)) {
409 | value.forEach((item, k) => {
410 | stack.push({
411 | nestedArrIndex: k,
412 | value: item,
413 | });
414 | });
415 | } else;
416 | }
417 | record.$[keyIndex] = subRecords;
418 | } else if (isString(value) && !isBlank(value)) {
419 | let subRecord = {
420 | v: value,
421 | n: this.norm.get(value),
422 | };
423 |
424 | record.$[keyIndex] = subRecord;
425 | }
426 | });
427 |
428 | this.records.push(record);
429 | }
430 | toJSON() {
431 | return {
432 | keys: this.keys,
433 | records: this.records,
434 | };
435 | }
436 | }
437 |
438 | function createIndex(keys, docs, { getFn = Config.getFn, fieldNormWeight = Config.fieldNormWeight } = {}) {
439 | const myIndex = new FuseIndex({ getFn, fieldNormWeight });
440 | myIndex.setKeys(keys.map(createKey));
441 | myIndex.setSources(docs);
442 | myIndex.create();
443 | return myIndex;
444 | }
445 |
446 | function parseIndex(data, { getFn = Config.getFn, fieldNormWeight = Config.fieldNormWeight } = {}) {
447 | const { keys, records } = data;
448 | const myIndex = new FuseIndex({ getFn, fieldNormWeight });
449 | myIndex.setKeys(keys);
450 | myIndex.setIndexRecords(records);
451 | return myIndex;
452 | }
453 |
454 | function computeScore$1(
455 | pattern,
456 | {
457 | errors = 0,
458 | currentLocation = 0,
459 | expectedLocation = 0,
460 | distance = Config.distance,
461 | ignoreLocation = Config.ignoreLocation,
462 | } = {}
463 | ) {
464 | const accuracy = errors / pattern.length;
465 |
466 | if (ignoreLocation) {
467 | return accuracy;
468 | }
469 |
470 | const proximity = Math.abs(expectedLocation - currentLocation);
471 |
472 | if (!distance) {
473 | // Dodge divide by zero error.
474 | return proximity ? 1.0 : accuracy;
475 | }
476 |
477 | return accuracy + proximity / distance;
478 | }
479 |
480 | function convertMaskToIndices(matchmask = [], minMatchCharLength = Config.minMatchCharLength) {
481 | let indices = [];
482 | let start = -1;
483 | let end = -1;
484 | let i = 0;
485 |
486 | for (let len = matchmask.length; i < len; i += 1) {
487 | let match = matchmask[i];
488 | if (match && start === -1) {
489 | start = i;
490 | } else if (!match && start !== -1) {
491 | end = i - 1;
492 | if (end - start + 1 >= minMatchCharLength) {
493 | indices.push([start, end]);
494 | }
495 | start = -1;
496 | }
497 | }
498 |
499 | // (i-1 - start) + 1 => i - start
500 | if (matchmask[i - 1] && i - start >= minMatchCharLength) {
501 | indices.push([start, i - 1]);
502 | }
503 |
504 | return indices;
505 | }
506 |
507 | // Machine word size
508 | const MAX_BITS = 32;
509 |
510 | function search(
511 | text,
512 | pattern,
513 | patternAlphabet,
514 | {
515 | location = Config.location,
516 | distance = Config.distance,
517 | threshold = Config.threshold,
518 | findAllMatches = Config.findAllMatches,
519 | minMatchCharLength = Config.minMatchCharLength,
520 | includeMatches = Config.includeMatches,
521 | ignoreLocation = Config.ignoreLocation,
522 | } = {}
523 | ) {
524 | if (pattern.length > MAX_BITS) {
525 | throw new Error(PATTERN_LENGTH_TOO_LARGE(MAX_BITS));
526 | }
527 |
528 | const patternLen = pattern.length;
529 | // Set starting location at beginning text and initialize the alphabet.
530 | const textLen = text.length;
531 | // Handle the case when location > text.length
532 | const expectedLocation = Math.max(0, Math.min(location, textLen));
533 | // Highest score beyond which we give up.
534 | let currentThreshold = threshold;
535 | // Is there a nearby exact match? (speedup)
536 | let bestLocation = expectedLocation;
537 |
538 | // Performance: only computer matches when the minMatchCharLength > 1
539 | // OR if `includeMatches` is true.
540 | const computeMatches = minMatchCharLength > 1 || includeMatches;
541 | // A mask of the matches, used for building the indices
542 | const matchMask = computeMatches ? Array(textLen) : [];
543 |
544 | let index;
545 |
546 | // Get all exact matches, here for speed up
547 | while ((index = text.indexOf(pattern, bestLocation)) > -1) {
548 | let score = computeScore$1(pattern, {
549 | currentLocation: index,
550 | expectedLocation,
551 | distance,
552 | ignoreLocation,
553 | });
554 |
555 | currentThreshold = Math.min(score, currentThreshold);
556 | bestLocation = index + patternLen;
557 |
558 | if (computeMatches) {
559 | let i = 0;
560 | while (i < patternLen) {
561 | matchMask[index + i] = 1;
562 | i += 1;
563 | }
564 | }
565 | }
566 |
567 | // Reset the best location
568 | bestLocation = -1;
569 |
570 | let lastBitArr = [];
571 | let finalScore = 1;
572 | let binMax = patternLen + textLen;
573 |
574 | const mask = 1 << (patternLen - 1);
575 |
576 | for (let i = 0; i < patternLen; i += 1) {
577 | // Scan for the best match; each iteration allows for one more error.
578 | // Run a binary search to determine how far from the match location we can stray
579 | // at this error level.
580 | let binMin = 0;
581 | let binMid = binMax;
582 |
583 | while (binMin < binMid) {
584 | const score = computeScore$1(pattern, {
585 | errors: i,
586 | currentLocation: expectedLocation + binMid,
587 | expectedLocation,
588 | distance,
589 | ignoreLocation,
590 | });
591 |
592 | if (score <= currentThreshold) {
593 | binMin = binMid;
594 | } else {
595 | binMax = binMid;
596 | }
597 |
598 | binMid = Math.floor((binMax - binMin) / 2 + binMin);
599 | }
600 |
601 | // Use the result from this iteration as the maximum for the next.
602 | binMax = binMid;
603 |
604 | let start = Math.max(1, expectedLocation - binMid + 1);
605 | let finish = findAllMatches ? textLen : Math.min(expectedLocation + binMid, textLen) + patternLen;
606 |
607 | // Initialize the bit array
608 | let bitArr = Array(finish + 2);
609 |
610 | bitArr[finish + 1] = (1 << i) - 1;
611 |
612 | for (let j = finish; j >= start; j -= 1) {
613 | let currentLocation = j - 1;
614 | let charMatch = patternAlphabet[text.charAt(currentLocation)];
615 |
616 | if (computeMatches) {
617 | // Speed up: quick bool to int conversion (i.e, `charMatch ? 1 : 0`)
618 | matchMask[currentLocation] = +!!charMatch;
619 | }
620 |
621 | // First pass: exact match
622 | bitArr[j] = ((bitArr[j + 1] << 1) | 1) & charMatch;
623 |
624 | // Subsequent passes: fuzzy match
625 | if (i) {
626 | bitArr[j] |= ((lastBitArr[j + 1] | lastBitArr[j]) << 1) | 1 | lastBitArr[j + 1];
627 | }
628 |
629 | if (bitArr[j] & mask) {
630 | finalScore = computeScore$1(pattern, {
631 | errors: i,
632 | currentLocation,
633 | expectedLocation,
634 | distance,
635 | ignoreLocation,
636 | });
637 |
638 | // This match will almost certainly be better than any existing match.
639 | // But check anyway.
640 | if (finalScore <= currentThreshold) {
641 | // Indeed it is
642 | currentThreshold = finalScore;
643 | bestLocation = currentLocation;
644 |
645 | // Already passed `loc`, downhill from here on in.
646 | if (bestLocation <= expectedLocation) {
647 | break;
648 | }
649 |
650 | // When passing `bestLocation`, don't exceed our current distance from `expectedLocation`.
651 | start = Math.max(1, 2 * expectedLocation - bestLocation);
652 | }
653 | }
654 | }
655 |
656 | // No hope for a (better) match at greater error levels.
657 | const score = computeScore$1(pattern, {
658 | errors: i + 1,
659 | currentLocation: expectedLocation,
660 | expectedLocation,
661 | distance,
662 | ignoreLocation,
663 | });
664 |
665 | if (score > currentThreshold) {
666 | break;
667 | }
668 |
669 | lastBitArr = bitArr;
670 | }
671 |
672 | const result = {
673 | isMatch: bestLocation >= 0,
674 | // Count exact matches (those with a score of 0) to be "almost" exact
675 | score: Math.max(0.001, finalScore),
676 | };
677 |
678 | if (computeMatches) {
679 | const indices = convertMaskToIndices(matchMask, minMatchCharLength);
680 | if (!indices.length) {
681 | result.isMatch = false;
682 | } else if (includeMatches) {
683 | result.indices = indices;
684 | }
685 | }
686 |
687 | return result;
688 | }
689 |
690 | function createPatternAlphabet(pattern) {
691 | let mask = {};
692 |
693 | for (let i = 0, len = pattern.length; i < len; i += 1) {
694 | const char = pattern.charAt(i);
695 | mask[char] = (mask[char] || 0) | (1 << (len - i - 1));
696 | }
697 |
698 | return mask;
699 | }
700 |
701 | class BitapSearch {
702 | constructor(
703 | pattern,
704 | {
705 | location = Config.location,
706 | threshold = Config.threshold,
707 | distance = Config.distance,
708 | includeMatches = Config.includeMatches,
709 | findAllMatches = Config.findAllMatches,
710 | minMatchCharLength = Config.minMatchCharLength,
711 | isCaseSensitive = Config.isCaseSensitive,
712 | ignoreLocation = Config.ignoreLocation,
713 | } = {}
714 | ) {
715 | this.options = {
716 | location,
717 | threshold,
718 | distance,
719 | includeMatches,
720 | findAllMatches,
721 | minMatchCharLength,
722 | isCaseSensitive,
723 | ignoreLocation,
724 | };
725 |
726 | this.pattern = isCaseSensitive ? pattern : pattern.toLowerCase();
727 |
728 | this.chunks = [];
729 |
730 | if (!this.pattern.length) {
731 | return;
732 | }
733 |
734 | const addChunk = (pattern, startIndex) => {
735 | this.chunks.push({
736 | pattern,
737 | alphabet: createPatternAlphabet(pattern),
738 | startIndex,
739 | });
740 | };
741 |
742 | const len = this.pattern.length;
743 |
744 | if (len > MAX_BITS) {
745 | let i = 0;
746 | const remainder = len % MAX_BITS;
747 | const end = len - remainder;
748 |
749 | while (i < end) {
750 | addChunk(this.pattern.substr(i, MAX_BITS), i);
751 | i += MAX_BITS;
752 | }
753 |
754 | if (remainder) {
755 | const startIndex = len - MAX_BITS;
756 | addChunk(this.pattern.substr(startIndex), startIndex);
757 | }
758 | } else {
759 | addChunk(this.pattern, 0);
760 | }
761 | }
762 |
763 | searchIn(text) {
764 | const { isCaseSensitive, includeMatches } = this.options;
765 |
766 | if (!isCaseSensitive) {
767 | text = text.toLowerCase();
768 | }
769 |
770 | // Exact match
771 | if (this.pattern === text) {
772 | let result = {
773 | isMatch: true,
774 | score: 0,
775 | };
776 |
777 | if (includeMatches) {
778 | result.indices = [[0, text.length - 1]];
779 | }
780 |
781 | return result;
782 | }
783 |
784 | // Otherwise, use Bitap algorithm
785 | const { location, distance, threshold, findAllMatches, minMatchCharLength, ignoreLocation } = this.options;
786 |
787 | let allIndices = [];
788 | let totalScore = 0;
789 | let hasMatches = false;
790 |
791 | this.chunks.forEach(({ pattern, alphabet, startIndex }) => {
792 | const { isMatch, score, indices } = search(text, pattern, alphabet, {
793 | location: location + startIndex,
794 | distance,
795 | threshold,
796 | findAllMatches,
797 | minMatchCharLength,
798 | includeMatches,
799 | ignoreLocation,
800 | });
801 |
802 | if (isMatch) {
803 | hasMatches = true;
804 | }
805 |
806 | totalScore += score;
807 |
808 | if (isMatch && indices) {
809 | allIndices = [...allIndices, ...indices];
810 | }
811 | });
812 |
813 | let result = {
814 | isMatch: hasMatches,
815 | score: hasMatches ? totalScore / this.chunks.length : 1,
816 | };
817 |
818 | if (hasMatches && includeMatches) {
819 | result.indices = allIndices;
820 | }
821 |
822 | return result;
823 | }
824 | }
825 |
826 | class BaseMatch {
827 | constructor(pattern) {
828 | this.pattern = pattern;
829 | }
830 | static isMultiMatch(pattern) {
831 | return getMatch(pattern, this.multiRegex);
832 | }
833 | static isSingleMatch(pattern) {
834 | return getMatch(pattern, this.singleRegex);
835 | }
836 | search(/*text*/) {}
837 | }
838 |
839 | function getMatch(pattern, exp) {
840 | const matches = pattern.match(exp);
841 | return matches ? matches[1] : null;
842 | }
843 |
844 | // Token: 'file
845 |
846 | class ExactMatch extends BaseMatch {
847 | constructor(pattern) {
848 | super(pattern);
849 | }
850 | static get type() {
851 | return "exact";
852 | }
853 | static get multiRegex() {
854 | return /^="(.*)"$/;
855 | }
856 | static get singleRegex() {
857 | return /^=(.*)$/;
858 | }
859 | search(text) {
860 | const isMatch = text === this.pattern;
861 |
862 | return {
863 | isMatch,
864 | score: isMatch ? 0 : 1,
865 | indices: [0, this.pattern.length - 1],
866 | };
867 | }
868 | }
869 |
870 | // Token: !fire
871 |
872 | class InverseExactMatch extends BaseMatch {
873 | constructor(pattern) {
874 | super(pattern);
875 | }
876 | static get type() {
877 | return "inverse-exact";
878 | }
879 | static get multiRegex() {
880 | return /^!"(.*)"$/;
881 | }
882 | static get singleRegex() {
883 | return /^!(.*)$/;
884 | }
885 | search(text) {
886 | const index = text.indexOf(this.pattern);
887 | const isMatch = index === -1;
888 |
889 | return {
890 | isMatch,
891 | score: isMatch ? 0 : 1,
892 | indices: [0, text.length - 1],
893 | };
894 | }
895 | }
896 |
897 | // Token: ^file
898 |
899 | class PrefixExactMatch extends BaseMatch {
900 | constructor(pattern) {
901 | super(pattern);
902 | }
903 | static get type() {
904 | return "prefix-exact";
905 | }
906 | static get multiRegex() {
907 | return /^\^"(.*)"$/;
908 | }
909 | static get singleRegex() {
910 | return /^\^(.*)$/;
911 | }
912 | search(text) {
913 | const isMatch = text.startsWith(this.pattern);
914 |
915 | return {
916 | isMatch,
917 | score: isMatch ? 0 : 1,
918 | indices: [0, this.pattern.length - 1],
919 | };
920 | }
921 | }
922 |
923 | // Token: !^fire
924 |
925 | class InversePrefixExactMatch extends BaseMatch {
926 | constructor(pattern) {
927 | super(pattern);
928 | }
929 | static get type() {
930 | return "inverse-prefix-exact";
931 | }
932 | static get multiRegex() {
933 | return /^!\^"(.*)"$/;
934 | }
935 | static get singleRegex() {
936 | return /^!\^(.*)$/;
937 | }
938 | search(text) {
939 | const isMatch = !text.startsWith(this.pattern);
940 |
941 | return {
942 | isMatch,
943 | score: isMatch ? 0 : 1,
944 | indices: [0, text.length - 1],
945 | };
946 | }
947 | }
948 |
949 | // Token: .file$
950 |
951 | class SuffixExactMatch extends BaseMatch {
952 | constructor(pattern) {
953 | super(pattern);
954 | }
955 | static get type() {
956 | return "suffix-exact";
957 | }
958 | static get multiRegex() {
959 | return /^"(.*)"\$$/;
960 | }
961 | static get singleRegex() {
962 | return /^(.*)\$$/;
963 | }
964 | search(text) {
965 | const isMatch = text.endsWith(this.pattern);
966 |
967 | return {
968 | isMatch,
969 | score: isMatch ? 0 : 1,
970 | indices: [text.length - this.pattern.length, text.length - 1],
971 | };
972 | }
973 | }
974 |
975 | // Token: !.file$
976 |
977 | class InverseSuffixExactMatch extends BaseMatch {
978 | constructor(pattern) {
979 | super(pattern);
980 | }
981 | static get type() {
982 | return "inverse-suffix-exact";
983 | }
984 | static get multiRegex() {
985 | return /^!"(.*)"\$$/;
986 | }
987 | static get singleRegex() {
988 | return /^!(.*)\$$/;
989 | }
990 | search(text) {
991 | const isMatch = !text.endsWith(this.pattern);
992 | return {
993 | isMatch,
994 | score: isMatch ? 0 : 1,
995 | indices: [0, text.length - 1],
996 | };
997 | }
998 | }
999 |
1000 | class FuzzyMatch extends BaseMatch {
1001 | constructor(
1002 | pattern,
1003 | {
1004 | location = Config.location,
1005 | threshold = Config.threshold,
1006 | distance = Config.distance,
1007 | includeMatches = Config.includeMatches,
1008 | findAllMatches = Config.findAllMatches,
1009 | minMatchCharLength = Config.minMatchCharLength,
1010 | isCaseSensitive = Config.isCaseSensitive,
1011 | ignoreLocation = Config.ignoreLocation,
1012 | } = {}
1013 | ) {
1014 | super(pattern);
1015 | this._bitapSearch = new BitapSearch(pattern, {
1016 | location,
1017 | threshold,
1018 | distance,
1019 | includeMatches,
1020 | findAllMatches,
1021 | minMatchCharLength,
1022 | isCaseSensitive,
1023 | ignoreLocation,
1024 | });
1025 | }
1026 | static get type() {
1027 | return "fuzzy";
1028 | }
1029 | static get multiRegex() {
1030 | return /^"(.*)"$/;
1031 | }
1032 | static get singleRegex() {
1033 | return /^(.*)$/;
1034 | }
1035 | search(text) {
1036 | return this._bitapSearch.searchIn(text);
1037 | }
1038 | }
1039 |
1040 | // Token: 'file
1041 |
1042 | class IncludeMatch extends BaseMatch {
1043 | constructor(pattern) {
1044 | super(pattern);
1045 | }
1046 | static get type() {
1047 | return "include";
1048 | }
1049 | static get multiRegex() {
1050 | return /^'"(.*)"$/;
1051 | }
1052 | static get singleRegex() {
1053 | return /^'(.*)$/;
1054 | }
1055 | search(text) {
1056 | let location = 0;
1057 | let index;
1058 |
1059 | const indices = [];
1060 | const patternLen = this.pattern.length;
1061 |
1062 | // Get all exact matches
1063 | while ((index = text.indexOf(this.pattern, location)) > -1) {
1064 | location = index + patternLen;
1065 | indices.push([index, location - 1]);
1066 | }
1067 |
1068 | const isMatch = !!indices.length;
1069 |
1070 | return {
1071 | isMatch,
1072 | score: isMatch ? 0 : 1,
1073 | indices,
1074 | };
1075 | }
1076 | }
1077 |
1078 | // ❗Order is important. DO NOT CHANGE.
1079 | const searchers = [
1080 | ExactMatch,
1081 | IncludeMatch,
1082 | PrefixExactMatch,
1083 | InversePrefixExactMatch,
1084 | InverseSuffixExactMatch,
1085 | SuffixExactMatch,
1086 | InverseExactMatch,
1087 | FuzzyMatch,
1088 | ];
1089 |
1090 | const searchersLen = searchers.length;
1091 |
1092 | // Regex to split by spaces, but keep anything in quotes together
1093 | const SPACE_RE = / +(?=(?:[^\"]*\"[^\"]*\")*[^\"]*$)/;
1094 | const OR_TOKEN = "|";
1095 |
1096 | // Return a 2D array representation of the query, for simpler parsing.
1097 | // Example:
1098 | // "^core go$ | rb$ | py$ xy$" => [["^core", "go$"], ["rb$"], ["py$", "xy$"]]
1099 | function parseQuery(pattern, options = {}) {
1100 | return pattern.split(OR_TOKEN).map((item) => {
1101 | let query = item
1102 | .trim()
1103 | .split(SPACE_RE)
1104 | .filter((item) => item && !!item.trim());
1105 |
1106 | let results = [];
1107 | for (let i = 0, len = query.length; i < len; i += 1) {
1108 | const queryItem = query[i];
1109 |
1110 | // 1. Handle multiple query match (i.e, once that are quoted, like `"hello world"`)
1111 | let found = false;
1112 | let idx = -1;
1113 | while (!found && ++idx < searchersLen) {
1114 | const searcher = searchers[idx];
1115 | let token = searcher.isMultiMatch(queryItem);
1116 | if (token) {
1117 | results.push(new searcher(token, options));
1118 | found = true;
1119 | }
1120 | }
1121 |
1122 | if (found) {
1123 | continue;
1124 | }
1125 |
1126 | // 2. Handle single query matches (i.e, once that are *not* quoted)
1127 | idx = -1;
1128 | while (++idx < searchersLen) {
1129 | const searcher = searchers[idx];
1130 | let token = searcher.isSingleMatch(queryItem);
1131 | if (token) {
1132 | results.push(new searcher(token, options));
1133 | break;
1134 | }
1135 | }
1136 | }
1137 |
1138 | return results;
1139 | });
1140 | }
1141 |
1142 | // These extended matchers can return an array of matches, as opposed
1143 | // to a singl match
1144 | const MultiMatchSet = new Set([FuzzyMatch.type, IncludeMatch.type]);
1145 |
1146 | /**
1147 | * Command-like searching
1148 | * ======================
1149 | *
1150 | * Given multiple search terms delimited by spaces.e.g. `^jscript .python$ ruby !java`,
1151 | * search in a given text.
1152 | *
1153 | * Search syntax:
1154 | *
1155 | * | Token | Match type | Description |
1156 | * | ----------- | -------------------------- | -------------------------------------- |
1157 | * | `jscript` | fuzzy-match | Items that fuzzy match `jscript` |
1158 | * | `=scheme` | exact-match | Items that are `scheme` |
1159 | * | `'python` | include-match | Items that include `python` |
1160 | * | `!ruby` | inverse-exact-match | Items that do not include `ruby` |
1161 | * | `^java` | prefix-exact-match | Items that start with `java` |
1162 | * | `!^earlang` | inverse-prefix-exact-match | Items that do not start with `earlang` |
1163 | * | `.js$` | suffix-exact-match | Items that end with `.js` |
1164 | * | `!.go$` | inverse-suffix-exact-match | Items that do not end with `.go` |
1165 | *
1166 | * A single pipe character acts as an OR operator. For example, the following
1167 | * query matches entries that start with `core` and end with either`go`, `rb`,
1168 | * or`py`.
1169 | *
1170 | * ```
1171 | * ^core go$ | rb$ | py$
1172 | * ```
1173 | */
1174 | class ExtendedSearch {
1175 | constructor(
1176 | pattern,
1177 | {
1178 | isCaseSensitive = Config.isCaseSensitive,
1179 | includeMatches = Config.includeMatches,
1180 | minMatchCharLength = Config.minMatchCharLength,
1181 | ignoreLocation = Config.ignoreLocation,
1182 | findAllMatches = Config.findAllMatches,
1183 | location = Config.location,
1184 | threshold = Config.threshold,
1185 | distance = Config.distance,
1186 | } = {}
1187 | ) {
1188 | this.query = null;
1189 | this.options = {
1190 | isCaseSensitive,
1191 | includeMatches,
1192 | minMatchCharLength,
1193 | findAllMatches,
1194 | ignoreLocation,
1195 | location,
1196 | threshold,
1197 | distance,
1198 | };
1199 |
1200 | this.pattern = isCaseSensitive ? pattern : pattern.toLowerCase();
1201 | this.query = parseQuery(this.pattern, this.options);
1202 | }
1203 |
1204 | static condition(_, options) {
1205 | return options.useExtendedSearch;
1206 | }
1207 |
1208 | searchIn(text) {
1209 | const query = this.query;
1210 |
1211 | if (!query) {
1212 | return {
1213 | isMatch: false,
1214 | score: 1,
1215 | };
1216 | }
1217 |
1218 | const { includeMatches, isCaseSensitive } = this.options;
1219 |
1220 | text = isCaseSensitive ? text : text.toLowerCase();
1221 |
1222 | let numMatches = 0;
1223 | let allIndices = [];
1224 | let totalScore = 0;
1225 |
1226 | // ORs
1227 | for (let i = 0, qLen = query.length; i < qLen; i += 1) {
1228 | const searchers = query[i];
1229 |
1230 | // Reset indices
1231 | allIndices.length = 0;
1232 | numMatches = 0;
1233 |
1234 | // ANDs
1235 | for (let j = 0, pLen = searchers.length; j < pLen; j += 1) {
1236 | const searcher = searchers[j];
1237 | const { isMatch, indices, score } = searcher.search(text);
1238 |
1239 | if (isMatch) {
1240 | numMatches += 1;
1241 | totalScore += score;
1242 | if (includeMatches) {
1243 | const type = searcher.constructor.type;
1244 | if (MultiMatchSet.has(type)) {
1245 | allIndices = [...allIndices, ...indices];
1246 | } else {
1247 | allIndices.push(indices);
1248 | }
1249 | }
1250 | } else {
1251 | totalScore = 0;
1252 | numMatches = 0;
1253 | allIndices.length = 0;
1254 | break;
1255 | }
1256 | }
1257 |
1258 | // OR condition, so if TRUE, return
1259 | if (numMatches) {
1260 | let result = {
1261 | isMatch: true,
1262 | score: totalScore / numMatches,
1263 | };
1264 |
1265 | if (includeMatches) {
1266 | result.indices = allIndices;
1267 | }
1268 |
1269 | return result;
1270 | }
1271 | }
1272 |
1273 | // Nothing was matched
1274 | return {
1275 | isMatch: false,
1276 | score: 1,
1277 | };
1278 | }
1279 | }
1280 |
1281 | const registeredSearchers = [];
1282 |
1283 | function register(...args) {
1284 | registeredSearchers.push(...args);
1285 | }
1286 |
1287 | function createSearcher(pattern, options) {
1288 | for (let i = 0, len = registeredSearchers.length; i < len; i += 1) {
1289 | let searcherClass = registeredSearchers[i];
1290 | if (searcherClass.condition(pattern, options)) {
1291 | return new searcherClass(pattern, options);
1292 | }
1293 | }
1294 |
1295 | return new BitapSearch(pattern, options);
1296 | }
1297 |
1298 | const LogicalOperator = {
1299 | AND: "$and",
1300 | OR: "$or",
1301 | };
1302 |
1303 | const KeyType = {
1304 | PATH: "$path",
1305 | PATTERN: "$val",
1306 | };
1307 |
1308 | const isExpression = (query) => !!(query[LogicalOperator.AND] || query[LogicalOperator.OR]);
1309 |
1310 | const isPath = (query) => !!query[KeyType.PATH];
1311 |
1312 | const isLeaf = (query) => !isArray(query) && isObject(query) && !isExpression(query);
1313 |
1314 | const convertToExplicit = (query) => ({
1315 | [LogicalOperator.AND]: Object.keys(query).map((key) => ({
1316 | [key]: query[key],
1317 | })),
1318 | });
1319 |
1320 | // When `auto` is `true`, the parse function will infer and initialize and add
1321 | // the appropriate `Searcher` instance
1322 | function parse(query, options, { auto = true } = {}) {
1323 | const next = (query) => {
1324 | let keys = Object.keys(query);
1325 |
1326 | const isQueryPath = isPath(query);
1327 |
1328 | if (!isQueryPath && keys.length > 1 && !isExpression(query)) {
1329 | return next(convertToExplicit(query));
1330 | }
1331 |
1332 | if (isLeaf(query)) {
1333 | const key = isQueryPath ? query[KeyType.PATH] : keys[0];
1334 |
1335 | const pattern = isQueryPath ? query[KeyType.PATTERN] : query[key];
1336 |
1337 | if (!isString(pattern)) {
1338 | throw new Error(LOGICAL_SEARCH_INVALID_QUERY_FOR_KEY(key));
1339 | }
1340 |
1341 | const obj = {
1342 | keyId: createKeyId(key),
1343 | pattern,
1344 | };
1345 |
1346 | if (auto) {
1347 | obj.searcher = createSearcher(pattern, options);
1348 | }
1349 |
1350 | return obj;
1351 | }
1352 |
1353 | let node = {
1354 | children: [],
1355 | operator: keys[0],
1356 | };
1357 |
1358 | keys.forEach((key) => {
1359 | const value = query[key];
1360 |
1361 | if (isArray(value)) {
1362 | value.forEach((item) => {
1363 | node.children.push(next(item));
1364 | });
1365 | }
1366 | });
1367 |
1368 | return node;
1369 | };
1370 |
1371 | if (!isExpression(query)) {
1372 | query = convertToExplicit(query);
1373 | }
1374 |
1375 | return next(query);
1376 | }
1377 |
1378 | // Practical scoring function
1379 | function computeScore(results, { ignoreFieldNorm = Config.ignoreFieldNorm }) {
1380 | results.forEach((result) => {
1381 | let totalScore = 1;
1382 |
1383 | result.matches.forEach(({ key, norm, score }) => {
1384 | const weight = key ? key.weight : null;
1385 |
1386 | totalScore *= Math.pow(
1387 | score === 0 && weight ? Number.EPSILON : score,
1388 | (weight || 1) * (ignoreFieldNorm ? 1 : norm)
1389 | );
1390 | });
1391 |
1392 | result.score = totalScore;
1393 | });
1394 | }
1395 |
1396 | function transformMatches(result, data) {
1397 | const matches = result.matches;
1398 | data.matches = [];
1399 |
1400 | if (!isDefined(matches)) {
1401 | return;
1402 | }
1403 |
1404 | matches.forEach((match) => {
1405 | if (!isDefined(match.indices) || !match.indices.length) {
1406 | return;
1407 | }
1408 |
1409 | const { indices, value } = match;
1410 |
1411 | let obj = {
1412 | indices,
1413 | value,
1414 | };
1415 |
1416 | if (match.key) {
1417 | obj.key = match.key.src;
1418 | }
1419 |
1420 | if (match.idx > -1) {
1421 | obj.refIndex = match.idx;
1422 | }
1423 |
1424 | data.matches.push(obj);
1425 | });
1426 | }
1427 |
1428 | function transformScore(result, data) {
1429 | data.score = result.score;
1430 | }
1431 |
1432 | function format(results, docs, { includeMatches = Config.includeMatches, includeScore = Config.includeScore } = {}) {
1433 | const transformers = [];
1434 |
1435 | if (includeMatches) transformers.push(transformMatches);
1436 | if (includeScore) transformers.push(transformScore);
1437 |
1438 | return results.map((result) => {
1439 | const { idx } = result;
1440 |
1441 | const data = {
1442 | item: docs[idx],
1443 | refIndex: idx,
1444 | };
1445 |
1446 | if (transformers.length) {
1447 | transformers.forEach((transformer) => {
1448 | transformer(result, data);
1449 | });
1450 | }
1451 |
1452 | return data;
1453 | });
1454 | }
1455 |
1456 | class Fuse {
1457 | constructor(docs, options = {}, index) {
1458 | this.options = { ...Config, ...options };
1459 |
1460 | if (this.options.useExtendedSearch && !true) {
1461 | throw new Error(EXTENDED_SEARCH_UNAVAILABLE);
1462 | }
1463 |
1464 | this._keyStore = new KeyStore(this.options.keys);
1465 |
1466 | this.setCollection(docs, index);
1467 | }
1468 |
1469 | setCollection(docs, index) {
1470 | this._docs = docs;
1471 |
1472 | if (index && !(index instanceof FuseIndex)) {
1473 | throw new Error(INCORRECT_INDEX_TYPE);
1474 | }
1475 |
1476 | this._myIndex =
1477 | index ||
1478 | createIndex(this.options.keys, this._docs, {
1479 | getFn: this.options.getFn,
1480 | fieldNormWeight: this.options.fieldNormWeight,
1481 | });
1482 | }
1483 |
1484 | add(doc) {
1485 | if (!isDefined(doc)) {
1486 | return;
1487 | }
1488 |
1489 | this._docs.push(doc);
1490 | this._myIndex.add(doc);
1491 | }
1492 |
1493 | remove(predicate = (/* doc, idx */) => false) {
1494 | const results = [];
1495 |
1496 | for (let i = 0, len = this._docs.length; i < len; i += 1) {
1497 | const doc = this._docs[i];
1498 | if (predicate(doc, i)) {
1499 | this.removeAt(i);
1500 | i -= 1;
1501 | len -= 1;
1502 |
1503 | results.push(doc);
1504 | }
1505 | }
1506 |
1507 | return results;
1508 | }
1509 |
1510 | removeAt(idx) {
1511 | this._docs.splice(idx, 1);
1512 | this._myIndex.removeAt(idx);
1513 | }
1514 |
1515 | getIndex() {
1516 | return this._myIndex;
1517 | }
1518 |
1519 | search(query, { limit = -1 } = {}) {
1520 | const { includeMatches, includeScore, shouldSort, sortFn, ignoreFieldNorm } = this.options;
1521 |
1522 | let results = isString(query)
1523 | ? isString(this._docs[0])
1524 | ? this._searchStringList(query)
1525 | : this._searchObjectList(query)
1526 | : this._searchLogical(query);
1527 |
1528 | computeScore(results, { ignoreFieldNorm });
1529 |
1530 | if (shouldSort) {
1531 | results.sort(sortFn);
1532 | }
1533 |
1534 | if (isNumber(limit) && limit > -1) {
1535 | results = results.slice(0, limit);
1536 | }
1537 |
1538 | return format(results, this._docs, {
1539 | includeMatches,
1540 | includeScore,
1541 | });
1542 | }
1543 |
1544 | _searchStringList(query) {
1545 | const searcher = createSearcher(query, this.options);
1546 | const { records } = this._myIndex;
1547 | const results = [];
1548 |
1549 | // Iterate over every string in the index
1550 | records.forEach(({ v: text, i: idx, n: norm }) => {
1551 | if (!isDefined(text)) {
1552 | return;
1553 | }
1554 |
1555 | const { isMatch, score, indices } = searcher.searchIn(text);
1556 |
1557 | if (isMatch) {
1558 | results.push({
1559 | item: text,
1560 | idx,
1561 | matches: [{ score, value: text, norm, indices }],
1562 | });
1563 | }
1564 | });
1565 |
1566 | return results;
1567 | }
1568 |
1569 | _searchLogical(query) {
1570 | const expression = parse(query, this.options);
1571 |
1572 | const evaluate = (node, item, idx) => {
1573 | if (!node.children) {
1574 | const { keyId, searcher } = node;
1575 |
1576 | const matches = this._findMatches({
1577 | key: this._keyStore.get(keyId),
1578 | value: this._myIndex.getValueForItemAtKeyId(item, keyId),
1579 | searcher,
1580 | });
1581 |
1582 | if (matches && matches.length) {
1583 | return [
1584 | {
1585 | idx,
1586 | item,
1587 | matches,
1588 | },
1589 | ];
1590 | }
1591 |
1592 | return [];
1593 | }
1594 |
1595 | const res = [];
1596 | for (let i = 0, len = node.children.length; i < len; i += 1) {
1597 | const child = node.children[i];
1598 | const result = evaluate(child, item, idx);
1599 | if (result.length) {
1600 | res.push(...result);
1601 | } else if (node.operator === LogicalOperator.AND) {
1602 | return [];
1603 | }
1604 | }
1605 | return res;
1606 | };
1607 |
1608 | const records = this._myIndex.records;
1609 | const resultMap = {};
1610 | const results = [];
1611 |
1612 | records.forEach(({ $: item, i: idx }) => {
1613 | if (isDefined(item)) {
1614 | let expResults = evaluate(expression, item, idx);
1615 |
1616 | if (expResults.length) {
1617 | // Dedupe when adding
1618 | if (!resultMap[idx]) {
1619 | resultMap[idx] = { idx, item, matches: [] };
1620 | results.push(resultMap[idx]);
1621 | }
1622 | expResults.forEach(({ matches }) => {
1623 | resultMap[idx].matches.push(...matches);
1624 | });
1625 | }
1626 | }
1627 | });
1628 |
1629 | return results;
1630 | }
1631 |
1632 | _searchObjectList(query) {
1633 | const searcher = createSearcher(query, this.options);
1634 | const { keys, records } = this._myIndex;
1635 | const results = [];
1636 |
1637 | // List is Array
1638 | records.forEach(({ $: item, i: idx }) => {
1639 | if (!isDefined(item)) {
1640 | return;
1641 | }
1642 |
1643 | let matches = [];
1644 |
1645 | // Iterate over every key (i.e, path), and fetch the value at that key
1646 | keys.forEach((key, keyIndex) => {
1647 | matches.push(
1648 | ...this._findMatches({
1649 | key,
1650 | value: item[keyIndex],
1651 | searcher,
1652 | })
1653 | );
1654 | });
1655 |
1656 | if (matches.length) {
1657 | results.push({
1658 | idx,
1659 | item,
1660 | matches,
1661 | });
1662 | }
1663 | });
1664 |
1665 | return results;
1666 | }
1667 | _findMatches({ key, value, searcher }) {
1668 | if (!isDefined(value)) {
1669 | return [];
1670 | }
1671 |
1672 | let matches = [];
1673 |
1674 | if (isArray(value)) {
1675 | value.forEach(({ v: text, i: idx, n: norm }) => {
1676 | if (!isDefined(text)) {
1677 | return;
1678 | }
1679 |
1680 | const { isMatch, score, indices } = searcher.searchIn(text);
1681 |
1682 | if (isMatch) {
1683 | matches.push({
1684 | score,
1685 | key,
1686 | value: text,
1687 | idx,
1688 | norm,
1689 | indices,
1690 | });
1691 | }
1692 | });
1693 | } else {
1694 | const { v: text, n: norm } = value;
1695 |
1696 | const { isMatch, score, indices } = searcher.searchIn(text);
1697 |
1698 | if (isMatch) {
1699 | matches.push({ score, key, value: text, norm, indices });
1700 | }
1701 | }
1702 |
1703 | return matches;
1704 | }
1705 | }
1706 |
1707 | Fuse.version = "6.6.2";
1708 | Fuse.createIndex = createIndex;
1709 | Fuse.parseIndex = parseIndex;
1710 | Fuse.config = Config;
1711 |
1712 | {
1713 | Fuse.parseQuery = parse;
1714 | }
1715 |
1716 | {
1717 | register(ExtendedSearch);
1718 | }
1719 |
1720 | export { Fuse as default };
1721 |
--------------------------------------------------------------------------------
/bookmark/logo.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/tw93/Maple/8e844afd83cfdccf52ae5cb83f97685838db4dd0/bookmark/logo.png
--------------------------------------------------------------------------------
/bookmark/manifest.json:
--------------------------------------------------------------------------------
1 | {
2 | "manifest_version": 3,
3 | "name": "Maple Bookmarks",
4 | "description": "Let you navigate smoothly while hiding the bookmark bar.",
5 | "version": "1.10",
6 | "action": {
7 | "default_popup": "popup.html"
8 | },
9 | "commands": {
10 | "_execute_action": {
11 | "suggested_key": {
12 | "default": "Ctrl+E",
13 | "mac": "Command+E"
14 | }
15 | }
16 | },
17 | "optional_host_permissions": ["*://*/*"],
18 | "permissions": ["bookmarks", "favicon"],
19 | "icons": {
20 | "16": "logo.png",
21 | "48": "logo.png",
22 | "128": "logo.png"
23 | }
24 | }
25 |
--------------------------------------------------------------------------------
/bookmark/manifest_firefox.json:
--------------------------------------------------------------------------------
1 | {
2 | "manifest_version": 3,
3 | "name": "Maple Bookmarks",
4 | "description": "Let you navigate smoothly while hiding the bookmark bar.",
5 | "version": "1.10",
6 | "action": {
7 | "default_popup": "popup.html"
8 | },
9 | "commands": {
10 | "_execute_action": {
11 | "suggested_key": {
12 | "default": "Ctrl+E"
13 | }
14 | }
15 | },
16 | "browser_specific_settings": {
17 | "gecko": {
18 | "id": "tw93@qq.com"
19 | }
20 | },
21 | "optional_host_permissions": ["*://*/*"],
22 | "permissions": ["bookmarks", "favicon"],
23 | "icons": {
24 | "16": "logo.png",
25 | "48": "logo.png",
26 | "128": "logo.png"
27 | }
28 | }
29 |
--------------------------------------------------------------------------------
/bookmark/popup.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 | Maple Bookmarks
6 |
240 |
241 |
242 |
243 |
244 |
245 |
248 |
249 |
250 |
252 |
254 |
255 |
256 |
257 |
--------------------------------------------------------------------------------
/bookmark/popup.js:
--------------------------------------------------------------------------------
1 | import Fuse from "./lib/fuse.js";
2 | import { debounce } from "./utils/debounce.js";
3 | import {
4 | keyText,
5 | BestMatchTitle,
6 | LastBestMatch,
7 | BestMatch,
8 | EmptyBookmarkMessage,
9 | ShowSearchWrapper,
10 | HideSearchWrapper,
11 | } from "./utils/i18n.js";
12 | import { Notification } from "./utils/notification.js";
13 | import { createElement } from "./utils/element.js";
14 | import { getFavicon } from "./utils/favicon.js";
15 |
16 | const CLASS_NAMES = {
17 | bookmark: "bookmark",
18 | favicon: "favicon",
19 | folder: "folder",
20 | childContainer: "childContainer",
21 | Notification: "Notification",
22 | folderTitle: "folderTitle",
23 | };
24 |
25 | let folderCount;
26 |
27 | let searchInput = document.getElementById("searchInput");
28 | let hideArrow = document.querySelector(".search-action");
29 | let hideArrowIcon = document.querySelector(".search-action i");
30 | let hotArea = document.querySelector("#hot-area");
31 |
32 | let activeBestMatchIndex = 0;
33 | let hideTimeout = null;
34 | let searchIsHide = !(localStorage.getItem("SHOW_SEARCH_BAR") === "true");
35 |
36 | let bestMatches = [];
37 | // 恢复 header 元素
38 | updateHeader(JSON.parse(localStorage.getItem("persistedHeader")), true);
39 | updateActiveBestMatch(activeBestMatchIndex);
40 |
41 | /**
42 | * @description 使用 Fuse 进行模糊匹配，返回最佳匹配项或false
43 | * @param searchTerm {string} 查询的字符串
44 | * @param data {{ title: string, url: string, favicon: string }[]} 要匹配的 对象数组，包含 title 和 url 属性
45 | * @returns {{ title: string, url: string, favicon: string }[]|null} 返回最佳匹配项的 对象数组 或 null
46 | */
47 | function FuseStrMatch(searchTerm, data) {
48 | const options = {
49 | keys: ["title", "url"],
50 | ignoreLocation: false, // 全搜索
51 | includeScore: true, // 包含相似度评分
52 | threshold: 0.5, // 相似度阈值
53 | shouldSort: true, // 是否排序
54 | };
55 | const fuse = new Fuse(data, options);
56 | const results = fuse.search(searchTerm);
57 | const cache = new Map();
58 | const noRepeatResult = results.reduce((acc, bookmark) => {
59 | if (cache.has(bookmark.item.url)) {
60 | return acc;
61 | } else {
62 | cache.set(bookmark.item.url, true);
63 | return [...acc, bookmark];
64 | }
65 | }, []);
66 |
67 | return results.length > 0 ? noRepeatResult.slice(0, 3).map(({ item }) => item) : null;
68 | }
69 |
70 | /**
71 | * 切换 searchBar 显示状态
72 | */
73 | function switchSearchBarShowStatus() {
74 | searchIsHide = !searchIsHide;
75 | localStorage.setItem("SHOW_SEARCH_BAR", searchIsHide ? "false" : "true");
76 | const extraClass = searchIsHide ? "" : "show";
77 | const container = document.querySelector("#search-wrapper");
78 | // 有一个8px的间距，所以减去8
79 | const containerHeight = container.clientHeight - 8;
80 | const bookmarksContainer = document.querySelector("#bookmarks");
81 | if (container) {
82 | container.classList.remove("show");
83 | if (extraClass) {
84 | container.classList.add(extraClass);
85 | bookmarksContainer.style.transform = `translateY(0)`;
86 | searchInput.focus();
87 | hotArea.style.display = "none";
88 | } else {
89 | bookmarksContainer.style.transform = `translateY(-${containerHeight}px)`;
90 | hotArea.style.display = "block";
91 | }
92 | }
93 | }
94 |
95 | /**
96 | * @description 快速切换默认选中的最佳结果
97 | * @param index {number} 要选中的索引
98 | */
99 | function updateActiveBestMatch(index) {
100 | const bestMatch = Array.from(document.querySelectorAll("#best-match .bookmark"));
101 | if (bestMatch.length === 0) {
102 | return;
103 | }
104 | bestMatch.forEach((item) => item.classList.remove("active"));
105 | // 循环切换
106 | activeBestMatchIndex = index % bestMatch.length < 0 ? bestMatch.length - 1 : index % bestMatch.length;
107 | bestMatch[activeBestMatchIndex].classList.add("active");
108 | }
109 |
110 | /**
111 | * 获取当前选中的最佳匹配项
112 | * @returns {HTMLElement} 当前选中的最佳匹配项
113 | */
114 | function getActiveBestMatch() {
115 | const bestMatch = Array.from(document.querySelectorAll("#best-match .bookmark"));
116 | return bestMatch[activeBestMatchIndex];
117 | }
118 |
119 | function showBestMatchTips() {
120 | const curBestMathEle = getActiveBestMatch();
121 | const tipsCon = curBestMathEle.querySelector("p");
122 | if (checkOverflow(tipsCon)) {
123 | Notification.show(bestMatches[activeBestMatchIndex].title, 1500);
124 | }
125 | }
126 |
127 | /**
128 | * @description 更新 header 的内容，如果匹配失败则不更新
129 | * @param headerFuzeMatch {{ title: string, url: string, favicon: string }[]|null} 匹配到的 对象数组 或 null
130 | * @param init {boolean} 是否是初始化
131 | */
132 | function updateHeader(headerFuzeMatch, init = false) {
133 | if (!headerFuzeMatch) {
134 | return;
135 | }
136 | // 兼容旧版本，上一个版本 headerFuzeMatch 为单个对象
137 | if (!Array.isArray(headerFuzeMatch)) {
138 | headerFuzeMatch = Array.from(headerFuzeMatch);
139 | }
140 | const matchedBookmark = document.querySelector("#best-match .folder");
141 | if (matchedBookmark) {
142 | matchedBookmark.parentElement.removeChild(matchedBookmark);
143 | }
144 | const bestMatchFolder = createElement("div", CLASS_NAMES.folder);
145 | const childContainer = createElement("div", CLASS_NAMES.childContainer);
146 | const title = createElement("h2", "", init ? LastBestMatch : BestMatch);
147 | title.title = BestMatchTitle;
148 | headerFuzeMatch.map((matchedBookmark) => {
149 | createBookmarkItem(matchedBookmark, childContainer);
150 | });
151 | bestMatchFolder.appendChild(title);
152 | bestMatchFolder.appendChild(childContainer);
153 | bestMatches = headerFuzeMatch;
154 |
155 | localStorage.setItem("persistedHeader", JSON.stringify(headerFuzeMatch));
156 | document.querySelector("#best-match").appendChild(bestMatchFolder);
157 | updateActiveBestMatch(0);
158 | }
159 |
160 | /**
161 | * 检测文本是否溢出
162 | * @param {HTMLElement} el 检测溢出的元素
163 | * @returns
164 | */
165 | function checkOverflow(el) {
166 | const curOverflow = el.style.overflow;
167 |
168 | if (!curOverflow || curOverflow === "visible") el.style.overflow = "hidden";
169 |
170 | const isOverflowing = el.clientWidth < el.scrollWidth || el.clientHeight < el.scrollHeight;
171 |
172 | el.style.overflow = curOverflow;
173 |
174 | return isOverflowing;
175 | }
176 |
177 | searchInput.addEventListener(
178 | "input",
179 | debounce(function () {
180 | let searchTerm = searchInput.value.toLowerCase();
181 | let folders = document.getElementsByClassName(CLASS_NAMES.folder);
182 |
183 | const headerData = [];
184 |
185 | for (let folder of folders) {
186 | let bookmarks = folder.getElementsByClassName(CLASS_NAMES.bookmark);
187 | let hasVisibleBookmark = false;
188 |
189 | for (let bookmark of bookmarks) {
190 | // push 查询数据
191 | headerData.push({
192 | title: bookmark.textContent,
193 | url: bookmark.href,
194 | favicon: bookmark.querySelector(".favicon")?.src,
195 | });
196 |
197 | let title = bookmark.textContent.toLowerCase();
198 | let url = bookmark.href.toLowerCase();
199 |
200 | // 当直接匹配失败时，使用模糊匹配
201 | if (
202 | title.includes(searchTerm) ||
203 | url.includes(searchTerm) ||
204 | FuseStrMatch(searchTerm, [
205 | {
206 | title: title,
207 | url: url,
208 | favicon: "",
209 | },
210 | ])
211 | ) {
212 | bookmark.style.display = "flex";
213 | hasVisibleBookmark = true;
214 | } else {
215 | bookmark.style.display = "none";
216 | }
217 | }
218 |
219 | folder.style.display = hasVisibleBookmark ? "block" : "none";
220 | }
221 |
222 | updateHeader(FuseStrMatch(searchTerm, headerData));
223 | }, 30)
224 | );
225 |
226 | // fix under mask click
227 | document.addEventListener("click", function (e) {
228 | const underMaskEle = [...document.elementsFromPoint(e.clientX, e.clientY)].find(
229 | (el) =>
230 | (el.classList.contains("search-action") || el.classList.contains(CLASS_NAMES.folderTitle)) &&
231 | e.target.id === "hot-area"
232 | );
233 | if (underMaskEle) {
234 | const clickEvent = new CustomEvent("click", {
235 | detail: {},
236 | });
237 | underMaskEle.dispatchEvent(clickEvent);
238 | }
239 | });
240 |
241 | hideArrow.addEventListener("click", function () {
242 | switchSearchBarShowStatus();
243 | if (!searchIsHide) {
244 | searchInput.focus();
245 | }
246 | });
247 |
248 | hideArrowIcon.addEventListener("mouseover", function () {
249 | const tips = searchIsHide ? ShowSearchWrapper : HideSearchWrapper;
250 | Notification.show(tips);
251 | });
252 |
253 | hideArrowIcon.addEventListener("mouseleave", function () {
254 | Notification.hide();
255 | });
256 |
257 | window.addEventListener("keydown", function (event) {
258 | if (event.key === "Escape") {
259 | event.preventDefault();
260 | searchInput.value = "";
261 |
262 | let bookmarks = document.getElementsByClassName(CLASS_NAMES.bookmark);
263 | let folders = document.getElementsByClassName(CLASS_NAMES.folder);
264 |
265 | for (let bookmark of bookmarks) {
266 | bookmark.style.display = "flex";
267 | }
268 |
269 | for (let folder of folders) {
270 | folder.style.display = "block";
271 | }
272 | }
273 |
274 | if (event.key === "ArrowLeft") {
275 | if (searchIsHide) return;
276 | updateActiveBestMatch(activeBestMatchIndex - 1);
277 | showBestMatchTips();
278 | }
279 |
280 | if (event.key === "ArrowRight") {
281 | if (searchIsHide) return;
282 | updateActiveBestMatch(activeBestMatchIndex + 1);
283 | showBestMatchTips();
284 | }
285 |
286 | if (event.key === "Enter") {
287 | event.preventDefault();
288 | if (bestMatches.length !== 0) {
289 | chrome.tabs.create({ url: bestMatches[activeBestMatchIndex].url });
290 | }
291 | }
292 |
293 | if (event.ctrlKey && event.key === "s") {
294 | event.preventDefault();
295 | switchSearchBarShowStatus();
296 | }
297 | });
298 |
299 | window.onload = async function () {
300 | setBodyHeightFromStorage();
301 |
302 | const bookmarkTreeNodes = await chrome.bookmarks.getTree();
303 | folderCount = countFolders(bookmarkTreeNodes[0].children);
304 | const container = document.querySelector("#search-wrapper");
305 | const bookmarksContainer = document.querySelector("#bookmarks");
306 |
307 | createBookmarks(bookmarkTreeNodes);
308 | setTimeout(saveCurrentHeight, 600);
309 |
310 | if (searchIsHide) {
311 | // -8 是因为有 8px 的 margin
312 | const searchBarContainerHeight = container.clientHeight - 8;
313 | bookmarksContainer.style.transform = `translateY(-${searchBarContainerHeight}px)`;
314 | hotArea.style.display = "block";
315 | } else {
316 | container.classList.add("show");
317 | bookmarksContainer.style.transform = `translateY(-8)`;
318 | searchInput.focus();
319 | hotArea.style.display = "none";
320 | }
321 | // delay to add transition animation to stop initial animation
322 | setTimeout(() => {
323 | container.style.transition = "all .3s ease";
324 | bookmarksContainer.style.transition = "all .3s ease";
325 | }, 100);
326 | };
327 |
328 | function setBodyHeightFromStorage() {
329 | let savedHeight = localStorage.getItem("savedHeight");
330 | if (savedHeight && savedHeight > 30) {
331 | document.body.style.height = `${savedHeight}px`;
332 | if (savedHeight > 618) {
333 | document.body.style.height = "618px";
334 | }
335 | }
336 | }
337 |
338 | function saveCurrentHeight() {
339 | let currentHeight = document.getElementById("bookmarks").clientHeight;
340 | localStorage.setItem("savedHeight", (currentHeight - 8).toString());
341 | }
342 |
343 | function createBookmarks(bookmarkTreeNodes) {
344 | const bookmarksContainer = document.getElementById("bookmarks");
345 |
346 | if (folderCount === 0) {
347 | showEmptyBookmarkMessage();
348 | } else {
349 | showBookmarks(bookmarkTreeNodes, bookmarksContainer);
350 | }
351 | bindSwitchModeToFirstFolder();
352 | }
353 |
354 | function bindSwitchModeToFirstFolder() {
355 | const hotArea = document.querySelector("#hot-area");
356 | const searchWrapper = document.querySelector("#search-wrapper");
357 | const arrow = document.querySelector(".arrow");
358 | hotArea.addEventListener("mouseover", () => {
359 | arrow.style.opacity = 1;
360 | searchWrapper.style.marginTop = 0;
361 | });
362 |
363 | hotArea.addEventListener("mouseleave", () => {
364 | arrow.style.opacity = 0;
365 | searchWrapper.style.marginTop = "-30px";
366 | });
367 | }
368 |
369 | function showEmptyBookmarkMessage() {
370 | const bookmarksContainer = document.getElementById("bookmarks");
371 | const messageElement = createElement("p", "message", EmptyBookmarkMessage);
372 |
373 | bookmarksContainer.appendChild(messageElement);
374 | }
375 |
376 | function showBookmarks(bookmarkNodes, parent, parentTitle = []) {
377 | if (!bookmarkNodes || !bookmarkNodes.length) {
378 | return;
379 | }
380 | // 优先显示书签，再显示文件夹
381 | const bookmarkItems = bookmarkNodes.filter((node) => node.url);
382 | bookmarkItems.forEach((bookmarkNode) => {
383 | createBookmarkItem(bookmarkNode, parent);
384 | });
385 |
386 | const bookmarkFolders = bookmarkNodes.filter((node) => node.children && node.children.length > 0);
387 | bookmarkFolders.forEach((bookmarkNode) => {
388 | createFolderForBookmarks(bookmarkNode, parent, parentTitle);
389 | });
390 | }
391 |
392 | function createBookmarkItem(bookmarkNode, parent) {
393 | let favicon = createElement("img", CLASS_NAMES.favicon);
394 | favicon.src = getFavicon(bookmarkNode.url);
395 |
396 | let bookItem = createElement("a", CLASS_NAMES.bookmark);
397 | bookItem.href = bookmarkNode.url;
398 | bookItem.target = "_blank";
399 | bookItem.appendChild(favicon);
400 |
401 | bookItem.addEventListener("click", function (event) {
402 | if (bookmarkNode.url.startsWith("chrome://") || bookmarkNode.url.startsWith("edge://")) {
403 | event.preventDefault();
404 | if (typeof browser !== "undefined") {
405 | // Firefox
406 | browser.tabs.create({ url: bookmarkNode.url });
407 | } else {
408 | // Chrome
409 | chrome.tabs.create({ url: bookmarkNode.url });
410 | }
411 | }
412 | });
413 |
414 | let linkTitle = createElement("p", "", bookmarkNode.title ? bookmarkNode.title : getTitleFromUrl(bookmarkNode.url));
415 | bookItem.appendChild(linkTitle);
416 |
417 | let mouseleaveHandler = function () {
418 | if (hideTimeout) {
419 | clearTimeout(hideTimeout);
420 | hideTimeout = null;
421 | }
422 | // 在mouseleave事件中，设置一个延时，然后隐藏Notification
423 | hideTimeout = setTimeout(() => {
424 | Notification.hide();
425 | }, 500);
426 | };
427 |
428 | bookItem.addEventListener("mouseover", function () {
429 | // 只有在文本溢出的时候才做处理
430 | if (checkOverflow(linkTitle)) {
431 | // 如果已经计划了隐藏通知的操作，取消它
432 | if (hideTimeout) {
433 | clearTimeout(hideTimeout);
434 | hideTimeout = null;
435 | }
436 | Notification.show(bookmarkNode.title);
437 | }
438 | });
439 |
440 | bookItem.addEventListener("mouseleave", mouseleaveHandler);
441 |
442 | parent.appendChild(bookItem);
443 | }
444 |
445 | function createFolderForBookmarks(bookmarkNode, parent, parentTitle = []) {
446 | let folder = createElement("div", CLASS_NAMES.folder);
447 | let childContainer = createElement("div", CLASS_NAMES.childContainer);
448 | // 递归传递父级的 title
449 | const title = [...parentTitle];
450 | title.push(bookmarkNode.title);
451 | // 如果文件夹下有书签，则显示标题，否则如全是文件夹则不显示
452 | if (bookmarkNode.children?.filter((node) => node.url).length > 0) {
453 | if (folderCount > 1 && bookmarkNode.title) {
454 | let folderName = bookmarkNode.title;
455 | // 如果是多级目录，则在标题前面加上父级目录
456 | if (title.length > 2) {
457 | for (let i = title.length - 2; i > 1; i--) {
458 | folderName = title[i] + " / " + folderName;
459 | }
460 | }
461 |
462 | let folderTitle = createElement("h2", CLASS_NAMES.folderTitle, folderName);
463 |
464 | if (bookmarkNode.title !== "Favorites Bar" && bookmarkNode.title !== "收藏夹栏") {
465 | folderTitle.title = keyText;
466 | folderTitle.style.cursor = "pointer";
467 |
468 | // 判断是否在之前被收起来了
469 | if (localStorage.getItem(bookmarkNode.title) === "collapsed") {
470 | childContainer.style.display = "none";
471 | }
472 |
473 | folderTitle.addEventListener("click", function (event) {
474 | // 为展开/收起添加事件
475 | if (childContainer.style.display === "none") {
476 | childContainer.style.display = "flex";
477 | localStorage.setItem(bookmarkNode.title, "expanded");
478 | } else {
479 | childContainer.style.display = "none";
480 | localStorage.setItem(bookmarkNode.title, "collapsed");
481 | }
482 |
483 | // 如果按住 ctrl 或 meta 键（Mac上的command键）则批量打开书签
484 | if (event.ctrlKey || event.metaKey) {
485 | for (let childNode of bookmarkNode.children) {
486 | if (childNode.url) {
487 | chrome.tabs.create({ url: childNode.url });
488 | }
489 | }
490 | event.preventDefault();
491 | }
492 | });
493 | }
494 |
495 | folder.appendChild(folderTitle);
496 | } else {
497 | folder.style.marginTop = "8px";
498 | }
499 | }
500 |
501 | showBookmarks(bookmarkNode.children, childContainer, title);
502 |
503 | folder.appendChild(childContainer);
504 | parent.appendChild(folder);
505 | }
506 |
507 | function countFolders(bookmarkNodes) {
508 | let count = 0;
509 | for (let i = 0; i < bookmarkNodes.length; i++) {
510 | if (bookmarkNodes[i].children && bookmarkNodes[i].children.length > 0) {
511 | count += 1 + countFolders(bookmarkNodes[i].children);
512 | }
513 | }
514 | return count;
515 | }
516 |
517 | function getTitleFromUrl(url) {
518 | if (url.startsWith("chrome://") || url.startsWith("edge://") || url.startsWith("about:")) {
519 | return url.split("//")[1].split("/")[0].charAt(0).toUpperCase() + url.split("//")[1].split("/")[0].slice(1);
520 | }
521 |
522 | let host = new URL(url).host;
523 | let parts = host.startsWith("www.") ? host.split(".")[1] : host.split(".")[0];
524 |
525 | return parts.charAt(0).toUpperCase() + parts.slice(1);
526 | }
527 |
--------------------------------------------------------------------------------
/bookmark/utils/debounce.js:
--------------------------------------------------------------------------------
1 | /**
2 | * @description: 防抖函数装饰器
3 | * @param func {function} 要防抖的函数
4 | * @param wait {number} 延迟执行毫秒数
5 | * @param immediate {boolean} true 表立即执行，false 表非立即执行
6 | * @returns {function} 返回一个防抖函数
7 | */
8 | function debounce(func, wait, immediate = false) {
9 | let timeout, args, context, timestamp, result;
10 | if (null == wait) wait = 100;
11 |
12 | function later() {
13 | const last = Date.now() - timestamp;
14 |
15 | if (last < wait && last >= 0) {
16 | timeout = setTimeout(later, wait - last);
17 | } else {
18 | timeout = null;
19 | if (!immediate) {
20 | result = func.apply(context, args);
21 | context = args = null;
22 | }
23 | }
24 | }
25 |
26 | const debounced = function () {
27 | context = this;
28 | args = arguments;
29 | timestamp = Date.now();
30 | const callNow = immediate && !timeout;
31 | if (!timeout) timeout = setTimeout(later, wait);
32 | if (callNow) {
33 | result = func.apply(context, args);
34 | context = args = null;
35 | }
36 |
37 | return result;
38 | };
39 |
40 | debounced.clear = function () {
41 | if (timeout) {
42 | clearTimeout(timeout);
43 | timeout = null;
44 | }
45 | };
46 |
47 | debounced.flush = function () {
48 | if (timeout) {
49 | result = func.apply(context, args);
50 | context = args = null;
51 |
52 | clearTimeout(timeout);
53 | timeout = null;
54 | }
55 | };
56 |
57 | return debounced;
58 | }
59 |
60 | export { debounce };
61 |
--------------------------------------------------------------------------------
/bookmark/utils/element.js:
--------------------------------------------------------------------------------
1 | export function createElement(type, className, textContent = "") {
2 | let element = document.createElement(type);
3 | element.className = className;
4 | element.textContent = textContent;
5 | return element;
6 | }
7 |
--------------------------------------------------------------------------------
/bookmark/utils/favicon.js:
--------------------------------------------------------------------------------
1 | export function getFavicon(url) {
2 | const isFirefox = navigator.userAgent.includes("Firefox");
3 | if (isFirefox) {
4 | return `http://www.google.com/s2/favicons?domain_url=${url}`;
5 | }
6 | return `${chrome.runtime.getURL("/_favicon?")}pageUrl=${encodeURIComponent(url)}&size=32`;
7 | }
8 |
--------------------------------------------------------------------------------
/bookmark/utils/i18n.js:
--------------------------------------------------------------------------------
1 | const browserLanguage = navigator.language.startsWith("zh") ? "zh" : "en";
2 | const isZh = browserLanguage === "zh";
3 |
4 | document.getElementById("searchInput").placeholder = isZh ? "搜索书签..." : "Search Bookmarks...";
5 |
6 | const isMac = navigator.platform.indexOf("Mac") !== -1;
7 |
8 | const keyHint = isMac ? "Command" : "Ctrl";
9 | const keyText = isZh
10 | ? `按住 ${keyHint} 可批量打开，点击可收起`
11 | : `Hold ${keyHint} and click to open all, Click to collapse.`;
12 |
13 | const BestMatchTitle = isZh ? "按 Enter 打开选中项" : "Press Enter to open the selected item";
14 |
15 | const LastBestMatch = isZh ? "上次最佳匹配" : "Last Best Match";
16 | const BestMatch = isZh ? "最佳匹配" : "Best Match";
17 |
18 | const EmptyBookmarkMessage = isZh ? "🍁 没有找到书签" : "🍁 No bookmarks in the current browser";
19 |
20 | const ShowSearchWrapper = isZh ? "显示搜索框，试试 Ctrl + S" : "Show Search Box, Try Ctrl + S";
21 | const HideSearchWrapper = isZh ? "隐藏搜索框，试试 Ctrl + S" : "Hide Search Box, Try Ctrl + S";
22 |
23 | export {
24 | keyText,
25 | BestMatchTitle,
26 | LastBestMatch,
27 | BestMatch,
28 | EmptyBookmarkMessage,
29 | ShowSearchWrapper,
30 | HideSearchWrapper,
31 | };
32 |
--------------------------------------------------------------------------------
/bookmark/utils/notification.js:
--------------------------------------------------------------------------------
1 | export const Notification = {
2 | timer: null,
3 | /**
4 | * 展示 notification
5 | * @param {string} message notification message
6 | * @param {boolean} hideTime auto hide time
7 | */
8 | show(message, hideTime = 0) {
9 | const container = document.querySelector("#notification-container");
10 | container.style.transform = `translateX(-105%)`;
11 | container.textContent = message;
12 | container.style.transform = `translateX(0)`;
13 | if (hideTime > 0) {
14 | if (this.timer) {
15 | clearTimeout(this.timer);
16 | }
17 | this.timer = setTimeout(() => {
18 | clearTimeout(this.timer);
19 | this.hide();
20 | }, hideTime);
21 | }
22 | },
23 | /**
24 | * 移除 notification
25 | *
26 | */
27 | hide() {
28 | const container = document.querySelector("#notification-container");
29 | container.style.transform = `translateX(-105%)`;
30 | },
31 | };
32 |
--------------------------------------------------------------------------------
/newtab/bg.json:
--------------------------------------------------------------------------------
1 | [
2 | {
3 | "title": "不天黑的乌鲁木齐",
4 | "url": "https://weekly.tw93.fun/posts/30-不天黑的乌鲁木齐",
5 | "date": "2021/06/07",
6 | "pic": "https://gw.alipayobjects.com/zos/k/c1/IMG_4854.jpeg"
7 | },
8 | {
9 | "title": "西湖音乐节",
10 | "url": "https://weekly.tw93.fun/posts/105-西湖音乐节",
11 | "date": "2023/07/28",
12 | "pic": "https://gw.alipayobjects.com/zos/k/7i/IMG_1730.jpg"
13 | },
14 | {
15 | "title": "飞檐走壁的人",
16 | "url": "https://weekly.tw93.fun/posts/25-飞檐走壁的人",
17 | "date": "2021/05/03",
18 | "pic": "https://gw.alipayobjects.com/zos/k/29/ZoRs7B.jpg"
19 | },
20 | {
21 | "title": "一群笔直的树",
22 | "url": "https://weekly.tw93.fun/posts/41-一群笔直的树",
23 | "date": "2021/08/23",
24 | "pic": "https://gw.alipayobjects.com/zos/k/66/qsyH2T.jpg"
25 | },
26 | {
27 | "title": "无争的灵隐寺",
28 | "url": "https://weekly.tw93.fun/posts/42-无争的灵隐寺",
29 | "date": "2021/08/30",
30 | "pic": "https://gw.alipayobjects.com/zos/k/10/MRNoEz.jpg"
31 | },
32 | {
33 | "title": "2022蜡梅",
34 | "url": "https://weekly.tw93.fun/posts/62-2022蜡梅",
35 | "date": "2022/01/17",
36 | "pic": "https://gw.alipayobjects.com/zos/k/px/Ty4WR3.jpg"
37 | },
38 | {
39 | "title": "太湖湾音乐节",
40 | "url": "https://weekly.tw93.fun/posts/87-太湖湾音乐节",
41 | "date": "2022/07/11",
42 | "pic": "https://gw.alipayobjects.com/zos/k/ha/87.jpg"
43 | },
44 | {
45 | "title": "东海音乐节",
46 | "url": "https://weekly.tw93.fun/posts/04-东海音乐节",
47 | "date": "2020/12/07",
48 | "pic": "https://gw.alipayobjects.com/zos/k/t9/xOtN9c.jpg"
49 | },
50 | {
51 | "title": "万石植物园",
52 | "url": "https://weekly.tw93.fun/posts/03-万石植物园",
53 | "date": "2020/11/30",
54 | "pic": "https://gw.alipayobjects.com/zos/k/vt/QzwRSt.png"
55 | },
56 | {
57 | "title": "白云滑雪场",
58 | "url": "https://weekly.tw93.fun/posts/06-白云滑雪场",
59 | "date": "2020/12/21",
60 | "pic": "https://gw.alipayobjects.com/zos/k/o3/ZebwPr.jpg"
61 | },
62 | {
63 | "title": "重庆洪崖洞",
64 | "url": "https://weekly.tw93.fun/posts/07-重庆洪崖洞",
65 | "date": "2020/12/28",
66 | "pic": "https://gw.alipayobjects.com/zos/k/26/INUqPy.jpg"
67 | },
68 | {
69 | "title": "新疆的雪山",
70 | "url": "https://weekly.tw93.fun/posts/10-新疆的雪山",
71 | "date": "2021/01/18",
72 | "pic": "https://gw.alipayobjects.com/zos/k/fk/frrlJj.png"
73 | },
74 | {
75 | "title": "茶山的树",
76 | "url": "https://weekly.tw93.fun/posts/103-茶山的树",
77 | "date": "2023/07/28",
78 | "pic": "https://gw.alipayobjects.com/zos/k/app/IMG_1385.jpg"
79 | },
80 | {
81 | "title": "可爱松鼠",
82 | "url": "https://weekly.tw93.fun/posts/104-可爱松鼠",
83 | "date": "2023/07/28",
84 | "pic": "https://gw.alipayobjects.com/zos/k/zn/yPL9km.jpg"
85 | },
86 | {
87 | "title": "海南度假",
88 | "url": "https://weekly.tw93.fun/posts/106-海南度假",
89 | "date": "2023/07/28",
90 | "pic": "https://gw.alipayobjects.com/zos/k/cz/IMG_2262.JPG"
91 | },
92 | {
93 | "title": "沙巴理发",
94 | "url": "https://weekly.tw93.fun/posts/108-沙巴理发",
95 | "date": "2023/07/28",
96 | "pic": "https://gw.alipayobjects.com/zos/k/j8/ORG_DSC01420.jpg"
97 | },
98 | {
99 | "title": "大阪夜景",
100 | "url": "https://weekly.tw93.fun/posts/110-大阪夜景",
101 | "date": "2023/07/28",
102 | "pic": "https://gw.alipayobjects.com/zos/k/pr/110.JPG"
103 | },
104 | {
105 | "title": "新年追日",
106 | "url": "https://weekly.tw93.fun/posts/111-新年追日",
107 | "date": "2023/07/28",
108 | "pic": "https://gw.alipayobjects.com/zos/k/b4/111.jpg"
109 | },
110 | {
111 | "title": "咖啡店猫",
112 | "url": "https://weekly.tw93.fun/posts/112-咖啡店猫",
113 | "date": "2023/07/28",
114 | "pic": "https://gw.alipayobjects.com/zos/k/gx/112.jpg"
115 | },
116 | {
117 | "title": "猫的克隆",
118 | "url": "https://weekly.tw93.fun/posts/113-猫的克隆",
119 | "date": "2023/07/28",
120 | "pic": "https://gw.alipayobjects.com/zos/k/1o/113.jpg"
121 | },
122 | {
123 | "title": "冬季新疆",
124 | "url": "https://weekly.tw93.fun/posts/114-冬季新疆",
125 | "date": "2023/07/28",
126 | "pic": "https://gw.alipayobjects.com/zos/k/14/114.jpg"
127 | },
128 | {
129 | "title": "一江两岸",
130 | "url": "https://weekly.tw93.fun/posts/115-一江两岸",
131 | "date": "2023/07/28",
132 | "pic": "https://gw.alipayobjects.com/zos/k/9v/115.jpg"
133 | },
134 | {
135 | "title": "赤道夜景",
136 | "url": "https://weekly.tw93.fun/posts/122-赤道夜景",
137 | "date": "2023/07/28",
138 | "pic": "https://gw.alipayobjects.com/zos/k/g7s5ul/122.jpg"
139 | },
140 | {
141 | "title": "杭州新绿",
142 | "url": "https://weekly.tw93.fun/posts/123-杭州新绿",
143 | "date": "2023/07/28",
144 | "pic": "https://gw.alipayobjects.com/zos/k/q4/123.jpg"
145 | },
146 | {
147 | "title": "忆泸沽湖",
148 | "url": "https://weekly.tw93.fun/posts/124-忆泸沽湖",
149 | "date": "2023/07/28",
150 | "pic": "https://gw.alipayobjects.com/zos/k/w4/DSC06324.jpg"
151 | },
152 | {
153 | "title": "零点西湖",
154 | "url": "https://weekly.tw93.fun/posts/127-零点西湖",
155 | "date": "2023/07/28",
156 | "pic": "https://gw.alipayobjects.com/zos/k/9e/127.jpg"
157 | },
158 | {
159 | "title": "良渚的树",
160 | "url": "https://weekly.tw93.fun/posts/128-良渚的树",
161 | "date": "2023/07/28",
162 | "pic": "https://gw.alipayobjects.com/zos/k/ib/128.jpg"
163 | },
164 | {
165 | "title": "大道芸人",
166 | "url": "https://weekly.tw93.fun/posts/131-大道芸人",
167 | "date": "2023/07/28",
168 | "pic": "https://gw.alipayobjects.com/zos/k/fliggy/132.jpg"
169 | },
170 | {
171 | "title": "可爱雕塑",
172 | "url": "https://weekly.tw93.fun/posts/132-可爱雕塑",
173 | "date": "2023/07/28",
174 | "pic": "https://gw.alipayobjects.com/zos/k/o6/132.jpg"
175 | },
176 | {
177 | "title": "香港不错",
178 | "url": "https://weekly.tw93.fun/posts/135-香港不错",
179 | "date": "2023/07/28",
180 | "pic": "https://gw.alipayobjects.com/zos/k/1w/135.jpg"
181 | },
182 | {
183 | "title": "九龙公园",
184 | "url": "https://weekly.tw93.fun/posts/137-九龙公园",
185 | "date": "2023/07/28",
186 | "pic": "https://gw.alipayobjects.com/zos/k/60/137.jpg"
187 | },
188 | {
189 | "title": "下班蓝天",
190 | "url": "https://weekly.tw93.fun/posts/138-下班蓝天",
191 | "date": "2023/07/28",
192 | "pic": "https://gw.alipayobjects.com/zos/k/05/138.jpg"
193 | },
194 | {
195 | "title": "亚庇清真寺",
196 | "url": "https://weekly.tw93.fun/posts/16-亚庇清真寺",
197 | "date": "2021/03/01",
198 | "pic": "https://gw.alipayobjects.com/zos/k/md/16.jpg"
199 | },
200 | {
201 | "title": "烤肉配薯条",
202 | "url": "https://weekly.tw93.fun/posts/66-烤肉配薯条",
203 | "date": "2022/02/14",
204 | "pic": "https://gw.alipayobjects.com/zos/k/65/IMG_7912.jpg"
205 | },
206 | {
207 | "title": "笼子里的鸟",
208 | "url": "https://weekly.tw93.fun/posts/79-笼子里的鸟",
209 | "date": "2022/05/16",
210 | "pic": "https://gw.alipayobjects.com/zos/k/iq/VeZ7Jj.jpg"
211 | },
212 | {
213 | "title": "良渚的🦌",
214 | "url": "https://weekly.tw93.fun/posts/81-良渚的🦌",
215 | "date": "2022/05/30",
216 | "pic": "https://gw.alipayobjects.com/zos/k/fq/IMG_9201.jpg"
217 | },
218 | {
219 | "title": "安吉黄昏",
220 | "url": "https://weekly.tw93.fun/posts/01-安吉黄昏",
221 | "date": "2020/11/16",
222 | "pic": "https://gw.alipayobjects.com/zos/k/h5/hzL4LG.jpg"
223 | },
224 | {
225 | "title": "大理稻田",
226 | "url": "https://weekly.tw93.fun/posts/12-大理稻田",
227 | "date": "2021/02/01",
228 | "pic": "https://gw.alipayobjects.com/zos/k/75/MSg3n1.jpg"
229 | },
230 | {
231 | "title": "冬天三亚",
232 | "url": "https://weekly.tw93.fun/posts/22-冬天三亚",
233 | "date": "2021/04/12",
234 | "pic": "https://gw.alipayobjects.com/zos/k/5u/H2lAp3.jpeg"
235 | },
236 | {
237 | "title": "橘子洲头",
238 | "url": "https://weekly.tw93.fun/posts/28-橘子洲头",
239 | "date": "2021/05/24",
240 | "pic": "https://gw.alipayobjects.com/zos/k/um/IMG_4524.jpeg"
241 | },
242 | {
243 | "title": "大阪夜景",
244 | "url": "https://weekly.tw93.fun/posts/46-大阪夜景",
245 | "date": "2021/09/27",
246 | "pic": "https://gw.alipayobjects.com/zos/k/7q/dPhcAh.jpg"
247 | },
248 | {
249 | "title": "漂亮的树",
250 | "url": "https://weekly.tw93.fun/posts/63-漂亮的树",
251 | "date": "2022/01/24",
252 | "pic": "https://gw.alipayobjects.com/zos/k/pt/AKRZvA.jpeg"
253 | },
254 | {
255 | "title": "发光的树",
256 | "url": "https://weekly.tw93.fun/posts/74-发光的树",
257 | "date": "2022/04/11",
258 | "pic": "https://gw.alipayobjects.com/zos/k/5m/37.jpeg"
259 | },
260 | {
261 | "title": "咖啡标语",
262 | "url": "https://weekly.tw93.fun/posts/76-咖啡标语",
263 | "date": "2022/04/25",
264 | "pic": "https://gw.alipayobjects.com/zos/k/qs/1.jpg"
265 | },
266 | {
267 | "title": "落日风帆",
268 | "url": "https://weekly.tw93.fun/posts/84-落日风帆",
269 | "date": "2022/06/20",
270 | "pic": "https://gw.alipayobjects.com/zos/k/cr/IMG_8103.jpeg"
271 | },
272 | {
273 | "title": "去避暑吧",
274 | "url": "https://weekly.tw93.fun/posts/89-去避暑吧",
275 | "date": "2022/07/25",
276 | "pic": "https://gw.alipayobjects.com/zos/k/eg/2268.jpg"
277 | },
278 | {
279 | "title": "由在茶溪",
280 | "url": "https://weekly.tw93.fun/posts/95-由在茶溪",
281 | "date": "2022/09/05",
282 | "pic": "https://gw.alipayobjects.com/zos/k/gf/qdMqaU.jpg"
283 | },
284 | {
285 | "title": "杭州乐园",
286 | "url": "https://weekly.tw93.fun/posts/96-杭州乐园",
287 | "date": "2022/09/12",
288 | "pic": "https://gw.alipayobjects.com/zos/k/app2/shui.jpg"
289 | },
290 | {
291 | "title": "水上森林",
292 | "url": "https://weekly.tw93.fun/posts/97-水上森林",
293 | "date": "2022/09/19",
294 | "pic": "https://gw.alipayobjects.com/zos/k/wn/W4ZBF3.jpg"
295 | },
296 | {
297 | "title": "潮流建筑",
298 | "url": "https://weekly.tw93.fun/posts/98-潮流建筑",
299 | "date": "2022/09/26",
300 | "pic": "https://gw.alipayobjects.com/zos/k/br/IMG_0652.jpg"
301 | },
302 | {
303 | "title": "太子湾",
304 | "url": "https://weekly.tw93.fun/posts/02-太子湾",
305 | "date": "2020/11/23",
306 | "pic": "https://gw.alipayobjects.com/zos/k/yt/ck1Y1K.png"
307 | },
308 | {
309 | "title": "泸沽湖",
310 | "url": "https://weekly.tw93.fun/posts/05-泸沽湖",
311 | "date": "2020/12/14",
312 | "pic": "https://gw.alipayobjects.com/zos/k/bn/g7b1Xc.jpg"
313 | },
314 | {
315 | "title": "热河路",
316 | "url": "https://weekly.tw93.fun/posts/27-热河路",
317 | "date": "2021/05/17",
318 | "pic": "https://gw.alipayobjects.com/zos/k/44/DSC06704.jpeg"
319 | },
320 | {
321 | "title": "莫吉托",
322 | "url": "https://weekly.tw93.fun/posts/83-莫吉托",
323 | "date": "2022/06/13",
324 | "pic": "https://gw.alipayobjects.com/zos/k/em/IMG_9399.jpg"
325 | },
326 | {
327 | "title": "天目里",
328 | "url": "https://weekly.tw93.fun/posts/91-天目里",
329 | "date": "2022/08/08",
330 | "pic": "https://gw.alipayobjects.com/zos/k/l8/IMG_0065.jpg"
331 | },
332 | {
333 | "title": "华山",
334 | "url": "https://weekly.tw93.fun/posts/09-华山",
335 | "date": "2021/01/11",
336 | "pic": "https://gw.alipayobjects.com/zos/k/bb/12121221mmm.jpg"
337 | },
338 | {
339 | "title": "养猫",
340 | "url": "https://weekly.tw93.fun/posts/15-养猫",
341 | "date": "2021/02/22",
342 | "pic": "https://gw.alipayobjects.com/zos/k/zz/ujvV0v.png"
343 | },
344 | {
345 | "title": "草海",
346 | "url": "https://weekly.tw93.fun/posts/20-草海",
347 | "date": "2021/03/29",
348 | "pic": "https://gw.alipayobjects.com/zos/k/9w/S5tqsz.jpeg"
349 | },
350 | {
351 | "title": "汤圆",
352 | "url": "https://weekly.tw93.fun/posts/21-汤圆",
353 | "date": "2021/04/05",
354 | "pic": "https://gw.alipayobjects.com/zos/k/84/kKRZeF.jpeg"
355 | },
356 | {
357 | "title": "南京",
358 | "url": "https://weekly.tw93.fun/posts/32-南京",
359 | "date": "2021/06/21",
360 | "pic": "https://gw.alipayobjects.com/zos/k/e2/o4FeLQ.jpeg"
361 | },
362 | {
363 | "title": "西安",
364 | "url": "https://weekly.tw93.fun/posts/57-西安",
365 | "date": "2021/12/13",
366 | "pic": "https://gw.alipayobjects.com/zos/k/3x/pCP92Q.jpg"
367 | },
368 | {
369 | "title": "佛头",
370 | "url": "https://weekly.tw93.fun/posts/78-佛头",
371 | "date": "2022/05/09",
372 | "pic": "https://gw.alipayobjects.com/zos/k/appo/IMG_8952.jpg"
373 | },
374 | {
375 | "title": "爱王小波",
376 | "url": "https://weekly.tw93.fun/posts/140-爱王小波",
377 | "date": "2023/08/07",
378 | "pic": "https://gw.alipayobjects.com/zos/k/1/140.jpg"
379 | }
380 | ]
381 |
--------------------------------------------------------------------------------
/newtab/logo.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/tw93/Maple/8e844afd83cfdccf52ae5cb83f97685838db4dd0/newtab/logo.png
--------------------------------------------------------------------------------
/newtab/manifest.json:
--------------------------------------------------------------------------------
1 | {
2 | "manifest_version": 3,
3 | "name": "Maple NewTab",
4 | "description": "Enhance your new tab experience with a comfortable and refreshing design.",
5 | "version": "1.10",
6 | "chrome_url_overrides": {
7 | "newtab": "newtab.html"
8 | },
9 | "optional_host_permissions": ["*://*/*"],
10 | "icons": {
11 | "16": "logo.png",
12 | "48": "logo.png",
13 | "128": "logo.png"
14 | }
15 | }
16 |
--------------------------------------------------------------------------------
/newtab/newtab.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
87 |
88 | 必应图
89 | Unsplash
90 | 空白页
91 | 随机图
92 |
93 |
94 | 
4 | 
24 |
25 | 
57 |
58 | ## Practice
59 |
60 | 1. First, organize your bookmarks. You can adjust the order of frequently used ones and delete those not often used to make it tidier.
61 | 2. Use `Command+Shift+B`(Mac)、`Ctrl+Shift+B`(Windows) or right-click on the bookmarks bar to hide it.
62 | 3. Click on the extension icon and pin `Maple Bookmarks` to the toolbar.
63 | 4. Try using `Command + E`(Mac)、`Ctrl+B`(Windows / Firefox) to quickly access your bookmarks.
64 | 5. Clicking on the folder name can collapse and expand it, making it more comfortable for users with many bookmarks to use.
65 | 6. If you have an extensive collection of bookmarks, you can conveniently search through them using keywords. The search feature supports Chinese, English, and domain names. By default, the search function is not activated. To enable it, use the `Ctrl + S` shortcut or click the small arrow located at the top of the interface to switch to search mode.
66 | 7. Each search will prioritize and display the top three most relevant results. You can easily navigate between these top results using the `←` and `→` keys on your keyboard. To swiftly access the highlighted bookmark, simply press the Enter key.
67 |
68 | ## Support
69 |
70 | 1. I have two cats, if you think Maple delights your life, you can feed them some canned food 🥩.
71 | 2. If you like Maple, you can star it on GitHub. Also, welcome to recommend Maple to your friends.
72 | 3. You can follow my [Twitter](https://twitter.com/HiTw93) to get the latest news or join our [Telegram](https://t.me/+GclQS9ZnxyI2ODQ1) chat group.
73 |
--------------------------------------------------------------------------------
/README_CN.md:
--------------------------------------------------------------------------------
1 | 
