taozuqin/ST-Bionic-Memory-Ecology
1
0
Fork 0
mirror of https://github.com/Youzini-afk/ST-Bionic-Memory-Ecology.git synced 2026-05-15 14:20:35 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add delayed auto extraction mode and fix AGPL license

Browse Source
This commit is contained in:
Youzini-afk
2026-04-07 22:24:04 +08:00
parent dd6baa8dad
commit c8af45bd35
9 changed files with 1370 additions and 105 deletions
Download Patch File Download Diff File Expand all files Collapse all files

668
LICENSE
View File

@@ -1,101 +1,661 @@
Aladdin Free Public License (AFPL)
Version 9
By Aladdin Enterprises
GNU AFFERO GENERAL PUBLIC LICENSE
Version 3, 19 November 2007
Alternate Titles: Unknown.
Specific License Author Information: Unknown.
Length: 2,051 Words / 12.65 kB.
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.
This text-file version of the license was generated by the Bakunin Cannabis Engine, Version 1.36, provided by Punkerslut Freethought.
AnarchistRevolt.com - The Theory and Practice of Revolutionary Anarchism.
Punkerslut Freethought provides information, resources, and ideas for changing the world -- everything from organizing worker unions to challenging the power of the state.
Preamble
||| Aladdin Free Public License
----------------------------------------
----------------------------------------
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.
-- Version 9
........................................
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.
Copyright (C) 1994, 1995, 1997, 1998, 1999, 2000 Aladdin Enterprises, Menlo Park, California, U.S.A. All rights reserved.
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.
NOTE: This License is not the same as any of the GNU Licenses published by the Free Software Foundation. Its terms are substantially different from those of the GNU Licenses. If you are familiar with the GNU Licenses, please read this license with extra care.
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.
Aladdin Enterprises hereby grants to anyone the permission to apply this License to their own work, as long as the entire License (including the above notices and this paragraph) is copied with no changes, additions, or deletions except for changing the first paragraph of Section 0 to include a suitable description of the work to which the license is being applied and of the person or entity that holds the copyright in the work, and, if the License is being applied to a work created in a country other than the United States, replacing the first paragraph of Section 6 with an appropriate reference to the laws of the appropriate country.
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.
This License is not an Open Source license: among other things, it places restrictions on distribution of the Program, specifically including sale of the Program. While Aladdin Enterprises respects and supports the philosophy of the Open Source Definition, and shares the desire of the GNU project to keep licensed software freely redistributable in both source and object form, we feel that Open Source licenses unfairly prevent developers of useful software from being compensated proportionately when others profit financially from their work. This License attempts to ensure that those who receive, redistribute, and contribute to the licensed Program according to the Open Source and Free Software philosophies have the right to do so, while retaining for the developer(s) of the Program the power to make those who use the Program to enhance the value of commercial products pay for the privilege of doing so.
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.
* 0. Subject Matter *
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.
This License applies to the computer programs known as "AFPL Ghostscript", "AFPL Ghostscript PCL5e", "AFPL Ghostscript PCL5c", and "AFPL Ghostscript PXL". The "Program", below, refers to such program. The Program is a copyrighted work whose copyright is held by Artifex Software Inc., located in San Rafael California and artofcode LLC, located in Benicia, California (the "Licensor"). Please note that AFPL Ghostscript is neither the program known as "GNU Ghostscript" nor the version of Ghostscript available for commercial licensing from Artifex Software Inc.
The precise terms and conditions for copying, distribution and
modification follow.
A "work based on the Program" means either the Program or any derivative work of the Program, as defined in the United States Copyright Act of 1976, such as a translation or a modification.
TERMS AND CONDITIONS
* BY MODIFYING OR DISTRIBUTING THE PROGRAM (OR ANY WORK BASED ON THE PROGRAM), YOU INDICATE YOUR ACCEPTANCE OF THIS LICENSE TO DO SO, AND ALL ITS TERMS AND CONDITIONS FOR COPYING, DISTRIBUTING OR MODIFYING THE PROGRAM OR WORKS BASED ON IT. NOTHING OTHER THAN THIS LICENSE GRANTS YOU PERMISSION TO MODIFY OR DISTRIBUTE THE PROGRAM OR ITS DERIVATIVE WORKS. THESE ACTIONS ARE PROHIBITED BY LAW. IF YOU DO NOT ACCEPT THESE TERMS AND CONDITIONS, DO NOT MODIFY OR DISTRIBUTE THE PROGRAM. *
0. Definitions.
* 1. Licenses. *
"This License" refers to version 3 of the GNU Affero General Public License.
Licensor hereby grants you the following rights, provided that you comply with all of the restrictions set forth in this License and provided, further, that you distribute an unmodified copy of this License with the Program:
"Copyright" also means copyright-like laws that apply to other kinds of
works, such as semiconductor masks.
(a) You may copy and distribute literal (i.e., verbatim) copies of the Program's source code as you receive it throughout the world, in any medium.
"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.
(b) You may modify the Program, create works based on the Program and distribute copies of such throughout the world, in any medium.
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.
* 2. Restrictions. *
A "covered work" means either the unmodified Program or a work based
on the Program.
This license is subject to the following restrictions:
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.
(a) Distribution of the Program or any work based on the Program by a commercial organization to any third party is prohibited if any payment is made in connection with such distribution, whether directly (as in payment for a copy of the Program) or indirectly (as in payment for some service related to the Program, or payment for some product or service that includes a copy of the Program "without charge"; these are only examples, and not an exhaustive enumeration of prohibited activities). The following methods of distribution involving payment shall not in and of themselves be a violation of this restriction:
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.
(i) Posting the Program on a public access information storage and retrieval service for which a fee is received for retrieving information (such as an on-line service), provided that the fee is not content-dependent (i.e., the fee would be the same for retrieving the same volume of information consisting of random data) and that access to the service and to the Program is available independent of any other product or service. An example of a service that does not fall under this section is an on-line service that is operated by a company and that is only available to customers of that company. (This is not an exhaustive enumeration.)
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.
(ii) Distributing the Program on removable computer-readable media, provided that the files containing the Program are reproduced entirely and verbatim on such media, that all information on such media be redistributable for non-commercial purposes without charge, and that such media are distributed by themselves (except for accompanying documentation) independent of any other product or service. Examples of such media include CD-ROM, magnetic tape, and optical storage media. (This is not intended to be an exhaustive list.) An example of a distribution that does not fall under this section is a CD-ROM included in a book or magazine. (This is not an exhaustive enumeration.)
1. Source Code.
(b) Activities other than copying, distribution and modification of the Program are not subject to this License and they are outside its scope. Functional use (running) of the Program is not restricted, and any output produced through the use of the Program is subject to this license only if its contents constitute a work based on the Program (independent of having been made by running the Program).
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.
(c) You must meet all of the following conditions with respect to any work that you distribute or publish that in whole or in part contains or is derived from the Program or any part thereof ("the 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.
(i) If you have modified the Program, you must cause the Work to carry prominent notices stating that you have modified the Program's files and the date of any change. In each source file that you have modified, you must include a prominent notice that you have modified the file, including your name, your e-mail address (if any), and the date and purpose of the change;
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.
(ii) You must cause the Work to be licensed as a whole and at no charge to all third parties under the terms of this License;
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.
(iii) If the Work normally reads commands interactively when run, you must cause it, at each time the Work commences operation, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty). Such notice must also state that users may redistribute the Work only under the conditions of this License and tell the user how to view the copy of this License included with the Work. (Exceptions: if the Program is interactive but normally prints or displays such an announcement only at the request of a user, such as in an "About box", the Work is required to print or display the notice only under the same circumstances; if the Program itself is interactive but does not normally print such an announcement, the Work is not required to print an announcement.);
The Corresponding Source need not include anything that users
can regenerate automatically from other parts of the Corresponding
Source.
(iv) You must accompany the Work with the complete corresponding machine-readable source code, delivered on a medium customarily used for software interchange. The source code for a work means the preferred form of the work for making modifications to it. For an executable work, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the executable code. If you distribute with the Work any component that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, you must also distribute the source code of that component if you have it and are allowed to do so;
The Corresponding Source for a work in source code form is that
same work.
(v) If you distribute any written or printed material at all with the Work, such material must include either a written copy of this License, or a prominent written indication that the Work is covered by this License and written instructions for printing and/or displaying the copy of the License on the distribution medium;
2. Basic Permissions.
(vi) You may not impose any further restrictions on the recipient's exercise of the rights granted herein.
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.
If distribution of executable or object code is made by offering the equivalent ability to copy from a designated place, then offering equivalent ability to copy the source code from the same place counts as distribution of the source code, even though third parties are not compelled to copy the source code along with the object code.
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.
* 3. Reservation of Rights. *
Conveying under any other circumstances is permitted solely under
the conditions stated below. Sublicensing is not allowed; section 10
makes it unnecessary.
No rights are granted to the Program except as expressly set forth herein. You may not copy, modify, sublicense, or distribute the Program except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense or distribute the Program is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance.
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
* 4. Other Restrictions. *
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.
If the distribution and/or use of the Program is restricted in certain countries for any reason, Licensor may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License.
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.
* 5. Limitations.
4. Conveying Verbatim Copies.
THE PROGRAM IS PROVIDED TO YOU "AS IS," WITHOUT WARRANTY. THERE IS NO WARRANTY FOR THE PROGRAM, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OF THIRD PARTY RIGHTS. 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.
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.
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL LICENSOR, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE 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.
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.
6. General. *
5. Conveying Modified Source Versions.
This License is governed by the laws of the State of California, U.S.A., excluding choice of law rules.
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:
If any part of this License is found to be in conflict with the law, that part shall be interpreted in its broadest meaning consistent with the law, and no other parts of the License shall be affected.
a) The work must carry prominent notices stating that you modified
it, and giving a relevant date.
For United States Government users, the Program is provided with RESTRICTED RIGHTS. If you are a unit or agency of the United States Government or are acquiring the Program for any such unit or agency, the following apply:
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".
If the unit or agency is the Department of Defense ("DOD"), the Program and its documentation are classified as "commercial computer software" and "commercial computer software documentation" respectively and, pursuant to DFAR Section 227.7202, the Government is acquiring the Program and its documentation in accordance with the terms of this License. If the unit or agency is other than DOD, the Program and its documentation are classified as "commercial computer software" and "commercial computer software documentation" respectively and, pursuant to FAR Section 12.212, the Government is acquiring the Program and its documentation in accordance with the terms of this License.
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.
[Note: * A license being listed in the Copyleft and Open Source Center does not mean it is endorsed. These licenses are provided as a reference to encourage and promote the Open Source movement. Nothing within these pages should be considered as legal advice. * ]
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:
[This document was generated by the Bakunin Cannabis Engine, Version 1.36.]
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 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.
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/>.

46
event-binding.js
View File

@@ -18,6 +18,12 @@ function getTimerApi(runtime) {
};
}
function toSafeFloor(value, fallback = null) {
if (value == null || value === "") return fallback;
const numeric = Number(value);
return Number.isFinite(numeric) ? Math.floor(numeric) : fallback;
}
export function registerBeforeCombinePromptsController(runtime, listener) {
const makeFirst = runtime.getEventMakeFirst();
if (typeof makeFirst === "function") {
@@ -650,6 +656,12 @@ export function onMessageReceivedController(
const context = runtime.getContext();
const chat = context?.chat;
const settings =
typeof runtime.getSettings === "function" ? runtime.getSettings() : {};
const lastProcessedAssistantFloor =
typeof runtime.getLastProcessedAssistantFloor === "function"
? runtime.getLastProcessedAssistantFloor()
: -1;
const receivedMessage =
Array.isArray(chat) && Number.isFinite(Number(messageId))
? chat[Number(messageId)]
@@ -674,6 +686,28 @@ export function onMessageReceivedController(
runtime.refreshPersistedRecallMessageUi?.();
return;
}
const autoExtractionPlan =
typeof runtime.resolveAutoExtractionPlan === "function"
? runtime.resolveAutoExtractionPlan({
chat,
settings,
lastProcessedAssistantFloor,
})
: null;
if (!autoExtractionPlan?.canRun) {
runtime.console?.debug?.(
"[ST-BME] assistant message received, auto extraction not runnable yet",
{
messageId: Number.isFinite(Number(targetMessageIndex))
? Number(targetMessageIndex)
: null,
reason: String(autoExtractionPlan?.reason || "not-runnable"),
strategy: String(autoExtractionPlan?.strategy || "normal"),
},
);
runtime.refreshPersistedRecallMessageUi?.();
return;
}
runtime.console?.debug?.(
"[ST-BME] assistant message received, queueing auto extraction",
{
@@ -695,21 +729,29 @@ export function onMessageReceivedController(
messageId: Number.isFinite(Number(targetMessageIndex))
? Number(targetMessageIndex)
: null,
targetEndFloor: toSafeFloor(autoExtractionPlan.plannedBatchEndFloor, null),
},
);
runtime.deferAutoExtraction("generation-running", {
messageId: targetMessageIndex,
targetEndFloor: autoExtractionPlan.plannedBatchEndFloor,
strategy: autoExtractionPlan.strategy,
});
runtime.refreshPersistedRecallMessageUi?.();
return;
}
enqueueMicrotask(() => {
void runtime.runExtraction().catch((error) => {
void runtime
.runExtraction({
lockedEndFloor: autoExtractionPlan.plannedBatchEndFloor,
triggerSource: "message-received",
})
.catch((error) => {
runtime.console.error("[ST-BME] 异步自动提取失败:", error);
runtime.notifyExtractionIssue(
error?.message || String(error) || "自动提取失败",
);
});
});
});
}
runtime.refreshPersistedRecallMessageUi?.();

231
extraction-controller.js
View File

@@ -3,6 +3,177 @@
import { debugLog } from "./debug-logging.js";
function toSafeFloor(value, fallback = null) {
if (value == null || value === "") return fallback;
const numeric = Number(value);
return Number.isFinite(numeric) ? Math.floor(numeric) : fallback;
}
function clampIntValue(value, fallback = 0, min = 0, max = 9999) {
const numeric = Number(value);
if (!Number.isFinite(numeric)) return fallback;
return Math.min(max, Math.max(min, Math.trunc(numeric)));
}
function isAssistantFloor(runtime, chat, index) {
if (!Array.isArray(chat)) return false;
const message = chat[index];
if (!message) return false;
if (typeof runtime?.isAssistantChatMessage === "function") {
return Boolean(
runtime.isAssistantChatMessage(message, {
index,
chat,
}),
);
}
return Boolean(message) && !message.is_user && !message.is_system;
}
function getAssistantTurnsFallback(runtime, chat = []) {
if (!Array.isArray(chat)) return [];
const assistantTurns = [];
for (let index = 0; index < chat.length; index++) {
if (!isAssistantFloor(runtime, chat, index)) continue;
if (!String(chat[index]?.mes ?? "").trim()) continue;
assistantTurns.push(index);
}
return assistantTurns;
}
function normalizeSmartTriggerDecision(decision = null) {
if (!decision || typeof decision !== "object") {
return { triggered: false, score: 0, reasons: [] };
}
return {
triggered: decision.triggered === true,
score: Number.isFinite(Number(decision.score)) ? Number(decision.score) : 0,
reasons: Array.isArray(decision.reasons)
? decision.reasons.map((item) => String(item || "")).filter(Boolean)
: [],
};
}
export function resolveAutoExtractionPlanController(
runtime,
{
chat = null,
settings = null,
lastProcessedAssistantFloor = null,
lockedEndFloor = null,
} = {},
) {
const resolvedChat = Array.isArray(chat)
? chat
: runtime?.getContext?.()?.chat || [];
const resolvedSettings =
settings && typeof settings === "object"
? settings
: runtime?.getSettings?.() || {};
const safeLastProcessedAssistantFloor = toSafeFloor(
lastProcessedAssistantFloor,
toSafeFloor(runtime?.getLastProcessedAssistantFloor?.(), -1),
);
const safeLockedEndFloor = toSafeFloor(lockedEndFloor, null);
const strategy =
resolvedSettings.extractAutoDelayLatestAssistant === true
? "lag-one-assistant"
: "normal";
const extractEvery = clampIntValue(
resolvedSettings.extractEvery,
1,
1,
50,
);
const assistantTurns =
typeof runtime?.getAssistantTurns === "function"
? runtime.getAssistantTurns(resolvedChat)
: getAssistantTurnsFallback(runtime, resolvedChat);
const pendingAssistantTurns = assistantTurns.filter(
(floor) => floor > safeLastProcessedAssistantFloor,
);
const candidateAssistantTurns =
safeLockedEndFloor == null
? pendingAssistantTurns
: pendingAssistantTurns.filter((floor) => floor <= safeLockedEndFloor);
let eligibleAssistantTurns = candidateAssistantTurns;
let waitingForNextAssistant = false;
if (safeLockedEndFloor == null && strategy === "lag-one-assistant") {
if (candidateAssistantTurns.length <= 1) {
eligibleAssistantTurns = [];
waitingForNextAssistant = candidateAssistantTurns.length === 1;
} else {
eligibleAssistantTurns = candidateAssistantTurns.slice(0, -1);
}
}
const eligibleEndFloor =
eligibleAssistantTurns.length > 0
? eligibleAssistantTurns[eligibleAssistantTurns.length - 1]
: null;
const smartTriggerDecision =
resolvedSettings.enableSmartTrigger && eligibleEndFloor != null
? normalizeSmartTriggerDecision(
runtime?.getSmartTriggerDecision?.(
resolvedChat,
safeLastProcessedAssistantFloor,
resolvedSettings,
eligibleEndFloor,
),
)
: { triggered: false, score: 0, reasons: [] };
const meetsExtractEvery = eligibleAssistantTurns.length >= extractEvery;
const canRun =
eligibleAssistantTurns.length > 0 &&
(meetsExtractEvery || smartTriggerDecision.triggered);
const batchAssistantTurns = canRun
? smartTriggerDecision.triggered
? eligibleAssistantTurns
: eligibleAssistantTurns.slice(0, extractEvery)
: [];
const plannedBatchEndFloor =
batchAssistantTurns.length > 0
? batchAssistantTurns[batchAssistantTurns.length - 1]
: null;
let reason = "";
if (pendingAssistantTurns.length === 0) {
reason = "no-unprocessed-assistant-turns";
} else if (candidateAssistantTurns.length === 0) {
reason =
safeLockedEndFloor == null
? "no-candidate-assistant-turns"
: "locked-target-missing";
} else if (waitingForNextAssistant) {
reason = "waiting-next-assistant";
} else if (!canRun && !smartTriggerDecision.triggered) {
reason = "below-extract-every";
}
return {
strategy,
chat: resolvedChat,
settings: resolvedSettings,
lastProcessedAssistantFloor: safeLastProcessedAssistantFloor,
lockedEndFloor: safeLockedEndFloor,
extractEvery,
pendingAssistantTurns,
candidateAssistantTurns,
eligibleAssistantTurns,
eligibleEndFloor,
waitingForNextAssistant,
smartTriggerDecision,
meetsExtractEvery,
canRun,
batchAssistantTurns,
plannedBatchEndFloor,
startIdx: batchAssistantTurns[0] ?? null,
endIdx: plannedBatchEndFloor,
reason,
};
}
export async function executeExtractionBatchController(
runtime,
{
@@ -126,20 +297,38 @@ export async function executeExtractionBatchController(
};
}
export async function runExtractionController(runtime) {
export async function runExtractionController(runtime, options = {}) {
const lockedEndFloor = toSafeFloor(options?.lockedEndFloor, null);
const triggerSource = String(options?.triggerSource || "auto").trim() || "auto";
const settings = runtime.getSettings?.() || {};
const context = runtime.getContext?.() || {};
const chat = Array.isArray(context?.chat) ? context.chat : [];
const plan = resolveAutoExtractionPlanController(runtime, {
chat,
settings,
lockedEndFloor,
});
const deferredTargetEndFloor =
plan.plannedBatchEndFloor ?? lockedEndFloor;
if (runtime.getIsExtracting()) {
runtime.console?.debug?.("[ST-BME] auto extraction deferred: extraction already in progress");
runtime.deferAutoExtraction?.("extracting");
runtime.deferAutoExtraction?.("extracting", {
targetEndFloor: deferredTargetEndFloor,
strategy: plan.strategy,
});
return;
}
const settings = runtime.getSettings();
if (!settings.enabled) return;
if (!runtime.ensureGraphMutationReady("自动提取", { notify: false })) {
runtime.console?.debug?.("[ST-BME] auto extraction blocked: graph-not-ready", {
loadState: runtime.getGraphPersistenceState?.()?.loadState || "",
});
runtime.deferAutoExtraction?.("graph-not-ready");
runtime.deferAutoExtraction?.("graph-not-ready", {
targetEndFloor: deferredTargetEndFloor,
strategy: plan.strategy,
});
runtime.setLastExtractionStatus(
"等待图谱加载",
runtime.getGraphMutationBlockReason("自动提取"),
@@ -158,44 +347,28 @@ export async function runExtractionController(runtime) {
recovering: runtime.getIsRecoveringHistory?.() === true,
});
if (runtime.getIsRecoveringHistory?.()) {
runtime.deferAutoExtraction?.("history-recovering");
runtime.deferAutoExtraction?.("history-recovering", {
targetEndFloor: deferredTargetEndFloor,
strategy: plan.strategy,
});
}
return;
}
const context = runtime.getContext();
const chat = context.chat;
if (!chat || chat.length === 0) return;
const assistantTurns = runtime.getAssistantTurns(chat);
const lastProcessed = runtime.getLastProcessedAssistantFloor();
const unprocessedAssistantTurns = assistantTurns.filter((i) => i > lastProcessed);
if (unprocessedAssistantTurns.length === 0) return;
const extractEvery = runtime.clampInt(settings.extractEvery, 1, 1, 50);
const smartTriggerDecision = settings.enableSmartTrigger
? runtime.getSmartTriggerDecision(chat, lastProcessed, settings)
: { triggered: false, score: 0, reasons: [] };
if (
unprocessedAssistantTurns.length < extractEvery &&
!smartTriggerDecision.triggered
) {
if (!plan.canRun || plan.startIdx == null || plan.endIdx == null) {
return;
}
const batchAssistantTurns = smartTriggerDecision.triggered
? unprocessedAssistantTurns
: unprocessedAssistantTurns.slice(0, extractEvery);
const startIdx = batchAssistantTurns[0];
const endIdx = batchAssistantTurns[batchAssistantTurns.length - 1];
const startIdx = plan.startIdx;
const endIdx = plan.endIdx;
const smartTriggerDecision = plan.smartTriggerDecision;
runtime.setIsExtracting(true);
const extractionController = runtime.beginStageAbortController("extraction");
const extractionSignal = extractionController.signal;
runtime.setLastExtractionStatus(
"提取中",
`楼层 ${startIdx}-${endIdx}${smartTriggerDecision.triggered ? " · 智能触发" : ""}`,
`楼层 ${startIdx}-${endIdx}${smartTriggerDecision.triggered ? " · 智能触发" : ""}${triggerSource !== "auto" ? ` · ${triggerSource}` : ""}`,
"running",
{ syncRuntime: true },
);

146
index.js
View File

@@ -72,6 +72,7 @@ import {
executeExtractionBatchController,
onManualExtractController,
onRerollController,
resolveAutoExtractionPlanController,
runExtractionController,
} from "./extraction-controller.js";
import {
@@ -394,6 +395,7 @@ const defaultSettings = {
// 提取设置
extractEvery: 1, // 每 N 条 assistant 回复提取一次
extractContextTurns: 2, // 提取时包含的上下文楼层数
extractAutoDelayLatestAssistant: false, // 自动提取时晚一条 AI 楼再处理
// 召回设置
recallEnabled: true,
@@ -577,6 +579,8 @@ let pendingAutoExtraction = {
reason: "",
requestedAt: 0,
attempts: 0,
targetEndFloor: null,
strategy: "normal",
};
let isHostGenerationRunning = false;
let lastHostGenerationEndedAt = 0;
@@ -5395,13 +5399,21 @@ function clearPendingAutoExtraction({ resetState = true } = {}) {
reason: "",
requestedAt: 0,
attempts: 0,
targetEndFloor: null,
strategy: "normal",
};
}
}
function deferAutoExtraction(
reason = "auto-extraction-deferred",
{ chatId = getCurrentChatId(), messageId = null, delayMs = null } = {},
{
chatId = getCurrentChatId(),
messageId = null,
delayMs = null,
targetEndFloor = null,
strategy = "",
} = {},
) {
const normalizedChatId = normalizeChatIdCandidate(chatId);
if (!normalizedChatId) {
@@ -5443,6 +5455,22 @@ function deferAutoExtraction(
? pendingAutoExtraction.requestedAt
: Date.now(),
attempts: nextAttempts,
targetEndFloor: Number.isFinite(Number(targetEndFloor))
? sameChat &&
Number.isFinite(Number(pendingAutoExtraction.targetEndFloor))
? Math.max(
Math.floor(Number(targetEndFloor)),
Math.floor(Number(pendingAutoExtraction.targetEndFloor)),
)
: Math.floor(Number(targetEndFloor))
: sameChat
? pendingAutoExtraction.targetEndFloor
: null,
strategy: String(strategy || "")
? String(strategy || "")
: sameChat
? String(pendingAutoExtraction.strategy || "normal")
: "normal",
};
if (pendingAutoExtractionTimer) {
@@ -5459,6 +5487,8 @@ function deferAutoExtraction(
reason: pendingAutoExtraction.reason,
chatId: normalizedChatId,
messageId: pendingAutoExtraction.messageId,
targetEndFloor: pendingAutoExtraction.targetEndFloor,
strategy: pendingAutoExtraction.strategy,
attempts: nextAttempts,
delayMs: resolvedDelayMs,
});
@@ -5468,11 +5498,36 @@ function deferAutoExtraction(
chatId: normalizedChatId,
messageId: pendingAutoExtraction.messageId,
reason: pendingAutoExtraction.reason,
targetEndFloor: pendingAutoExtraction.targetEndFloor,
strategy: pendingAutoExtraction.strategy,
attempts: nextAttempts,
delayMs: resolvedDelayMs,
};
}
function resolveAutoExtractionPlan({
chat = null,
settings = null,
lastProcessedAssistantFloor = null,
lockedEndFloor = null,
} = {}) {
return resolveAutoExtractionPlanController(
{
getAssistantTurns,
getSmartTriggerDecision,
},
{
chat,
settings,
lastProcessedAssistantFloor:
Number.isFinite(Number(lastProcessedAssistantFloor))
? Math.floor(Number(lastProcessedAssistantFloor))
: getLastProcessedAssistantFloor(),
lockedEndFloor,
},
);
}
function maybeResumePendingAutoExtraction(source = "auto-extraction-resume") {
const pendingChatId = normalizeChatIdCandidate(pendingAutoExtraction.chatId);
if (!pendingChatId) {
@@ -5497,6 +5552,8 @@ function maybeResumePendingAutoExtraction(source = "auto-extraction-resume") {
return deferAutoExtraction("extracting", {
chatId: pendingChatId,
messageId: pendingAutoExtraction.messageId,
targetEndFloor: pendingAutoExtraction.targetEndFloor,
strategy: pendingAutoExtraction.strategy,
});
}
@@ -5504,6 +5561,8 @@ function maybeResumePendingAutoExtraction(source = "auto-extraction-resume") {
return deferAutoExtraction("generation-running", {
chatId: pendingChatId,
messageId: pendingAutoExtraction.messageId,
targetEndFloor: pendingAutoExtraction.targetEndFloor,
strategy: pendingAutoExtraction.strategy,
});
}
@@ -5517,6 +5576,8 @@ function maybeResumePendingAutoExtraction(source = "auto-extraction-resume") {
chatId: pendingChatId,
messageId: pendingAutoExtraction.messageId,
delayMs: hostGenerationSettleRemainingMs,
targetEndFloor: pendingAutoExtraction.targetEndFloor,
strategy: pendingAutoExtraction.strategy,
});
}
@@ -5524,6 +5585,8 @@ function maybeResumePendingAutoExtraction(source = "auto-extraction-resume") {
return deferAutoExtraction("history-recovering", {
chatId: pendingChatId,
messageId: pendingAutoExtraction.messageId,
targetEndFloor: pendingAutoExtraction.targetEndFloor,
strategy: pendingAutoExtraction.strategy,
});
}
@@ -5540,11 +5603,17 @@ function maybeResumePendingAutoExtraction(source = "auto-extraction-resume") {
return deferAutoExtraction("graph-not-ready", {
chatId: pendingChatId,
messageId: pendingAutoExtraction.messageId,
targetEndFloor: pendingAutoExtraction.targetEndFloor,
strategy: pendingAutoExtraction.strategy,
});
}
const resumeContext = getContext();
const resumeChat = resumeContext?.chat;
const settings = getSettings();
let lockedEndFloor = Number.isFinite(Number(pendingAutoExtraction.targetEndFloor))
? Math.floor(Number(pendingAutoExtraction.targetEndFloor))
: null;
if (
Array.isArray(resumeChat) &&
Number.isFinite(Number(pendingAutoExtraction.messageId))
@@ -5564,16 +5633,54 @@ function maybeResumePendingAutoExtraction(source = "auto-extraction-resume") {
chatId: pendingChatId,
messageId: pendingMessageIndex,
delayMs: AUTO_EXTRACTION_HOST_SETTLE_MS,
targetEndFloor: pendingAutoExtraction.targetEndFloor,
strategy: pendingAutoExtraction.strategy,
});
}
}
if (Array.isArray(resumeChat) && resumeChat.length > 0 && lockedEndFloor != null) {
const lockedPlan = resolveAutoExtractionPlan({
chat: resumeChat,
settings,
lockedEndFloor,
});
if (
!lockedPlan.canRun &&
lockedPlan.candidateAssistantTurns.length === 0
) {
const fallbackPlan = resolveAutoExtractionPlan({
chat: resumeChat,
settings,
});
lockedEndFloor = fallbackPlan.canRun
? fallbackPlan.plannedBatchEndFloor
: null;
}
}
const pendingRequest = { ...pendingAutoExtraction };
clearPendingAutoExtraction();
if (lockedEndFloor == null) {
const currentPlan = resolveAutoExtractionPlan({
chat: resumeChat,
settings,
});
if (!currentPlan.canRun) {
return {
resumed: false,
reason: "no-runnable-auto-extraction",
source,
...pendingRequest,
};
}
lockedEndFloor = currentPlan.plannedBatchEndFloor;
}
console.debug?.("[ST-BME] resuming pending auto extraction", {
source,
chatId: pendingRequest.chatId,
messageId: pendingRequest.messageId,
targetEndFloor: lockedEndFloor,
attempts: pendingRequest.attempts || 0,
});
const enqueueMicrotask =
@@ -5581,7 +5688,10 @@ function maybeResumePendingAutoExtraction(source = "auto-extraction-resume") {
? globalThis.queueMicrotask.bind(globalThis)
: (task) => Promise.resolve().then(task);
enqueueMicrotask(() => {
void runExtraction().catch((error) => {
void runExtraction({
lockedEndFloor,
triggerSource: source,
}).catch((error) => {
console.error("[ST-BME] 延迟自动提取失败:", error);
notifyExtractionIssue(error?.message || String(error) || "自动提取失败");
});
@@ -5590,6 +5700,7 @@ function maybeResumePendingAutoExtraction(source = "auto-extraction-resume") {
return {
resumed: true,
source,
lockedEndFloor,
...pendingRequest,
};
}
@@ -7634,12 +7745,24 @@ const DEFAULT_TRIGGER_KEYWORDS = [
"来到",
];
export function getSmartTriggerDecision(chat, lastProcessed, settings) {
export function getSmartTriggerDecision(
chat,
lastProcessed,
settings,
endFloor = null,
) {
const startFloor = Math.max(0, (lastProcessed ?? -1) + 1);
const normalizedEndFloor = Number.isFinite(Number(endFloor))
? Math.max(startFloor - 1, Math.floor(Number(endFloor)))
: null;
const pendingMessages = chat
.slice(Math.max(0, (lastProcessed ?? -1) + 1))
.slice(
startFloor,
normalizedEndFloor == null ? undefined : normalizedEndFloor + 1,
)
.map((msg, offset) => ({
msg,
index: Math.max(0, (lastProcessed ?? -1) + 1) + offset,
index: startFloor + offset,
}))
.filter(({ msg, index }) => !isSystemMessageForExtraction(msg, { index, chat }))
.map(({ msg }) => ({
@@ -10128,6 +10251,13 @@ function settleExtractionStatusAfterHistoryRecovery(
* 提取管线：处理未提取的对话楼层
*/
async function runExtraction() {
const options =
arguments.length > 0 &&
arguments[0] &&
typeof arguments[0] === "object" &&
!Array.isArray(arguments[0])
? arguments[0]
: {};
return await runExtractionController({
beginStageAbortController,
clampInt,
@@ -10149,11 +10279,12 @@ async function runExtraction() {
isAbortError,
notifyExtractionIssue,
recoverHistoryIfNeeded,
resolveAutoExtractionPlan,
setIsExtracting: (value) => {
isExtracting = value;
},
setLastExtractionStatus,
});
}, options);
}
function applyRecallInjection(settings, recallInput, recentMessages, result) {
@@ -10717,8 +10848,10 @@ function onMessageReceived(messageId = null, type = "") {
getCurrentGraph: () => currentGraph,
getGraphPersistenceState: () => graphPersistenceState,
getIsHostGenerationRunning: () => isHostGenerationRunning,
getLastProcessedAssistantFloor,
getPendingHostGenerationInputSnapshot,
getPendingRecallSendIntent: () => pendingRecallSendIntent,
getSettings,
isAssistantChatMessage,
isFreshRecallInputRecord,
isGraphMetadataWriteAllowed,
@@ -10727,6 +10860,7 @@ function onMessageReceived(messageId = null, type = "") {
maybeFlushQueuedGraphPersist,
notifyExtractionIssue,
queueMicrotask,
resolveAutoExtractionPlan,
runExtraction,
refreshPersistedRecallMessageUi: schedulePersistedRecallMessageUiRefresh,
setPendingHostGenerationInputSnapshot: (record) => {

13
panel.html
View File

@@ -1191,6 +1191,19 @@
max="20"
/>
</div>
<label
class="bme-inline-checkbox"
for="bme-setting-extract-auto-delay-latest-assistant"
>
<input
id="bme-setting-extract-auto-delay-latest-assistant"
type="checkbox"
/>
<span>自动提取晚一楼</span>
</label>
<div class="bme-config-help">
开启后，最新 AI 楼先不自动提取，要等下一条 AI 楼出现后，才提取前一批内容。手动提取和重 Roll 不受影响。
</div>
</div>
</div>
</div>

9
panel.js
View File

@@ -2281,6 +2281,10 @@ function _refreshConfigTab() {
"bme-setting-extract-context-turns",
settings.extractContextTurns ?? 2,
);
_setCheckboxValue(
"bme-setting-extract-auto-delay-latest-assistant",
settings.extractAutoDelayLatestAssistant === true,
);
_setInputValue("bme-setting-recall-top-k", settings.recallTopK ?? 20);
_setInputValue("bme-setting-recall-max-nodes", settings.recallMaxNodes ?? 8);
_setInputValue(
@@ -2664,6 +2668,11 @@ function _bindConfigControls() {
bindNumber("bme-setting-extract-context-turns", 2, 0, 20, (value) =>
_patchSettings({ extractContextTurns: value }),
);
bindCheckbox(
"bme-setting-extract-auto-delay-latest-assistant",
(checked) =>
_patchSettings({ extractAutoDelayLatestAssistant: checked }),
);
bindNumber("bme-setting-recall-top-k", 20, 1, 100, (value) =>
_patchSettings({ recallTopK: value }),
);

3
tests/default-settings.mjs
View File

@@ -83,6 +83,7 @@ const defaultSettings = await loadDefaultSettings();
const { mergePersistedSettings } = await loadSettingsCompatHelpers();
assert.equal(defaultSettings.extractContextTurns, 2);
assert.equal(defaultSettings.extractAutoDelayLatestAssistant, false);
assert.equal(defaultSettings.recallTopK, 20);
assert.equal(defaultSettings.recallMaxNodes, 8);
assert.equal(defaultSettings.recallEnableVectorPrefilter, true);
@@ -140,8 +141,10 @@ assert.ok(defaultSettings.taskProfiles.recall);
const migratedSettings = mergePersistedSettings({
maintenanceAutoMinNewNodes: 7,
extractAutoDelayLatestAssistant: true,
});
assert.equal(migratedSettings.consolidationAutoMinNewNodes, 7);
assert.equal(migratedSettings.extractAutoDelayLatestAssistant, true);
assert.equal(migratedSettings.enableAutoCompression, true);
assert.equal(migratedSettings.compressionEveryN, 10);
assert.equal("maintenanceAutoMinNewNodes" in migratedSettings, false);

39
tests/helpers/generation-recall-harness.mjs
View File

@@ -9,6 +9,7 @@ import {
onMessageReceivedController,
onMessageSentController,
} from "../../event-binding.js";
import { resolveAutoExtractionPlanController } from "../../extraction-controller.js";
import {
GRAPH_LOAD_STATES,
GRAPH_METADATA_KEY,
@@ -26,11 +27,11 @@ import {
createGraphPersistenceState,
createRecallInputRecord,
createRecallRunResult,
createUiStatus,
getGenerationRecallHookStateFromResult,
getRecallHookLabel,
getStageNoticeDuration,
getStageNoticeTitle,
createUiStatus,
getGenerationRecallHookStateFromResult,
getRecallHookLabel,
getStageNoticeDuration,
getStageNoticeTitle,
hashRecallInput,
isFreshRecallInputRecord,
isTerminalGenerationRecallHookState,
@@ -112,6 +113,10 @@ export function createGenerationRecallHarness(options = {}) {
getCurrentChatId: () => "chat-main",
normalizeRecallInputText: (text = "") => String(text || "").trim(),
isTrivialUserInput,
getAssistantTurns: (chat = []) =>
chat.flatMap((message, index) =>
!message?.is_user && !message?.is_system ? [index] : [],
),
getLatestUserChatMessage: (chat = []) =>
[...chat].reverse().find((message) => message?.is_user) || null,
getLastNonSystemChatMessage: (chat = []) =>
@@ -161,6 +166,7 @@ export function createGenerationRecallHarness(options = {}) {
GRAPH_LOAD_STATES,
GRAPH_METADATA_KEY,
GRAPH_PERSISTENCE_META_KEY,
resolveAutoExtractionPlanController,
onBeforeCombinePromptsController,
onGenerationAfterCommandsController,
onGenerationStartedController,
@@ -334,7 +340,10 @@ export function createGenerationRecallHarness(options = {}) {
context.result.getIsHostGenerationRunning(),
getPendingHostGenerationInputSnapshot:
context.result.getPendingHostGenerationInputSnapshot,
getPendingRecallSendIntent: () => context.result.getPendingRecallSendIntent(),
getPendingRecallSendIntent: () =>
context.result.getPendingRecallSendIntent(),
getLastProcessedAssistantFloor: () => -1,
getSettings: () => context.settings,
isAssistantChatMessage: (message) =>
Boolean(message) && !message.is_user && !message.is_system,
isFreshRecallInputRecord,
@@ -346,6 +355,24 @@ export function createGenerationRecallHarness(options = {}) {
context.extractionIssues.push(String(message || ""));
},
queueMicrotask: (task) => task(),
resolveAutoExtractionPlan: (options = {}) =>
resolveAutoExtractionPlanController(
{
getAssistantTurns(chat = []) {
return chat.flatMap((message, index) =>
!message?.is_user && !message?.is_system ? [index] : [],
);
},
getLastProcessedAssistantFloor: () => -1,
getSettings: () => context.settings,
getSmartTriggerDecision: () => ({
triggered: false,
score: 0,
reasons: [],
}),
},
options,
),
runExtraction: context.runExtraction,
refreshPersistedRecallMessageUi: () => {
context.recallUiRefreshCalls += 1;

320
tests/p0-regressions.mjs
View File

@@ -19,6 +19,7 @@ import {
} from "../event-binding.js";
import {
onRerollController,
resolveAutoExtractionPlanController,
runExtractionController,
} from "../extraction-controller.js";
import {
@@ -79,6 +80,9 @@ const scriptShimSource = [
"export function getRequestHeaders() {",
" return { 'Content-Type': 'application/json' };",
"}",
"export function substituteParamsExtended(text = '') {",
" return String(text ?? '');",
"}",
].join("\n");
const openAiShimSource = [
"export const chat_completion_sources = { CUSTOM: 'custom', OPENAI: 'openai' };",
@@ -219,6 +223,38 @@ const schema = [
},
];
function buildAutoExtractionPlan({
chat = [],
settings = {},
lastProcessedAssistantFloor = -1,
lockedEndFloor = null,
smartTriggerDecision = null,
} = {}) {
return resolveAutoExtractionPlanController(
{
getAssistantTurns(sourceChat = []) {
return sourceChat.flatMap((message, index) =>
!message?.is_user && !message?.is_system ? [index] : [],
);
},
getLastProcessedAssistantFloor: () => lastProcessedAssistantFloor,
getSettings: () => settings,
getSmartTriggerDecision: () =>
smartTriggerDecision || {
triggered: false,
score: 0,
reasons: [],
},
},
{
chat,
settings,
lastProcessedAssistantFloor,
lockedEndFloor,
},
);
}
function createBatchStageHarness() {
return fs.readFile(indexPath, "utf8").then((source) => {
const marker = "function notifyHistoryDirty(dirtyFrom, reason) {";
@@ -3677,6 +3713,15 @@ async function testCharacterMessageRenderedRefreshesRecallUiAfterAssistantRender
async function testMessageReceivedQueuesExtractionWithoutRuntimeQueueMicrotask() {
let runExtractionCalls = 0;
let refreshCalls = 0;
const chat = [
{ is_user: true, mes: "u1" },
{ is_user: false, mes: "a1" },
];
const settings = {
extractEvery: 1,
extractAutoDelayLatestAssistant: false,
enableSmartTrigger: false,
};
onMessageReceivedController(
{
@@ -3687,14 +3732,20 @@ async function testMessageReceivedQueuesExtractionWithoutRuntimeQueueMicrotask()
createRecallInputRecord: () => ({ text: "", at: 0 }),
setPendingRecallSendIntent() {},
getContext: () => ({
chat: [
{ is_user: true, mes: "u1" },
{ is_user: false, mes: "a1" },
],
chat,
}),
getSettings: () => settings,
getLastProcessedAssistantFloor: () => -1,
isAssistantChatMessage(message) {
return Boolean(message) && !message.is_user && !message.is_system;
},
resolveAutoExtractionPlan: (options = {}) =>
buildAutoExtractionPlan({
chat,
settings,
lastProcessedAssistantFloor: -1,
...(options || {}),
}),
runExtraction: async () => {
runExtractionCalls += 1;
},
@@ -3719,6 +3770,15 @@ async function testMessageReceivedQueuesExtractionWithoutRuntimeQueueMicrotask()
async function testMessageReceivedDefersExtractionDuringHostGeneration() {
let runExtractionCalls = 0;
const deferred = [];
const chat = [
{ is_user: true, mes: "u1" },
{ is_user: false, mes: "a1" },
];
const settings = {
extractEvery: 1,
extractAutoDelayLatestAssistant: false,
enableSmartTrigger: false,
};
onMessageReceivedController(
{
@@ -3734,18 +3794,27 @@ async function testMessageReceivedDefersExtractionDuringHostGeneration() {
messageId: Number.isFinite(Number(meta?.messageId))
? Number(meta.messageId)
: null,
targetEndFloor: Number.isFinite(Number(meta?.targetEndFloor))
? Number(meta.targetEndFloor)
: null,
});
},
setPendingRecallSendIntent() {},
getContext: () => ({
chat: [
{ is_user: true, mes: "u1" },
{ is_user: false, mes: "a1" },
],
chat,
}),
getSettings: () => settings,
getLastProcessedAssistantFloor: () => -1,
isAssistantChatMessage(message) {
return Boolean(message) && !message.is_user && !message.is_system;
},
resolveAutoExtractionPlan: (options = {}) =>
buildAutoExtractionPlan({
chat,
settings,
lastProcessedAssistantFloor: -1,
...(options || {}),
}),
runExtraction: async () => {
runExtractionCalls += 1;
},
@@ -3766,10 +3835,198 @@ async function testMessageReceivedDefersExtractionDuringHostGeneration() {
{
reason: "generation-running",
messageId: 1,
targetEndFloor: 1,
},
]);
}
async function testMessageReceivedLagModeWaitsSilentlyForNextAssistant() {
let runExtractionCalls = 0;
const deferred = [];
let refreshCalls = 0;
const chat = [
{ is_user: true, mes: "u1" },
{ is_user: false, mes: "a1" },
];
const settings = {
extractEvery: 1,
extractAutoDelayLatestAssistant: true,
enableSmartTrigger: false,
};
onMessageReceivedController(
{
getGraphPersistenceState: () => ({ loadState: "loaded", dbReady: true }),
getCurrentGraph: () => null,
getPendingRecallSendIntent: () => ({ text: "", at: 0 }),
isFreshRecallInputRecord: () => true,
createRecallInputRecord: () => ({ text: "", at: 0 }),
setPendingRecallSendIntent() {},
getContext: () => ({ chat }),
getSettings: () => settings,
getLastProcessedAssistantFloor: () => -1,
isAssistantChatMessage(message) {
return Boolean(message) && !message.is_user && !message.is_system;
},
resolveAutoExtractionPlan: (options = {}) =>
buildAutoExtractionPlan({
chat,
settings,
lastProcessedAssistantFloor: -1,
...(options || {}),
}),
runExtraction: async () => {
runExtractionCalls += 1;
},
deferAutoExtraction(reason) {
deferred.push(reason);
},
console: {
error() {},
},
notifyExtractionIssue() {},
refreshPersistedRecallMessageUi() {
refreshCalls += 1;
},
},
1,
"assistant",
);
await waitForTick();
assert.equal(runExtractionCalls, 0);
assert.deepEqual(deferred, []);
assert.equal(refreshCalls, 1);
}
async function testMessageReceivedLagModeQueuesPreviousAssistantOnly() {
const runExtractionCalls = [];
const chat = [
{ is_user: true, mes: "u1" },
{ is_user: false, mes: "a1" },
{ is_user: true, mes: "u2" },
{ is_user: false, mes: "a2" },
];
const settings = {
extractEvery: 1,
extractAutoDelayLatestAssistant: true,
enableSmartTrigger: false,
};
onMessageReceivedController(
{
getGraphPersistenceState: () => ({ loadState: "loaded", dbReady: true }),
getCurrentGraph: () => null,
getPendingRecallSendIntent: () => ({ text: "", at: 0 }),
isFreshRecallInputRecord: () => true,
createRecallInputRecord: () => ({ text: "", at: 0 }),
setPendingRecallSendIntent() {},
getContext: () => ({ chat }),
getSettings: () => settings,
getLastProcessedAssistantFloor: () => -1,
isAssistantChatMessage(message) {
return Boolean(message) && !message.is_user && !message.is_system;
},
resolveAutoExtractionPlan: (options = {}) =>
buildAutoExtractionPlan({
chat,
settings,
lastProcessedAssistantFloor: -1,
...(options || {}),
}),
runExtraction: async (options = {}) => {
runExtractionCalls.push({ ...options });
},
console: {
error() {},
},
notifyExtractionIssue() {},
refreshPersistedRecallMessageUi() {},
},
3,
"assistant",
);
await waitForTick();
assert.equal(runExtractionCalls.length, 1);
assert.equal(runExtractionCalls[0]?.lockedEndFloor, 1);
assert.equal(runExtractionCalls[0]?.triggerSource, "message-received");
}
async function testLagModeSmartTriggerOnlyScoresEligibleWindow() {
const endFloors = [];
const chat = [
{ is_user: true, mes: "u1" },
{ is_user: false, mes: "a1" },
{ is_user: true, mes: "u2" },
{ is_user: false, mes: "a2" },
];
const plan = resolveAutoExtractionPlanController(
{
getAssistantTurns(sourceChat = []) {
return sourceChat.flatMap((message, index) =>
!message?.is_user && !message?.is_system ? [index] : [],
);
},
getLastProcessedAssistantFloor: () => -1,
getSettings: () => ({
extractEvery: 10,
extractAutoDelayLatestAssistant: true,
enableSmartTrigger: true,
}),
getSmartTriggerDecision(_chat, _lastProcessed, _settings, endFloor) {
endFloors.push(endFloor);
return {
triggered: true,
score: 3,
reasons: ["test"],
};
},
},
{
chat,
settings: {
extractEvery: 10,
extractAutoDelayLatestAssistant: true,
enableSmartTrigger: true,
},
lastProcessedAssistantFloor: -1,
},
);
assert.equal(plan.canRun, true);
assert.deepEqual(endFloors, [1]);
assert.deepEqual(plan.batchAssistantTurns, [1]);
}
async function testLagModeRespectsExtractEveryAgainstEligibleWindow() {
const chat = [
{ is_user: true, mes: "u1" },
{ is_user: false, mes: "a1" },
{ is_user: true, mes: "u2" },
{ is_user: false, mes: "a2" },
{ is_user: true, mes: "u3" },
{ is_user: false, mes: "a3" },
];
const plan = buildAutoExtractionPlan({
chat,
settings: {
extractEvery: 2,
extractAutoDelayLatestAssistant: true,
enableSmartTrigger: false,
},
lastProcessedAssistantFloor: -1,
});
assert.equal(plan.canRun, true);
assert.deepEqual(plan.eligibleAssistantTurns, [1, 3]);
assert.deepEqual(plan.batchAssistantTurns, [1, 3]);
assert.equal(plan.plannedBatchEndFloor, 3);
}
async function testGenerationEndedResumesPendingAutoExtractionAfterSettle() {
const harness = await createGenerationRecallHarness();
harness.chat = [
@@ -3799,6 +4056,48 @@ async function testGenerationEndedResumesPendingAutoExtractionAfterSettle() {
harness.result.clearPendingAutoExtraction();
}
async function testLagModePendingResumeKeepsLockedPreviousAssistantAfterLatestDisappears() {
const harness = await createGenerationRecallHarness();
harness.settings = {
extractEvery: 1,
extractAutoDelayLatestAssistant: true,
enableSmartTrigger: false,
};
harness.chat = [
{ is_user: true, mes: "u1" },
{ is_user: false, mes: "a1" },
{ is_user: true, mes: "u2" },
{ is_user: false, mes: "a2" },
];
harness.result.setGraphPersistenceState({
loadState: "loaded",
dbReady: true,
chatId: "chat-main",
});
harness.result.onGenerationStarted("normal", {}, false);
harness.invokeOnMessageReceived(3, "assistant");
await waitForTick();
assert.equal(harness.runExtractionCalls.length, 0);
assert.equal(
harness.result.getPendingAutoExtraction().targetEndFloor,
1,
);
harness.chat = [
{ is_user: true, mes: "u1" },
{ is_user: false, mes: "a1" },
{ is_user: true, mes: "u2" },
];
harness.result.onGenerationEnded();
await new Promise((resolve) => setTimeout(resolve, 180));
assert.equal(harness.runExtractionCalls.length, 1);
assert.equal(harness.runExtractionCalls[0]?.[0]?.lockedEndFloor, 1);
harness.result.clearPendingAutoExtraction();
}
async function testAutoExtractionDefersWhenGraphNotReady() {
const deferredReasons = [];
const statuses = [];
@@ -5755,7 +6054,12 @@ await testUserMessageRenderedRefreshesRecallUiAfterRealDomRender();
await testCharacterMessageRenderedRefreshesRecallUiAfterAssistantRender();
await testMessageReceivedQueuesExtractionWithoutRuntimeQueueMicrotask();
await testMessageReceivedDefersExtractionDuringHostGeneration();
await testMessageReceivedLagModeWaitsSilentlyForNextAssistant();
await testMessageReceivedLagModeQueuesPreviousAssistantOnly();
await testLagModeSmartTriggerOnlyScoresEligibleWindow();
await testLagModeRespectsExtractEveryAgainstEligibleWindow();
await testGenerationEndedResumesPendingAutoExtractionAfterSettle();
await testLagModePendingResumeKeepsLockedPreviousAssistantAfterLatestDisappears();
await testAutoExtractionDefersWhenGraphNotReady();
await testAutoExtractionDefersWhenAlreadyExtracting();
await testAutoExtractionDefersWhenHistoryRecoveryBusy();