Spaces:
Running on Zero
Running on Zero
FlashImgs ZeroGPU Space: Gradio SDK, AGPL-3.0 wrapper, vendored sm_120 wheels
Browse files- .gitignore +23 -0
- LICENSE +661 -0
- NOTICE +27 -0
- README.md +95 -7
- app.py +701 -0
- cfgs/default.yaml +68 -0
- requirements.txt +20 -0
- wheels/flashimgs-0.1.0-py3-none-any.whl +3 -0
- wheels/fussim-0.3.14-cp312-cp312-linux_x86_64.whl +3 -0
- wheels/simple_sum_backend-0.1.0-cp312-cp312-linux_x86_64.whl +3 -0
.gitignore
ADDED
|
@@ -0,0 +1,23 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
# Python
|
| 2 |
+
__pycache__/
|
| 3 |
+
*.py[cod]
|
| 4 |
+
*.egg-info/
|
| 5 |
+
.eggs/
|
| 6 |
+
build/
|
| 7 |
+
dist/
|
| 8 |
+
|
| 9 |
+
# Caches / tooling
|
| 10 |
+
.pytest_cache/
|
| 11 |
+
.ruff_cache/
|
| 12 |
+
.mypy_cache/
|
| 13 |
+
.venv/
|
| 14 |
+
venv/
|
| 15 |
+
|
| 16 |
+
# App outputs (default output dir lives under /tmp, but ignore local overrides)
|
| 17 |
+
outputs/
|
| 18 |
+
|
| 19 |
+
# OS / editor
|
| 20 |
+
.DS_Store
|
| 21 |
+
*.swp
|
| 22 |
+
.idea/
|
| 23 |
+
.vscode/
|
LICENSE
ADDED
|
@@ -0,0 +1,661 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
GNU AFFERO GENERAL PUBLIC LICENSE
|
| 2 |
+
Version 3, 19 November 2007
|
| 3 |
+
|
| 4 |
+
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
|
| 5 |
+
Everyone is permitted to copy and distribute verbatim copies
|
| 6 |
+
of this license document, but changing it is not allowed.
|
| 7 |
+
|
| 8 |
+
Preamble
|
| 9 |
+
|
| 10 |
+
The GNU Affero General Public License is a free, copyleft license for
|
| 11 |
+
software and other kinds of works, specifically designed to ensure
|
| 12 |
+
cooperation with the community in the case of network server software.
|
| 13 |
+
|
| 14 |
+
The licenses for most software and other practical works are designed
|
| 15 |
+
to take away your freedom to share and change the works. By contrast,
|
| 16 |
+
our General Public Licenses are intended to guarantee your freedom to
|
| 17 |
+
share and change all versions of a program--to make sure it remains free
|
| 18 |
+
software for all its users.
|
| 19 |
+
|
| 20 |
+
When we speak of free software, we are referring to freedom, not
|
| 21 |
+
price. Our General Public Licenses are designed to make sure that you
|
| 22 |
+
have the freedom to distribute copies of free software (and charge for
|
| 23 |
+
them if you wish), that you receive source code or can get it if you
|
| 24 |
+
want it, that you can change the software or use pieces of it in new
|
| 25 |
+
free programs, and that you know you can do these things.
|
| 26 |
+
|
| 27 |
+
Developers that use our General Public Licenses protect your rights
|
| 28 |
+
with two steps: (1) assert copyright on the software, and (2) offer
|
| 29 |
+
you this License which gives you legal permission to copy, distribute
|
| 30 |
+
and/or modify the software.
|
| 31 |
+
|
| 32 |
+
A secondary benefit of defending all users' freedom is that
|
| 33 |
+
improvements made in alternate versions of the program, if they
|
| 34 |
+
receive widespread use, become available for other developers to
|
| 35 |
+
incorporate. Many developers of free software are heartened and
|
| 36 |
+
encouraged by the resulting cooperation. However, in the case of
|
| 37 |
+
software used on network servers, this result may fail to come about.
|
| 38 |
+
The GNU General Public License permits making a modified version and
|
| 39 |
+
letting the public access it on a server without ever releasing its
|
| 40 |
+
source code to the public.
|
| 41 |
+
|
| 42 |
+
The GNU Affero General Public License is designed specifically to
|
| 43 |
+
ensure that, in such cases, the modified source code becomes available
|
| 44 |
+
to the community. It requires the operator of a network server to
|
| 45 |
+
provide the source code of the modified version running there to the
|
| 46 |
+
users of that server. Therefore, public use of a modified version, on
|
| 47 |
+
a publicly accessible server, gives the public access to the source
|
| 48 |
+
code of the modified version.
|
| 49 |
+
|
| 50 |
+
An older license, called the Affero General Public License and
|
| 51 |
+
published by Affero, was designed to accomplish similar goals. This is
|
| 52 |
+
a different license, not a version of the Affero GPL, but Affero has
|
| 53 |
+
released a new version of the Affero GPL which permits relicensing under
|
| 54 |
+
this license.
|
| 55 |
+
|
| 56 |
+
The precise terms and conditions for copying, distribution and
|
| 57 |
+
modification follow.
|
| 58 |
+
|
| 59 |
+
TERMS AND CONDITIONS
|
| 60 |
+
|
| 61 |
+
0. Definitions.
|
| 62 |
+
|
| 63 |
+
"This License" refers to version 3 of the GNU Affero General Public License.
|
| 64 |
+
|
| 65 |
+
"Copyright" also means copyright-like laws that apply to other kinds of
|
| 66 |
+
works, such as semiconductor masks.
|
| 67 |
+
|
| 68 |
+
"The Program" refers to any copyrightable work licensed under this
|
| 69 |
+
License. Each licensee is addressed as "you". "Licensees" and
|
| 70 |
+
"recipients" may be individuals or organizations.
|
| 71 |
+
|
| 72 |
+
To "modify" a work means to copy from or adapt all or part of the work
|
| 73 |
+
in a fashion requiring copyright permission, other than the making of an
|
| 74 |
+
exact copy. The resulting work is called a "modified version" of the
|
| 75 |
+
earlier work or a work "based on" the earlier work.
|
| 76 |
+
|
| 77 |
+
A "covered work" means either the unmodified Program or a work based
|
| 78 |
+
on the Program.
|
| 79 |
+
|
| 80 |
+
To "propagate" a work means to do anything with it that, without
|
| 81 |
+
permission, would make you directly or secondarily liable for
|
| 82 |
+
infringement under applicable copyright law, except executing it on a
|
| 83 |
+
computer or modifying a private copy. Propagation includes copying,
|
| 84 |
+
distribution (with or without modification), making available to the
|
| 85 |
+
public, and in some countries other activities as well.
|
| 86 |
+
|
| 87 |
+
To "convey" a work means any kind of propagation that enables other
|
| 88 |
+
parties to make or receive copies. Mere interaction with a user through
|
| 89 |
+
a computer network, with no transfer of a copy, is not conveying.
|
| 90 |
+
|
| 91 |
+
An interactive user interface displays "Appropriate Legal Notices"
|
| 92 |
+
to the extent that it includes a convenient and prominently visible
|
| 93 |
+
feature that (1) displays an appropriate copyright notice, and (2)
|
| 94 |
+
tells the user that there is no warranty for the work (except to the
|
| 95 |
+
extent that warranties are provided), that licensees may convey the
|
| 96 |
+
work under this License, and how to view a copy of this License. If
|
| 97 |
+
the interface presents a list of user commands or options, such as a
|
| 98 |
+
menu, a prominent item in the list meets this criterion.
|
| 99 |
+
|
| 100 |
+
1. Source Code.
|
| 101 |
+
|
| 102 |
+
The "source code" for a work means the preferred form of the work
|
| 103 |
+
for making modifications to it. "Object code" means any non-source
|
| 104 |
+
form of a work.
|
| 105 |
+
|
| 106 |
+
A "Standard Interface" means an interface that either is an official
|
| 107 |
+
standard defined by a recognized standards body, or, in the case of
|
| 108 |
+
interfaces specified for a particular programming language, one that
|
| 109 |
+
is widely used among developers working in that language.
|
| 110 |
+
|
| 111 |
+
The "System Libraries" of an executable work include anything, other
|
| 112 |
+
than the work as a whole, that (a) is included in the normal form of
|
| 113 |
+
packaging a Major Component, but which is not part of that Major
|
| 114 |
+
Component, and (b) serves only to enable use of the work with that
|
| 115 |
+
Major Component, or to implement a Standard Interface for which an
|
| 116 |
+
implementation is available to the public in source code form. A
|
| 117 |
+
"Major Component", in this context, means a major essential component
|
| 118 |
+
(kernel, window system, and so on) of the specific operating system
|
| 119 |
+
(if any) on which the executable work runs, or a compiler used to
|
| 120 |
+
produce the work, or an object code interpreter used to run it.
|
| 121 |
+
|
| 122 |
+
The "Corresponding Source" for a work in object code form means all
|
| 123 |
+
the source code needed to generate, install, and (for an executable
|
| 124 |
+
work) run the object code and to modify the work, including scripts to
|
| 125 |
+
control those activities. However, it does not include the work's
|
| 126 |
+
System Libraries, or general-purpose tools or generally available free
|
| 127 |
+
programs which are used unmodified in performing those activities but
|
| 128 |
+
which are not part of the work. For example, Corresponding Source
|
| 129 |
+
includes interface definition files associated with source files for
|
| 130 |
+
the work, and the source code for shared libraries and dynamically
|
| 131 |
+
linked subprograms that the work is specifically designed to require,
|
| 132 |
+
such as by intimate data communication or control flow between those
|
| 133 |
+
subprograms and other parts of the work.
|
| 134 |
+
|
| 135 |
+
The Corresponding Source need not include anything that users
|
| 136 |
+
can regenerate automatically from other parts of the Corresponding
|
| 137 |
+
Source.
|
| 138 |
+
|
| 139 |
+
The Corresponding Source for a work in source code form is that
|
| 140 |
+
same work.
|
| 141 |
+
|
| 142 |
+
2. Basic Permissions.
|
| 143 |
+
|
| 144 |
+
All rights granted under this License are granted for the term of
|
| 145 |
+
copyright on the Program, and are irrevocable provided the stated
|
| 146 |
+
conditions are met. This License explicitly affirms your unlimited
|
| 147 |
+
permission to run the unmodified Program. The output from running a
|
| 148 |
+
covered work is covered by this License only if the output, given its
|
| 149 |
+
content, constitutes a covered work. This License acknowledges your
|
| 150 |
+
rights of fair use or other equivalent, as provided by copyright law.
|
| 151 |
+
|
| 152 |
+
You may make, run and propagate covered works that you do not
|
| 153 |
+
convey, without conditions so long as your license otherwise remains
|
| 154 |
+
in force. You may convey covered works to others for the sole purpose
|
| 155 |
+
of having them make modifications exclusively for you, or provide you
|
| 156 |
+
with facilities for running those works, provided that you comply with
|
| 157 |
+
the terms of this License in conveying all material for which you do
|
| 158 |
+
not control copyright. Those thus making or running the covered works
|
| 159 |
+
for you must do so exclusively on your behalf, under your direction
|
| 160 |
+
and control, on terms that prohibit them from making any copies of
|
| 161 |
+
your copyrighted material outside their relationship with you.
|
| 162 |
+
|
| 163 |
+
Conveying under any other circumstances is permitted solely under
|
| 164 |
+
the conditions stated below. Sublicensing is not allowed; section 10
|
| 165 |
+
makes it unnecessary.
|
| 166 |
+
|
| 167 |
+
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
| 168 |
+
|
| 169 |
+
No covered work shall be deemed part of an effective technological
|
| 170 |
+
measure under any applicable law fulfilling obligations under article
|
| 171 |
+
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
| 172 |
+
similar laws prohibiting or restricting circumvention of such
|
| 173 |
+
measures.
|
| 174 |
+
|
| 175 |
+
When you convey a covered work, you waive any legal power to forbid
|
| 176 |
+
circumvention of technological measures to the extent such circumvention
|
| 177 |
+
is effected by exercising rights under this License with respect to
|
| 178 |
+
the covered work, and you disclaim any intention to limit operation or
|
| 179 |
+
modification of the work as a means of enforcing, against the work's
|
| 180 |
+
users, your or third parties' legal rights to forbid circumvention of
|
| 181 |
+
technological measures.
|
| 182 |
+
|
| 183 |
+
4. Conveying Verbatim Copies.
|
| 184 |
+
|
| 185 |
+
You may convey verbatim copies of the Program's source code as you
|
| 186 |
+
receive it, in any medium, provided that you conspicuously and
|
| 187 |
+
appropriately publish on each copy an appropriate copyright notice;
|
| 188 |
+
keep intact all notices stating that this License and any
|
| 189 |
+
non-permissive terms added in accord with section 7 apply to the code;
|
| 190 |
+
keep intact all notices of the absence of any warranty; and give all
|
| 191 |
+
recipients a copy of this License along with the Program.
|
| 192 |
+
|
| 193 |
+
You may charge any price or no price for each copy that you convey,
|
| 194 |
+
and you may offer support or warranty protection for a fee.
|
| 195 |
+
|
| 196 |
+
5. Conveying Modified Source Versions.
|
| 197 |
+
|
| 198 |
+
You may convey a work based on the Program, or the modifications to
|
| 199 |
+
produce it from the Program, in the form of source code under the
|
| 200 |
+
terms of section 4, provided that you also meet all of these conditions:
|
| 201 |
+
|
| 202 |
+
a) The work must carry prominent notices stating that you modified
|
| 203 |
+
it, and giving a relevant date.
|
| 204 |
+
|
| 205 |
+
b) The work must carry prominent notices stating that it is
|
| 206 |
+
released under this License and any conditions added under section
|
| 207 |
+
7. This requirement modifies the requirement in section 4 to
|
| 208 |
+
"keep intact all notices".
|
| 209 |
+
|
| 210 |
+
c) You must license the entire work, as a whole, under this
|
| 211 |
+
License to anyone who comes into possession of a copy. This
|
| 212 |
+
License will therefore apply, along with any applicable section 7
|
| 213 |
+
additional terms, to the whole of the work, and all its parts,
|
| 214 |
+
regardless of how they are packaged. This License gives no
|
| 215 |
+
permission to license the work in any other way, but it does not
|
| 216 |
+
invalidate such permission if you have separately received it.
|
| 217 |
+
|
| 218 |
+
d) If the work has interactive user interfaces, each must display
|
| 219 |
+
Appropriate Legal Notices; however, if the Program has interactive
|
| 220 |
+
interfaces that do not display Appropriate Legal Notices, your
|
| 221 |
+
work need not make them do so.
|
| 222 |
+
|
| 223 |
+
A compilation of a covered work with other separate and independent
|
| 224 |
+
works, which are not by their nature extensions of the covered work,
|
| 225 |
+
and which are not combined with it such as to form a larger program,
|
| 226 |
+
in or on a volume of a storage or distribution medium, is called an
|
| 227 |
+
"aggregate" if the compilation and its resulting copyright are not
|
| 228 |
+
used to limit the access or legal rights of the compilation's users
|
| 229 |
+
beyond what the individual works permit. Inclusion of a covered work
|
| 230 |
+
in an aggregate does not cause this License to apply to the other
|
| 231 |
+
parts of the aggregate.
|
| 232 |
+
|
| 233 |
+
6. Conveying Non-Source Forms.
|
| 234 |
+
|
| 235 |
+
You may convey a covered work in object code form under the terms
|
| 236 |
+
of sections 4 and 5, provided that you also convey the
|
| 237 |
+
machine-readable Corresponding Source under the terms of this License,
|
| 238 |
+
in one of these ways:
|
| 239 |
+
|
| 240 |
+
a) Convey the object code in, or embodied in, a physical product
|
| 241 |
+
(including a physical distribution medium), accompanied by the
|
| 242 |
+
Corresponding Source fixed on a durable physical medium
|
| 243 |
+
customarily used for software interchange.
|
| 244 |
+
|
| 245 |
+
b) Convey the object code in, or embodied in, a physical product
|
| 246 |
+
(including a physical distribution medium), accompanied by a
|
| 247 |
+
written offer, valid for at least three years and valid for as
|
| 248 |
+
long as you offer spare parts or customer support for that product
|
| 249 |
+
model, to give anyone who possesses the object code either (1) a
|
| 250 |
+
copy of the Corresponding Source for all the software in the
|
| 251 |
+
product that is covered by this License, on a durable physical
|
| 252 |
+
medium customarily used for software interchange, for a price no
|
| 253 |
+
more than your reasonable cost of physically performing this
|
| 254 |
+
conveying of source, or (2) access to copy the
|
| 255 |
+
Corresponding Source from a network server at no charge.
|
| 256 |
+
|
| 257 |
+
c) Convey individual copies of the object code with a copy of the
|
| 258 |
+
written offer to provide the Corresponding Source. This
|
| 259 |
+
alternative is allowed only occasionally and noncommercially, and
|
| 260 |
+
only if you received the object code with such an offer, in accord
|
| 261 |
+
with subsection 6b.
|
| 262 |
+
|
| 263 |
+
d) Convey the object code by offering access from a designated
|
| 264 |
+
place (gratis or for a charge), and offer equivalent access to the
|
| 265 |
+
Corresponding Source in the same way through the same place at no
|
| 266 |
+
further charge. You need not require recipients to copy the
|
| 267 |
+
Corresponding Source along with the object code. If the place to
|
| 268 |
+
copy the object code is a network server, the Corresponding Source
|
| 269 |
+
may be on a different server (operated by you or a third party)
|
| 270 |
+
that supports equivalent copying facilities, provided you maintain
|
| 271 |
+
clear directions next to the object code saying where to find the
|
| 272 |
+
Corresponding Source. Regardless of what server hosts the
|
| 273 |
+
Corresponding Source, you remain obligated to ensure that it is
|
| 274 |
+
available for as long as needed to satisfy these requirements.
|
| 275 |
+
|
| 276 |
+
e) Convey the object code using peer-to-peer transmission, provided
|
| 277 |
+
you inform other peers where the object code and Corresponding
|
| 278 |
+
Source of the work are being offered to the general public at no
|
| 279 |
+
charge under subsection 6d.
|
| 280 |
+
|
| 281 |
+
A separable portion of the object code, whose source code is excluded
|
| 282 |
+
from the Corresponding Source as a System Library, need not be
|
| 283 |
+
included in conveying the object code work.
|
| 284 |
+
|
| 285 |
+
A "User Product" is either (1) a "consumer product", which means any
|
| 286 |
+
tangible personal property which is normally used for personal, family,
|
| 287 |
+
or household purposes, or (2) anything designed or sold for incorporation
|
| 288 |
+
into a dwelling. In determining whether a product is a consumer product,
|
| 289 |
+
doubtful cases shall be resolved in favor of coverage. For a particular
|
| 290 |
+
product received by a particular user, "normally used" refers to a
|
| 291 |
+
typical or common use of that class of product, regardless of the status
|
| 292 |
+
of the particular user or of the way in which the particular user
|
| 293 |
+
actually uses, or expects or is expected to use, the product. A product
|
| 294 |
+
is a consumer product regardless of whether the product has substantial
|
| 295 |
+
commercial, industrial or non-consumer uses, unless such uses represent
|
| 296 |
+
the only significant mode of use of the product.
|
| 297 |
+
|
| 298 |
+
"Installation Information" for a User Product means any methods,
|
| 299 |
+
procedures, authorization keys, or other information required to install
|
| 300 |
+
and execute modified versions of a covered work in that User Product from
|
| 301 |
+
a modified version of its Corresponding Source. The information must
|
| 302 |
+
suffice to ensure that the continued functioning of the modified object
|
| 303 |
+
code is in no case prevented or interfered with solely because
|
| 304 |
+
modification has been made.
|
| 305 |
+
|
| 306 |
+
If you convey an object code work under this section in, or with, or
|
| 307 |
+
specifically for use in, a User Product, and the conveying occurs as
|
| 308 |
+
part of a transaction in which the right of possession and use of the
|
| 309 |
+
User Product is transferred to the recipient in perpetuity or for a
|
| 310 |
+
fixed term (regardless of how the transaction is characterized), the
|
| 311 |
+
Corresponding Source conveyed under this section must be accompanied
|
| 312 |
+
by the Installation Information. But this requirement does not apply
|
| 313 |
+
if neither you nor any third party retains the ability to install
|
| 314 |
+
modified object code on the User Product (for example, the work has
|
| 315 |
+
been installed in ROM).
|
| 316 |
+
|
| 317 |
+
The requirement to provide Installation Information does not include a
|
| 318 |
+
requirement to continue to provide support service, warranty, or updates
|
| 319 |
+
for a work that has been modified or installed by the recipient, or for
|
| 320 |
+
the User Product in which it has been modified or installed. Access to a
|
| 321 |
+
network may be denied when the modification itself materially and
|
| 322 |
+
adversely affects the operation of the network or violates the rules and
|
| 323 |
+
protocols for communication across the network.
|
| 324 |
+
|
| 325 |
+
Corresponding Source conveyed, and Installation Information provided,
|
| 326 |
+
in accord with this section must be in a format that is publicly
|
| 327 |
+
documented (and with an implementation available to the public in
|
| 328 |
+
source code form), and must require no special password or key for
|
| 329 |
+
unpacking, reading or copying.
|
| 330 |
+
|
| 331 |
+
7. Additional Terms.
|
| 332 |
+
|
| 333 |
+
"Additional permissions" are terms that supplement the terms of this
|
| 334 |
+
License by making exceptions from one or more of its conditions.
|
| 335 |
+
Additional permissions that are applicable to the entire Program shall
|
| 336 |
+
be treated as though they were included in this License, to the extent
|
| 337 |
+
that they are valid under applicable law. If additional permissions
|
| 338 |
+
apply only to part of the Program, that part may be used separately
|
| 339 |
+
under those permissions, but the entire Program remains governed by
|
| 340 |
+
this License without regard to the additional permissions.
|
| 341 |
+
|
| 342 |
+
When you convey a copy of a covered work, you may at your option
|
| 343 |
+
remove any additional permissions from that copy, or from any part of
|
| 344 |
+
it. (Additional permissions may be written to require their own
|
| 345 |
+
removal in certain cases when you modify the work.) You may place
|
| 346 |
+
additional permissions on material, added by you to a covered work,
|
| 347 |
+
for which you have or can give appropriate copyright permission.
|
| 348 |
+
|
| 349 |
+
Notwithstanding any other provision of this License, for material you
|
| 350 |
+
add to a covered work, you may (if authorized by the copyright holders of
|
| 351 |
+
that material) supplement the terms of this License with terms:
|
| 352 |
+
|
| 353 |
+
a) Disclaiming warranty or limiting liability differently from the
|
| 354 |
+
terms of sections 15 and 16 of this License; or
|
| 355 |
+
|
| 356 |
+
b) Requiring preservation of specified reasonable legal notices or
|
| 357 |
+
author attributions in that material or in the Appropriate Legal
|
| 358 |
+
Notices displayed by works containing it; or
|
| 359 |
+
|
| 360 |
+
c) Prohibiting misrepresentation of the origin of that material, or
|
| 361 |
+
requiring that modified versions of such material be marked in
|
| 362 |
+
reasonable ways as different from the original version; or
|
| 363 |
+
|
| 364 |
+
d) Limiting the use for publicity purposes of names of licensors or
|
| 365 |
+
authors of the material; or
|
| 366 |
+
|
| 367 |
+
e) Declining to grant rights under trademark law for use of some
|
| 368 |
+
trade names, trademarks, or service marks; or
|
| 369 |
+
|
| 370 |
+
f) Requiring indemnification of licensors and authors of that
|
| 371 |
+
material by anyone who conveys the material (or modified versions of
|
| 372 |
+
it) with contractual assumptions of liability to the recipient, for
|
| 373 |
+
any liability that these contractual assumptions directly impose on
|
| 374 |
+
those licensors and authors.
|
| 375 |
+
|
| 376 |
+
All other non-permissive additional terms are considered "further
|
| 377 |
+
restrictions" within the meaning of section 10. If the Program as you
|
| 378 |
+
received it, or any part of it, contains a notice stating that it is
|
| 379 |
+
governed by this License along with a term that is a further
|
| 380 |
+
restriction, you may remove that term. If a license document contains
|
| 381 |
+
a further restriction but permits relicensing or conveying under this
|
| 382 |
+
License, you may add to a covered work material governed by the terms
|
| 383 |
+
of that license document, provided that the further restriction does
|
| 384 |
+
not survive such relicensing or conveying.
|
| 385 |
+
|
| 386 |
+
If you add terms to a covered work in accord with this section, you
|
| 387 |
+
must place, in the relevant source files, a statement of the
|
| 388 |
+
additional terms that apply to those files, or a notice indicating
|
| 389 |
+
where to find the applicable terms.
|
| 390 |
+
|
| 391 |
+
Additional terms, permissive or non-permissive, may be stated in the
|
| 392 |
+
form of a separately written license, or stated as exceptions;
|
| 393 |
+
the above requirements apply either way.
|
| 394 |
+
|
| 395 |
+
8. Termination.
|
| 396 |
+
|
| 397 |
+
You may not propagate or modify a covered work except as expressly
|
| 398 |
+
provided under this License. Any attempt otherwise to propagate or
|
| 399 |
+
modify it is void, and will automatically terminate your rights under
|
| 400 |
+
this License (including any patent licenses granted under the third
|
| 401 |
+
paragraph of section 11).
|
| 402 |
+
|
| 403 |
+
However, if you cease all violation of this License, then your
|
| 404 |
+
license from a particular copyright holder is reinstated (a)
|
| 405 |
+
provisionally, unless and until the copyright holder explicitly and
|
| 406 |
+
finally terminates your license, and (b) permanently, if the copyright
|
| 407 |
+
holder fails to notify you of the violation by some reasonable means
|
| 408 |
+
prior to 60 days after the cessation.
|
| 409 |
+
|
| 410 |
+
Moreover, your license from a particular copyright holder is
|
| 411 |
+
reinstated permanently if the copyright holder notifies you of the
|
| 412 |
+
violation by some reasonable means, this is the first time you have
|
| 413 |
+
received notice of violation of this License (for any work) from that
|
| 414 |
+
copyright holder, and you cure the violation prior to 30 days after
|
| 415 |
+
your receipt of the notice.
|
| 416 |
+
|
| 417 |
+
Termination of your rights under this section does not terminate the
|
| 418 |
+
licenses of parties who have received copies or rights from you under
|
| 419 |
+
this License. If your rights have been terminated and not permanently
|
| 420 |
+
reinstated, you do not qualify to receive new licenses for the same
|
| 421 |
+
material under section 10.
|
| 422 |
+
|
| 423 |
+
9. Acceptance Not Required for Having Copies.
|
| 424 |
+
|
| 425 |
+
You are not required to accept this License in order to receive or
|
| 426 |
+
run a copy of the Program. Ancillary propagation of a covered work
|
| 427 |
+
occurring solely as a consequence of using peer-to-peer transmission
|
| 428 |
+
to receive a copy likewise does not require acceptance. However,
|
| 429 |
+
nothing other than this License grants you permission to propagate or
|
| 430 |
+
modify any covered work. These actions infringe copyright if you do
|
| 431 |
+
not accept this License. Therefore, by modifying or propagating a
|
| 432 |
+
covered work, you indicate your acceptance of this License to do so.
|
| 433 |
+
|
| 434 |
+
10. Automatic Licensing of Downstream Recipients.
|
| 435 |
+
|
| 436 |
+
Each time you convey a covered work, the recipient automatically
|
| 437 |
+
receives a license from the original licensors, to run, modify and
|
| 438 |
+
propagate that work, subject to this License. You are not responsible
|
| 439 |
+
for enforcing compliance by third parties with this License.
|
| 440 |
+
|
| 441 |
+
An "entity transaction" is a transaction transferring control of an
|
| 442 |
+
organization, or substantially all assets of one, or subdividing an
|
| 443 |
+
organization, or merging organizations. If propagation of a covered
|
| 444 |
+
work results from an entity transaction, each party to that
|
| 445 |
+
transaction who receives a copy of the work also receives whatever
|
| 446 |
+
licenses to the work the party's predecessor in interest had or could
|
| 447 |
+
give under the previous paragraph, plus a right to possession of the
|
| 448 |
+
Corresponding Source of the work from the predecessor in interest, if
|
| 449 |
+
the predecessor has it or can get it with reasonable efforts.
|
| 450 |
+
|
| 451 |
+
You may not impose any further restrictions on the exercise of the
|
| 452 |
+
rights granted or affirmed under this License. For example, you may
|
| 453 |
+
not impose a license fee, royalty, or other charge for exercise of
|
| 454 |
+
rights granted under this License, and you may not initiate litigation
|
| 455 |
+
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
| 456 |
+
any patent claim is infringed by making, using, selling, offering for
|
| 457 |
+
sale, or importing the Program or any portion of it.
|
| 458 |
+
|
| 459 |
+
11. Patents.
|
| 460 |
+
|
| 461 |
+
A "contributor" is a copyright holder who authorizes use under this
|
| 462 |
+
License of the Program or a work on which the Program is based. The
|
| 463 |
+
work thus licensed is called the contributor's "contributor version".
|
| 464 |
+
|
| 465 |
+
A contributor's "essential patent claims" are all patent claims
|
| 466 |
+
owned or controlled by the contributor, whether already acquired or
|
| 467 |
+
hereafter acquired, that would be infringed by some manner, permitted
|
| 468 |
+
by this License, of making, using, or selling its contributor version,
|
| 469 |
+
but do not include claims that would be infringed only as a
|
| 470 |
+
consequence of further modification of the contributor version. For
|
| 471 |
+
purposes of this definition, "control" includes the right to grant
|
| 472 |
+
patent sublicenses in a manner consistent with the requirements of
|
| 473 |
+
this License.
|
| 474 |
+
|
| 475 |
+
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
| 476 |
+
patent license under the contributor's essential patent claims, to
|
| 477 |
+
make, use, sell, offer for sale, import and otherwise run, modify and
|
| 478 |
+
propagate the contents of its contributor version.
|
| 479 |
+
|
| 480 |
+
In the following three paragraphs, a "patent license" is any express
|
| 481 |
+
agreement or commitment, however denominated, not to enforce a patent
|
| 482 |
+
(such as an express permission to practice a patent or covenant not to
|
| 483 |
+
sue for patent infringement). To "grant" such a patent license to a
|
| 484 |
+
party means to make such an agreement or commitment not to enforce a
|
| 485 |
+
patent against the party.
|
| 486 |
+
|
| 487 |
+
If you convey a covered work, knowingly relying on a patent license,
|
| 488 |
+
and the Corresponding Source of the work is not available for anyone
|
| 489 |
+
to copy, free of charge and under the terms of this License, through a
|
| 490 |
+
publicly available network server or other readily accessible means,
|
| 491 |
+
then you must either (1) cause the Corresponding Source to be so
|
| 492 |
+
available, or (2) arrange to deprive yourself of the benefit of the
|
| 493 |
+
patent license for this particular work, or (3) arrange, in a manner
|
| 494 |
+
consistent with the requirements of this License, to extend the patent
|
| 495 |
+
license to downstream recipients. "Knowingly relying" means you have
|
| 496 |
+
actual knowledge that, but for the patent license, your conveying the
|
| 497 |
+
covered work in a country, or your recipient's use of the covered work
|
| 498 |
+
in a country, would infringe one or more identifiable patents in that
|
| 499 |
+
country that you have reason to believe are valid.
|
| 500 |
+
|
| 501 |
+
If, pursuant to or in connection with a single transaction or
|
| 502 |
+
arrangement, you convey, or propagate by procuring conveyance of, a
|
| 503 |
+
covered work, and grant a patent license to some of the parties
|
| 504 |
+
receiving the covered work authorizing them to use, propagate, modify
|
| 505 |
+
or convey a specific copy of the covered work, then the patent license
|
| 506 |
+
you grant is automatically extended to all recipients of the covered
|
| 507 |
+
work and works based on it.
|
| 508 |
+
|
| 509 |
+
A patent license is "discriminatory" if it does not include within
|
| 510 |
+
the scope of its coverage, prohibits the exercise of, or is
|
| 511 |
+
conditioned on the non-exercise of one or more of the rights that are
|
| 512 |
+
specifically granted under this License. You may not convey a covered
|
| 513 |
+
work if you are a party to an arrangement with a third party that is
|
| 514 |
+
in the business of distributing software, under which you make payment
|
| 515 |
+
to the third party based on the extent of your activity of conveying
|
| 516 |
+
the work, and under which the third party grants, to any of the
|
| 517 |
+
parties who would receive the covered work from you, a discriminatory
|
| 518 |
+
patent license (a) in connection with copies of the covered work
|
| 519 |
+
conveyed by you (or copies made from those copies), or (b) primarily
|
| 520 |
+
for and in connection with specific products or compilations that
|
| 521 |
+
contain the covered work, unless you entered into that arrangement,
|
| 522 |
+
or that patent license was granted, prior to 28 March 2007.
|
| 523 |
+
|
| 524 |
+
Nothing in this License shall be construed as excluding or limiting
|
| 525 |
+
any implied license or other defenses to infringement that may
|
| 526 |
+
otherwise be available to you under applicable patent law.
|
| 527 |
+
|
| 528 |
+
12. No Surrender of Others' Freedom.
|
| 529 |
+
|
| 530 |
+
If conditions are imposed on you (whether by court order, agreement or
|
| 531 |
+
otherwise) that contradict the conditions of this License, they do not
|
| 532 |
+
excuse you from the conditions of this License. If you cannot convey a
|
| 533 |
+
covered work so as to satisfy simultaneously your obligations under this
|
| 534 |
+
License and any other pertinent obligations, then as a consequence you may
|
| 535 |
+
not convey it at all. For example, if you agree to terms that obligate you
|
| 536 |
+
to collect a royalty for further conveying from those to whom you convey
|
| 537 |
+
the Program, the only way you could satisfy both those terms and this
|
| 538 |
+
License would be to refrain entirely from conveying the Program.
|
| 539 |
+
|
| 540 |
+
13. Remote Network Interaction; Use with the GNU General Public License.
|
| 541 |
+
|
| 542 |
+
Notwithstanding any other provision of this License, if you modify the
|
| 543 |
+
Program, your modified version must prominently offer all users
|
| 544 |
+
interacting with it remotely through a computer network (if your version
|
| 545 |
+
supports such interaction) an opportunity to receive the Corresponding
|
| 546 |
+
Source of your version by providing access to the Corresponding Source
|
| 547 |
+
from a network server at no charge, through some standard or customary
|
| 548 |
+
means of facilitating copying of software. This Corresponding Source
|
| 549 |
+
shall include the Corresponding Source for any work covered by version 3
|
| 550 |
+
of the GNU General Public License that is incorporated pursuant to the
|
| 551 |
+
following paragraph.
|
| 552 |
+
|
| 553 |
+
Notwithstanding any other provision of this License, you have
|
| 554 |
+
permission to link or combine any covered work with a work licensed
|
| 555 |
+
under version 3 of the GNU General Public License into a single
|
| 556 |
+
combined work, and to convey the resulting work. The terms of this
|
| 557 |
+
License will continue to apply to the part which is the covered work,
|
| 558 |
+
but the work with which it is combined will remain governed by version
|
| 559 |
+
3 of the GNU General Public License.
|
| 560 |
+
|
| 561 |
+
14. Revised Versions of this License.
|
| 562 |
+
|
| 563 |
+
The Free Software Foundation may publish revised and/or new versions of
|
| 564 |
+
the GNU Affero General Public License from time to time. Such new versions
|
| 565 |
+
will be similar in spirit to the present version, but may differ in detail to
|
| 566 |
+
address new problems or concerns.
|
| 567 |
+
|
| 568 |
+
Each version is given a distinguishing version number. If the
|
| 569 |
+
Program specifies that a certain numbered version of the GNU Affero General
|
| 570 |
+
Public License "or any later version" applies to it, you have the
|
| 571 |
+
option of following the terms and conditions either of that numbered
|
| 572 |
+
version or of any later version published by the Free Software
|
| 573 |
+
Foundation. If the Program does not specify a version number of the
|
| 574 |
+
GNU Affero General Public License, you may choose any version ever published
|
| 575 |
+
by the Free Software Foundation.
|
| 576 |
+
|
| 577 |
+
If the Program specifies that a proxy can decide which future
|
| 578 |
+
versions of the GNU Affero General Public License can be used, that proxy's
|
| 579 |
+
public statement of acceptance of a version permanently authorizes you
|
| 580 |
+
to choose that version for the Program.
|
| 581 |
+
|
| 582 |
+
Later license versions may give you additional or different
|
| 583 |
+
permissions. However, no additional obligations are imposed on any
|
| 584 |
+
author or copyright holder as a result of your choosing to follow a
|
| 585 |
+
later version.
|
| 586 |
+
|
| 587 |
+
15. Disclaimer of Warranty.
|
| 588 |
+
|
| 589 |
+
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
| 590 |
+
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
| 591 |
+
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
| 592 |
+
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
| 593 |
+
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
| 594 |
+
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
| 595 |
+
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
| 596 |
+
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
| 597 |
+
|
| 598 |
+
16. Limitation of Liability.
|
| 599 |
+
|
| 600 |
+
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
| 601 |
+
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
| 602 |
+
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
| 603 |
+
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
| 604 |
+
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
| 605 |
+
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
| 606 |
+
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
| 607 |
+
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
| 608 |
+
SUCH DAMAGES.
|
| 609 |
+
|
| 610 |
+
17. Interpretation of Sections 15 and 16.
|
| 611 |
+
|
| 612 |
+
If the disclaimer of warranty and limitation of liability provided
|
| 613 |
+
above cannot be given local legal effect according to their terms,
|
| 614 |
+
reviewing courts shall apply local law that most closely approximates
|
| 615 |
+
an absolute waiver of all civil liability in connection with the
|
| 616 |
+
Program, unless a warranty or assumption of liability accompanies a
|
| 617 |
+
copy of the Program in return for a fee.
|
| 618 |
+
|
| 619 |
+
END OF TERMS AND CONDITIONS
|
| 620 |
+
|
| 621 |
+
How to Apply These Terms to Your New Programs
|
| 622 |
+
|
| 623 |
+
If you develop a new program, and you want it to be of the greatest
|
| 624 |
+
possible use to the public, the best way to achieve this is to make it
|
| 625 |
+
free software which everyone can redistribute and change under these terms.
|
| 626 |
+
|
| 627 |
+
To do so, attach the following notices to the program. It is safest
|
| 628 |
+
to attach them to the start of each source file to most effectively
|
| 629 |
+
state the exclusion of warranty; and each file should have at least
|
| 630 |
+
the "copyright" line and a pointer to where the full notice is found.
|
| 631 |
+
|
| 632 |
+
<one line to give the program's name and a brief idea of what it does.>
|
| 633 |
+
Copyright (C) <year> <name of author>
|
| 634 |
+
|
| 635 |
+
This program is free software: you can redistribute it and/or modify
|
| 636 |
+
it under the terms of the GNU Affero General Public License as published by
|
| 637 |
+
the Free Software Foundation, either version 3 of the License, or
|
| 638 |
+
(at your option) any later version.
|
| 639 |
+
|
| 640 |
+
This program is distributed in the hope that it will be useful,
|
| 641 |
+
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
| 642 |
+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
| 643 |
+
GNU Affero General Public License for more details.
|
| 644 |
+
|
| 645 |
+
You should have received a copy of the GNU Affero General Public License
|
| 646 |
+
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
| 647 |
+
|
| 648 |
+
Also add information on how to contact you by electronic and paper mail.
|
| 649 |
+
|
| 650 |
+
If your software can interact with users remotely through a computer
|
| 651 |
+
network, you should also make sure that it provides a way for users to
|
| 652 |
+
get its source. For example, if your program is a web application, its
|
| 653 |
+
interface could display a "Source" link that leads users to an archive
|
| 654 |
+
of the code. There are many ways you could offer source, and different
|
| 655 |
+
solutions will be better for different programs; see section 13 for the
|
| 656 |
+
specific requirements.
|
| 657 |
+
|
| 658 |
+
You should also get your employer (if you work as a programmer) or school,
|
| 659 |
+
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
| 660 |
+
For more information on this, and how to apply and follow the GNU AGPL, see
|
| 661 |
+
<https://www.gnu.org/licenses/>.
|
NOTICE
ADDED
|
@@ -0,0 +1,27 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
FlashImgs Hugging Face Space
|
| 2 |
+
Copyright (C) 2025 OpsiClear
|
| 3 |
+
|
| 4 |
+
The wrapper code in this repository (app.py and configuration files) is licensed
|
| 5 |
+
under the GNU Affero General Public License v3.0 (AGPL-3.0). See the LICENSE file
|
| 6 |
+
for the full terms.
|
| 7 |
+
|
| 8 |
+
----------------------------------------------------------------------
|
| 9 |
+
Vendored components (NOT covered by the AGPL-3.0 license above)
|
| 10 |
+
----------------------------------------------------------------------
|
| 11 |
+
|
| 12 |
+
This Space vendors prebuilt wheels of the FlashImgs library under wheels/:
|
| 13 |
+
|
| 14 |
+
flashimgs (built from https://github.com/OpsiClear/flashimgs,
|
| 15 |
+
commit 11d4d3b)
|
| 16 |
+
simple_sum_backend (CUDA rasterizer backend)
|
| 17 |
+
fussim (fused-SSIM CUDA extension, OpsiClear fork)
|
| 18 |
+
|
| 19 |
+
The CUDA-extension wheels (fussim, simple_sum_backend) are compiled for CPython
|
| 20 |
+
3.12, torch 2.11.0+cu128 (CUDA 12.8), and NVIDIA Blackwell sm_120.
|
| 21 |
+
|
| 22 |
+
FlashImgs and simple_sum_backend are distributed under the OpsiClear Restrictive
|
| 23 |
+
License — non-commercial use only, no derivatives, and no redistribution. The
|
| 24 |
+
fussim extension derives from github.com/rahul-goel/fused-ssim (MIT license,
|
| 25 |
+
Rahul Goel et al.). The AGPL-3.0 license of this wrapper does NOT extend to these
|
| 26 |
+
vendored components; building, deploying, and using the application is subject to
|
| 27 |
+
the FlashImgs license terms, which take precedence for them.
|
README.md
CHANGED
|
@@ -1,13 +1,101 @@
|
|
| 1 |
---
|
| 2 |
-
title:
|
| 3 |
-
emoji:
|
| 4 |
-
colorFrom:
|
| 5 |
-
colorTo:
|
| 6 |
sdk: gradio
|
| 7 |
-
sdk_version: 6.
|
| 8 |
-
python_version:
|
| 9 |
app_file: app.py
|
|
|
|
|
|
|
| 10 |
pinned: false
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 11 |
---
|
| 12 |
|
| 13 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
---
|
| 2 |
+
title: FlashImgs
|
| 3 |
+
emoji: 💠
|
| 4 |
+
colorFrom: indigo
|
| 5 |
+
colorTo: purple
|
| 6 |
sdk: gradio
|
| 7 |
+
sdk_version: 6.16.0
|
| 8 |
+
python_version: "3.12.12"
|
| 9 |
app_file: app.py
|
| 10 |
+
suggested_hardware: zero-a10g
|
| 11 |
+
fullWidth: true
|
| 12 |
pinned: false
|
| 13 |
+
license: agpl-3.0
|
| 14 |
+
short_description: Adaptive 2D Gaussian splat fitting for images (ZeroGPU).
|
| 15 |
+
tags:
|
| 16 |
+
- gaussian-splatting
|
| 17 |
+
- 2d-gaussian-splatting
|
| 18 |
+
- image-representation
|
| 19 |
+
- gradio
|
| 20 |
+
- zerogpu
|
| 21 |
+
- computer-vision
|
| 22 |
---
|
| 23 |
|
| 24 |
+
# FlashImgs — 2D Gaussian Splatting for Images
|
| 25 |
+
|
| 26 |
+
Fit any image as a set of **2D Gaussians** in seconds, preview the
|
| 27 |
+
reconstruction and a 3D Gaussian-splat point cloud, and export files for
|
| 28 |
+
standard splat viewers. This Space is a [Gradio](https://www.gradio.app/)
|
| 29 |
+
wrapper around the [FlashImgs](https://github.com/OpsiClear/flashimgs) adaptive
|
| 30 |
+
fitter, running on **[ZeroGPU](https://huggingface.co/docs/hub/spaces-zerogpu)**.
|
| 31 |
+
It does **not** use the gaussifier feedforward sampler, AOTI, or TensorRT path.
|
| 32 |
+
|
| 33 |
+
## Hardware (ZeroGPU)
|
| 34 |
+
|
| 35 |
+
The GPU-bound fit is wrapped with `@spaces.GPU`, so the Space requests a
|
| 36 |
+
ZeroGPU (NVIDIA RTX Pro 6000 Blackwell, `sm_120`) slice only while a fit runs
|
| 37 |
+
and releases it immediately after.
|
| 38 |
+
|
| 39 |
+
To host this on ZeroGPU you need **ZeroGPU enabled on the account** that owns the
|
| 40 |
+
Space (a **PRO** subscription for a personal account, or a Team/Enterprise plan
|
| 41 |
+
for an organization), then select **ZeroGPU** in *Settings → Hardware*. The
|
| 42 |
+
`@spaces.GPU` decorator is a no-op off ZeroGPU, so the Space also runs unchanged
|
| 43 |
+
on a standard GPU tier.
|
| 44 |
+
|
| 45 |
+
## How to use
|
| 46 |
+
|
| 47 |
+
1. Upload an image (PNG/WebP alpha is honored automatically as a fit mask).
|
| 48 |
+
2. Adjust the **Fit** settings (max side, gaussian budget, steps, loss) if needed.
|
| 49 |
+
3. Click **Fit**.
|
| 50 |
+
4. Inspect the **3DGS** point-cloud preview and the **Image** reconstruction.
|
| 51 |
+
5. Tweak the **PLY** export controls (opacity, scale, thickness, Y axis) — the
|
| 52 |
+
3D preview updates live — then download the files.
|
| 53 |
+
|
| 54 |
+
### Masks
|
| 55 |
+
|
| 56 |
+
- Embedded PNG/WebP alpha masks are used automatically to fit only the subject.
|
| 57 |
+
- With **Treat image border as mask border** enabled, opaque/RGB images use the
|
| 58 |
+
image frame as the mask boundary.
|
| 59 |
+
|
| 60 |
+
## Outputs
|
| 61 |
+
|
| 62 |
+
- Reconstruction preview plus PSNR / SSIM and timing metrics.
|
| 63 |
+
- `.splat2d` file compatible with the FlashImgs web viewer.
|
| 64 |
+
- Edited planar **3DGS `.ply`** for standard splat viewers. The `factor_rgb`
|
| 65 |
+
opacity scale, mask-edge scale clamp, thickness, and Y-axis controls update
|
| 66 |
+
the preview while you adjust them; the downloadable PLY is always the latest
|
| 67 |
+
edited file.
|
| 68 |
+
|
| 69 |
+
## How the build works
|
| 70 |
+
|
| 71 |
+
ZeroGPU Spaces use the Gradio SDK and install from `requirements.txt` with no
|
| 72 |
+
build-time CUDA toolchain, so FlashImgs and its CUDA backends cannot be compiled
|
| 73 |
+
on the Space. Instead, prebuilt wheels are vendored under [`wheels/`](wheels):
|
| 74 |
+
|
| 75 |
+
- `flashimgs` (pure Python, built from commit `11d4d3b`)
|
| 76 |
+
- `fussim` and `simple_sum_backend` — CUDA extensions compiled for
|
| 77 |
+
**CPython 3.12**, **torch 2.11.0+cu128 (CUDA 12.8)**, and **Blackwell `sm_120`**
|
| 78 |
+
|
| 79 |
+
These match `torch==2.11.0+cu128` / `torchvision==0.26.0+cu128` pinned in
|
| 80 |
+
`requirements.txt`, and `python_version: 3.12.12` in the front matter above.
|
| 81 |
+
`cfgs/default.yaml` is included at the Space root because FlashImgs resolves its
|
| 82 |
+
default config relative to the working directory.
|
| 83 |
+
|
| 84 |
+
To rebuild the wheels for a new FlashImgs revision (or a different torch / CUDA
|
| 85 |
+
arch), build `fussim` and `simple_sum_backend` from the FlashImgs source with
|
| 86 |
+
`TORCH_CUDA_ARCH_LIST=12.0+PTX` against the target torch, and rebuild the
|
| 87 |
+
`flashimgs` wheel with full package discovery.
|
| 88 |
+
|
| 89 |
+
## License
|
| 90 |
+
|
| 91 |
+
The wrapper code in this repository (`app.py`, configuration) is released under
|
| 92 |
+
the **GNU Affero General Public License v3.0** (AGPL-3.0) — see [`LICENSE`](LICENSE)
|
| 93 |
+
and [`NOTICE`](NOTICE). Because AGPL-3.0 is a network-copyleft license, anyone who
|
| 94 |
+
runs a modified version of this wrapper as a network service must offer its users
|
| 95 |
+
the modified source.
|
| 96 |
+
|
| 97 |
+
The vendored **FlashImgs** wheels (`flashimgs`, `simple_sum_backend`, and the
|
| 98 |
+
OpsiClear `fussim` fork) are a separate work under the **OpsiClear Restrictive
|
| 99 |
+
License** (non-commercial use only). The AGPL-3.0 license of this wrapper does
|
| 100 |
+
not extend to the FlashImgs engine; running the deployed app is subject to the
|
| 101 |
+
FlashImgs terms.
|
app.py
ADDED
|
@@ -0,0 +1,701 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
# FlashImgs Hugging Face Space
|
| 2 |
+
# Copyright (C) 2025 OpsiClear
|
| 3 |
+
#
|
| 4 |
+
# This program (the Gradio wrapper) is free software: you can redistribute it
|
| 5 |
+
# and/or modify it under the terms of the GNU Affero General Public License v3.0
|
| 6 |
+
# as published by the Free Software Foundation. See the LICENSE file for the full
|
| 7 |
+
# text. It is distributed WITHOUT ANY WARRANTY.
|
| 8 |
+
#
|
| 9 |
+
# The bundled FlashImgs engine wheels (wheels/) are a separate work under the
|
| 10 |
+
# OpsiClear Restrictive License and are NOT covered by the AGPL; see NOTICE.
|
| 11 |
+
from __future__ import annotations
|
| 12 |
+
|
| 13 |
+
import gc
|
| 14 |
+
import math
|
| 15 |
+
import os
|
| 16 |
+
import shutil
|
| 17 |
+
import struct
|
| 18 |
+
import time
|
| 19 |
+
import uuid
|
| 20 |
+
from pathlib import Path
|
| 21 |
+
|
| 22 |
+
import gradio as gr
|
| 23 |
+
import numpy as np
|
| 24 |
+
import torch
|
| 25 |
+
from PIL import Image, ImageOps
|
| 26 |
+
|
| 27 |
+
try:
|
| 28 |
+
import spaces # Hugging Face ZeroGPU runtime
|
| 29 |
+
except Exception: # effect-free fallback when not running on ZeroGPU
|
| 30 |
+
class _SpacesStub:
|
| 31 |
+
@staticmethod
|
| 32 |
+
def GPU(*args, **kwargs):
|
| 33 |
+
def _decorator(func):
|
| 34 |
+
return func
|
| 35 |
+
|
| 36 |
+
if args and callable(args[0]):
|
| 37 |
+
return args[0]
|
| 38 |
+
return _decorator
|
| 39 |
+
|
| 40 |
+
spaces = _SpacesStub()
|
| 41 |
+
|
| 42 |
+
|
| 43 |
+
os.environ.setdefault("FLASHIMGS_GAUSSIFIER_AOTI", "0")
|
| 44 |
+
|
| 45 |
+
OUTPUT_ROOT = Path(os.environ.get("FLASHIMGS_OUTPUT_DIR", "/tmp/flashimgs_hf_outputs"))
|
| 46 |
+
OUTPUT_ROOT.mkdir(parents=True, exist_ok=True)
|
| 47 |
+
|
| 48 |
+
APP_CSS = """
|
| 49 |
+
#workspace {
|
| 50 |
+
max-width: 1440px;
|
| 51 |
+
margin: 0 auto;
|
| 52 |
+
gap: 16px;
|
| 53 |
+
align-items: flex-start;
|
| 54 |
+
}
|
| 55 |
+
.settings-panel {
|
| 56 |
+
flex: 0 0 330px !important;
|
| 57 |
+
max-width: 350px !important;
|
| 58 |
+
min-width: 300px !important;
|
| 59 |
+
}
|
| 60 |
+
.results-panel {
|
| 61 |
+
flex: 1 1 0 !important;
|
| 62 |
+
min-width: min(760px, 100%) !important;
|
| 63 |
+
}
|
| 64 |
+
.preview-tabs, .preview-tabs > div {
|
| 65 |
+
min-width: 0;
|
| 66 |
+
}
|
| 67 |
+
.download-row {
|
| 68 |
+
gap: 12px;
|
| 69 |
+
}
|
| 70 |
+
@media (max-width: 920px) {
|
| 71 |
+
#workspace {
|
| 72 |
+
display: block;
|
| 73 |
+
}
|
| 74 |
+
.settings-panel, .results-panel {
|
| 75 |
+
max-width: none !important;
|
| 76 |
+
min-width: 0 !important;
|
| 77 |
+
flex-basis: auto !important;
|
| 78 |
+
}
|
| 79 |
+
}
|
| 80 |
+
"""
|
| 81 |
+
|
| 82 |
+
|
| 83 |
+
def _load_flashimgs():
|
| 84 |
+
import flashimgs
|
| 85 |
+
|
| 86 |
+
return flashimgs
|
| 87 |
+
|
| 88 |
+
|
| 89 |
+
def _device_name() -> str:
|
| 90 |
+
if not torch.cuda.is_available():
|
| 91 |
+
return "CPU"
|
| 92 |
+
return torch.cuda.get_device_name(torch.cuda.current_device())
|
| 93 |
+
|
| 94 |
+
|
| 95 |
+
def _prepare_image(image: Image.Image, max_side: int) -> tuple[torch.Tensor, Image.Image, torch.Tensor | None, str]:
|
| 96 |
+
if image is None:
|
| 97 |
+
raise gr.Error("Upload an image first.")
|
| 98 |
+
|
| 99 |
+
image = ImageOps.exif_transpose(image)
|
| 100 |
+
original_w, original_h = image.size
|
| 101 |
+
has_alpha = image.mode in {"RGBA", "LA"} or (image.mode == "P" and "transparency" in image.info)
|
| 102 |
+
image_rgba = image.convert("RGBA")
|
| 103 |
+
|
| 104 |
+
max_side = int(max_side)
|
| 105 |
+
if max_side > 0 and max(original_w, original_h) > max_side:
|
| 106 |
+
scale = max_side / float(max(original_w, original_h))
|
| 107 |
+
new_size = (max(1, round(original_w * scale)), max(1, round(original_h * scale)))
|
| 108 |
+
image_rgba = image_rgba.resize(new_size, Image.Resampling.LANCZOS)
|
| 109 |
+
|
| 110 |
+
rgba = np.asarray(image_rgba, dtype=np.uint8)
|
| 111 |
+
rgb = rgba[..., :3].astype(np.float32) / 255.0
|
| 112 |
+
image_rgb = Image.fromarray(rgba[..., :3], mode="RGB")
|
| 113 |
+
image_tensor = torch.from_numpy(rgb).permute(2, 0, 1).contiguous()
|
| 114 |
+
|
| 115 |
+
mask_tensor = None
|
| 116 |
+
if has_alpha:
|
| 117 |
+
alpha = rgba[..., 3]
|
| 118 |
+
if alpha.min() < 255:
|
| 119 |
+
mask_array = (alpha > 127).astype(np.float32)
|
| 120 |
+
if np.any(mask_array):
|
| 121 |
+
mask_tensor = torch.from_numpy(mask_array).unsqueeze(0).contiguous()
|
| 122 |
+
|
| 123 |
+
size_note = f"{original_w}x{original_h}"
|
| 124 |
+
if image_rgba.size != (original_w, original_h):
|
| 125 |
+
size_note += f" -> {image_rgba.size[0]}x{image_rgba.size[1]}"
|
| 126 |
+
return image_tensor, image_rgb, mask_tensor, size_note
|
| 127 |
+
|
| 128 |
+
|
| 129 |
+
def _tensor_to_pil(tensor: torch.Tensor) -> Image.Image:
|
| 130 |
+
array = (
|
| 131 |
+
tensor.detach()
|
| 132 |
+
.clamp(0.0, 1.0)
|
| 133 |
+
.mul(255.0)
|
| 134 |
+
.byte()
|
| 135 |
+
.permute(1, 2, 0)
|
| 136 |
+
.cpu()
|
| 137 |
+
.numpy()
|
| 138 |
+
)
|
| 139 |
+
return Image.fromarray(array, mode="RGB")
|
| 140 |
+
|
| 141 |
+
|
| 142 |
+
def _prune_old_outputs(keep: int = 20) -> None:
|
| 143 |
+
runs = [p for p in OUTPUT_ROOT.iterdir() if p.is_dir()]
|
| 144 |
+
runs.sort(key=lambda p: p.stat().st_mtime, reverse=True)
|
| 145 |
+
for path in runs[keep:]:
|
| 146 |
+
shutil.rmtree(path, ignore_errors=True)
|
| 147 |
+
|
| 148 |
+
|
| 149 |
+
def _load_splat2d(path: Path):
|
| 150 |
+
with path.open("rb") as f:
|
| 151 |
+
magic = f.read(4)
|
| 152 |
+
if magic != b"GS2D":
|
| 153 |
+
raise gr.Error("The cached Splat2D file is not a FlashImgs GS2D file.")
|
| 154 |
+
header = f.read(8)
|
| 155 |
+
if len(header) != 8:
|
| 156 |
+
raise gr.Error("The cached Splat2D file is truncated.")
|
| 157 |
+
n_gaussians, height, width = struct.unpack("<IHH", header)
|
| 158 |
+
floats = np.fromfile(f, dtype="<f4")
|
| 159 |
+
|
| 160 |
+
if n_gaussians <= 0:
|
| 161 |
+
raise gr.Error("The cached Splat2D file has no Gaussians.")
|
| 162 |
+
if floats.size % n_gaussians != 0:
|
| 163 |
+
raise gr.Error("The cached Splat2D file has an invalid payload length.")
|
| 164 |
+
|
| 165 |
+
floats_per_gaussian = floats.size // n_gaussians
|
| 166 |
+
feature_dim = floats_per_gaussian - 5
|
| 167 |
+
if feature_dim <= 0:
|
| 168 |
+
raise gr.Error("The cached Splat2D file does not contain color features.")
|
| 169 |
+
|
| 170 |
+
offset = 0
|
| 171 |
+
xy = floats[offset : offset + n_gaussians * 2].reshape(n_gaussians, 2)
|
| 172 |
+
offset += n_gaussians * 2
|
| 173 |
+
raw_scale = floats[offset : offset + n_gaussians * 2].reshape(n_gaussians, 2)
|
| 174 |
+
offset += n_gaussians * 2
|
| 175 |
+
rot = floats[offset : offset + n_gaussians]
|
| 176 |
+
offset += n_gaussians
|
| 177 |
+
feat = floats[offset:].reshape(n_gaussians, feature_dim)
|
| 178 |
+
|
| 179 |
+
# The Gradio training path uses FlashImgs' normal inverse-scale parameterization.
|
| 180 |
+
scale_px = 1.0 / np.maximum(raw_scale, 0.01)
|
| 181 |
+
return xy, scale_px.astype(np.float32), rot, feat, int(height), int(width)
|
| 182 |
+
|
| 183 |
+
|
| 184 |
+
def _mask_edge_distance(mask_array: np.ndarray) -> np.ndarray:
|
| 185 |
+
import cv2
|
| 186 |
+
|
| 187 |
+
mask_u8 = (mask_array > 0).astype(np.uint8)
|
| 188 |
+
padded = np.pad(mask_u8, 1, mode="constant", constant_values=0)
|
| 189 |
+
dist = cv2.distanceTransform(padded, cv2.DIST_L2, cv2.DIST_MASK_PRECISE)
|
| 190 |
+
return dist[1:-1, 1:-1].astype(np.float32, copy=False)
|
| 191 |
+
|
| 192 |
+
|
| 193 |
+
def _write_ply_from_splat_arrays(
|
| 194 |
+
path: Path,
|
| 195 |
+
xy: np.ndarray,
|
| 196 |
+
scale_px: np.ndarray,
|
| 197 |
+
rot: np.ndarray,
|
| 198 |
+
feat: np.ndarray,
|
| 199 |
+
height: int,
|
| 200 |
+
width: int,
|
| 201 |
+
*,
|
| 202 |
+
mask_array: np.ndarray | None = None,
|
| 203 |
+
mask_edge_clamp: float = 0.35,
|
| 204 |
+
opacity_scale: float,
|
| 205 |
+
min_opacity: float,
|
| 206 |
+
max_opacity: float,
|
| 207 |
+
scale_multiplier: float,
|
| 208 |
+
thickness: float,
|
| 209 |
+
y_axis: str,
|
| 210 |
+
) -> None:
|
| 211 |
+
n_gaussians = int(xy.shape[0])
|
| 212 |
+
height_f = max(float(height), 1.0)
|
| 213 |
+
width_f = max(float(width), 1.0)
|
| 214 |
+
aspect = width_f / height_f
|
| 215 |
+
world_height = 1.0
|
| 216 |
+
thickness = max(float(thickness), 1e-8)
|
| 217 |
+
opacity_mode = "factor_rgb"
|
| 218 |
+
opacity_scale = max(float(opacity_scale), 1e-6)
|
| 219 |
+
min_opacity = min(1.0 - 1e-6, max(1e-6, float(min_opacity)))
|
| 220 |
+
max_opacity = min(1.0 - 1e-6, max(min_opacity, float(max_opacity)))
|
| 221 |
+
scale_multiplier = max(float(scale_multiplier), 1e-6)
|
| 222 |
+
y_axis = str(y_axis).lower().strip()
|
| 223 |
+
if y_axis not in {"down", "up"}:
|
| 224 |
+
y_axis = "down"
|
| 225 |
+
|
| 226 |
+
if mask_array is not None and float(mask_edge_clamp) > 0:
|
| 227 |
+
dist = _mask_edge_distance(mask_array)
|
| 228 |
+
x_px = np.clip(np.floor(xy[:, 0] * float(width)).astype(np.int64), 0, int(width) - 1)
|
| 229 |
+
y_px = np.clip(np.floor(xy[:, 1] * float(height)).astype(np.int64), 0, int(height) - 1)
|
| 230 |
+
max_scale = np.maximum(0.25, dist[y_px, x_px] * float(mask_edge_clamp)).astype(np.float32)
|
| 231 |
+
scale_px = np.minimum(scale_px, max_scale[:, None]).astype(np.float32, copy=False)
|
| 232 |
+
|
| 233 |
+
if feat.shape[1] == 1:
|
| 234 |
+
rgb = np.repeat(feat[:, :1], 3, axis=1)
|
| 235 |
+
elif feat.shape[1] < 3:
|
| 236 |
+
rgb = np.pad(feat, ((0, 0), (0, 3 - feat.shape[1])), mode="constant")
|
| 237 |
+
else:
|
| 238 |
+
rgb = feat[:, :3]
|
| 239 |
+
rgb = np.clip(rgb, 0.0, 1.0).astype(np.float32, copy=False)
|
| 240 |
+
|
| 241 |
+
amp = np.max(rgb, axis=1).astype(np.float32, copy=False)
|
| 242 |
+
alpha = np.clip(opacity_scale * amp, min_opacity, max_opacity).astype(np.float32)
|
| 243 |
+
ply_rgb = np.clip(rgb / alpha[:, None], 0.0, 1.0).astype(np.float32, copy=False)
|
| 244 |
+
|
| 245 |
+
alpha = np.clip(alpha, 1e-6, 1.0 - 1e-6).astype(np.float32, copy=False)
|
| 246 |
+
opacity_logit = np.log(alpha / (1.0 - alpha)).astype(np.float32, copy=False)
|
| 247 |
+
f_dc = (ply_rgb - 0.5) / 0.28209479177387814
|
| 248 |
+
|
| 249 |
+
names = ["x", "y", "z", "nx", "ny", "nz", "f_dc_0", "f_dc_1", "f_dc_2"]
|
| 250 |
+
names += [f"f_rest_{i}" for i in range(45)]
|
| 251 |
+
names += ["opacity", "scale_0", "scale_1", "scale_2", "rot_0", "rot_1", "rot_2", "rot_3"]
|
| 252 |
+
names += ["fi_u", "fi_v", "fi_scale_x_px", "fi_scale_y_px", "fi_rot", "fi_r", "fi_g", "fi_b"]
|
| 253 |
+
|
| 254 |
+
vertices = np.zeros(n_gaussians, dtype=np.dtype([(name, "<f4") for name in names]))
|
| 255 |
+
vertices["x"] = (xy[:, 0] - 0.5) * aspect * world_height
|
| 256 |
+
if y_axis == "down":
|
| 257 |
+
vertices["y"] = (xy[:, 1] - 0.5) * world_height
|
| 258 |
+
theta = -rot
|
| 259 |
+
else:
|
| 260 |
+
vertices["y"] = (0.5 - xy[:, 1]) * world_height
|
| 261 |
+
theta = rot
|
| 262 |
+
vertices["z"] = 0.0
|
| 263 |
+
vertices["f_dc_0"] = f_dc[:, 0]
|
| 264 |
+
vertices["f_dc_1"] = f_dc[:, 1]
|
| 265 |
+
vertices["f_dc_2"] = f_dc[:, 2]
|
| 266 |
+
vertices["opacity"] = opacity_logit
|
| 267 |
+
|
| 268 |
+
scale_world = np.maximum(scale_px * scale_multiplier * (world_height / height_f), 1e-8)
|
| 269 |
+
vertices["scale_0"] = np.log(scale_world[:, 0])
|
| 270 |
+
vertices["scale_1"] = np.log(scale_world[:, 1])
|
| 271 |
+
vertices["scale_2"] = math.log(thickness)
|
| 272 |
+
vertices["rot_0"] = np.cos(0.5 * theta)
|
| 273 |
+
vertices["rot_1"] = 0.0
|
| 274 |
+
vertices["rot_2"] = 0.0
|
| 275 |
+
vertices["rot_3"] = np.sin(0.5 * theta)
|
| 276 |
+
vertices["fi_u"] = xy[:, 0]
|
| 277 |
+
vertices["fi_v"] = xy[:, 1]
|
| 278 |
+
vertices["fi_scale_x_px"] = scale_px[:, 0]
|
| 279 |
+
vertices["fi_scale_y_px"] = scale_px[:, 1]
|
| 280 |
+
vertices["fi_rot"] = rot
|
| 281 |
+
vertices["fi_r"] = rgb[:, 0]
|
| 282 |
+
vertices["fi_g"] = rgb[:, 1]
|
| 283 |
+
vertices["fi_b"] = rgb[:, 2]
|
| 284 |
+
|
| 285 |
+
path.parent.mkdir(parents=True, exist_ok=True)
|
| 286 |
+
header = [
|
| 287 |
+
"ply",
|
| 288 |
+
"format binary_little_endian 1.0",
|
| 289 |
+
"comment FlashImgs planar 2DGS export for standard 3DGS viewers",
|
| 290 |
+
f"comment fi_image_width {int(width)}",
|
| 291 |
+
f"comment fi_image_height {int(height)}",
|
| 292 |
+
f"comment fi_world_height {world_height:.9g}",
|
| 293 |
+
f"comment fi_world_width {aspect * world_height:.9g}",
|
| 294 |
+
f"comment fi_y_axis {y_axis}",
|
| 295 |
+
f"comment fi_opacity_mode {opacity_mode}",
|
| 296 |
+
f"comment fi_opacity_scale {opacity_scale:.9g}",
|
| 297 |
+
f"comment fi_min_opacity {min_opacity:.9g}",
|
| 298 |
+
f"comment fi_max_opacity {max_opacity:.9g}",
|
| 299 |
+
f"comment fi_scale_multiplier {scale_multiplier:.9g}",
|
| 300 |
+
f"comment fi_mask_edge_clamp {float(mask_edge_clamp):.9g}",
|
| 301 |
+
f"element vertex {n_gaussians}",
|
| 302 |
+
]
|
| 303 |
+
header.extend(f"property float {name}" for name in names)
|
| 304 |
+
header.append("end_header")
|
| 305 |
+
with path.open("wb") as f:
|
| 306 |
+
f.write(("\n".join(header) + "\n").encode("ascii"))
|
| 307 |
+
vertices.tofile(f)
|
| 308 |
+
|
| 309 |
+
|
| 310 |
+
def update_ply_preview(
|
| 311 |
+
splat_path_value,
|
| 312 |
+
current_ply_path_value,
|
| 313 |
+
mask_path_value,
|
| 314 |
+
mask_edge_clamp: float,
|
| 315 |
+
ply_opacity_scale: float,
|
| 316 |
+
ply_min_opacity: float,
|
| 317 |
+
ply_max_opacity: float,
|
| 318 |
+
ply_scale_multiplier: float,
|
| 319 |
+
ply_thickness: float,
|
| 320 |
+
ply_y_axis: str,
|
| 321 |
+
):
|
| 322 |
+
if not splat_path_value:
|
| 323 |
+
return gr.update(), gr.update(), current_ply_path_value
|
| 324 |
+
splat_path = Path(str(splat_path_value))
|
| 325 |
+
if not splat_path.exists():
|
| 326 |
+
return gr.update(), gr.update(), current_ply_path_value
|
| 327 |
+
|
| 328 |
+
xy, scale_px, rot, feat, height, width = _load_splat2d(splat_path)
|
| 329 |
+
mask_array = None
|
| 330 |
+
if mask_path_value:
|
| 331 |
+
mask_path = Path(str(mask_path_value))
|
| 332 |
+
if mask_path.exists():
|
| 333 |
+
mask_array = np.load(mask_path).astype(bool)
|
| 334 |
+
old_path = Path(str(current_ply_path_value)) if current_ply_path_value else None
|
| 335 |
+
ply_path = splat_path.parent / f"flashimgs_fit_edited_{uuid.uuid4().hex[:8]}.ply"
|
| 336 |
+
_write_ply_from_splat_arrays(
|
| 337 |
+
ply_path,
|
| 338 |
+
xy,
|
| 339 |
+
scale_px,
|
| 340 |
+
rot,
|
| 341 |
+
feat,
|
| 342 |
+
height,
|
| 343 |
+
width,
|
| 344 |
+
mask_array=mask_array,
|
| 345 |
+
mask_edge_clamp=float(mask_edge_clamp),
|
| 346 |
+
opacity_scale=float(ply_opacity_scale),
|
| 347 |
+
min_opacity=float(ply_min_opacity),
|
| 348 |
+
max_opacity=float(ply_max_opacity),
|
| 349 |
+
scale_multiplier=float(ply_scale_multiplier),
|
| 350 |
+
thickness=float(ply_thickness),
|
| 351 |
+
y_axis=ply_y_axis,
|
| 352 |
+
)
|
| 353 |
+
if old_path and old_path.name.startswith("flashimgs_fit_edited_") and old_path.exists():
|
| 354 |
+
old_path.unlink(missing_ok=True)
|
| 355 |
+
return str(ply_path), str(ply_path), str(ply_path)
|
| 356 |
+
|
| 357 |
+
|
| 358 |
+
def _fit_with_progress(
|
| 359 |
+
flashimgs,
|
| 360 |
+
image_tensor: torch.Tensor,
|
| 361 |
+
*,
|
| 362 |
+
gaussians: int,
|
| 363 |
+
steps: int,
|
| 364 |
+
lr: float,
|
| 365 |
+
scale: float,
|
| 366 |
+
loss: str,
|
| 367 |
+
seed: int,
|
| 368 |
+
mask_tensor: torch.Tensor | None,
|
| 369 |
+
mask_border_padding: bool,
|
| 370 |
+
progress: gr.Progress,
|
| 371 |
+
):
|
| 372 |
+
import main as _main
|
| 373 |
+
|
| 374 |
+
total_steps = max(1, int(steps))
|
| 375 |
+
session = flashimgs.Session.from_tensor(
|
| 376 |
+
image_tensor,
|
| 377 |
+
gaussians=max(0, int(gaussians)),
|
| 378 |
+
scale=float(scale),
|
| 379 |
+
loss=loss,
|
| 380 |
+
lr_mult=float(lr),
|
| 381 |
+
device="cuda",
|
| 382 |
+
seed=int(seed),
|
| 383 |
+
mask_tensor=mask_tensor,
|
| 384 |
+
mask_border_padding=bool(mask_border_padding),
|
| 385 |
+
)
|
| 386 |
+
|
| 387 |
+
last_update = 0
|
| 388 |
+
update_every = max(1, total_steps // 100)
|
| 389 |
+
|
| 390 |
+
def on_step(completed_step: int, _gs) -> None:
|
| 391 |
+
nonlocal last_update
|
| 392 |
+
if completed_step < total_steps and completed_step - last_update < update_every:
|
| 393 |
+
return
|
| 394 |
+
last_update = int(completed_step)
|
| 395 |
+
frac = min(1.0, max(0.0, completed_step / total_steps))
|
| 396 |
+
progress(
|
| 397 |
+
0.10 + 0.78 * frac,
|
| 398 |
+
desc=f"Fitting splats: {completed_step:,}/{total_steps:,} steps",
|
| 399 |
+
)
|
| 400 |
+
|
| 401 |
+
elapsed_s, _, _ = _main.train_loop(
|
| 402 |
+
session.model,
|
| 403 |
+
total_steps,
|
| 404 |
+
verbose=False,
|
| 405 |
+
snapshot_hook=on_step,
|
| 406 |
+
)
|
| 407 |
+
on_step(total_steps, session.model)
|
| 408 |
+
|
| 409 |
+
return session, 0.0, 0.0, float(elapsed_s)
|
| 410 |
+
|
| 411 |
+
|
| 412 |
+
def _fit_duration(*args, **kwargs) -> float:
|
| 413 |
+
"""Seconds of ZeroGPU time to reserve for a fit, estimated from its arguments.
|
| 414 |
+
|
| 415 |
+
Mirrors ``fit_image``'s positional signature ``(image, max_side, gaussians,
|
| 416 |
+
steps, ...)``. Fits are fast, but reserve headroom for large images, high
|
| 417 |
+
step counts, and first-call CUDA + extension warmup.
|
| 418 |
+
"""
|
| 419 |
+
|
| 420 |
+
def _arg(idx: int, default: float) -> float:
|
| 421 |
+
try:
|
| 422 |
+
return float(args[idx])
|
| 423 |
+
except (IndexError, TypeError, ValueError):
|
| 424 |
+
return default
|
| 425 |
+
|
| 426 |
+
max_side = _arg(1, 1536.0)
|
| 427 |
+
gaussians = _arg(2, 0.0)
|
| 428 |
+
steps = _arg(3, 900.0)
|
| 429 |
+
est = 30.0 + 0.06 * steps + (gaussians / 100000.0) * 40.0
|
| 430 |
+
if max_side == 0.0 or max_side > 2048.0:
|
| 431 |
+
est += 30.0
|
| 432 |
+
return float(min(180.0, max(45.0, est)))
|
| 433 |
+
|
| 434 |
+
|
| 435 |
+
@spaces.GPU(duration=_fit_duration)
|
| 436 |
+
def fit_image(
|
| 437 |
+
image: Image.Image,
|
| 438 |
+
max_side: int,
|
| 439 |
+
gaussians: int,
|
| 440 |
+
steps: int,
|
| 441 |
+
lr: float,
|
| 442 |
+
scale: float,
|
| 443 |
+
loss: str,
|
| 444 |
+
render_height: int,
|
| 445 |
+
seed: int,
|
| 446 |
+
mask_border_padding: bool,
|
| 447 |
+
mask_edge_clamp: float,
|
| 448 |
+
ply_opacity_scale: float,
|
| 449 |
+
ply_min_opacity: float,
|
| 450 |
+
ply_max_opacity: float,
|
| 451 |
+
ply_scale_multiplier: float,
|
| 452 |
+
ply_thickness: float,
|
| 453 |
+
ply_y_axis: str,
|
| 454 |
+
progress: gr.Progress = gr.Progress(track_tqdm=False),
|
| 455 |
+
):
|
| 456 |
+
if not torch.cuda.is_available():
|
| 457 |
+
raise gr.Error(
|
| 458 |
+
"FlashImgs fitting needs CUDA. In Space settings, select a GPU hardware tier."
|
| 459 |
+
)
|
| 460 |
+
|
| 461 |
+
progress(0.02, desc="Preparing image")
|
| 462 |
+
image_tensor, resized_image, mask_tensor, size_note = _prepare_image(image, max_side)
|
| 463 |
+
fit_w, fit_h = resized_image.size
|
| 464 |
+
mask_source = "alpha" if mask_tensor is not None else "none"
|
| 465 |
+
if mask_tensor is None and bool(mask_border_padding):
|
| 466 |
+
mask_tensor = torch.ones((1, fit_h, fit_w), dtype=torch.float32).contiguous()
|
| 467 |
+
mask_source = "image border"
|
| 468 |
+
|
| 469 |
+
run_dir = OUTPUT_ROOT / uuid.uuid4().hex
|
| 470 |
+
run_dir.mkdir(parents=True, exist_ok=True)
|
| 471 |
+
splat_path = run_dir / "flashimgs_fit.splat2d"
|
| 472 |
+
ply_path = run_dir / "flashimgs_fit.ply"
|
| 473 |
+
mask_path = run_dir / "mask.npy"
|
| 474 |
+
|
| 475 |
+
flashimgs = _load_flashimgs()
|
| 476 |
+
session = None
|
| 477 |
+
psnr = 0.0
|
| 478 |
+
ssim = 0.0
|
| 479 |
+
train_elapsed_s = 0.0
|
| 480 |
+
start = time.time()
|
| 481 |
+
|
| 482 |
+
try:
|
| 483 |
+
progress(0.1, desc=f"Fitting splats: 0/{max(1, int(steps)):,} steps")
|
| 484 |
+
session, psnr, ssim, train_elapsed_s = _fit_with_progress(
|
| 485 |
+
flashimgs,
|
| 486 |
+
image_tensor,
|
| 487 |
+
gaussians=gaussians,
|
| 488 |
+
steps=steps,
|
| 489 |
+
lr=lr,
|
| 490 |
+
scale=scale,
|
| 491 |
+
loss=loss,
|
| 492 |
+
seed=seed,
|
| 493 |
+
mask_tensor=mask_tensor,
|
| 494 |
+
mask_border_padding=mask_border_padding,
|
| 495 |
+
progress=progress,
|
| 496 |
+
)
|
| 497 |
+
|
| 498 |
+
if mask_tensor is not None:
|
| 499 |
+
progress(0.86, desc="Pruning mask boundary")
|
| 500 |
+
session.mask_prune()
|
| 501 |
+
|
| 502 |
+
session.materialize_gate()
|
| 503 |
+
psnr, ssim = session.evaluate()
|
| 504 |
+
|
| 505 |
+
progress(0.88, desc="Rendering")
|
| 506 |
+
render_at = None if int(render_height) <= 0 else int(render_height)
|
| 507 |
+
reconstruction = _tensor_to_pil(session.render(height=render_at))
|
| 508 |
+
|
| 509 |
+
progress(0.94, desc="Exporting")
|
| 510 |
+
session.export_splat2d(str(splat_path))
|
| 511 |
+
mask_state_path = None
|
| 512 |
+
mask_array = None
|
| 513 |
+
if mask_tensor is not None:
|
| 514 |
+
mask_array = mask_tensor.squeeze(0).cpu().numpy().astype(bool)
|
| 515 |
+
np.save(mask_path, mask_array.astype(np.uint8))
|
| 516 |
+
mask_state_path = str(mask_path)
|
| 517 |
+
|
| 518 |
+
xy, scale_px, rot, feat, height, width = _load_splat2d(splat_path)
|
| 519 |
+
_write_ply_from_splat_arrays(
|
| 520 |
+
ply_path,
|
| 521 |
+
xy,
|
| 522 |
+
scale_px,
|
| 523 |
+
rot,
|
| 524 |
+
feat,
|
| 525 |
+
height,
|
| 526 |
+
width,
|
| 527 |
+
mask_array=mask_array,
|
| 528 |
+
mask_edge_clamp=float(mask_edge_clamp),
|
| 529 |
+
opacity_scale=float(ply_opacity_scale),
|
| 530 |
+
min_opacity=float(ply_min_opacity),
|
| 531 |
+
max_opacity=float(ply_max_opacity),
|
| 532 |
+
scale_multiplier=float(ply_scale_multiplier),
|
| 533 |
+
thickness=float(ply_thickness),
|
| 534 |
+
y_axis=ply_y_axis,
|
| 535 |
+
)
|
| 536 |
+
|
| 537 |
+
total_s = time.time() - start
|
| 538 |
+
n_gaussians = int(session.n_gaussians)
|
| 539 |
+
metrics = "\n".join(
|
| 540 |
+
[
|
| 541 |
+
f"Device: {_device_name()}",
|
| 542 |
+
f"Input: {size_note}",
|
| 543 |
+
f"Fit resolution: {fit_w}x{fit_h}",
|
| 544 |
+
f"Mask: {mask_source}",
|
| 545 |
+
f"Mask border padding: {'on' if mask_tensor is not None and mask_border_padding else 'off'}",
|
| 546 |
+
f"Mask edge clamp: {float(mask_edge_clamp):.2f}x" if mask_tensor is not None else "Mask edge clamp: off",
|
| 547 |
+
f"Gaussians: {n_gaussians:,}",
|
| 548 |
+
f"Steps: {int(steps):,}",
|
| 549 |
+
f"PSNR: {psnr:.2f} dB",
|
| 550 |
+
f"SSIM: {ssim:.5f}",
|
| 551 |
+
f"Training time: {train_elapsed_s:.2f} s",
|
| 552 |
+
f"Total request time: {total_s:.2f} s",
|
| 553 |
+
]
|
| 554 |
+
)
|
| 555 |
+
_prune_old_outputs()
|
| 556 |
+
progress(1.0, desc="Done")
|
| 557 |
+
return reconstruction, metrics, str(splat_path), str(ply_path), str(ply_path), str(splat_path), str(ply_path), mask_state_path
|
| 558 |
+
finally:
|
| 559 |
+
del session
|
| 560 |
+
gc.collect()
|
| 561 |
+
if torch.cuda.is_available():
|
| 562 |
+
torch.cuda.empty_cache()
|
| 563 |
+
|
| 564 |
+
|
| 565 |
+
with gr.Blocks(title="FlashImgs") as demo:
|
| 566 |
+
gr.Markdown("# FlashImgs")
|
| 567 |
+
splat_state = gr.State(value=None)
|
| 568 |
+
ply_state = gr.State(value=None)
|
| 569 |
+
mask_state = gr.State(value=None)
|
| 570 |
+
with gr.Row(elem_id="workspace"):
|
| 571 |
+
with gr.Column(scale=1, min_width=300, elem_classes=["settings-panel"]):
|
| 572 |
+
image = gr.Image(
|
| 573 |
+
label="Image",
|
| 574 |
+
type="pil",
|
| 575 |
+
sources=["upload", "clipboard"],
|
| 576 |
+
image_mode="RGBA",
|
| 577 |
+
height=240,
|
| 578 |
+
)
|
| 579 |
+
run = gr.Button("Fit", variant="primary")
|
| 580 |
+
with gr.Accordion("Fit", open=True):
|
| 581 |
+
max_side = gr.Slider(0, 4096, value=1536, step=64, label="Max side (0 = original)")
|
| 582 |
+
gaussians = gr.Slider(0, 100000, value=0, step=1000, label="Gaussians")
|
| 583 |
+
steps = gr.Slider(100, 3200, value=900, step=100, label="Steps")
|
| 584 |
+
loss = gr.Dropdown(["l2", "l1", "l2+ssim", "l1+ssim"], value="l2", label="Loss")
|
| 585 |
+
mask_border_padding = gr.Checkbox(value=True, label="Treat image border as mask border")
|
| 586 |
+
mask_edge_clamp = gr.Slider(0.0, 1.0, value=0.35, step=0.05, label="Mask edge scale clamp")
|
| 587 |
+
with gr.Accordion("PLY", open=True):
|
| 588 |
+
ply_opacity_scale = gr.Slider(0.1, 4.0, value=1.0, step=0.1, label="Opacity scale")
|
| 589 |
+
ply_min_opacity = gr.Slider(0.001, 0.25, value=0.01, step=0.001, label="Min opacity")
|
| 590 |
+
ply_max_opacity = gr.Slider(0.05, 0.99, value=0.95, step=0.01, label="Max opacity")
|
| 591 |
+
ply_scale_multiplier = gr.Slider(0.25, 3.0, value=1.0, step=0.05, label="XY scale multiplier")
|
| 592 |
+
ply_thickness = gr.Slider(0.00001, 0.002, value=0.0001, step=0.00001, label="Z thickness")
|
| 593 |
+
ply_y_axis = gr.Dropdown(["down", "up"], value="down", label="PLY Y axis")
|
| 594 |
+
update_ply = gr.Button("Update PLY Preview")
|
| 595 |
+
with gr.Accordion("Advanced", open=False):
|
| 596 |
+
lr = gr.Slider(1.0, 16.0, value=11.0, step=0.5, label="LR")
|
| 597 |
+
scale = gr.Slider(0.5, 4.0, value=1.5, step=0.1, label="Scale")
|
| 598 |
+
render_height = gr.Slider(0, 2048, value=0, step=128, label="Render height")
|
| 599 |
+
seed = gr.Number(value=42, precision=0, label="Seed")
|
| 600 |
+
|
| 601 |
+
with gr.Column(scale=3, min_width=520, elem_classes=["results-panel"]):
|
| 602 |
+
with gr.Tabs(elem_classes=["preview-tabs"]):
|
| 603 |
+
with gr.Tab("3DGS"):
|
| 604 |
+
ply_preview = gr.Model3D(
|
| 605 |
+
label="3DGS Preview",
|
| 606 |
+
display_mode="point_cloud",
|
| 607 |
+
clear_color=(0.03, 0.03, 0.03, 1.0),
|
| 608 |
+
height=620,
|
| 609 |
+
)
|
| 610 |
+
with gr.Tab("Image"):
|
| 611 |
+
reconstruction = gr.Image(label="Reconstruction", type="pil", height=620)
|
| 612 |
+
with gr.Accordion("Details and downloads", open=False):
|
| 613 |
+
metrics = gr.Textbox(label="Metrics", lines=9)
|
| 614 |
+
with gr.Row(elem_classes=["download-row"]):
|
| 615 |
+
splat = gr.File(label="Splat2D")
|
| 616 |
+
ply = gr.File(label="Edited 3DGS PLY")
|
| 617 |
+
|
| 618 |
+
gr.Markdown(
|
| 619 |
+
"FlashImgs Space · © 2025 OpsiClear · wrapper licensed "
|
| 620 |
+
"[AGPL-3.0](https://www.gnu.org/licenses/agpl-3.0.html) — source available "
|
| 621 |
+
"in this Space's **Files** tab. The bundled FlashImgs engine is separately "
|
| 622 |
+
"licensed (non-commercial); see NOTICE. No warranty.",
|
| 623 |
+
elem_id="app-footer",
|
| 624 |
+
)
|
| 625 |
+
|
| 626 |
+
run.click(
|
| 627 |
+
fn=fit_image,
|
| 628 |
+
inputs=[
|
| 629 |
+
image,
|
| 630 |
+
max_side,
|
| 631 |
+
gaussians,
|
| 632 |
+
steps,
|
| 633 |
+
lr,
|
| 634 |
+
scale,
|
| 635 |
+
loss,
|
| 636 |
+
render_height,
|
| 637 |
+
seed,
|
| 638 |
+
mask_border_padding,
|
| 639 |
+
mask_edge_clamp,
|
| 640 |
+
ply_opacity_scale,
|
| 641 |
+
ply_min_opacity,
|
| 642 |
+
ply_max_opacity,
|
| 643 |
+
ply_scale_multiplier,
|
| 644 |
+
ply_thickness,
|
| 645 |
+
ply_y_axis,
|
| 646 |
+
],
|
| 647 |
+
outputs=[reconstruction, metrics, splat, ply, ply_preview, splat_state, ply_state, mask_state],
|
| 648 |
+
show_progress_on=[ply_preview],
|
| 649 |
+
)
|
| 650 |
+
|
| 651 |
+
ply_update_inputs = [
|
| 652 |
+
splat_state,
|
| 653 |
+
ply_state,
|
| 654 |
+
mask_state,
|
| 655 |
+
mask_edge_clamp,
|
| 656 |
+
ply_opacity_scale,
|
| 657 |
+
ply_min_opacity,
|
| 658 |
+
ply_max_opacity,
|
| 659 |
+
ply_scale_multiplier,
|
| 660 |
+
ply_thickness,
|
| 661 |
+
ply_y_axis,
|
| 662 |
+
]
|
| 663 |
+
ply_update_outputs = [ply, ply_preview, ply_state]
|
| 664 |
+
|
| 665 |
+
update_ply.click(
|
| 666 |
+
fn=update_ply_preview,
|
| 667 |
+
inputs=ply_update_inputs,
|
| 668 |
+
outputs=ply_update_outputs,
|
| 669 |
+
show_progress="minimal",
|
| 670 |
+
show_progress_on=[ply_preview],
|
| 671 |
+
trigger_mode="always_last",
|
| 672 |
+
concurrency_limit=1,
|
| 673 |
+
concurrency_id="ply_update",
|
| 674 |
+
)
|
| 675 |
+
for control in [mask_edge_clamp, ply_opacity_scale, ply_min_opacity, ply_max_opacity, ply_scale_multiplier, ply_thickness]:
|
| 676 |
+
control.input(
|
| 677 |
+
fn=update_ply_preview,
|
| 678 |
+
inputs=ply_update_inputs,
|
| 679 |
+
outputs=ply_update_outputs,
|
| 680 |
+
show_progress="hidden",
|
| 681 |
+
trigger_mode="always_last",
|
| 682 |
+
concurrency_limit=1,
|
| 683 |
+
concurrency_id="ply_update",
|
| 684 |
+
)
|
| 685 |
+
for control in [ply_y_axis]:
|
| 686 |
+
control.change(
|
| 687 |
+
fn=update_ply_preview,
|
| 688 |
+
inputs=ply_update_inputs,
|
| 689 |
+
outputs=ply_update_outputs,
|
| 690 |
+
show_progress="hidden",
|
| 691 |
+
trigger_mode="always_last",
|
| 692 |
+
concurrency_limit=1,
|
| 693 |
+
concurrency_id="ply_update",
|
| 694 |
+
)
|
| 695 |
+
|
| 696 |
+
if __name__ == "__main__":
|
| 697 |
+
demo.queue(default_concurrency_limit=1, max_size=8).launch(
|
| 698 |
+
server_name="0.0.0.0",
|
| 699 |
+
server_port=int(os.environ.get("PORT", "7860")),
|
| 700 |
+
css=APP_CSS,
|
| 701 |
+
)
|
cfgs/default.yaml
ADDED
|
@@ -0,0 +1,68 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
seed: 123
|
| 2 |
+
device: "cuda:0"
|
| 3 |
+
# Evaluation
|
| 4 |
+
eval: False # Render the optimized representation
|
| 5 |
+
render_height: 2048 # Image height for rendering (aspect ratio is maintained)
|
| 6 |
+
# Bit precision
|
| 7 |
+
quantize: False # Enable bit precision control of Gaussian parameters
|
| 8 |
+
pos_bits: 16 # Bit precision of individual coordinate dimension
|
| 9 |
+
scale_bits: 16 # Bit precision of individual scale dimension
|
| 10 |
+
rot_bits: 16 # Bit precision of Gaussian orientation angle
|
| 11 |
+
feat_bits: 16 # Bit precision of individual feature dimension
|
| 12 |
+
gate_bits: 16 # Bit precision of per-Gaussian positive activity gate
|
| 13 |
+
# Logging
|
| 14 |
+
log_root: "results"
|
| 15 |
+
exp_name: "default" # Path to the logging directory
|
| 16 |
+
log_level: "INFO"
|
| 17 |
+
save_image_format: "jpg"
|
| 18 |
+
save_plot_format: "jpg"
|
| 19 |
+
vis_gaussians: False # Visualize Gaussians during optimization
|
| 20 |
+
save_image_steps: 100000 # Frequency of rendering intermediate results during optimization
|
| 21 |
+
save_ckpt_steps: 100000 # Frequency of checkpointing during optimization
|
| 22 |
+
eval_steps: 100
|
| 23 |
+
# Target images
|
| 24 |
+
gamma: 1.0 # Optimize in a gamma-corrected space, modify with caution
|
| 25 |
+
data_root: "media"
|
| 26 |
+
input_path: "images/kodim01.png" # Path to an image file or a directory containing a texture stack
|
| 27 |
+
downsample: False # Load a downsampled version of the input image or texture stack as the optimization target to evaluate image upsampling performance
|
| 28 |
+
downsample_ratio: 2.0
|
| 29 |
+
# Mask-aware training (optional): fit Gaussians only inside a binary mask
|
| 30 |
+
mask_path: "" # Path to a binary mask image; empty = unmasked
|
| 31 |
+
mask_outside_weight: 0.25 # lambda_out: per-pixel weight on render error outside the mask (lower = softer edge, higher = sharper)
|
| 32 |
+
mask_hard_prune: True # After training, drop any Gaussian whose center lands outside the mask
|
| 33 |
+
mask_crop: True # Crop training to the mask bounding box (+margin) for efficiency; positions map back to original coords on export
|
| 34 |
+
mask_crop_margin: 0.06 # Margin around the mask bbox as a fraction of its size (keeps a hairline of background on interior sides for a sharp edge)
|
| 35 |
+
mask_border_padding: True # Add virtual outside-mask padding when the mask touches the image border, so border splats are penalized for bleeding past the frame
|
| 36 |
+
mask_keep_band: 0 # Allow Gaussian centers within this many px of the mask boundary (0 = strict no-centers-outside). >0 keeps the edge-carrying Gaussians (recovers PSNR-in) while the loss still uses the original mask for a sharp edge.
|
| 37 |
+
# Gaussians
|
| 38 |
+
num_gaussians: 0 # Number of Gaussians. 0 = auto count calibrated for ~40 dB final PSNR
|
| 39 |
+
init_scale: 1.5 # Initial Gaussian scale in number of pixels
|
| 40 |
+
rasterizer: "simple_sum" # Fixed in this branch
|
| 41 |
+
disable_inverse_scale: False # Disable inverse Gaussian scale optimization
|
| 42 |
+
ckpt_file: ""
|
| 43 |
+
disable_color_init: False
|
| 44 |
+
init_mode: "gradient" # Legacy model-side init mode; train/export/viz paths override this with adaptive partition init
|
| 45 |
+
init_random_ratio: 0.3 # Ratio of Gaussians with randomly initialized position
|
| 46 |
+
smap_filter_size: 20 # Gaussian filter size for smoothing saliency maps
|
| 47 |
+
# Loss functions
|
| 48 |
+
l1_loss_ratio: 0.0
|
| 49 |
+
l2_loss_ratio: 1.0
|
| 50 |
+
ssim_loss_ratio: 0.0
|
| 51 |
+
# Optimization
|
| 52 |
+
disable_tiles: False # Disable tile-based rendering (warning: optimization and rendering without tiles will be way slower)
|
| 53 |
+
max_steps: 2800 # Maximum number of optimization steps
|
| 54 |
+
pos_lr: 5.0e-4
|
| 55 |
+
scale_lr: 2.0e-3
|
| 56 |
+
rot_lr: 2.0e-3
|
| 57 |
+
feat_lr: 5.0e-3
|
| 58 |
+
gate_lr: 5.0e-3
|
| 59 |
+
disable_lr_schedule: False # Disable learning rate schedule and early stopping
|
| 60 |
+
decay_ratio: 10.0
|
| 61 |
+
check_decay_steps: 1000
|
| 62 |
+
max_decay_times: 1
|
| 63 |
+
decay_threshold: 1.0e-3
|
| 64 |
+
disable_prog_optim: True # Disable error-guided progressive optimization (start with all Gaussians)
|
| 65 |
+
initial_ratio: 0.5
|
| 66 |
+
add_steps: 500
|
| 67 |
+
add_times: 4
|
| 68 |
+
post_min_steps: 3000
|
requirements.txt
ADDED
|
@@ -0,0 +1,20 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
# FlashImgs ZeroGPU Space dependencies.
|
| 2 |
+
#
|
| 3 |
+
# torch/torchvision are pinned to the cu128 (CUDA 12.8) builds the vendored
|
| 4 |
+
# CUDA-extension wheels were compiled against. The wheels in ./wheels are built
|
| 5 |
+
# for CPython 3.12 and Blackwell sm_120 (see README / NOTICE), so the Space must
|
| 6 |
+
# run on python_version 3.12 (set in README front matter).
|
| 7 |
+
#
|
| 8 |
+
# gradio is installed by the Space runtime from the README `sdk_version`; do not
|
| 9 |
+
# pin it here.
|
| 10 |
+
|
| 11 |
+
--extra-index-url https://download.pytorch.org/whl/cu128
|
| 12 |
+
|
| 13 |
+
torch==2.11.0+cu128
|
| 14 |
+
torchvision==0.26.0+cu128
|
| 15 |
+
|
| 16 |
+
spaces
|
| 17 |
+
|
| 18 |
+
./wheels/flashimgs-0.1.0-py3-none-any.whl
|
| 19 |
+
./wheels/fussim-0.3.14-cp312-cp312-linux_x86_64.whl
|
| 20 |
+
./wheels/simple_sum_backend-0.1.0-cp312-cp312-linux_x86_64.whl
|
wheels/flashimgs-0.1.0-py3-none-any.whl
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:4bb56af72d0d4eccae186933802be17c4af66a566d5c6bca96a561a6c9be425b
|
| 3 |
+
size 115508
|
wheels/fussim-0.3.14-cp312-cp312-linux_x86_64.whl
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:d2aa863d0aa2e8d9bb43c1a0920730580f0cbd28f0a3cb539062a8330442661d
|
| 3 |
+
size 3213051
|
wheels/simple_sum_backend-0.1.0-cp312-cp312-linux_x86_64.whl
ADDED
|
@@ -0,0 +1,3 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
version https://git-lfs.github.com/spec/v1
|
| 2 |
+
oid sha256:30b7024ed2871b8ad25350851e10de11428e7b0d40191fcbcd2a12b1878faf3c
|
| 3 |
+
size 688885
|