@knime/utils 2.0.1 → 2.0.3

package/CHANGELOG.md

@@ -1,5 +1,20 @@
 # @knime/utils
 
+## 2.0.3
+
+### Patch Changes
+
+- 2352be0: Raise the `dompurify` dependency to `^3.4.16` to fix GHSA-p98j-92pf-mc4p.
+
+## 2.0.2
+
+### Patch Changes
+
+- 2725ccb: Adjust API for file extension utils
+
+  No longer require a full `File` object instance, which is not really used. Instead, take an interface that
+  just declares the necessary properties required and used by the utils
+
 ## 2.0.1
 
 ### Patch Changes

package/LICENSE

@@ -1,710 +1,9 @@
+Copyright (c) KNIME AG, Zurich, Switzerland. All rights reserved.
 
-Please see below the General Public License (GPL), Version 3, 
-and the Additional Permissions according to Sec. 7 
-applying to the files in this folder:
+This source code, its documentation and all appendant files
+are protected by copyright law. All rights reserved.
 
-*** *** *** *** *** *** *** *** *** *** *** *** *** *** *** *** *** *** *** *** 
-
-                    GNU GENERAL PUBLIC LICENSE
-                       Version 3, 29 June 2007
-
- Copyright (C) 2007 Free Software Foundation, Inc. <http://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.
-
-    <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 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 <http://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:
-
-    <program>  Copyright (C) <year>  <name of author>
-    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
-<http://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
-<http://www.gnu.org/philosophy/why-not-lgpl.html>.
-
-*** *** *** *** *** *** *** *** *** *** *** *** *** *** *** *** *** *** *** *** 
-
-Additional permissions under GNU GPL Version 3 Section 7:
-	
-KNIME interoperates with ECLIPSE solely via ECLIPSE's plug-in APIs.
-Hence, KNIME and ECLIPSE are both independent programs and are not
-derived from each other. Should, however, the interpretation of the
-GNU GPL Version 3 ("License") under any applicable laws result in
-KNIME and ECLIPSE being a combined program, KNIME AG herewith grants
-you the additional permission to use and propagate KNIME together with
-ECLIPSE with only the license terms in place for ECLIPSE applying to
-ECLIPSE and the GNU GPL Version 3 applying for KNIME, provided the
-license terms of ECLIPSE themselves allow for the respective use and
-propagation of ECLIPSE together with KNIME.
-	
-	
-Additional permission relating to nodes for KNIME that extend the Node
-Extension (and in particular that are based on subclasses of NodeModel,
-NodeDialog, and NodeView) and that only interoperate with KNIME through
-standard APIs ("Nodes"):
-Nodes are deemed to be separate and independent programs and to not be
-covered works.  Notwithstanding anything to the contrary in the License,
-the License does not apply to Nodes, you are not required to license Nodes
-under the License, and you are granted a license to prepare and propagate
-Nodes, in each case even if such Nodes are propagated with or for
-interoperation with KNIME.  The owner of a Node may freely choose the
-license terms applicable to such Node, including when such Node is
-propagated with or for interoperation with KNIME.
+Confidential and proprietary information of KNIME AG.
+Unauthorized copying, distribution, or use of this file, via
+any medium, is strictly prohibited without prior written
+consent from KNIME AG.

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","names":[],"sources":["../src/capitalize.ts","../src/updateDate.ts","../src/updateTime.ts","../src/dateMinMaxCheck.ts","../src/debounce.ts","../src/filters.ts","../src/localTimezone.ts","../src/format.ts","../src/getDeepActiveElement.ts","../src/getWrappedAroundIndex.ts","../src/intervalUtils.ts","../src/numIntegerDigits.ts","../src/promise/createAbortablePromise.ts","../src/promise/createUnwrappedPromise.ts","../src/sleep.ts","../src/promise/retryPromise.ts","../src/promise/index.ts","../src/sanitization.ts","../src/truncateString.ts","../src/fileExtensions.ts","../src/hotkeys/enums.ts","../src/platform/navigator.ts","../src/hotkeys/format.ts","../src/hotkeys/match.ts","../src/hotkeys/modifiers.ts","../src/hotkeys/index.ts"],"sourcesContent":["/**\n * Uppercases first letter of string\n * @param string to be capitalized first string, e.g. \"workflow\"\n * @return Capitalized String, e.g. \"Workflow\"\n */\nexport const capitalize = (input: string) =>\n  input.charAt(0).toUpperCase() + input.substring(1);\n\nconst formats = {\n  customFormat: (input: string, delimiter: string) =>\n    capitalize(input.replace(delimiter, \" \").toLowerCase()),\n\n  kebabFormat: (input: string) => formats.customFormat(input, \"-\"),\n  snakeFormat: (input: string) => formats.customFormat(input, \"_\"),\n\n  camelPascalCase: (input: string) =>\n    capitalize(\n      (input.match(/([A-Z]?[^A-Z]*)/g) ?? [])\n        .slice(0, -1)\n        .join(\" \")\n        .toLowerCase(),\n    ),\n} as const;\n\ntype CaseFormatterOptions = {\n  string: string;\n  delimiter?: string;\n  format?: keyof typeof formats;\n};\n\nexport const caseFormatter = ({\n  string,\n  delimiter,\n  format,\n}: CaseFormatterOptions) => {\n  if (delimiter) {\n    return formats.customFormat(string, delimiter);\n  }\n\n  if (format) {\n    return formats[format](string, delimiter ?? \"\");\n  }\n\n  return capitalize(string);\n};\n","import { getDate, getMonth, getYear, isValid, set } from \"date-fns\";\n/**\n * Updates the date part (year, day and month) of a date object (base)\n * time, offset (timezone) and so on will be left untouched.\n *\n * @param  base - Date which will be used (copied) to set day, month and year.\n * @param  date - Extract day, month and year from this date object.\n * @returns Copy of base with day, month and year of date.\n */\nexport default (base: Date, date: Date | null) => {\n  // ignore falsy dates\n  if (date) {\n    // allow invalid base and set time to 0\n    base = isValid(base) ? base : new Date(Date.UTC(0, 0));\n    return set(base, {\n      year: getYear(date),\n      month: getMonth(date),\n      date: getDate(date),\n    });\n  }\n\n  return base;\n};\n","/**\n * Updates the time part (hour, minute, second and millisecond) of a date object (base)\n * date, offset (timezone) and so on will be left untouched.\n *\n * @param base - Date which will be used (copied) to set day, month and year.\n * @param date - Extract hour, minute, second and millisecond from this date object.\n * @returns Copy of base with hour, minute, second and millisecond changed.\n */\nexport default (base: Date, date: Date | null) => {\n  const d = new Date(base);\n  // ignore falsy dates\n  if (date) {\n    d.setHours(date.getHours());\n    d.setMinutes(date.getMinutes());\n    d.setSeconds(date.getSeconds());\n    d.setMilliseconds(date.getMilliseconds());\n  }\n  return d;\n};\n","import { isAfter, isBefore } from \"date-fns\";\n\nimport updateDate from \"./updateDate\";\nimport updateTime from \"./updateTime\";\n\n/**\n * Check if date is before min.\n * @param date\n * @param min\n * @param checkDate - check date part (year, day, month).\n * @param checkTime - check time part (hour, minutes etc.).\n * @returns whether limit is kept or not.\n */\nexport const isBeforeMinDate = (\n  date: Date,\n  min: Date | null,\n  checkDate: boolean,\n  checkTime: boolean,\n) => {\n  if (min) {\n    if (checkTime && checkDate) {\n      return isBefore(date, min);\n    }\n    if (checkTime) {\n      // only time is visible so ignore date: use same datre as base\n      const base = new Date(0);\n      return isBefore(updateTime(base, date), updateTime(base, min));\n    }\n    if (checkDate) {\n      // only date is visible so ignore time: use same time as base\n      const base = new Date(0);\n      return isBefore(updateDate(base, date), updateDate(base, min));\n    }\n  }\n  return false;\n};\n\n/**\n * Check\n * @param date - date to check.\n * @param max - maximum date.\n * @param checkDate - check date part (year, day, month).\n * @param checkTime - check time part (hour, minutes etc.).\n * @returns whether limit is kept or not.\n */\nexport const isAfterMaxDate = (\n  date: Date,\n  max: Date | null,\n  checkDate: boolean,\n  checkTime: boolean,\n) => {\n  if (max) {\n    if (checkTime && checkDate) {\n      return isAfter(date, max);\n    }\n    if (checkTime) {\n      // only time is visible so ignore date: use same datre as base\n      const base = new Date(0);\n      return isAfter(updateTime(base, date), updateTime(base, max));\n    }\n    if (checkDate) {\n      // use same time base\n      const base = new Date(0);\n      return isAfter(updateDate(base, date), updateDate(base, max));\n    }\n  }\n  return false;\n};\n","// Use this method to reduce many method calls to a few.\n// It's an 'immediate' implementation, so it will call the callbackindex: number once immediately an then again after the given wait.\n\ntype CallbackFunc<T> = (value: T, index: number) => void;\n\nconst debounce = <T>(callback: CallbackFunc<T>, wait: number) => {\n  let timer: ReturnType<typeof setTimeout>;\n  let lastCall = 0;\n\n  return (...args: Parameters<typeof callback>) => {\n    const [value, index] = args;\n    clearTimeout(timer);\n    const now = Date.now();\n    const timeFromLastCall = now - lastCall;\n\n    if (timeFromLastCall > wait) {\n      lastCall = now;\n      callback(value, index);\n    } else {\n      timer = setTimeout(() => {\n        lastCall = now;\n        callback(value, index);\n      }, wait);\n    }\n  };\n};\n\nexport default debounce;\n","/**\n * These definitions can be used to filter an array. Each entry should contain a method normalize which can be used to\n * compile any filter settings and a method \"test\" which takes the compiled result, additional settings and the item to\n * be matched/filtered\n * */\ninterface FilterDefinition<SearchTerm, Normalized, Testable> {\n  id: string;\n  normalize: (\n    searchTerm: SearchTerm,\n    caseSensitiveSearch: boolean,\n  ) => Normalized;\n  test: (\n    text: Testable,\n    normalizedSearchTerm: Normalized,\n    caseSensitiveSearch: boolean,\n    inverseSearch: boolean,\n  ) => boolean;\n}\n\ninterface StringTest {\n  test(str: string): boolean;\n}\n\ntype SearchFilterDefinition = FilterDefinition<string, string, string>;\ntype PatternFilterDefinition = FilterDefinition<\n  string,\n  RegExp | StringTest,\n  string\n>;\ntype TypeFilterDefinition = FilterDefinition<\n  string[],\n  StringTest,\n  string | undefined\n>;\n\nconst modeDefinitions = [\n  {\n    id: \"search\",\n    normalize(searchTerm, caseSensitiveSearch) {\n      return caseSensitiveSearch ? searchTerm : searchTerm.toLowerCase();\n    },\n    test(text, normalizedSearchTerm, caseSensitiveSearch, inverseSearch) {\n      const testText = caseSensitiveSearch ? text : text.toLowerCase();\n      const matches = testText.includes(normalizedSearchTerm);\n      return inverseSearch ? !matches : matches;\n    },\n  } satisfies SearchFilterDefinition,\n  {\n    id: \"wildcard\",\n    normalize(searchTerm, caseSensitiveSearch) {\n      // Do a regex search, explicitly matching start and end of the search term.\n      // All regex special character except from \"* and ?\" (wildcards) are escaped.\n      if (searchTerm.length > 0) {\n        const escapedSearchTerm = searchTerm.replace(\n          /[-[\\]{}()+.,\\\\^$|#\\s]/g,\n          \"\\\\$&\",\n        );\n        const wildcardSearchTerm = escapedSearchTerm\n          .replace(/\\*/g, \".*\")\n          .replace(/\\?/g, \".?\");\n        searchTerm = `^${wildcardSearchTerm}$`;\n      } else {\n        return { test: () => false };\n      }\n      try {\n        const flags = caseSensitiveSearch ? \"\" : \"i\";\n        return new RegExp(searchTerm, flags);\n      } catch (_error) {\n        // In case of an invalid regular expression, an impossible\n        // regex is returned, not matching anything.\n        return /$^/;\n      }\n    },\n    test(text, normalizedSearchTerm, caseSensitiveSearch, inverseSearch) {\n      const matches = normalizedSearchTerm.test(text);\n      return inverseSearch ? !matches : matches;\n    },\n  } satisfies PatternFilterDefinition,\n  {\n    id: \"regex\",\n    normalize(searchTerm, caseSensitiveSearch) {\n      try {\n        const flags = caseSensitiveSearch ? \"\" : \"i\";\n        return new RegExp(`^(${searchTerm})$`, flags);\n      } catch (_error) {\n        // In case of an invalid regular expression, an impossible\n        // regex is returned, not matching anything.\n        return /$^/;\n      }\n    },\n    test(text, normalizedSearchTerm, caseSensitiveSearch, inverseSearch) {\n      const matches = normalizedSearchTerm.test(text);\n      return inverseSearch ? !matches : matches;\n    },\n  } satisfies PatternFilterDefinition,\n  {\n    id: \"type\",\n    normalize(selectedTypes) {\n      return { test: (type: string) => selectedTypes.includes(type) };\n    },\n    test(type, normalizedSearchTerm) {\n      if (typeof type === \"undefined\") {\n        return false;\n      }\n      return normalizedSearchTerm.test(type);\n    },\n  } satisfies TypeFilterDefinition,\n];\n\n// convert [{id: \"key1\", text: \"asdf\"}, ...] to {\"key1\": {id:\"key1\", text: \"asdf\"} ... }\nexport const filters: Record<\n  string,\n  FilterDefinition<unknown, unknown, unknown>\n> = Object.assign({}, ...modeDefinitions.map((obj) => ({ [obj.id]: obj })));\n","/**\n * Get the users local timezone.\n *\n * @returns current users timezone (browser based) tz db string (e. g. Europe/Berlin).\n */\n// eslint-disable-next-line new-cap\nexport default () => Intl.DateTimeFormat().resolvedOptions().timeZone;\n","import prettyBytes from \"pretty-bytes\";\n\nimport getLocalTimeZone from \"./localTimezone\";\n/**\n * Converts the specified date String to human readable text containing the day, month, and year.\n * Example: '2018-07-31T09:44:31+00:00' => 'Jul 31, 2018'\n *\n * @param dateString String representation of the Date to format\n * @param useTimeZone to set the timeZone where the user is located, and display local date and time\n * @returns human readable date String\n */\nexport const formatDateString = (\n  dateString: string | number,\n  useTimeZone = false,\n) => {\n  const date = new Date(dateString);\n\n  // @ts-expect-error Argument of type 'Date' is not assignable to parameter of type 'number'\n  if (isNaN(date)) {\n    throw Error(\"Invalid Date format\");\n  }\n\n  const baseDateOptions: Intl.DateTimeFormatOptions = {\n    day: \"numeric\",\n    month: \"short\",\n    year: \"numeric\",\n  };\n\n  // This only works for the default locale of en-US, as support of other locals in node js might not be available\n  // See for example this issue https://github.com/nodejs/node/issues/8500\n  const dateOptions: Intl.DateTimeFormatOptions = useTimeZone\n    ? { ...baseDateOptions, timeZone: getLocalTimeZone() }\n    : baseDateOptions;\n\n  return date.toLocaleDateString(\"en-US\", dateOptions);\n};\n\n/**\n * Converts the specified time String to human readable text containing the hour (12-hour) and minute.\n * Example: '2018-07-31T09:44:31+00:00' => '9:44 AM'\n *\n * @param timeString String representation of the Date (including time) to format\n * @param useTimeZone to set the timeZone where the user is located, and display local date and time\n * @returns human readable time String\n */\nexport const formatTimeString = (\n  timeString: string | number,\n  useTimeZone = false,\n) => {\n  const time = new Date(timeString);\n\n  // @ts-expect-error Argument of type 'Date' is not assignable to parameter of type 'number'\n  if (isNaN(time)) {\n    throw Error(\"Invalid Date format\");\n  }\n\n  // This only works for the default locale of en-US, as support of other locals in node js might not be available\n  // See for example this issue https://github.com/nodejs/node/issues/8500\n  const baseTimeOptions: Intl.DateTimeFormatOptions = {\n    hour: \"numeric\",\n    minute: \"2-digit\",\n  };\n\n  const timeOptions: Intl.DateTimeFormatOptions = useTimeZone\n    ? { ...baseTimeOptions, timeZone: getLocalTimeZone() }\n    : baseTimeOptions;\n\n  return time.toLocaleTimeString(\"en-US\", timeOptions);\n};\n\n/**\n * Converts the specified time String to human readable text containing the date (day, month, year) and time (hour,\n * minute; 12-hour).\n * Example: '2018-07-31T09:44:31+00:00' => 'Jul 31, 2018 9:44 AM'\n *\n * @param dateTimeString String representation of the Date (including time and date) to format\n * @param useTimeZone to set the timeZone where the user is located, and display local date and time\n * @returns human readable date/time String\n */\nexport const formatDateTimeString = (\n  dateTimeString: string | number,\n  useTimeZone = false,\n) => {\n  return `${formatDateString(dateTimeString, useTimeZone)} ${formatTimeString(\n    dateTimeString,\n    useTimeZone,\n  )}`;\n};\n\n/**\n * Converts the specified date and time to the user time zone with option to display (day, month, year) only or with time (hour,\n * minute; 12-hour).\n *\n * @param showTime String representation of the Date to convert and format\n * @param String | number} date String representation of the Date to convert and format\n * @returns human readable date/time String converted to user time zone\n */\nexport const formatLocalDateTimeString = (date: string, showTime: boolean) =>\n  showTime ? formatDateTimeString(date, true) : formatDateString(date, true);\n\nexport const formatFileSize = (bytes: number): string => {\n  const safeBytes = Number.isFinite(bytes) && bytes >= 0 ? bytes : 0;\n\n  return prettyBytes(safeBytes);\n};\n","const getDeepActiveElement = () => {\n  let element = document?.activeElement;\n  while (element?.shadowRoot) {\n    element = element?.shadowRoot?.activeElement;\n  }\n  return element;\n};\n\nexport default getDeepActiveElement;\n","/**\n * Since (a % b) yields a negative outcome for negative a, we need this method in order\n *  to correctly compute wrapped around indices in lists\n * @param {number} index an arbitrary integer\n * @param {number} length a positive integer\n * @returns {number} the non-negative modulo outcome\n */\nexport default (index: number, length: number) =>\n  ((index % length) + length) % length;\n","export type Period = {\n  negative: boolean;\n  years: number;\n  months: number;\n  weeks: number;\n  days: number;\n};\n\nexport type Duration = {\n  negative: boolean;\n  hours: number;\n  minutes: number;\n  seconds: number;\n  milliseconds: number;\n};\n\ntype AllowedIntervalTypes = \"DATE\" | \"TIME\";\ntype AllowedIntervalTypesOrEither = AllowedIntervalTypes | \"DATE_OR_TIME\";\n\ntype IntervalStringValidationResult =\n  | {\n      valid: true;\n      type: AllowedIntervalTypes;\n      negative: boolean;\n    }\n  | { valid: false };\n\nexport type PeriodOrDuration =\n  | {\n      interval: Period;\n      type: \"DATE\";\n    }\n  | {\n      interval: Duration;\n      type: \"TIME\";\n    };\n\nconst extractPeriodFromRegexMatch = (\n  negative: boolean,\n  match: RegExpExecArray,\n): Period => {\n  return {\n    negative,\n    years: parseInt(match[1] ?? \"0\", 10),\n    months: parseInt(match[2] ?? \"0\", 10),\n    weeks: parseInt(match[3] ?? \"0\", 10),\n    days: parseInt(match[4] ?? \"0\", 10),\n  };\n};\n\nconst extractDurationFromRegexMatch = (\n  negative: boolean,\n  match: RegExpExecArray,\n): Duration => {\n  // eslint-disable-next-line no-magic-numbers\n  const milliseconds = parseInt(match[4]?.padEnd(3, \"0\") ?? \"0\", 10);\n\n  return {\n    negative,\n    hours: parseInt(match[1] ?? \"0\", 10),\n    minutes: parseInt(match[2] ?? \"0\", 10),\n    seconds: parseInt(match[3] ?? \"0\", 10),\n    milliseconds,\n  };\n};\n\nexport const isZero = (interval: PeriodOrDuration): boolean => {\n  if (interval.type === \"DATE\") {\n    return (\n      interval.interval.years === 0 &&\n      interval.interval.months === 0 &&\n      interval.interval.weeks === 0 &&\n      interval.interval.days === 0\n    );\n  } else {\n    return (\n      interval.interval.hours === 0 &&\n      interval.interval.minutes === 0 &&\n      interval.interval.seconds === 0 &&\n      interval.interval.milliseconds === 0\n    );\n  }\n};\n\n/**\n * Take an interval object and convert it to an ISO duration or period string. All parts of the\n * relevant part of the Interval object are included in the output, even if they are zero.\n *\n * Technically the ISO standard allows to mix period and duration parts, but we don't support that\n * here because it's incredibly hard to deal with all the edge cases. Maybe in a future ticket.\n *\n * The output here is allowed to be negative, in which case the minus sign is prepended to the\n * output.\n *\n * @param toFormat The PeriodOrDuration object to format\n */\nexport const formatIntervalToISOIntervalString = (\n  toFormat: PeriodOrDuration,\n): string => {\n  let output = \"P\";\n\n  if (toFormat.type === \"DATE\") {\n    output += `${toFormat.interval.years}Y${toFormat.interval.months}M${toFormat.interval.weeks}W${toFormat.interval.days}D`;\n  } else {\n    output += `T${toFormat.interval.hours}H${toFormat.interval.minutes}M${toFormat.interval.seconds}.${toFormat.interval.milliseconds\n      .toString()\n      // eslint-disable-next-line no-magic-numbers\n      .padStart(3, \"0\")}S`;\n  }\n\n  if (toFormat.interval.negative) {\n    output = `-${output}`;\n  }\n  return output;\n};\n\n/**\n * Take an interval object and convert it to a human readable string. Only non-zero parts are\n * included in the output (unless all parts are 0).\n *\n * The output here is allowed to be negative, in which case the minus sign is prepended to the\n * output and we wrap the whole thing in brackets e.g. -(1 year 2 days).\n *\n * @param toFormat The PeriodOrDuration object to format\n */\nexport const formatIntervalToHumanReadableIntervalString = (\n  toFormat: PeriodOrDuration,\n): string => {\n  const formatPart = (value: number, unit: string): string => {\n    if (value === 0) {\n      return \"\";\n    } else if (value === 1) {\n      return `${value} ${unit} `;\n    } else {\n      return `${value} ${unit}s `;\n    }\n  };\n\n  let output = \"\";\n\n  if (toFormat.type === \"DATE\") {\n    if (isZero(toFormat)) {\n      return \"0 days\";\n    }\n\n    output += formatPart(toFormat.interval.years, \"year\");\n    output += formatPart(toFormat.interval.months, \"month\");\n    output += formatPart(toFormat.interval.weeks, \"week\");\n    output += formatPart(toFormat.interval.days, \"day\");\n  } else {\n    if (isZero(toFormat)) {\n      return \"0 seconds\";\n    }\n\n    output += formatPart(toFormat.interval.hours, \"hour\");\n    output += formatPart(toFormat.interval.minutes, \"minute\");\n\n    const milliSecondsZero = toFormat.interval.milliseconds === 0;\n    if (toFormat.interval.seconds !== 0 || !milliSecondsZero) {\n      if (milliSecondsZero) {\n        output += formatPart(toFormat.interval.seconds, \"second\");\n      } else {\n        output += `${toFormat.interval.seconds}.${toFormat.interval.milliseconds.toString().padStart(3, \"0\")} seconds `; // eslint-disable-line no-magic-numbers\n      }\n    }\n  }\n\n  if (toFormat.interval.negative) {\n    output = `-(${output.trim()})`;\n  }\n\n  return output.trim();\n};\n\nconst yearsPart = \"(\\\\d+)\\\\s*y(?:ears?)?\";\nconst monthsPart = \"(\\\\d+)\\\\s*m(?:o(?:nths?)?)?\";\nconst weeksPart = \"(\\\\d+)\\\\s*w(?:eeks?)?\";\nconst daysPart = \"(\\\\d+)\\\\s*d(?:ays?)?\";\nconst hoursPart = \"(\\\\d+)\\\\s*h(?:ours?)?\";\nconst minutesPart = \"(\\\\d+)\\\\s*m(?:in(?:s|utes?)?)?\";\nconst secondsPart = \"(\\\\d+)(?:[,.](\\\\d{1,3}))?\\\\s*s(?:ec(?:s|onds?)?)?\";\n\n/**\n * Matches a human readable period string, e.g. \"1y 2mo 3weeks 4day\" (each part is optional)\n */\nconst humanReadablePeriodRegex = new RegExp(\n  `^(?:${yearsPart})?\\\\s*(?:${monthsPart})?\\\\s*(?:${weeksPart})?\\\\s*(?:${daysPart})?\\\\s*$`,\n  \"i\",\n);\n\n/**\n * Matches a human readable duration string, e.g. \"1h 2m 3.456s\" (each part is optional)\n */\nconst humanReadableDurationRegex = new RegExp(\n  `^(?:${hoursPart})?\\\\s*(?:${minutesPart})?\\\\s*(?:${secondsPart})?$`,\n  \"i\",\n);\n\n/**\n * Matches a negative human readable period string, e.g. \"-(1y 2mo 3weeks 4day)\" (each part is optional)\n */\nconst negativeHumanReadablePeriodRegex = new RegExp(\n  `^\\\\s*-\\\\s*\\\\(\\\\s*${humanReadablePeriodRegex.source.replace(/[$^]/g, \"\")}\\\\s*\\\\)\\\\s*$`,\n  \"i\",\n);\n\n/**\n * Matches a negative human readable period string with one field like \"-1y\" or \"-1w\"\n */\nconst negativeHumanReadablePeriodRegexWithSingleField = new RegExp(\n  `^\\\\s*-\\\\s*(?:\\\\s*${yearsPart}|${monthsPart}|${weeksPart}|${daysPart})\\\\s*$`,\n  \"i\",\n);\n\n/**\n * Matches a negative human readable duration string, e.g. \"-(1h 2m 3.456s)\" (each part is optional)\n */\nconst negativeHumanReadableDurationRegex = new RegExp(\n  `^\\\\s*-\\\\s*\\\\(\\\\s*${humanReadableDurationRegex.source.replace(/[$^]/g, \"\")}\\\\s*\\\\)\\\\s*$`,\n  \"i\",\n);\n\n/**\n * Matches a negative human readable duration string with one field like \"-1h\" or \"-1.5s\"\n */\nconst negativeHumanReadableDurationRegexWithSingleField = new RegExp(\n  `^\\\\s*-\\\\s*(?:\\\\s*${hoursPart}|${minutesPart}|${secondsPart})\\\\s*$`,\n  \"i\",\n);\n\n/**\n * Try to parse a human readable interval string into an Interval object. Any parts not specified\n * are assumed to be zero. Note that the string must be either a period or a duration, not a mix of\n * both. So for example, \"1y 2mo 3weeks 4day\" is fine, as is \"1h 2m 3.456s\". However, \"1y 2mo 1sec\"\n * is not, since it's a mix of both.\n *\n * Negative intervals are allowed, although if multiple fields are provided the string must include\n * brackets, so \"-(1y 2mo)\" is also valid, as is \"-5 seconds\".\n *\n * The string is required to have at least some content, any string that is blank will throw an error.\n *\n * @param intervalString The human readable time string\n */\nexport const parseHumanReadableIntervalString = (\n  intervalString: string,\n): PeriodOrDuration => {\n  intervalString = intervalString?.trim();\n\n  if (!intervalString) {\n    throw new Error(\"Empty interval string\");\n  }\n\n  const matchPositivePeriod = humanReadablePeriodRegex.exec(intervalString);\n  const matchNegativePeriod =\n    negativeHumanReadablePeriodRegex.exec(intervalString) ??\n    negativeHumanReadablePeriodRegexWithSingleField.exec(intervalString);\n  const matchPositiveDuration = humanReadableDurationRegex.exec(intervalString);\n  const matchNegativeDuration =\n    negativeHumanReadableDurationRegex.exec(intervalString) ??\n    negativeHumanReadableDurationRegexWithSingleField.exec(intervalString);\n\n  const matchPeriod = matchPositivePeriod ?? matchNegativePeriod;\n  const matchDuration = matchPositiveDuration ?? matchNegativeDuration;\n  const negative = (matchNegativePeriod ?? matchNegativeDuration) !== null;\n\n  // I think this will happen only for the string \"1M\" or similar\n  if (matchDuration && matchPeriod) {\n    throw new Error(\"Ambiguous time format\");\n  }\n\n  if (matchPeriod) {\n    return {\n      type: \"DATE\",\n      interval: extractPeriodFromRegexMatch(negative, matchPeriod),\n    };\n  } else if (matchDuration) {\n    return {\n      type: \"TIME\",\n      interval: extractDurationFromRegexMatch(negative, matchDuration),\n    };\n  } else {\n    throw new Error(`Invalid human readable time: ${intervalString}`);\n  }\n};\n\n/**\n * Check if the given string can be understood as a human readable duration or period string. The\n * type parameter specifies whether the string should be a date, time, or either.\n *\n * @param time the string to check\n * @param expectedType the type of the string - either \"DATE\", \"TIME\", or \"ANY\"\n */\nexport const isValidHumanReadableIntervalString = (\n  time: string,\n  expectedType: AllowedIntervalTypesOrEither,\n): IntervalStringValidationResult => {\n  try {\n    const validationResult = parseHumanReadableIntervalString(time);\n    const actualType = validationResult.type;\n    const negative = validationResult.interval.negative;\n\n    if (actualType === expectedType || expectedType === \"DATE_OR_TIME\") {\n      return {\n        valid: true,\n        type: actualType,\n        negative,\n      };\n    } else {\n      return { valid: false };\n    }\n  } catch (_e) {\n    return { valid: false };\n  }\n};\n\n/**\n * Convert an ISO duration OR period string to an Interval object. So for example,\n * \"P1Y2M3W4D\" is fine, as is \"PT1H2M3.456S\". However, \"P1Y2M3W4D1H2M3.456S\" is not, since\n * it's a mix of both. We're more forgiving than the ISO standard, so we allow for missing parts.\n * Also, the string is allowed to be negative, so \"-P1Y2M3W4D\" is also valid.\n *\n * The string is required to have at least some content, so the strings \"\", \"P\", and \"PT\" are\n * considered invalid (also if they start with a -).\n *\n * @param isoString The ISO duration or period string.\n */\nexport const parseISOIntervalString = (isoString: string): PeriodOrDuration => {\n  isoString = isoString?.trim();\n\n  if ([\"\", \"P\", \"PT\", \"-\", \"-P\", \"-PT\"].includes(isoString)) {\n    throw new Error(\"Empty ISO duration\");\n  }\n\n  const periodRegex = /^-?P(?:(\\d+)Y)?(?:(\\d+)M)?(?:(\\d+)W)?(?:(\\d+)D)?$/;\n  const durationRegex =\n    /^-?PT(?:(\\d+)H)?(?:(\\d+)M)?(?:(\\d+)(?:[,.](\\d{1,3}))?S)?$/;\n\n  const matchPeriod = periodRegex.exec(isoString);\n  const matchDuration = durationRegex.exec(isoString);\n\n  if (matchPeriod) {\n    return {\n      type: \"DATE\",\n      interval: extractPeriodFromRegexMatch(\n        isoString.startsWith(\"-\"),\n        matchPeriod,\n      ),\n    };\n  } else if (matchDuration) {\n    return {\n      type: \"TIME\",\n      interval: extractDurationFromRegexMatch(\n        isoString.startsWith(\"-\"),\n        matchDuration,\n      ),\n    };\n  } else {\n    throw new Error(`Invalid ISO duration: ${isoString}`);\n  }\n};\n\n/**\n * Check if the given string is a valid duration or period ISO string. The type parameter\n * specifies whether the string should be a date, time, or either.\n *\n * @param isoString the string to check\n * @param type the type of the string - either \"DATE\", \"TIME\", or \"ANY\"\n */\nexport const isValidISOIntervalString = (\n  isoString: string,\n  type: AllowedIntervalTypesOrEither,\n): IntervalStringValidationResult => {\n  try {\n    const validationResult = parseISOIntervalString(isoString);\n    const actualType = validationResult.type;\n    const negative = validationResult.interval.negative;\n\n    if (actualType === type || type === \"DATE_OR_TIME\") {\n      return {\n        valid: true,\n        type: actualType,\n        negative,\n      };\n    } else {\n      return { valid: false };\n    }\n  } catch (_e) {\n    return { valid: false };\n  }\n};\n\n/**\n * Try to convert an interval string to an Interval object. The string can be either an ISO\n * duration/period string or a human readable string. If the string is not valid, an error is\n * thrown.\n *\n * @param time the time string, either ISO or human readable\n */\nexport const parseGenericIntervalString = (time: string): PeriodOrDuration => {\n  const validISO = isValidISOIntervalString(time, \"DATE_OR_TIME\");\n  const validHumanReadable = isValidHumanReadableIntervalString(\n    time,\n    \"DATE_OR_TIME\",\n  );\n  if (validISO.valid) {\n    return parseISOIntervalString(time);\n  } else if (validHumanReadable.valid) {\n    return parseHumanReadableIntervalString(time);\n  } else {\n    throw new Error(`Invalid interval string: ${time}`);\n  }\n};\n\n/**\n * Check if the given string is a valid interval string, either human readable or ISO. The type parameter\n * specifies whether the string should be a period, duration, or either.\n *\n * @param time the time string to check\n * @param type the type of the string - either \"DATE\", \"TIME\", or \"ANY\"\n */\nexport const isValidIntervalString = (\n  time: string,\n  type: AllowedIntervalTypesOrEither,\n): IntervalStringValidationResult => {\n  const validISO = isValidISOIntervalString(time, type);\n  const validHumanReadable = isValidHumanReadableIntervalString(time, type);\n  if (validISO.valid) {\n    return validISO;\n  } else if (validHumanReadable.valid) {\n    return validHumanReadable;\n  } else {\n    return { valid: false };\n  }\n};\n","/**\n * Count the number of integer digits for a given number.\n *\n * @param input number.\n * @returns number of integer digits x has. 1234 = 4 but 1234.44 is also 4.\n */\nexport default (input: number) =>\n  Math.max(Math.floor(Math.log10(Math.abs(input))), 0) + 1;\n","export class AbortError extends Error {}\n\n/**\n * Helper to create an abortable promise. Returns an AbortController and a Function\n * that you can pass your async handler to. Whenever the AbortController signal is\n * aborted then the async handler's promise will reject with an AbortError\n *\n * Example:\n * ```\n * import { abortUtils } from \"@knime/utils\"\n * const myFetchCall = async (params...) => {...};\n *\n * try {\n *   const { runAbortablePromise, abortController } = createAbortablePromise(() =>\n *     myFetchCall(params...),\n *   );\n * } catch (e) {\n *   if (e instanceof abortUtils.AbortError) {\n *     console.info('ignore due to abort');\n *     return;\n *   }\n * }\n *\n * // somewhere else (while request is in-flight)\n * abortController.abort(new abortUtils.AbortError('reason here'))\n * ```\n */\nexport const createAbortablePromise = () => {\n  const abortController: AbortController = new AbortController();\n\n  const runAbortablePromise = <T = unknown>(request: () => Promise<T>) => {\n    return new Promise<T>((resolve, reject) => {\n      // abort logic\n      const abortListener = ({ target }: Event) => {\n        abortController.signal.removeEventListener(\"abort\", abortListener);\n        const reason = (target as AbortSignal).reason;\n        reject(reason instanceof AbortError ? reason : new AbortError(reason));\n      };\n\n      // the actual call\n      request()\n        .then(resolve)\n        .catch((error) => {\n          if (error instanceof AbortError) {\n            return;\n          }\n\n          reject(error);\n        });\n\n      abortController.signal.addEventListener(\"abort\", abortListener);\n    });\n  };\n\n  return { abortController, runAbortablePromise };\n};\n","export type UnwrappedPromise<T = unknown> = {\n  resolve: (value: T | PromiseLike<T>) => void;\n  reject: (reason?: unknown) => void;\n  promise: Promise<T>;\n};\n\nexport const createUnwrappedPromise = <T>(): UnwrappedPromise<T> => {\n  let resolve: (value: T | PromiseLike<T>) => void = () => {};\n  let reject: (reason?: unknown) => void = () => {};\n\n  const promise = new Promise<T>((res, rej) => {\n    resolve = res;\n    reject = rej;\n  });\n\n  return { resolve, reject, promise };\n};\n","/**\n * Returns promise that resolves after ms.\n */\nexport default function sleep(ms: number) {\n  return new Promise((resolve) => setTimeout(resolve, ms));\n}\n","import sleep from \"../sleep\";\n\nexport const DEFAULT_RETRY_DELAY_MS = 0;\nexport const DEFAULT_RETRY_COUNT = 5;\n\n/**\n * Helper to add retry capability to an async function\n * @param fn async function\n * @param retryCount max number of retries. defaults to 5\n * @param retryDelayMS delay in-between retries in millisecs. defaults to 0\n * @param excludeError predicate fn to exclude specific errors from causing a retry\n */\nexport async function retryPromise<T>({\n  fn,\n  retryCount = DEFAULT_RETRY_COUNT,\n  retryDelayMS = DEFAULT_RETRY_DELAY_MS,\n  excludeError,\n}: {\n  fn: () => Promise<T>;\n  retryCount?: number;\n  retryDelayMS?: number;\n  excludeError?: (error: Error) => boolean;\n}) {\n  try {\n    return await fn();\n  } catch (error) {\n    if (excludeError?.(error as Error)) {\n      throw error;\n    }\n\n    if (retryCount > 0) {\n      await sleep(retryDelayMS);\n\n      // eslint-disable-next-line no-return-await\n      return await retryPromise({\n        fn,\n        retryCount: retryCount - 1,\n        retryDelayMS,\n        excludeError,\n      });\n    }\n\n    throw error;\n  }\n}\n","export * from \"./createAbortablePromise\";\nexport * from \"./createUnwrappedPromise\";\nexport * from \"./retryPromise\";\n","import DomPurify from \"dompurify\";\n\nconst ALLOWED_TAGS = [\n  \"p\",\n  \"div\",\n  \"h1\",\n  \"h2\",\n  \"h3\",\n  \"h4\",\n  \"h5\",\n  \"h6\",\n  \"ul\",\n  \"ol\",\n  \"li\",\n  \"blockquote\",\n  \"b\",\n  \"i\",\n  \"s\",\n  \"u\",\n  \"sup\",\n  \"sub\",\n  \"ins\",\n  \"del\",\n  \"strong\",\n  \"strike\",\n  \"tt\",\n  \"code\",\n  \"big\",\n  \"small\",\n  \"br\",\n  \"span\",\n  \"em\",\n];\n\n/**\n * Sanitizes Raw HTML and only allow specific tags to be used, as per OWASP standards.\n * @param rawHTML\n * @param options.allowStyleAttribute - Allow the style attribute on elements\n * @param options.allowHyperlinks - Allow anchor tags with href attribute\n * @returns sanitized html\n */\nconst sanitizeHTML = (\n  rawHTML: string,\n  options: { allowStyleAttribute?: boolean; allowHyperlinks?: boolean } = {\n    allowStyleAttribute: false,\n    allowHyperlinks: false,\n  },\n) => {\n  const { allowStyleAttribute, allowHyperlinks } = options;\n  const ALLOWED_ATTR = [\n    ...(allowStyleAttribute ? [\"style\"] : []),\n    ...(allowHyperlinks ? [\"href\"] : []),\n  ];\n  const allowedTags = allowHyperlinks ? [...ALLOWED_TAGS, \"a\"] : ALLOWED_TAGS;\n\n  return DomPurify.sanitize(rawHTML, {\n    ALLOWED_TAGS: allowedTags,\n    ALLOWED_ATTR,\n  });\n};\n\n/**\n * Removes any HTML tag from the input string. Keeps HTML entities\n * (e.g &nbsp; because these can be considered plain text)\n * @param rawHTML\n * @returns plain text\n */\nconst stripHTML = (rawHTML: string) => {\n  return DomPurify.sanitize(rawHTML, { ALLOWED_TAGS: [], ALLOWED_ATTR: [] });\n};\n\nexport const sanitization = { sanitizeHTML, stripHTML };\n","const defaultMaxLength = 160;\n\n// truncates a string to a given max length\nexport default (string = \"\", maxLength = defaultMaxLength) => {\n  const dots = string.length > maxLength ? \"…\" : \"\";\n  return `${string.substring(0, maxLength - 1)}${dots}`;\n};\n","/**\n * Gets the file extension\n * @param nameOrPath can take a full file name (e.g \"file.txt\") or a path to a file\n * (e.g \"file://path/to/file.txt\" OR \"/path/to/file.txt\")\n * @returns just the file extension (e.g \"txt\")\n */\nexport const getFileExtension = (nameOrPath: string): string => {\n  const basename = nameOrPath.split(/[\\\\/]/).pop() ?? \"\";\n\n  const parts = basename.split(\".\");\n\n  if (basename === \"\" || parts.length === 1) {\n    return \"\";\n  }\n\n  return parts.at(-1) ?? \"\";\n};\n\n/**\n * Metadata for .knar files, which corresponds to exported KNIME Workflow Groups\n * or Components\n */\nconst KNAR = Object.freeze({\n  extension: \"knar\",\n  mimeType: \"application/vnd.knime.workflow-group+zip\",\n  matches(file: File) {\n    const extension = getFileExtension(file.name);\n    return extension === this.extension;\n  },\n});\n\n/**\n * Metadata for .knwf files, which corresponds to exported KNIME Workflows\n */\nconst KNWF = Object.freeze({\n  extension: \"knwf\",\n  mimeType: \"application/vnd.knime.workflow+zip\",\n  matches(file: File) {\n    const extension = getFileExtension(file.name);\n    return extension === this.extension;\n  },\n  /**\n   * Gets the name of a .knwf file without the extension. If the file is not\n   * matched as a .knwf file then this function will return the default value,\n   * which is empty string (\"\") if param is not provided\n   */\n  getNameOrDefault(file: File, defaultValue = \"\"): string {\n    if (!this.matches(file)) {\n      return defaultValue;\n    }\n\n    return file.name.replace(`.${this.extension}`, \"\");\n  },\n});\n\nexport const knimeFileFormats = { KNAR, KNWF };\n\n/**\n * Gets the mime type from a given file. Defaults to `application/octet-stream`\n * if mimeType cannot be detected\n * @param file File\n * @returns mimeType\n */\nexport const getFileMimeType = (file: File): string => {\n  const DEFAULT_MIMETYPE = \"application/octet-stream\";\n\n  const extension = getFileExtension(file.name);\n\n  if (!extension) {\n    return DEFAULT_MIMETYPE;\n  }\n\n  if (KNWF.matches(file)) {\n    return KNWF.mimeType;\n  }\n\n  if (KNAR.matches(file)) {\n    return KNAR.mimeType;\n  }\n\n  // file has extension but unrecognizable mime type\n  if (!file.type) {\n    return DEFAULT_MIMETYPE;\n  }\n\n  return file.type;\n};\n","/**\n * Platforms that influence how modifier keys are rendered. macOS substitutes\n * dedicated glyphs (`⌘`, `⌥`, `⇧`, …), every other platform uses the textual\n * rendering (`Ctrl`, `Alt`, `Shift`, …).\n */\nexport const hotkeyPlatform = {\n  MAC_OS: \"macOS\",\n  OTHER: \"other\",\n} as const;\n\nexport const hotkeyPlatforms = Object.values(hotkeyPlatform);\n","/**\n *\n * @returns true if the platform of the user is Mac\n */\nexport const isMac = (): boolean =>\n  navigator?.userAgent?.toLowerCase()?.includes(\"mac\");\n\n/**\n *\n * @returns true if the platform of the user is Windows\n */\nexport const isWindows = (): boolean =>\n  navigator?.userAgent?.toLowerCase()?.includes(\"windows\");\n","import { isMac } from \"../platform/navigator\";\n\nimport { hotkeyPlatform } from \"./enums\";\nimport type { Hotkey, HotkeyPlatform } from \"./types\";\n\nconst globalKeyMap = {\n  ArrowUp: \"↑\",\n  ArrowDown: \"↓\",\n  ArrowLeft: \"←\",\n  ArrowRight: \"→\",\n  Enter: \"↵\",\n  \" \": \"Space\", // we use event.key and there space is an actual space not the code \"Space\"\n  CtrlOrCmd: \"Ctrl\",\n} as const;\n\nconst MacOSkeyMap = {\n  Shift: \"⇧\",\n  Delete: \"⌫\",\n  CtrlOrCmd: \"⌘\",\n  Ctrl: \"⌃\",\n  Alt: \"⌥\",\n  Enter: \"↩\",\n} as const;\n\ntype KeyFormatMap = typeof MacOSkeyMap | typeof globalKeyMap;\n\n/**\n * Returns a string representation of a single hotkey. Replaces some special key names with symbols.\n *\n * By default the platform is auto-detected from the user agent via `isMac()`.\n * Pass `platform` to force a specific platform's glyphs — useful for SSR,\n * tests, or rendering multiple platforms on the same page.\n */\nexport const formatHotkey = (\n  hotkey: Hotkey,\n  platform?: HotkeyPlatform,\n): string => {\n  /**\n   * Returns the symbol corresponding to the `key` based on the given\n   * `formatMap`. Otherwise, if not found, returns the same `key` value given\n   */\n  const mapSymbols = (formatMap: KeyFormatMap) => (key: Hotkey) =>\n    formatMap[key as keyof KeyFormatMap] ?? key;\n\n  /**\n   * Pipe function implementation. Receives a list of functions to execute in order\n   * and will pipe the parameter passed at the end to each function returning the final output\n   */\n  const pipe = <T extends () => string>(\n    ...fns: Array<(...args: Hotkey[]) => ReturnType<T>>\n  ) =>\n    fns.reduce(\n      (f, g) => (arg) => g(f(arg)),\n      (arg: Hotkey) => arg as ReturnType<T>,\n    );\n\n  const macKeyFormatter = pipe(\n    mapSymbols(MacOSkeyMap),\n    mapSymbols(globalKeyMap),\n  );\n\n  const generalKeyFormatter = mapSymbols(globalKeyMap);\n\n  const useMacFormatter =\n    platform === undefined ? isMac() : platform === hotkeyPlatform.MAC_OS;\n  return useMacFormatter\n    ? macKeyFormatter(hotkey)\n    : generalKeyFormatter(hotkey);\n};\n\nexport const getDefaultSeparator = () => (isMac() ? \" \" : \"+\");\n\n/**\n * Returns a string representation of a list of hotkeys. Replaces some special key names with symbols\n */\nexport const formatHotkeys = (\n  hotkeys: Array<Hotkey>,\n  getSeparator = getDefaultSeparator,\n) => hotkeys.map((hotkey) => formatHotkey(hotkey)).join(getSeparator());\n\n/**\n * Appends a formatted hotkey shortcut to the given string. Useful for tooltips\n */\nexport const textWithHotkeys = (text: string, hotkeys: Array<Hotkey>) => {\n  return `${text} – ${formatHotkeys(hotkeys)}`;\n};\n","import * as navigatorUtils from \"../platform/navigator\";\n\nimport type { Hotkey } from \"./types\";\n\n/**\n * Checks whether a pressed `Digit` key falls within a numeric hotkey range such\n * as `1-9`.\n * @param keyCode - The `KeyboardEvent.code` to check (e.g. `Digit5`).\n * @param hotkey - The hotkey token, expected to be a single-digit range like `1-9`.\n * @returns True if the pressed digit lies within the inclusive range.\n */\nconst isDigitKeyInRange = (keyCode: string, hotkey: Hotkey): boolean => {\n  // Digit keys exist from 0 to 9, so valid ranges always have length 3\n  const digitRangeLength = 3;\n  if (hotkey.length !== digitRangeLength || !keyCode?.startsWith(\"Digit\")) {\n    return false;\n  }\n\n  const keyNumber = Number(keyCode.slice(\"Digit\".length));\n  const [lower, upper] = hotkey.split(\"-\");\n\n  return (\n    Boolean(lower) &&\n    Boolean(upper) &&\n    Number.parseInt(lower, 10) <= keyNumber &&\n    keyNumber <= Number.parseInt(upper, 10)\n  );\n};\n\n/**\n * Checks whether a keyboard event matches a hotkey definition. The last token is\n * treated as the character; any preceding tokens are modifiers. The special\n * `CtrlOrCmd` modifier resolves to the platform's primary modifier (Meta/`⌘` on\n * macOS, Ctrl elsewhere).\n * @param event - The keyboard event to check.\n * @param hotkeys - The ordered hotkey tokens (modifiers followed by the character).\n * @returns True if the event matches the given hotkey, otherwise false.\n */\nexport const match = (event: KeyboardEvent, hotkeys: Hotkey[]): boolean => {\n  const { key, code, metaKey, ctrlKey, shiftKey, altKey } = event;\n\n  const modifiers = hotkeys.slice(); // copy so pop() doesn't mutate the caller's array\n  const character = modifiers.pop() ?? \"\";\n\n  // our special CtrlOrCmd has to match \"Command ⌘\" (metaKey) on Mac, and Ctrl-Key on other systems\n  const ctrlOrMeta = navigatorUtils.isMac() ? \"Meta\" : \"Ctrl\";\n  const platformModifiers = new Set(\n    modifiers.map((modifier) =>\n      modifier === \"CtrlOrCmd\" ? ctrlOrMeta : modifier,\n    ),\n  );\n\n  const metaMatches = Boolean(metaKey) === platformModifiers.has(\"Meta\");\n  const ctrlMatches = Boolean(ctrlKey) === platformModifiers.has(\"Ctrl\");\n  const shiftMatches = Boolean(shiftKey) === platformModifiers.has(\"Shift\");\n  const altMatches = Boolean(altKey) === platformModifiers.has(\"Alt\");\n\n  const keysMatch =\n    // keys are matched case insensitively\n    key.toUpperCase() === character.toUpperCase() ||\n    (character.includes(\"-\") && isDigitKeyInRange(code, character)) ||\n    // on mac 'backspace' can be used instead of delete\n    (navigatorUtils.isMac() && character === \"Delete\" && key === \"Backspace\");\n\n  return metaMatches && ctrlMatches && shiftMatches && altMatches && keysMatch;\n};\n","import * as navigatorUtils from \"../platform/navigator\";\n\n/**\n * Checks if any modifier key (Ctrl, Meta, Alt, or Shift) is pressed.\n * @param event - The keyboard event to check.\n * @returns True if a modifier key is pressed, otherwise false.\n */\nexport const isModifierKeyPressed = (event: KeyboardEvent): boolean => {\n  return event.ctrlKey || event.metaKey || event.altKey || event.shiftKey;\n};\n\n/**\n * Checks if a specific key (or keys) were pressed without any modifier keys.\n * @param event - The keyboard event to check.\n * @param keys - The key or keys to check for.\n * @returns True if the specified key(s) were pressed without modifiers, otherwise false.\n */\nexport const isKeyWithoutModifiers = (\n  event: KeyboardEvent,\n  keys: string | string[],\n): boolean => {\n  const keyList = Array.isArray(keys) ? keys : [keys];\n  return keyList.includes(event.key) && !isModifierKeyPressed(event);\n};\n\n/**\n * Returns the name of the primary modifier key for the current platform.\n */\nexport const getMetaOrCtrlKey = (): \"ctrlKey\" | \"metaKey\" => {\n  return navigatorUtils.isMac() ? \"metaKey\" : \"ctrlKey\";\n};\n","import { hotkeyPlatform } from \"./enums\";\nimport {\n  formatHotkey,\n  formatHotkeys,\n  getDefaultSeparator,\n  textWithHotkeys,\n} from \"./format\";\nimport { match } from \"./match\";\n\n/**\n * Grouped keyboard-shortcut helpers, exposed as a single namespace for\n * ergonomic access (e.g. `hotkeys.formatHotkey`).\n */\nexport const hotkeys = {\n  formatHotkeys,\n  formatHotkey,\n  getDefaultSeparator,\n  hotkeyPlatform,\n  textWithHotkeys,\n  match,\n};\n\nexport { match };\nexport {\n  getMetaOrCtrlKey,\n  isKeyWithoutModifiers,\n  isModifierKeyPressed,\n} from \"./modifiers\";\nexport type { Hotkey, HotkeyPlatform, KnownHotkey } from \"./types\";\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAKA,IAAa,cAAc,UACzB,MAAM,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,MAAM,UAAU,CAAC;AAEnD,IAAM,UAAU;CACd,eAAe,OAAe,cAC5B,WAAW,MAAM,QAAQ,WAAW,GAAG,CAAC,CAAC,YAAY,CAAC;CAExD,cAAc,UAAkB,QAAQ,aAAa,OAAO,GAAG;CAC/D,cAAc,UAAkB,QAAQ,aAAa,OAAO,GAAG;CAE/D,kBAAkB,UAChB,YACG,MAAM,MAAM,kBAAkB,KAAK,CAAC,EAAA,CAClC,MAAM,GAAG,EAAE,CAAC,CACZ,KAAK,GAAG,CAAC,CACT,YAAY,CACjB;AACJ;AAQA,IAAa,iBAAiB,EAC5B,QACA,WACA,aAC0B;CAC1B,IAAI,WACF,OAAO,QAAQ,aAAa,QAAQ,SAAS;CAG/C,IAAI,QACF,OAAO,QAAQ,OAAO,CAAC,QAAQ,aAAa,EAAE;CAGhD,OAAO,WAAW,MAAM;AAC1B;;;;;;;;;;;ACnCA,IAAA,sBAAgB,MAAY,SAAsB;CAEhD,IAAI,MAAM;EAER,OAAO,QAAQ,IAAI,IAAI,OAAO,IAAI,KAAK,KAAK,IAAI,GAAG,CAAC,CAAC;EACrD,OAAO,IAAI,MAAM;GACf,MAAM,QAAQ,IAAI;GAClB,OAAO,SAAS,IAAI;GACpB,MAAM,QAAQ,IAAI;EACpB,CAAC;CACH;CAEA,OAAO;AACT;;;;;;;;;;;ACdA,IAAA,sBAAgB,MAAY,SAAsB;CAChD,MAAM,IAAI,IAAI,KAAK,IAAI;CAEvB,IAAI,MAAM;EACR,EAAE,SAAS,KAAK,SAAS,CAAC;EAC1B,EAAE,WAAW,KAAK,WAAW,CAAC;EAC9B,EAAE,WAAW,KAAK,WAAW,CAAC;EAC9B,EAAE,gBAAgB,KAAK,gBAAgB,CAAC;CAC1C;CACA,OAAO;AACT;;;;;;;;;;;ACLA,IAAa,mBACX,MACA,KACA,WACA,cACG;CACH,IAAI,KAAK;EACP,IAAI,aAAa,WACf,OAAO,SAAS,MAAM,GAAG;EAE3B,IAAI,WAAW;GAEb,MAAM,uBAAO,IAAI,KAAK,CAAC;GACvB,OAAO,SAAS,mBAAW,MAAM,IAAI,GAAG,mBAAW,MAAM,GAAG,CAAC;EAC/D;EACA,IAAI,WAAW;GAEb,MAAM,uBAAO,IAAI,KAAK,CAAC;GACvB,OAAO,SAAS,mBAAW,MAAM,IAAI,GAAG,mBAAW,MAAM,GAAG,CAAC;EAC/D;CACF;CACA,OAAO;AACT;;;;;;;;;AAUA,IAAa,kBACX,MACA,KACA,WACA,cACG;CACH,IAAI,KAAK;EACP,IAAI,aAAa,WACf,OAAO,QAAQ,MAAM,GAAG;EAE1B,IAAI,WAAW;GAEb,MAAM,uBAAO,IAAI,KAAK,CAAC;GACvB,OAAO,QAAQ,mBAAW,MAAM,IAAI,GAAG,mBAAW,MAAM,GAAG,CAAC;EAC9D;EACA,IAAI,WAAW;GAEb,MAAM,uBAAO,IAAI,KAAK,CAAC;GACvB,OAAO,QAAQ,mBAAW,MAAM,IAAI,GAAG,mBAAW,MAAM,GAAG,CAAC;EAC9D;CACF;CACA,OAAO;AACT;;;AC9DA,IAAM,YAAe,UAA2B,SAAiB;CAC/D,IAAI;CACJ,IAAI,WAAW;CAEf,QAAQ,GAAG,SAAsC;EAC/C,MAAM,CAAC,OAAO,SAAS;EACvB,aAAa,KAAK;EAClB,MAAM,MAAM,KAAK,IAAI;EAGrB,IAFyB,MAAM,WAER,MAAM;GAC3B,WAAW;GACX,SAAS,OAAO,KAAK;EACvB,OACE,QAAQ,iBAAiB;GACvB,WAAW;GACX,SAAS,OAAO,KAAK;EACvB,GAAG,IAAI;CAEX;AACF;ACqFA,IAAa,UAGT,OAAO,OAAO,CAAC,GAAG,GAAG;CA7EvB;EACE,IAAI;EACJ,UAAU,YAAY,qBAAqB;GACzC,OAAO,sBAAsB,aAAa,WAAW,YAAY;EACnE;EACA,KAAK,MAAM,sBAAsB,qBAAqB,eAAe;GAEnE,MAAM,WADW,sBAAsB,OAAO,KAAK,YAAY,EAAA,CACtC,SAAS,oBAAoB;GACtD,OAAO,gBAAgB,CAAC,UAAU;EACpC;CACF;CACA;EACE,IAAI;EACJ,UAAU,YAAY,qBAAqB;GAGzC,IAAI,WAAW,SAAS,GAQtB,aAAa,IAPa,WAAW,QACnC,0BACA,MAEyB,CAAA,CACxB,QAAQ,OAAO,IAAI,CAAC,CACpB,QAAQ,OAAO,IACD,EAAmB;QAEpC,OAAO,EAAE,YAAY,MAAM;GAE7B,IAAI;IAEF,OAAO,IAAI,OAAO,YADJ,sBAAsB,KAAK,GACN;GACrC,SAAS,QAAQ;IAGf,OAAO;GACT;EACF;EACA,KAAK,MAAM,sBAAsB,qBAAqB,eAAe;GACnE,MAAM,UAAU,qBAAqB,KAAK,IAAI;GAC9C,OAAO,gBAAgB,CAAC,UAAU;EACpC;CACF;CACA;EACE,IAAI;EACJ,UAAU,YAAY,qBAAqB;GACzC,IAAI;IACF,MAAM,QAAQ,sBAAsB,KAAK;IACzC,OAAO,IAAI,OAAO,KAAK,WAAW,KAAK,KAAK;GAC9C,SAAS,QAAQ;IAGf,OAAO;GACT;EACF;EACA,KAAK,MAAM,sBAAsB,qBAAqB,eAAe;GACnE,MAAM,UAAU,qBAAqB,KAAK,IAAI;GAC9C,OAAO,gBAAgB,CAAC,UAAU;EACpC;CACF;CACA;EACE,IAAI;EACJ,UAAU,eAAe;GACvB,OAAO,EAAE,OAAO,SAAiB,cAAc,SAAS,IAAI,EAAE;EAChE;EACA,KAAK,MAAM,sBAAsB;GAC/B,IAAI,OAAO,SAAS,aAClB,OAAO;GAET,OAAO,qBAAqB,KAAK,IAAI;EACvC;CACF;AAOuB,CAAA,CAAgB,KAAK,SAAS,GAAG,IAAI,KAAK,IAAI,EAAE,CAAC;;;;;;;;AC3G1E,IAAA,8BAAqB,KAAK,eAAe,CAAC,CAAC,gBAAgB,CAAC,CAAC;;;;;;;;;;;ACK7D,IAAa,oBACX,YACA,cAAc,UACX;CACH,MAAM,OAAO,IAAI,KAAK,UAAU;CAGhC,IAAI,MAAM,IAAI,GACZ,MAAM,MAAM,qBAAqB;CAGnC,MAAM,kBAA8C;EAClD,KAAK;EACL,OAAO;EACP,MAAM;CACR;CAIA,MAAM,cAA0C,cAC5C;EAAE,GAAG;EAAiB,UAAU,sBAAiB;CAAE,IACnD;CAEJ,OAAO,KAAK,mBAAmB,SAAS,WAAW;AACrD;;;;;;;;;AAUA,IAAa,oBACX,YACA,cAAc,UACX;CACH,MAAM,OAAO,IAAI,KAAK,UAAU;CAGhC,IAAI,MAAM,IAAI,GACZ,MAAM,MAAM,qBAAqB;CAKnC,MAAM,kBAA8C;EAClD,MAAM;EACN,QAAQ;CACV;CAEA,MAAM,cAA0C,cAC5C;EAAE,GAAG;EAAiB,UAAU,sBAAiB;CAAE,IACnD;CAEJ,OAAO,KAAK,mBAAmB,SAAS,WAAW;AACrD;;;;;;;;;;AAWA,IAAa,wBACX,gBACA,cAAc,UACX;CACH,OAAO,GAAG,iBAAiB,gBAAgB,WAAW,EAAE,GAAG,iBACzD,gBACA,WACF;AACF;;;;;;;;;AAUA,IAAa,6BAA6B,MAAc,aACtD,WAAW,qBAAqB,MAAM,IAAI,IAAI,iBAAiB,MAAM,IAAI;AAE3E,IAAa,kBAAkB,UAA0B;CAGvD,OAAO,YAFW,OAAO,SAAS,KAAK,KAAK,SAAS,IAAI,QAAQ,CAErC;AAC9B;;;ACxGA,IAAM,6BAA6B;CACjC,IAAI,UAAU,UAAU;CACxB,OAAO,SAAS,YACd,UAAU,SAAS,YAAY;CAEjC,OAAO;AACT;;;;;;;;;;ACCA,IAAA,iCAAgB,OAAe,YAC3B,QAAQ,SAAU,UAAU;;;;;;;;;;;;;;AC6BhC,IAAM,+BACJ,UACA,UACW;CACX,OAAO;EACL;EACA,OAAO,SAAS,MAAM,MAAM,KAAK,EAAE;EACnC,QAAQ,SAAS,MAAM,MAAM,KAAK,EAAE;EACpC,OAAO,SAAS,MAAM,MAAM,KAAK,EAAE;EACnC,MAAM,SAAS,MAAM,MAAM,KAAK,EAAE;CACpC;AACF;AAEA,IAAM,iCACJ,UACA,UACa;CAEb,MAAM,eAAe,SAAS,MAAM,EAAE,EAAE,OAAO,GAAG,GAAG,KAAK,KAAK,EAAE;CAEjE,OAAO;EACL;EACA,OAAO,SAAS,MAAM,MAAM,KAAK,EAAE;EACnC,SAAS,SAAS,MAAM,MAAM,KAAK,EAAE;EACrC,SAAS,SAAS,MAAM,MAAM,KAAK,EAAE;EACrC;CACF;AACF;AAEA,IAAa,UAAU,aAAwC;CAC7D,IAAI,SAAS,SAAS,QACpB,OACE,SAAS,SAAS,UAAU,KAC5B,SAAS,SAAS,WAAW,KAC7B,SAAS,SAAS,UAAU,KAC5B,SAAS,SAAS,SAAS;MAG7B,OACE,SAAS,SAAS,UAAU,KAC5B,SAAS,SAAS,YAAY,KAC9B,SAAS,SAAS,YAAY,KAC9B,SAAS,SAAS,iBAAiB;AAGzC;;;;;;;;;;;;;AAcA,IAAa,qCACX,aACW;CACX,IAAI,SAAS;CAEb,IAAI,SAAS,SAAS,QACpB,UAAU,GAAG,SAAS,SAAS,MAAM,GAAG,SAAS,SAAS,OAAO,GAAG,SAAS,SAAS,MAAM,GAAG,SAAS,SAAS,KAAK;MAEtH,UAAU,IAAI,SAAS,SAAS,MAAM,GAAG,SAAS,SAAS,QAAQ,GAAG,SAAS,SAAS,QAAQ,GAAG,SAAS,SAAS,aAClH,SAAS,CAAC,CAEV,SAAS,GAAG,GAAG,EAAE;CAGtB,IAAI,SAAS,SAAS,UACpB,SAAS,IAAI;CAEf,OAAO;AACT;;;;;;;;;;AAWA,IAAa,+CACX,aACW;CACX,MAAM,cAAc,OAAe,SAAyB;EAC1D,IAAI,UAAU,GACZ,OAAO;OACF,IAAI,UAAU,GACnB,OAAO,GAAG,MAAM,GAAG,KAAK;OAExB,OAAO,GAAG,MAAM,GAAG,KAAK;CAE5B;CAEA,IAAI,SAAS;CAEb,IAAI,SAAS,SAAS,QAAQ;EAC5B,IAAI,OAAO,QAAQ,GACjB,OAAO;EAGT,UAAU,WAAW,SAAS,SAAS,OAAO,MAAM;EACpD,UAAU,WAAW,SAAS,SAAS,QAAQ,OAAO;EACtD,UAAU,WAAW,SAAS,SAAS,OAAO,MAAM;EACpD,UAAU,WAAW,SAAS,SAAS,MAAM,KAAK;CACpD,OAAO;EACL,IAAI,OAAO,QAAQ,GACjB,OAAO;EAGT,UAAU,WAAW,SAAS,SAAS,OAAO,MAAM;EACpD,UAAU,WAAW,SAAS,SAAS,SAAS,QAAQ;EAExD,MAAM,mBAAmB,SAAS,SAAS,iBAAiB;EAC5D,IAAI,SAAS,SAAS,YAAY,KAAK,CAAC,kBACtC,IAAI,kBACF,UAAU,WAAW,SAAS,SAAS,SAAS,QAAQ;OAExD,UAAU,GAAG,SAAS,SAAS,QAAQ,GAAG,SAAS,SAAS,aAAa,SAAS,CAAC,CAAC,SAAS,GAAG,GAAG,EAAE;CAG3G;CAEA,IAAI,SAAS,SAAS,UACpB,SAAS,KAAK,OAAO,KAAK,EAAE;CAG9B,OAAO,OAAO,KAAK;AACrB;AAEA,IAAM,YAAY;AAClB,IAAM,aAAa;AACnB,IAAM,YAAY;AAClB,IAAM,WAAW;AACjB,IAAM,YAAY;AAClB,IAAM,cAAc;AACpB,IAAM,cAAc;;;;AAKpB,IAAM,2BAA2B,IAAI,OACnC,OAAO,UAAU,WAAW,WAAW,WAAW,UAAU,WAAW,SAAS,UAChF,GACF;;;;AAKA,IAAM,6BAA6B,IAAI,OACrC,OAAO,UAAU,WAAW,YAAY,WAAW,YAAY,MAC/D,GACF;;;;AAKA,IAAM,mCAAmC,IAAI,OAC3C,oBAAoB,yBAAyB,OAAO,QAAQ,SAAS,EAAE,EAAE,eACzE,GACF;;;;AAKA,IAAM,kDAAkD,IAAI,OAC1D,oBAAoB,UAAU,GAAG,WAAW,GAAG,UAAU,GAAG,SAAS,SACrE,GACF;;;;AAKA,IAAM,qCAAqC,IAAI,OAC7C,oBAAoB,2BAA2B,OAAO,QAAQ,SAAS,EAAE,EAAE,eAC3E,GACF;;;;AAKA,IAAM,oDAAoD,IAAI,OAC5D,oBAAoB,UAAU,GAAG,YAAY,GAAG,YAAY,SAC5D,GACF;;;;;;;;;;;;;;AAeA,IAAa,oCACX,mBACqB;CACrB,iBAAiB,gBAAgB,KAAK;CAEtC,IAAI,CAAC,gBACH,MAAM,IAAI,MAAM,uBAAuB;CAGzC,MAAM,sBAAsB,yBAAyB,KAAK,cAAc;CACxE,MAAM,sBACJ,iCAAiC,KAAK,cAAc,KACpD,gDAAgD,KAAK,cAAc;CACrE,MAAM,wBAAwB,2BAA2B,KAAK,cAAc;CAC5E,MAAM,wBACJ,mCAAmC,KAAK,cAAc,KACtD,kDAAkD,KAAK,cAAc;CAEvE,MAAM,cAAc,uBAAuB;CAC3C,MAAM,gBAAgB,yBAAyB;CAC/C,MAAM,YAAY,uBAAuB,2BAA2B;CAGpE,IAAI,iBAAiB,aACnB,MAAM,IAAI,MAAM,uBAAuB;CAGzC,IAAI,aACF,OAAO;EACL,MAAM;EACN,UAAU,4BAA4B,UAAU,WAAW;CAC7D;MACK,IAAI,eACT,OAAO;EACL,MAAM;EACN,UAAU,8BAA8B,UAAU,aAAa;CACjE;MAEA,MAAM,IAAI,MAAM,gCAAgC,gBAAgB;AAEpE;;;;;;;;AASA,IAAa,sCACX,MACA,iBACmC;CACnC,IAAI;EACF,MAAM,mBAAmB,iCAAiC,IAAI;EAC9D,MAAM,aAAa,iBAAiB;EACpC,MAAM,WAAW,iBAAiB,SAAS;EAE3C,IAAI,eAAe,gBAAgB,iBAAiB,gBAClD,OAAO;GACL,OAAO;GACP,MAAM;GACN;EACF;OAEA,OAAO,EAAE,OAAO,MAAM;CAE1B,SAAS,IAAI;EACX,OAAO,EAAE,OAAO,MAAM;CACxB;AACF;;;;;;;;;;;;AAaA,IAAa,0BAA0B,cAAwC;CAC7E,YAAY,WAAW,KAAK;CAE5B,IAAI;EAAC;EAAI;EAAK;EAAM;EAAK;EAAM;CAAK,CAAC,CAAC,SAAS,SAAS,GACtD,MAAM,IAAI,MAAM,oBAAoB;CAGtC,MAAM,cAAc;CACpB,MAAM,gBACJ;CAEF,MAAM,cAAc,YAAY,KAAK,SAAS;CAC9C,MAAM,gBAAgB,cAAc,KAAK,SAAS;CAElD,IAAI,aACF,OAAO;EACL,MAAM;EACN,UAAU,4BACR,UAAU,WAAW,GAAG,GACxB,WACF;CACF;MACK,IAAI,eACT,OAAO;EACL,MAAM;EACN,UAAU,8BACR,UAAU,WAAW,GAAG,GACxB,aACF;CACF;MAEA,MAAM,IAAI,MAAM,yBAAyB,WAAW;AAExD;;;;;;;;AASA,IAAa,4BACX,WACA,SACmC;CACnC,IAAI;EACF,MAAM,mBAAmB,uBAAuB,SAAS;EACzD,MAAM,aAAa,iBAAiB;EACpC,MAAM,WAAW,iBAAiB,SAAS;EAE3C,IAAI,eAAe,QAAQ,SAAS,gBAClC,OAAO;GACL,OAAO;GACP,MAAM;GACN;EACF;OAEA,OAAO,EAAE,OAAO,MAAM;CAE1B,SAAS,IAAI;EACX,OAAO,EAAE,OAAO,MAAM;CACxB;AACF;;;;;;;;AASA,IAAa,8BAA8B,SAAmC;CAC5E,MAAM,WAAW,yBAAyB,MAAM,cAAc;CAC9D,MAAM,qBAAqB,mCACzB,MACA,cACF;CACA,IAAI,SAAS,OACX,OAAO,uBAAuB,IAAI;MAC7B,IAAI,mBAAmB,OAC5B,OAAO,iCAAiC,IAAI;MAE5C,MAAM,IAAI,MAAM,4BAA4B,MAAM;AAEtD;;;;;;;;AASA,IAAa,yBACX,MACA,SACmC;CACnC,MAAM,WAAW,yBAAyB,MAAM,IAAI;CACpD,MAAM,qBAAqB,mCAAmC,MAAM,IAAI;CACxE,IAAI,SAAS,OACX,OAAO;MACF,IAAI,mBAAmB,OAC5B,OAAO;MAEP,OAAO,EAAE,OAAO,MAAM;AAE1B;;;;;;;;;AC3aA,IAAA,4BAAgB,UACd,KAAK,IAAI,KAAK,MAAM,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI;;;ACPzD,IAAa,aAAb,cAAgC,MAAM,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;AA2BvC,IAAa,+BAA+B;CAC1C,MAAM,kBAAmC,IAAI,gBAAgB;CAE7D,MAAM,uBAAoC,YAA8B;EACtE,OAAO,IAAI,SAAY,SAAS,WAAW;GAEzC,MAAM,iBAAiB,EAAE,aAAoB;IAC3C,gBAAgB,OAAO,oBAAoB,SAAS,aAAa;IACjE,MAAM,SAAU,OAAuB;IACvC,OAAO,kBAAkB,aAAa,SAAS,IAAI,WAAW,MAAM,CAAC;GACvE;GAGA,QAAQ,CAAC,CACN,KAAK,OAAO,CAAC,CACb,OAAO,UAAU;IAChB,IAAI,iBAAiB,YACnB;IAGF,OAAO,KAAK;GACd,CAAC;GAEH,gBAAgB,OAAO,iBAAiB,SAAS,aAAa;EAChE,CAAC;CACH;CAEA,OAAO;EAAE;EAAiB;CAAoB;AAChD;;;ACjDA,IAAa,+BAAuD;CAClE,IAAI,gBAAqD,CAAC;CAC1D,IAAI,eAA2C,CAAC;CAEhD,MAAM,UAAU,IAAI,SAAY,KAAK,QAAQ;EAC3C,UAAU;EACV,SAAS;CACX,CAAC;CAED,OAAO;EAAE;EAAS;EAAQ;CAAQ;AACpC;;;;;;ACbA,SAAwB,MAAM,IAAY;CACxC,OAAO,IAAI,SAAS,YAAY,WAAW,SAAS,EAAE,CAAC;AACzD;;;;;;;;ACOA,eAAsB,aAAgB,EACpC,IACA,aAAA,GACA,eAAA,GACA,gBAMC;CACD,IAAI;EACF,OAAO,MAAM,GAAG;CAClB,SAAS,OAAO;EACd,IAAI,eAAe,KAAc,GAC/B,MAAM;EAGR,IAAI,aAAa,GAAG;GAClB,MAAM,MAAM,YAAY;GAGxB,OAAO,MAAM,aAAa;IACxB;IACA,YAAY,aAAa;IACzB;IACA;GACF,CAAC;EACH;EAEA,MAAM;CACR;AACF;;;;;;;;;;;;;AE1CA,IAAM,eAAe;CACnB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;;;;;;;;AASA,IAAM,gBACJ,SACA,UAAwE;CACtE,qBAAqB;CACrB,iBAAiB;AACnB,MACG;CACH,MAAM,EAAE,qBAAqB,oBAAoB;CACjD,MAAM,eAAe,CACnB,GAAI,sBAAsB,CAAC,OAAO,IAAI,CAAC,GACvC,GAAI,kBAAkB,CAAC,MAAM,IAAI,CAAC,CACpC;CACA,MAAM,cAAc,kBAAkB,CAAC,GAAG,cAAc,GAAG,IAAI;CAE/D,OAAO,UAAU,SAAS,SAAS;EACjC,cAAc;EACd;CACF,CAAC;AACH;;;;;;;AAQA,IAAM,aAAa,YAAoB;CACrC,OAAO,UAAU,SAAS,SAAS;EAAE,cAAc,CAAC;EAAG,cAAc,CAAC;CAAE,CAAC;AAC3E;AAEA,IAAa,eAAe;CAAE;CAAc;AAAU;;;ACvEtD,IAAM,mBAAmB;AAGzB,IAAA,0BAAgB,SAAS,IAAI,YAAY,qBAAqB;CAC5D,MAAM,OAAO,OAAO,SAAS,YAAY,MAAM;CAC/C,OAAO,GAAG,OAAO,UAAU,GAAG,YAAY,CAAC,IAAI;AACjD;;;;;;;;;ACAA,IAAa,oBAAoB,eAA+B;CAC9D,MAAM,WAAW,WAAW,MAAM,OAAO,CAAC,CAAC,IAAI,KAAK;CAEpD,MAAM,QAAQ,SAAS,MAAM,GAAG;CAEhC,IAAI,aAAa,MAAM,MAAM,WAAW,GACtC,OAAO;CAGT,OAAO,MAAM,GAAG,EAAE,KAAK;AACzB;;;;;AAMA,IAAM,OAAO,OAAO,OAAO;CACzB,WAAW;CACX,UAAU;CACV,QAAQ,MAAY;EAElB,OADkB,iBAAiB,KAAK,IACjC,MAAc,KAAK;CAC5B;AACF,CAAC;;;;AAKD,IAAM,OAAO,OAAO,OAAO;CACzB,WAAW;CACX,UAAU;CACV,QAAQ,MAAY;EAElB,OADkB,iBAAiB,KAAK,IACjC,MAAc,KAAK;CAC5B;;;;;;CAMA,iBAAiB,MAAY,eAAe,IAAY;EACtD,IAAI,CAAC,KAAK,QAAQ,IAAI,GACpB,OAAO;EAGT,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,aAAa,EAAE;CACnD;AACF,CAAC;AAED,IAAa,mBAAmB;CAAE;CAAM;AAAK;;;;;;;AAQ7C,IAAa,mBAAmB,SAAuB;CACrD,MAAM,mBAAmB;CAIzB,IAAI,CAFc,iBAAiB,KAAK,IAEnC,GACH,OAAO;CAGT,IAAI,KAAK,QAAQ,IAAI,GACnB,OAAO,KAAK;CAGd,IAAI,KAAK,QAAQ,IAAI,GACnB,OAAO,KAAK;CAId,IAAI,CAAC,KAAK,MACR,OAAO;CAGT,OAAO,KAAK;AACd;;;;;;;;ACjFA,IAAa,iBAAiB;CAC5B,QAAQ;CACR,OAAO;AACT;AAE+B,OAAO,OAAO,cAAc;;;;;;;;;;;ACN3D,IAAa,cACX,WAAW,WAAW,YAAY,CAAC,EAAE,SAAS,KAAK;;;;;AAMrD,IAAa,kBACX,WAAW,WAAW,YAAY,CAAC,EAAE,SAAS,SAAS;;;ACPzD,IAAM,eAAe;CACnB,SAAS;CACT,WAAW;CACX,WAAW;CACX,YAAY;CACZ,OAAO;CACP,KAAK;CACL,WAAW;AACb;AAEA,IAAM,cAAc;CAClB,OAAO;CACP,QAAQ;CACR,WAAW;CACX,MAAM;CACN,KAAK;CACL,OAAO;AACT;;;;;;;;AAWA,IAAa,gBACX,QACA,aACW;;;;;CAKX,MAAM,cAAc,eAA6B,QAC/C,UAAU,QAA8B;;;;;CAM1C,MAAM,QACJ,GAAG,QAEH,IAAI,QACD,GAAG,OAAO,QAAQ,EAAE,EAAE,GAAG,CAAC,IAC1B,QAAgB,GACnB;CAEF,MAAM,kBAAkB,KACtB,WAAW,WAAW,GACtB,WAAW,YAAY,CACzB;CAEA,MAAM,sBAAsB,WAAW,YAAY;CAInD,QADE,aAAa,KAAA,IAAY,MAAM,IAAI,aAAa,eAAe,UAE7D,gBAAgB,MAAM,IACtB,oBAAoB,MAAM;AAChC;AAEA,IAAa,4BAA6B,MAAM,IAAI,MAAM;;;;AAK1D,IAAa,iBACX,SACA,eAAe,wBACZ,QAAQ,KAAK,WAAW,aAAa,MAAM,CAAC,CAAC,CAAC,KAAK,aAAa,CAAC;;;;AAKtE,IAAa,mBAAmB,MAAc,YAA2B;CACvE,OAAO,GAAG,KAAK,KAAK,cAAc,OAAO;AAC3C;;;;;;;;;;AC1EA,IAAM,qBAAqB,SAAiB,WAA4B;CAGtE,IAAI,OAAO,WAAW,KAAoB,CAAC,SAAS,WAAW,OAAO,GACpE,OAAO;CAGT,MAAM,YAAY,OAAO,QAAQ,MAAM,CAAc,CAAC;CACtD,MAAM,CAAC,OAAO,SAAS,OAAO,MAAM,GAAG;CAEvC,OACE,QAAQ,KAAK,KACb,QAAQ,KAAK,KACb,OAAO,SAAS,OAAO,EAAE,KAAK,aAC9B,aAAa,OAAO,SAAS,OAAO,EAAE;AAE1C;;;;;;;;;;AAWA,IAAa,SAAS,OAAsB,YAA+B;CACzE,MAAM,EAAE,KAAK,MAAM,SAAS,SAAS,UAAU,WAAW;CAE1D,MAAM,YAAY,QAAQ,MAAM;CAChC,MAAM,YAAY,UAAU,IAAI,KAAK;CAGrC,MAAM,aAAa,MAAqB,IAAI,SAAS;CACrD,MAAM,oBAAoB,IAAI,IAC5B,UAAU,KAAK,aACb,aAAa,cAAc,aAAa,QAC1C,CACF;CAEA,MAAM,cAAc,QAAQ,OAAO,MAAM,kBAAkB,IAAI,MAAM;CACrE,MAAM,cAAc,QAAQ,OAAO,MAAM,kBAAkB,IAAI,MAAM;CACrE,MAAM,eAAe,QAAQ,QAAQ,MAAM,kBAAkB,IAAI,OAAO;CACxE,MAAM,aAAa,QAAQ,MAAM,MAAM,kBAAkB,IAAI,KAAK;CAElE,MAAM,YAEJ,IAAI,YAAY,MAAM,UAAU,YAAY,KAC3C,UAAU,SAAS,GAAG,KAAK,kBAAkB,MAAM,SAAS,KAE5D,MAAqB,KAAK,cAAc,YAAY,QAAQ;CAE/D,OAAO,eAAe,eAAe,gBAAgB,cAAc;AACrE;;;;;;;;AC1DA,IAAa,wBAAwB,UAAkC;CACrE,OAAO,MAAM,WAAW,MAAM,WAAW,MAAM,UAAU,MAAM;AACjE;;;;;;;AAQA,IAAa,yBACX,OACA,SACY;CAEZ,QADgB,MAAM,QAAQ,IAAI,IAAI,OAAO,CAAC,IAAI,EAAA,CACnC,SAAS,MAAM,GAAG,KAAK,CAAC,qBAAqB,KAAK;AACnE;;;;AAKA,IAAa,yBAAgD;CAC3D,OAAO,MAAqB,IAAI,YAAY;AAC9C;;;;;;;ACjBA,IAAa,UAAU;CACrB;CACA;CACA;CACA;CACA;CACA;AACF"}
+{"version":3,"file":"index.js","names":[],"sources":["../src/capitalize.ts","../src/updateDate.ts","../src/updateTime.ts","../src/dateMinMaxCheck.ts","../src/debounce.ts","../src/filters.ts","../src/localTimezone.ts","../src/format.ts","../src/getDeepActiveElement.ts","../src/getWrappedAroundIndex.ts","../src/intervalUtils.ts","../src/numIntegerDigits.ts","../src/promise/createAbortablePromise.ts","../src/promise/createUnwrappedPromise.ts","../src/sleep.ts","../src/promise/retryPromise.ts","../src/promise/index.ts","../src/sanitization.ts","../src/truncateString.ts","../src/fileExtensions.ts","../src/hotkeys/enums.ts","../src/platform/navigator.ts","../src/hotkeys/format.ts","../src/hotkeys/match.ts","../src/hotkeys/modifiers.ts","../src/hotkeys/index.ts"],"sourcesContent":["/**\n * Uppercases first letter of string\n * @param string to be capitalized first string, e.g. \"workflow\"\n * @return Capitalized String, e.g. \"Workflow\"\n */\nexport const capitalize = (input: string) =>\n  input.charAt(0).toUpperCase() + input.substring(1);\n\nconst formats = {\n  customFormat: (input: string, delimiter: string) =>\n    capitalize(input.replace(delimiter, \" \").toLowerCase()),\n\n  kebabFormat: (input: string) => formats.customFormat(input, \"-\"),\n  snakeFormat: (input: string) => formats.customFormat(input, \"_\"),\n\n  camelPascalCase: (input: string) =>\n    capitalize(\n      (input.match(/([A-Z]?[^A-Z]*)/g) ?? [])\n        .slice(0, -1)\n        .join(\" \")\n        .toLowerCase(),\n    ),\n} as const;\n\ntype CaseFormatterOptions = {\n  string: string;\n  delimiter?: string;\n  format?: keyof typeof formats;\n};\n\nexport const caseFormatter = ({\n  string,\n  delimiter,\n  format,\n}: CaseFormatterOptions) => {\n  if (delimiter) {\n    return formats.customFormat(string, delimiter);\n  }\n\n  if (format) {\n    return formats[format](string, delimiter ?? \"\");\n  }\n\n  return capitalize(string);\n};\n","import { getDate, getMonth, getYear, isValid, set } from \"date-fns\";\n/**\n * Updates the date part (year, day and month) of a date object (base)\n * time, offset (timezone) and so on will be left untouched.\n *\n * @param  base - Date which will be used (copied) to set day, month and year.\n * @param  date - Extract day, month and year from this date object.\n * @returns Copy of base with day, month and year of date.\n */\nexport default (base: Date, date: Date | null) => {\n  // ignore falsy dates\n  if (date) {\n    // allow invalid base and set time to 0\n    base = isValid(base) ? base : new Date(Date.UTC(0, 0));\n    return set(base, {\n      year: getYear(date),\n      month: getMonth(date),\n      date: getDate(date),\n    });\n  }\n\n  return base;\n};\n","/**\n * Updates the time part (hour, minute, second and millisecond) of a date object (base)\n * date, offset (timezone) and so on will be left untouched.\n *\n * @param base - Date which will be used (copied) to set day, month and year.\n * @param date - Extract hour, minute, second and millisecond from this date object.\n * @returns Copy of base with hour, minute, second and millisecond changed.\n */\nexport default (base: Date, date: Date | null) => {\n  const d = new Date(base);\n  // ignore falsy dates\n  if (date) {\n    d.setHours(date.getHours());\n    d.setMinutes(date.getMinutes());\n    d.setSeconds(date.getSeconds());\n    d.setMilliseconds(date.getMilliseconds());\n  }\n  return d;\n};\n","import { isAfter, isBefore } from \"date-fns\";\n\nimport updateDate from \"./updateDate\";\nimport updateTime from \"./updateTime\";\n\n/**\n * Check if date is before min.\n * @param date\n * @param min\n * @param checkDate - check date part (year, day, month).\n * @param checkTime - check time part (hour, minutes etc.).\n * @returns whether limit is kept or not.\n */\nexport const isBeforeMinDate = (\n  date: Date,\n  min: Date | null,\n  checkDate: boolean,\n  checkTime: boolean,\n) => {\n  if (min) {\n    if (checkTime && checkDate) {\n      return isBefore(date, min);\n    }\n    if (checkTime) {\n      // only time is visible so ignore date: use same datre as base\n      const base = new Date(0);\n      return isBefore(updateTime(base, date), updateTime(base, min));\n    }\n    if (checkDate) {\n      // only date is visible so ignore time: use same time as base\n      const base = new Date(0);\n      return isBefore(updateDate(base, date), updateDate(base, min));\n    }\n  }\n  return false;\n};\n\n/**\n * Check\n * @param date - date to check.\n * @param max - maximum date.\n * @param checkDate - check date part (year, day, month).\n * @param checkTime - check time part (hour, minutes etc.).\n * @returns whether limit is kept or not.\n */\nexport const isAfterMaxDate = (\n  date: Date,\n  max: Date | null,\n  checkDate: boolean,\n  checkTime: boolean,\n) => {\n  if (max) {\n    if (checkTime && checkDate) {\n      return isAfter(date, max);\n    }\n    if (checkTime) {\n      // only time is visible so ignore date: use same datre as base\n      const base = new Date(0);\n      return isAfter(updateTime(base, date), updateTime(base, max));\n    }\n    if (checkDate) {\n      // use same time base\n      const base = new Date(0);\n      return isAfter(updateDate(base, date), updateDate(base, max));\n    }\n  }\n  return false;\n};\n","// Use this method to reduce many method calls to a few.\n// It's an 'immediate' implementation, so it will call the callbackindex: number once immediately an then again after the given wait.\n\ntype CallbackFunc<T> = (value: T, index: number) => void;\n\nconst debounce = <T>(callback: CallbackFunc<T>, wait: number) => {\n  let timer: ReturnType<typeof setTimeout>;\n  let lastCall = 0;\n\n  return (...args: Parameters<typeof callback>) => {\n    const [value, index] = args;\n    clearTimeout(timer);\n    const now = Date.now();\n    const timeFromLastCall = now - lastCall;\n\n    if (timeFromLastCall > wait) {\n      lastCall = now;\n      callback(value, index);\n    } else {\n      timer = setTimeout(() => {\n        lastCall = now;\n        callback(value, index);\n      }, wait);\n    }\n  };\n};\n\nexport default debounce;\n","/**\n * These definitions can be used to filter an array. Each entry should contain a method normalize which can be used to\n * compile any filter settings and a method \"test\" which takes the compiled result, additional settings and the item to\n * be matched/filtered\n * */\ninterface FilterDefinition<SearchTerm, Normalized, Testable> {\n  id: string;\n  normalize: (\n    searchTerm: SearchTerm,\n    caseSensitiveSearch: boolean,\n  ) => Normalized;\n  test: (\n    text: Testable,\n    normalizedSearchTerm: Normalized,\n    caseSensitiveSearch: boolean,\n    inverseSearch: boolean,\n  ) => boolean;\n}\n\ninterface StringTest {\n  test(str: string): boolean;\n}\n\ntype SearchFilterDefinition = FilterDefinition<string, string, string>;\ntype PatternFilterDefinition = FilterDefinition<\n  string,\n  RegExp | StringTest,\n  string\n>;\ntype TypeFilterDefinition = FilterDefinition<\n  string[],\n  StringTest,\n  string | undefined\n>;\n\nconst modeDefinitions = [\n  {\n    id: \"search\",\n    normalize(searchTerm, caseSensitiveSearch) {\n      return caseSensitiveSearch ? searchTerm : searchTerm.toLowerCase();\n    },\n    test(text, normalizedSearchTerm, caseSensitiveSearch, inverseSearch) {\n      const testText = caseSensitiveSearch ? text : text.toLowerCase();\n      const matches = testText.includes(normalizedSearchTerm);\n      return inverseSearch ? !matches : matches;\n    },\n  } satisfies SearchFilterDefinition,\n  {\n    id: \"wildcard\",\n    normalize(searchTerm, caseSensitiveSearch) {\n      // Do a regex search, explicitly matching start and end of the search term.\n      // All regex special character except from \"* and ?\" (wildcards) are escaped.\n      if (searchTerm.length > 0) {\n        const escapedSearchTerm = searchTerm.replace(\n          /[-[\\]{}()+.,\\\\^$|#\\s]/g,\n          \"\\\\$&\",\n        );\n        const wildcardSearchTerm = escapedSearchTerm\n          .replace(/\\*/g, \".*\")\n          .replace(/\\?/g, \".?\");\n        searchTerm = `^${wildcardSearchTerm}$`;\n      } else {\n        return { test: () => false };\n      }\n      try {\n        const flags = caseSensitiveSearch ? \"\" : \"i\";\n        return new RegExp(searchTerm, flags);\n      } catch (_error) {\n        // In case of an invalid regular expression, an impossible\n        // regex is returned, not matching anything.\n        return /$^/;\n      }\n    },\n    test(text, normalizedSearchTerm, caseSensitiveSearch, inverseSearch) {\n      const matches = normalizedSearchTerm.test(text);\n      return inverseSearch ? !matches : matches;\n    },\n  } satisfies PatternFilterDefinition,\n  {\n    id: \"regex\",\n    normalize(searchTerm, caseSensitiveSearch) {\n      try {\n        const flags = caseSensitiveSearch ? \"\" : \"i\";\n        return new RegExp(`^(${searchTerm})$`, flags);\n      } catch (_error) {\n        // In case of an invalid regular expression, an impossible\n        // regex is returned, not matching anything.\n        return /$^/;\n      }\n    },\n    test(text, normalizedSearchTerm, caseSensitiveSearch, inverseSearch) {\n      const matches = normalizedSearchTerm.test(text);\n      return inverseSearch ? !matches : matches;\n    },\n  } satisfies PatternFilterDefinition,\n  {\n    id: \"type\",\n    normalize(selectedTypes) {\n      return { test: (type: string) => selectedTypes.includes(type) };\n    },\n    test(type, normalizedSearchTerm) {\n      if (typeof type === \"undefined\") {\n        return false;\n      }\n      return normalizedSearchTerm.test(type);\n    },\n  } satisfies TypeFilterDefinition,\n];\n\n// convert [{id: \"key1\", text: \"asdf\"}, ...] to {\"key1\": {id:\"key1\", text: \"asdf\"} ... }\nexport const filters: Record<\n  string,\n  FilterDefinition<unknown, unknown, unknown>\n> = Object.assign({}, ...modeDefinitions.map((obj) => ({ [obj.id]: obj })));\n","/**\n * Get the users local timezone.\n *\n * @returns current users timezone (browser based) tz db string (e. g. Europe/Berlin).\n */\n// eslint-disable-next-line new-cap\nexport default () => Intl.DateTimeFormat().resolvedOptions().timeZone;\n","import prettyBytes from \"pretty-bytes\";\n\nimport getLocalTimeZone from \"./localTimezone\";\n/**\n * Converts the specified date String to human readable text containing the day, month, and year.\n * Example: '2018-07-31T09:44:31+00:00' => 'Jul 31, 2018'\n *\n * @param dateString String representation of the Date to format\n * @param useTimeZone to set the timeZone where the user is located, and display local date and time\n * @returns human readable date String\n */\nexport const formatDateString = (\n  dateString: string | number,\n  useTimeZone = false,\n) => {\n  const date = new Date(dateString);\n\n  // @ts-expect-error Argument of type 'Date' is not assignable to parameter of type 'number'\n  if (isNaN(date)) {\n    throw Error(\"Invalid Date format\");\n  }\n\n  const baseDateOptions: Intl.DateTimeFormatOptions = {\n    day: \"numeric\",\n    month: \"short\",\n    year: \"numeric\",\n  };\n\n  // This only works for the default locale of en-US, as support of other locals in node js might not be available\n  // See for example this issue https://github.com/nodejs/node/issues/8500\n  const dateOptions: Intl.DateTimeFormatOptions = useTimeZone\n    ? { ...baseDateOptions, timeZone: getLocalTimeZone() }\n    : baseDateOptions;\n\n  return date.toLocaleDateString(\"en-US\", dateOptions);\n};\n\n/**\n * Converts the specified time String to human readable text containing the hour (12-hour) and minute.\n * Example: '2018-07-31T09:44:31+00:00' => '9:44 AM'\n *\n * @param timeString String representation of the Date (including time) to format\n * @param useTimeZone to set the timeZone where the user is located, and display local date and time\n * @returns human readable time String\n */\nexport const formatTimeString = (\n  timeString: string | number,\n  useTimeZone = false,\n) => {\n  const time = new Date(timeString);\n\n  // @ts-expect-error Argument of type 'Date' is not assignable to parameter of type 'number'\n  if (isNaN(time)) {\n    throw Error(\"Invalid Date format\");\n  }\n\n  // This only works for the default locale of en-US, as support of other locals in node js might not be available\n  // See for example this issue https://github.com/nodejs/node/issues/8500\n  const baseTimeOptions: Intl.DateTimeFormatOptions = {\n    hour: \"numeric\",\n    minute: \"2-digit\",\n  };\n\n  const timeOptions: Intl.DateTimeFormatOptions = useTimeZone\n    ? { ...baseTimeOptions, timeZone: getLocalTimeZone() }\n    : baseTimeOptions;\n\n  return time.toLocaleTimeString(\"en-US\", timeOptions);\n};\n\n/**\n * Converts the specified time String to human readable text containing the date (day, month, year) and time (hour,\n * minute; 12-hour).\n * Example: '2018-07-31T09:44:31+00:00' => 'Jul 31, 2018 9:44 AM'\n *\n * @param dateTimeString String representation of the Date (including time and date) to format\n * @param useTimeZone to set the timeZone where the user is located, and display local date and time\n * @returns human readable date/time String\n */\nexport const formatDateTimeString = (\n  dateTimeString: string | number,\n  useTimeZone = false,\n) => {\n  return `${formatDateString(dateTimeString, useTimeZone)} ${formatTimeString(\n    dateTimeString,\n    useTimeZone,\n  )}`;\n};\n\n/**\n * Converts the specified date and time to the user time zone with option to display (day, month, year) only or with time (hour,\n * minute; 12-hour).\n *\n * @param showTime String representation of the Date to convert and format\n * @param String | number} date String representation of the Date to convert and format\n * @returns human readable date/time String converted to user time zone\n */\nexport const formatLocalDateTimeString = (date: string, showTime: boolean) =>\n  showTime ? formatDateTimeString(date, true) : formatDateString(date, true);\n\nexport const formatFileSize = (bytes: number): string => {\n  const safeBytes = Number.isFinite(bytes) && bytes >= 0 ? bytes : 0;\n\n  return prettyBytes(safeBytes);\n};\n","const getDeepActiveElement = () => {\n  let element = document?.activeElement;\n  while (element?.shadowRoot) {\n    element = element?.shadowRoot?.activeElement;\n  }\n  return element;\n};\n\nexport default getDeepActiveElement;\n","/**\n * Since (a % b) yields a negative outcome for negative a, we need this method in order\n *  to correctly compute wrapped around indices in lists\n * @param {number} index an arbitrary integer\n * @param {number} length a positive integer\n * @returns {number} the non-negative modulo outcome\n */\nexport default (index: number, length: number) =>\n  ((index % length) + length) % length;\n","export type Period = {\n  negative: boolean;\n  years: number;\n  months: number;\n  weeks: number;\n  days: number;\n};\n\nexport type Duration = {\n  negative: boolean;\n  hours: number;\n  minutes: number;\n  seconds: number;\n  milliseconds: number;\n};\n\ntype AllowedIntervalTypes = \"DATE\" | \"TIME\";\ntype AllowedIntervalTypesOrEither = AllowedIntervalTypes | \"DATE_OR_TIME\";\n\ntype IntervalStringValidationResult =\n  | {\n      valid: true;\n      type: AllowedIntervalTypes;\n      negative: boolean;\n    }\n  | { valid: false };\n\nexport type PeriodOrDuration =\n  | {\n      interval: Period;\n      type: \"DATE\";\n    }\n  | {\n      interval: Duration;\n      type: \"TIME\";\n    };\n\nconst extractPeriodFromRegexMatch = (\n  negative: boolean,\n  match: RegExpExecArray,\n): Period => {\n  return {\n    negative,\n    years: parseInt(match[1] ?? \"0\", 10),\n    months: parseInt(match[2] ?? \"0\", 10),\n    weeks: parseInt(match[3] ?? \"0\", 10),\n    days: parseInt(match[4] ?? \"0\", 10),\n  };\n};\n\nconst extractDurationFromRegexMatch = (\n  negative: boolean,\n  match: RegExpExecArray,\n): Duration => {\n  // eslint-disable-next-line no-magic-numbers\n  const milliseconds = parseInt(match[4]?.padEnd(3, \"0\") ?? \"0\", 10);\n\n  return {\n    negative,\n    hours: parseInt(match[1] ?? \"0\", 10),\n    minutes: parseInt(match[2] ?? \"0\", 10),\n    seconds: parseInt(match[3] ?? \"0\", 10),\n    milliseconds,\n  };\n};\n\nexport const isZero = (interval: PeriodOrDuration): boolean => {\n  if (interval.type === \"DATE\") {\n    return (\n      interval.interval.years === 0 &&\n      interval.interval.months === 0 &&\n      interval.interval.weeks === 0 &&\n      interval.interval.days === 0\n    );\n  } else {\n    return (\n      interval.interval.hours === 0 &&\n      interval.interval.minutes === 0 &&\n      interval.interval.seconds === 0 &&\n      interval.interval.milliseconds === 0\n    );\n  }\n};\n\n/**\n * Take an interval object and convert it to an ISO duration or period string. All parts of the\n * relevant part of the Interval object are included in the output, even if they are zero.\n *\n * Technically the ISO standard allows to mix period and duration parts, but we don't support that\n * here because it's incredibly hard to deal with all the edge cases. Maybe in a future ticket.\n *\n * The output here is allowed to be negative, in which case the minus sign is prepended to the\n * output.\n *\n * @param toFormat The PeriodOrDuration object to format\n */\nexport const formatIntervalToISOIntervalString = (\n  toFormat: PeriodOrDuration,\n): string => {\n  let output = \"P\";\n\n  if (toFormat.type === \"DATE\") {\n    output += `${toFormat.interval.years}Y${toFormat.interval.months}M${toFormat.interval.weeks}W${toFormat.interval.days}D`;\n  } else {\n    output += `T${toFormat.interval.hours}H${toFormat.interval.minutes}M${toFormat.interval.seconds}.${toFormat.interval.milliseconds\n      .toString()\n      // eslint-disable-next-line no-magic-numbers\n      .padStart(3, \"0\")}S`;\n  }\n\n  if (toFormat.interval.negative) {\n    output = `-${output}`;\n  }\n  return output;\n};\n\n/**\n * Take an interval object and convert it to a human readable string. Only non-zero parts are\n * included in the output (unless all parts are 0).\n *\n * The output here is allowed to be negative, in which case the minus sign is prepended to the\n * output and we wrap the whole thing in brackets e.g. -(1 year 2 days).\n *\n * @param toFormat The PeriodOrDuration object to format\n */\nexport const formatIntervalToHumanReadableIntervalString = (\n  toFormat: PeriodOrDuration,\n): string => {\n  const formatPart = (value: number, unit: string): string => {\n    if (value === 0) {\n      return \"\";\n    } else if (value === 1) {\n      return `${value} ${unit} `;\n    } else {\n      return `${value} ${unit}s `;\n    }\n  };\n\n  let output = \"\";\n\n  if (toFormat.type === \"DATE\") {\n    if (isZero(toFormat)) {\n      return \"0 days\";\n    }\n\n    output += formatPart(toFormat.interval.years, \"year\");\n    output += formatPart(toFormat.interval.months, \"month\");\n    output += formatPart(toFormat.interval.weeks, \"week\");\n    output += formatPart(toFormat.interval.days, \"day\");\n  } else {\n    if (isZero(toFormat)) {\n      return \"0 seconds\";\n    }\n\n    output += formatPart(toFormat.interval.hours, \"hour\");\n    output += formatPart(toFormat.interval.minutes, \"minute\");\n\n    const milliSecondsZero = toFormat.interval.milliseconds === 0;\n    if (toFormat.interval.seconds !== 0 || !milliSecondsZero) {\n      if (milliSecondsZero) {\n        output += formatPart(toFormat.interval.seconds, \"second\");\n      } else {\n        output += `${toFormat.interval.seconds}.${toFormat.interval.milliseconds.toString().padStart(3, \"0\")} seconds `; // eslint-disable-line no-magic-numbers\n      }\n    }\n  }\n\n  if (toFormat.interval.negative) {\n    output = `-(${output.trim()})`;\n  }\n\n  return output.trim();\n};\n\nconst yearsPart = \"(\\\\d+)\\\\s*y(?:ears?)?\";\nconst monthsPart = \"(\\\\d+)\\\\s*m(?:o(?:nths?)?)?\";\nconst weeksPart = \"(\\\\d+)\\\\s*w(?:eeks?)?\";\nconst daysPart = \"(\\\\d+)\\\\s*d(?:ays?)?\";\nconst hoursPart = \"(\\\\d+)\\\\s*h(?:ours?)?\";\nconst minutesPart = \"(\\\\d+)\\\\s*m(?:in(?:s|utes?)?)?\";\nconst secondsPart = \"(\\\\d+)(?:[,.](\\\\d{1,3}))?\\\\s*s(?:ec(?:s|onds?)?)?\";\n\n/**\n * Matches a human readable period string, e.g. \"1y 2mo 3weeks 4day\" (each part is optional)\n */\nconst humanReadablePeriodRegex = new RegExp(\n  `^(?:${yearsPart})?\\\\s*(?:${monthsPart})?\\\\s*(?:${weeksPart})?\\\\s*(?:${daysPart})?\\\\s*$`,\n  \"i\",\n);\n\n/**\n * Matches a human readable duration string, e.g. \"1h 2m 3.456s\" (each part is optional)\n */\nconst humanReadableDurationRegex = new RegExp(\n  `^(?:${hoursPart})?\\\\s*(?:${minutesPart})?\\\\s*(?:${secondsPart})?$`,\n  \"i\",\n);\n\n/**\n * Matches a negative human readable period string, e.g. \"-(1y 2mo 3weeks 4day)\" (each part is optional)\n */\nconst negativeHumanReadablePeriodRegex = new RegExp(\n  `^\\\\s*-\\\\s*\\\\(\\\\s*${humanReadablePeriodRegex.source.replace(/[$^]/g, \"\")}\\\\s*\\\\)\\\\s*$`,\n  \"i\",\n);\n\n/**\n * Matches a negative human readable period string with one field like \"-1y\" or \"-1w\"\n */\nconst negativeHumanReadablePeriodRegexWithSingleField = new RegExp(\n  `^\\\\s*-\\\\s*(?:\\\\s*${yearsPart}|${monthsPart}|${weeksPart}|${daysPart})\\\\s*$`,\n  \"i\",\n);\n\n/**\n * Matches a negative human readable duration string, e.g. \"-(1h 2m 3.456s)\" (each part is optional)\n */\nconst negativeHumanReadableDurationRegex = new RegExp(\n  `^\\\\s*-\\\\s*\\\\(\\\\s*${humanReadableDurationRegex.source.replace(/[$^]/g, \"\")}\\\\s*\\\\)\\\\s*$`,\n  \"i\",\n);\n\n/**\n * Matches a negative human readable duration string with one field like \"-1h\" or \"-1.5s\"\n */\nconst negativeHumanReadableDurationRegexWithSingleField = new RegExp(\n  `^\\\\s*-\\\\s*(?:\\\\s*${hoursPart}|${minutesPart}|${secondsPart})\\\\s*$`,\n  \"i\",\n);\n\n/**\n * Try to parse a human readable interval string into an Interval object. Any parts not specified\n * are assumed to be zero. Note that the string must be either a period or a duration, not a mix of\n * both. So for example, \"1y 2mo 3weeks 4day\" is fine, as is \"1h 2m 3.456s\". However, \"1y 2mo 1sec\"\n * is not, since it's a mix of both.\n *\n * Negative intervals are allowed, although if multiple fields are provided the string must include\n * brackets, so \"-(1y 2mo)\" is also valid, as is \"-5 seconds\".\n *\n * The string is required to have at least some content, any string that is blank will throw an error.\n *\n * @param intervalString The human readable time string\n */\nexport const parseHumanReadableIntervalString = (\n  intervalString: string,\n): PeriodOrDuration => {\n  intervalString = intervalString?.trim();\n\n  if (!intervalString) {\n    throw new Error(\"Empty interval string\");\n  }\n\n  const matchPositivePeriod = humanReadablePeriodRegex.exec(intervalString);\n  const matchNegativePeriod =\n    negativeHumanReadablePeriodRegex.exec(intervalString) ??\n    negativeHumanReadablePeriodRegexWithSingleField.exec(intervalString);\n  const matchPositiveDuration = humanReadableDurationRegex.exec(intervalString);\n  const matchNegativeDuration =\n    negativeHumanReadableDurationRegex.exec(intervalString) ??\n    negativeHumanReadableDurationRegexWithSingleField.exec(intervalString);\n\n  const matchPeriod = matchPositivePeriod ?? matchNegativePeriod;\n  const matchDuration = matchPositiveDuration ?? matchNegativeDuration;\n  const negative = (matchNegativePeriod ?? matchNegativeDuration) !== null;\n\n  // I think this will happen only for the string \"1M\" or similar\n  if (matchDuration && matchPeriod) {\n    throw new Error(\"Ambiguous time format\");\n  }\n\n  if (matchPeriod) {\n    return {\n      type: \"DATE\",\n      interval: extractPeriodFromRegexMatch(negative, matchPeriod),\n    };\n  } else if (matchDuration) {\n    return {\n      type: \"TIME\",\n      interval: extractDurationFromRegexMatch(negative, matchDuration),\n    };\n  } else {\n    throw new Error(`Invalid human readable time: ${intervalString}`);\n  }\n};\n\n/**\n * Check if the given string can be understood as a human readable duration or period string. The\n * type parameter specifies whether the string should be a date, time, or either.\n *\n * @param time the string to check\n * @param expectedType the type of the string - either \"DATE\", \"TIME\", or \"ANY\"\n */\nexport const isValidHumanReadableIntervalString = (\n  time: string,\n  expectedType: AllowedIntervalTypesOrEither,\n): IntervalStringValidationResult => {\n  try {\n    const validationResult = parseHumanReadableIntervalString(time);\n    const actualType = validationResult.type;\n    const negative = validationResult.interval.negative;\n\n    if (actualType === expectedType || expectedType === \"DATE_OR_TIME\") {\n      return {\n        valid: true,\n        type: actualType,\n        negative,\n      };\n    } else {\n      return { valid: false };\n    }\n  } catch (_e) {\n    return { valid: false };\n  }\n};\n\n/**\n * Convert an ISO duration OR period string to an Interval object. So for example,\n * \"P1Y2M3W4D\" is fine, as is \"PT1H2M3.456S\". However, \"P1Y2M3W4D1H2M3.456S\" is not, since\n * it's a mix of both. We're more forgiving than the ISO standard, so we allow for missing parts.\n * Also, the string is allowed to be negative, so \"-P1Y2M3W4D\" is also valid.\n *\n * The string is required to have at least some content, so the strings \"\", \"P\", and \"PT\" are\n * considered invalid (also if they start with a -).\n *\n * @param isoString The ISO duration or period string.\n */\nexport const parseISOIntervalString = (isoString: string): PeriodOrDuration => {\n  isoString = isoString?.trim();\n\n  if ([\"\", \"P\", \"PT\", \"-\", \"-P\", \"-PT\"].includes(isoString)) {\n    throw new Error(\"Empty ISO duration\");\n  }\n\n  const periodRegex = /^-?P(?:(\\d+)Y)?(?:(\\d+)M)?(?:(\\d+)W)?(?:(\\d+)D)?$/;\n  const durationRegex =\n    /^-?PT(?:(\\d+)H)?(?:(\\d+)M)?(?:(\\d+)(?:[,.](\\d{1,3}))?S)?$/;\n\n  const matchPeriod = periodRegex.exec(isoString);\n  const matchDuration = durationRegex.exec(isoString);\n\n  if (matchPeriod) {\n    return {\n      type: \"DATE\",\n      interval: extractPeriodFromRegexMatch(\n        isoString.startsWith(\"-\"),\n        matchPeriod,\n      ),\n    };\n  } else if (matchDuration) {\n    return {\n      type: \"TIME\",\n      interval: extractDurationFromRegexMatch(\n        isoString.startsWith(\"-\"),\n        matchDuration,\n      ),\n    };\n  } else {\n    throw new Error(`Invalid ISO duration: ${isoString}`);\n  }\n};\n\n/**\n * Check if the given string is a valid duration or period ISO string. The type parameter\n * specifies whether the string should be a date, time, or either.\n *\n * @param isoString the string to check\n * @param type the type of the string - either \"DATE\", \"TIME\", or \"ANY\"\n */\nexport const isValidISOIntervalString = (\n  isoString: string,\n  type: AllowedIntervalTypesOrEither,\n): IntervalStringValidationResult => {\n  try {\n    const validationResult = parseISOIntervalString(isoString);\n    const actualType = validationResult.type;\n    const negative = validationResult.interval.negative;\n\n    if (actualType === type || type === \"DATE_OR_TIME\") {\n      return {\n        valid: true,\n        type: actualType,\n        negative,\n      };\n    } else {\n      return { valid: false };\n    }\n  } catch (_e) {\n    return { valid: false };\n  }\n};\n\n/**\n * Try to convert an interval string to an Interval object. The string can be either an ISO\n * duration/period string or a human readable string. If the string is not valid, an error is\n * thrown.\n *\n * @param time the time string, either ISO or human readable\n */\nexport const parseGenericIntervalString = (time: string): PeriodOrDuration => {\n  const validISO = isValidISOIntervalString(time, \"DATE_OR_TIME\");\n  const validHumanReadable = isValidHumanReadableIntervalString(\n    time,\n    \"DATE_OR_TIME\",\n  );\n  if (validISO.valid) {\n    return parseISOIntervalString(time);\n  } else if (validHumanReadable.valid) {\n    return parseHumanReadableIntervalString(time);\n  } else {\n    throw new Error(`Invalid interval string: ${time}`);\n  }\n};\n\n/**\n * Check if the given string is a valid interval string, either human readable or ISO. The type parameter\n * specifies whether the string should be a period, duration, or either.\n *\n * @param time the time string to check\n * @param type the type of the string - either \"DATE\", \"TIME\", or \"ANY\"\n */\nexport const isValidIntervalString = (\n  time: string,\n  type: AllowedIntervalTypesOrEither,\n): IntervalStringValidationResult => {\n  const validISO = isValidISOIntervalString(time, type);\n  const validHumanReadable = isValidHumanReadableIntervalString(time, type);\n  if (validISO.valid) {\n    return validISO;\n  } else if (validHumanReadable.valid) {\n    return validHumanReadable;\n  } else {\n    return { valid: false };\n  }\n};\n","/**\n * Count the number of integer digits for a given number.\n *\n * @param input number.\n * @returns number of integer digits x has. 1234 = 4 but 1234.44 is also 4.\n */\nexport default (input: number) =>\n  Math.max(Math.floor(Math.log10(Math.abs(input))), 0) + 1;\n","export class AbortError extends Error {}\n\n/**\n * Helper to create an abortable promise. Returns an AbortController and a Function\n * that you can pass your async handler to. Whenever the AbortController signal is\n * aborted then the async handler's promise will reject with an AbortError\n *\n * Example:\n * ```\n * import { abortUtils } from \"@knime/utils\"\n * const myFetchCall = async (params...) => {...};\n *\n * try {\n *   const { runAbortablePromise, abortController } = createAbortablePromise(() =>\n *     myFetchCall(params...),\n *   );\n * } catch (e) {\n *   if (e instanceof abortUtils.AbortError) {\n *     console.info('ignore due to abort');\n *     return;\n *   }\n * }\n *\n * // somewhere else (while request is in-flight)\n * abortController.abort(new abortUtils.AbortError('reason here'))\n * ```\n */\nexport const createAbortablePromise = () => {\n  const abortController: AbortController = new AbortController();\n\n  const runAbortablePromise = <T = unknown>(request: () => Promise<T>) => {\n    return new Promise<T>((resolve, reject) => {\n      // abort logic\n      const abortListener = ({ target }: Event) => {\n        abortController.signal.removeEventListener(\"abort\", abortListener);\n        const reason = (target as AbortSignal).reason;\n        reject(reason instanceof AbortError ? reason : new AbortError(reason));\n      };\n\n      // the actual call\n      request()\n        .then(resolve)\n        .catch((error) => {\n          if (error instanceof AbortError) {\n            return;\n          }\n\n          reject(error);\n        });\n\n      abortController.signal.addEventListener(\"abort\", abortListener);\n    });\n  };\n\n  return { abortController, runAbortablePromise };\n};\n","export type UnwrappedPromise<T = unknown> = {\n  resolve: (value: T | PromiseLike<T>) => void;\n  reject: (reason?: unknown) => void;\n  promise: Promise<T>;\n};\n\nexport const createUnwrappedPromise = <T>(): UnwrappedPromise<T> => {\n  let resolve: (value: T | PromiseLike<T>) => void = () => {};\n  let reject: (reason?: unknown) => void = () => {};\n\n  const promise = new Promise<T>((res, rej) => {\n    resolve = res;\n    reject = rej;\n  });\n\n  return { resolve, reject, promise };\n};\n","/**\n * Returns promise that resolves after ms.\n */\nexport default function sleep(ms: number) {\n  return new Promise((resolve) => setTimeout(resolve, ms));\n}\n","import sleep from \"../sleep\";\n\nexport const DEFAULT_RETRY_DELAY_MS = 0;\nexport const DEFAULT_RETRY_COUNT = 5;\n\n/**\n * Helper to add retry capability to an async function\n * @param fn async function\n * @param retryCount max number of retries. defaults to 5\n * @param retryDelayMS delay in-between retries in millisecs. defaults to 0\n * @param excludeError predicate fn to exclude specific errors from causing a retry\n */\nexport async function retryPromise<T>({\n  fn,\n  retryCount = DEFAULT_RETRY_COUNT,\n  retryDelayMS = DEFAULT_RETRY_DELAY_MS,\n  excludeError,\n}: {\n  fn: () => Promise<T>;\n  retryCount?: number;\n  retryDelayMS?: number;\n  excludeError?: (error: Error) => boolean;\n}) {\n  try {\n    return await fn();\n  } catch (error) {\n    if (excludeError?.(error as Error)) {\n      throw error;\n    }\n\n    if (retryCount > 0) {\n      await sleep(retryDelayMS);\n\n      // eslint-disable-next-line no-return-await\n      return await retryPromise({\n        fn,\n        retryCount: retryCount - 1,\n        retryDelayMS,\n        excludeError,\n      });\n    }\n\n    throw error;\n  }\n}\n","export * from \"./createAbortablePromise\";\nexport * from \"./createUnwrappedPromise\";\nexport * from \"./retryPromise\";\n","import DomPurify from \"dompurify\";\n\nconst ALLOWED_TAGS = [\n  \"p\",\n  \"div\",\n  \"h1\",\n  \"h2\",\n  \"h3\",\n  \"h4\",\n  \"h5\",\n  \"h6\",\n  \"ul\",\n  \"ol\",\n  \"li\",\n  \"blockquote\",\n  \"b\",\n  \"i\",\n  \"s\",\n  \"u\",\n  \"sup\",\n  \"sub\",\n  \"ins\",\n  \"del\",\n  \"strong\",\n  \"strike\",\n  \"tt\",\n  \"code\",\n  \"big\",\n  \"small\",\n  \"br\",\n  \"span\",\n  \"em\",\n];\n\n/**\n * Sanitizes Raw HTML and only allow specific tags to be used, as per OWASP standards.\n * @param rawHTML\n * @param options.allowStyleAttribute - Allow the style attribute on elements\n * @param options.allowHyperlinks - Allow anchor tags with href attribute\n * @returns sanitized html\n */\nconst sanitizeHTML = (\n  rawHTML: string,\n  options: { allowStyleAttribute?: boolean; allowHyperlinks?: boolean } = {\n    allowStyleAttribute: false,\n    allowHyperlinks: false,\n  },\n) => {\n  const { allowStyleAttribute, allowHyperlinks } = options;\n  const ALLOWED_ATTR = [\n    ...(allowStyleAttribute ? [\"style\"] : []),\n    ...(allowHyperlinks ? [\"href\"] : []),\n  ];\n  const allowedTags = allowHyperlinks ? [...ALLOWED_TAGS, \"a\"] : ALLOWED_TAGS;\n\n  return DomPurify.sanitize(rawHTML, {\n    ALLOWED_TAGS: allowedTags,\n    ALLOWED_ATTR,\n  });\n};\n\n/**\n * Removes any HTML tag from the input string. Keeps HTML entities\n * (e.g &nbsp; because these can be considered plain text)\n * @param rawHTML\n * @returns plain text\n */\nconst stripHTML = (rawHTML: string) => {\n  return DomPurify.sanitize(rawHTML, { ALLOWED_TAGS: [], ALLOWED_ATTR: [] });\n};\n\nexport const sanitization = { sanitizeHTML, stripHTML };\n","const defaultMaxLength = 160;\n\n// truncates a string to a given max length\nexport default (string = \"\", maxLength = defaultMaxLength) => {\n  const dots = string.length > maxLength ? \"…\" : \"\";\n  return `${string.substring(0, maxLength - 1)}${dots}`;\n};\n","/**\n * Gets the file extension\n * @param nameOrPath can take a full file name (e.g \"file.txt\") or a path to a file\n * (e.g \"file://path/to/file.txt\" OR \"/path/to/file.txt\")\n * @returns just the file extension (e.g \"txt\")\n */\nexport const getFileExtension = (nameOrPath: string): string => {\n  const basename = nameOrPath.split(/[\\\\/]/).pop() ?? \"\";\n\n  const parts = basename.split(\".\");\n\n  if (basename === \"\" || parts.length === 1) {\n    return \"\";\n  }\n\n  return parts.at(-1) ?? \"\";\n};\n\ntype FileLike = { name: string; type: string };\n\n/**\n * Metadata for .knar files, which corresponds to exported KNIME Workflow Groups\n * or Components\n */\nconst KNAR = Object.freeze({\n  extension: \"knar\",\n  mimeType: \"application/vnd.knime.workflow-group+zip\",\n  matches(file: FileLike) {\n    const extension = getFileExtension(file.name);\n    return extension === this.extension;\n  },\n});\n\n/**\n * Metadata for .knwf files, which corresponds to exported KNIME Workflows\n */\nconst KNWF = Object.freeze({\n  extension: \"knwf\",\n  mimeType: \"application/vnd.knime.workflow+zip\",\n  matches(file: FileLike) {\n    const extension = getFileExtension(file.name);\n    return extension === this.extension;\n  },\n  /**\n   * Gets the name of a .knwf file without the extension. If the file is not\n   * matched as a .knwf file then this function will return the default value,\n   * which is empty string (\"\") if param is not provided\n   */\n  getNameOrDefault(file: FileLike, defaultValue = \"\"): string {\n    if (!this.matches(file)) {\n      return defaultValue;\n    }\n\n    return file.name.replace(`.${this.extension}`, \"\");\n  },\n});\n\nexport const knimeFileFormats = { KNAR, KNWF };\n\n/**\n * Gets the mime type from a given file. Defaults to `application/octet-stream`\n * if mimeType cannot be detected\n * @param file File\n * @returns mimeType\n */\nexport const getFileMimeType = (file: FileLike): string => {\n  const DEFAULT_MIMETYPE = \"application/octet-stream\";\n\n  const extension = getFileExtension(file.name);\n\n  if (!extension) {\n    return DEFAULT_MIMETYPE;\n  }\n\n  if (KNWF.matches(file)) {\n    return KNWF.mimeType;\n  }\n\n  if (KNAR.matches(file)) {\n    return KNAR.mimeType;\n  }\n\n  // file has extension but unrecognizable mime type\n  if (!file.type) {\n    return DEFAULT_MIMETYPE;\n  }\n\n  return file.type;\n};\n","/**\n * Platforms that influence how modifier keys are rendered. macOS substitutes\n * dedicated glyphs (`⌘`, `⌥`, `⇧`, …), every other platform uses the textual\n * rendering (`Ctrl`, `Alt`, `Shift`, …).\n */\nexport const hotkeyPlatform = {\n  MAC_OS: \"macOS\",\n  OTHER: \"other\",\n} as const;\n\nexport const hotkeyPlatforms = Object.values(hotkeyPlatform);\n","/**\n *\n * @returns true if the platform of the user is Mac\n */\nexport const isMac = (): boolean =>\n  navigator?.userAgent?.toLowerCase()?.includes(\"mac\");\n\n/**\n *\n * @returns true if the platform of the user is Windows\n */\nexport const isWindows = (): boolean =>\n  navigator?.userAgent?.toLowerCase()?.includes(\"windows\");\n","import { isMac } from \"../platform/navigator\";\n\nimport { hotkeyPlatform } from \"./enums\";\nimport type { Hotkey, HotkeyPlatform } from \"./types\";\n\nconst globalKeyMap = {\n  ArrowUp: \"↑\",\n  ArrowDown: \"↓\",\n  ArrowLeft: \"←\",\n  ArrowRight: \"→\",\n  Enter: \"↵\",\n  \" \": \"Space\", // we use event.key and there space is an actual space not the code \"Space\"\n  CtrlOrCmd: \"Ctrl\",\n} as const;\n\nconst MacOSkeyMap = {\n  Shift: \"⇧\",\n  Delete: \"⌫\",\n  CtrlOrCmd: \"⌘\",\n  Ctrl: \"⌃\",\n  Alt: \"⌥\",\n  Enter: \"↩\",\n} as const;\n\ntype KeyFormatMap = typeof MacOSkeyMap | typeof globalKeyMap;\n\n/**\n * Returns a string representation of a single hotkey. Replaces some special key names with symbols.\n *\n * By default the platform is auto-detected from the user agent via `isMac()`.\n * Pass `platform` to force a specific platform's glyphs — useful for SSR,\n * tests, or rendering multiple platforms on the same page.\n */\nexport const formatHotkey = (\n  hotkey: Hotkey,\n  platform?: HotkeyPlatform,\n): string => {\n  /**\n   * Returns the symbol corresponding to the `key` based on the given\n   * `formatMap`. Otherwise, if not found, returns the same `key` value given\n   */\n  const mapSymbols = (formatMap: KeyFormatMap) => (key: Hotkey) =>\n    formatMap[key as keyof KeyFormatMap] ?? key;\n\n  /**\n   * Pipe function implementation. Receives a list of functions to execute in order\n   * and will pipe the parameter passed at the end to each function returning the final output\n   */\n  const pipe = <T extends () => string>(\n    ...fns: Array<(...args: Hotkey[]) => ReturnType<T>>\n  ) =>\n    fns.reduce(\n      (f, g) => (arg) => g(f(arg)),\n      (arg: Hotkey) => arg as ReturnType<T>,\n    );\n\n  const macKeyFormatter = pipe(\n    mapSymbols(MacOSkeyMap),\n    mapSymbols(globalKeyMap),\n  );\n\n  const generalKeyFormatter = mapSymbols(globalKeyMap);\n\n  const useMacFormatter =\n    platform === undefined ? isMac() : platform === hotkeyPlatform.MAC_OS;\n  return useMacFormatter\n    ? macKeyFormatter(hotkey)\n    : generalKeyFormatter(hotkey);\n};\n\nexport const getDefaultSeparator = () => (isMac() ? \" \" : \"+\");\n\n/**\n * Returns a string representation of a list of hotkeys. Replaces some special key names with symbols\n */\nexport const formatHotkeys = (\n  hotkeys: Array<Hotkey>,\n  getSeparator = getDefaultSeparator,\n) => hotkeys.map((hotkey) => formatHotkey(hotkey)).join(getSeparator());\n\n/**\n * Appends a formatted hotkey shortcut to the given string. Useful for tooltips\n */\nexport const textWithHotkeys = (text: string, hotkeys: Array<Hotkey>) => {\n  return `${text} – ${formatHotkeys(hotkeys)}`;\n};\n","import * as navigatorUtils from \"../platform/navigator\";\n\nimport type { Hotkey } from \"./types\";\n\n/**\n * Checks whether a pressed `Digit` key falls within a numeric hotkey range such\n * as `1-9`.\n * @param keyCode - The `KeyboardEvent.code` to check (e.g. `Digit5`).\n * @param hotkey - The hotkey token, expected to be a single-digit range like `1-9`.\n * @returns True if the pressed digit lies within the inclusive range.\n */\nconst isDigitKeyInRange = (keyCode: string, hotkey: Hotkey): boolean => {\n  // Digit keys exist from 0 to 9, so valid ranges always have length 3\n  const digitRangeLength = 3;\n  if (hotkey.length !== digitRangeLength || !keyCode?.startsWith(\"Digit\")) {\n    return false;\n  }\n\n  const keyNumber = Number(keyCode.slice(\"Digit\".length));\n  const [lower, upper] = hotkey.split(\"-\");\n\n  return (\n    Boolean(lower) &&\n    Boolean(upper) &&\n    Number.parseInt(lower, 10) <= keyNumber &&\n    keyNumber <= Number.parseInt(upper, 10)\n  );\n};\n\n/**\n * Checks whether a keyboard event matches a hotkey definition. The last token is\n * treated as the character; any preceding tokens are modifiers. The special\n * `CtrlOrCmd` modifier resolves to the platform's primary modifier (Meta/`⌘` on\n * macOS, Ctrl elsewhere).\n * @param event - The keyboard event to check.\n * @param hotkeys - The ordered hotkey tokens (modifiers followed by the character).\n * @returns True if the event matches the given hotkey, otherwise false.\n */\nexport const match = (event: KeyboardEvent, hotkeys: Hotkey[]): boolean => {\n  const { key, code, metaKey, ctrlKey, shiftKey, altKey } = event;\n\n  const modifiers = hotkeys.slice(); // copy so pop() doesn't mutate the caller's array\n  const character = modifiers.pop() ?? \"\";\n\n  // our special CtrlOrCmd has to match \"Command ⌘\" (metaKey) on Mac, and Ctrl-Key on other systems\n  const ctrlOrMeta = navigatorUtils.isMac() ? \"Meta\" : \"Ctrl\";\n  const platformModifiers = new Set(\n    modifiers.map((modifier) =>\n      modifier === \"CtrlOrCmd\" ? ctrlOrMeta : modifier,\n    ),\n  );\n\n  const metaMatches = Boolean(metaKey) === platformModifiers.has(\"Meta\");\n  const ctrlMatches = Boolean(ctrlKey) === platformModifiers.has(\"Ctrl\");\n  const shiftMatches = Boolean(shiftKey) === platformModifiers.has(\"Shift\");\n  const altMatches = Boolean(altKey) === platformModifiers.has(\"Alt\");\n\n  const keysMatch =\n    // keys are matched case insensitively\n    key.toUpperCase() === character.toUpperCase() ||\n    (character.includes(\"-\") && isDigitKeyInRange(code, character)) ||\n    // on mac 'backspace' can be used instead of delete\n    (navigatorUtils.isMac() && character === \"Delete\" && key === \"Backspace\");\n\n  return metaMatches && ctrlMatches && shiftMatches && altMatches && keysMatch;\n};\n","import * as navigatorUtils from \"../platform/navigator\";\n\n/**\n * Checks if any modifier key (Ctrl, Meta, Alt, or Shift) is pressed.\n * @param event - The keyboard event to check.\n * @returns True if a modifier key is pressed, otherwise false.\n */\nexport const isModifierKeyPressed = (event: KeyboardEvent): boolean => {\n  return event.ctrlKey || event.metaKey || event.altKey || event.shiftKey;\n};\n\n/**\n * Checks if a specific key (or keys) were pressed without any modifier keys.\n * @param event - The keyboard event to check.\n * @param keys - The key or keys to check for.\n * @returns True if the specified key(s) were pressed without modifiers, otherwise false.\n */\nexport const isKeyWithoutModifiers = (\n  event: KeyboardEvent,\n  keys: string | string[],\n): boolean => {\n  const keyList = Array.isArray(keys) ? keys : [keys];\n  return keyList.includes(event.key) && !isModifierKeyPressed(event);\n};\n\n/**\n * Returns the name of the primary modifier key for the current platform.\n */\nexport const getMetaOrCtrlKey = (): \"ctrlKey\" | \"metaKey\" => {\n  return navigatorUtils.isMac() ? \"metaKey\" : \"ctrlKey\";\n};\n","import { hotkeyPlatform } from \"./enums\";\nimport {\n  formatHotkey,\n  formatHotkeys,\n  getDefaultSeparator,\n  textWithHotkeys,\n} from \"./format\";\nimport { match } from \"./match\";\n\n/**\n * Grouped keyboard-shortcut helpers, exposed as a single namespace for\n * ergonomic access (e.g. `hotkeys.formatHotkey`).\n */\nexport const hotkeys = {\n  formatHotkeys,\n  formatHotkey,\n  getDefaultSeparator,\n  hotkeyPlatform,\n  textWithHotkeys,\n  match,\n};\n\nexport { match };\nexport {\n  getMetaOrCtrlKey,\n  isKeyWithoutModifiers,\n  isModifierKeyPressed,\n} from \"./modifiers\";\nexport type { Hotkey, HotkeyPlatform, KnownHotkey } from \"./types\";\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAKA,IAAa,cAAc,UACzB,MAAM,OAAO,CAAC,CAAC,CAAC,YAAY,IAAI,MAAM,UAAU,CAAC;AAEnD,IAAM,UAAU;CACd,eAAe,OAAe,cAC5B,WAAW,MAAM,QAAQ,WAAW,GAAG,CAAC,CAAC,YAAY,CAAC;CAExD,cAAc,UAAkB,QAAQ,aAAa,OAAO,GAAG;CAC/D,cAAc,UAAkB,QAAQ,aAAa,OAAO,GAAG;CAE/D,kBAAkB,UAChB,YACG,MAAM,MAAM,kBAAkB,KAAK,CAAC,EAAA,CAClC,MAAM,GAAG,EAAE,CAAC,CACZ,KAAK,GAAG,CAAC,CACT,YAAY,CACjB;AACJ;AAQA,IAAa,iBAAiB,EAC5B,QACA,WACA,aAC0B;CAC1B,IAAI,WACF,OAAO,QAAQ,aAAa,QAAQ,SAAS;CAG/C,IAAI,QACF,OAAO,QAAQ,OAAO,CAAC,QAAQ,aAAa,EAAE;CAGhD,OAAO,WAAW,MAAM;AAC1B;;;;;;;;;;;ACnCA,IAAA,sBAAgB,MAAY,SAAsB;CAEhD,IAAI,MAAM;EAER,OAAO,QAAQ,IAAI,IAAI,OAAO,IAAI,KAAK,KAAK,IAAI,GAAG,CAAC,CAAC;EACrD,OAAO,IAAI,MAAM;GACf,MAAM,QAAQ,IAAI;GAClB,OAAO,SAAS,IAAI;GACpB,MAAM,QAAQ,IAAI;EACpB,CAAC;CACH;CAEA,OAAO;AACT;;;;;;;;;;;ACdA,IAAA,sBAAgB,MAAY,SAAsB;CAChD,MAAM,IAAI,IAAI,KAAK,IAAI;CAEvB,IAAI,MAAM;EACR,EAAE,SAAS,KAAK,SAAS,CAAC;EAC1B,EAAE,WAAW,KAAK,WAAW,CAAC;EAC9B,EAAE,WAAW,KAAK,WAAW,CAAC;EAC9B,EAAE,gBAAgB,KAAK,gBAAgB,CAAC;CAC1C;CACA,OAAO;AACT;;;;;;;;;;;ACLA,IAAa,mBACX,MACA,KACA,WACA,cACG;CACH,IAAI,KAAK;EACP,IAAI,aAAa,WACf,OAAO,SAAS,MAAM,GAAG;EAE3B,IAAI,WAAW;GAEb,MAAM,uBAAO,IAAI,KAAK,CAAC;GACvB,OAAO,SAAS,mBAAW,MAAM,IAAI,GAAG,mBAAW,MAAM,GAAG,CAAC;EAC/D;EACA,IAAI,WAAW;GAEb,MAAM,uBAAO,IAAI,KAAK,CAAC;GACvB,OAAO,SAAS,mBAAW,MAAM,IAAI,GAAG,mBAAW,MAAM,GAAG,CAAC;EAC/D;CACF;CACA,OAAO;AACT;;;;;;;;;AAUA,IAAa,kBACX,MACA,KACA,WACA,cACG;CACH,IAAI,KAAK;EACP,IAAI,aAAa,WACf,OAAO,QAAQ,MAAM,GAAG;EAE1B,IAAI,WAAW;GAEb,MAAM,uBAAO,IAAI,KAAK,CAAC;GACvB,OAAO,QAAQ,mBAAW,MAAM,IAAI,GAAG,mBAAW,MAAM,GAAG,CAAC;EAC9D;EACA,IAAI,WAAW;GAEb,MAAM,uBAAO,IAAI,KAAK,CAAC;GACvB,OAAO,QAAQ,mBAAW,MAAM,IAAI,GAAG,mBAAW,MAAM,GAAG,CAAC;EAC9D;CACF;CACA,OAAO;AACT;;;AC9DA,IAAM,YAAe,UAA2B,SAAiB;CAC/D,IAAI;CACJ,IAAI,WAAW;CAEf,QAAQ,GAAG,SAAsC;EAC/C,MAAM,CAAC,OAAO,SAAS;EACvB,aAAa,KAAK;EAClB,MAAM,MAAM,KAAK,IAAI;EAGrB,IAFyB,MAAM,WAER,MAAM;GAC3B,WAAW;GACX,SAAS,OAAO,KAAK;EACvB,OACE,QAAQ,iBAAiB;GACvB,WAAW;GACX,SAAS,OAAO,KAAK;EACvB,GAAG,IAAI;CAEX;AACF;ACqFA,IAAa,UAGT,OAAO,OAAO,CAAC,GAAG,GAAG;CA7EvB;EACE,IAAI;EACJ,UAAU,YAAY,qBAAqB;GACzC,OAAO,sBAAsB,aAAa,WAAW,YAAY;EACnE;EACA,KAAK,MAAM,sBAAsB,qBAAqB,eAAe;GAEnE,MAAM,WADW,sBAAsB,OAAO,KAAK,YAAY,EAAA,CACtC,SAAS,oBAAoB;GACtD,OAAO,gBAAgB,CAAC,UAAU;EACpC;CACF;CACA;EACE,IAAI;EACJ,UAAU,YAAY,qBAAqB;GAGzC,IAAI,WAAW,SAAS,GAQtB,aAAa,IAPa,WAAW,QACnC,0BACA,MAEyB,CAAA,CACxB,QAAQ,OAAO,IAAI,CAAC,CACpB,QAAQ,OAAO,IACD,EAAmB;QAEpC,OAAO,EAAE,YAAY,MAAM;GAE7B,IAAI;IAEF,OAAO,IAAI,OAAO,YADJ,sBAAsB,KAAK,GACN;GACrC,SAAS,QAAQ;IAGf,OAAO;GACT;EACF;EACA,KAAK,MAAM,sBAAsB,qBAAqB,eAAe;GACnE,MAAM,UAAU,qBAAqB,KAAK,IAAI;GAC9C,OAAO,gBAAgB,CAAC,UAAU;EACpC;CACF;CACA;EACE,IAAI;EACJ,UAAU,YAAY,qBAAqB;GACzC,IAAI;IACF,MAAM,QAAQ,sBAAsB,KAAK;IACzC,OAAO,IAAI,OAAO,KAAK,WAAW,KAAK,KAAK;GAC9C,SAAS,QAAQ;IAGf,OAAO;GACT;EACF;EACA,KAAK,MAAM,sBAAsB,qBAAqB,eAAe;GACnE,MAAM,UAAU,qBAAqB,KAAK,IAAI;GAC9C,OAAO,gBAAgB,CAAC,UAAU;EACpC;CACF;CACA;EACE,IAAI;EACJ,UAAU,eAAe;GACvB,OAAO,EAAE,OAAO,SAAiB,cAAc,SAAS,IAAI,EAAE;EAChE;EACA,KAAK,MAAM,sBAAsB;GAC/B,IAAI,OAAO,SAAS,aAClB,OAAO;GAET,OAAO,qBAAqB,KAAK,IAAI;EACvC;CACF;AAOuB,CAAA,CAAgB,KAAK,SAAS,GAAG,IAAI,KAAK,IAAI,EAAE,CAAC;;;;;;;;AC3G1E,IAAA,8BAAqB,KAAK,eAAe,CAAC,CAAC,gBAAgB,CAAC,CAAC;;;;;;;;;;;ACK7D,IAAa,oBACX,YACA,cAAc,UACX;CACH,MAAM,OAAO,IAAI,KAAK,UAAU;CAGhC,IAAI,MAAM,IAAI,GACZ,MAAM,MAAM,qBAAqB;CAGnC,MAAM,kBAA8C;EAClD,KAAK;EACL,OAAO;EACP,MAAM;CACR;CAIA,MAAM,cAA0C,cAC5C;EAAE,GAAG;EAAiB,UAAU,sBAAiB;CAAE,IACnD;CAEJ,OAAO,KAAK,mBAAmB,SAAS,WAAW;AACrD;;;;;;;;;AAUA,IAAa,oBACX,YACA,cAAc,UACX;CACH,MAAM,OAAO,IAAI,KAAK,UAAU;CAGhC,IAAI,MAAM,IAAI,GACZ,MAAM,MAAM,qBAAqB;CAKnC,MAAM,kBAA8C;EAClD,MAAM;EACN,QAAQ;CACV;CAEA,MAAM,cAA0C,cAC5C;EAAE,GAAG;EAAiB,UAAU,sBAAiB;CAAE,IACnD;CAEJ,OAAO,KAAK,mBAAmB,SAAS,WAAW;AACrD;;;;;;;;;;AAWA,IAAa,wBACX,gBACA,cAAc,UACX;CACH,OAAO,GAAG,iBAAiB,gBAAgB,WAAW,EAAE,GAAG,iBACzD,gBACA,WACF;AACF;;;;;;;;;AAUA,IAAa,6BAA6B,MAAc,aACtD,WAAW,qBAAqB,MAAM,IAAI,IAAI,iBAAiB,MAAM,IAAI;AAE3E,IAAa,kBAAkB,UAA0B;CAGvD,OAAO,YAFW,OAAO,SAAS,KAAK,KAAK,SAAS,IAAI,QAAQ,CAErC;AAC9B;;;ACxGA,IAAM,6BAA6B;CACjC,IAAI,UAAU,UAAU;CACxB,OAAO,SAAS,YACd,UAAU,SAAS,YAAY;CAEjC,OAAO;AACT;;;;;;;;;;ACCA,IAAA,iCAAgB,OAAe,YAC3B,QAAQ,SAAU,UAAU;;;;;;;;;;;;;;AC6BhC,IAAM,+BACJ,UACA,UACW;CACX,OAAO;EACL;EACA,OAAO,SAAS,MAAM,MAAM,KAAK,EAAE;EACnC,QAAQ,SAAS,MAAM,MAAM,KAAK,EAAE;EACpC,OAAO,SAAS,MAAM,MAAM,KAAK,EAAE;EACnC,MAAM,SAAS,MAAM,MAAM,KAAK,EAAE;CACpC;AACF;AAEA,IAAM,iCACJ,UACA,UACa;CAEb,MAAM,eAAe,SAAS,MAAM,EAAE,EAAE,OAAO,GAAG,GAAG,KAAK,KAAK,EAAE;CAEjE,OAAO;EACL;EACA,OAAO,SAAS,MAAM,MAAM,KAAK,EAAE;EACnC,SAAS,SAAS,MAAM,MAAM,KAAK,EAAE;EACrC,SAAS,SAAS,MAAM,MAAM,KAAK,EAAE;EACrC;CACF;AACF;AAEA,IAAa,UAAU,aAAwC;CAC7D,IAAI,SAAS,SAAS,QACpB,OACE,SAAS,SAAS,UAAU,KAC5B,SAAS,SAAS,WAAW,KAC7B,SAAS,SAAS,UAAU,KAC5B,SAAS,SAAS,SAAS;MAG7B,OACE,SAAS,SAAS,UAAU,KAC5B,SAAS,SAAS,YAAY,KAC9B,SAAS,SAAS,YAAY,KAC9B,SAAS,SAAS,iBAAiB;AAGzC;;;;;;;;;;;;;AAcA,IAAa,qCACX,aACW;CACX,IAAI,SAAS;CAEb,IAAI,SAAS,SAAS,QACpB,UAAU,GAAG,SAAS,SAAS,MAAM,GAAG,SAAS,SAAS,OAAO,GAAG,SAAS,SAAS,MAAM,GAAG,SAAS,SAAS,KAAK;MAEtH,UAAU,IAAI,SAAS,SAAS,MAAM,GAAG,SAAS,SAAS,QAAQ,GAAG,SAAS,SAAS,QAAQ,GAAG,SAAS,SAAS,aAClH,SAAS,CAAC,CAEV,SAAS,GAAG,GAAG,EAAE;CAGtB,IAAI,SAAS,SAAS,UACpB,SAAS,IAAI;CAEf,OAAO;AACT;;;;;;;;;;AAWA,IAAa,+CACX,aACW;CACX,MAAM,cAAc,OAAe,SAAyB;EAC1D,IAAI,UAAU,GACZ,OAAO;OACF,IAAI,UAAU,GACnB,OAAO,GAAG,MAAM,GAAG,KAAK;OAExB,OAAO,GAAG,MAAM,GAAG,KAAK;CAE5B;CAEA,IAAI,SAAS;CAEb,IAAI,SAAS,SAAS,QAAQ;EAC5B,IAAI,OAAO,QAAQ,GACjB,OAAO;EAGT,UAAU,WAAW,SAAS,SAAS,OAAO,MAAM;EACpD,UAAU,WAAW,SAAS,SAAS,QAAQ,OAAO;EACtD,UAAU,WAAW,SAAS,SAAS,OAAO,MAAM;EACpD,UAAU,WAAW,SAAS,SAAS,MAAM,KAAK;CACpD,OAAO;EACL,IAAI,OAAO,QAAQ,GACjB,OAAO;EAGT,UAAU,WAAW,SAAS,SAAS,OAAO,MAAM;EACpD,UAAU,WAAW,SAAS,SAAS,SAAS,QAAQ;EAExD,MAAM,mBAAmB,SAAS,SAAS,iBAAiB;EAC5D,IAAI,SAAS,SAAS,YAAY,KAAK,CAAC,kBACtC,IAAI,kBACF,UAAU,WAAW,SAAS,SAAS,SAAS,QAAQ;OAExD,UAAU,GAAG,SAAS,SAAS,QAAQ,GAAG,SAAS,SAAS,aAAa,SAAS,CAAC,CAAC,SAAS,GAAG,GAAG,EAAE;CAG3G;CAEA,IAAI,SAAS,SAAS,UACpB,SAAS,KAAK,OAAO,KAAK,EAAE;CAG9B,OAAO,OAAO,KAAK;AACrB;AAEA,IAAM,YAAY;AAClB,IAAM,aAAa;AACnB,IAAM,YAAY;AAClB,IAAM,WAAW;AACjB,IAAM,YAAY;AAClB,IAAM,cAAc;AACpB,IAAM,cAAc;;;;AAKpB,IAAM,2BAA2B,IAAI,OACnC,OAAO,UAAU,WAAW,WAAW,WAAW,UAAU,WAAW,SAAS,UAChF,GACF;;;;AAKA,IAAM,6BAA6B,IAAI,OACrC,OAAO,UAAU,WAAW,YAAY,WAAW,YAAY,MAC/D,GACF;;;;AAKA,IAAM,mCAAmC,IAAI,OAC3C,oBAAoB,yBAAyB,OAAO,QAAQ,SAAS,EAAE,EAAE,eACzE,GACF;;;;AAKA,IAAM,kDAAkD,IAAI,OAC1D,oBAAoB,UAAU,GAAG,WAAW,GAAG,UAAU,GAAG,SAAS,SACrE,GACF;;;;AAKA,IAAM,qCAAqC,IAAI,OAC7C,oBAAoB,2BAA2B,OAAO,QAAQ,SAAS,EAAE,EAAE,eAC3E,GACF;;;;AAKA,IAAM,oDAAoD,IAAI,OAC5D,oBAAoB,UAAU,GAAG,YAAY,GAAG,YAAY,SAC5D,GACF;;;;;;;;;;;;;;AAeA,IAAa,oCACX,mBACqB;CACrB,iBAAiB,gBAAgB,KAAK;CAEtC,IAAI,CAAC,gBACH,MAAM,IAAI,MAAM,uBAAuB;CAGzC,MAAM,sBAAsB,yBAAyB,KAAK,cAAc;CACxE,MAAM,sBACJ,iCAAiC,KAAK,cAAc,KACpD,gDAAgD,KAAK,cAAc;CACrE,MAAM,wBAAwB,2BAA2B,KAAK,cAAc;CAC5E,MAAM,wBACJ,mCAAmC,KAAK,cAAc,KACtD,kDAAkD,KAAK,cAAc;CAEvE,MAAM,cAAc,uBAAuB;CAC3C,MAAM,gBAAgB,yBAAyB;CAC/C,MAAM,YAAY,uBAAuB,2BAA2B;CAGpE,IAAI,iBAAiB,aACnB,MAAM,IAAI,MAAM,uBAAuB;CAGzC,IAAI,aACF,OAAO;EACL,MAAM;EACN,UAAU,4BAA4B,UAAU,WAAW;CAC7D;MACK,IAAI,eACT,OAAO;EACL,MAAM;EACN,UAAU,8BAA8B,UAAU,aAAa;CACjE;MAEA,MAAM,IAAI,MAAM,gCAAgC,gBAAgB;AAEpE;;;;;;;;AASA,IAAa,sCACX,MACA,iBACmC;CACnC,IAAI;EACF,MAAM,mBAAmB,iCAAiC,IAAI;EAC9D,MAAM,aAAa,iBAAiB;EACpC,MAAM,WAAW,iBAAiB,SAAS;EAE3C,IAAI,eAAe,gBAAgB,iBAAiB,gBAClD,OAAO;GACL,OAAO;GACP,MAAM;GACN;EACF;OAEA,OAAO,EAAE,OAAO,MAAM;CAE1B,SAAS,IAAI;EACX,OAAO,EAAE,OAAO,MAAM;CACxB;AACF;;;;;;;;;;;;AAaA,IAAa,0BAA0B,cAAwC;CAC7E,YAAY,WAAW,KAAK;CAE5B,IAAI;EAAC;EAAI;EAAK;EAAM;EAAK;EAAM;CAAK,CAAC,CAAC,SAAS,SAAS,GACtD,MAAM,IAAI,MAAM,oBAAoB;CAGtC,MAAM,cAAc;CACpB,MAAM,gBACJ;CAEF,MAAM,cAAc,YAAY,KAAK,SAAS;CAC9C,MAAM,gBAAgB,cAAc,KAAK,SAAS;CAElD,IAAI,aACF,OAAO;EACL,MAAM;EACN,UAAU,4BACR,UAAU,WAAW,GAAG,GACxB,WACF;CACF;MACK,IAAI,eACT,OAAO;EACL,MAAM;EACN,UAAU,8BACR,UAAU,WAAW,GAAG,GACxB,aACF;CACF;MAEA,MAAM,IAAI,MAAM,yBAAyB,WAAW;AAExD;;;;;;;;AASA,IAAa,4BACX,WACA,SACmC;CACnC,IAAI;EACF,MAAM,mBAAmB,uBAAuB,SAAS;EACzD,MAAM,aAAa,iBAAiB;EACpC,MAAM,WAAW,iBAAiB,SAAS;EAE3C,IAAI,eAAe,QAAQ,SAAS,gBAClC,OAAO;GACL,OAAO;GACP,MAAM;GACN;EACF;OAEA,OAAO,EAAE,OAAO,MAAM;CAE1B,SAAS,IAAI;EACX,OAAO,EAAE,OAAO,MAAM;CACxB;AACF;;;;;;;;AASA,IAAa,8BAA8B,SAAmC;CAC5E,MAAM,WAAW,yBAAyB,MAAM,cAAc;CAC9D,MAAM,qBAAqB,mCACzB,MACA,cACF;CACA,IAAI,SAAS,OACX,OAAO,uBAAuB,IAAI;MAC7B,IAAI,mBAAmB,OAC5B,OAAO,iCAAiC,IAAI;MAE5C,MAAM,IAAI,MAAM,4BAA4B,MAAM;AAEtD;;;;;;;;AASA,IAAa,yBACX,MACA,SACmC;CACnC,MAAM,WAAW,yBAAyB,MAAM,IAAI;CACpD,MAAM,qBAAqB,mCAAmC,MAAM,IAAI;CACxE,IAAI,SAAS,OACX,OAAO;MACF,IAAI,mBAAmB,OAC5B,OAAO;MAEP,OAAO,EAAE,OAAO,MAAM;AAE1B;;;;;;;;;AC3aA,IAAA,4BAAgB,UACd,KAAK,IAAI,KAAK,MAAM,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI;;;ACPzD,IAAa,aAAb,cAAgC,MAAM,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;AA2BvC,IAAa,+BAA+B;CAC1C,MAAM,kBAAmC,IAAI,gBAAgB;CAE7D,MAAM,uBAAoC,YAA8B;EACtE,OAAO,IAAI,SAAY,SAAS,WAAW;GAEzC,MAAM,iBAAiB,EAAE,aAAoB;IAC3C,gBAAgB,OAAO,oBAAoB,SAAS,aAAa;IACjE,MAAM,SAAU,OAAuB;IACvC,OAAO,kBAAkB,aAAa,SAAS,IAAI,WAAW,MAAM,CAAC;GACvE;GAGA,QAAQ,CAAC,CACN,KAAK,OAAO,CAAC,CACb,OAAO,UAAU;IAChB,IAAI,iBAAiB,YACnB;IAGF,OAAO,KAAK;GACd,CAAC;GAEH,gBAAgB,OAAO,iBAAiB,SAAS,aAAa;EAChE,CAAC;CACH;CAEA,OAAO;EAAE;EAAiB;CAAoB;AAChD;;;ACjDA,IAAa,+BAAuD;CAClE,IAAI,gBAAqD,CAAC;CAC1D,IAAI,eAA2C,CAAC;CAEhD,MAAM,UAAU,IAAI,SAAY,KAAK,QAAQ;EAC3C,UAAU;EACV,SAAS;CACX,CAAC;CAED,OAAO;EAAE;EAAS;EAAQ;CAAQ;AACpC;;;;;;ACbA,SAAwB,MAAM,IAAY;CACxC,OAAO,IAAI,SAAS,YAAY,WAAW,SAAS,EAAE,CAAC;AACzD;;;;;;;;ACOA,eAAsB,aAAgB,EACpC,IACA,aAAA,GACA,eAAA,GACA,gBAMC;CACD,IAAI;EACF,OAAO,MAAM,GAAG;CAClB,SAAS,OAAO;EACd,IAAI,eAAe,KAAc,GAC/B,MAAM;EAGR,IAAI,aAAa,GAAG;GAClB,MAAM,MAAM,YAAY;GAGxB,OAAO,MAAM,aAAa;IACxB;IACA,YAAY,aAAa;IACzB;IACA;GACF,CAAC;EACH;EAEA,MAAM;CACR;AACF;;;;;;;;;;;;;AE1CA,IAAM,eAAe;CACnB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF;;;;;;;;AASA,IAAM,gBACJ,SACA,UAAwE;CACtE,qBAAqB;CACrB,iBAAiB;AACnB,MACG;CACH,MAAM,EAAE,qBAAqB,oBAAoB;CACjD,MAAM,eAAe,CACnB,GAAI,sBAAsB,CAAC,OAAO,IAAI,CAAC,GACvC,GAAI,kBAAkB,CAAC,MAAM,IAAI,CAAC,CACpC;CACA,MAAM,cAAc,kBAAkB,CAAC,GAAG,cAAc,GAAG,IAAI;CAE/D,OAAO,UAAU,SAAS,SAAS;EACjC,cAAc;EACd;CACF,CAAC;AACH;;;;;;;AAQA,IAAM,aAAa,YAAoB;CACrC,OAAO,UAAU,SAAS,SAAS;EAAE,cAAc,CAAC;EAAG,cAAc,CAAC;CAAE,CAAC;AAC3E;AAEA,IAAa,eAAe;CAAE;CAAc;AAAU;;;ACvEtD,IAAM,mBAAmB;AAGzB,IAAA,0BAAgB,SAAS,IAAI,YAAY,qBAAqB;CAC5D,MAAM,OAAO,OAAO,SAAS,YAAY,MAAM;CAC/C,OAAO,GAAG,OAAO,UAAU,GAAG,YAAY,CAAC,IAAI;AACjD;;;;;;;;;ACAA,IAAa,oBAAoB,eAA+B;CAC9D,MAAM,WAAW,WAAW,MAAM,OAAO,CAAC,CAAC,IAAI,KAAK;CAEpD,MAAM,QAAQ,SAAS,MAAM,GAAG;CAEhC,IAAI,aAAa,MAAM,MAAM,WAAW,GACtC,OAAO;CAGT,OAAO,MAAM,GAAG,EAAE,KAAK;AACzB;;;;;AAQA,IAAM,OAAO,OAAO,OAAO;CACzB,WAAW;CACX,UAAU;CACV,QAAQ,MAAgB;EAEtB,OADkB,iBAAiB,KAAK,IACjC,MAAc,KAAK;CAC5B;AACF,CAAC;;;;AAKD,IAAM,OAAO,OAAO,OAAO;CACzB,WAAW;CACX,UAAU;CACV,QAAQ,MAAgB;EAEtB,OADkB,iBAAiB,KAAK,IACjC,MAAc,KAAK;CAC5B;;;;;;CAMA,iBAAiB,MAAgB,eAAe,IAAY;EAC1D,IAAI,CAAC,KAAK,QAAQ,IAAI,GACpB,OAAO;EAGT,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,aAAa,EAAE;CACnD;AACF,CAAC;AAED,IAAa,mBAAmB;CAAE;CAAM;AAAK;;;;;;;AAQ7C,IAAa,mBAAmB,SAA2B;CACzD,MAAM,mBAAmB;CAIzB,IAAI,CAFc,iBAAiB,KAAK,IAEnC,GACH,OAAO;CAGT,IAAI,KAAK,QAAQ,IAAI,GACnB,OAAO,KAAK;CAGd,IAAI,KAAK,QAAQ,IAAI,GACnB,OAAO,KAAK;CAId,IAAI,CAAC,KAAK,MACR,OAAO;CAGT,OAAO,KAAK;AACd;;;;;;;;ACnFA,IAAa,iBAAiB;CAC5B,QAAQ;CACR,OAAO;AACT;AAE+B,OAAO,OAAO,cAAc;;;;;;;;;;;ACN3D,IAAa,cACX,WAAW,WAAW,YAAY,CAAC,EAAE,SAAS,KAAK;;;;;AAMrD,IAAa,kBACX,WAAW,WAAW,YAAY,CAAC,EAAE,SAAS,SAAS;;;ACPzD,IAAM,eAAe;CACnB,SAAS;CACT,WAAW;CACX,WAAW;CACX,YAAY;CACZ,OAAO;CACP,KAAK;CACL,WAAW;AACb;AAEA,IAAM,cAAc;CAClB,OAAO;CACP,QAAQ;CACR,WAAW;CACX,MAAM;CACN,KAAK;CACL,OAAO;AACT;;;;;;;;AAWA,IAAa,gBACX,QACA,aACW;;;;;CAKX,MAAM,cAAc,eAA6B,QAC/C,UAAU,QAA8B;;;;;CAM1C,MAAM,QACJ,GAAG,QAEH,IAAI,QACD,GAAG,OAAO,QAAQ,EAAE,EAAE,GAAG,CAAC,IAC1B,QAAgB,GACnB;CAEF,MAAM,kBAAkB,KACtB,WAAW,WAAW,GACtB,WAAW,YAAY,CACzB;CAEA,MAAM,sBAAsB,WAAW,YAAY;CAInD,QADE,aAAa,KAAA,IAAY,MAAM,IAAI,aAAa,eAAe,UAE7D,gBAAgB,MAAM,IACtB,oBAAoB,MAAM;AAChC;AAEA,IAAa,4BAA6B,MAAM,IAAI,MAAM;;;;AAK1D,IAAa,iBACX,SACA,eAAe,wBACZ,QAAQ,KAAK,WAAW,aAAa,MAAM,CAAC,CAAC,CAAC,KAAK,aAAa,CAAC;;;;AAKtE,IAAa,mBAAmB,MAAc,YAA2B;CACvE,OAAO,GAAG,KAAK,KAAK,cAAc,OAAO;AAC3C;;;;;;;;;;AC1EA,IAAM,qBAAqB,SAAiB,WAA4B;CAGtE,IAAI,OAAO,WAAW,KAAoB,CAAC,SAAS,WAAW,OAAO,GACpE,OAAO;CAGT,MAAM,YAAY,OAAO,QAAQ,MAAM,CAAc,CAAC;CACtD,MAAM,CAAC,OAAO,SAAS,OAAO,MAAM,GAAG;CAEvC,OACE,QAAQ,KAAK,KACb,QAAQ,KAAK,KACb,OAAO,SAAS,OAAO,EAAE,KAAK,aAC9B,aAAa,OAAO,SAAS,OAAO,EAAE;AAE1C;;;;;;;;;;AAWA,IAAa,SAAS,OAAsB,YAA+B;CACzE,MAAM,EAAE,KAAK,MAAM,SAAS,SAAS,UAAU,WAAW;CAE1D,MAAM,YAAY,QAAQ,MAAM;CAChC,MAAM,YAAY,UAAU,IAAI,KAAK;CAGrC,MAAM,aAAa,MAAqB,IAAI,SAAS;CACrD,MAAM,oBAAoB,IAAI,IAC5B,UAAU,KAAK,aACb,aAAa,cAAc,aAAa,QAC1C,CACF;CAEA,MAAM,cAAc,QAAQ,OAAO,MAAM,kBAAkB,IAAI,MAAM;CACrE,MAAM,cAAc,QAAQ,OAAO,MAAM,kBAAkB,IAAI,MAAM;CACrE,MAAM,eAAe,QAAQ,QAAQ,MAAM,kBAAkB,IAAI,OAAO;CACxE,MAAM,aAAa,QAAQ,MAAM,MAAM,kBAAkB,IAAI,KAAK;CAElE,MAAM,YAEJ,IAAI,YAAY,MAAM,UAAU,YAAY,KAC3C,UAAU,SAAS,GAAG,KAAK,kBAAkB,MAAM,SAAS,KAE5D,MAAqB,KAAK,cAAc,YAAY,QAAQ;CAE/D,OAAO,eAAe,eAAe,gBAAgB,cAAc;AACrE;;;;;;;;AC1DA,IAAa,wBAAwB,UAAkC;CACrE,OAAO,MAAM,WAAW,MAAM,WAAW,MAAM,UAAU,MAAM;AACjE;;;;;;;AAQA,IAAa,yBACX,OACA,SACY;CAEZ,QADgB,MAAM,QAAQ,IAAI,IAAI,OAAO,CAAC,IAAI,EAAA,CACnC,SAAS,MAAM,GAAG,KAAK,CAAC,qBAAqB,KAAK;AACnE;;;;AAKA,IAAa,yBAAgD;CAC3D,OAAO,MAAqB,IAAI,YAAY;AAC9C;;;;;;;ACjBA,IAAa,UAAU;CACrB;CACA;CACA;CACA;CACA;CACA;AACF"}

package/dist/src/fileExtensions.d.ts

@@ -5,22 +5,26 @@
  * @returns just the file extension (e.g "txt")
  */
 export declare const getFileExtension: (nameOrPath: string) => string;
+type FileLike = {
+    name: string;
+    type: string;
+};
 export declare const knimeFileFormats: {
     KNAR: Readonly<{
         extension: "knar";
         mimeType: "application/vnd.knime.workflow-group+zip";
-        matches(file: File): boolean;
+        matches(file: FileLike): boolean;
     }>;
     KNWF: Readonly<{
         extension: "knwf";
         mimeType: "application/vnd.knime.workflow+zip";
-        matches(file: File): boolean;
+        matches(file: FileLike): boolean;
         /**
          * Gets the name of a .knwf file without the extension. If the file is not
          * matched as a .knwf file then this function will return the default value,
          * which is empty string ("") if param is not provided
          */
-        getNameOrDefault(file: File, defaultValue?: string): string;
+        getNameOrDefault(file: FileLike, defaultValue?: string): string;
     }>;
 };
 /**
@@ -29,5 +33,6 @@ export declare const knimeFileFormats: {
  * @param file File
  * @returns mimeType
  */
-export declare const getFileMimeType: (file: File) => string;
+export declare const getFileMimeType: (file: FileLike) => string;
+export {};
 //# sourceMappingURL=fileExtensions.d.ts.map

package/dist/src/fileExtensions.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"fileExtensions.d.ts","sourceRoot":"","sources":["../../src/fileExtensions.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,eAAO,MAAM,gBAAgB,GAAI,YAAY,MAAM,KAAG,MAUrD,CAAC;AAuCF,eAAO,MAAM,gBAAgB;;;;sBA9Bb,IAAI;;;;;sBAYJ,IAAI;QAIlB;;;;WAIG;+BACoB,IAAI,0BAAsB,MAAM;;CASX,CAAC;AAE/C;;;;;GAKG;AACH,eAAO,MAAM,eAAe,GAAI,MAAM,IAAI,KAAG,MAuB5C,CAAC"}
+{"version":3,"file":"fileExtensions.d.ts","sourceRoot":"","sources":["../../src/fileExtensions.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,eAAO,MAAM,gBAAgB,GAAI,YAAY,MAAM,KAAG,MAUrD,CAAC;AAEF,KAAK,QAAQ,GAAG;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC;AAuC/C,eAAO,MAAM,gBAAgB;;;;sBA9Bb,QAAQ;;;;;sBAYR,QAAQ;QAItB;;;;WAIG;+BACoB,QAAQ,0BAAsB,MAAM;;CASf,CAAC;AAE/C;;;;;GAKG;AACH,eAAO,MAAM,eAAe,GAAI,MAAM,QAAQ,KAAG,MAuBhD,CAAC"}

package/package.json

@@ -1,13 +1,13 @@
 {
   "name": "@knime/utils",
-  "version": "2.0.1",
+  "version": "2.0.3",
   "description": "Internal utility functions and constants shared across @knime packages.",
   "repository": {
     "type": "git",
     "url": "https://github.com/knime/knime-designsystem.git",
     "directory": "packages/utils"
   },
-  "license": "GPL 3 and Additional Permissions according to Sec. 7 (SEE the file LICENSE)",
+  "license": "KNIME-Commercial-License-2.0",
   "author": "KNIME AG, Zurich, Switzerland",
   "type": "module",
   "main": "./dist/index.js",
@@ -38,7 +38,7 @@
   "dependencies": {
     "date-fns": "2.30.0",
     "date-fns-tz": "2.0.0",
-    "dompurify": "^3.4.13",
+    "dompurify": "^3.4.16",
     "pretty-bytes": "^7.1.0"
   },
   "devDependencies": {
@@ -46,7 +46,7 @@
     "@types/node": "^26.1.1",
     "consola": "^3.4.2",
     "flush-promises": "^1.0.2",
-    "mock-xmlhttprequest": "^8.3.0",
+    "mock-xmlhttprequest": "^8.4.1",
     "typescript": "^6.0.3",
     "vite": "^8.1.3",
     "vite-plugin-dts": "^5.0.3",