fix: 修复消息处理导致的闪退问题

.gitignore

@@ -1,9 +1,218 @@
+# Project specific additions
 .devflag
-.vscode
+.vscode/
 .directory
 __pycache__/
-scripts/
-.idea
-cache
+.idea/
+cache/
 nucleon/test.toml
 electron/test.toml
+*.egg-info/
+build/
+dist/
+old/
+
+# Project specific directories
+# config/
+data/cache/
+data/electron/
+data/nucleon/
+data/orbital/
+
+# Byte-compiled / optimized / DLL files
+__pycache__/
+*.py[cod]
+*$py.class
+
+# C extensions
+*.so
+
+# Distribution / packaging
+.Python
+build/
+develop-eggs/
+dist/
+downloads/
+eggs/
+.eggs/
+lib/
+lib64/
+parts/
+sdist/
+var/
+wheels/
+share/python-wheels/
+*.egg-info/
+.installed.cfg
+*.egg
+MANIFEST
+
+# PyInstaller
+#  Usually these files are written by a python script from a template
+#  before PyInstaller builds the exe, so as to inject date/other infos into it.
+*.manifest
+*.spec
+
+# Installer logs
+pip-log.txt
+pip-delete-this-directory.txt
+
+# Unit test / coverage reports
+htmlcov/
+.tox/
+.nox/
+.coverage
+.coverage.*
+.cache
+nosetests.xml
+coverage.xml
+*.cover
+*.py,cover
+.hypothesis/
+.pytest_cache/
+cover/
+.claude/
+
+# Translations
+*.mo
+*.pot
+
+# Django stuff:
+*.log
+local_settings.py
+db.sqlite3
+db.sqlite3-journal
+
+# Flask stuff:
+instance/
+.webassets-cache
+
+# Scrapy stuff:
+.scrapy
+
+# Sphinx documentation
+docs/_build/
+
+# PyBuilder
+.pybuilder/
+target/
+
+# Jupyter Notebook
+.ipynb_checkpoints
+
+# IPython
+profile_default/
+ipython_config.py
+
+# pyenv
+#   For a library or package, you might want to ignore these files since the code is
+#   intended to run in multiple environments; otherwise, check them in:
+# .python-version
+
+# pipenv
+#   According to pypa/pipenv#598, it is recommended to include Pipfile.lock in version control.
+#   However, in case of collaboration, if having platform-specific dependencies or dependencies
+#   having no cross-platform support, pipenv may install dependencies that don't work, or not
+#   install all needed dependencies.
+#Pipfile.lock
+
+# poetry
+#   Similar to Pipfile.lock, it is generally recommended to include poetry.lock in version control.
+#   This is especially recommended for binary packages to ensure reproducibility, and is more
+#   commonly used for packaging.
+#poetry.lock
+#poetry.toml
+
+# pdm
+#   Similar to Pipfile.lock, it is generally recommended to include pdm.lock in version control.
+#pdm.lock
+#pdm.toml
+
+# PEP 582; used by e.g. github.com/David-OConnor/pyflow and github.com/pdm-project/pdm
+__pypackages__/
+
+# Celery stuff
+celerybeat-schedule
+celerybeat.pid
+
+# SageMath parsed files
+*.sage.py
+
+# Environments
+.env
+.venv
+env/
+venv/
+ENV/
+env.bak/
+venv.bak/
+
+# Spyder project settings
+.spyderproject
+.spyproject
+
+# Rope project settings
+.ropeproject
+
+# mkdocs documentation
+/site
+
+# mypy
+.mypy_cache/
+.dmypy.json
+dmypy.json
+
+# Pyre type checker
+.pyre/
+
+# pytype static type analyzer
+.pytype/
+
+# Cython debug symbols
+cython_debug/
+
+# PyCharm
+.idea/
+
+# Audio cache and temporary files
+*.mp3
+*.wav
+*.ogg
+*.tmp
+
+# LLM cache files
+*.cache
+*.jsonl
+
+# Log files
+*.log
+logs/
+
+# OS generated files
+.DS_Store
+.DS_Store?
+._*
+.Spotlight-V100
+.Trashes
+ehthumbs.db
+Thumbs.db
+
+# Windows
+Thumbs.db
+ehthumbs.db
+Desktop.ini
+
+# Linux
+*~
+
+# VSCode
+.vscode/
+!.vscode/settings.json
+!.vscode/tasks.json
+!.vscode/launch.json
+!.vscode/extensions.json
+*.code-workspace
+
+# Temporary files
+*.tmp
+*.temp

CONTRIBUTING.md

@@ -1,20 +0,0 @@
-# 贡献指南
-## 使用 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
-```
-

LICENSE

@@ -1,232 +1,661 @@
-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/>.
+                    GNU AFFERO GENERAL PUBLIC LICENSE
+                       Version 3, 19 November 2007
+
+ Copyright (C) 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 Affero General Public License is a free, copyleft license for
+software and other kinds of works, specifically designed to ensure
+cooperation with the community in the case of network server software.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+our General Public Licenses are 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.
+
+  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.
+
+  Developers that use our General Public Licenses protect your rights
+with two steps: (1) assert copyright on the software, and (2) offer
+you this License which gives you legal permission to copy, distribute
+and/or modify the software.
+
+  A secondary benefit of defending all users' freedom is that
+improvements made in alternate versions of the program, if they
+receive widespread use, become available for other developers to
+incorporate.  Many developers of free software are heartened and
+encouraged by the resulting cooperation.  However, in the case of
+software used on network servers, this result may fail to come about.
+The GNU General Public License permits making a modified version and
+letting the public access it on a server without ever releasing its
+source code to the public.
+
+  The GNU Affero General Public License is designed specifically to
+ensure that, in such cases, the modified source code becomes available
+to the community.  It requires the operator of a network server to
+provide the source code of the modified version running there to the
+users of that server.  Therefore, public use of a modified version, on
+a publicly accessible server, gives the public access to the source
+code of the modified version.
+
+  An older license, called the Affero General Public License and
+published by Affero, was designed to accomplish similar goals.  This is
+a different license, not a version of the Affero GPL, but Affero has
+released a new version of the Affero GPL which permits relicensing under
+this license.
+
+  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 Affero 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. Remote Network Interaction; Use with the GNU General Public License.
+
+  Notwithstanding any other provision of this License, if you modify the
+Program, your modified version must prominently offer all users
+interacting with it remotely through a computer network (if your version
+supports such interaction) an opportunity to receive the Corresponding
+Source of your version by providing access to the Corresponding Source
+from a network server at no charge, through some standard or customary
+means of facilitating copying of software.  This Corresponding Source
+shall include the Corresponding Source for any work covered by version 3
+of the GNU General Public License that is incorporated pursuant to the
+following paragraph.
+
+  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 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 work with which it is combined will remain governed by version
+3 of the GNU General Public License.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU Affero 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 Affero 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 Affero 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 Affero 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.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU Affero 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 Affero General Public License for more details.
+
+    You should have received a copy of the GNU Affero 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:
+  If your software can interact with users remotely through a computer
+network, you should also make sure that it provides a way for users to
+get its source.  For example, if your program is a web application, its
+interface could display a "Source" link that leads users to an archive
+of the code.  There are many ways you could offer source, and different
+solutions will be better for different programs; see section 13 for the
+specific requirements.
 
-     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>.
+  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 AGPL, see
+<https://www.gnu.org/licenses/>.

NOTE.md

@@ -1,61 +0,0 @@
-# 实用技巧
-
-## 用于数据组织的 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"
-````
-

README.md

@@ -1,95 +1,2 @@
-# 潜进 (HeurAMS) - 启发式辅助记忆程序
-> 惟算法之可恃兮, **筹来者于未央**  
-> 扶大厦之将倾兮, **挽狂澜于既倒**
-
-## 概述
-"潜进" (HeurAMS: Heuristic Auxiliary Memorizing Scheduler, 启发式记忆辅助调度器) 是为习题册, 古诗词, 及其他问答/记忆/理解型知识设计的辅助记忆软件, 提供动态规划的优化记忆方案  
-
-## 关于此仓库
-"潜进" 软件组项目包含多个子项目:  
-- 此仓库包含了 "潜进" 项目的核心和基于 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 间隔迭代算法, 此算法亦用作 Anki 闪卡记忆软件的默认闪卡调度器
-> 计划: 将添加 FSRS 算法 (Anki 的新可选闪卡调度器) 与一种 SM-15 变体算法作为后续替代  
-> 参考 https://github.com/slaypni/SM-15  
-> 使用 SM-15 的变体:  
-> SM-2 后续算法并非完全开放, 故使用一种基于 SM-15 描述实现的变体算法
-- 动态规划每个记忆单元的记忆间隔时间表
-- 动态跟踪记忆反馈数据，优化长期记忆保留率与稳定性
-
-### 学习进程优化
-- 逐字解析：支持逐字详细释义解析
-- 语法分析：接入生成式人工智能, 支持古文结构交互式解析
-- 自然语音：集成微软神经网络文本转语音 (TTS) 技术
-
-### 实用用户界面
-
-- 响应式 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
-graph TD
-    subgraph 后端
-        A[SM-2 算法] --> B[间隔迭代算法]
-        B --> C[迭代记忆参数]
-    end
-
-    subgraph 用户界面
-        D[展示模块] --> E[用户界面]
-        E --> F[进度追踪面板]
-    end
-    
-    subgraph 外部服务
-        G[LLM]
-        H[TTS]
-    end
-    
-    C --> D
-    F -->|用户数据| C
-    D --> G
-    D --> H
-```
-
-## 系统与平台要求
-
-- 依赖组件: 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
-```
+# 基础模块现代化改进分支
+您正浏览潜进项目的基础模块现代化改进原型分支!

assets/heurams.svg

@@ -1,42 +0,0 @@
-<?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>

auxiliary.py

@@ -1,68 +0,0 @@
-#!/usr/bin/env python3
-import time
-import pathlib
-import toml
-import typing
-from playsound import playsound
-import threading
-import hashlib
-import edge_tts as tts
-
-class ConfigFile:
-    def __init__(self, path: str):
-        self.path = pathlib.Path(path)
-        if not self.path.exists():
-            self.path.touch()
-        self.data = dict()
-        self._load()
-
-    def _load(self):
-        """从文件加载配置数据"""
-        with open(self.path, 'r') as f:
-            try:
-                self.data = toml.load(f)
-            except toml.TomlDecodeError:
-                self.data = {}
-
-    def modify(self, key: str, value: typing.Any):
-        """修改配置值并保存"""
-        self.data[key] = value
-        self.save()
-
-    def save(self, path: typing.Union[str, pathlib.Path] = ""):
-        """保存配置到文件"""
-        save_path = pathlib.Path(path) if path else self.path
-        with open(save_path, 'w') as f:
-            toml.dump(self.data, f)
-
-    def get(self, key: str, default: typing.Any = None) -> typing.Any:
-        """获取配置值，如果不存在返回默认值"""
-        return self.data.get(key, default)
-
-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")
-    time_override = config.get("time_override", -1)
-    
-    if time_override != -1:
-        return int(time_override)
-    
-    return int((time.time()+config.get("timezone_offset")) // (24 * 3600))
-
-def get_md5(text):
-    return hashlib.md5(text.encode('utf-8')).hexdigest()

compositions.py

@@ -1,302 +0,0 @@
-#!/usr/bin/env python3
-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(),
-        extra = {}
-    ):
-        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], extra = {}):
-        super().__init__(screen, reactor, atom)
-
-    def compose(self):
-        yield Label("本次记忆进程结束", id=self.regid("msg"))
-
-
-class Placeholder(Composition):
-    def __init__(self, screen: Screen, extra = {}):
-        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], extra = {}):
-        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], extra = {}):
-        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], extra:Dict = {}):
-        super().__init__(screen, reactor, atom)
-        self.extra = extra
-        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):
-        if self.extra.get("feedback_msg"):
-            yield Label("反馈提示:" + self.extra["feedback_msg"])
-        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 2
-
-
-class DrawCard(Composition):
-    def __init__(self, screen: Screen, reactor, atom: Tuple[pt.Electron, pt.Nucleon, Dict], extra = {}):
-        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 2
-
-
-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()

config

@@ -0,0 +1 @@
+config.example

config.example/config.toml

@@ -0,0 +1,29 @@
+# [调试] 将更改保存到文件
+persist_to_file = 1
+
+# [调试] 覆写时间, 设为 -1 以禁用
+daystamp_override = -1
+timestamp_override = -1
+
+# [调试] 一键通过
+quick_pass = 0
+
+# 对于每个项目的默认新记忆原子数量
+tasked_number = 8
+
+# UTC 时间戳修正 仅用于 UNIX 日时间戳的生成修正, 单位为秒
+timezone_offset = +28800 # 中国标准时间 (UTC+8)
+
+[puzzles] # 谜题默认配置
+
+[puzzles.mcq]
+max_riddles_num = 2
+
+[puzzles.cloze]
+min_denominator = 3
+
+[paths] # 相对于配置文件的 ".." (即工作目录) 而言 或绝对路径
+nucleon_dir = "./data/nucleon"
+electron_dir = "./data/electron"
+orbital_dir = "./data/orbital"
+cache_dir = "./data/cache"

config.toml

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

estimator.py

@@ -1,67 +0,0 @@
-#!/usr/bin/env python3
-# 模拟规划完成所有记忆单元集文件的最小时间
-import os
-import particles as pt
-import datetime
-import pathlib
-import math
-import time
-
-MINIMAL_REPEATATION = 2
-FILTER = "ALL"
-WORST_EF = 5
-PAYLOAD = 16
-
-print("SM-2 任务预规划实用程序")
-print(f"运行时刻: {datetime.datetime.now()}")
-print(f" > 筛选器模式: {FILTER}")
-print(f" > 最小重复次数设置: {MINIMAL_REPEATATION}")
-print(f" > 最坏难度系数: {WORST_EF}")
-print(f" > 单日单元负荷: {PAYLOAD}")
-
-print("--------")
-
-filelist = []
-
-if FILTER == "ALL":
-    for i in os.listdir('./nucleon'):
-        if "toml" in i:
-            print("扫描到记忆单元集: " + i)
-            filelist.append(i)
-    print(f"共需记忆 {len(filelist)} 个记忆单元集")
-else:
-    filelist = [FILTER]
-
-print("--------")
-time_counter = 0
-text_counter = 0
-content_counter = 0
-for i in filelist:
-    print(f"处理: {i}")
-    nucu = pt.NucleonUnion(pathlib.Path("./nucleon/" + i))
-    print(f"记忆单元数: {len(nucu.nucleons)}")
-    content_cnt = 0
-    metadata_trsl_cnt = 0
-    metadata_note_cnt = 0
-    metadata_kwrd_cnt = 0
-    for i in nucu.nucleons:
-        if i.content[-1] != "/":
-            print('检测到不规范字符串')
-            print(i.content)
-        content_cnt += len(i.content)
-        metadata_trsl_cnt += len(str(i.metadata["translation"]))
-        metadata_kwrd_cnt += len(str(i.metadata["keyword_note"]))
-        metadata_note_cnt += len(str(i.metadata["note"]))
-    print(" - 原文文字数: " + str(content_cnt))
-    metadata_cnt = metadata_kwrd_cnt + metadata_note_cnt + metadata_trsl_cnt
-    print(" - 元数据字数: " + str(metadata_cnt) + f"\n = {metadata_trsl_cnt}[翻译] + {metadata_kwrd_cnt}[关键词] + {metadata_note_cnt}[笔记]")
-    print(f" - 总文字数: {content_cnt + metadata_cnt}")
-    print(f"独占记忆时间: {len(nucu.nucleons) / PAYLOAD} -> {math.ceil(len(nucu.nucleons) / PAYLOAD)}")
-    #time.sleep(0.1)
-    text_counter += (content_cnt + metadata_cnt)
-    content_counter += content_cnt
-    time_counter += math.ceil(len(nucu.nucleons) / PAYLOAD)
-    print("--------")
-for i in range(MINIMAL_REPEATATION):
-    print(f"若按计划进行, 最长需要 {time_counter + (i + 1) * 6} 天完成全部内容的第 {i + 1} 次记忆")
-print(f"规划包含 {content_counter} 字, 附加了 {text_counter - content_counter} 字的元数据内容, 共计 {text_counter} 字")

install.bat

@@ -1,40 +0,0 @@
-@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

install.sh

@@ -1,28 +0,0 @@
-#!/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 的环境依赖已安装"

llmplugin.py

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

main.py

@@ -1,24 +0,0 @@
-#!/usr/bin/env python3
-from textual.app import App
-import screens
-import os
-
-class AppLauncher(App):
-    CSS_PATH = "styles.css"
-    TITLE = "潜进 - 辅助记忆调度器"
-    BINDINGS = [("escape", "quit", "退出"), ("d", "toggle_dark", "改变色调")]
-    SCREENS = {
-        "dashboard": screens.DashboardScreen,
-    }
-
-    def on_mount(self) -> None:
-        self.push_screen("dashboard")
-
-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.run()

metadata.py

@@ -1,3 +0,0 @@
-#!/usr/bin/env python3
-ver = "0.3.8"
-stage = "production"

particles.py

@@ -1,278 +0,0 @@
-#!/usr/bin/env python3
-import pathlib
-import toml
-import time
-import auxiliary as aux
-from typing import List
-
-class Electron:
-    """电子: 记忆分析元数据及算法"""
-    algorithm = "SM-2"  # 暂时使用 SM-2 算法进行记忆拟合, 考虑 SM-15 替代
-
-    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 算法迭代决策机制实现
-        根据 quality(0 ~ 5) 进行参数迭代最佳间隔
-        quality 由主程序评估
-
-        Args:
-            quality (int): 记忆保留率量化参数
-        """
-        print(f"REVISOR: {quality}, {is_new_activation}")
-        if quality == -1:
-            return -1
-
-        self.metadata['efactor'] = self.metadata['efactor'] + (
-            0.1 - (5 - quality) * (0.08 + (5 - quality) * 0.02)
-        )
-        self.metadata['efactor'] = max(1.3, self.metadata['efactor'])
-
-        if quality < 3:
-            # 若保留率低于 3，重置重复次数
-            self.metadata['rept'] = 0
-            self.metadata['interval'] = 0  # 设为0，以便下面重新计算 I(1)
-        else:
-            self.metadata['rept'] += 1
-
-        self.metadata['real_rept'] += 1
-
-        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):
-        return (
-            f"记忆单元预览 \n"
-            f"内容: '{self.content}' \n"
-            f"易度系数: {self.metadata['efactor']:.2f} \n"
-            f"已经重复的次数: {self.metadata['rept']} \n"
-            f"下次间隔: {self.metadata['interval']} 天 \n"
-            f"下次复习日期时间戳: {self.metadata['next_date']}"
-        )
-
-    def __eq__(self, other):
-        if self.content == other.content:
-            return True
-        return False
-
-    def __hash__(self):
-        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
-    def placeholder():
-        return Electron("电子对象样例内容", {})
-
-
-class Nucleon:
-    """核子: 材料元数据"""
-
-    def __init__(self, content: str, data: dict):
-        self.metadata = data
-        self.content = 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 __iter__(self):
-        yield from self.metadata.keys()
-
-    def __len__(self):
-        return len(self.metadata)
-
-    def __hash__(self):
-        return hash(self.content)
-
-    @staticmethod
-    def placeholder():
-        return Nucleon("核子对象样例内容", {})
-
-
-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.name = path.name.replace(path.suffix, "")
-        with open(path, 'r') as f:
-            all = toml.load(f)
-            lst = list()
-            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):
-        with open(self.path, 'w') as f:
-            tmp = {i.content: i.metadata for i in self.nucleons}
-            toml.dump(tmp, f)
-
-
-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
-    def 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
-            }
-        )

plugin/heursync/screens.py

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

precache_legacy.py

@@ -1,58 +0,0 @@
-#!/usr/bin/env python3
-# 音频预缓存实用程序(旧版), 独立于主程序之外, 但依赖其他组件
-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("缓存已清空")

pyproject.toml

@@ -0,0 +1,11 @@
+[build-system]
+requires = ["setuptools>=45", "wheel"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name = "heurams"
+version = "0.4.0"
+description = "Heuristic Assisted Memory Scheduler"
+
+[tool.setuptools.packages.find]
+where = ["src"]

reactor.py

@@ -1,198 +0,0 @@
-#!/usr/bin/env python3
-import typing
-import particles as pt
-import pathlib
-import auxiliary as aux
-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, is_review = 0):
-        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)
-        if self.positron["is_new_activation"] == 0:
-            self.procession.append(comps.registry['recognition'](screen, reactor, atom))
-        if is_review == 1:
-            self.procession = [self.procession[-2], self.procession[-1]]
-    def iterator(self):
-        yield from self.procession
-
-
-class Reactor():
-    """反应堆对象, 处理和分配一次文件记忆流程的资源与策略"""
-    def __init__(self, nucleon_file: pt.NucleonUnion, electron_file: pt.ElectronUnion, screen, tasked_num):
-        # 导入原子对象
-        self.stage = 0
-        self.nucleon_file = nucleon_file
-        self.electron_file = electron_file
-        self.tasked_num = tasked_num
-        self.atoms_new = list()
-        self.atoms_review = list()
-        counter = self.tasked_num
-        self.screen = screen
-        self.electron_dict = electron_file.electrons_dict
-        self.quality_dict = {}
-
-        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 nucleon in nucleon_file.nucleons:
-            # atom = (Electron, Nucleon, Positron) 即 (记忆元数据, 内容元数据, 运行时数据)
-            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:
-                    atom[2]["is_new_activation"] = 1
-                    atom[0]["is_activated"] = 1
-                    self.atoms_new.append(atom)
-                    counter -= 1
-            else:
-                atom[2]["is_new_activation"] = 0
-                if int(atom[0]["next_date"]) <= aux.get_daystamp():
-                    atom[0]["last_date"] = aux.get_daystamp()
-                    self.atoms_review.append(atom)
-        # 设置运行时
-        self.index: int
-        self.procession: list
-        self.failed: list
-        self.round_title: str
-        self.current_atom: typing.Tuple[pt.Electron, pt.Nucleon, dict]
-        self.round_set = 0
-        self.current_atom = pt.Atom.placeholder()
-        #print(self.atoms_new)
-
-    def set_round(self, title, procession):
-        self.round_set = 1
-        self.round_title = title
-        self.procession = procession
-        self.failed = list()
-        self.index = -1
-
-    def set_round_templated(self, stage):
-        titles = {
-            1: "复习模式",
-            2: "新记忆模式",
-            3: "总复习模式"
-        }
-        processions = {
-            1: self.atoms_review,
-            2: self.atoms_new,
-            3: (self.atoms_new + self.atoms_review)
-        }
-        self.stage = stage
-        ret = 1
-        if stage == 1 and len(processions[1]) == 0:
-            stage = 2
-            ret = 2
-        if stage == 1 and len(processions[2]) == 0:
-            stage = 3
-            ret = 3
-        self.set_round(title=titles[stage], procession=processions[stage])
-        return ret
-
-    def forward(self, step = 1):
-        """
-        返回值规则:
-        1: 重定向至 failed
-        -1: 此轮已完成
-        0: 下一个记忆单元
-        """
-        if self.index + step >= len(self.procession):
-            if len(self.failed) > 0:
-                self.procession = self.failed
-                self.index = -1
-                self.forward(step)
-                if "- 额外复习" not in self.round_title:
-                    self.round_title += " - 额外复习"
-                self.failed = list()
-                return 1 # 自动重定向到 failed
-            else:
-                self.round_set = 0
-                return -1 # 此轮已完成
-        self.index += step
-        self.current_atom = self.procession[self.index]
-        self.current_appar = Apparatus(self.screen, self, self.current_atom, (self.stage == 1)).iterator()
-        return 0
-
-    def save(self):
-        self._deploy_report()
-        print("Progress saved")
-        # self.nucleon_file.save()
-        if self.electron_file.total["last_date"] < aux.get_daystamp():
-            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):
-        "向反应器和最低质量记录汇报"
-        if atom in self.atoms_new:
-            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:
-            self.failed.append(atom)
-        print(self.quality_dict)

reactor_k.py

@@ -1,77 +0,0 @@
-# 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 的调度器实现"

requirements.txt

@@ -1,8 +0,0 @@
-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

screens.py

@@ -1,552 +0,0 @@
-#!/usr/bin/env python3
-from textual.app import App, ComposeResult
-from textual.widgets import (
-    Header,
-    Footer,
-    Input,
-    ListView,
-    ProgressBar,
-    DirectoryTree,
-    ListItem,
-    Label,
-    Markdown,
-    Static,
-    Button,
-    Select,
-)
-from textual.containers import Container, Horizontal, Center
-from textual.screen import Screen
-from textual.worker import Worker, get_current_worker
-import pathlib
-import threading
-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
-import time
-import shutil
-
-config = aux.ConfigFile("config.toml")
-
-class PrecachingScreen(Screen):
-    """预缓存音频文件屏幕"""
-    BINDINGS = [("q", "go_back", "返回"), ("escape", "quit_app", "退出")]
-    
-    def __init__(self, nucleon_file = None):
-        super().__init__(name=None, id=None, classes=None)
-        self.nucleon_file = nucleon_file
-        self.is_precaching = False
-        self.current_file = ""
-        self.current_item = ""
-        self.progress = 0
-        self.total = 0
-        self.processed = 0
-        self.precache_worker = None
-
-    def compose(self) -> ComposeResult:
-        yield Header(show_clock=True)
-        with Container(id="precache_container"):
-            yield Label("[b]音频预缓存[/b]", classes="title-label")
-            
-            if self.nucleon_file:
-                yield Static(f"目标单元集: [b]{self.nucleon_file.name}[/b]", classes="target-info")
-                yield Static(f"单元数量: {len(self.nucleon_file.nucleons)}", classes="target-info")
-            else:
-                yield Static("目标: 所有单元集", classes="target-info")
-            
-            yield Static(id="status", classes="status-info")
-            yield Static(id="current_item", classes="current-item")
-            yield ProgressBar(total=100, show_eta=False, id="progress_bar")
-            
-            with Horizontal(classes="button-group"):
-                if not self.is_precaching:
-                    yield Button("开始预缓存", id="start_precache", variant="primary")
-                else:
-                    yield Button("取消预缓存", id="cancel_precache", variant="error")
-                yield Button("清空缓存", id="clear_cache", variant="warning")
-                yield Button("返回", id="go_back", variant="default")
-        yield Footer()
-
-    def on_mount(self):
-        """挂载时初始化状态"""
-        self.update_status("就绪", "等待开始...")
-
-    def update_status(self, status, current_item="", progress=None):
-        """更新状态显示"""
-        status_widget = self.query_one("#status", Static)
-        item_widget = self.query_one("#current_item", Static)
-        progress_bar = self.query_one("#progress_bar", ProgressBar)
-        
-        status_widget.update(f"状态: {status}")
-        item_widget.update(f"当前项目: {current_item}" if current_item else "")
-        
-        if progress is not None:
-            progress_bar.progress = progress
-            progress_bar.advance(0)  # 刷新显示
-
-    def precache_single_text(self, text: str):
-        """预缓存单个文本的音频"""
-        cache_dir = pathlib.Path("./cache/voice/")
-        cache_dir.mkdir(parents=True, exist_ok=True)
-        cache = cache_dir / f"{aux.get_md5(text)}.wav"
-        if not cache.exists():
-            try:
-                import edge_tts as tts
-                communicate = tts.Communicate(text, "zh-CN-XiaoxiaoNeural")
-                communicate.save_sync(str(cache))
-                return True
-            except Exception as e:
-                print(f"预缓存失败 '{text}': {e}")
-                return False
-        return True
-
-    def precache_file(self, nucleon_union: pt.NucleonUnion):
-        """预缓存单个文件的所有内容"""
-        self.current_file = nucleon_union.name
-        total_items = len(nucleon_union.nucleons)
-        
-        for idx, nucleon in enumerate(nucleon_union.nucleons):
-            # 检查是否被取消
-            worker = get_current_worker()
-            if worker and worker.is_cancelled:
-                return False
-                
-            text = nucleon['content'].replace('/', '')
-            self.current_item = text[:50] + "..." if len(text) > 50 else text
-            self.processed += 1
-            
-            # 更新进度
-            progress = int((self.processed / self.total) * 100) if self.total > 0 else 0
-            self.update_status(
-                f"处理中: {nucleon_union.name} ({idx+1}/{total_items})", 
-                self.current_item, 
-                progress
-            )
-            
-            # 预缓存音频
-            success = self.precache_single_text(text)
-            if not success:
-                self.update_status("错误", f"处理失败: {self.current_item}")
-                time.sleep(1)  # 短暂暂停以便用户看到错误信息
-                
-        return True
-
-    def precache_all_files(self):
-        """预缓存所有文件"""
-        nucleon_path = pathlib.Path("./nucleon")
-        nucleon_files = [f for f in nucleon_path.iterdir() if f.suffix == ".toml"]
-        
-        # 计算总项目数
-        self.total = 0
-        for file in nucleon_files:
-            try:
-                nu = pt.NucleonUnion(file)
-                self.total += len(nu.nucleons)
-            except:
-                continue
-        
-        self.processed = 0
-        self.is_precaching = True
-        
-        for file in nucleon_files:
-            try:
-                nu = pt.NucleonUnion(file)
-                if not self.precache_file(nu):
-                    break  # 用户取消
-            except Exception as e:
-                print(f"处理文件失败 {file}: {e}")
-                continue
-        
-        self.is_precaching = False
-        self.update_status("完成", "所有音频文件已预缓存", 100)
-
-    def precache_single_file(self):
-        """预缓存单个文件"""
-        if not self.nucleon_file:
-            return
-            
-        self.total = len(self.nucleon_file.nucleons)
-        self.processed = 0
-        self.is_precaching = True
-        
-        success = self.precache_file(self.nucleon_file)
-        
-        self.is_precaching = False
-        if success:
-            self.update_status("完成", f"'{self.nucleon_file.name}' 音频文件已预缓存", 100)
-        else:
-            self.update_status("已取消", "预缓存操作被用户取消", 0)
-
-    def on_button_pressed(self, event: Button.Pressed) -> None:
-        if event.button.id == "start_precache" and not self.is_precaching:
-            # 开始预缓存
-            if self.nucleon_file:
-                self.precache_worker = self.run_worker(self.precache_single_file, thread=True)
-            else:
-                self.precache_worker = self.run_worker(self.precache_all_files, thread=True)
-                
-        elif event.button.id == "cancel_precache" and self.is_precaching:
-            # 取消预缓存
-            if self.precache_worker:
-                self.precache_worker.cancel()
-            self.is_precaching = False
-            self.update_status("已取消", "预缓存操作被用户取消", 0)
-            
-        elif event.button.id == "clear_cache":
-            # 清空缓存
-            try:
-                shutil.rmtree("./cache/voice", ignore_errors=True)
-                self.update_status("已清空", "音频缓存已清空", 0)
-            except Exception as e:
-                self.update_status("错误", f"清空缓存失败: {e}")
-                
-        elif event.button.id == "go_back":
-            self.action_go_back()
-
-    def action_go_back(self):
-        if self.is_precaching and self.precache_worker:
-            self.precache_worker.cancel()
-        self.app.pop_screen()
-
-    def action_quit_app(self):
-        if self.is_precaching and self.precache_worker:
-            self.precache_worker.cancel()
-        self.app.exit()
-
-class MemScreen(Screen):
-    BINDINGS = [
-        ("d", "toggle_dark", "改变色调"),
-        ("q", "pop_screen", "返回主菜单"),
-        ("v", "play_voice", "朗读"),
-    #    ("p", "precache_current", "预缓存当前单元集"),  # 新增预缓存快捷键
-    ]
-    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.nucleon_file = nucleon_file
-        self.electron_file = electron_file
-        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)
-        self.feedback_state = 0 # 默认状态
-        self.feedback_state_map = {
-            0: "",
-            255: "回答有误, 请重试. 或者重新学习此单元",
-        }
-
-    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 Label(self.feedback_state_map[self.feedback_state])
-        yield from self.compo.compose()
-        if self.feedback_state == 255:
-            yield Button("重新学习此单元", id="re-recognize", variant="warning")
-        yield Footer()
-
-    def on_mount(self):
-        pass
-
-    def on_button_pressed(self, event):
-        try:
-            if event.button.id == "re-recognize":
-                return
-        except:
-            pass
-        ret = self.compo.handler(event, "button")
-        self._forward_judge(ret)
-    def _forward_judge(self, ret):
-        self.feedback_state = 0
-        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:
-            if ret == 2:
-                self.feedback_state = 255 # 表示错误
-            else:
-                self.feedback_state = 0
-            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():
-                import edge_tts as tts
-                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_precache_current(self):
-        """预缓存当前单元集的音频"""
-        precache_screen = PrecachingScreen(self.nucleon_file)
-        self.app.push_screen(precache_screen)
-
-    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", "退出"),
-        ("p", "precache", "预缓存音频"),  # 新增预缓存快捷键
-    ]
-
-    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 Button(
-                "预缓存音频",
-                id="precache_button",
-                variant="success",
-                classes="precache-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_precache(self):
-        """预缓存当前单元集的音频"""
-        precache_screen = PrecachingScreen(self.nucleon_file)
-        self.app.push_screen(precache_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)
-        elif event.button.id == "precache_button":
-            self.action_precache()
-
-class NewNucleonScreen(Screen):
-    BINDINGS = [("q", "go_back", "返回"), ("escape", "quit_app", "退出")]
-
-    def __init__(self) -> None:
-        super().__init__(name=None, id=None, classes=None)
-
-    def compose(self) -> ComposeResult:
-        yield Header(show_clock=True)
-        with Container(id="vice_container"):
-            yield Label(f"[b]新建空的单元集\n")
-            yield Markdown("1. 键入单元集名称")
-            yield Input(placeholder="单元集名称")
-            yield Markdown("> 单元集名称不应与现有单元集重复, 新的单元集文件将创建在 ./nucleon/你输入的名称.toml")
-            yield Label(f"\n")
-            yield Markdown("2. 选择单元集类型")
-            LINES = """
-单一字符串
-主字符串(带有附加属性)
-动态单元集(使用宏)
-""".splitlines()
-            yield Select.from_values(LINES, prompt="选择类型")
-            yield Label(f"\n")
-            yield Markdown("3. 输入附加元数据 (可选)")
-            yield Input(placeholder="作者")
-            yield Input(placeholder="内容描述")
-            yield Button(
-                "新建空单元集",
-                id="submit_button",
-                variant="primary",
-                classes="start-button",
-            )
-        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
-
-class DashboardScreen(Screen):
-    #BINDINGS = [("p", "precache_all", "预缓存所有音频")]  # 新增全局预缓存快捷键
-    
-    def compose(self) -> ComposeResult:
-        yield Header(show_clock=True)
-        yield Container(
-            Label(f'欢迎使用 "潜进" 启发式辅助记忆调度器, 版本 {metadata.ver}, 使用 {pt.Electron.algorithm} 调度算法', 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"),
-            #Button("新建空的单元集", id="new_nucleon_button"),
-            Button("音频预缓存实用程序", id="precache_all_button"),
-            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请放置文件后重启应用.\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 on_button_pressed(self, event: Button.Pressed) -> None:
-        if event.button.id == "new_nucleon_button":
-            newscr = NewNucleonScreen()
-            self.app.push_screen(newscr)
-        elif event.button.id == "precache_all_button":
-            self.action_precache_all()
-
-    def action_precache_all(self):
-        """预缓存所有单元集的音频"""
-        precache_screen = PrecachingScreen()
-        self.app.push_screen(precache_screen)
-
-    def action_quit_app(self) -> None:
-        self.app.exit()

serve.py

@@ -1,4 +0,0 @@
-#!/usr/bin/env python3
-from webshare import server
-server = server.Server("python3 main.py", title="辅助记忆程序", host="0.0.0.0")
-server.serve()

src/heurams/__init__.py

@@ -0,0 +1 @@
+print("Hello from HeurAMS Program :)")

src/heurams/context.py

@@ -0,0 +1,46 @@
+"""
+全局上下文管理模块
+以及基准路径
+"""
+from contextvars import ContextVar
+import pathlib
+from heurams.services.config import ConfigFile
+
+# 默认配置文件路径规定: 以包目录为准
+# 用户配置文件路径规定: 以运行目录为准
+# 数据文件路径规定: 以运行目录为准
+
+rootdir = pathlib.Path(__file__).parent
+print(f'rootdir: {rootdir}')
+workdir = pathlib.Path.cwd()
+print(f'workdir: {workdir}')
+config_var: ContextVar[ConfigFile] = ContextVar('config_var', default=ConfigFile(rootdir / "default" / "config" / "config.toml"))
+try:
+    config_var: ContextVar[ConfigFile] = ContextVar('config_var', default=ConfigFile(workdir / "config" / "config.toml")) # 配置文件
+    print('已加载自定义用户配置')
+except:
+    print('未能加载自定义用户配置')
+
+#runtime_var: ContextVar = ContextVar('runtime_var', default=dict()) # 运行时共享数据
+
+class ConfigContext:
+    """
+    功能完备的上下文管理器
+    用于临时切换配置的作用域, 支持嵌套使用
+
+    Example:
+        >>> with ConfigContext(test_config):
+        ...     get_daystamp()  # 使用 test_config
+        >>> get_daystamp()  # 恢复原配置
+    """
+    
+    def __init__(self, config_provider: ConfigFile):
+        self.config_provider = config_provider
+        self._token = None
+    
+    def __enter__(self):
+        self._token = config_var.set(self.config_provider)
+        return self
+    
+    def __exit__(self, exc_type, exc_val, exc_tb):
+        config_var.reset(self._token) # type: ignore

src/heurams/default/config/config.toml

@@ -0,0 +1,29 @@
+# [调试] 将更改保存到文件
+persist_to_file = 1
+
+# [调试] 覆写时间, 设为 -1 以禁用
+daystamp_override = -1
+timestamp_override = -1
+
+# [调试] 一键通过
+quick_pass = 0
+
+# 对于每个项目的默认新记忆原子数量
+tasked_number = 8
+
+# UTC 时间戳修正 仅用于 UNIX 日时间戳的生成修正, 单位为秒
+timezone_offset = +28800 # 中国标准时间 (UTC+8)
+
+[puzzles] # 谜题默认配置
+
+[puzzles.mcq]
+max_riddles_num = 2
+
+[puzzles.cloze]
+min_denominator = 3
+
+[paths] # 相对于工作目录而言 或绝对路径
+nucleon_dir = "./data/nucleon"
+electron_dir = "./data/electron"
+orbital_dir = "./data/orbital"
+cache_dir = "./data/cache"

src/heurams/interface/README.md

@@ -0,0 +1,2 @@
+# Interface - 用户界面
+与界面系统**强绑定**的相关代码文件, "界面系统" 在此处是基本界面实现相关的 Textual 框架

src/heurams/interface/__main__.py

@@ -0,0 +1,43 @@
+from heurams.context import rootdir, workdir, config_var
+
+from textual.app import App
+from textual.widgets import Button
+from .screens.dashboard import DashboardScreen
+from .screens.nucleon_creator import NucleonCreatorScreen
+from .screens.precache import PrecachingScreen
+
+class HeurAMSApp(App):
+    TITLE = "潜进"
+    #CSS_PATH = str(cxt.rootdir / "interface" / "css" / "main.css")
+    SUB_TITLE = "启发式先进记忆调度器"
+    BINDINGS = [("q", "quit", "退出"), 
+                ("d", "toggle_dark", "改变色调"),
+                ("1", "app.push_screen('dashboard')", "仪表盘"),
+                ("2", "app.push_screen('precache_all')", "缓存管理器"),
+                ("3", "app.push_screen('nucleon_creator')", "创建新单元"),
+                ]
+    SCREENS = {
+        "dashboard": DashboardScreen,
+        "nucleon_creator": NucleonCreatorScreen,
+        "precache_all": PrecachingScreen,
+    }
+
+    def on_mount(self) -> None:
+        self.push_screen("dashboard")
+
+    def on_button_pressed(self, event: Button.Pressed) -> None:
+        self.exit(event.button.id)
+
+def environment_check():
+    from pathlib import Path
+    for i in config_var.get()["paths"].values():
+        i = Path(i)
+        if not i.exists():
+            print(f"创建 {i}")
+            i.mkdir(exist_ok = True, parents = True)
+        else:
+            print(f"找到 {i}")
+
+environment_check()
+app = HeurAMSApp()
+app.run()

src/heurams/interface/screens/about.py

@@ -0,0 +1,91 @@
+#!/usr/bin/env python3
+from textual.app import ComposeResult
+from textual.widgets import (
+    Header,
+    Footer,
+    Label,
+    Static,
+    Button,
+    Markdown,
+)
+from textual.containers import Container
+from textual.screen import Screen
+
+import heurams.services.version as version
+from heurams.context import *
+
+class AboutScreen(Screen):
+    BINDINGS = [
+        ("q", "go_back", "返回"),
+        ("escape", "quit_app", "退出"),
+    ]
+
+    def compose(self) -> ComposeResult:
+        yield Header(show_clock=True)
+        with Container(id="about_container"):
+            yield Label("关于 '潜进' 启发式先进记忆调度器", classes="title-label")
+            yield Static(f"\n版本: {version.ver} {version.codename.capitalize()}")
+            yield Static(f"开发者名单:") # TODO: 取消硬编码, 和 git/vcs 集成
+            yield Static(f"@pluvium27 (Wang Zhiyu)") # TODO: 取消硬编码, 和 git/vcs 集成
+            yield Static(f"Copyright 2025")
+            yield Static("\n")
+
+            about_text = f"""
+## 关于 "潜进"  
+
+版本 {version.ver} {version.stage}
+  
+开发代号: {version.codename}  
+
+一个基于启发式算法的开放源代码记忆调度器, 旨在帮助用户更高效地进行记忆工作与学习规划.  
+
+以 AGPL-3.0 开放源代码  
+
+## 参与贡献
+
+我们是一个年轻且包容的社区, 由技术人员, 设计师, 文书工作者, 以及创意人员共同构成,  
+
+通过我们协力开发的软件为所有人谋取福祉.  
+
+此项目不是 KDE 软件, 但上述工作不可避免地让我们确立了和 KDE 宣言相同的下列价值观:  
+
+ - 开放治理 确保更多人能参与我们的领导和决策进程;  
+
+ - 自由软件 确保我们的工作成果随时能为所有人所用;  
+
+ - 多样包容 确保所有人都能加入社区并参加工作;  
+
+ - 创新精神 确保新思路能不断涌现并服务于所有人;  
+
+ - 共同产权 确保我们能团结一致;  
+
+ - 迎合用户 确保我们的成果对所有人有用.  
+
+综上所述, 在为我们共同目标奋斗的过程中, 我们认为上述价值观反映了我们社区的本质, 是我们始终如一地保持初心的关键所在.  
+
+这是一项立足于协作精神的事业, 它的运作和产出不受任何单一个人或者机构的操纵.  
+
+我们的共同目标是为人人带来高品质的辅助记忆 & 学习软件.
+
+不管您来自何方, 我们都欢迎您加入社区并做出贡献.
+
+"""
+            yield Markdown(about_text, classes="about-markdown")
+
+            yield Button(
+                "返回主界面",
+                id="back_button",
+                variant="primary",
+                classes="back-button",
+            )
+        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) -> None:
+        if event.button.id == "back_button":
+            self.action_go_back()

src/heurams/interface/screens/dashboard.py

@@ -0,0 +1,118 @@
+#!/usr/bin/env python3
+from textual.app import ComposeResult
+from textual.widgets import (
+    Header,
+    Footer,
+    Label,
+    ListView,
+    ListItem,
+    Button,
+    Static,
+)
+from textual.containers import Container
+from textual.screen import Screen
+
+from heurams.kernel.particles import *
+from heurams.context import *
+import heurams.services.version as version
+import heurams.services.timer as timer
+from .preparation import PreparationScreen
+
+import pathlib
+
+class DashboardScreen(Screen):
+
+    def compose(self) -> ComposeResult:
+        yield Header(show_clock=True)
+        yield Container(
+            Label(f'欢迎使用 "潜进" 启发式先进记忆调度器', classes="title-label"),
+            Label(f"当前 UNIX 日时间戳: {timer.get_daystamp()}"),
+            Label(f'时区修正: UTC+{config_var.get()["timezone_offset"] / 3600}'),
+            Label("选择待学习或待修改的记忆单元集:", classes="title-label"),
+            ListView(id="union-list", classes="union-list-view"),
+            Label(f'"潜进" 开放源代码软件项目 | 版本 {version.ver} {version.codename.capitalize()} | Wang Zhiyu 2025'),
+        )
+        yield Footer()
+
+    def item_desc_generator(self, filename) -> dict:
+        """简单分析以生成项目项显示文本
+
+        Returns:
+            dict: 以数字为列表, 分别呈现单行字符串
+        """
+        res = dict()
+        filestem = pathlib.Path(filename).stem
+        res[0] = f"{filename}\0"
+        from heurams.kernel.particles.loader import load_electron
+        import heurams.kernel.particles as pt
+        electron_file_path = (pathlib.Path(config_var.get()["paths"]["electron_dir"]) / (filestem + ".json"))
+        if electron_file_path.exists(): # 未找到则创建电子文件 (json)
+            pass
+        else:
+            electron_file_path.touch()
+            with open(electron_file_path, 'w') as f:
+                f.write("{}")
+        electron_dict = load_electron(path=electron_file_path) # TODO: 取消硬编码扩展名
+        is_due = 0
+        is_activated = 0
+        nextdate = 0x3f3f3f3f
+        for i in electron_dict.values():
+            i: pt.Electron
+            if i.is_due():
+                is_due = 1
+            if i.is_activated():
+                is_activated = 1
+            nextdate = min(nextdate, i.nextdate())
+        res[1] = f"下一次复习: {nextdate}\n"
+        res[1] += f"{is_due if "需要复习" else "当前无需复习"}"
+        if not is_activated:
+            res[1] = "  尚未激活"
+        return res
+
+    def on_mount(self) -> None:
+        union_list_widget = self.query_one("#union-list", ListView)
+
+        probe = probe_all(0)
+
+        if len(probe["nucleon"]):
+            for file in probe["nucleon"]:
+                text = self.item_desc_generator(file)
+                union_list_widget.append(ListItem(
+                    Label(text[0] + '\n' + text[1]),
+                    ))
+        else:
+            union_list_widget.append(
+                ListItem(Static("在 ./nucleon/ 中未找到任何内容源数据文件.\n请放置文件后重启应用.\n或者新建空的单元集."))
+            )
+            union_list_widget.disabled = True
+
+    def on_list_view_selected(self, event) -> 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 = pathlib.Path(str(selected_label.renderable)
+                                         .partition('\0')[0] # 文件名末尾截断, 保留文件名
+                                         .replace('*', "")) # 去除markdown加粗
+
+        nucleon_file_path = pathlib.Path(config_var.get()["paths"]["nucleon_dir"]) / selected_filename
+        electron_file_path = pathlib.Path(config_var.get()["paths"]["electron_dir"]) / (str(selected_filename.stem) + ".json")
+        self.app.push_screen(PreparationScreen(nucleon_file_path, electron_file_path))
+
+    def on_button_pressed(self, event) -> None:
+        if event.button.id == "new_nucleon_button":
+            # 切换到创建单元
+            from .nucleon_creator import NucleonCreatorScreen
+            newscr = NucleonCreatorScreen()
+            self.app.push_screen(newscr)
+        elif event.button.id == "precache_all_button":
+            # 切换到缓存管理器
+            from .precache import PrecachingScreen
+            precache_screen = PrecachingScreen()
+            self.app.push_screen(precache_screen)
+
+    def action_quit_app(self) -> None:
+        self.app.exit()

src/heurams/interface/screens/memorizor.py

@@ -0,0 +1,76 @@
+#!/usr/bin/env python3
+from textual.app import ComposeResult
+from textual.widgets import Header, Footer, Label, Static, Button
+from textual.containers import Center
+from textual.screen import Screen
+from enum import Enum, auto
+
+from heurams.context import config_var
+from heurams.kernel.reactor import *
+import heurams.kernel.particles as pt
+import heurams.kernel.puzzles as pz
+from .. import shim
+
+class AtomState(Enum):
+    FAILED = auto()
+    NORMAL = auto()
+
+class MemScreen(Screen):
+    BINDINGS = [
+        ("q", "pop_screen", "返回"),
+        #("p", "prev", "上一个"),
+        ("d", "toggle_dark", "改变色调"),
+        ("v", "play_voice", "朗读"),
+    ]
+
+    if config_var.get()["quick_pass"]:
+        BINDINGS.append(("k", "quick_pass", "跳过"))
+
+    def __init__(self, atoms: list, name: str | None = None, id: str | None = None, classes: str | None = None) -> None:
+        super().__init__(name, id, classes)
+        self.atoms = atoms
+        self.phaser = Phaser(atoms)
+        #print(self.phaser.state)
+        self.procession: Procession = self.phaser.current_procession() # type: ignore
+        #print(self.phaser.state)
+
+    def current_widget(self):
+        try:
+            self.fission = Fission(self.procession.current_atom, self.phaser.state)
+            puzzle_info = next(self.fission.generate())
+            print(puzzle_info)
+            return shim.puzzle2widget[puzzle_info["puzzle"]](atom = self.procession.current_atom, alia = puzzle_info["alia"])
+        except (KeyError, StopIteration, AttributeError) as e:
+            print(f"Fission error: {e}")
+            return Static("无法生成谜题")
+        #print(shim.puzzle2widget[puzzle_info["puzzle"]])
+
+    def compose(self) -> ComposeResult:
+        yield Header(show_clock=True)
+        with Center():
+            yield Static(f"当前进度: {self.procession.process()}/{self.procession.total_length()}")
+        self.mount(self.current_widget()) # type: ignore
+        #yield Button("重新学习此单元", id="re-recognize", variant="warning")
+        yield Footer()
+
+    def on_mount(self):
+        pass
+
+    def on_button_pressed(self, event):
+        event.stop()
+
+    def action_play_voice(self):
+        """朗读当前内容"""
+        pass
+
+    def action_precache_current(self):
+        """预缓存当前单元集的音频"""
+        #from .precache import PrecachingScreen
+        #precache_screen = PrecachingScreen(self.nucleon_file)
+        #self.app.push_screen(precache_screen)
+
+    def action_toggle_dark(self):
+        self.app.action_toggle_dark()
+
+    def action_pop_screen(self):
+        self.app.pop_screen()

src/heurams/interface/screens/nucleon_creator.py

@@ -0,0 +1,55 @@
+#!/usr/bin/env python3
+from textual.app import ComposeResult
+from textual.widgets import (
+    Header,
+    Footer,
+    Label,
+    Input,
+    Select,
+    Button,
+    Markdown,
+)
+from textual.containers import Container
+from textual.screen import Screen
+
+class NucleonCreatorScreen(Screen):
+    BINDINGS = [("q", "go_back", "返回"), ("escape", "quit_app", "退出")]
+
+    def __init__(self) -> None:
+        super().__init__(name=None, id=None, classes=None)
+
+    def compose(self) -> ComposeResult:
+        yield Header(show_clock=True)
+        with Container(id="vice_container"):
+            yield Label(f"[b]新建空的单元集\n")
+            yield Markdown("1. 键入单元集名称")
+            yield Input(placeholder="单元集名称")
+            yield Markdown("> 单元集名称不应与现有单元集重复, 新的单元集文件将创建在 ./nucleon/你输入的名称.toml")
+            yield Label(f"\n")
+            yield Markdown("2. 选择单元集类型")
+            LINES = """
+单一字符串
+主字符串(带有附加属性)
+动态单元集(使用宏)
+""".splitlines()
+            yield Select.from_values(LINES, prompt="选择类型")
+            yield Label(f"\n")
+            yield Markdown("3. 输入附加元数据 (可选)")
+            yield Input(placeholder="作者")
+            yield Input(placeholder="内容描述")
+            yield Button(
+                "新建空单元集",
+                id="submit_button",
+                variant="primary",
+                classes="start-button",
+            )
+        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) -> None:
+        pass

src/heurams/interface/screens/precache.py

@@ -0,0 +1,208 @@
+#!/usr/bin/env python3
+from textual.app import ComposeResult
+from textual.widgets import (
+    Header,
+    Footer,
+    Label,
+    Input,
+    Select,
+    Button,
+    Markdown,
+    Static,
+    ProgressBar,
+)
+from textual.containers import Container, Horizontal, Center
+from textual.containers import Container
+from textual.screen import Screen
+import pathlib
+
+import heurams.kernel.particles as pt
+import heurams.services.hasher as hasher
+from heurams.context import *
+
+class PrecachingScreen(Screen):
+    """预缓存音频文件屏幕"""
+    BINDINGS = [("q", "go_back", "返回")]
+    
+    def __init__(self, nucleon_file = None):
+        super().__init__(name=None, id=None, classes=None)
+        self.nucleon_file = nucleon_file
+        self.is_precaching = False
+        self.current_file = ""
+        self.current_item = ""
+        self.progress = 0
+        self.total = 0
+        self.processed = 0
+        self.precache_worker = None
+
+    def compose(self) -> ComposeResult:
+        yield Header(show_clock=True)
+        with Container(id="precache_container"):
+            yield Label("[b]音频预缓存[/b]", classes="title-label")
+            
+            if self.nucleon_file:
+                yield Static(f"目标单元集: [b]{self.nucleon_file.name}[/b]", classes="target-info")
+                yield Static(f"单元数量: {len(self.nucleon_file.nucleons)}", classes="target-info")
+            else:
+                yield Static("目标: 所有单元集", classes="target-info")
+            
+            yield Static(id="status", classes="status-info")
+            yield Static(id="current_item", classes="current-item")
+            yield ProgressBar(total=100, show_eta=False, id="progress_bar")
+            
+            with Horizontal(classes="button-group"):
+                if not self.is_precaching:
+                    yield Button("开始预缓存", id="start_precache", variant="primary")
+                else:
+                    yield Button("取消预缓存", id="cancel_precache", variant="error")
+                yield Button("清空缓存", id="clear_cache", variant="warning")
+                yield Button("返回", id="go_back", variant="default")
+        yield Footer()
+
+    def on_mount(self):
+        """挂载时初始化状态"""
+        self.update_status("就绪", "等待开始...")
+
+    def update_status(self, status, current_item="", progress=None):
+        """更新状态显示"""
+        status_widget = self.query_one("#status", Static)
+        item_widget = self.query_one("#current_item", Static)
+        progress_bar = self.query_one("#progress_bar", ProgressBar)
+        
+        status_widget.update(f"状态: {status}")
+        item_widget.update(f"当前项目: {current_item}" if current_item else "")
+        
+        if progress is not None:
+            progress_bar.progress = progress
+            progress_bar.advance(0)  # 刷新显示
+
+    def precache_single_text(self, text: str):
+        """预缓存单个文本的音频"""
+        cache_dir = pathlib.Path("./cache/voice/")
+        cache_dir.mkdir(parents=True, exist_ok=True)
+        cache = cache_dir / f"{hasher.get_md5(text)}.wav"
+        if not cache.exists():
+            try:
+                import edge_tts as tts
+                communicate = tts.Communicate(text, "zh-CN-XiaoxiaoNeural")
+                communicate.save_sync(str(cache))
+                return True
+            except Exception as e:
+                print(f"预缓存失败 '{text}': {e}")
+                return False
+        return True
+
+    def precache_file(self, path: pathlib.Path):
+        """预缓存单个文件的所有内容"""
+        self.current_file = path.name
+        total_items = len(pt.load_nucleon(path))
+        
+        for idx, nucleon in enumerate(nucleon_union.nucleons):
+            # 检查是否被取消
+            worker = get_current_worker()
+            if worker and worker.is_cancelled:
+                return False
+                
+            text = nucleon['content'].replace('/', '')
+            self.current_item = text[:50] + "..." if len(text) > 50 else text
+            self.processed += 1
+            
+            # 更新进度
+            progress = int((self.processed / self.total) * 100) if self.total > 0 else 0
+            self.update_status(
+                f"处理中: {nucleon_union.name} ({idx+1}/{total_items})", 
+                self.current_item, 
+                progress
+            )
+            
+            # 预缓存音频
+            success = self.precache_single_text(text)
+            if not success:
+                self.update_status("错误", f"处理失败: {self.current_item}")
+                time.sleep(1)  # 短暂暂停以便用户看到错误信息
+                
+        return True
+
+
+    def precache_all_files(self):
+        """预缓存所有文件"""
+        nucleon_path = pathlib.Path("./nucleon")
+        nucleon_files = [f for f in nucleon_path.iterdir() if f.suffix == ".toml"]
+        
+        # 计算总项目数
+        self.total = 0
+        nu = list()
+        for file in nucleon_files:
+            try:
+                nu += pt.load_nucleon(file)
+                self.total = len(nu)
+            except:
+                continue
+        
+        self.processed = 0
+        self.is_precaching = True
+        
+        for file in nucleon_files:
+            try:
+                nu += pt.load_nucleon(file)
+                if not self.precache_file(nu):
+                    break  # 用户取消
+            except Exception as e:
+                print(f"处理文件失败 {file}: {e}")
+                continue
+        
+        self.is_precaching = False
+        self.update_status("完成", "所有音频文件已预缓存", 100)
+
+    def precache_single_file(self):
+        """预缓存单个文件"""
+        if not self.nucleon_file:
+            return
+            
+        self.total = len(self.nucleon_file.nucleons)
+        self.processed = 0
+        self.is_precaching = True
+        
+        success = self.precache_file(self.nucleon_file)
+        
+        self.is_precaching = False
+        if success:
+            self.update_status("完成", f"'{self.nucleon_file.name}' 音频文件已预缓存", 100)
+        else:
+            self.update_status("已取消", "预缓存操作被用户取消", 0)
+
+    def on_button_pressed(self, event: Button.Pressed) -> None:
+        if event.button.id == "start_precache" and not self.is_precaching:
+            # 开始预缓存
+            if self.nucleon_file:
+                self.precache_worker = self.run_worker(self.precache_single_file, thread=True)
+            else:
+                self.precache_worker = self.run_worker(self.precache_all_files, thread=True)
+                
+        elif event.button.id == "cancel_precache" and self.is_precaching:
+            # 取消预缓存
+            if self.precache_worker:
+                self.precache_worker.cancel()
+            self.is_precaching = False
+            self.update_status("已取消", "预缓存操作被用户取消", 0)
+            
+        elif event.button.id == "clear_cache":
+            # 清空缓存
+            try:
+                shutil.rmtree("./cache/voice", ignore_errors=True)
+                self.update_status("已清空", "音频缓存已清空", 0)
+            except Exception as e:
+                self.update_status("错误", f"清空缓存失败: {e}")
+                
+        elif event.button.id == "go_back":
+            self.action_go_back()
+
+    def action_go_back(self):
+        if self.is_precaching and self.precache_worker:
+            self.precache_worker.cancel()
+        self.app.pop_screen()
+
+    def action_quit_app(self):
+        if self.is_precaching and self.precache_worker:
+            self.precache_worker.cancel()
+        self.app.exit()

src/heurams/interface/screens/preparation.py

@@ -0,0 +1,102 @@
+#!/usr/bin/env python3
+from textual.app import ComposeResult
+from textual.widgets import (
+    Header,
+    Footer,
+    Label,
+    Static,
+    Button,
+    Markdown,
+)
+from textual.containers import Container
+from textual.screen import Screen
+
+import heurams.kernel.particles as pt
+import heurams.services.hasher as hasher
+from heurams.context import *
+
+class PreparationScreen(Screen):
+    BINDINGS = [
+        ("q", "go_back", "返回"),
+        ("escape", "quit_app", "退出"),
+        ("p", "precache", "预缓存音频")
+    ]
+
+    def __init__(
+        self, nucleon_file: pathlib.Path, electron_file: pathlib.Path
+    ) -> None:
+        super().__init__(name=None, id=None, classes=None)
+        self.nucleon_file = nucleon_file
+        self.electron_file = electron_file
+        self.nucleons_with_orbital = pt.load_nucleon(self.nucleon_file)
+        self.electrons = pt.load_electron(self.electron_file)
+
+    def compose(self) -> ComposeResult:
+        yield Header(show_clock=True)
+        with Container(id="vice_container"):
+            yield Label(f"准备就绪: [b]{self.nucleon_file.stem}[/b]\n")
+            yield Label(f"内容源文件对象: ./nucleon/[b]{self.nucleon_file.name}[/b]")
+            yield Label(f"元数据文件对象: ./electron/[b]{self.electron_file.name}[/b]")
+            yield Label(f"\n单元数量: {len(self.nucleons_with_orbital)}\n")
+
+            yield Button(
+                    "开始记忆",
+                    id="start_memorizing_button",
+                    variant="primary",
+                    classes="start-button",
+            )
+            yield Button(
+                "预缓存音频",
+                id="precache_button",
+                variant="success",
+                classes="precache-button",
+            )
+
+            yield Static(f"\n单元预览:\n")
+            yield Markdown(self._get_full_content().replace("/", ""), classes="full")
+        yield Footer()
+
+    def _get_full_content(self):
+        content = ""
+        for nucleon, orbital in self.nucleons_with_orbital:
+            nucleon: pt.Nucleon
+            # print(nucleon.payload)
+            content += " - " + nucleon["content"] + "  \n"
+        return content
+
+    def action_go_back(self):
+        self.app.pop_screen()
+
+    def action_precache(self):
+        from ..screens.precache import PrecachingScreen
+        precache_screen = PrecachingScreen(self.nucleon_file)
+        self.app.push_screen(precache_screen)
+
+    def action_quit_app(self):
+        self.app.exit()
+
+    def on_button_pressed(self, event: Button.Pressed) -> None:
+        event.stop()
+        if event.button.id == "start_memorizing_button":
+            atoms = list()
+            for nucleon, orbital in self.nucleons_with_orbital:
+                atom = pt.Atom(nucleon.ident)
+                atom.link("nucleon", nucleon)
+                try:
+                    atom.link("electron", self.electrons[nucleon.ident])
+                except KeyError:
+                    atom.link("electron", pt.Electron(nucleon.ident))
+                atom.link("orbital", orbital)
+                atom.link("nucleon_fmt", "toml")
+                atom.link("electron_fmt", "json")
+                atom.link("orbital_fmt", "toml")
+                atom.link("nucleon_path", self.nucleon_file)
+                atom.link("electron_path", self.electron_file)
+                atom.link("orbital_path", None)
+                atoms.append(atom)
+            from .memorizor import MemScreen
+            memscreen = MemScreen(atoms)
+            self.app.push_screen(memscreen)
+        elif event.button.id == "precache_button":
+            self.action_precache()
+        

src/heurams/interface/shim.py

@@ -0,0 +1,24 @@
+"""Kernel 操作先进函数库"""
+import random
+import heurams.kernel.particles as pt
+import heurams.kernel.puzzles as pz
+import heurams.interface.widgets as pzw
+from typing import TypedDict
+staging = {} # 细粒度缓存区, 是 ident -> quality 的封装
+def report_to_staging(atom: pt.Atom, quality):
+    staging[atom.ident] = min(quality, staging[atom.ident])
+def clear():
+    staging = dict()
+def deploy_to_electron():
+    for atom_ident, quality in staging.items():
+        if pt.atom_registry[atom_ident].registry['electron'].is_activated:
+            pt.atom_registry[atom_ident].registry['electron'].revisor(quality=quality)
+        else:
+            pt.atom_registry[atom_ident].registry['electron'].revisor(quality=quality, is_new_activation=True)
+    clear()
+puzzle2widget = {
+    pz.RecognitionPuzzle: pzw.Recognition,
+    pz.ClozePuzzle: pzw.ClozePuzzle,
+    pz.MCQPuzzle: pzw.MCQPuzzle,
+    pz.BasePuzzle: pzw.BasePuzzleWidget,
+}

src/heurams/interface/widgets/__init__.py

@@ -0,0 +1,7 @@
+from .base_puzzle_widget import BasePuzzleWidget
+from .basic_puzzle import BasicEvaluation
+from .cloze_puzzle import ClozePuzzle
+from .finished import Finished
+from .mcq_puzzle import MCQPuzzle
+from .placeholder import Placeholder
+from .recognition import Recognition

src/heurams/interface/widgets/base_puzzle_widget.py

@@ -0,0 +1,7 @@
+from textual.widget import Widget
+import heurams.kernel.particles as pt
+
+class BasePuzzleWidget(Widget):
+    def __init__(self, *children: Widget, atom: pt.Atom, name: str | None = None, id: str | None = None, classes: str | None = None, disabled: bool = False, markup: bool = True) -> None:
+        super().__init__(*children, name=name, id=id, classes=classes, disabled=disabled, markup=markup)
+        self.atom = atom

src/heurams/interface/widgets/basic_puzzle.py

@@ -0,0 +1,96 @@
+from textual.widgets import (
+    Label,
+    Static,
+    Button,
+)
+from textual.containers import Container, Horizontal
+from textual.widget import Widget
+import heurams.kernel.particles as pt
+from .base_puzzle_widget import BasePuzzleWidget
+from textual.message import Message
+
+class BasicEvaluation(BasePuzzleWidget):
+    def __init__(self, *children: Widget, atom: pt.Atom, alia: str = "", name: str | None = None, id: str | None = None, classes: str | None = None, disabled: bool = False, markup: bool = True) -> None:
+        super().__init__(*children, atom=atom, name=name, id=id, classes=classes, disabled=disabled, markup=markup)
+
+    class RatingChanged(Message):
+        def __init__(self, rating: int) -> None:
+            self.rating = rating  # 评分值 (0-5)
+            super().__init__()
+
+    # 反馈映射表
+    feedback_mapping = {
+        "feedback_5": {"rating": 5, "text": "完美回想"},
+        "feedback_4": {"rating": 4, "text": "犹豫后正确"},
+        "feedback_3": {"rating": 3, "text": "困难地正确"},
+        "feedback_2": {"rating": 2, "text": "错误但熟悉"},
+        "feedback_1": {"rating": 1, "text": "错误且不熟"},
+        "feedback_0": {"rating": 0, "text": "完全空白"},
+    }
+
+    def compose(self):
+        # 显示主要内容
+        yield Label(self.atom.registry["nucleon"]["content"], id="main")
+        
+        # 显示评估说明（可选）
+        yield Static("请评估你对这个内容的记忆程度：", classes="instruction")
+        
+        # 按钮容器
+        with Container(id="button_container"):
+            btn = {}
+            btn["5"] = Button(
+                "完美回想", variant="success", id="feedback_5", classes="choice"
+            )
+            btn["4"] = Button(
+                "犹豫后正确", variant="success", id="feedback_4", classes="choice"
+            )
+            btn["3"] = Button(
+                "困难地正确", variant="warning", id="feedback_3", classes="choice"
+            )
+            btn["2"] = Button(
+                "错误但熟悉", variant="warning", id="feedback_2", classes="choice"
+            )
+            btn["1"] = Button(
+                "错误且不熟", variant="error", id="feedback_1", classes="choice"
+            )
+            btn["0"] = Button(
+                "完全空白", variant="error", id="feedback_0", classes="choice"
+            )
+            
+            # 布局按钮
+            yield Horizontal(btn["5"], btn["4"])
+            yield Horizontal(btn["3"], btn["2"])
+            yield Horizontal(btn["1"], btn["0"])
+
+    def on_button_pressed(self, event: Button.Pressed) -> None:
+        """处理按钮点击事件"""
+        button_id = event.button.id
+
+        if button_id in self.feedback_mapping:
+            feedback_info = self.feedback_mapping[button_id]
+            
+            self.post_message(self.RatingChanged(
+                rating=feedback_info["rating"],
+            ))
+            
+            event.button.add_class("selected")
+            
+            self.disable_other_buttons(button_id)
+
+    def disable_other_buttons(self, selected_button_id: str) -> None:
+        for button in self.query("Button.choice"):
+            if button.id != selected_button_id:
+                button.disabled = True
+
+    def enable_all_buttons(self) -> None:
+        for button in self.query("Button.choice"):
+            button.disabled = False
+
+    def on_key(self, event) -> None:
+        if event.key in ["0", "1", "2", "3", "4", "5"]:
+            button_id = f"feedback_{event.key}"
+            if button_id in self.feedback_mapping:
+                # 模拟按钮点击
+                self.post_message(self.RatingChanged(
+                    rating=self.feedback_mapping[button_id]["rating"],
+                ))

src/heurams/interface/widgets/cloze_puzzle.py

@@ -0,0 +1,85 @@
+from textual.widgets import (
+    Label,
+    Button,
+)
+from textual.widget import Widget
+import heurams.kernel.particles as pt
+import heurams.kernel.puzzles as pz
+from .base_puzzle_widget import BasePuzzleWidget
+import copy
+import random
+from textual.message import Message
+
+class ClozePuzzle(BasePuzzleWidget):
+
+    def __init__(self, *children: Widget, atom: pt.Atom, alia: str = "", name: str | None = None, id: str | None = None, classes: str | None = None, disabled: bool = False, markup: bool = True) -> None:
+        super().__init__(*children, atom=atom, name=name, id=id, classes=classes, disabled=disabled, markup=markup)
+        self.inputlist = list()
+        self.hashtable = {}
+        self.alia = alia
+        self._work()
+
+    def _work(self):
+        cfg = self.atom.registry["orbital"]["puzzles"][self.alia]
+        self.puzzle = pz.ClozePuzzle(text=cfg["content"], delimiter=cfg["delimiter"], min_denominator=cfg["min_denominator"])
+        self.puzzle.refresh()
+        self.ans = copy.copy(self.puzzle.answer)
+        random.shuffle(self.ans)
+
+    class RatingChanged(Message):
+        def __init__(self, atom: pt.Atom, rating: int, is_correct: bool) -> None:
+            self.atom = atom
+            self.rating = rating  # 评分
+            self.is_correct = is_correct  # 是否正确
+            super().__init__()
+
+    class InputChanged(Message):
+        """输入变化消息"""
+        def __init__(self, current_input: list, max_length: int) -> None:
+            self.current_input = current_input  # 当前输入
+            self.max_length = max_length  # 最大长度
+            self.progress = len(current_input) / max_length  # 进度
+            super().__init__()
+
+    def compose(self):
+        yield Label(self.puzzle.wording, id="sentence")
+        yield Label(f"当前输入: {self.inputlist}", id="inputpreview")
+        for i in self.ans:
+            self.hashtable[str(hash(i))] = i
+            yield Button(i, id=f"{hash(i)}")
+        yield Button("退格", id="delete")
+
+    def update_preview(self):
+        preview = self.query_one("#inputpreview")
+        preview.update(f"当前输入: {self.inputlist}") # type: ignore
+        
+        self.post_message(self.InputChanged(
+            current_input=self.inputlist.copy(),
+            max_length=len(self.puzzle.answer)
+        ))
+
+    def on_button_pressed(self, event: Button.Pressed) -> None:
+        button_id = event.button.id
+        
+        if button_id == "delete":
+            if len(self.inputlist) > 0:
+                self.inputlist.pop()
+                self.update_preview()
+        else:
+            answer_text = self.hashtable[button_id]
+            self.inputlist.append(answer_text)
+            self.update_preview()
+            
+            if len(self.inputlist) >= len(self.puzzle.answer):
+                is_correct = self.inputlist == self.puzzle.answer
+                rating = 4 if is_correct else 2
+
+                self.post_message(self.RatingChanged(
+                    atom=self.atom,
+                    rating=rating,
+                    is_correct=is_correct
+                ))
+                
+                if not is_correct:
+                    self.inputlist = []
+                    self.update_preview()

src/heurams/interface/widgets/finished.py

@@ -0,0 +1,12 @@
+from textual.widgets import (
+    Label,
+)
+from textual.widget import Widget
+
+class Finished(Widget):
+    def __init__(self, *children: Widget, alia = "", name: str | None = None, id: str | None = None, classes: str | None = None, disabled: bool = False, markup: bool = True) -> None:
+        self.alia = alia
+        super().__init__(*children, name=name, id=id, classes=classes, disabled=disabled, markup=markup)
+
+    def compose(self):
+        yield Label("本次记忆进程结束, 下次再会!", id="finished_msg")

src/heurams/interface/widgets/mcq_puzzle.py

@@ -0,0 +1,161 @@
+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
+from typing import Tuple, Dict
+import heurams.kernel.particles as pt
+import heurams.kernel.puzzles as pz
+from .base_puzzle_widget import BasePuzzleWidget
+import copy
+import random
+from textual.message import Message
+
+class MCQPuzzle(BasePuzzleWidget):
+    def __init__(self, *children: Widget, atom: pt.Atom, alia: str = "", name: str | None = None, id: str | None = None, classes: str | None = None, disabled: bool = False, markup: bool = True) -> None:
+        super().__init__(*children, atom=atom, name=name, id=id, classes=classes, disabled=disabled, markup=markup)
+        self.inputlist = []
+        self.alia = alia
+        self.hashtable = {}
+        self._work()
+
+    def _work(self):
+        cfg = self.atom.registry["orbital"]["puzzles"][self.alia]
+        self.puzzle = pz.MCQPuzzle(cfg["mapping"], cfg["jammer"], cfg["max_riddles_num"], cfg['prefix'])
+        self.puzzle.refresh()
+
+    class PuzzleCompleted(Message):
+        """选择题完成消息"""
+        def __init__(self, atom: pt.Atom, rating: int, is_correct: bool, user_answers: list, correct_answers: list) -> None:
+            self.atom = atom
+            self.rating = rating  # 评分
+            self.is_correct = is_correct  # 是否正确
+            self.user_answers = user_answers  # 用户答案
+            self.correct_answers = correct_answers  # 正确答案
+            super().__init__()
+
+    class InputChanged(Message):
+        """输入变化消息"""
+        def __init__(self, current_input: list, current_question: int, total_questions: int, current_question_text: str) -> None:
+            self.current_input = current_input  # 当前输入
+            self.current_question = current_question  # 当前题号
+            self.total_questions = total_questions  # 总题数
+            self.current_question_text = current_question_text  # 当前问题文本
+            self.progress = current_question / total_questions  # 进度
+            super().__init__()
+
+    class QuestionAdvanced(Message):
+        """题目切换消息"""
+        def __init__(self, question_index: int, question_text: str, options: list) -> None:
+            self.question_index = question_index  # 题目索引
+            self.question_text = question_text
+            self.options = options  # 选项列表
+            super().__init__()
+
+    def compose(self):
+        yield Label(self.atom[1].content.replace("/",""), id="sentence")
+        yield Label(self.puzzle.wording[len(self.inputlist)], id="puzzle")
+        yield Label(f"当前输入: {self.inputlist}", id="inputpreview")
+        
+        # 渲染当前问题的选项
+        current_options = self.puzzle.options[len(self.inputlist)]
+        for i in current_options:
+            self.hashtable[str(hash(i))] = i
+            yield Button(i, id=f"select{hash(i)}")
+        
+        yield Button("退格", id="delete")
+
+    def update_display(self):
+        # 更新预览标签
+        preview = self.query_one("#inputpreview")
+        preview.update(f"当前输入: {self.inputlist}") # type: ignore
+        
+        # 更新问题标签
+        puzzle_label = self.query_one("#puzzle")
+        current_question_index = len(self.inputlist)
+        if current_question_index < len(self.puzzle.wording):
+            puzzle_label.update(self.puzzle.wording[current_question_index]) # type: ignore
+        
+        # 发送输入变化消息
+        self.post_message(self.InputChanged(
+            current_input=self.inputlist.copy(),
+            current_question=current_question_index,
+            total_questions=len(self.puzzle.answer),
+            current_question_text=self.puzzle.wording[current_question_index] if current_question_index < len(self.puzzle.wording) else ""
+        ))
+        
+        # 如果还有下一题，发送题目切换消息
+        if current_question_index < len(self.puzzle.options):
+            self.post_message(self.QuestionAdvanced(
+                question_index=current_question_index,
+                question_text=self.puzzle.wording[current_question_index],
+                options=self.puzzle.options[current_question_index]
+            ))
+
+    def on_button_pressed(self, event: Button.Pressed) -> None:
+        """处理按钮点击事件"""
+        button_id = event.button.id
+        
+        if button_id == "delete":
+            # 退格处理
+            if len(self.inputlist) > 0:
+                self.inputlist.pop()
+                self.refresh_buttons()
+                self.update_display()
+        elif button_id.startswith("select"): # type: ignore
+            # 选项选择处理
+            answer_text = self.hashtable[button_id[6:]] # type: ignore
+            self.inputlist.append(answer_text)
+            
+            # 检查是否完成所有题目
+            if len(self.inputlist) >= len(self.puzzle.answer):
+                is_correct = self.inputlist == self.puzzle.answer
+                rating = 4 if is_correct else 2
+                
+                # 发送完成消息
+                self.post_message(self.PuzzleCompleted(
+                    atom=self.atom,
+                    rating=rating,
+                    is_correct=is_correct,
+                    user_answers=self.inputlist.copy(),
+                    correct_answers=self.puzzle.answer.copy()
+                ))
+                
+                # 重置输入（如果回答错误）
+                if not is_correct:
+                    self.inputlist = []
+                    self.refresh_buttons()
+                    self.update_display()
+            else:
+                # 进入下一题
+                self.refresh_buttons()
+                self.update_display()
+
+    def refresh_buttons(self):
+        """刷新按钮显示（用于题目切换）"""
+        # 移除所有选项按钮
+        buttons_to_remove = [child for child in self.children if hasattr(child, 'id') and child.id and child.id.startswith('select')]
+        for button in buttons_to_remove:
+            self.remove_child(button) # type: ignore
+        
+        # 添加当前题目的选项按钮
+        current_question_index = len(self.inputlist)
+        if current_question_index < len(self.puzzle.options):
+            current_options = self.puzzle.options[current_question_index]
+            for option in current_options:
+                button_id = f"select{hash(option)}"
+                if button_id not in self.hashtable:
+                    self.hashtable[button_id] = option
+                new_button = Button(option, id=button_id)
+                self.mount(new_button)

src/heurams/interface/widgets/placeholder.py

@@ -0,0 +1,14 @@
+from textual.widgets import (
+    Label,
+    Button,
+)
+from textual.widget import Widget
+
+
+class Placeholder(Widget):
+    def __init__(self, *children: Widget, name: str | None = None, alia: str = "", id: str | None = None, classes: str | None = None, disabled: bool = False, markup: bool = True) -> None:
+        super().__init__(*children, name=name, id=id, classes=classes, disabled=disabled, markup=markup)
+
+    def compose(self):
+        yield Label("示例标签", id="testlabel")
+        yield Button("示例按钮", id="testbtn", classes="choice")

src/heurams/interface/widgets/recognition.py

@@ -0,0 +1,87 @@
+from textual.widgets import (
+    Markdown,
+    Label,
+    Static,
+    Button,
+)
+from textual.containers import Center
+from textual.widget import Widget
+from typing import Dict
+import heurams.kernel.particles as pt
+import re
+from .base_puzzle_widget import BasePuzzleWidget
+from typing import TypedDict, List
+from textual.message import Message
+
+class RecognitionConfig(TypedDict):
+    __origin__: str
+    __hint__: str
+    primary: str
+    secondary: List[str]
+    top_dim: List[str]
+
+class Recognition(BasePuzzleWidget):
+    def __init__(self, *children: Widget, atom: pt.Atom, alia: str = "", name: str | None = None, id: str | None = None, classes: str | None = None, disabled: bool = False, markup: bool = True) -> None:
+        super().__init__(*children, atom=atom, name=name, id=id, classes=classes, disabled=disabled, markup=markup)
+        if alia == "":
+            alia = "Recognition"
+        self.alia = alia
+
+    class RatingChanged(Message):
+        """评分改变消息"""
+        def __init__(self, rating: int) -> None:
+            self.rating = rating
+            super().__init__()
+
+    def compose(self):
+        cfg: RecognitionConfig = self.atom.registry["orbital"]["puzzles"][self.alia]
+        delim = self.atom.registry['nucleon'].metadata["formation"]["delimiter"]
+        replace_dict = {
+            ", ": ",",
+            ". ": ".",
+            "; ": ";",
+            ": ": ":",
+            f"{delim},": ",",
+            f".{delim}": ".",
+            f"{delim};": ";",
+            f";{delim}": ";",
+            f":{delim}": ":",
+        }
+
+        nucleon = self.atom.registry['nucleon']
+        metadata = self.atom.registry['nucleon'].metadata
+        primary = cfg["primary"]
+
+        with Center():
+            yield Static(f"[dim]{cfg['top_dim']}[/]")
+            yield Label("")
+
+        for old, new in replace_dict.items():
+            primary = primary.replace(old, new)
+        primary_splited = re.split(r"(?<=[,;:|])", cfg['primary'])
+        for item in primary_splited:
+            with Center():
+                yield Label(
+                    f"[b][b]{item.replace(delim, ' ')}[/][/]",
+                    id="sentence" + str(hash(item)),
+                )
+
+        for item in cfg["secondary"]:
+            if isinstance(item, list):
+                for j in item:
+                    yield Markdown(f"### {metadata['annotation'][item]}: {j}")
+                    continue
+            if isinstance(item, Dict):
+                total = ""
+                for j, k in item.items(): # type: ignore
+                    total += f"> **{j}**: {k}  \n"
+                yield Markdown(total)
+            if isinstance(item, str):
+                yield Markdown(item)
+
+        with Center():
+            yield Button("我已知晓", id="ok")
+
+    def on_button_pressed(self, event: Button.Pressed) -> None:
+        if event.button.id == "ok":
+            self.post_message(self.RatingChanged(5))

src/heurams/kernel/README.md

@@ -0,0 +1,2 @@
+# Kernel - HeurAMS 核心
+记忆规划相关算法与数据结构, 可脱离业务层

src/heurams/kernel/algorithms/__init__.py

@@ -0,0 +1,10 @@
+from .sm2 import SM2Algorithm
+
+__all__ = [
+    'SM2Algorithm',
+]
+
+algorithms = {
+    "SM-2": SM2Algorithm,
+    "supermemo2": SM2Algorithm,
+}

src/heurams/kernel/algorithms/base.py

@@ -0,0 +1,45 @@
+import heurams.services.timer as timer
+from typing import TypedDict
+
+class BaseAlgorithm:
+    algo_name = "BaseAlgorithm"
+
+    class AlgodataDict(TypedDict):
+        efactor: float
+        real_rept: int  
+        rept: int
+        interval: int
+        last_date: int
+        next_date: int
+        is_activated: int
+        last_modify: float
+
+    defaults = {
+        'real_rept': 0,
+        'rept': 0,
+        'interval': 0,
+        'last_date': 0,
+        'next_date': 0,
+        'is_activated': 0,
+        'last_modify': timer.get_timestamp()
+    }
+    
+    @classmethod
+    def revisor(cls, algodata: dict, feedback: int = 5, is_new_activation: bool = False) -> None:
+        """迭代记忆数据"""
+        pass
+    
+    @classmethod
+    def is_due(cls, algodata) -> int:
+        """是否应该复习"""
+        return 1
+    
+    @classmethod
+    def rate(cls, algodata) -> str:
+        """获取评分信息"""
+        return ""
+    
+    @classmethod
+    def nextdate(cls, algodata) -> int:
+        """获取下一次记忆时间戳"""
+        return -1

src/heurams/kernel/algorithms/fsrs.py

@@ -0,0 +1 @@
+# FSRS 算法模块, 尚未就绪

src/heurams/kernel/algorithms/sm2.py

@@ -0,0 +1,81 @@
+from .base import BaseAlgorithm
+import heurams.services.timer as timer
+from typing import TypedDict
+
+class SM2Algorithm(BaseAlgorithm):
+    algo_name = "SM-2"
+
+    class AlgodataDict(TypedDict):
+        efactor: float
+        real_rept: int  
+        rept: int
+        interval: int
+        last_date: int
+        next_date: int
+        is_activated: int
+        last_modify: float
+
+    defaults = {
+        'efactor': 2.5,
+        'real_rept': 0,
+        'rept': 0,
+        'interval': 0,
+        'last_date': 0,
+        'next_date': 0,
+        'is_activated': 0,
+        'last_modify': timer.get_timestamp()
+    }
+    
+    @classmethod
+    def revisor(cls, algodata: dict, feedback: int = 5, is_new_activation: bool = False):
+        """SM-2 算法迭代决策机制实现
+            根据 quality(0 ~ 5) 进行参数迭代最佳间隔
+            quality 由主程序评估
+
+            Args:
+                quality (int): 记忆保留率量化参数
+        """
+        if feedback == -1:
+            return
+
+        algodata[cls.algo_name]['efactor'] = algodata[cls.algo_name]['efactor'] + (
+            0.1 - (5 - feedback) * (0.08 + (5 - feedback) * 0.02)
+        )
+        algodata[cls.algo_name]['efactor'] = max(1.3, algodata[cls.algo_name]['efactor'])
+
+        if feedback < 3:
+            algodata[cls.algo_name]['rept'] = 0
+            algodata[cls.algo_name]['interval'] = 0
+        else:
+            algodata[cls.algo_name]['rept'] += 1
+
+        algodata[cls.algo_name]['real_rept'] += 1
+
+        if is_new_activation:
+            algodata[cls.algo_name]['rept'] = 0
+            algodata[cls.algo_name]['efactor'] = 2.5
+
+        if algodata[cls.algo_name]['rept'] == 0:
+            algodata[cls.algo_name]['interval'] = 1
+        elif algodata[cls.algo_name]['rept'] == 1:
+            algodata[cls.algo_name]['interval'] = 6
+        else:
+            algodata[cls.algo_name]['interval'] = round(
+                algodata[cls.algo_name]['interval'] * algodata[cls.algo_name]['efactor']
+            )
+
+        algodata[cls.algo_name]['last_date'] = timer.get_daystamp()
+        algodata[cls.algo_name]['next_date'] = timer.get_daystamp() + algodata[cls.algo_name]['interval']
+        algodata[cls.algo_name]['last_modify'] = timer.get_timestamp()
+    
+    @classmethod
+    def is_due(cls, algodata):
+        return (algodata[cls.algo_name]['next_date'] <= timer.get_daystamp())    
+    
+    @classmethod
+    def rate(cls, algodata):
+        return str(algodata[cls.algo_name]['efactor'])    
+    
+    @classmethod
+    def nextdate(cls, algodata) -> int:
+        return algodata[cls.algo_name]['next_date']

src/heurams/kernel/particles/__init__.py

@@ -0,0 +1,24 @@
+"""
+Particle 模块 - 粒子对象系统
+
+提供闪卡所需对象, 使用物理学粒子的领域驱动设计
+"""
+
+from .electron import Electron
+from .nucleon import Nucleon
+from .orbital import Orbital
+from .atom import Atom, atom_registry
+from .probe import probe_all, probe_by_filename
+from .loader import load_nucleon, load_electron
+
+__all__ = [
+    "Electron",
+    "Nucleon",
+    "Orbital",
+    "Atom",
+    "probe_all",
+    "probe_by_filename",
+    "load_nucleon",
+    "load_electron",
+    "atom_registry",
+]

src/heurams/kernel/particles/atom.py

@@ -0,0 +1,128 @@
+from .electron import Electron
+from .nucleon import Nucleon
+from .orbital import Orbital
+from typing import TypedDict
+import pathlib
+import typing
+import toml
+import json
+import bidict
+from heurams.context import config_var
+
+class AtomRegister(TypedDict):
+    nucleon: Nucleon
+    nucleon_path: pathlib.Path
+    nucleon_fmt: str
+    electron: Electron
+    electron_path: pathlib.Path
+    electron_fmt: str
+    orbital: Orbital
+    orbital_path: pathlib.Path
+    orbital_fmt: str
+    runtime: dict
+
+class Atom():
+    """
+    统一处理一系列对象的所有信息与持久化:
+        关联电子 (算法数据)
+        关联核子 (内容数据)
+        关联轨道 (策略数据)
+        以及关联路径
+    """
+
+    def __init__(self, ident = ""):
+        self.ident = ident
+        atom_registry[ident] = self
+        # self.is_evaled = False
+        self.registry: AtomRegister = { # type: ignore
+            "nucleon": None,
+            "nucleon_path": None,
+            "nucleon_fmt": "toml",
+            "electron": None,
+            "electron_path": None,
+            "electron_fmt": "json",
+            "orbital": None,
+            "orbital_path": None, # 允许设置为 None, 此时使用 nucleon 文件内的推荐配置
+            "orbital_fmt": "toml",
+        }
+        self.do_eval()
+
+    def link(self, key, value):
+        if key in self.registry.keys():
+            self.registry[key] = value
+            self.do_eval()
+        else:
+            raise ValueError("不受支持的原子元数据链接操作")
+    
+    def do_eval(self):
+        """
+        执行并以结果替换当前单元的所有 eval 语句
+        TODO: 带有限制的 eval, 异步/多线程执行避免堵塞
+        """
+        # eval 环境设置
+        def eval_with_env(s: str):
+            try:
+                nucleon = self.registry['nucleon']
+                default = config_var.get()["puzzles"]
+                metadata = nucleon.metadata
+            except:
+                ret = "尚未链接对象"
+            try:
+                ret = str(eval(s))
+            except Exception as e:
+                ret = f"此 eval 实例发生错误: {e}"
+            return ret
+        
+        def traverse(data, modifier):
+            if isinstance(data, dict):
+                for key, value in data.items():
+                    data[key] = traverse(value, modifier)
+                return data
+            elif isinstance(data, list):
+                for i, item in enumerate(data):
+                    data[i] = traverse(item, modifier)
+                return data
+            elif isinstance(data, tuple):
+                return tuple(traverse(item, modifier) for item in data)
+            else:
+                if isinstance(data, str):
+                    if data.startswith("eval:"):
+                        return modifier(data[5:])
+                return data
+        
+        traverse(self.registry["nucleon"], eval_with_env)
+        traverse(self.registry["orbital"], eval_with_env)
+        
+
+    def persist(self, key):
+        path: pathlib.Path | None = self.registry[key + "_path"]
+        if isinstance(path, pathlib.Path):
+            path = typing.cast(pathlib.Path, path)
+            path.parent.mkdir(parents=True, exist_ok=True)
+            if self.registry[key + "_fmt"] == "toml":
+                with open(path, "w") as f:
+                    toml.dump(self.registry[key], f)
+            elif self.registry[key + "_fmt"] == "json":
+                with open(path, "w") as f:
+                    json.dump(self.registry[key], f)
+            else:
+                raise KeyError("不受支持的持久化格式")
+        else:
+            raise TypeError("对未初始化的路径对象操作")
+        
+    def __getitem__(self, key):
+        if key in self.registry:
+            return self.registry[key]
+        raise KeyError(f"不支持的键: {key}")
+
+    def __setitem__(self, key, value):
+        if key in self.registry:
+            self.registry[key] = value
+        else:
+            raise KeyError(f"不支持的键: {key}")
+
+    @staticmethod
+    def placeholder():
+        return (Electron.placeholder(), Nucleon.placeholder(), {})
+    
+atom_registry: bidict.bidict[str, Atom] = bidict.bidict()

src/heurams/kernel/particles/electron.py

@@ -0,0 +1,105 @@
+import heurams.services.timer as timer
+from heurams.context import config_var
+from heurams.kernel.algorithms import algorithms
+
+class Electron:
+    """电子: 记忆分析元数据及算法"""
+
+    def __init__(self, ident: str, algodata: dict = {}, algo_name: str = "supermemo2"):
+        """初始化电子对象 (记忆数据)
+    
+        Args:
+            ident: 算法的唯一标识符, 用于区分不同的算法实例, 使用 algodata[ident] 获取
+            algodata: 算法数据字典, 包含算法的各项参数和设置
+            algo: 使用的算法模块标识
+        """
+        self.algodata = algodata
+        self.ident = ident
+        self.algo = algorithms[algo_name]
+
+        if self.algo not in self.algodata.keys():
+            self.algodata[self.algo] = {}
+        if not self.algodata[self.algo]:
+            self._default_init(self.algo.defaults)
+
+    def _default_init(self, defaults: dict):
+        """默认初始化包装"""
+        self.algodata[self.algo] = defaults.copy()
+
+    def activate(self):
+        """激活此电子"""
+        self.algodata[self.algo]['is_activated'] = 1
+        self.algodata[self.algo]['last_modify'] = timer.get_timestamp()
+
+    def modify(self, var: str, value):
+        """修改 algodata[algo] 中子字典数据"""
+        if var in self.algodata[self.algo]:
+            self.algodata[self.algo][var] = value
+            self.algodata[self.algo]['last_modify'] = timer.get_timestamp()
+        else:
+            print(f"警告: '{var}' 非已知元数据字段")
+
+    def is_due(self):
+        """是否应该复习"""
+        return self.algo.is_due(self.algodata)
+    
+    def is_activated(self):
+        return self.algodata[self.algo]['is_activated']
+    
+    def rate(self):
+        "评价"
+        return self.algo.rate(self.algodata)
+    
+    def nextdate(self) -> int:
+        return self.algo.nextdate(self.algodata)
+
+    def revisor(self, quality: int = 5, is_new_activation: bool = False):
+        """算法迭代决策机制实现
+        
+        Args:
+            quality (int): 记忆保留率量化参数 (0-5)
+            is_new_activation (bool): 是否为初次激活
+        """
+        self.algo.revisor(self.algodata, quality, is_new_activation)
+
+    def __str__(self):
+        return (
+            f"记忆单元预览 \n"
+            f"标识符: '{self.ident}' \n"
+            f"算法: {self.algo} \n"
+            f"易度系数: {self.algodata[self.algo]['efactor']:.2f} \n"
+            f"已经重复的次数: {self.algodata[self.algo]['rept']} \n"
+            f"下次间隔: {self.algodata[self.algo]['interval']} 天 \n"
+            f"下次复习日期时间戳: {self.algodata[self.algo]['next_date']}"
+        )
+
+    def __eq__(self, other):
+        if self.ident == other.ident:
+            return True
+        return False
+
+    def __hash__(self):
+        return hash(self.ident)
+
+    def __getitem__(self, key):
+        if key == "ident":
+            return self.ident
+        if key in self.algodata[self.algo]:
+            return self.algodata[self.algo][key]
+        else:
+            raise KeyError(f"键 '{key}' 未在 algodata[self.algo] 中")
+
+    def __setitem__(self, key, value):
+        if key == "ident":
+            raise AttributeError("ident 应为只读")
+        self.algodata[self.algo][key] = value
+        self.algodata[self.algo]['last_modify'] = timer.get_timestamp()
+
+    def __len__(self):
+        """仅返回当前算法的配置数量"""
+        return len(self.algodata[self.algo])
+
+    @staticmethod
+    def placeholder():
+        """生成一个电子占位符"""
+        return Electron("电子对象样例内容", {})

src/heurams/kernel/particles/loader.py

@@ -0,0 +1,50 @@
+from .nucleon import Nucleon
+from .electron import Electron
+import heurams.services.hasher as hasher
+import pathlib
+import toml
+import json
+
+def load_nucleon(path: pathlib.Path, fmt = "toml"):
+    with open(path, "r") as f:
+        dictdata = dict()
+        dictdata = toml.load(f) # type: ignore
+        lst = list()
+        nested_data = dict()
+        # 修正 toml 解析器的不管嵌套行为
+        for key, value in dictdata.items():
+            if "__metadata__" in key: # 以免影响句号
+                if '.' in key:
+                    parts = key.split('.')
+                    current = nested_data
+                    for part in parts[:-1]:
+                        if part not in current:
+                            current[part] = {}
+                        current = current[part]
+                    current[parts[-1]] = value
+            else:
+                nested_data[key] = value
+        # print(nested_data)
+        for item, attr in nested_data.items():
+            if item == "__metadata__":
+                continue
+            lst.append((Nucleon(hasher.hash(item), attr, nested_data['__metadata__']), nested_data["__metadata__"]["orbital"]))
+        return lst
+
+def load_electron(path: pathlib.Path, fmt = "json") -> dict:
+    """从文件路径加载电子对象
+
+    Args:
+        path (pathlib.Path): 路径
+        fmt (str): 文件格式(可选, 默认 json)
+    
+    Returns:
+        dict: 键名是电子对象名称, 值是电子对象
+    """
+    with open(path, "r") as f:
+        dictdata = dict()
+        dictdata = json.load(f) # type: ignore
+        dic = dict()
+        for item, attr in dictdata.items():
+            dic[item] = (Electron(hasher.hash(item), attr))
+        return dic

src/heurams/kernel/particles/nucleon.py

@@ -0,0 +1,36 @@
+class Nucleon:
+    """原子核: 材料元数据"""
+
+    def __init__(self, ident: str, payload: dict, metadata: dict = {}):
+        """初始化原子核 (记忆内容)
+
+        Args:
+            ident: 唯一标识符
+            payload: 记忆内容信息
+            metadata: 可选元数据信息
+        """
+        self.metadata = metadata
+        self.payload = payload
+        self.ident = ident
+
+    def __getitem__(self, key):
+        if key == "ident":
+            return self.ident
+        if key in self.payload:
+            return self.payload[key]
+        else:
+            raise KeyError(f"Key '{key}' not found in payload.")
+
+    def __iter__(self):
+        yield from self.payload.keys()
+
+    def __len__(self):
+        return len(self.payload)
+
+    def __hash__(self):
+        return hash(self.ident)
+
+    @staticmethod
+    def placeholder():
+        """生成一个占位原子核"""
+        return Nucleon("核子对象样例内容", {})

src/heurams/kernel/particles/orbital.py

@@ -0,0 +1,23 @@
+from typing import TypedDict
+
+class OrbitalSchedule(TypedDict):
+    quick_review: list
+    recognition: list
+    final_review: list
+
+class Orbital(TypedDict):
+    schedule: OrbitalSchedule
+    puzzles: dict
+    
+
+"""一份示例
+["__metadata__.orbital.puzzles"] # 谜题定义
+"Recognition" = { __origin__ = "recognition", __hint__ = "", primary = "eval:nucleon['content']", secondery = ["eval:nucleon['keyword_note']", "eval:nucleon['note']"], top_dim = ["eval:nucleon['translation']"] }
+"SelectMeaning" = { __origin__ = "mcq", __hint__ = "eval:nucleon['content']", jammer = "eval:nucleon['keyword_note']", max_riddles_num = "eval:default['mcq']['max_riddles_num']", prefix = "选择正确项: " }
+"FillBlank" = { __origin__ = "cloze", __hint__ = "", text = "eval:nucleon['content']", delimiter = "eval:metadata['formation']['delimiter']", min_denominator = "eval:default['cloze']['min_denominator']"}
+
+["__metadata__.orbital.schedule"] # 内置的推荐学习方案
+quick_review = [["FillBlank", "1.0"], ["SelectMeaning", "0.5"], ["recognition", "1.0"]]
+recognition = [["recognition", "1.0"]]
+final_review = [["FillBlank", "0.7"], ["SelectMeaning", "0.7"], ["recognition", "1.0"]]
+"""

src/heurams/kernel/particles/probe.py

@@ -0,0 +1,41 @@
+from heurams.context import config_var
+import pathlib
+
+def probe_by_filename(filename):
+    """探测指定文件 (无扩展名) 的所有信息"""
+    paths: dict = config_var.get().get("paths")
+    formats = ["toml", "json"]
+    result = {}
+    for item, attr in paths.items():
+        for i in formats:
+            attr: pathlib.Path = pathlib.Path(attr) / filename + '.' + i
+            if attr.exists():
+                result[item.replace("_dir", "")] = str(attr)
+    return result
+
+def probe_all(is_stem = 1):
+    """依据目录探测所有信息
+    
+    Args:
+        is_stem (boolean): 是否**删除**文件扩展名
+    
+    Returns:
+        dict: 有三项, 每一项的键名都是文件组类型, 值都是文件组列表, 只包含文件名
+    """
+    paths: dict = config_var.get().get("paths")
+    result = {}
+    for item, attr in paths.items():
+        attr: pathlib.Path = pathlib.Path(attr)
+        result[item.replace("_dir", "")] = list()
+        for i in attr.iterdir():
+            if not i.is_dir():
+                if is_stem:
+                    result[item.replace("_dir", "")].append(str(i.stem))
+                else:
+                    result[item.replace("_dir", "")].append(str(i.name))
+    return result
+
+if __name__ == "__main__":
+    import os
+    print(os.getcwd())
+    print(probe_all())

src/heurams/kernel/puzzles/__init__.py

@@ -0,0 +1,55 @@
+"""
+Puzzle 模块 - 谜题生成系统
+
+提供多种类型的谜题生成器，支持从字符串、字典等数据源导入题目
+"""
+
+from .base import BasePuzzle
+from .cloze import ClozePuzzle
+from .mcq import MCQPuzzle
+from .recognition import RecognitionPuzzle
+
+__all__ = [
+    'BasePuzzle',
+    'ClozePuzzle',
+    'MCQPuzzle',
+    'RecognitionPuzzle',
+]
+
+puzzles = {
+    "mcq": MCQPuzzle,
+    "cloze": ClozePuzzle,
+    "recognition": RecognitionPuzzle,
+    "base": BasePuzzle,
+}
+
+@staticmethod
+def create_by_dict(config_dict: dict) -> BasePuzzle:
+    """
+    根据配置字典创建谜题
+
+    Args:
+        config_dict: 配置字典，包含谜题类型和参数
+
+    Returns:
+        BasePuzzle: 谜题实例
+
+    Raises:
+        ValueError: 当配置无效时抛出
+    """
+    puzzle_type = config_dict.get('type')
+
+    if puzzle_type == 'cloze':
+        return puzzles["cloze"](
+            text=config_dict['text'],
+            min_denominator=config_dict.get('min_denominator', 7)
+        )
+    elif puzzle_type == 'mcq':
+        return puzzles["mcq"](
+            mapping=config_dict['mapping'],
+            jammer=config_dict.get('jammer', []),
+            max_riddles_num=config_dict.get('max_riddles_num', 2),
+            prefix=config_dict.get('prefix', '')
+        )
+    else:
+        raise ValueError(f"未知的谜题类型: {puzzle_type}")

src/heurams/kernel/puzzles/base.py

@@ -0,0 +1,9 @@
+# base.py
+class BasePuzzle:
+    """谜题基类"""
+    
+    def refresh(self):
+        raise NotImplementedError("谜题对象未实现 refresh 方法")
+    
+    def __str__(self):
+        return f"谜题: {type(self).__name__}"

src/heurams/kernel/puzzles/cloze.py

@@ -1,24 +1,27 @@
+from .base import BasePuzzle
 import random
 
-class BlankPuzzle():
+class ClozePuzzle(BasePuzzle):
     """填空题谜题生成器
     
     Args:
-        text: 原始字符串(需要 "/" 分割句子, 末尾应有 "/")
+        text: 原始字符串(需要 delimiter 分割句子, 末尾应有 delimiter)
         min_denominator: 最小概率倒数(如占所有可生成填空数的 1/7 中的 7, 若期望值小于 1, 则取 1)
     """
-    def __init__(self, text, min_denominator):
+
+    def __init__(self, text: str, min_denominator: int, delimiter: str = "/"):
         self.text = text
         self.min_denominator = min_denominator
         self.wording = "填空题 - 尚未刷新谜题"
         self.answer = ["填空题 - 尚未刷新谜题"]
+        self.delimiter = delimiter
 
-    def refresh(self): # 刷新谜题
+    def refresh(self):  # 刷新谜题
         placeholder = "___SLASH___"
-        tmp_text = self.text.replace("/", placeholder)
+        tmp_text = self.text.replace(self.delimiter, placeholder)
         words = tmp_text.split(placeholder)
         if not words:
-            return ""
+            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)
@@ -28,18 +31,8 @@ class BlankPuzzle():
         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)
+        self.wording = "".join(blanked_words)
 
     def __str__(self):
         return f"{self.wording}\n{str(self.answer)}"
-
-# demo
-text = """我联合国人民/同兹/决心/: /欲免/后世/再遭/今代人类/两度/身历/惨不堪言/之战祸/.../"""
-riddle = BlankPuzzle(text, 3)
-print(riddle)
-riddle.refresh()
-print(riddle)

src/heurams/kernel/puzzles/mcq.py

@@ -1,56 +1,9 @@
-#!/usr/bin/env python3
+# mcq.py
+from .base import BasePuzzle
 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: 问题前缀
-    """
+class MCQPuzzle(BasePuzzle):
+    """选择题谜题生成器"""
     
     def __init__(
         self,
@@ -108,15 +61,3 @@ class SelectionPuzzle(BasePuzzle):
 
     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)

src/heurams/kernel/puzzles/recognition.py

@@ -0,0 +1,12 @@
+# mcq.py
+from .base import BasePuzzle
+import random
+
+class RecognitionPuzzle(BasePuzzle):
+    """识别占位符"""
+    
+    def __init__(self) -> None:
+        super().__init__()
+        
+    def refresh(self):
+        pass

src/heurams/kernel/reactor/__init__.py

@@ -0,0 +1,12 @@
+from .states import PhaserState, ProcessionState
+from .procession import Procession
+from .fission import Fission
+from .phaser import Phaser
+
+__all__ = [
+    "PhaserState",
+    "ProcessionState",
+    "Procession",
+    "Fission",
+    "Phaser"
+]

src/heurams/kernel/reactor/fission.py

@@ -0,0 +1,29 @@
+import heurams.kernel.particles as pt
+import heurams.kernel.puzzles as puz
+import random
+from .states import PhaserState
+
+class Fission():
+    """裂变器: 单原子调度展开器"""
+    def __init__(self, atom: pt.Atom, phase = PhaserState.RECOGNITION):
+        self.atom = atom
+        self.orbital_schedule = atom.registry["orbital"]["schedule"][phase.value] # type: ignore
+        self.orbital_puzzles =  atom.registry["orbital"]["puzzles"]
+        #print(self.orbital_schedule)
+        self.puzzles = list()
+        for item, possibility in self.orbital_schedule: # type: ignore
+            if not isinstance(possibility, float):
+                possibility = float(possibility)
+            while possibility > 1:
+                self.puzzles.append({
+                    "puzzle": puz.puzzles[self.orbital_puzzles[item]["__origin__"]],
+                    "alia": item
+                })
+                possibility -= 1
+            if random.random() <= possibility:
+                self.puzzles.append({
+                    "puzzle": puz.puzzles[self.orbital_puzzles[item]["__origin__"]],
+                    "alia": item
+                })
+    def generate(self):
+        yield from self.puzzles

src/heurams/kernel/reactor/phaser.py

@@ -0,0 +1,32 @@
+# 移相器类定义
+
+import heurams.kernel.particles as pt
+from .states import PhaserState, ProcessionState
+from .procession import Procession
+
+class Phaser():
+    """移相器: 全局调度阶段管理器"""
+    def __init__(self, atoms: list[pt.Atom]) -> None:
+        new_atoms = list()
+        old_atoms = list()
+        self.state = PhaserState.UNSURE
+        for i in atoms:
+            if not i.registry["electron"].is_activated():
+                new_atoms.append(i)
+            else:
+                old_atoms.append(i)
+        self.processions = list()
+        if len(old_atoms):
+            self.processions.append(Procession(old_atoms, PhaserState.QUICK_REVIEW, "初始复习"))
+        if len(new_atoms):
+            self.processions.append(Procession(new_atoms,PhaserState.RECOGNITION, "新记忆"))
+        self.processions.append(Procession(atoms,PhaserState.FINAL_REVIEW, "总体复习"))
+
+    def current_procession(self):
+        for i in self.processions:
+            i: Procession
+            if not i.state == ProcessionState.FINISHED:
+                self.state = i.phase
+                return i
+        self.state = PhaserState.FINISHED
+        return 0

src/heurams/kernel/reactor/procession.py

@@ -0,0 +1,44 @@
+import heurams.kernel.particles as pt
+from .states import PhaserState, ProcessionState
+
+class Procession():
+    """队列: 标识单次记忆流程"""
+    def __init__(self, atoms: list, phase: PhaserState, name: str = ""):
+        self.atoms = atoms
+        self.queue = atoms.copy()
+        self.current_atom = atoms[0]
+        self.cursor = 0
+        self.name = name
+        self.phase = phase
+        self.state: ProcessionState = ProcessionState.RUNNING
+
+    def forward(self, step = 1):
+        self.cursor += step
+        if self.cursor == len(self.queue):
+            self.state = ProcessionState.FINISHED
+        else:
+            self.state = ProcessionState.RUNNING
+        try:
+            self.current_atom = self.queue[self.cursor]
+            return 1 # 成功
+        except IndexError as e:
+            print(f"{e}")
+            return 0
+
+    def append(self, atom = None):
+        if atom == None:
+            atom = self.current_atom
+        if self.queue[len(self.queue) - 1] != atom or len(self) <= 1:
+                self.queue.append(atom)
+
+    def __len__(self):
+        return (len(self.queue) - self.cursor)
+    
+    def process(self):
+        return (self.cursor)
+    
+    def total_length(self):
+        return len(self.queue)
+
+    def is_empty(self):
+        return len(self.queue)

src/heurams/kernel/reactor/states.py

@@ -0,0 +1,12 @@
+from enum import Enum, auto
+
+class PhaserState(Enum):
+    UNSURE = "unsure"
+    QUICK_REVIEW = "quick_review"
+    RECOGNITION = "recognition"
+    FINAL_REVIEW = "final_review"
+    FINISHED = "finished"
+
+class ProcessionState(Enum):
+    RUNNING = auto()
+    FINISHED = auto()

src/heurams/providers/README.md

@@ -0,0 +1,2 @@
+# Provider - 提供者
+底层相关与第三方 API 接口包装

src/heurams/providers/audio/__init__.py

@@ -0,0 +1,10 @@
+# 音频播放器, 必须基于文件操作
+from .termux_audio import player as termux_player
+
+__all__ = [
+    "termux_player"
+]
+
+players = {
+    "termux": termux_player
+}

src/heurams/providers/audio/system_audio.py

@@ -0,0 +1,4 @@
+""" 通用音频适配器
+基于 playsound 库的音频播放器, 在绝大多数 python 环境上提供音频服务
+注意: 在未配置 pulseaudio 的 termux 不可用
+"""

src/heurams/providers/audio/termux_audio.py

@@ -0,0 +1,10 @@
+""" Termux 音频适配
+适配 Termux 的 play-audio 命令, 以在 android 上提供可用的播放体验
+无需配置 pulseaudio
+"""
+
+import os
+import pathlib
+
+def player(path: pathlib.Path):
+    os.system(f"play-audio {path}")

src/heurams/providers/llm/__init__.py

@@ -0,0 +1 @@
+# 大语言模型

src/heurams/providers/tts/__init__.py

@@ -0,0 +1,12 @@
+from .base import BaseTTS
+from .edge_tts import EdgeTTS
+
+__all__ = [
+    "BaseTTS",
+    "EdgeTTS",
+]
+
+TTSs = {
+    "BaseTTS": BaseTTS,
+    "EdgeTTS": EdgeTTS, 
+}

src/heurams/providers/tts/base.py

@@ -0,0 +1,9 @@
+import pathlib
+
+class BaseTTS:
+    name = "BaseTTS"
+    
+    @classmethod
+    def convert(cls, text: str, path: pathlib.Path | str = "") -> pathlib.Path:
+        """path 是可选参数, 不填则自动返回生成文件路径"""
+        return path # type: ignore

src/heurams/providers/tts/edge_tts.py

@@ -0,0 +1,15 @@
+from .base import BaseTTS
+import pathlib
+import edge_tts
+
+class EdgeTTS(BaseTTS):
+    name = "EdgeTTS"
+
+    @classmethod
+    def convert(cls, text, path: pathlib.Path | str = "") -> pathlib.Path:
+        communicate = edge_tts.Communicate(
+            text,
+            "zh-CN-YunjianNeural",
+        )
+        communicate.save_sync(str(path))
+        return path # type: ignore

src/heurams/services/README.md

@@ -0,0 +1,2 @@
+# Services - 服务
+基础服务相关代码

src/heurams/services/audio_service.py

@@ -0,0 +1,6 @@
+# 音频服务
+from heurams.context import config_var
+from heurams.providers.audio import players
+from typing import Callable
+
+player: Callable = players[config_var.get().get("player_provider")]

src/heurams/services/config.py

@@ -0,0 +1,47 @@
+# 配置文件服务
+import pathlib
+import toml
+import typing
+
+class ConfigFile:
+    def __init__(self, path: pathlib.Path):
+        self.path = path
+        if not self.path.exists():
+            self.path.touch()
+        self.data = dict()
+        self._load()
+
+    def _load(self):
+        """从文件加载配置数据"""
+        with open(self.path, 'r') as f:
+            try:
+                self.data = toml.load(f)
+            except toml.TomlDecodeError as e:
+                print(f"{e}")
+                self.data = {}
+
+    def modify(self, key: str, value: typing.Any):
+        """修改配置值并保存"""
+        self.data[key] = value
+        self.save()
+
+    def save(self, path: typing.Union[str, pathlib.Path] = ""):
+        """保存配置到文件"""
+        save_path = pathlib.Path(path) if path else self.path
+        with open(save_path, 'w') as f:
+            toml.dump(self.data, f)
+
+    def get(self, key: str, default: typing.Any = None) -> typing.Any:
+        """获取配置值，如果不存在返回默认值"""
+        return self.data.get(key, default)
+    
+    def __getitem__(self, key: str) -> typing.Any:
+        return self.data[key]
+    
+    def __setitem__(self, key: str, value: typing.Any):
+        self.data[key] = value
+        self.save()
+    
+    def __contains__(self, key: str) -> bool:
+        """支持 in 语法"""
+        return key in self.data

src/heurams/services/hasher.py

@@ -0,0 +1,8 @@
+# 哈希服务
+import hashlib
+
+def get_md5(text):
+    return hashlib.md5(text.encode('utf-8')).hexdigest()
+
+def hash(text):
+    return hashlib.md5(text.encode('utf-8')).hexdigest()

src/heurams/services/timer.py

@@ -0,0 +1,20 @@
+# 时间服务
+from heurams.context import config_var
+import time
+
+def get_daystamp() -> int:
+    """获取当前日戳(以天为单位的整数时间戳)"""
+    time_override = config_var.get().get("daystamp_override", -1)
+    if time_override != -1:
+        return int(time_override)
+    
+    return int((time.time() + config_var.get().get("timezone_offset")) // (24 * 3600))
+
+def get_timestamp() -> float:
+    """获取 UNIX 时间戳"""
+    # 搞这个类的原因是要支持可复现操作
+    time_override = config_var.get().get("timestamp_override", -1)
+    if time_override != -1:
+        return float(time_override)
+    
+    return time.time()

src/heurams/services/tts_service.py

@@ -0,0 +1,6 @@
+# 文本转语音服务
+from heurams.context import config_var
+from heurams.providers.tts import TTSs
+from typing import Callable
+
+convert: Callable = TTSs[config_var.get().get("tts_provider")]

src/heurams/services/version.py

@@ -0,0 +1,5 @@
+# 版本控制集成服务
+
+ver = "0.4.0"
+stage = "prototype"
+codename = "fledge" # 雏鸟, 0.4.x 版本

src/heurams/utils/README.md

@@ -0,0 +1,2 @@
+# Utils - 实用工具
+脚本与部分分离式工具函数

styles.css

@@ -1,62 +0,0 @@
-Screen {
-    align: center bottom;
-    
-}
-
-#main_container {
-    align: center middle;
-    width: 95%;
-    height: auto;
-    border: thick $primary-lighten-2;
-    padding: 1;
-}
-
-#vice_container {
-    align: center middle;
-    width: 100%;
-    height: auto;
-    padding: 1;
-}
-
-#sentence {
-    content-align: center middle;
-    width: 100%;
-    height: 5;
-    margin-bottom: 2;
-    text-style: bold;
-}
-
-#progress {
-    width: 100%;
-    content-align: center middle;
-    margin-bottom: 1;
-    color: $text-muted;
-}
-
-
-
-Button {
-    align-horizontal: center;
-    width: 50%;
-    margin: 0 0;
-}
-.choice {
-    align-horizontal: center;
-    width: 50%;
-    margin: 0 0;
-    height: auto;
-}
-/* no_margin.tcss */
-
-#button_container {
-    align-horizontal: center;
-    height: 9;
-}
-
-/* 选中 #button_container 下所有的 Horizontal 子元素 */
-#button_container > Horizontal {
-    margin-top: 0;
-    margin-bottom: 0;
-    align-horizontal: center;
-    width: 40%;
-}

sync_t.py

@@ -1 +0,0 @@
-# 同步工具 原型

testfield/selection_maker.py

@@ -1,45 +0,0 @@
-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)

tests/README.md

@@ -0,0 +1,175 @@
+# HeurAMS Test Suite
+
+This directory contains comprehensive unit tests and examples for the Heuristic Assisted Memory Scheduler (HeurAMS) system.
+
+## Test Structure
+
+### Unit Tests
+
+- **`test_particles.py`** - Tests for core particle modules:
+  - `Atom` - Data container management
+  - `Electron` - Memory algorithm metadata and SM-2 implementation
+  - `Nucleon` - Content data management
+  - `Orbital` - Learning strategy configuration
+  - `Probe` - File detection and cloze deletion scanning
+  - `Loader` - Data loading and saving
+
+- **`test_algorithms.py`** - Tests for algorithm modules:
+  - `BaseAlgorithm` - Abstract algorithm base class
+  - `SM2Algorithm` - SuperMemo-2 interval repetition algorithm
+
+- **`test_puzzles.py`** - Tests for puzzle generation modules:
+  - `BasePuzzle` - Abstract puzzle base class
+  - `ClozePuzzle` - Cloze deletion puzzle generator
+  - `MCQPuzzle` - Multiple choice question generator
+
+- **`test_reactor.py`** - Tests for reactor system modules:
+  - `Phaser` - Global scheduling state management
+  - `Procession` - Memory process queue management
+  - `Fission` - Single atom scheduling and puzzle generation
+  - `States` - State enumeration definitions
+
+- **`test_services.py`** - Tests for service modules:
+  - `Config` - Configuration management
+  - `Hasher` - Hash computation utilities
+  - `Timer` - Time services with override capability
+  - `Version` - Version information management
+  - `AudioService` - Audio feedback service
+  - `TTSService` - Text-to-speech service
+
+### Examples
+
+- **`examples.py`** - Comprehensive usage examples demonstrating:
+  - Basic atom creation and management
+  - Algorithm usage and review processing
+  - Puzzle generation for different content types
+  - Reactor system workflows
+  - Service integration patterns
+  - File operations and data persistence
+
+### Test Utilities
+
+- **`conftest.py`** - Pytest configuration and fixtures:
+  - `temp_config_file` - Temporary configuration file
+  - `sample_atom_data` - Sample atom data for testing
+  - `sample_markdown_content` - Sample markdown with cloze deletions
+
+- **`run_tests.py`** - Test runner with flexible options
+
+## Running Tests
+
+### Run All Tests
+```bash
+python tests/run_tests.py
+# or
+python -m pytest tests/
+```
+
+### Run Specific Tests
+```bash
+# Run specific test file
+python tests/run_tests.py --file test_particles.py
+
+# Run specific test class
+python tests/run_tests.py --file test_particles.py --class TestAtom
+
+# Run specific test method
+python tests/run_tests.py --file test_particles.py --class TestAtom --method test_atom_creation
+```
+
+### Run Examples
+```bash
+python tests/run_tests.py --examples
+```
+
+### Using Pytest Directly
+```bash
+# Run all tests with coverage
+pytest tests/ --cov=src.heurams --cov-report=html
+
+# Run tests with specific markers
+pytest tests/ -m "not slow"
+
+# Run tests with verbose output
+pytest tests/ -v
+```
+
+## Test Coverage
+
+The test suite provides comprehensive coverage for:
+
+- **Core Data Structures**: Atom, Electron, Nucleon, Orbital
+- **Algorithms**: SM-2 interval repetition implementation
+- **Puzzle Generation**: Cloze deletions and multiple choice questions
+- **State Management**: Reactor system state transitions
+- **Configuration**: Settings management and validation
+- **Utilities**: Hashing, timing, and file operations
+
+## Key Test Scenarios
+
+### Algorithm Testing
+- SM-2 interval calculation in learning phase
+- Ease factor adjustments based on review quality
+- Repetition counting and reset logic
+- Boundary conditions and edge cases
+
+### Puzzle Generation
+- Cloze deletion detection and processing
+- Multiple choice question generation with distractors
+- Content type detection and appropriate puzzle selection
+
+### Reactor System
+- State transitions (IDLE → LEARNING → REVIEW → FINISHED)
+- Procession queue management
+- Fission workflow for single atom processing
+
+### Service Integration
+- Configuration loading and validation
+- Time service with override capability
+- Hash consistency and file operations
+
+## Fixtures and Test Data
+
+The test suite includes reusable fixtures for:
+
+- Temporary configuration files
+- Sample atom data structures
+- Test markdown content with cloze deletions
+- Mock time values for testing scheduling
+
+## Example Usage Patterns
+
+The `examples.py` file demonstrates common usage patterns:
+
+1. **Basic Atom Creation** - Creating simple question-answer pairs
+2. **Cloze Content** - Working with cloze deletion content
+3. **Algorithm Integration** - Processing reviews with SM-2
+4. **Puzzle Generation** - Creating different puzzle types
+5. **Workflow Management** - Using the reactor system
+6. **Configuration** - Customizing learning parameters
+7. **Data Persistence** - Saving and loading atom collections
+
+## Test Dependencies
+
+- `pytest` - Test framework
+- `pytest-cov` - Coverage reporting (optional)
+- Standard Python libraries only
+
+## Adding New Tests
+
+When adding new tests:
+
+1. Follow the existing naming conventions
+2. Use the provided fixtures when appropriate
+3. Include both positive and negative test cases
+4. Test boundary conditions and edge cases
+5. Ensure tests are independent and repeatable
+
+## Continuous Integration
+
+The test suite is designed to run in CI environments and provides:
+
+- Fast execution (most tests complete in seconds)
+- No external dependencies
+- Clear failure reporting
+- Comprehensive coverage of core functionality

tests/__init__.py

@@ -0,0 +1,5 @@
+"""
+HeurAMS Test Suite
+
+Unit tests and examples for the Heuristic Assisted Memory Scheduler system.
+"""

tests/conftest.py

@@ -0,0 +1,63 @@
+"""
+Test configuration and fixtures for HeurAMS tests.
+"""
+import pytest
+import tempfile
+import os
+from pathlib import Path
+
+
+@pytest.fixture
+def temp_config_file():
+    """Create a temporary config file for testing."""
+    with tempfile.NamedTemporaryFile(mode='w', suffix='.json', delete=False) as f:
+        f.write('''{
+    "algorithm": "sm2",
+    "default_ease": 2.5,
+    "learning_steps": [1, 10],
+    "graduating_interval": 1,
+    "easy_interval": 4
+}''')
+        temp_path = f.name
+
+    yield temp_path
+
+    # Cleanup
+    if os.path.exists(temp_path):
+        os.unlink(temp_path)
+
+
+@pytest.fixture
+def sample_atom_data():
+    """Sample atom data for testing."""
+    return {
+        "nucleon": {
+            "content": "What is the capital of France?",
+            "answer": "Paris"
+        },
+        "electron": {
+            "ease": 2.5,
+            "interval": 1,
+            "repetitions": 0,
+            "last_review": None
+        },
+        "orbital": {
+            "learning_steps": [1, 10],
+            "graduating_interval": 1,
+            "easy_interval": 4
+        }
+    }
+
+
+@pytest.fixture
+def sample_markdown_content():
+    """Sample markdown content for testing."""
+    return """
+# Test Document
+
+This is a test document with some {{c1::cloze}} deletions.
+
+Here's another {{c2::cloze deletion}} for testing.
+
+What is the capital of {{c3::France}}?
+"""