73 Commits

Author SHA1 Message Date
0f342c96ee 更新版本号 2025-09-29 23:55:44 +08:00
3022ada51a 更新准备界面 2025-09-29 23:53:07 +08:00
9dada59c56 加入时间戳修正配置 2025-09-29 23:30:51 +08:00
8683693cd1 将数据文件移至单独的 Nucleons 仓库维护 2025-09-22 12:34:01 +08:00
144d7cb83c 修补 2025-09-15 12:37:07 +08:00
44573624aa 问题修复 2025-09-14 23:29:01 +08:00
1b33bb8618 兼容旧版 Textual 2025-09-14 23:27:59 +08:00
d83025d818 兼容旧版 Textual 2025-09-14 23:26:49 +08:00
f7e93cf05f 兼容旧版 Textual 2025-09-14 23:25:06 +08:00
e30cefeb44 兼容旧版 Textual 2025-09-14 23:23:13 +08:00
7dc963d491 兼容旧版 Textual 2025-09-14 23:22:03 +08:00
3640d8a799 算法修复与实验性扩展支持 2025-09-14 23:19:24 +08:00
1ea34ab87a 更新版本号 2025-09-14 02:08:16 +08:00
2bedc686a5 修复空文件夹 2025-09-14 02:07:53 +08:00
19d0e32b6f 更新用户界面, 修复总复习 2025-09-14 01:54:33 +08:00
50a5b9b108 添加开源许可证 2025-09-11 00:19:34 +08:00
5a096e4b4f 更新版本号 2025-09-11 00:05:18 +08:00
65491117d3 问题修复与更新 2025-09-11 00:04:02 +08:00
c82eedde82 问题修复与更新 2025-09-11 00:03:20 +08:00
697e3b2b8f 更新配置文件 2025-09-10 23:51:28 +08:00
11eff7da43 更新说明 2025-09-10 23:29:53 +08:00
c93bcdd489 删除无用文件 2025-09-10 23:27:34 +08:00
bb99b0a0b7 增加软件管理实用程序与音频缓存机制修复 2025-09-10 23:27:02 +08:00
6293b69ef0 改进 2025-09-08 13:59:09 +08:00
afb7252f71 若干改进 2025-09-08 13:44:14 +08:00
5e96fc8138 更新文件树 2025-08-30 22:03:34 +08:00
e64d1711d0 更新 README 2025-08-30 00:06:16 +08:00
beeb2fd318 改进 🍰 2025-08-28 13:08:37 +08:00
fc58f61dfe 新增源文件 2025-08-23 23:02:30 +08:00
e11e7e781b 添加更多源文件 2025-08-23 13:44:03 +08:00
39459a0f6e 更新版本号 2025-08-21 13:30:59 +08:00
cccf7189e3 自动播放机制 2025-08-21 13:30:30 +08:00
2c51f2cea3 改动 2025-08-21 06:28:22 +08:00
2ad014fcd8 更新文件树 2025-08-16 07:33:42 +08:00
4ad289d02d 改进部署组件 2025-08-14 11:16:43 +08:00
28ccfdd227 删除运行时文件 2025-08-14 11:13:11 +08:00
f83d5c934d 增加若干元数据 2025-08-14 11:12:33 +08:00
4f9eb3b7d1 重命名文件 2025-08-12 19:10:14 +08:00
c44a38f3c8 更新自述文件 2025-08-09 22:44:02 +08:00
f760e7f0fa 预缓存实用程序改动 2025-08-09 08:41:40 +08:00
30eb45e1cb 更新自述文件 2025-08-06 07:52:42 +08:00
2a30f136cb 更新自述文件 2025-08-06 07:52:15 +08:00
051c4847b2 更新自述文件 2025-08-06 07:43:36 +08:00
0873caa5fc 若干善后改进 2025-08-06 07:42:43 +08:00
6d3d2e665c 实装自动评分系统 2025-08-06 06:46:30 +08:00
edf2f0868a 改进 2025-08-06 06:30:41 +08:00
d5ef5e84d0 规范代码 2025-08-06 06:11:30 +08:00
dd74dddf00 规范代码 2025-08-06 06:11:22 +08:00
2cf2cdb33f 更新版本号 2025-08-06 05:31:05 +08:00
385a86eb2c 更新版本号 2025-08-06 05:30:30 +08:00
46d992b408 组件可用性更新 2025-08-06 05:27:38 +08:00
b77f3f2abe 布局更新 2025-08-06 04:57:28 +08:00
6c28bd461b 修复 2025-08-05 20:29:20 +08:00
44f75bca90 更新谜题生成器 2025-08-05 19:40:36 +08:00
961f0ba785 改进 2025-08-05 14:13:11 +08:00
c9185fbd0a 逻辑改进 2025-08-04 01:24:35 +08:00
4beb42f615 重构布局系统并改进界面 2025-08-03 03:57:21 +08:00
445e15646b 改进 2025-08-02 17:48:42 +08:00
4d6d1f1b60 中途改进 2025-07-30 23:10:43 +08:00
722ae6f72c 完善 webshare 2025-07-30 16:16:50 +08:00
88650b0856 完善 webshare 2025-07-30 16:15:36 +08:00
620473863a 完善 webshare 2025-07-30 16:13:03 +08:00
9d8cb17cc6 完善项目安装配置 & 中途改进 2025-07-30 16:07:31 +08:00
123f7919b0 实现音频预缓存实用程序 2025-07-30 01:55:46 +08:00
2eeb60c75b 更新版本号 2025-07-30 01:34:06 +08:00
2c870377a6 修复 ElectronUnion 对象初始化问题 2025-07-30 01:32:31 +08:00
36562323b7 使用 NucleonUnion & ElectronUnion 取代繁琐的 AtomicFiles 2025-07-30 01:11:03 +08:00
b91176241b 小改动 2025-07-28 16:48:46 +08:00
edfeb0b40b README.md 2025-07-27 21:54:50 +08:00
9d658ea646 README.md 2025-07-27 21:54:27 +08:00
5d3c354d8f 中途改进 2025-07-27 21:39:34 +08:00
d27d353374 更新自述文件, 更新 gitignore 2025-07-25 23:57:58 +08:00
3988b55f1f v0.2.5 修复初次激活相关问题 2025-07-25 23:50:07 +08:00
46 changed files with 2087 additions and 596 deletions

8
.gitignore vendored
View File

@@ -1 +1,7 @@
.vscode .devflag
.vscode
.directory
__pycache__/
scripts/
.idea
cache

20
CONTRIBUTING.md Normal file
View File

@@ -0,0 +1,20 @@
# 贡献指南
## 使用 Nuitka 静态编译
运行
```bash
nuitka --clang --jobs=6 --standalone --onefile main.py
```
## 打开调试日志
分别运行
```shell
textual console -x SYSTEM -x EVENT -x DEBUG -x INFO
```
```shell
textual run --dev main.py
```

232
LICENSE Normal file
View File

@@ -0,0 +1,232 @@
GNU GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright © 2007 Free Software Foundation, Inc. <https://fsf.org/>
Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed.
Preamble
The GNU General Public License is a free, copyleft license for software and other kinds of works.
The licenses for most software and other practical works are designed to take away your freedom to share and change the works. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change all versions of a program--to make sure it remains free software for all its users. We, the Free Software Foundation, use the GNU General Public License for most of our software; it applies also to any other work released this way by its authors. You can apply it to your programs, too.
When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for them if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs, and that you know you can do these things.
To protect your rights, we need to prevent others from denying you these rights or asking you to surrender the rights. Therefore, you have certain responsibilities if you distribute copies of the software, or if you modify it: responsibilities to respect the freedom of others.
For example, if you distribute copies of such a program, whether gratis or for a fee, you must pass on to the recipients the same freedoms that you received. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights.
Developers that use the GNU GPL protect your rights with two steps: (1) assert copyright on the software, and (2) offer you this License giving you legal permission to copy, distribute and/or modify it.
For the developers' and authors' protection, the GPL clearly explains that there is no warranty for this free software. For both users' and authors' sake, the GPL requires that modified versions be marked as changed, so that their problems will not be attributed erroneously to authors of previous versions.
Some devices are designed to deny users access to install or run modified versions of the software inside them, although the manufacturer can do so. This is fundamentally incompatible with the aim of protecting users' freedom to change the software. The systematic pattern of such abuse occurs in the area of products for individuals to use, which is precisely where it is most unacceptable. Therefore, we have designed this version of the GPL to prohibit the practice for those products. If such problems arise substantially in other domains, we stand ready to extend this provision to those domains in future versions of the GPL, as needed to protect the freedom of users.
Finally, every program is threatened constantly by software patents. States should not allow patents to restrict development and use of software on general-purpose computers, but in those that do, we wish to avoid the special danger that patents applied to a free program could make it effectively proprietary. To prevent this, the GPL assures that patents cannot be used to render the program non-free.
The precise terms and conditions for copying, distribution and modification follow.
TERMS AND CONDITIONS
0. Definitions.
“This License” refers to version 3 of the GNU General Public License.
“Copyright” also means copyright-like laws that apply to other kinds of works, such as semiconductor masks.
“The Program” refers to any copyrightable work licensed under this License. Each licensee is addressed as “you”. “Licensees” and “recipients” may be individuals or organizations.
To “modify” a work means to copy from or adapt all or part of the work in a fashion requiring copyright permission, other than the making of an exact copy. The resulting work is called a “modified version” of the earlier work or a work “based on” the earlier work.
A “covered work” means either the unmodified Program or a work based on the Program.
To “propagate” a work means to do anything with it that, without permission, would make you directly or secondarily liable for infringement under applicable copyright law, except executing it on a computer or modifying a private copy. Propagation includes copying, distribution (with or without modification), making available to the public, and in some countries other activities as well.
To “convey” a work means any kind of propagation that enables other parties to make or receive copies. Mere interaction with a user through a computer network, with no transfer of a copy, is not conveying.
An interactive user interface displays “Appropriate Legal Notices” to the extent that it includes a convenient and prominently visible feature that (1) displays an appropriate copyright notice, and (2) tells the user that there is no warranty for the work (except to the extent that warranties are provided), that licensees may convey the work under this License, and how to view a copy of this License. If the interface presents a list of user commands or options, such as a menu, a prominent item in the list meets this criterion.
1. Source Code.
The “source code” for a work means the preferred form of the work for making modifications to it. “Object code” means any non-source form of a work.
A “Standard Interface” means an interface that either is an official standard defined by a recognized standards body, or, in the case of interfaces specified for a particular programming language, one that is widely used among developers working in that language.
The “System Libraries” of an executable work include anything, other than the work as a whole, that (a) is included in the normal form of packaging a Major Component, but which is not part of that Major Component, and (b) serves only to enable use of the work with that Major Component, or to implement a Standard Interface for which an implementation is available to the public in source code form. A “Major Component”, in this context, means a major essential component (kernel, window system, and so on) of the specific operating system (if any) on which the executable work runs, or a compiler used to produce the work, or an object code interpreter used to run it.
The “Corresponding Source” for a work in object code form means all the source code needed to generate, install, and (for an executable work) run the object code and to modify the work, including scripts to control those activities. However, it does not include the work's System Libraries, or general-purpose tools or generally available free programs which are used unmodified in performing those activities but which are not part of the work. For example, Corresponding Source includes interface definition files associated with source files for the work, and the source code for shared libraries and dynamically linked subprograms that the work is specifically designed to require, such as by intimate data communication or control flow between those subprograms and other parts of the work.
The Corresponding Source need not include anything that users can regenerate automatically from other parts of the Corresponding Source.
The Corresponding Source for a work in source code form is that same work.
2. Basic Permissions.
All rights granted under this License are granted for the term of copyright on the Program, and are irrevocable provided the stated conditions are met. This License explicitly affirms your unlimited permission to run the unmodified Program. The output from running a covered work is covered by this License only if the output, given its content, constitutes a covered work. This License acknowledges your rights of fair use or other equivalent, as provided by copyright law.
You may make, run and propagate covered works that you do not convey, without conditions so long as your license otherwise remains in force. You may convey covered works to others for the sole purpose of having them make modifications exclusively for you, or provide you with facilities for running those works, provided that you comply with the terms of this License in conveying all material for which you do not control copyright. Those thus making or running the covered works for you must do so exclusively on your behalf, under your direction and control, on terms that prohibit them from making any copies of your copyrighted material outside their relationship with you.
Conveying under any other circumstances is permitted solely under the conditions stated below. Sublicensing is not allowed; section 10 makes it unnecessary.
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
No covered work shall be deemed part of an effective technological measure under any applicable law fulfilling obligations under article 11 of the WIPO copyright treaty adopted on 20 December 1996, or similar laws prohibiting or restricting circumvention of such measures.
When you convey a covered work, you waive any legal power to forbid circumvention of technological measures to the extent such circumvention is effected by exercising rights under this License with respect to the covered work, and you disclaim any intention to limit operation or modification of the work as a means of enforcing, against the work's users, your or third parties' legal rights to forbid circumvention of technological measures.
4. Conveying Verbatim Copies.
You may convey verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice; keep intact all notices stating that this License and any non-permissive terms added in accord with section 7 apply to the code; keep intact all notices of the absence of any warranty; and give all recipients a copy of this License along with the Program.
You may charge any price or no price for each copy that you convey, and you may offer support or warranty protection for a fee.
5. Conveying Modified Source Versions.
You may convey a work based on the Program, or the modifications to produce it from the Program, in the form of source code under the terms of section 4, provided that you also meet all of these conditions:
a) The work must carry prominent notices stating that you modified it, and giving a relevant date.
b) The work must carry prominent notices stating that it is released under this License and any conditions added under section 7. This requirement modifies the requirement in section 4 to “keep intact all notices”.
c) You must license the entire work, as a whole, under this License to anyone who comes into possession of a copy. This License will therefore apply, along with any applicable section 7 additional terms, to the whole of the work, and all its parts, regardless of how they are packaged. This License gives no permission to license the work in any other way, but it does not invalidate such permission if you have separately received it.
d) If the work has interactive user interfaces, each must display Appropriate Legal Notices; however, if the Program has interactive interfaces that do not display Appropriate Legal Notices, your work need not make them do so.
A compilation of a covered work with other separate and independent works, which are not by their nature extensions of the covered work, and which are not combined with it such as to form a larger program, in or on a volume of a storage or distribution medium, is called an “aggregate” if the compilation and its resulting copyright are not used to limit the access or legal rights of the compilation's users beyond what the individual works permit. Inclusion of a covered work in an aggregate does not cause this License to apply to the other parts of the aggregate.
6. Conveying Non-Source Forms.
You may convey a covered work in object code form under the terms of sections 4 and 5, provided that you also convey the machine-readable Corresponding Source under the terms of this License, in one of these ways:
a) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by the Corresponding Source fixed on a durable physical medium customarily used for software interchange.
b) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by a written offer, valid for at least three years and valid for as long as you offer spare parts or customer support for that product model, to give anyone who possesses the object code either (1) a copy of the Corresponding Source for all the software in the product that is covered by this License, on a durable physical medium customarily used for software interchange, for a price no more than your reasonable cost of physically performing this conveying of source, or (2) access to copy the Corresponding Source from a network server at no charge.
c) Convey individual copies of the object code with a copy of the written offer to provide the Corresponding Source. This alternative is allowed only occasionally and noncommercially, and only if you received the object code with such an offer, in accord with subsection 6b.
d) Convey the object code by offering access from a designated place (gratis or for a charge), and offer equivalent access to the Corresponding Source in the same way through the same place at no further charge. You need not require recipients to copy the Corresponding Source along with the object code. If the place to copy the object code is a network server, the Corresponding Source may be on a different server (operated by you or a third party) that supports equivalent copying facilities, provided you maintain clear directions next to the object code saying where to find the Corresponding Source. Regardless of what server hosts the Corresponding Source, you remain obligated to ensure that it is available for as long as needed to satisfy these requirements.
e) Convey the object code using peer-to-peer transmission, provided you inform other peers where the object code and Corresponding Source of the work are being offered to the general public at no charge under subsection 6d.
A separable portion of the object code, whose source code is excluded from the Corresponding Source as a System Library, need not be included in conveying the object code work.
A “User Product” is either (1) a “consumer product”, which means any tangible personal property which is normally used for personal, family, or household purposes, or (2) anything designed or sold for incorporation into a dwelling. In determining whether a product is a consumer product, doubtful cases shall be resolved in favor of coverage. For a particular product received by a particular user, “normally used” refers to a typical or common use of that class of product, regardless of the status of the particular user or of the way in which the particular user actually uses, or expects or is expected to use, the product. A product is a consumer product regardless of whether the product has substantial commercial, industrial or non-consumer uses, unless such uses represent the only significant mode of use of the product.
“Installation Information” for a User Product means any methods, procedures, authorization keys, or other information required to install and execute modified versions of a covered work in that User Product from a modified version of its Corresponding Source. The information must suffice to ensure that the continued functioning of the modified object code is in no case prevented or interfered with solely because modification has been made.
If you convey an object code work under this section in, or with, or specifically for use in, a User Product, and the conveying occurs as part of a transaction in which the right of possession and use of the User Product is transferred to the recipient in perpetuity or for a fixed term (regardless of how the transaction is characterized), the Corresponding Source conveyed under this section must be accompanied by the Installation Information. But this requirement does not apply if neither you nor any third party retains the ability to install modified object code on the User Product (for example, the work has been installed in ROM).
The requirement to provide Installation Information does not include a requirement to continue to provide support service, warranty, or updates for a work that has been modified or installed by the recipient, or for the User Product in which it has been modified or installed. Access to a network may be denied when the modification itself materially and adversely affects the operation of the network or violates the rules and protocols for communication across the network.
Corresponding Source conveyed, and Installation Information provided, in accord with this section must be in a format that is publicly documented (and with an implementation available to the public in source code form), and must require no special password or key for unpacking, reading or copying.
7. Additional Terms.
“Additional permissions” are terms that supplement the terms of this License by making exceptions from one or more of its conditions. Additional permissions that are applicable to the entire Program shall be treated as though they were included in this License, to the extent that they are valid under applicable law. If additional permissions apply only to part of the Program, that part may be used separately under those permissions, but the entire Program remains governed by this License without regard to the additional permissions.
When you convey a copy of a covered work, you may at your option remove any additional permissions from that copy, or from any part of it. (Additional permissions may be written to require their own removal in certain cases when you modify the work.) You may place additional permissions on material, added by you to a covered work, for which you have or can give appropriate copyright permission.
Notwithstanding any other provision of this License, for material you add to a covered work, you may (if authorized by the copyright holders of that material) supplement the terms of this License with terms:
a) Disclaiming warranty or limiting liability differently from the terms of sections 15 and 16 of this License; or
b) Requiring preservation of specified reasonable legal notices or author attributions in that material or in the Appropriate Legal Notices displayed by works containing it; or
c) Prohibiting misrepresentation of the origin of that material, or requiring that modified versions of such material be marked in reasonable ways as different from the original version; or
d) Limiting the use for publicity purposes of names of licensors or authors of the material; or
e) Declining to grant rights under trademark law for use of some trade names, trademarks, or service marks; or
f) Requiring indemnification of licensors and authors of that material by anyone who conveys the material (or modified versions of it) with contractual assumptions of liability to the recipient, for any liability that these contractual assumptions directly impose on those licensors and authors.
All other non-permissive additional terms are considered “further restrictions” within the meaning of section 10. If the Program as you received it, or any part of it, contains a notice stating that it is governed by this License along with a term that is a further restriction, you may remove that term. If a license document contains a further restriction but permits relicensing or conveying under this License, you may add to a covered work material governed by the terms of that license document, provided that the further restriction does not survive such relicensing or conveying.
If you add terms to a covered work in accord with this section, you must place, in the relevant source files, a statement of the additional terms that apply to those files, or a notice indicating where to find the applicable terms.
Additional terms, permissive or non-permissive, may be stated in the form of a separately written license, or stated as exceptions; the above requirements apply either way.
8. Termination.
You may not propagate or modify a covered work except as expressly provided under this License. Any attempt otherwise to propagate or modify it is void, and will automatically terminate your rights under this License (including any patent licenses granted under the third paragraph of section 11).
However, if you cease all violation of this License, then your license from a particular copyright holder is reinstated (a) provisionally, unless and until the copyright holder explicitly and finally terminates your license, and (b) permanently, if the copyright holder fails to notify you of the violation by some reasonable means prior to 60 days after the cessation.
Moreover, your license from a particular copyright holder is reinstated permanently if the copyright holder notifies you of the violation by some reasonable means, this is the first time you have received notice of violation of this License (for any work) from that copyright holder, and you cure the violation prior to 30 days after your receipt of the notice.
Termination of your rights under this section does not terminate the licenses of parties who have received copies or rights from you under this License. If your rights have been terminated and not permanently reinstated, you do not qualify to receive new licenses for the same material under section 10.
9. Acceptance Not Required for Having Copies.
You are not required to accept this License in order to receive or run a copy of the Program. Ancillary propagation of a covered work occurring solely as a consequence of using peer-to-peer transmission to receive a copy likewise does not require acceptance. However, nothing other than this License grants you permission to propagate or modify any covered work. These actions infringe copyright if you do not accept this License. Therefore, by modifying or propagating a covered work, you indicate your acceptance of this License to do so.
10. Automatic Licensing of Downstream Recipients.
Each time you convey a covered work, the recipient automatically receives a license from the original licensors, to run, modify and propagate that work, subject to this License. You are not responsible for enforcing compliance by third parties with this License.
An “entity transaction” is a transaction transferring control of an organization, or substantially all assets of one, or subdividing an organization, or merging organizations. If propagation of a covered work results from an entity transaction, each party to that transaction who receives a copy of the work also receives whatever licenses to the work the party's predecessor in interest had or could give under the previous paragraph, plus a right to possession of the Corresponding Source of the work from the predecessor in interest, if the predecessor has it or can get it with reasonable efforts.
You may not impose any further restrictions on the exercise of the rights granted or affirmed under this License. For example, you may not impose a license fee, royalty, or other charge for exercise of rights granted under this License, and you may not initiate litigation (including a cross-claim or counterclaim in a lawsuit) alleging that any patent claim is infringed by making, using, selling, offering for sale, or importing the Program or any portion of it.
11. Patents.
A “contributor” is a copyright holder who authorizes use under this License of the Program or a work on which the Program is based. The work thus licensed is called the contributor's “contributor version”.
A contributor's “essential patent claims” are all patent claims owned or controlled by the contributor, whether already acquired or hereafter acquired, that would be infringed by some manner, permitted by this License, of making, using, or selling its contributor version, but do not include claims that would be infringed only as a consequence of further modification of the contributor version. For purposes of this definition, “control” includes the right to grant patent sublicenses in a manner consistent with the requirements of this License.
Each contributor grants you a non-exclusive, worldwide, royalty-free patent license under the contributor's essential patent claims, to make, use, sell, offer for sale, import and otherwise run, modify and propagate the contents of its contributor version.
In the following three paragraphs, a “patent license” is any express agreement or commitment, however denominated, not to enforce a patent (such as an express permission to practice a patent or covenant not to sue for patent infringement). To “grant” such a patent license to a party means to make such an agreement or commitment not to enforce a patent against the party.
If you convey a covered work, knowingly relying on a patent license, and the Corresponding Source of the work is not available for anyone to copy, free of charge and under the terms of this License, through a publicly available network server or other readily accessible means, then you must either (1) cause the Corresponding Source to be so available, or (2) arrange to deprive yourself of the benefit of the patent license for this particular work, or (3) arrange, in a manner consistent with the requirements of this License, to extend the patent license to downstream recipients. “Knowingly relying” means you have actual knowledge that, but for the patent license, your conveying the covered work in a country, or your recipient's use of the covered work in a country, would infringe one or more identifiable patents in that country that you have reason to believe are valid.
If, pursuant to or in connection with a single transaction or arrangement, you convey, or propagate by procuring conveyance of, a covered work, and grant a patent license to some of the parties receiving the covered work authorizing them to use, propagate, modify or convey a specific copy of the covered work, then the patent license you grant is automatically extended to all recipients of the covered work and works based on it.
A patent license is “discriminatory” if it does not include within the scope of its coverage, prohibits the exercise of, or is conditioned on the non-exercise of one or more of the rights that are specifically granted under this License. You may not convey a covered work if you are a party to an arrangement with a third party that is in the business of distributing software, under which you make payment to the third party based on the extent of your activity of conveying the work, and under which the third party grants, to any of the parties who would receive the covered work from you, a discriminatory patent license (a) in connection with copies of the covered work conveyed by you (or copies made from those copies), or (b) primarily for and in connection with specific products or compilations that contain the covered work, unless you entered into that arrangement, or that patent license was granted, prior to 28 March 2007.
Nothing in this License shall be construed as excluding or limiting any implied license or other defenses to infringement that may otherwise be available to you under applicable patent law.
12. No Surrender of Others' Freedom.
If conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot convey a covered work so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not convey it at all. For example, if you agree to terms that obligate you to collect a royalty for further conveying from those to whom you convey the Program, the only way you could satisfy both those terms and this License would be to refrain entirely from conveying the Program.
13. Use with the GNU Affero General Public License.
Notwithstanding any other provision of this License, you have permission to link or combine any covered work with a work licensed under version 3 of the GNU Affero General Public License into a single combined work, and to convey the resulting work. The terms of this License will continue to apply to the part which is the covered work, but the special requirements of the GNU Affero General Public License, section 13, concerning interaction through a network will apply to the combination as such.
14. Revised Versions of this License.
The Free Software Foundation may publish revised and/or new versions of the GNU General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns.
Each version is given a distinguishing version number. If the Program specifies that a certain numbered version of the GNU General Public License “or any later version” applies to it, you have the option of following the terms and conditions either of that numbered version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the GNU General Public License, you may choose any version ever published by the Free Software Foundation.
If the Program specifies that a proxy can decide which future versions of the GNU General Public License can be used, that proxy's public statement of acceptance of a version permanently authorizes you to choose that version for the Program.
Later license versions may give you additional or different permissions. However, no additional obligations are imposed on any author or copyright holder as a result of your choosing to follow a later version.
15. Disclaimer of Warranty.
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM “AS IS” WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
16. Limitation of Liability.
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES.
17. Interpretation of Sections 15 and 16.
If the disclaimer of warranty and limitation of liability provided above cannot be given local legal effect according to their terms, reviewing courts shall apply local law that most closely approximates an absolute waiver of all civil liability in connection with the Program, unless a warranty or assumption of liability accompanies a copy of the Program in return for a fee.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively state the exclusion of warranty; and each file should have at least the “copyright” line and a pointer to where the full notice is found.
HeurAMS
Copyright (C) 2025 Wang Zhiyu
This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License along with this program. If not, see <https://www.gnu.org/licenses/>.
Also add information on how to contact you by electronic and paper mail.
If the program does terminal interaction, make it output a short notice like this when it starts in an interactive mode:
HeurAMS Copyright (C) 2025 Wang Zhiyu
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, your program's commands might be different; for a GUI interface, you would use an “about box”.
You should also get your employer (if you work as a programmer) or school, if any, to sign a “copyright disclaimer” for the program, if necessary. For more information on this, and how to apply and follow the GNU GPL, see <https://www.gnu.org/licenses/>.
The GNU General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Lesser General Public License instead of this License. But first, please read <https://www.gnu.org/philosophy/why-not-lgpl.html>.

61
NOTE.md Normal file
View File

@@ -0,0 +1,61 @@
# 实用技巧
## 用于数据组织的 prompt
```` markdown
1. 我应该先给你一个文件范例
```
# 散列表的键翻译
["keydata"]
note = "笔记"
keyword_note = "关键词翻译"
translation = "语句翻译"
# 测试项目元数据
["testdata"]
# 记忆时显示的额外信息
additional_inf = ["translation","keyword_note", "note"]
# 填空测试, content 指代键名
fill_blank_test = {"from"=["content"], "hint"=["translation"]}
# 选择题测试
draw_card_test = {"from"=["keyword_note"]}
["臣/密/言: /臣/以/险衅/, 夙/遭/闵凶./"] # 键名应该使用"/"基于意思断句(填空生成需要, 避免分离单个标点), 句末应该有断句, 不要断得太碎
note = []
translation = "臣子李密陈言: 我因命运不好, 小时候遭遇到了不幸"
keyword_note = {"险衅"="凶险祸患(这里指命运不好)", "夙"="早时, 这里指年幼的时候", "闵"="通'悯', 指可忧患的事", "凶"="不幸, 指丧父"}
["生孩/六月/, 慈父/见背/; /行年/四岁/, 舅/夺/母志./"]
note = []
translation = "刚出生六个月, 我慈爱的父亲就不幸去世了。经过了四年, 舅父逼母亲改嫁"
keyword_note = {"见背"="死的委婉说法", "行年"="经历的年岁", "母志"="母亲守节之志(改嫁的委婉说法)"}
["祖母/刘/愍/臣/孤弱/, 躬亲/抚养./"]
note = []
translation = "我的祖母刘氏, 怜悯我从小丧父, 便亲自对我加以抚养"
keyword_note = {"愍"="怜悯", "躬亲"="亲身"}
["臣/少/多/疾病/, 九岁/不行/, 零丁/孤苦/, 至于/成立./"]
note = []
translation = "臣小的时候经常生病, 九岁时还不会行走。孤独无靠, 一直到成人自立"
keyword_note = {"成立"="成人自立"}
["既/无/伯叔/, 终/鲜/兄弟/, 门/衰/祚/薄/, 晚/有/儿息./"]
note = []
translation = "既没有叔叔伯伯, 又没什么兄弟, 门庭衰微而福分浅薄, 很晚才有儿子"
keyword_note = {"鲜"="少, 这里指'无'", "祚薄"="福分浅薄", "儿息"="亲生子女"}
["外/无/期功/强近/之亲/, 内/无/应门/五尺/之僮/, 茕茕/孑立/, 形影/相吊./"]
note = []
translation = "在外面没有比较亲近的亲戚, 在家里又没有照应门户的童仆。生活孤单没有依靠, 每天只有自己的身体和影子相互安慰"
keyword_note = {"期功"="指关系较近的亲属", "茕茕孑立"="孤单无依靠的样子", "吊"="安慰"}
...# 还有重复
```
2. 这是新的信息
```
{源数据}
```
生成新的"{文件名}.toml"
````

View File

@@ -1,57 +1,94 @@
# 潜进 (HeurAMS) - 开放源代码实验型辅助记忆程序 # 潜进 (HeurAMS) - 启发式辅助记忆程序
> 形人而我无形,**则我专而敌分** > 形人而我无形,**则我专而敌分**
## 概述 ## 概述
"潜进" (HeurAMS: Heuristic Auxiliary Memorizing Scheduler, 启发式记忆辅助调度器) 是为习题册, 古诗词, 及其他问答/记忆/理解型知识设计的辅助记忆软件, 提供动态规划的优化记忆方案
"潜进" (HeurAMS, 中文含义: 启发式辅助记忆软件) 是一款为古诗词设计的记忆辅助软件, 集成记忆拟合算法、自然语音技术与生成式人工智能, 提供科学的记忆训练解决方案 ## 关于此仓库
"潜进" 软件组项目包含多个子项目:
- 此仓库包含了 "潜进" 项目的核心和基于 Textual 的基本用户界面的实现
- 关于基于 Flutter 的现代用户界面, 请参阅 "潜进-F" (HeurAMS-F) 仓库
- 关于数据同步实现, 请参阅 "潜进-S" (HeurSync) 仓库
- 关于云端文档源实现, 请参阅 "潜进-R" (HeurRepo) 仓库
## 核心特性 ## 开发计划
0.1.x: 简易调度器实现与最小原型
0.2.x: 使用 Textual 构建 TUI, 项目可行性验证与采用 SM-2 原始算法用户自评估的原型
0.3.x (当前): 基本数据结构, 基于 SM-2 改进算法的自动复习测评评估与遵从 IoC 设计的功能实现, 重点设计古诗文记忆理解功能, 以及 TUI 界面实现, 简单的语言模型集成
0.4.x: 更新文件格式, 引入动态数据结构(自动内容生成), 深度语言模型集成
0.5.x: 引入云同步与文档源
0.6.x: 引入其他算法接口, 与跨语言库引入, 使用 Flutter 构建跨平台现代客户端
### 科学记忆拟合算法 ## 技术集成与特性
- 采用经实证的 SM-2 间隔重复算法 ### 间隔迭代算法
- 动态优化每首诗词的记忆间隔时间表 > 许多出版物都广泛讨论了不同重复间隔对学习效果的影响。特别是,间隔效应被认为是一种普遍现象。间隔效应是指,如果重复的间隔是分散/稀疏的,而不是集中重复,那么学习任务的表现会更好。因此,有观点提出,学习中使用的最佳重复间隔是**最长的、但不会导致遗忘的间隔**。
- 实时跟踪记忆曲线,最大化长期记忆保留率与稳定性 - 采用经实证的 SM-2 间隔迭代算法, 此算法亦用作 Anki 闪卡记忆软件的默认闪卡调度器
> 计划: 将添加 FSRS 算法 (Anki 的新可选闪卡调度器) 与一种 SM-15 变体算法作为后续替代
> 参考 https://github.com/slaypni/SM-15
> 使用 SM-15 的变体:
> SM-2 后续算法并非完全开放, 故使用一种基于 SM-15 描述实现的变体算法
- 动态规划每个记忆单元的记忆间隔时间表
- 动态跟踪记忆反馈数据,优化长期记忆保留率与稳定性
### 技术集成与优化 ### 学习进程优化
- 逐字解析:支持点击查看每个字的详细释义 - 逐字解析:支持逐字详细释义解析
- 语法分析:接入生成式人工智能, 支持古文结构**交互式**解析 - 语法分析:接入生成式人工智能, 支持古文结构交互式解析
- 自然语音:集成微软神经网络文本转语音 (TTS) 技术 - 自然语音:集成微软神经网络文本转语音 (TTS) 技术
### 现代用户界面 ### 实用用户界面
- 响应式 Textual 框架构建的跨平台 TUI 界面 - 响应式 Textual 框架构建的跨平台 TUI 界面
- 支持触屏/鼠标/键盘多操作模式 - 支持触屏/鼠标/键盘多操作模式
- 简洁直观的复习流程设计 - 简洁直观的复习流程设计
## 屏幕截图 (基本用户界面)
> 单击图片以放大
<img src="./readme_src/img1.png" alt="img1" style="zoom: 33%;" />
<img src="./readme_src/img2.png" alt="img2" style="zoom:33%;" />
<img src="./readme_src/img3.png" alt="img3" style="zoom:33%;" />
<img src="./readme_src/img4.png" alt="img4" style="zoom:33%;" />
## 技术架构 ## 技术架构
> 有关技术与实现的细节, 请参阅 CONTRIBUTING.md
> 提交拉取请求以参与到此开放源代码项目
``` mermaid ``` mermaid
graph TD graph TD
subgraph 后端 subgraph 后端
A[SM-2算法] --> B[间隔预测引擎] A[SM-2 算法] --> B[间隔迭代算法]
B --> C[个性化记忆模型] B --> C[迭代记忆参数]
end end
subgraph 用户界面 subgraph 用户界面
D[诗词展示模块] --> E[交互复习界面] D[展示模块] --> E[用户界面]
E --> F[进度追踪面板] E --> F[进度追踪面板]
end end
subgraph 外部服务 subgraph 外部服务
G[词义解析] G[LLM]
H[语法分析] H[TTS]
I[语音合成]
end end
C --> D C --> D
F -->|用户数据| C F -->|用户数据| C
D --> G D --> G
D --> H D --> H
D --> I
``` ```
## 系统要求 ## 系统与平台要求
- 平台支持Windows / macOS / Linux / Android(需要 Termux) (终端或浏览器) - 依赖组件: Python 3.7+ (与 PIP), Git (半自动更新 & 安装需要), requirements.txt 中依赖包
- 可选依赖: curl (首次下载需要)
- 平台支持Windows / macOS / Linux / Android (需要 Termux 或 Linux) (终端或浏览器)
- 网络连接:可预缓存语音文件, 需联网使用大模型服务功能 - 网络连接:可预缓存语音文件, 需联网使用大模型服务功能
运行此命令以在具备以上前置条件的计算机上快速安装/保留数据更新:
```
curl -O https://gitea.imwangzhiyu.xyz/ajax/HeurAMS/raw/branch/main/tweak.py
python3 tweak.py
```

Binary file not shown.

42
assets/heurams.svg Normal file
View File

@@ -0,0 +1,42 @@
<?xml version="1.0" encoding="utf-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<svg xmlns:xlink="http://www.w3.org/1999/xlink" width="554.4pt" height="554.4pt" viewBox="0 0 554.4 554.4" xmlns="http://www.w3.org/2000/svg" version="1.1">
<defs>
<style type="text/css">*{stroke-linejoin: round; stroke-linecap: butt}</style>
</defs>
<g id="figure_1">
<g id="patch_1">
<path d="M 0 554.4
L 554.4 554.4
L 554.4 0
L 0 0
L 0 554.4
z
" style="fill: none"/>
</g>
<g id="axes_1">
<g id="patch_2">
<path d="M 66.528 487.872
L 199.584 487.872
L 199.584 354.816
L 66.528 354.816
z
" clip-path="url(#p4da876c7a0)" style="fill: #1660a5; stroke: #1660a5; stroke-linejoin: miter"/>
</g>
<g id="patch_3">
<path d="M 199.584 354.816
L 487.872 354.816
L 487.872 66.528
L 199.584 66.528
z
" clip-path="url(#p4da876c7a0)" style="fill: #545f70; stroke: #545f70; stroke-linejoin: miter"/>
</g>
</g>
</g>
<defs>
<clipPath id="p4da876c7a0">
<rect x="0" y="0" width="554.4" height="554.4"/>
</clipPath>
</defs>
</svg>

After

Width:  |  Height:  |  Size: 1.1 KiB

View File

@@ -1,33 +1,67 @@
import time import time
import pathlib import pathlib
import toml import toml
import typing
from playsound import playsound
import threading
import hashlib
import edge_tts as tts
class ConfigFile(): class ConfigFile:
def __init__(self, path): def __init__(self, path: str):
self.path = pathlib.Path(path) self.path = pathlib.Path(path)
if self.path.exists() == 0: if not self.path.exists():
self.path.touch() self.path.touch()
self.data = dict() self.data = dict()
self._load()
def _load(self):
"""从文件加载配置数据"""
with open(self.path, 'r') as f: with open(self.path, 'r') as f:
self.data = toml.load(f) try:
def modify(self, key, value): self.data = toml.load(f)
except toml.TomlDecodeError:
self.data = {}
def modify(self, key: str, value: typing.Any):
"""修改配置值并保存"""
self.data[key] = value self.data[key] = value
self.save() self.save()
def save(self, path=""):
if path == "": def save(self, path: typing.Union[str, pathlib.Path] = ""):
path = self.path """保存配置到文件"""
with open(path, 'w') as f: save_path = pathlib.Path(path) if path else self.path
with open(save_path, 'w') as f:
toml.dump(self.data, f) toml.dump(self.data, f)
def get(self, key, default = None):
def get(self, key: str, default: typing.Any = None) -> typing.Any:
"""获取配置值,如果不存在返回默认值"""
return self.data.get(key, default) return self.data.get(key, default)
def get_daystamp() -> int: def action_play_voice(content):
config = ConfigFile("config.toml")
if config.get("auto_voice", False):
return
def play():
communicate = tts.Communicate(
content,
"zh-CN-YunjianNeural",
)
communicate.save_sync(
f"./cache/voice/{content}.wav"
)
playsound(f"./cache/voice/{content}.wav")
threading.Thread(target=play).start()
def get_daystamp() -> int:
"""获取当前日戳(以天为单位的整数时间戳)"""
config = ConfigFile("config.toml") config = ConfigFile("config.toml")
time_override = config.get("time_override", -1) time_override = config.get("time_override", -1)
if time_override is not None and time_override != -1: if time_override != -1:
print(f"TIME OVERRIDEED TO {time_override}")
return int(time_override) return int(time_override)
return int(time.time() // (24 * 3600)) return int((time.time()+config.get("timezone_offset")) // (24 * 3600))
def get_md5(text):
return hashlib.md5(text.encode('utf-8')).hexdigest()

297
compositions.py Normal file
View File

@@ -0,0 +1,297 @@
from textual.app import App, ComposeResult
from textual.events import Event
from textual.widgets import (
Collapsible,
Header,
Footer,
Markdown,
ListView,
ListItem,
Label,
Static,
Button,
)
from textual.containers import Container, Horizontal, Center
from textual.screen import Screen
from textual.widget import Widget
import uuid
from typing import Tuple, Dict
import particles as pt
import puzzles as pz
import re
import random
import copy
class Composition:
def __init__(
self,
screen: Screen,
reactor,
atom: Tuple[pt.Electron, pt.Nucleon, Dict] = pt.Atom.placeholder(),
):
self.screen = screen
self.atom = atom
from reactor import Reactor
self.reactor: Reactor = reactor
self.reg = dict()
def regid(self, id_):
self.reg[id_] = id_ + str(uuid.uuid4())
return self.reg[id_]
def getid(self, id_):
if id_ not in self.reg.keys():
return "None"
return self.reg[id_]
def recid(self, id_):
return id_[:-36]
def compose(self):
yield Label("示例标签", id="testlabel")
yield Button("示例按钮", id="testbtn")
def handler(self, event, type_):
return 1
class Finished(Composition):
def __init__(self, screen: Screen, reactor, atom: Tuple[pt.Electron, pt.Nucleon, Dict]):
super().__init__(screen, reactor, atom)
def compose(self):
yield Label("本次记忆进程结束", id=self.regid("msg"))
class Placeholder(Composition):
def __init__(self, screen: Screen):
self.screen = screen
def compose(self):
yield Label("示例标签", id="testlabel")
yield Button("示例按钮", id="testbtn", classes="choice")
def handler(self, event, type_):
self.screen.query_one("#testlabel", Label).update("hi")
class Recognition(Composition):
def __init__(self, screen: Screen, reactor, atom: Tuple[pt.Electron, pt.Nucleon, Dict]):
super().__init__(screen, reactor, atom)
def compose(self):
with Center():
yield Static(f"[dim]{self.atom[1]['translation']}[/]")
yield Label(f"")
s = str(self.atom[1]["content"])
replace_dict = {
", ": ",",
". ": ".",
"; ": ";",
": ": ":",
"/,": ",",
"./": ".",
"/;": ";",
";/": ";",
":/": ":",
}
for old, new in replace_dict.items():
s = s.replace(old, new)
result = re.split(r"(?<=[,;:|])", s.replace("/", " "))
for i in result:
with Center():
yield Label(
f"[b][b]{i.replace('/', ' ')}[/][/]",
id=self.regid("sentence" + str(hash(i))),
)
for i in self.atom[2]["testdata"]["additional_inf"]:
if self.atom[1][i]:
if isinstance(self.atom[1][i], list):
for j in self.atom[1][i]:
yield Markdown(f"### {self.atom[2]['keydata'][i]}: {j}")
continue
if isinstance(self.atom[1][i], Dict):
t = ""
for j, k in self.atom[1][i].items(): # type: ignore
# 弱智的 Pylance 类型推导
t += f"> **{j}**: {k} \n"
yield Markdown(t, id=self.regid("tran"))
with Center():
yield Button("我已知晓", id=self.regid("ok"))
def handler(self, event, type_):
if type_ == "button":
if event.button.id == self.getid("ok"):
self.reactor.report(self.atom, 5)
return 0
return -1
class BasicEvaluation(Composition):
def __init__(self, screen: Screen, reactor, atom: Tuple[pt.Electron, pt.Nucleon, Dict]):
super().__init__(screen, reactor, atom)
def compose(self):
yield Label(self.atom[1]["content"], id="sentence")
with Container(id="button_container"):
btn = {}
btn["5"] = Button(
"完美回想", variant="success", id=self.regid("feedback5"), classes="choice"
)
btn["4"] = Button(
"犹豫后正确", variant="success", id=self.regid("feedback4"), classes="choice"
)
btn["3"] = Button(
"困难地正确", variant="warning", id=self.regid("feedback3"), classes="choice"
)
btn["2"] = Button(
"错误但熟悉", variant="warning", id=self.regid("feedback2"), classes="choice"
)
btn["1"] = Button(
"错误且不熟", variant="error", id=self.regid("feedback1"), classes="choice"
)
btn["0"] = Button(
"完全空白", variant="error", id=self.regid("feedback0"), classes="choice"
)
yield Horizontal(btn["5"], btn["4"])
yield Horizontal(btn["3"], btn["2"])
yield Horizontal(btn["1"], btn["0"])
def handler(self, event, type_):
if "feedback" in event.button.id:
assess = int(self.recid(event.button.id)[8:9])
ret = self.reactor.report(self.atom, assess)
return ret
class FillBlank(Composition):
def __init__(self, screen: Screen, reactor, atom: Tuple[pt.Electron, pt.Nucleon, Dict]):
super().__init__(screen, reactor, atom)
self.inputlist = []
self.hashtable = {}
self._work()
def _work(self):
self.puzzle = pz.BlankPuzzle(self.atom[1]["content"], 2)
self.puzzle.refresh()
self.ans = copy.copy(self.puzzle.answer)
random.shuffle(self.ans)
def compose(self):
yield Label(self.puzzle.wording, id=self.regid("sentence"))
yield Label(f"当前输入: {self.inputlist}", id=self.regid("inputpreview"))
for i in self.ans:
self.hashtable[str(hash(i))] = i
yield Button(i, id=self.regid(f"select{hash(i)}"))
yield Button("退格", id=self.regid(f"delete"))
def handler(self, event, type_):
# TODO: 改动:在线错误纠正
if type_ == "button":
if self.recid(event.button.id) == "delete":
if len(self.inputlist) > 0:
self.inputlist.pop()
else:
return 1
else:
self.inputlist.append(self.hashtable[self.recid(event.button.id)[6:]])
if len(self.inputlist) < len(self.puzzle.answer):
return 1
else:
if self.inputlist == self.puzzle.answer:
self.reactor.report(self.atom, 4)
return 0
else:
self.inputlist = []
self.reactor.report(self.atom, 2)
return 1
class DrawCard(Composition):
def __init__(self, screen: Screen, reactor, atom: Tuple[pt.Electron, pt.Nucleon, Dict]):
super().__init__(screen, reactor, atom)
self.inputlist = []
self.hashtable = {}
self._work()
def _work(self):
self.puzzle = pz.SelectionPuzzle(self.atom[1]["keyword_note"], [], 2, "选择正确词义: ") # type: ignore
self.puzzle.refresh()
def compose(self):
yield Label(self.atom[1].content.replace("/",""), id=self.regid("sentence"))
yield Label(self.puzzle.wording[len(self.inputlist)], id=self.regid("puzzle"))
yield Label(f"当前输入: {self.inputlist}", id=self.regid("inputpreview"))
for i in self.puzzle.options[len(self.inputlist)]:
self.hashtable[str(hash(i))] = i
yield Button(i, id=self.regid(f"select{hash(i)}"))
yield Button("退格", id=self.regid(f"delete"))
def handler(self, event, type_):
if type_ == "button":
if self.recid(event.button.id) == "delete":
if len(self.inputlist) > 0:
self.inputlist.pop()
else:
return 1
else:
self.inputlist.append(self.hashtable[self.recid(event.button.id)[6:]])
if len(self.inputlist) < len(self.puzzle.answer):
return 1
else:
if self.inputlist == self.puzzle.answer:
self.reactor.report(self.atom, 4)
return 0
else:
self.inputlist = []
self.reactor.report(self.atom, 2)
return 1
registry = {
"sample": Composition,
"recognition": Recognition,
"fill_blank_test": FillBlank,
"draw_card_test": DrawCard,
"basic_evaluation": BasicEvaluation,
}
class TestScreen(Screen):
def __init__(self):
super().__init__(name=None, id=None, classes=None)
self.comp = Recognition(self, None, pt.Atom.advanced_placeholder())
def compose(self) -> ComposeResult:
yield Header(show_clock=True)
yield from self.comp.compose()
yield Footer()
def on_mount(self) -> None:
pass
def on_button_pressed(self, event: Event) -> None:
self.comp.handler(event, "button")
def action_quit_app(self) -> None:
self.app.exit()
class AppLauncher(App):
CSS_PATH = "styles.css"
TITLE = "测试布局"
BINDINGS = [("escape", "quit", "退出"), ("d", "toggle_dark", "改变色调")]
SCREENS = {
"testscreen": TestScreen,
}
def on_mount(self) -> None:
self.action_toggle_dark()
self.push_screen("testscreen")
if __name__ == "__main__":
app = AppLauncher()
app.run()

View File

@@ -1,8 +1,10 @@
# [调试] 将更改保存到文件 # [调试] 将更改保存到文件
save = 1 save = 1
# [调试] 覆写时间 # [调试] 覆写时间, 设为 -1 以禁用
time_override = 10 time_override = -1
# [调试] 一键通过
quick_pass = 0
# 对于每个项目的新记忆核子数量 # 对于每个项目的新记忆核子数量
tasked_number = 12 tasked_number = 6
# 竖屏适配 # UTC 时间戳修正 用于 UNIX 日时间戳的生成修正, 单位为秒
mobile_mode = 1 timezone_offset = +28800 # 中国标准时间 (UTC+8)

40
install.bat Normal file
View File

@@ -0,0 +1,40 @@
@echo off
echo "HeurAMS 环境安装脚本"
echo "正在检测系统中是否安装 Python 3.x..."
rem 检查 Python 3 是否存在
where python >nul 2>nul
if %errorlevel% neq 0 (
echo "错误: 未检测到 Python. 请确保 Python 已添加到系统 PATH 中,然后再次运行此脚本。"
exit /b 1
)
rem 检查 Python 版本是否为 3.x
for /f "tokens=*" %%i in ('python -c "import sys; print(f'{sys.version_info.major}')"') do set PYTHON_MAJOR_VERSION=%%i
if "%PYTHON_MAJOR_VERSION%"=="3" (
for /f "tokens=*" %%i in ('python -c "import sys; print(f'{sys.version_info.major}.{sys.version_info.minor}')"') do set PYTHON_VERSION=%%i
echo "检测到 Python 3 已安装, 版本为: %PYTHON_VERSION%"
) else (
echo "错误: 未检测到 Python 3. 请先安装 Python 3, 然后再次运行此脚本."
exit /b 1
)
echo "---"
echo "正在安装 requirements.txt 中的依赖..."
rem 检查 requirements.txt 文件是否存在
if exist "requirements.txt" (
python -m pip install -r requirements.txt
if %errorlevel% equ 0 (
echo "依赖安装成功."
) else (
echo "错误: 依赖安装失败. 请检查 requirements.txt 文件或网络连接."
exit /b 1
)
) else (
echo "警告: 未找到 requirements.txt 文件. 跳过依赖安装."
)
echo "---"
echo "HeurAMS 的环境依赖已安装"
pause

28
install.sh Normal file
View File

@@ -0,0 +1,28 @@
#!/bin/bash
echo "HeurAMS 环境安装脚本"
echo "正在检测系统中是否安装 Python 3.x..."
if command -v python3 &>/dev/null; then
PYTHON_VERSION=$(python3 -c "import sys; print(f'{sys.version_info.major}.{sys.version_info.minor}')")
echo "检测到 Python 3 已安装, 版本为: ${PYTHON_VERSION}"
else
echo "错误: 未检测到 Python 3. 请先安装 Python 3, 然后再次运行此脚本. "
exit 1 # 退出脚本, 因为 Python 3 是必需的
fi
echo "---"
echo "正在安装 requirements.txt 中的依赖..."
if [ -f "requirements.txt" ]; then
python3 -m pip install -r requirements.txt
if [ $? -eq 0 ]; then
echo "依赖安装成功. "
else
echo "错误: 依赖安装失败. 请检查 requirements.txt 文件或网络连接. "
exit 1
fi
else
echo "警告: 未找到 requirements.txt 文件. 跳过依赖安装. "
fi
echo "---"
echo "HeurAMS 的环境依赖已安装"

1
llmplugin.py Normal file
View File

@@ -0,0 +1 @@
# 语言模型接入

248
main.py
View File

@@ -1,245 +1,23 @@
from textual.app import App, ComposeResult from textual.app import App
from textual.widgets import Header, Footer, ListView, ListItem, Label, Static, Button import screens
from textual.containers import Container, Horizontal import os
from textual.screen import Screen
import pathlib
import threading
import edge_tts as tts
from playsound import playsound
from textual.logging import TextualHandler
import particles as pt
from reactor import Reactor
import auxiliary as aux
ver = '0.2.4'
config = aux.ConfigFile("config.toml")
class MemScreen(Screen):
BINDINGS = [
("d", "toggle_dark", "改变色调"),
("q", "pop_screen", "返回主菜单"),
("v", "play_voice", "朗读"),
("0", "press('q0')", None),
("1", "press('q1')", None),
("2", "press('q2')", None),
("3", "press('q3')", None),
("4", "press('q4')", None),
("5", "press('q5')", None),
("[", "press('q5')", None),
("]", "press('q4')", None),
(";", "press('q3')", None),
("'", "press('q2')", None),
(".", "press('q1')", None),
("/", "press('q0')", None),
]
btn = dict()
def __init__(
self,
nucleon_file: pt.AtomicFile,
electron_file: pt.AtomicFile,
tasked_num
):
super().__init__(name=None, id=None, classes=None)
self.reactor = Reactor(nucleon_file, electron_file, tasked_num)
self.stage = 1
self.stage += self.reactor.set_round_templated(self.stage)
#print(self.reactor.procession)
self.reactor.forward()
def compose(self) -> ComposeResult:
yield Header(show_clock=True)
with Container(id="main_container"):
yield Label(self.reactor.round_title, id="round_title")
yield Label("记住了吗?", id="question")
yield Static(self.reactor.current_atom[1].content, id="sentence")
yield Static("", id="feedback") # 用于显示反馈
yield Label(self._get_progress_text(), id="progress")
with Container(id="button_container"):
self.btn['5'] = Button("完美回想", variant="success", id="q5", classes="choice")
self.btn['4'] = Button("犹豫后正确", variant="success", id="q4", classes="choice")
self.btn['3'] = Button("困难地正确", variant="warning", id="q3", classes="choice")
self.btn['2'] = Button("错误但熟悉", variant="warning", id="q2", classes="choice")
self.btn['1'] = Button("错误且不熟", variant="error", id="q1", classes="choice")
self.btn['0'] = Button("完全空白", variant="error", id="q0", classes="choice")
yield Horizontal(self.btn['5'], self.btn['4'])
yield Horizontal(self.btn['3'], self.btn['2'])
yield Horizontal(self.btn['1'], self.btn['0'])
yield Footer()
def _get_progress_text(self):
return f"{len(self.reactor.procession) - self.reactor.index}/{len(self.reactor.procession)}"
def on_mount(self):
# 首次挂载时调用
self._update_ui()
def _update_ui(self):
self.query_one("#round_title", Label).update(self.reactor.round_title)
self.query_one("#sentence", Static).update(self.reactor.current_atom[1].content)
self.query_one("#progress", Label).update(self._get_progress_text())
self.query_one("#feedback", Static).update("") # 清除任何之前的反馈消息
def _show_finished_screen(self, message):
self.query_one("#question", Label).update(message)
self.query_one("#sentence", Static).update("已经完成记忆任务")
self.query_one("#round_title").display = False
self.query_one("#progress").display = False
for i in range(6):
self.query_one(f"#q{i}", Button).display = False
def on_button_pressed(self, event):
feedback_label = self.query_one("#feedback", Static)
if type(event) == str:
btnid = event
else:
btnid = event.button.id
btnid = str(btnid)
quality = int(btnid.replace('q', ''))
assessment = self.reactor.report(self.reactor.current_atom, quality)
if assessment == 1:
# 需要复习
feedback_label.update(f"评分为 {quality}, 已经加入至复习, 请重复记忆")
else:
ret = self.reactor.forward(1)
if ret == -1:
if self.reactor.round_set == 0:
if self.stage == 4:
# NOTE #
if config.get("save"):
self.reactor.save()
self._show_finished_screen("今日目标已完成")
else:
self.reactor.set_round_templated(self.stage)
self.reactor.forward(1)
self._update_ui()
self.stage += 1
return
#feedback_label.update("") # 清除反馈消息
self._update_ui()
def action_press(self, btnid):
self.on_button_pressed(btnid)
def action_play_voice(self):
def play():
cache_dir = pathlib.Path(f"./cache/voice/")
cache_dir.mkdir(parents = True, exist_ok = True)
cache = cache_dir / f"{self.reactor.current_atom[1].content}.wav"
if not cache.exists():
communicate = tts.Communicate(self.reactor.current_atom[1].content, "zh-CN-YunjianNeural")
communicate.save_sync(f"./cache/voice/{self.reactor.current_atom[1].content}.wav")
playsound(str(cache))
threading.Thread(target=play).start()
def action_toggle_dark(self):
self.app.action_toggle_dark()
def action_pop_screen(self):
"""返回到上一个屏幕"""
self.app.pop_screen()
class PreparationScreen(Screen):
BINDINGS = [
("q", "go_back", "返回"),
("escape", "quit_app", "退出")
]
def __init__(self, nucleon_file: pt.AtomicFile, electron_file: pt.AtomicFile) -> None:
super().__init__(name=None, id=None, classes=None)
self.nucleon_file = nucleon_file
self.electron_file = electron_file
def compose(self) -> ComposeResult:
yield Header(show_clock=True)
with Container(id="learning_screen_container"):
yield Label(f"记忆项目: [b]{self.nucleon_file.name}[/b]\n")
yield Label(f"核子文件对象: ./nucleon/[b]{self.nucleon_file.name}[/b].toml")
yield Label(f"电子文件对象: ./electron/[b]{self.electron_file.name}[/b].toml")
yield Label(f"核子数量:{self.nucleon_file.get_len()}")
yield Button("开始记忆", id="start_memorizing_button", variant="primary", classes="start-button")
yield Static(f"\n全文如下:\n")
yield Static(self.nucleon_file.get_full_content(), classes="full")
yield Footer()
def action_go_back(self):
self.app.pop_screen()
def action_quit_app(self):
self.app.exit()
def on_button_pressed(self, event: Button.Pressed) -> None:
pass
if event.button.id == "start_memorizing_button":
#init_file(Path(self.atom_file).name)
newscr = MemScreen(self.nucleon_file, self.electron_file, config.get("tasked_number", 8))
self.app.push_screen(
newscr
)
#if event.button.id == "edit_metadata_button":
# init_file(Path(self.atom_file).name)
# os.system("reset;nano ./data/" + str(Path(self.atom_file).name.replace(".txt", "_atoms.json")))
class FileSelectorScreen(Screen):
global ver
def compose(self) -> ComposeResult:
yield Header(show_clock=True)
yield Container(
Label(f'欢迎使用 "潜进" 辅助记忆软件, 版本 {ver}', classes="title-label"),
Label("选择要学习的文件:", classes="title-label"),
ListView(id="file-list", classes="file-list-view")
)
yield Footer()
def on_mount(self) -> None:
file_list_widget = self.query_one("#file-list", ListView)
nucleon_path = pathlib.Path("./nucleon")
nucleon_files = sorted([f.name for f in nucleon_path.iterdir() if f.suffix == ".toml"])
if nucleon_files:
for filename in nucleon_files:
file_list_widget.append(ListItem(Label(filename)))
else:
file_list_widget.append(ListItem(Static("在 ./nucleon/ 中未找到任何核子文件. 请放置文件后重启应用.")))
file_list_widget.disabled = True
def on_list_view_selected(self, event: ListView.Selected) -> None:
if not isinstance(event.item, ListItem):
self.notify("无法选择此项。", severity="error")
return
selected_label = event.item.query_one(Label)
if "未找到任何 .toml 文件" in str(selected_label.renderable):
self.notify("请先在 `./atoms/` 目录中放置 .toml 文件。", severity="warning")
return
selected_filename = str(selected_label.renderable)
nucleon_file = pt.AtomicFile(pathlib.Path("./nucleon") / selected_filename, "nucleon")
electron_file_path = pathlib.Path("./electron") / selected_filename
if electron_file_path.exists():
pass
else:
electron_file_path.touch()
electron_file = pt.AtomicFile(pathlib.Path("./electron") / selected_filename, "electron")
# self.notify(f"已选择: {selected_filename}", timeout=2)
self.app.push_screen(PreparationScreen(nucleon_file, electron_file))
def action_quit_app(self) -> None:
self.app.exit()
class AppLauncher(App): class AppLauncher(App):
CSS_PATH = "styles.tcss" CSS_PATH = "styles.css"
TITLE = '潜进 - 辅助记忆程序' TITLE = "潜进 - 辅助记忆调度器"
BINDINGS = [("escape", "quit", "退出"), ("d", "toggle_dark", "改变色调")] BINDINGS = [("escape", "quit", "退出"), ("d", "toggle_dark", "改变色调")]
SCREENS = { SCREENS = {
"file_selection_screen": FileSelectorScreen, "dashboard": screens.DashboardScreen,
} }
def on_mount(self) -> None: def on_mount(self) -> None:
self.action_toggle_dark() self.push_screen("dashboard")
self.push_screen("file_selection_screen")
if __name__ == "__main__": if __name__ == "__main__":
script_dir = os.path.dirname(os.path.abspath(__file__))
os.chdir(script_dir)
os.makedirs("electron", exist_ok=True)
os.makedirs("nucleon", exist_ok=True)
os.makedirs("cache/voice", exist_ok=True)
app = AppLauncher() app = AppLauncher()
app.run() app.run()

2
metadata.py Normal file
View File

@@ -0,0 +1,2 @@
ver = "0.3.6"
stage = "stable"

View File

@@ -1,139 +0,0 @@
["臣密言:臣以险衅, 夙遭闵凶."]
note = []
translation = "臣子李密陈言:我因命运不好,小时候遭遇到了不幸"
keyword_note = {"险衅"="凶险祸患(这里指命运不好)", "夙"="早时,这里指年幼的时候", "闵"="通'悯',指可忧患的事", "凶"="不幸,指丧父"}
["生孩六月, 慈父见背;行年四岁, 舅夺母志."]
note = []
translation = "刚出生六个月,我慈爱的父亲就不幸去世了。经过了四年,舅父逼母亲改嫁"
keyword_note = {"见背"="死的委婉说法", "行年"="经历的年岁", "母志"="母亲守节之志(改嫁的委婉说法)"}
["祖母刘愍臣孤弱, 躬亲抚养."]
note = []
translation = "我的祖母刘氏,怜悯我从小丧父,便亲自对我加以抚养"
keyword_note = {"愍"="怜悯", "躬亲"="亲身"}
["臣少多疾病, 九岁不行, 零丁孤苦, 至于成立."]
note = []
translation = "臣小的时候经常生病,九岁时还不会行走。孤独无靠,一直到成人自立"
keyword_note = {"成立"="成人自立"}
["既无伯叔, 终鲜兄弟, 门衰祚薄, 晚有儿息."]
note = []
translation = "既没有叔叔伯伯,又没什么兄弟,门庭衰微而福分浅薄,很晚才有儿子"
keyword_note = {"鲜"="少,这里指'无'", "祚薄"="福分浅薄", "儿息"="亲生子女"}
["外无期功强近之亲, 内无应门五尺之僮, 茕茕孑立, 形影相吊."]
note = []
translation = "在外面没有比较亲近的亲戚,在家里又没有照应门户的童仆。生活孤单没有依靠,每天只有自己的身体和影子相互安慰"
keyword_note = {"期功"="指关系较近的亲属", "茕茕孑立"="孤单无依靠的样子", "吊"="安慰"}
["而刘夙婴疾病, 常在床蓐, 臣侍汤药, 未曾废离."]
note = []
translation = "但祖母又早被疾病缠绕,常年卧床不起,我侍奉她吃饭喝药,从来就没有停止侍奉而离开她"
keyword_note = {"婴"="被...缠绕", "蓐"="通'褥',床垫", "废"="停止服侍", "离"="离开"}
["逮奉圣朝, 沐浴清化."]
note = []
translation = "到了晋朝建立,我蒙受着清明的政治教化"
keyword_note = {"逮"="及,到", "奉"="承奉", "圣朝"="指当时的晋朝", "沐浴清化"="蒙受清平教化"}
["前太守臣逵察臣孝廉;后刺史臣荣举臣秀才."]
note = []
translation = "前任太守逵,考察后推举臣下为孝廉,后任刺史荣又推举臣下为优秀人才"
keyword_note = {"察"="考察和推举", "孝廉"="孝顺,品性纯洁", "举"="推举", "秀才"="优秀人才"}
["臣以供养无主, 辞不赴命."]
note = []
translation = "臣下因为供奉赡养祖母的事无人承担,辞谢不接受任命"
keyword_note = {"无主"="无人承担"}
["诏书特下, 拜臣郎中, 寻蒙国恩, 除臣洗马."]
note = []
translation = "朝廷又特地下了诏书,任命我为郎中,不久又蒙受国家恩命,任命我为太子洗马"
keyword_note = {"拜"="授予官职", "郎中"="尚书省的属官", "寻"="不久", "除"="拜官受职", "洗马"="太子的属官"}
["猥以微贱, 当侍东宫, 非臣陨首所能上报."]
note = []
translation = "像我这样出身微贱地位卑下的人,担当侍奉太子的职务,这实在不是我杀身捐躯所能报答朝廷的"
keyword_note = {"猥"="谦词", "微贱"="卑微低贱", "东宫"="太子居处", "陨首"="杀身"}
["臣具以表闻, 辞不就职."]
note = []
translation = "我将以上苦衷上表报告,加以推辞不去就职"
keyword_note = {"具"="详细", "闻"="使...知道"}
["诏书切峻, 责臣逋慢;郡县逼迫, 催臣上道;州司临门, 急于星火."]
note = []
translation = "但是诏书急切严峻,责备我逃避命令,有意拖延,态度傲慢。郡县长官催促我立刻上路;州官登门督促,比流星坠落还要急迫"
keyword_note = {"切峻"="急切而严厉", "逋慢"="逃避怠慢", "星火"="流星的光,喻急迫"}
["臣欲奉诏奔驰, 则刘病日笃, 欲苟顺私情, 则告诉不许."]
note = []
translation = "我很想遵从皇上的旨意赴京就职,但祖母刘氏的病却一天比一天重;想要姑且顺从自己的私情,但报告申诉不被允许"
keyword_note = {"日笃"="病情日益加重", "苟"="姑且", "告诉"="报告申诉"}
["臣之进退, 实为狼狈."]
note = []
translation = "我是进退两难,十分狼狈"
keyword_note = {"狼狈"="进退两难的样子"}
["伏惟圣朝以孝治天下, 凡在故老, 犹蒙矜育, 况臣孤苦, 特为尤甚."]
note = []
translation = "我俯伏思量晋朝是用孝道来治理天下的,凡是年老而德高的旧臣,尚且还受到怜悯养育,何况我的孤苦程度更为严重呢"
keyword_note = {"伏惟"="下对上的敬辞", "故老"="年老德高的旧臣", "矜育"="怜悯养育"}
["且臣少仕伪朝, 历职郎署, 本图宦达, 不矜名节."]
note = []
translation = "况且我年轻的时候曾经做过蜀汉的官,担任过郎官职务,本来就希望做官显达,并不顾惜名声节操"
keyword_note = {"伪朝"="对前朝的蔑称", "历职"="连续任职", "郎署"="尚书郎的官衙", "宦达"="官场上显达"}
["今臣亡国贱俘, 至微至陋, 过蒙拔擢, 宠命优渥, 岂敢盘桓, 有所希冀!"]
note = []
translation = "现在我是一个低贱的亡国俘虏,十分卑微浅陋,受到过分提拔,恩宠优厚,怎敢犹豫不决而有非分的企求呢"
keyword_note = {"拔擢"="提拔", "优渥"="优厚", "盘桓"="徘徊不前", "希冀"="非分的企求"}
["但以刘日薄西山, 气息奄奄, 人命危浅, 朝不虑夕."]
note = []
translation = "只是因为祖母刘氏寿命即将终了,气息微弱,生命垂危,早上不能想到晚上怎样"
keyword_note = {"日薄西山"="太阳接近西山,喻人寿命将终", "危浅"="生命垂危"}
["臣无祖母, 无以至今日, 祖母无臣, 无以终余年."]
note = []
translation = "臣下我如果没有祖母,就没有今天的样子;祖母如果没有我的照料,也无法度过她的余生"
keyword_note = {"终余年"="度过余生"}
["母孙二人, 更相为命, 是以区区不能废远."]
note = []
translation = "我们祖孙二人,互相依靠而维持生命,因此我的内心不愿废止奉养,远离祖母"
keyword_note = {"更相"="相互", "区区"="自己的私情", "废远"="废止奉养而远离"}
["臣密今年四十有四, 祖母今年九十有六, 是臣尽节于陛下之日长, 报养刘之日短."]
note = []
translation = "臣下我现在的年龄四十四岁了,祖母现在的年龄九十六岁了,臣下我在陛下面前尽忠尽节的日子还长着呢,而在祖母刘氏面前尽孝尽心的日子已经不多了"
keyword_note = {"有"="又", "尽节"="尽忠节"}
["乌鸟私情, 愿乞终养."]
note = []
translation = "我怀着乌鸦反哺的私情,乞求能够准许我完成对祖母养老送终的心愿"
keyword_note = {"乌鸟私情"="乌鸦反哺之情,喻孝心", "终养"="养老至终"}
["臣之辛苦, 非独蜀之人士及二州牧伯所见明知, 皇天后土, 实所共鉴."]
note = []
translation = "我的辛酸苦楚,并不仅仅被蜀地的百姓及益州、梁州的长官所亲眼目睹、内心明白,连天地神明也都看得清清楚楚"
keyword_note = {"辛苦"="辛酸苦楚", "牧伯"="州郡长官", "皇天后土"="天地神明", "鉴"="明察"}
["愿陛下矜悯愚诚, 听臣微志, 庶刘侥幸, 保卒余年."]
note = []
translation = "希望陛下能怜悯我愚昧诚心,请允许我完成臣下一点小小的心愿,使祖母刘氏能够侥幸地保全她的余生"
keyword_note = {"矜悯"="怜悯", "听"="准许", "庶"="或许(表希望)", "卒余年"="终老"}
["臣生当陨首, 死当结草."]
note = []
translation = "我活着应当杀身报效朝廷,死了也要结草衔环来报答陛下的恩情"
keyword_note = {"陨首"="掉脑袋,指献出生命", "结草"="死后报恩的典故"}
["臣不胜犬马怖惧之情, 谨拜表以闻."]
note = []
translation = "臣下我怀着牛马一样不胜恐惧的心情,恭敬地呈上此表来使陛下知道这件事"
keyword_note = {"不胜"="禁不住", "犬马怖惧"="臣子谦卑的自比", "闻"="使...知道"}

View File

@@ -2,52 +2,45 @@ import pathlib
import toml import toml
import time import time
import auxiliary as aux import auxiliary as aux
from typing import List
class Electron(): class Electron:
"""电子: 记忆分析元数据及算法""" """电子: 记忆分析元数据及算法"""
algorithm = "SM-2" # 暂时使用 SM-2 算法进行记忆拟合, 考虑 SM-15 替代 algorithm = "SM-2" # 暂时使用 SM-2 算法进行记忆拟合, 考虑 SM-15 替代
"""
content = "" # 内容
efactor = 2.5 # 易度系数, 越大越简单, 最大为5
real_rept = 0 # (实际)重复次数
rept = 0 # (有效)重复次数
interval = 0 # 最佳间隔
last_date = 0 # 上一次复习的时间戳
next_date = 0 # 将要复习的时间戳
is_activated = 0 # 激活状态
# *NOTE: 此处"时间戳"是以天为单位的整数, 即 UNIX 时间戳除以一天的秒数取整
last_modify = 0 # 最后修改时间戳(此处是UNIX时间戳)
"""
def __init__(self, content: str, data: dict):
self.content = content
self.efactor = data.get('efactor', 2.5)
self.real_rept = data.get('real_rept', 0)
self.rept = data.get('rept', 0)
self.interval = data.get('interval', 0)
self.last_date = data.get('last_date', 0)
self.next_date = data.get('next_date', 0)
self.is_activated = data.get('is_activated', 0)
self.last_modify = time.time()
def activate(self):
self.is_activated = 1
def modify(self, var: str, value):
setattr(self, var, value)
self.last_modify = time.time()
def export_data(self):
return {
'efactor': self.efactor,
'real_rept': self.real_rept,
'rept': self.rept,
'interval': self.interval,
'last_date': self.last_date,
'next_date': self.next_date,
'is_activated': self.is_activated
}
def revisor(self, quality): def __init__(self, content: str, metadata: dict):
self.content = content
self.metadata = metadata
if metadata == {}:
# print("NULL")
self._default_init()
def _default_init(self):
defaults = {
'efactor': 2.5, # 易度系数, 越大越简单, 最大为5
'real_rept': 0, # (实际)重复次数
'rept': 0, # (有效)重复次数
'interval': 0, # 最佳间隔
'last_date': 0, # 上一次复习的时间戳
'next_date': 0, # 将要复习的时间戳
'is_activated': 0, # 激活状态
# *NOTE: 此处"时间戳"是以天为单位的整数, 即 UNIX 时间戳除以一天的秒数取整
'last_modify': time.time() # 最后修改时间戳(此处是UNIX时间戳)
}
self.metadata = defaults
def activate(self):
self.metadata['is_activated'] = 1
self.metadata['last_modify'] = time.time()
def modify(self, var: str, value):
if var in self.metadata:
self.metadata[var] = value
self.metadata['last_modify'] = time.time()
else:
print(f"警告: '{var}' 非已知元数据字段")
def revisor(self, quality: int = 5, is_new_activation: bool = False):
"""SM-2 算法迭代决策机制实现 """SM-2 算法迭代决策机制实现
根据 quality(0 ~ 5) 进行参数迭代最佳间隔 根据 quality(0 ~ 5) 进行参数迭代最佳间隔
quality 由主程序评估 quality 由主程序评估
@@ -55,116 +48,230 @@ class Electron():
Args: Args:
quality (int): 记忆保留率量化参数 quality (int): 记忆保留率量化参数
""" """
print(f"REVISOR: {quality}, {is_new_activation}")
if quality == -1: if quality == -1:
return -1 return -1
self.efactor = self.efactor + (0.1 - (5 - quality) * (0.08 + (5 - quality) * 0.02)) self.metadata['efactor'] = self.metadata['efactor'] + (
self.efactor = max(1.3, self.efactor) 0.1 - (5 - quality) * (0.08 + (5 - quality) * 0.02)
)
self.metadata['efactor'] = max(1.3, self.metadata['efactor'])
if quality < 3: if quality < 3:
# 若保留率低于 3重置重复次数 # 若保留率低于 3重置重复次数
self.rept = 0 self.metadata['rept'] = 0
self.interval = 0 # 设为0以便下面重新计算 I(1) self.metadata['interval'] = 0 # 设为0以便下面重新计算 I(1)
else: else:
self.rept += 1 self.metadata['rept'] += 1
self.real_rept += 1
if self.rept == 0: # 刚被重置或初次激活后复习
self.interval = 1 # I(1)
elif self.rept == 1:
self.interval = 6 # I(2) 经验公式
else:
self.interval = round(self.interval * self.efactor)
self.last_date = aux.get_daystamp() self.metadata['real_rept'] += 1
self.next_date = aux.get_daystamp() + self.interval
if is_new_activation: # 初次激活
self.metadata['rept'] = 0
self.metadata['efactor'] = 2.5
if self.metadata['rept'] == 0: # 刚被重置或初次激活后复习
self.metadata['interval'] = 1 # I(1)
elif self.metadata['rept'] == 1:
self.metadata['interval'] = 6 # I(2) 经验公式
else:
self.metadata['interval'] = round(
self.metadata['interval'] * self.metadata['efactor']
)
self.metadata['last_date'] = aux.get_daystamp()
self.metadata['next_date'] = aux.get_daystamp() + self.metadata['interval']
self.metadata['last_modify'] = time.time()
def __str__(self): def __str__(self):
return (f"记忆单元预览 \n" return (
f"内容: '{self.content}' \n" f"记忆单元预览 \n"
f"易度系数: {self.efactor:.2f} \n" f"内容: '{self.content}' \n"
f"已经重复的次数: {self.rept} \n" f"易度系数: {self.metadata['efactor']:.2f} \n"
f"下次间隔: {self.interval} \n" f"已经重复的次数: {self.metadata['rept']} \n"
f"下次复习日期时间戳: {self.next_date}") f"下次间隔: {self.metadata['interval']}\n"
f"下次复习日期时间戳: {self.metadata['next_date']}"
)
def __eq__(self, other): def __eq__(self, other):
if self.content == other.content: if self.content == other.content:
return 1 return True
return 0 return False
def __hash__(self): def __hash__(self):
return hash(self.content) return hash(self.content)
def __getitem__(self, key):
if key == "content":
return self.content
if key in self.metadata:
return self.metadata[key]
else:
raise KeyError(f"Key '{key}' not found in metadata.")
def __setitem__(self, key, value):
if key == "content":
raise AttributeError("content 应为只读")
self.metadata[key] = value
self.metadata['last_modify'] = time.time()
def __iter__(self):
yield from self.metadata.keys()
def __len__(self):
return len(self.metadata)
@staticmethod @staticmethod
def placeholder(): def placeholder():
return Electron("电子对象样例内容", {}) return Electron("电子对象样例内容", {})
@staticmethod
def import_from_file(path: pathlib.Path):
name = path.name.replace(path.suffix, "")
with open(path, 'r') as f:
all = toml.load(f)
lst = list()
for i in all.keys():
lst.append(Electron(i, all[i]))
return (name, lst)
@staticmethod
def save_to_file(electron_dictized, path: pathlib.Path):
with open(path, 'w') as f:
toml.dump(electron_dictized, f)
class Nucleon(): class Nucleon:
"""核子: 材料元数据""" """核子: 材料元数据"""
def __init__(self, content: str, data: dict): def __init__(self, content: str, data: dict):
self.metadata = data self.metadata = data
self.content = content self.content = content
@staticmethod def __getitem__(self, key):
def import_from_file(path: pathlib.Path): if key == "content":
name = path.name.replace(path.suffix, "") return self.content
with open(path, 'r') as f: if key in self.metadata:
all = toml.load(f) return self.metadata[key]
lst = list() else:
for i in all.keys(): raise KeyError(f"Key '{key}' not found in metadata.")
lst.append(Nucleon(i, all[i]))
return (name, lst) def __iter__(self):
yield from self.metadata.keys()
@staticmethod
def save_to_file(nucleon_dictized, path: pathlib.Path): def __len__(self):
with open(path, 'w') as f: return len(self.metadata)
toml.dump(nucleon_dictized, f)
def __hash__(self):
return hash(self.content)
@staticmethod @staticmethod
def placeholder(): def placeholder():
return Nucleon("核子对象样例内容", {}) return Nucleon("核子对象样例内容", {})
class AtomicFile():
def __init__(self, path, type_="unknown"): class NucleonUnion():
"""
替代原有 NucleonFile 类, 支持复杂逻辑
Attributes:
path (Path): 对应于 NucleonUnion 实例的文件路径。
name (str): 核联对象的显示名称,从文件名中派生。
nucleons (list): 内部核子对象的列表。
nucleons_dict (dict): 内部核子对象的字典,以核子内容作为键。
keydata (dict): 核子对象字典键名的翻译。
testdata (dict): 记忆测试项目的元数据。
Parameters:
path (Path): 包含核子数据的文件路径。
"""
def __init__(self, path: pathlib.Path):
self.path = path self.path = path
self.type_ = type_ self.name = path.name.replace(path.suffix, "")
if type_ == "nucleon": with open(path, 'r') as f:
self.name, self.datalist = Nucleon.import_from_file(pathlib.Path(path)) all = toml.load(f)
if type_ == "electron": lst = list()
self.name, self.datalist = Electron.import_from_file(pathlib.Path(path)) for i in all.keys():
if "attr" in i:
continue
if "data" in i:
continue
lst.append(Nucleon(i, all[i]))
self.keydata = all["keydata"]
self.testdata = all["testdata"]
self.nucleons: List[Nucleon] = lst
self.nucleons_dict = {i.content: i for i in lst}
def __len__(self):
return len(self.nucleons)
def linked_electron_union(self):
if (self.path.parent / '..' / 'electron' / self.path.name).exists():
return ElectronUnion(self.path.parent / '..' / 'electron' / self.path.name)
else:
return 0
def save(self): def save(self):
dictobj = {i.content: i.export_data() for i in self.datalist} with open(self.path, 'w') as f:
print(dictobj) tmp = {i.content: i.metadata for i in self.nucleons}
if self.type_ == "nucleon": toml.dump(tmp, f)
Nucleon.save_to_file(dictobj, self.path)
if self.type_ == "electron":
Electron.save_to_file(dictobj, self.path)
def get_full_content(self):
if self.type_ == "nucleon":
text = ""
for i in self.datalist:
text += i.content
return text
return ""
def get_len(self):
return len(self.datalist)
class Atom(): class ElectronUnion:
"""取代原有 ElectronFile 类, 以支持复杂逻辑"""
def __init__(self, path):
self.path = path
print(path)
self.name = path.name.replace(path.suffix, "")
with open(path, 'r') as f:
all = toml.load(f)
lst = list()
for i in all.keys():
if i != "total":
lst.append(Electron(i, all[i]))
self.total = all.get("total", {"last_date": 0})
self.electrons = lst
self.electrons_dict = {i.content: i for i in lst}
def sync(self):
"""同步 electrons_dict 中新增对到 electrons 中, 仅用于缺省初始化不存在映射时调用"""
self.electrons = self.electrons_dict.values()
def __len__(self):
return len(self.electrons)
def linked_nucleon_union(self):
return NucleonUnion(self.path.parent / '..' / 'nucleon' / self.path.name)
def save(self):
# print(1)
self.total["last_date"] = aux.get_daystamp()
with open(self.path, 'w') as f:
tmp = {i.content: i.metadata for i in self.electrons}
tmp["total"] = self.total
# print(tmp)
toml.dump(tmp, f)
class Atom:
@staticmethod @staticmethod
def placeholder(): def placeholder():
return (Electron.placeholder(), Nucleon.placeholder()) return (Electron.placeholder(), Nucleon.placeholder(), {})
@staticmethod
def advanced_placeholder():
return (
Electron("两只黄鹤鸣翠柳", {}),
Nucleon(
"两只黄鹤鸣翠柳",
{
"note": [],
"translation": "臣子李密陈言:我因命运不好,小时候遭遇到了不幸",
"keyword_note": {
"险衅": "凶险祸患(这里指命运不好)",
"": "早时,这里指年幼的时候",
"": "'',指可忧患的事",
"": "不幸,指丧父"
}
}
),
{
"keydata": {
"note": "笔记",
"keyword_note": "关键词翻译",
"translation": "语句翻译"
},
"testdata": {
"additional_inf": ["translation", "note", "keyword_note"],
"fill_blank_test": ["translation"],
"draw_card_test": ["keyword_note"]
},
"is_new_activation": 0
}
)

View File

@@ -1,5 +0,0 @@
"""Android Termux 无法编译 playsound 库的替代方案,
需要安装 playaudio, 并重命名此文件至 playsound.py"""
import os
def playsound(path):
os.system(f"play-audio '{path}'")

View File

@@ -0,0 +1 @@
# HeurSync 同步器

57
precache.py Normal file
View File

@@ -0,0 +1,57 @@
# 音频预缓存实用程序, 独立于主程序之外, 但依赖其他组件
import particles as pt
import auxiliary as aux
import edge_tts as tts
from pathlib import Path
import shutil
import time
def precache(text: str):
"""预缓存单个文本的音频"""
cache_dir = Path("./cache/voice/")
cache_dir.mkdir(parents=True, exist_ok=True)
cache = cache_dir / f"{aux.get_md5(text)}.wav"
if not cache.exists():
communicate = tts.Communicate(text, "zh-CN-XiaoxiaoNeural")
communicate.save_sync(f"./cache/voice/{aux.get_md5(text)}.wav")
def proc_file(path: Path):
"""处理单个文件"""
nu = pt.NucleonUnion(path)
c = 0
for i in nu.nucleons:
c += 1
print(f"预缓存 [{nu.name}] ({c}/{len(nu)}): {i['content'].replace('/', '')}")
precache(i['content'].replace('/', ''))
def walk(path_str: str):
"""遍历目录处理所有文件"""
path = Path(path_str)
print(f"正在遍历目录: {path}")
try:
for item in path.iterdir():
if item.is_file() and item.suffix == ".toml":
print(f"正预缓存文件: {item.name}")
proc_file(item)
elif item.is_dir():
print(f"进入目录: {item.name}")
except:
print("发生一个异常, 于 5 秒后自动重新下载")
time.sleep(5)
walk(path_str)
if __name__ == "__main__":
print("音频预缓存实用程序")
print("A: 全部缓存")
print("C: 清空缓存")
choice = input("输入选项 $ ").upper()
if choice == "A":
walk("./nucleon")
elif choice == "C":
shutil.rmtree("./cache/voice", ignore_errors=True)
print("缓存已清空")

121
puzzles.py Normal file
View File

@@ -0,0 +1,121 @@
import random
class BasePuzzle:
pass
class BlankPuzzle(BasePuzzle):
"""填空题谜题生成器
Args:
text: 原始字符串(需要 "/" 分割句子, 末尾应有 "/")
min_denominator: 最小概率倒数(如占所有可生成填空数的 1/7 中的 7, 若期望值小于 1, 则取 1)
"""
def __init__(self, text: str, min_denominator: int):
self.text = text
self.min_denominator = min_denominator
self.wording = "填空题 - 尚未刷新谜题"
self.answer = ["填空题 - 尚未刷新谜题"]
def refresh(self): # 刷新谜题
placeholder = "___SLASH___"
tmp_text = self.text.replace("/", placeholder)
words = tmp_text.split(placeholder)
if not words:
return
words = [word for word in words if word]
num_blanks = min(max(1, len(words) // self.min_denominator), len(words))
indices_to_blank = random.sample(range(len(words)), num_blanks)
indices_to_blank.sort()
blanked_words = list(words)
answer = list()
for index in indices_to_blank:
blanked_words[index] = "__" * len(words[index])
answer.append(words[index])
self.answer = answer
self.wording = "".join(blanked_words)
def __str__(self):
return f"{self.wording}\n{str(self.answer)}"
class SelectionPuzzle(BasePuzzle):
"""选择题谜题生成器
Args:
mapping: 正确选项映射 {问题: 答案}
jammer: 干扰项列表
max_riddles_num: 最大生成谜题数 (默认2个)
prefix: 问题前缀
"""
def __init__(
self,
mapping: dict,
jammer: list,
max_riddles_num: int = 2,
prefix: str = ""
):
self.prefix = prefix
self.mapping = mapping
self.jammer = list(set(jammer + list(mapping.values())))
while len(self.jammer) < 4:
self.jammer.append(" ")
self.max_riddles_num = max(1, min(max_riddles_num, 5))
self.wording = "选择题 - 尚未刷新谜题"
self.answer = ["选择题 - 尚未刷新谜题"]
self.options = []
def refresh(self):
"""刷新谜题,根据题目数量生成适当数量的谜题"""
if not self.mapping:
self.wording = "无可用题目"
self.answer = ["无答案"]
self.options = []
return
num_questions = min(self.max_riddles_num, len(self.mapping))
questions = random.sample(list(self.mapping.items()), num_questions)
puzzles = []
answers = []
all_options = []
for question, correct_answer in questions:
options = [correct_answer]
available_jammers = [
j for j in self.jammer if j != correct_answer
]
if len(available_jammers) >= 3:
selected_jammers = random.sample(available_jammers, 3)
else:
selected_jammers = random.choices(available_jammers, k=3)
options.extend(selected_jammers)
random.shuffle(options)
puzzles.append(question)
answers.append(correct_answer)
all_options.append(options)
question_texts = []
for i, puzzle in enumerate(puzzles):
question_texts.append(f"{self.prefix}:\n {i+1}. {puzzle}")
self.wording = question_texts
self.answer = answers
self.options = all_options
def __str__(self):
return f"{self.wording}\n正确答案: {', '.join(self.answer)}"
if __name__ == "__main__":
puz = SelectionPuzzle(
{"1+1": "2", "1+2": "3", "1+3": "4"},
["2", "5", "0"],
3,
'求值: '
)
puz.refresh()
print(puz.wording)
print(puz.answer)
print(puz.options)

View File

@@ -2,54 +2,116 @@ import typing
import particles as pt import particles as pt
import pathlib import pathlib
import auxiliary as aux import auxiliary as aux
class Parser(): import compositions as comps
"""轻量级版本文件解析器, 用于文件管理器的记忆状态解析""" import random
#from pprint import pprint as print # debug
class Glimpse():
"""轻量级只读, 用于状态指示"""
def __init__(self, nucleon_union: pt.NucleonUnion):
self.name = nucleon_union.name
self.nuc_u = nucleon_union
self.elt_u = self.nuc_u.linked_electron_union()
self.lastest_date = -1
self.next_date = 0x3f3f3f3f
self.avg_efactor = 0
self.total_num = 0
self.activated_num = 0
self.is_initialized = 0
if self.elt_u != 0:
self.is_initialized = 1
self.total_num = len(self.elt_u.electrons)
for i in self.elt_u.electrons:
if i['next_date'] > 0:
self.next_date = min(self.next_date, i['next_date'])
self.lastest_date = max(self.lastest_date, i['last_date'])
if i['is_activated']:
self.avg_efactor += i['efactor']
self.activated_num += 1
if self.next_date == 0x3f3f3f3f:
self.next_date = -1
self.is_initialized = 0
if self.activated_num == 0:
return
self.avg_efactor = round(self.avg_efactor / self.activated_num, 2)
if self.next_date == 0x3f3f3f3f:
self.next_date = -1
return
class Apparatus():
"""反应器对象, 决策一个原子的不同记忆方式, 并反馈到布局"""
def __init__(self, screen, reactor, atom):
self.electron: pt.Electron = atom[0]
self.nucleon: pt.Nucleon = atom[1]
self.positron: dict = atom[2]
self.testdata = self.positron["testdata"]
self.procession: typing.List[comps.Composition] = list()
if self.positron["is_new_activation"] == 1:
self.positron["is_new_activation"] = 0
self.procession.append(comps.registry["recognition"](screen, reactor, atom))
return
for i in self.positron["testdata"].keys():
if i == "additional_inf":
continue
if i == "fill_blank_test": # 加深
self.procession.append(comps.registry[i](screen, reactor, atom))
self.procession.append(comps.registry[i](screen, reactor, atom))
self.procession.append(comps.registry[i](screen, reactor, atom))
# self.procession.reverse()
random.shuffle(self.procession)
def iterator(self):
yield from self.procession
class Reactor(): class Reactor():
"""反应堆对象, 用于全面解析文件, 并处理和分配一次文件记忆流程的资源与策略""" """反应堆对象, 处理和分配一次文件记忆流程的资源与策略"""
def __init__(self, nucleon_file: pt.AtomicFile, electron_file: pt.AtomicFile, tasked_num): def __init__(self, nucleon_file: pt.NucleonUnion, electron_file: pt.ElectronUnion, screen, tasked_num):
# 导入原子对象 # 导入原子对象
self.reported = set()
self.nucleon_file = nucleon_file self.nucleon_file = nucleon_file
self.electron_file = electron_file self.electron_file = electron_file
self.tasked_num = tasked_num self.tasked_num = tasked_num
self.atoms_new = list() self.atoms_new = list()
self.atoms_review = list() self.atoms_review = list()
counter = self.tasked_num counter = self.tasked_num
self.screen = screen
self.electron_dict = {elect.content: elect for elect in electron_file.datalist} self.electron_dict = electron_file.electrons_dict
self.quality_dict = {}
def electron_dict_get_fallback(key) -> pt.Electron: def electron_dict_get_fallback(key) -> pt.Electron:
value = self.electron_dict.get(key) value = self.electron_dict.get(key)
# 如果值不存在,则设置默认值 # 如果值不存在,则设置默认值
if value is None: if value is None:
value = pt.Electron(key, {}) # 获取默认值 value = pt.Electron(key, {}) # 获取默认值
self.electron_dict[key] = value # 将默认值存入字典 self.electron_dict[key] = value # 将默认值存入字典
value = self.electron_dict[key] electron_file.sync()
return value # 返回获取的值(可能是默认值) return value # 返回获取的值(可能是默认值)
for nucleon in nucleon_file.datalist: for nucleon in nucleon_file.nucleons:
atom = (electron_dict_get_fallback(nucleon.content), nucleon) # atom = (Electron, Nucleon, Positron) 即 (记忆元数据, 内容元数据, 运行时数据)
if atom[0].is_activated == 0: atom = (electron_dict_get_fallback(nucleon.content), nucleon, {}) # 使用 "Positron" 代称 atom[2]
atom[2]["testdata"] = nucleon_file.testdata
atom[2]["keydata"] = nucleon_file.keydata
if atom[0]["is_activated"] == 0:
if counter > 0: if counter > 0:
atom[0].is_activated = 1 atom[2]["is_new_activation"] = 1
atom[0]["is_activated"] = 1
self.atoms_new.append(atom) self.atoms_new.append(atom)
counter -= 1 counter -= 1
else: else:
if atom[0].next_date <= aux.get_daystamp(): atom[2]["is_new_activation"] = 0
atom[0].last_date = aux.get_daystamp() if int(atom[0]["next_date"]) <= aux.get_daystamp():
atom[0]["last_date"] = aux.get_daystamp()
self.atoms_review.append(atom) self.atoms_review.append(atom)
# 设置运行时 # 设置运行时
self.index: int self.index: int
self.procession: list self.procession: list
self.failed: list self.failed: list
self.round_title: str self.round_title: str
self.reported: set self.current_atom: typing.Tuple[pt.Electron, pt.Nucleon, dict]
self.current_atom: typing.Tuple[pt.Electron, pt.Nucleon]
self.round_set = 0 self.round_set = 0
self.current_atom = pt.Atom.placeholder() self.current_atom = pt.Atom.placeholder()
#print(self.atoms_new)
def set_round(self, title, procession): def set_round(self, title, procession):
self.round_set = 1 self.round_set = 1
@@ -67,16 +129,25 @@ class Reactor():
processions = { processions = {
1: self.atoms_review, 1: self.atoms_review,
2: self.atoms_new, 2: self.atoms_new,
3: list(set(self.atoms_new + self.atoms_review)) 3: (self.atoms_new + self.atoms_review)
} }
ret = 1 ret = 1
if stage == 1 and len(processions[1]) == 0: if stage == 1 and len(processions[1]) == 0:
stage = 2 stage = 2
ret = 2 ret = 2
if stage == 1 and len(processions[2]) == 0:
stage = 3
ret = 3
self.set_round(title=titles[stage], procession=processions[stage]) self.set_round(title=titles[stage], procession=processions[stage])
return ret return ret
def forward(self, step = 1): def forward(self, step = 1):
"""
返回值规则:
1: 重定向至 failed
-1: 此轮已完成
0: 下一个记忆单元
"""
if self.index + step >= len(self.procession): if self.index + step >= len(self.procession):
if len(self.failed) > 0: if len(self.failed) > 0:
self.procession = self.failed self.procession = self.failed
@@ -91,23 +162,31 @@ class Reactor():
return -1 # 此轮已完成 return -1 # 此轮已完成
self.index += step self.index += step
self.current_atom = self.procession[self.index] self.current_atom = self.procession[self.index]
self.current_appar = Apparatus(self.screen, self, self.current_atom).iterator()
return 0 return 0
def save(self): def save(self):
self._deploy_report()
print("Progress saved") print("Progress saved")
# self.nucleon_file.save() # self.nucleon_file.save()
temp = list() if self.electron_file.total["last_date"] < aux.get_daystamp():
for i in self.electron_dict.keys(): self.electron_file.save()
temp.append(self.electron_dict[i])
self.electron_file.datalist = temp
self.electron_file.save()
def _deploy_report(self):
"部署所有 _report"
for e, q in self.quality_dict.items():
if q == -1:
e.revisor(5, True)
continue
e.revisor(q)
def report(self, atom, quality): def report(self, atom, quality):
if atom[0] not in self.reported: "向反应器和最低质量记录汇报"
atom[0].revisor(quality) if atom in self.atoms_new:
self.reported.add(atom[0]) self.quality_dict[atom[0]] = -1
print(self.quality_dict)
return
self.quality_dict[atom[0]] = min(quality, self.quality_dict.get(atom[0], 5))
if quality <= 3: if quality <= 3:
self.failed.append(atom) self.failed.append(atom)
return 1 print(self.quality_dict)
else:
return 0

77
reactor_k.py Normal file
View File

@@ -0,0 +1,77 @@
# reactor.py 设计改进型 尚未完成功能重构
import particles as pt
import auxiliary as aux
import time
from typing import List
class BaseScheduler():
"调度器接口"
def revisor(self, electron: pt.Electron, quality: int):
"""由 quality 更新电子的记忆参数"""
pass
def get_atoms_for_review(self, electron_file: pt.ElectronUnion):
"""从电子文件中筛选出当前需要复习的所有原子"""
pass
def get_atoms_for_learning(self, nucleon_file: pt.NucleonUnion, limit: int):
"""从核子文件中获取待学习的新原子"""
pass
class SM2Scheduler(BaseScheduler):
"基于 SM-2 的调度器实现"
def revisor(self, electron: pt.Electron, quality: int, is_new_activation):
print(f"REVISOR: {quality}, {is_new_activation}")
if quality == -1:
return -1
electron.metadata['efactor'] = electron.metadata['efactor'] + (
0.1 - (5 - quality) * (0.08 + (5 - quality) * 0.02)
)
electron.metadata['efactor'] = max(1.3, electron.metadata['efactor'])
if quality < 3:
# 若保留率低于 3重置重复次数
electron.metadata['rept'] = 0
electron.metadata['interval'] = 0 # 设为0以便下面重新计算 I(1)
else:
electron.metadata['rept'] += 1
electron.metadata['real_rept'] += 1
if is_new_activation: # 初次激活
electron.metadata['rept'] = 0
electron.metadata['efactor'] = 2.5
if electron.metadata['rept'] == 0: # 刚被重置或初次激活后复习
electron.metadata['interval'] = 1 # I(1)
elif electron.metadata['rept'] == 1:
electron.metadata['interval'] = 6 # I(2) 经验公式
else:
electron.metadata['interval'] = round(
electron.metadata['interval'] * electron.metadata['efactor']
)
electron.metadata['last_date'] = aux.get_daystamp()
electron.metadata['next_date'] = aux.get_daystamp() + electron.metadata['interval']
electron.metadata['last_modify'] = time.time()
def get_atoms_for_learning(self, nucleon_file: pt.NucleonUnion, limit: int):
def electron_dict_get_fallback(key) -> pt.Electron:
value = self.electron_dict.get(key)
# 如果值不存在,则设置默认值
if value is None:
value = pt.Electron(key, {}) # 获取默认值
self.electron_dict[key] = value # 将默认值存入字典
electron_file.sync()
return value # 返回获取的值(可能是默认值)
for i in nucleon_file.nucleons:
if i.metadata
def get_atoms_for_review(self, electron_file: pt.ElectronUnion):
return super().get_atoms_for_review(electron_file)
class FSRSScheduler():
"基于 FSRS 的调度器实现"

BIN
readme_src/img1.png Normal file

Binary file not shown.

After

Width:  |  Height:  |  Size: 120 KiB

BIN
readme_src/img2.png Normal file

Binary file not shown.

After

Width:  |  Height:  |  Size: 559 KiB

BIN
readme_src/img3.png Normal file

Binary file not shown.

After

Width:  |  Height:  |  Size: 177 KiB

BIN
readme_src/img4.png Normal file

Binary file not shown.

After

Width:  |  Height:  |  Size: 161 KiB

8
requirements.txt Normal file
View File

@@ -0,0 +1,8 @@
aiohttp==3.12.13
aiohttp_jinja2==1.6
edge_tts==7.0.2
Jinja2==3.1.6
playsound==1.2.2
rich==14.1.0
textual==5.0.1
toml==0.10.2

261
screens.py Normal file
View File

@@ -0,0 +1,261 @@
from textual.app import App, ComposeResult
from textual.widgets import (
Header,
Footer,
ListView,
ProgressBar,
DirectoryTree,
ListItem,
Label,
Markdown,
Static,
Button,
)
from textual.containers import Container, Horizontal, Center
from textual.screen import Screen
import pathlib
import threading
import edge_tts as tts
from playsound import playsound
import particles as pt
from reactor import Reactor, Apparatus, Glimpse
import auxiliary as aux
import compositions as compo
import builtins
import metadata
config = aux.ConfigFile("config.toml")
class MemScreen(Screen):
BINDINGS = [
("d", "toggle_dark", "改变色调"),
("q", "pop_screen", "返回主菜单"),
("v", "play_voice", "朗读"),
]
if config.get("quick_pass"):
BINDINGS.append(("k", "quick_pass", "快速通过[调试]"))
btn = dict()
def __init__(
self,
nucleon_file: pt.NucleonUnion,
electron_file: pt.ElectronUnion,
tasked_num,
):
super().__init__(name=None, id=None, classes=None)
self.reactor = Reactor(nucleon_file, electron_file, self, tasked_num)
self.stage = 1
self.stage += self.reactor.set_round_templated(self.stage)
first_forward = self.reactor.forward()
print(first_forward)
if first_forward == -1:
self.stage = 3
self.reactor.set_round_templated(3)
print(self.reactor.forward())
#self._forward_judge(first_forward)
self.compo = next(self.reactor.current_appar)
def compose(self) -> ComposeResult:
if type(self.compo).__name__ == "Recognition":
self.action_play_voice()
yield Header(show_clock=True)
with Center():
yield Static(
f"{len(self.reactor.procession) - self.reactor.index}/{len(self.reactor.procession)}"
)
yield from self.compo.compose()
yield Footer()
def on_mount(self):
pass
def on_button_pressed(self, event):
ret = self.compo.handler(event, "button")
self._forward_judge(ret)
def _forward_judge(self, ret):
if ret == -1:
return
if ret == 0:
try:
self.compo = next(self.reactor.current_appar)
self.refresh_ui()
except StopIteration:
nxt = self.reactor.forward(1)
try:
self.compo = next(self.reactor.current_appar)
except:
pass
if nxt == -1:
if self.reactor.round_set == 0:
if self.stage == 4:
if config.get("save"):
self.reactor.save()
self.compo = compo.Finished(
self, None, pt.Atom.placeholder()
)
self.refresh_ui()
else:
self.reactor.set_round_templated(self.stage)
self.reactor.forward(1)
self.stage += 1
self.compo = next(self.reactor.current_appar)
self.refresh_ui()
return
return
else:
self.refresh_ui()
return
if ret == 1:
self.refresh_ui()
return
def refresh_ui(self):
self.call_later(self.recompose)
print(type(self.compo).__name__)
def action_play_voice(self):
def play():
cache_dir = pathlib.Path(f"./cache/voice/")
cache_dir.mkdir(parents=True, exist_ok=True)
cache = cache_dir / f"{aux.get_md5(self.reactor.current_atom[1].content.replace('/',''))}.wav"
if not cache.exists():
communicate = tts.Communicate(
self.reactor.current_atom[1].content.replace("/", ""),
"zh-CN-XiaoxiaoNeural",
)
communicate.save_sync(
f"./cache/voice/{aux.get_md5(self.reactor.current_atom[1].content.replace('/',''))}.wav"
)
playsound(str(cache))
threading.Thread(target=play).start()
def action_quick_pass(self):
self.reactor.report(self.reactor.current_atom, 5)
self._forward_judge(0)
def action_toggle_dark(self):
self.app.action_toggle_dark()
def action_pop_screen(self):
self.app.pop_screen()
class PreparationScreen(Screen):
BINDINGS = [("q", "go_back", "返回"), ("escape", "quit_app", "退出")]
def __init__(
self, nucleon_file: pt.NucleonUnion, electron_file: pt.ElectronUnion
) -> None:
super().__init__(name=None, id=None, classes=None)
self.nucleon_file = nucleon_file
self.electron_file = electron_file
def compose(self) -> ComposeResult:
yield Header(show_clock=True)
with Container(id="vice_container"):
yield Label(f"准备就绪: [b]{self.nucleon_file.name}[/b]\n")
yield Label(f"内容源文件对象: ./nucleon/[b]{self.nucleon_file.name}[/b].toml")
yield Label(f"元数据文件对象: ./electron/[b]{self.electron_file.name}[/b].toml")
yield Label(f"\n单元数量:{len(self.nucleon_file)}\n")
yield Button(
"开始记忆",
id="start_memorizing_button",
variant="primary",
classes="start-button",
)
yield Static(f"\n单元预览:\n")
yield Markdown(self._get_full_content().replace("/", ""), classes="full")
yield Footer()
def _get_full_content(self):
content = ""
for i in self.nucleon_file.nucleons:
content += " - " + i["content"] + " \n"
return content
def action_go_back(self):
self.app.pop_screen()
def action_quit_app(self):
self.app.exit()
def on_button_pressed(self, event: Button.Pressed) -> None:
if event.button.id == "start_memorizing_button":
newscr = MemScreen(
self.nucleon_file, self.electron_file, config.get("tasked_number", 6)
)
self.app.push_screen(newscr)
class DashboardScreen(Screen):
def compose(self) -> ComposeResult:
yield Header(show_clock=True)
yield Container(
Label(f'欢迎使用 "潜进" 启发式辅助记忆调度器, 版本 {metadata.ver}', classes="title-label"),
Label(f"当前的 UNIX 日时间戳: {aux.get_daystamp()}"),
Label(f'包含时间戳修正: UTC+{config.get("timezone_offset")/3600}'),
Label("选择待学习的记忆单元:", classes="title-label"),
ListView(id="file-list", classes="file-list-view"),
Label(f"\"潜进\" 开放源代码软件项目 | 版本 {metadata.ver} {metadata.stage.capitalize()} | Wang Zhiyu 2025"),
)
yield Footer()
def item_desc_generator(self, path) -> dict:
gmp = Glimpse(pt.NucleonUnion(path))
res = dict()
res[0] = f"{gmp.name}.toml\0"
res[1] = f""
if gmp.is_initialized:
res[1] += f" 已激活单元: {gmp.activated_num}/{gmp.total_num}\n"
res[1] += f" 下一次复习: {gmp.next_date} (最后复习于 {gmp.lastest_date})\n"
res[1] += f" 系数均值: {gmp.avg_efactor}"
else:
res[1] = " 尚未激活"
return res
def on_mount(self) -> None:
file_list_widget = self.query_one("#file-list", ListView)
nucleon_path = pathlib.Path("./nucleon")
nucleon_files = sorted(
[f for f in nucleon_path.iterdir() if f.suffix == ".toml"],
key=lambda f: Glimpse(pt.NucleonUnion(f)).next_date,
reverse=True
)
if nucleon_files:
for file in nucleon_files:
text = self.item_desc_generator(pathlib.Path(file))
file_list_widget.append(ListItem(
Label(text[0] + '\n' + text[1]),
))
else:
file_list_widget.append(
ListItem(Static("在 ./nucleon/ 中未找到任何内容源数据文件.\n请放置文件后重启应用."))
)
file_list_widget.disabled = True
def on_list_view_selected(self, event: ListView.Selected) -> None:
if not isinstance(event.item, ListItem):
return
selected_label = event.item.query_one(Label)
if "未找到任何 .toml 文件" in str(selected_label.renderable):
return
selected_filename = str(selected_label.renderable).partition('\0')[0].replace('*', "")
nucleon_file = pt.NucleonUnion(
pathlib.Path("./nucleon") / selected_filename
)
electron_file_path = pathlib.Path("./electron") / selected_filename
if electron_file_path.exists():
pass
else:
electron_file_path.touch()
electron_file = pt.ElectronUnion(
pathlib.Path("./electron") / selected_filename
)
self.app.push_screen(PreparationScreen(nucleon_file, electron_file))
def action_quit_app(self) -> None:
self.app.exit()

View File

@@ -1,14 +1,21 @@
Screen { Screen {
align: center middle; align: center bottom;
} }
#main_container { #main_container {
align: center middle; align: center middle;
width: 80%; width: 95%;
height: auto; height: auto;
border: thick $primary-lighten-2; border: thick $primary-lighten-2;
padding: 2; padding: 1;
}
#vice_container {
align: center middle;
width: 100%;
height: auto;
padding: 1;
} }
#sentence { #sentence {
@@ -52,4 +59,4 @@ Button {
margin-bottom: 0; margin-bottom: 0;
align-horizontal: center; align-horizontal: center;
width: 40%; width: 40%;
} }

45
testfield/blank_maker.py Normal file
View File

@@ -0,0 +1,45 @@
import random
class BlankPuzzle():
"""填空题谜题生成器
Args:
text: 原始字符串(需要 "/" 分割句子, 末尾应有 "/")
min_denominator: 最小概率倒数(如占所有可生成填空数的 1/7 中的 7, 若期望值小于 1, 则取 1)
"""
def __init__(self, text, min_denominator):
self.text = text
self.min_denominator = min_denominator
self.wording = "填空题 - 尚未刷新谜题"
self.answer = ["填空题 - 尚未刷新谜题"]
def refresh(self): # 刷新谜题
placeholder = "___SLASH___"
tmp_text = self.text.replace("/", placeholder)
words = tmp_text.split(placeholder)
if not words:
return ""
words = [word for word in words if word]
num_blanks = min(max(1, len(words) // self.min_denominator), len(words))
indices_to_blank = random.sample(range(len(words)), num_blanks)
indices_to_blank.sort()
blanked_words = list(words)
answer = list()
for index in indices_to_blank:
blanked_words[index] = "__" * len(words[index])
answer.append(words[index])
result = []
for word in blanked_words:
result.append(word)
self.answer = answer
self.wording = "".join(result)
def __str__(self):
return f"{self.wording}\n{str(self.answer)}"
# demo
text = """我联合国人民/同兹/决心/: /欲免/后世/再遭/今代人类/两度/身历/惨不堪言/之战祸/.../"""
riddle = BlankPuzzle(text, 3)
print(riddle)
riddle.refresh()
print(riddle)

View File

@@ -0,0 +1,45 @@
import random
class SelectionPuzzle():
"""选择题谜题生成器
Args:
text: 原始字符串(需要 "/" 分割句子, 末尾应有 "/")
min_denominator: 最小概率倒数(如占所有可生成填空数的 1/7 中的 7, 若期望值小于 1, 则取 1)
"""
def __init__(self, prefix_text, origin_dict, min_denominator):
self.text = text
self.min_denominator = min_denominator
self.wording = "填空题 - 尚未刷新谜题"
self.answer = ["填空题 - 尚未刷新谜题"]
def refresh(self): # 刷新谜题
placeholder = "___SLASH___"
tmp_text = self.text.replace("/", placeholder)
words = tmp_text.split(placeholder)
if not words:
return ""
words = [word for word in words if word]
num_blanks = min(max(1, len(words) // self.min_denominator), len(words))
indices_to_blank = random.sample(range(len(words)), num_blanks)
indices_to_blank.sort()
blanked_words = list(words)
answer = list()
for index in indices_to_blank:
blanked_words[index] = "__" * len(words[index])
answer.append(words[index])
result = []
for word in blanked_words:
result.append(word)
self.answer = answer
self.wording = "".join(result)
def __str__(self):
return f"{self.wording}\n{str(self.answer)}"
# demo
text = """我联合国人民/同兹/决心/: /欲免/后世/再遭/今代人类/两度/身历/惨不堪言/之战祸/.../"""
riddle = BlankPuzzle(text, 3)
print(riddle)
riddle.refresh()
print(riddle)

247
tweak.py Normal file
View File

@@ -0,0 +1,247 @@
import os
import shutil
import subprocess
import sys
def check_dev_flag():
"""检查是否存在开发标志文件,如果存在则退出程序"""
script_dir = os.path.dirname(os.path.abspath(__file__))
dev_flag_path = os.path.join(script_dir, '.devflag')
if os.path.exists(dev_flag_path):
print("检测到开发标志文件 (.devflag),不得运行此程序")
sys.exit(0)
def main():
# 检查开发标志文件
check_dev_flag()
# 输出标题
print("HeurAMS 更新 & 数据管理工具")
print("君欲何为?")
print("\nR: 全新安装 HeurAMS (删除 nucleon 与 electron 的用户数据, 并从上游同步软件更新)")
print("F: 翻新 HeurAMS (保留 nucleon 与 electron 的用户数据, 并从上游同步软件更新)")
print("U: 卸载 HeurAMS (删除 HeurAMS 程序文件, 保留用户数据)")
print("P: 应用 Termux 音频补丁")
# 获取用户输入
choice = input("\n请输入选择 (R/F/U/P): ").strip().lower()
# 获取脚本所在目录
script_dir = os.path.dirname(os.path.abspath(__file__))
os.chdir(script_dir)
if choice == 'r':
# 检查开发标志文件(再次检查,防止在运行时创建)
check_dev_flag()
# 全新安装 - 删除所有文件和文件夹(包括.git
print("正在执行全新安装...")
# 遍历当前目录下的所有文件和文件夹
for item in os.listdir('.'):
# 跳过脚本自身(如果存在)和开发标志文件
if item == os.path.basename(__file__) or item == '.devflag':
continue
item_path = os.path.join(script_dir, item)
try:
if os.path.isfile(item_path) or os.path.islink(item_path):
os.remove(item_path)
elif os.path.isdir(item_path):
shutil.rmtree(item_path)
except Exception as e:
print(f"删除 {item} 时出错: {e}")
# 执行git clone到临时目录然后移动文件
try:
temp_dir = os.path.join(script_dir, 'temp_clone')
subprocess.run(['git', 'clone', 'https://gitea.imwangzhiyu.xyz/ajax/HeurAMS', temp_dir], check=True)
# 移动所有文件到当前目录(除了.git目录
for item in os.listdir(temp_dir):
if item != '.git':
src = os.path.join(temp_dir, item)
dst = os.path.join(script_dir, item)
if os.path.exists(dst):
if os.path.isdir(dst):
shutil.rmtree(dst)
else:
os.remove(dst)
shutil.move(src, dst)
# 删除临时目录
shutil.rmtree(temp_dir)
print("全新安装完成!")
except subprocess.CalledProcessError as e:
print(f"Git clone 失败: {e}")
except Exception as e:
print(f"文件操作失败: {e}")
elif choice == 'f':
# 检查开发标志文件(再次检查,防止在运行时创建)
check_dev_flag()
# 翻新安装 - 保留特定目录
print("正在执行翻新安装...")
# 需要保留的目录列表
preserve_dirs = ['nucleon', 'electron', 'cache']
# 备份需要保留的目录到临时位置
backup_dir = os.path.join(script_dir, 'temp_backup')
os.makedirs(backup_dir, exist_ok=True)
for dir_name in preserve_dirs:
dir_path = os.path.join(script_dir, dir_name)
if os.path.exists(dir_path):
backup_path = os.path.join(backup_dir, dir_name)
if os.path.exists(backup_path):
shutil.rmtree(backup_path)
shutil.copytree(dir_path, backup_path)
# 删除所有文件和文件夹(包括.git
for item in os.listdir('.'):
# 跳过脚本自身、备份目录和开发标志文件
if item == os.path.basename(__file__) or item == 'temp_backup' or item == '.devflag':
continue
item_path = os.path.join(script_dir, item)
try:
if os.path.isfile(item_path) or os.path.islink(item_path):
os.remove(item_path)
elif os.path.isdir(item_path):
shutil.rmtree(item_path)
except Exception as e:
print(f"删除 {item} 时出错: {e}")
# 执行git clone到当前目录
try:
temp_dir = os.path.join(script_dir, 'temp_clone')
subprocess.run(['git', 'clone', 'https://gitea.imwangzhiyu.xyz/ajax/HeurAMS', temp_dir], check=True)
# 移动所有文件到当前目录(除了.git目录
for item in os.listdir(temp_dir):
if item != '.git':
src = os.path.join(temp_dir, item)
dst = os.path.join(script_dir, item)
if os.path.exists(dst):
if os.path.isdir(dst):
shutil.rmtree(dst)
else:
os.remove(dst)
shutil.move(src, dst)
# 删除临时克隆目录
shutil.rmtree(temp_dir)
# 恢复保留的目录覆盖git仓库中的同名目录
for dir_name in preserve_dirs:
backup_path = os.path.join(backup_dir, dir_name)
if os.path.exists(backup_path):
target_path = os.path.join(script_dir, dir_name)
if os.path.exists(target_path):
shutil.rmtree(target_path)
shutil.copytree(backup_path, target_path)
# 删除备份目录
shutil.rmtree(backup_dir)
print("翻新安装完成!")
except subprocess.CalledProcessError as e:
print(f"Git clone 失败: {e}")
except Exception as e:
print(f"文件操作失败: {e}")
elif choice == 'u':
# 检查开发标志文件(再次检查,防止在运行时创建)
check_dev_flag()
# 卸载 HeurAMS - 删除程序文件,保留用户数据
print("正在卸载 HeurAMS保留用户数据...")
# 需要保留的用户数据目录列表
preserve_dirs = ['nucleon', 'electron', 'cache']
# 备份需要保留的目录到临时位置
backup_dir = os.path.join(script_dir, 'temp_backup')
os.makedirs(backup_dir, exist_ok=True)
for dir_name in preserve_dirs:
dir_path = os.path.join(script_dir, dir_name)
if os.path.exists(dir_path):
backup_path = os.path.join(backup_dir, dir_name)
if os.path.exists(backup_path):
shutil.rmtree(backup_path)
shutil.copytree(dir_path, backup_path)
print(f"已备份用户数据: {dir_name}")
# 删除所有文件和文件夹(除了脚本自身、备份目录和开发标志文件)
for item in os.listdir('.'):
# 跳过脚本自身、备份目录和开发标志文件
if item == os.path.basename(__file__) or item == 'temp_backup' or item == '.devflag':
continue
item_path = os.path.join(script_dir, item)
try:
if os.path.isfile(item_path) or os.path.islink(item_path):
os.remove(item_path)
print(f"已删除文件: {item}")
elif os.path.isdir(item_path):
shutil.rmtree(item_path)
print(f"已删除目录: {item}")
except Exception as e:
print(f"删除 {item} 时出错: {e}")
# 恢复保留的用户数据目录
for dir_name in preserve_dirs:
backup_path = os.path.join(backup_dir, dir_name)
if os.path.exists(backup_path):
target_path = os.path.join(script_dir, dir_name)
if os.path.exists(target_path):
shutil.rmtree(target_path)
shutil.copytree(backup_path, target_path)
print(f"已恢复用户数据: {dir_name}")
# 删除备份目录
shutil.rmtree(backup_dir)
print("卸载完成HeurAMS 程序文件已删除,用户数据已保留。")
elif choice == 'p':
# 应用 Termux 音频补丁
print("应用 Termux 音频补丁")
# 询问用户是否使用安卓Termux环境
termux_choice = input("是否使用安卓Termux环境? (y/n): ").strip().lower()
if termux_choice in ['y', 'yes']:
# 创建playsound.py文件
playsound_content = '''import os
def playsound(path):
os.system(f"play-audio '{path}'")
'''
playsound_path = os.path.join(script_dir, 'playsound.py')
try:
with open(playsound_path, 'w', encoding='utf-8') as f:
f.write(playsound_content)
print("已创建 playsound.py 文件")
print("Termux 音频补丁应用成功!")
print("现在可以使用 play-audio 命令播放音频了。")
except Exception as e:
print(f"创建 playsound.py 文件时出错: {e}")
else:
print("已取消应用 Termux 音频补丁。")
else:
print("无效的选择,请输入 R、F、U 或 P。")
sys.exit(1)
if __name__ == "__main__":
main()

View File

@@ -0,0 +1,17 @@
function getStartUrl() {
const url = new URL(window.location.href);
const params = new URLSearchParams(url.search);
params.delete("delay");
return url.pathname + "?" + params.toString();
}
async function refresh() {
const ping_url = document.body.dataset.pingurl;
if (ping_url) {
await fetch(ping_url, {
method: "GET",
mode: "no-cors",
});
}
window.location.href = getStartUrl();
}

File diff suppressed because one or more lines are too long

View File

@@ -4,6 +4,7 @@
<link rel="stylesheet" href="{{ config.static.url }}css/xterm.css" /> <link rel="stylesheet" href="{{ config.static.url }}css/xterm.css" />
<link rel="stylesheet" href="https://fonts.googleapis.com/css?family=Roboto%20Mono"/> <link rel="stylesheet" href="https://fonts.googleapis.com/css?family=Roboto%20Mono"/>
<script src="{{ config.static.url }}js/textual.js"></script> <script src="{{ config.static.url }}js/textual.js"></script>
<script src="{{ config.static.url }}js/script.js"></script>
<style> <style>
body { body {
background: #000000; background: #000000;
@@ -99,24 +100,6 @@
z-index: 5; z-index: 5;
} }
</style> </style>
<script>
function getStartUrl() {
const url = new URL(window.location.href);
const params = new URLSearchParams(url.search);
params.delete("delay");
return url.pathname + "?" + params.toString();
}
async function refresh() {
const ping_url = document.body.dataset.pingurl;
if (ping_url) {
await fetch(ping_url, {
method: "GET",
mode: "no-cors",
});
}
window.location.href = getStartUrl();
}
</script>
</head> </head>
<body data-pingurl="{{ ping_url }}"> <body data-pingurl="{{ ping_url }}">
<div class="dialog-container intro-dialog"> <div class="dialog-container intro-dialog">
@@ -145,4 +128,4 @@
data-font-size="{{ font_size }}" data-font-size="{{ font_size }}"
></div> ></div>
</body> </body>
</html> </html>