Initial commit, WiP
This commit is contained in:
commit
7c3644c75c
1
.gitignore
vendored
Normal file
1
.gitignore
vendored
Normal file
|
@ -0,0 +1 @@
|
|||
/.idea
|
26
Hibiki.go
Normal file
26
Hibiki.go
Normal file
|
@ -0,0 +1,26 @@
|
|||
package Hibiki
|
||||
|
||||
const PANAKO_AUDIO_BLOCK_SIZE = 1
|
||||
|
||||
const PANAKO_FREQ_MAX_FILTER_SIZE = 103
|
||||
const PANAKO_TIME_MAX_FILTER_SIZE = 25
|
||||
|
||||
const PANAKO_FP_MIN_FREQ_DIST = 1
|
||||
const PANAKO_FP_MAX_FREQ_DIST = 128
|
||||
const PANAKO_FP_MIN_TIME_DIST = 2
|
||||
const PANAKO_FP_MAX_TIME_DIST = 33
|
||||
|
||||
const PANAKO_SAMPLE_RATE = 16000
|
||||
|
||||
const PANAKO_TRANSF_MIN_FREQ = 110
|
||||
const PANAKO_TRANSF_MAX_FREQ = 7040
|
||||
const PANAKO_TRANSF_REF_FREQ = 440
|
||||
const PANAKO_TRANSF_BANDS_PER_OCTAVE = 85
|
||||
const PANAKO_TRANSF_TIME_RESOLUTION = 128
|
||||
|
||||
func Abs(x int32) int32 {
|
||||
if x < 0 {
|
||||
return -x
|
||||
}
|
||||
return x
|
||||
}
|
671
LICENSE
Normal file
671
LICENSE
Normal file
|
@ -0,0 +1,671 @@
|
|||
Hibiki is Copyright (C) 2022 WeebDataHoarder.
|
||||
Panako is Copyright (C) 2014 - 2021 - Joren Six / IPEM
|
||||
|
||||
License to distribute and modify the code is hereby granted under the
|
||||
terms of the GNU Affero General Public License, version 3 (henceforth,
|
||||
the AGPLv3), but not under other versions of the AGPL. See below for
|
||||
the full text of the AGPLv3.
|
||||
|
||||
---
|
||||
|
||||
GNU AFFERO GENERAL PUBLIC LICENSE
|
||||
Version 3, 19 November 2007
|
||||
|
||||
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
|
||||
Everyone is permitted to copy and distribute verbatim copies
|
||||
of this license document, but changing it is not allowed.
|
||||
|
||||
Preamble
|
||||
|
||||
The GNU Affero General Public License is a free, copyleft license for
|
||||
software and other kinds of works, specifically designed to ensure
|
||||
cooperation with the community in the case of network server software.
|
||||
|
||||
The licenses for most software and other practical works are designed
|
||||
to take away your freedom to share and change the works. By contrast,
|
||||
our General Public Licenses are intended to guarantee your freedom to
|
||||
share and change all versions of a program--to make sure it remains free
|
||||
software for all its users.
|
||||
|
||||
When we speak of free software, we are referring to freedom, not
|
||||
price. Our General Public Licenses are designed to make sure that you
|
||||
have the freedom to distribute copies of free software (and charge for
|
||||
them if you wish), that you receive source code or can get it if you
|
||||
want it, that you can change the software or use pieces of it in new
|
||||
free programs, and that you know you can do these things.
|
||||
|
||||
Developers that use our General Public Licenses protect your rights
|
||||
with two steps: (1) assert copyright on the software, and (2) offer
|
||||
you this License which gives you legal permission to copy, distribute
|
||||
and/or modify the software.
|
||||
|
||||
A secondary benefit of defending all users' freedom is that
|
||||
improvements made in alternate versions of the program, if they
|
||||
receive widespread use, become available for other developers to
|
||||
incorporate. Many developers of free software are heartened and
|
||||
encouraged by the resulting cooperation. However, in the case of
|
||||
software used on network servers, this result may fail to come about.
|
||||
The GNU General Public License permits making a modified version and
|
||||
letting the public access it on a server without ever releasing its
|
||||
source code to the public.
|
||||
|
||||
The GNU Affero General Public License is designed specifically to
|
||||
ensure that, in such cases, the modified source code becomes available
|
||||
to the community. It requires the operator of a network server to
|
||||
provide the source code of the modified version running there to the
|
||||
users of that server. Therefore, public use of a modified version, on
|
||||
a publicly accessible server, gives the public access to the source
|
||||
code of the modified version.
|
||||
|
||||
An older license, called the Affero General Public License and
|
||||
published by Affero, was designed to accomplish similar goals. This is
|
||||
a different license, not a version of the Affero GPL, but Affero has
|
||||
released a new version of the Affero GPL which permits relicensing under
|
||||
this license.
|
||||
|
||||
The precise terms and conditions for copying, distribution and
|
||||
modification follow.
|
||||
|
||||
TERMS AND CONDITIONS
|
||||
|
||||
0. Definitions.
|
||||
|
||||
"This License" refers to version 3 of the GNU Affero General Public License.
|
||||
|
||||
"Copyright" also means copyright-like laws that apply to other kinds of
|
||||
works, such as semiconductor masks.
|
||||
|
||||
"The Program" refers to any copyrightable work licensed under this
|
||||
License. Each licensee is addressed as "you". "Licensees" and
|
||||
"recipients" may be individuals or organizations.
|
||||
|
||||
To "modify" a work means to copy from or adapt all or part of the work
|
||||
in a fashion requiring copyright permission, other than the making of an
|
||||
exact copy. The resulting work is called a "modified version" of the
|
||||
earlier work or a work "based on" the earlier work.
|
||||
|
||||
A "covered work" means either the unmodified Program or a work based
|
||||
on the Program.
|
||||
|
||||
To "propagate" a work means to do anything with it that, without
|
||||
permission, would make you directly or secondarily liable for
|
||||
infringement under applicable copyright law, except executing it on a
|
||||
computer or modifying a private copy. Propagation includes copying,
|
||||
distribution (with or without modification), making available to the
|
||||
public, and in some countries other activities as well.
|
||||
|
||||
To "convey" a work means any kind of propagation that enables other
|
||||
parties to make or receive copies. Mere interaction with a user through
|
||||
a computer network, with no transfer of a copy, is not conveying.
|
||||
|
||||
An interactive user interface displays "Appropriate Legal Notices"
|
||||
to the extent that it includes a convenient and prominently visible
|
||||
feature that (1) displays an appropriate copyright notice, and (2)
|
||||
tells the user that there is no warranty for the work (except to the
|
||||
extent that warranties are provided), that licensees may convey the
|
||||
work under this License, and how to view a copy of this License. If
|
||||
the interface presents a list of user commands or options, such as a
|
||||
menu, a prominent item in the list meets this criterion.
|
||||
|
||||
1. Source Code.
|
||||
|
||||
The "source code" for a work means the preferred form of the work
|
||||
for making modifications to it. "Object code" means any non-source
|
||||
form of a work.
|
||||
|
||||
A "Standard Interface" means an interface that either is an official
|
||||
standard defined by a recognized standards body, or, in the case of
|
||||
interfaces specified for a particular programming language, one that
|
||||
is widely used among developers working in that language.
|
||||
|
||||
The "System Libraries" of an executable work include anything, other
|
||||
than the work as a whole, that (a) is included in the normal form of
|
||||
packaging a Major Component, but which is not part of that Major
|
||||
Component, and (b) serves only to enable use of the work with that
|
||||
Major Component, or to implement a Standard Interface for which an
|
||||
implementation is available to the public in source code form. A
|
||||
"Major Component", in this context, means a major essential component
|
||||
(kernel, window system, and so on) of the specific operating system
|
||||
(if any) on which the executable work runs, or a compiler used to
|
||||
produce the work, or an object code interpreter used to run it.
|
||||
|
||||
The "Corresponding Source" for a work in object code form means all
|
||||
the source code needed to generate, install, and (for an executable
|
||||
work) run the object code and to modify the work, including scripts to
|
||||
control those activities. However, it does not include the work's
|
||||
System Libraries, or general-purpose tools or generally available free
|
||||
programs which are used unmodified in performing those activities but
|
||||
which are not part of the work. For example, Corresponding Source
|
||||
includes interface definition files associated with source files for
|
||||
the work, and the source code for shared libraries and dynamically
|
||||
linked subprograms that the work is specifically designed to require,
|
||||
such as by intimate data communication or control flow between those
|
||||
subprograms and other parts of the work.
|
||||
|
||||
The Corresponding Source need not include anything that users
|
||||
can regenerate automatically from other parts of the Corresponding
|
||||
Source.
|
||||
|
||||
The Corresponding Source for a work in source code form is that
|
||||
same work.
|
||||
|
||||
2. Basic Permissions.
|
||||
|
||||
All rights granted under this License are granted for the term of
|
||||
copyright on the Program, and are irrevocable provided the stated
|
||||
conditions are met. This License explicitly affirms your unlimited
|
||||
permission to run the unmodified Program. The output from running a
|
||||
covered work is covered by this License only if the output, given its
|
||||
content, constitutes a covered work. This License acknowledges your
|
||||
rights of fair use or other equivalent, as provided by copyright law.
|
||||
|
||||
You may make, run and propagate covered works that you do not
|
||||
convey, without conditions so long as your license otherwise remains
|
||||
in force. You may convey covered works to others for the sole purpose
|
||||
of having them make modifications exclusively for you, or provide you
|
||||
with facilities for running those works, provided that you comply with
|
||||
the terms of this License in conveying all material for which you do
|
||||
not control copyright. Those thus making or running the covered works
|
||||
for you must do so exclusively on your behalf, under your direction
|
||||
and control, on terms that prohibit them from making any copies of
|
||||
your copyrighted material outside their relationship with you.
|
||||
|
||||
Conveying under any other circumstances is permitted solely under
|
||||
the conditions stated below. Sublicensing is not allowed; section 10
|
||||
makes it unnecessary.
|
||||
|
||||
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
||||
|
||||
No covered work shall be deemed part of an effective technological
|
||||
measure under any applicable law fulfilling obligations under article
|
||||
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
||||
similar laws prohibiting or restricting circumvention of such
|
||||
measures.
|
||||
|
||||
When you convey a covered work, you waive any legal power to forbid
|
||||
circumvention of technological measures to the extent such circumvention
|
||||
is effected by exercising rights under this License with respect to
|
||||
the covered work, and you disclaim any intention to limit operation or
|
||||
modification of the work as a means of enforcing, against the work's
|
||||
users, your or third parties' legal rights to forbid circumvention of
|
||||
technological measures.
|
||||
|
||||
4. Conveying Verbatim Copies.
|
||||
|
||||
You may convey verbatim copies of the Program's source code as you
|
||||
receive it, in any medium, provided that you conspicuously and
|
||||
appropriately publish on each copy an appropriate copyright notice;
|
||||
keep intact all notices stating that this License and any
|
||||
non-permissive terms added in accord with section 7 apply to the code;
|
||||
keep intact all notices of the absence of any warranty; and give all
|
||||
recipients a copy of this License along with the Program.
|
||||
|
||||
You may charge any price or no price for each copy that you convey,
|
||||
and you may offer support or warranty protection for a fee.
|
||||
|
||||
5. Conveying Modified Source Versions.
|
||||
|
||||
You may convey a work based on the Program, or the modifications to
|
||||
produce it from the Program, in the form of source code under the
|
||||
terms of section 4, provided that you also meet all of these conditions:
|
||||
|
||||
a) The work must carry prominent notices stating that you modified
|
||||
it, and giving a relevant date.
|
||||
|
||||
b) The work must carry prominent notices stating that it is
|
||||
released under this License and any conditions added under section
|
||||
7. This requirement modifies the requirement in section 4 to
|
||||
"keep intact all notices".
|
||||
|
||||
c) You must license the entire work, as a whole, under this
|
||||
License to anyone who comes into possession of a copy. This
|
||||
License will therefore apply, along with any applicable section 7
|
||||
additional terms, to the whole of the work, and all its parts,
|
||||
regardless of how they are packaged. This License gives no
|
||||
permission to license the work in any other way, but it does not
|
||||
invalidate such permission if you have separately received it.
|
||||
|
||||
d) If the work has interactive user interfaces, each must display
|
||||
Appropriate Legal Notices; however, if the Program has interactive
|
||||
interfaces that do not display Appropriate Legal Notices, your
|
||||
work need not make them do so.
|
||||
|
||||
A compilation of a covered work with other separate and independent
|
||||
works, which are not by their nature extensions of the covered work,
|
||||
and which are not combined with it such as to form a larger program,
|
||||
in or on a volume of a storage or distribution medium, is called an
|
||||
"aggregate" if the compilation and its resulting copyright are not
|
||||
used to limit the access or legal rights of the compilation's users
|
||||
beyond what the individual works permit. Inclusion of a covered work
|
||||
in an aggregate does not cause this License to apply to the other
|
||||
parts of the aggregate.
|
||||
|
||||
6. Conveying Non-Source Forms.
|
||||
|
||||
You may convey a covered work in object code form under the terms
|
||||
of sections 4 and 5, provided that you also convey the
|
||||
machine-readable Corresponding Source under the terms of this License,
|
||||
in one of these ways:
|
||||
|
||||
a) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by the
|
||||
Corresponding Source fixed on a durable physical medium
|
||||
customarily used for software interchange.
|
||||
|
||||
b) Convey the object code in, or embodied in, a physical product
|
||||
(including a physical distribution medium), accompanied by a
|
||||
written offer, valid for at least three years and valid for as
|
||||
long as you offer spare parts or customer support for that product
|
||||
model, to give anyone who possesses the object code either (1) a
|
||||
copy of the Corresponding Source for all the software in the
|
||||
product that is covered by this License, on a durable physical
|
||||
medium customarily used for software interchange, for a price no
|
||||
more than your reasonable cost of physically performing this
|
||||
conveying of source, or (2) access to copy the
|
||||
Corresponding Source from a network server at no charge.
|
||||
|
||||
c) Convey individual copies of the object code with a copy of the
|
||||
written offer to provide the Corresponding Source. This
|
||||
alternative is allowed only occasionally and noncommercially, and
|
||||
only if you received the object code with such an offer, in accord
|
||||
with subsection 6b.
|
||||
|
||||
d) Convey the object code by offering access from a designated
|
||||
place (gratis or for a charge), and offer equivalent access to the
|
||||
Corresponding Source in the same way through the same place at no
|
||||
further charge. You need not require recipients to copy the
|
||||
Corresponding Source along with the object code. If the place to
|
||||
copy the object code is a network server, the Corresponding Source
|
||||
may be on a different server (operated by you or a third party)
|
||||
that supports equivalent copying facilities, provided you maintain
|
||||
clear directions next to the object code saying where to find the
|
||||
Corresponding Source. Regardless of what server hosts the
|
||||
Corresponding Source, you remain obligated to ensure that it is
|
||||
available for as long as needed to satisfy these requirements.
|
||||
|
||||
e) Convey the object code using peer-to-peer transmission, provided
|
||||
you inform other peers where the object code and Corresponding
|
||||
Source of the work are being offered to the general public at no
|
||||
charge under subsection 6d.
|
||||
|
||||
A separable portion of the object code, whose source code is excluded
|
||||
from the Corresponding Source as a System Library, need not be
|
||||
included in conveying the object code work.
|
||||
|
||||
A "User Product" is either (1) a "consumer product", which means any
|
||||
tangible personal property which is normally used for personal, family,
|
||||
or household purposes, or (2) anything designed or sold for incorporation
|
||||
into a dwelling. In determining whether a product is a consumer product,
|
||||
doubtful cases shall be resolved in favor of coverage. For a particular
|
||||
product received by a particular user, "normally used" refers to a
|
||||
typical or common use of that class of product, regardless of the status
|
||||
of the particular user or of the way in which the particular user
|
||||
actually uses, or expects or is expected to use, the product. A product
|
||||
is a consumer product regardless of whether the product has substantial
|
||||
commercial, industrial or non-consumer uses, unless such uses represent
|
||||
the only significant mode of use of the product.
|
||||
|
||||
"Installation Information" for a User Product means any methods,
|
||||
procedures, authorization keys, or other information required to install
|
||||
and execute modified versions of a covered work in that User Product from
|
||||
a modified version of its Corresponding Source. The information must
|
||||
suffice to ensure that the continued functioning of the modified object
|
||||
code is in no case prevented or interfered with solely because
|
||||
modification has been made.
|
||||
|
||||
If you convey an object code work under this section in, or with, or
|
||||
specifically for use in, a User Product, and the conveying occurs as
|
||||
part of a transaction in which the right of possession and use of the
|
||||
User Product is transferred to the recipient in perpetuity or for a
|
||||
fixed term (regardless of how the transaction is characterized), the
|
||||
Corresponding Source conveyed under this section must be accompanied
|
||||
by the Installation Information. But this requirement does not apply
|
||||
if neither you nor any third party retains the ability to install
|
||||
modified object code on the User Product (for example, the work has
|
||||
been installed in ROM).
|
||||
|
||||
The requirement to provide Installation Information does not include a
|
||||
requirement to continue to provide support service, warranty, or updates
|
||||
for a work that has been modified or installed by the recipient, or for
|
||||
the User Product in which it has been modified or installed. Access to a
|
||||
network may be denied when the modification itself materially and
|
||||
adversely affects the operation of the network or violates the rules and
|
||||
protocols for communication across the network.
|
||||
|
||||
Corresponding Source conveyed, and Installation Information provided,
|
||||
in accord with this section must be in a format that is publicly
|
||||
documented (and with an implementation available to the public in
|
||||
source code form), and must require no special password or key for
|
||||
unpacking, reading or copying.
|
||||
|
||||
7. Additional Terms.
|
||||
|
||||
"Additional permissions" are terms that supplement the terms of this
|
||||
License by making exceptions from one or more of its conditions.
|
||||
Additional permissions that are applicable to the entire Program shall
|
||||
be treated as though they were included in this License, to the extent
|
||||
that they are valid under applicable law. If additional permissions
|
||||
apply only to part of the Program, that part may be used separately
|
||||
under those permissions, but the entire Program remains governed by
|
||||
this License without regard to the additional permissions.
|
||||
|
||||
When you convey a copy of a covered work, you may at your option
|
||||
remove any additional permissions from that copy, or from any part of
|
||||
it. (Additional permissions may be written to require their own
|
||||
removal in certain cases when you modify the work.) You may place
|
||||
additional permissions on material, added by you to a covered work,
|
||||
for which you have or can give appropriate copyright permission.
|
||||
|
||||
Notwithstanding any other provision of this License, for material you
|
||||
add to a covered work, you may (if authorized by the copyright holders of
|
||||
that material) supplement the terms of this License with terms:
|
||||
|
||||
a) Disclaiming warranty or limiting liability differently from the
|
||||
terms of sections 15 and 16 of this License; or
|
||||
|
||||
b) Requiring preservation of specified reasonable legal notices or
|
||||
author attributions in that material or in the Appropriate Legal
|
||||
Notices displayed by works containing it; or
|
||||
|
||||
c) Prohibiting misrepresentation of the origin of that material, or
|
||||
requiring that modified versions of such material be marked in
|
||||
reasonable ways as different from the original version; or
|
||||
|
||||
d) Limiting the use for publicity purposes of names of licensors or
|
||||
authors of the material; or
|
||||
|
||||
e) Declining to grant rights under trademark law for use of some
|
||||
trade names, trademarks, or service marks; or
|
||||
|
||||
f) Requiring indemnification of licensors and authors of that
|
||||
material by anyone who conveys the material (or modified versions of
|
||||
it) with contractual assumptions of liability to the recipient, for
|
||||
any liability that these contractual assumptions directly impose on
|
||||
those licensors and authors.
|
||||
|
||||
All other non-permissive additional terms are considered "further
|
||||
restrictions" within the meaning of section 10. If the Program as you
|
||||
received it, or any part of it, contains a notice stating that it is
|
||||
governed by this License along with a term that is a further
|
||||
restriction, you may remove that term. If a license document contains
|
||||
a further restriction but permits relicensing or conveying under this
|
||||
License, you may add to a covered work material governed by the terms
|
||||
of that license document, provided that the further restriction does
|
||||
not survive such relicensing or conveying.
|
||||
|
||||
If you add terms to a covered work in accord with this section, you
|
||||
must place, in the relevant source files, a statement of the
|
||||
additional terms that apply to those files, or a notice indicating
|
||||
where to find the applicable terms.
|
||||
|
||||
Additional terms, permissive or non-permissive, may be stated in the
|
||||
form of a separately written license, or stated as exceptions;
|
||||
the above requirements apply either way.
|
||||
|
||||
8. Termination.
|
||||
|
||||
You may not propagate or modify a covered work except as expressly
|
||||
provided under this License. Any attempt otherwise to propagate or
|
||||
modify it is void, and will automatically terminate your rights under
|
||||
this License (including any patent licenses granted under the third
|
||||
paragraph of section 11).
|
||||
|
||||
However, if you cease all violation of this License, then your
|
||||
license from a particular copyright holder is reinstated (a)
|
||||
provisionally, unless and until the copyright holder explicitly and
|
||||
finally terminates your license, and (b) permanently, if the copyright
|
||||
holder fails to notify you of the violation by some reasonable means
|
||||
prior to 60 days after the cessation.
|
||||
|
||||
Moreover, your license from a particular copyright holder is
|
||||
reinstated permanently if the copyright holder notifies you of the
|
||||
violation by some reasonable means, this is the first time you have
|
||||
received notice of violation of this License (for any work) from that
|
||||
copyright holder, and you cure the violation prior to 30 days after
|
||||
your receipt of the notice.
|
||||
|
||||
Termination of your rights under this section does not terminate the
|
||||
licenses of parties who have received copies or rights from you under
|
||||
this License. If your rights have been terminated and not permanently
|
||||
reinstated, you do not qualify to receive new licenses for the same
|
||||
material under section 10.
|
||||
|
||||
9. Acceptance Not Required for Having Copies.
|
||||
|
||||
You are not required to accept this License in order to receive or
|
||||
run a copy of the Program. Ancillary propagation of a covered work
|
||||
occurring solely as a consequence of using peer-to-peer transmission
|
||||
to receive a copy likewise does not require acceptance. However,
|
||||
nothing other than this License grants you permission to propagate or
|
||||
modify any covered work. These actions infringe copyright if you do
|
||||
not accept this License. Therefore, by modifying or propagating a
|
||||
covered work, you indicate your acceptance of this License to do so.
|
||||
|
||||
10. Automatic Licensing of Downstream Recipients.
|
||||
|
||||
Each time you convey a covered work, the recipient automatically
|
||||
receives a license from the original licensors, to run, modify and
|
||||
propagate that work, subject to this License. You are not responsible
|
||||
for enforcing compliance by third parties with this License.
|
||||
|
||||
An "entity transaction" is a transaction transferring control of an
|
||||
organization, or substantially all assets of one, or subdividing an
|
||||
organization, or merging organizations. If propagation of a covered
|
||||
work results from an entity transaction, each party to that
|
||||
transaction who receives a copy of the work also receives whatever
|
||||
licenses to the work the party's predecessor in interest had or could
|
||||
give under the previous paragraph, plus a right to possession of the
|
||||
Corresponding Source of the work from the predecessor in interest, if
|
||||
the predecessor has it or can get it with reasonable efforts.
|
||||
|
||||
You may not impose any further restrictions on the exercise of the
|
||||
rights granted or affirmed under this License. For example, you may
|
||||
not impose a license fee, royalty, or other charge for exercise of
|
||||
rights granted under this License, and you may not initiate litigation
|
||||
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
||||
any patent claim is infringed by making, using, selling, offering for
|
||||
sale, or importing the Program or any portion of it.
|
||||
|
||||
11. Patents.
|
||||
|
||||
A "contributor" is a copyright holder who authorizes use under this
|
||||
License of the Program or a work on which the Program is based. The
|
||||
work thus licensed is called the contributor's "contributor version".
|
||||
|
||||
A contributor's "essential patent claims" are all patent claims
|
||||
owned or controlled by the contributor, whether already acquired or
|
||||
hereafter acquired, that would be infringed by some manner, permitted
|
||||
by this License, of making, using, or selling its contributor version,
|
||||
but do not include claims that would be infringed only as a
|
||||
consequence of further modification of the contributor version. For
|
||||
purposes of this definition, "control" includes the right to grant
|
||||
patent sublicenses in a manner consistent with the requirements of
|
||||
this License.
|
||||
|
||||
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
||||
patent license under the contributor's essential patent claims, to
|
||||
make, use, sell, offer for sale, import and otherwise run, modify and
|
||||
propagate the contents of its contributor version.
|
||||
|
||||
In the following three paragraphs, a "patent license" is any express
|
||||
agreement or commitment, however denominated, not to enforce a patent
|
||||
(such as an express permission to practice a patent or covenant not to
|
||||
sue for patent infringement). To "grant" such a patent license to a
|
||||
party means to make such an agreement or commitment not to enforce a
|
||||
patent against the party.
|
||||
|
||||
If you convey a covered work, knowingly relying on a patent license,
|
||||
and the Corresponding Source of the work is not available for anyone
|
||||
to copy, free of charge and under the terms of this License, through a
|
||||
publicly available network server or other readily accessible means,
|
||||
then you must either (1) cause the Corresponding Source to be so
|
||||
available, or (2) arrange to deprive yourself of the benefit of the
|
||||
patent license for this particular work, or (3) arrange, in a manner
|
||||
consistent with the requirements of this License, to extend the patent
|
||||
license to downstream recipients. "Knowingly relying" means you have
|
||||
actual knowledge that, but for the patent license, your conveying the
|
||||
covered work in a country, or your recipient's use of the covered work
|
||||
in a country, would infringe one or more identifiable patents in that
|
||||
country that you have reason to believe are valid.
|
||||
|
||||
If, pursuant to or in connection with a single transaction or
|
||||
arrangement, you convey, or propagate by procuring conveyance of, a
|
||||
covered work, and grant a patent license to some of the parties
|
||||
receiving the covered work authorizing them to use, propagate, modify
|
||||
or convey a specific copy of the covered work, then the patent license
|
||||
you grant is automatically extended to all recipients of the covered
|
||||
work and works based on it.
|
||||
|
||||
A patent license is "discriminatory" if it does not include within
|
||||
the scope of its coverage, prohibits the exercise of, or is
|
||||
conditioned on the non-exercise of one or more of the rights that are
|
||||
specifically granted under this License. You may not convey a covered
|
||||
work if you are a party to an arrangement with a third party that is
|
||||
in the business of distributing software, under which you make payment
|
||||
to the third party based on the extent of your activity of conveying
|
||||
the work, and under which the third party grants, to any of the
|
||||
parties who would receive the covered work from you, a discriminatory
|
||||
patent license (a) in connection with copies of the covered work
|
||||
conveyed by you (or copies made from those copies), or (b) primarily
|
||||
for and in connection with specific products or compilations that
|
||||
contain the covered work, unless you entered into that arrangement,
|
||||
or that patent license was granted, prior to 28 March 2007.
|
||||
|
||||
Nothing in this License shall be construed as excluding or limiting
|
||||
any implied license or other defenses to infringement that may
|
||||
otherwise be available to you under applicable patent law.
|
||||
|
||||
12. No Surrender of Others' Freedom.
|
||||
|
||||
If conditions are imposed on you (whether by court order, agreement or
|
||||
otherwise) that contradict the conditions of this License, they do not
|
||||
excuse you from the conditions of this License. If you cannot convey a
|
||||
covered work so as to satisfy simultaneously your obligations under this
|
||||
License and any other pertinent obligations, then as a consequence you may
|
||||
not convey it at all. For example, if you agree to terms that obligate you
|
||||
to collect a royalty for further conveying from those to whom you convey
|
||||
the Program, the only way you could satisfy both those terms and this
|
||||
License would be to refrain entirely from conveying the Program.
|
||||
|
||||
13. Remote Network Interaction; Use with the GNU General Public License.
|
||||
|
||||
Notwithstanding any other provision of this License, if you modify the
|
||||
Program, your modified version must prominently offer all users
|
||||
interacting with it remotely through a computer network (if your version
|
||||
supports such interaction) an opportunity to receive the Corresponding
|
||||
Source of your version by providing access to the Corresponding Source
|
||||
from a network server at no charge, through some standard or customary
|
||||
means of facilitating copying of software. This Corresponding Source
|
||||
shall include the Corresponding Source for any work covered by version 3
|
||||
of the GNU General Public License that is incorporated pursuant to the
|
||||
following paragraph.
|
||||
|
||||
Notwithstanding any other provision of this License, you have
|
||||
permission to link or combine any covered work with a work licensed
|
||||
under version 3 of the GNU General Public License into a single
|
||||
combined work, and to convey the resulting work. The terms of this
|
||||
License will continue to apply to the part which is the covered work,
|
||||
but the work with which it is combined will remain governed by version
|
||||
3 of the GNU General Public License.
|
||||
|
||||
14. Revised Versions of this License.
|
||||
|
||||
The Free Software Foundation may publish revised and/or new versions of
|
||||
the GNU Affero General Public License from time to time. Such new versions
|
||||
will be similar in spirit to the present version, but may differ in detail to
|
||||
address new problems or concerns.
|
||||
|
||||
Each version is given a distinguishing version number. If the
|
||||
Program specifies that a certain numbered version of the GNU Affero General
|
||||
Public License "or any later version" applies to it, you have the
|
||||
option of following the terms and conditions either of that numbered
|
||||
version or of any later version published by the Free Software
|
||||
Foundation. If the Program does not specify a version number of the
|
||||
GNU Affero General Public License, you may choose any version ever published
|
||||
by the Free Software Foundation.
|
||||
|
||||
If the Program specifies that a proxy can decide which future
|
||||
versions of the GNU Affero General Public License can be used, that proxy's
|
||||
public statement of acceptance of a version permanently authorizes you
|
||||
to choose that version for the Program.
|
||||
|
||||
Later license versions may give you additional or different
|
||||
permissions. However, no additional obligations are imposed on any
|
||||
author or copyright holder as a result of your choosing to follow a
|
||||
later version.
|
||||
|
||||
15. Disclaimer of Warranty.
|
||||
|
||||
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
||||
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
||||
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
||||
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
||||
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
||||
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
||||
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
||||
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
||||
|
||||
16. Limitation of Liability.
|
||||
|
||||
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
||||
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
||||
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
||||
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
||||
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
||||
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
||||
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
||||
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
||||
SUCH DAMAGES.
|
||||
|
||||
17. Interpretation of Sections 15 and 16.
|
||||
|
||||
If the disclaimer of warranty and limitation of liability provided
|
||||
above cannot be given local legal effect according to their terms,
|
||||
reviewing courts shall apply local law that most closely approximates
|
||||
an absolute waiver of all civil liability in connection with the
|
||||
Program, unless a warranty or assumption of liability accompanies a
|
||||
copy of the Program in return for a fee.
|
||||
|
||||
END OF TERMS AND CONDITIONS
|
||||
|
||||
How to Apply These Terms to Your New Programs
|
||||
|
||||
If you develop a new program, and you want it to be of the greatest
|
||||
possible use to the public, the best way to achieve this is to make it
|
||||
free software which everyone can redistribute and change under these terms.
|
||||
|
||||
To do so, attach the following notices to the program. It is safest
|
||||
to attach them to the start of each source file to most effectively
|
||||
state the exclusion of warranty; and each file should have at least
|
||||
the "copyright" line and a pointer to where the full notice is found.
|
||||
|
||||
<one line to give the program's name and a brief idea of what it does.>
|
||||
Copyright (C) <year> <name of author>
|
||||
|
||||
This program is free software: you can redistribute it and/or modify
|
||||
it under the terms of the GNU Affero General Public License as published by
|
||||
the Free Software Foundation, either version 3 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU Affero General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU Affero General Public License
|
||||
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||
|
||||
Also add information on how to contact you by electronic and paper mail.
|
||||
|
||||
If your software can interact with users remotely through a computer
|
||||
network, you should also make sure that it provides a way for users to
|
||||
get its source. For example, if your program is a web application, its
|
||||
interface could display a "Source" link that leads users to an archive
|
||||
of the code. There are many ways you could offer source, and different
|
||||
solutions will be better for different programs; see section 13 for the
|
||||
specific requirements.
|
||||
|
||||
You should also get your employer (if you work as a programmer) or school,
|
||||
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
||||
For more information on this, and how to apply and follow the GNU AGPL, see
|
||||
<https://www.gnu.org/licenses/>.
|
5
README.md
Normal file
5
README.md
Normal file
|
@ -0,0 +1,5 @@
|
|||
# Hibiki
|
||||
|
||||
WiP Implementation of [Panako](https://github.com/JorenSix/Panako) in Go
|
||||
|
||||
Panako is an acoustic fingerprinting system.
|
8
go.mod
Normal file
8
go.mod
Normal file
|
@ -0,0 +1,8 @@
|
|||
module git.gammaspectra.live/S.O.N.G/Hibiki
|
||||
|
||||
go 1.17
|
||||
|
||||
require (
|
||||
git.gammaspectra.live/S.O.N.G/goborator v0.0.0-20220123203229-147da335b6eb
|
||||
github.com/gammazero/deque v0.1.0
|
||||
)
|
4
go.sum
Normal file
4
go.sum
Normal file
|
@ -0,0 +1,4 @@
|
|||
git.gammaspectra.live/S.O.N.G/goborator v0.0.0-20220123203229-147da335b6eb h1:ItDfszsa4SZTvmDYy7Ofzh6TAj3K7OSgR/5iS2oJWHY=
|
||||
git.gammaspectra.live/S.O.N.G/goborator v0.0.0-20220123203229-147da335b6eb/go.mod h1:ySjuueqe5HUqvf7lWS51Cy5UP2tgJWsezOv8UIm2arA=
|
||||
github.com/gammazero/deque v0.1.0 h1:f9LnNmq66VDeuAlSAapemq/U7hJ2jpIWa4c09q8Dlik=
|
||||
github.com/gammazero/deque v0.1.0/go.mod h1:KQw7vFau1hHuM8xmI9RbgKFbAsQFWmBpqQ2KenFLk6M=
|
220
strategy/panako/fingerprint.go
Normal file
220
strategy/panako/fingerprint.go
Normal file
|
@ -0,0 +1,220 @@
|
|||
package panako
|
||||
|
||||
import (
|
||||
"fmt"
|
||||
"git.gammaspectra.live/S.O.N.G/Hibiki"
|
||||
"git.gammaspectra.live/S.O.N.G/Hibiki/utilities/morton2d"
|
||||
"math"
|
||||
)
|
||||
|
||||
type Fingerprint struct {
|
||||
entries [3]*EventPoint
|
||||
|
||||
hash *int64
|
||||
}
|
||||
|
||||
func NewFingerprint(p1, p2, p3 *EventPoint) *Fingerprint {
|
||||
return &Fingerprint{
|
||||
entries: [3]*EventPoint{p1, p2, p3},
|
||||
}
|
||||
}
|
||||
|
||||
func (f *Fingerprint) t1() int32 {
|
||||
return f.entries[0].Time
|
||||
}
|
||||
func (f *Fingerprint) t2() int32 {
|
||||
return f.entries[1].Time
|
||||
}
|
||||
func (f *Fingerprint) t3() int32 {
|
||||
return f.entries[2].Time
|
||||
}
|
||||
|
||||
func (f *Fingerprint) f1() int32 {
|
||||
return f.entries[0].Frequency
|
||||
}
|
||||
func (f *Fingerprint) f2() int32 {
|
||||
return f.entries[1].Frequency
|
||||
}
|
||||
func (f *Fingerprint) f3() int32 {
|
||||
return f.entries[2].Frequency
|
||||
}
|
||||
|
||||
func (f *Fingerprint) m1() float32 {
|
||||
return f.entries[0].Magnitude
|
||||
}
|
||||
func (f *Fingerprint) m2() float32 {
|
||||
return f.entries[1].Magnitude
|
||||
}
|
||||
func (f *Fingerprint) m3() float32 {
|
||||
return f.entries[2].Magnitude
|
||||
}
|
||||
|
||||
func (f *Fingerprint) RobustHash() int32 {
|
||||
f1LargerThanF2 := 0
|
||||
if f.f1() > f.f2() {
|
||||
f1LargerThanF2 = 1
|
||||
}
|
||||
f2LargerThanF3 := 0
|
||||
if f.f2() > f.f3() {
|
||||
f2LargerThanF3 = 1
|
||||
}
|
||||
|
||||
f3LargerThanF1 := 0
|
||||
if f.f3() > f.f1() {
|
||||
f3LargerThanF1 = 1
|
||||
}
|
||||
|
||||
m1LargerThanm2 := 0
|
||||
if f.m1() > f.m2() {
|
||||
m1LargerThanm2 = 1
|
||||
}
|
||||
m2LargerThanm3 := 0
|
||||
if f.m2() > f.m3() {
|
||||
m2LargerThanm3 = 1
|
||||
}
|
||||
|
||||
m3LargerThanm1 := 0
|
||||
if f.m3() > f.m1() {
|
||||
m3LargerThanm1 = 1
|
||||
}
|
||||
|
||||
dt1t2LargerThant3t2 := 0
|
||||
if (f.t2() - f.t1()) > (f.t3() - f.t2()) {
|
||||
dt1t2LargerThant3t2 = 1
|
||||
}
|
||||
|
||||
//9 bits f in range( 0 - 512) to 2 bits
|
||||
f1Range := f.f1() >> 7
|
||||
f2Range := f.f2() >> 7
|
||||
f3Range := f.f3() >> 7
|
||||
|
||||
diffT2T1 := f.t2() - f.t1()
|
||||
diffT3T1 := f.t3() - f.t2()
|
||||
timeRatio := float64(diffT2T1) / float64(diffT3T1)
|
||||
|
||||
var maxTDiff float64 = 31 - 1
|
||||
var minTDiff float64 = 2
|
||||
mappedTRatio := math.Log(timeRatio)
|
||||
minTRatio := math.Log(minTDiff / maxTDiff)
|
||||
maxTRatio := math.Log(maxTDiff / minTDiff)
|
||||
spreadT := maxTRatio - minTRatio
|
||||
timeRatioHash := int32(math.Round((mappedTRatio - minTRatio) / spreadT * (1 << 9)))
|
||||
|
||||
diffF2F1 := f.f2() - f.f1()
|
||||
diffF3F2 := f.f3() - f.f2()
|
||||
freqRatio := float64(diffF2F1) / float64(diffF3F2)
|
||||
|
||||
var maxFDiff float64 = 127 - 1
|
||||
var minFDiff float64 = 1
|
||||
mappedFRatio := math.Log(math.Abs(freqRatio))
|
||||
minFRatio := math.Log(minFDiff / maxFDiff)
|
||||
maxFRatio := math.Log(maxFDiff / minFDiff)
|
||||
spreadF := maxFRatio - minFRatio
|
||||
freqRatioHash := int32(math.Round((mappedFRatio - minFRatio) / spreadF * (1 << 9)))
|
||||
|
||||
interleavedRatios := morton2d.Encode(freqRatioHash, timeRatioHash)
|
||||
|
||||
var hash int32 = 0
|
||||
hash += int32((interleavedRatios & ((1 << 18) - 1)) << 0)
|
||||
hash += int32((f1LargerThanF2 & ((1 << 1) - 1)) << 18)
|
||||
hash += int32((f2LargerThanF3 & ((1 << 1) - 1)) << 19)
|
||||
hash += int32((f3LargerThanF1 & ((1 << 1) - 1)) << 20)
|
||||
hash += int32((m1LargerThanm2 & ((1 << 1) - 1)) << 21)
|
||||
hash += int32((m2LargerThanm3 & ((1 << 1) - 1)) << 22)
|
||||
hash += int32((m3LargerThanm1 & ((1 << 1) - 1)) << 23)
|
||||
hash += int32((f1Range & ((1 << 2) - 1)) << 24)
|
||||
hash += int32((f2Range & ((1 << 2) - 1)) << 26)
|
||||
hash += int32((f3Range & ((1 << 2) - 1)) << 28)
|
||||
hash += int32((dt1t2LargerThant3t2 & ((1 << 1) - 1)) << 29)
|
||||
|
||||
return hash
|
||||
}
|
||||
|
||||
func (f *Fingerprint) Hash() int64 {
|
||||
if f.hash != nil {
|
||||
return *f.hash
|
||||
}
|
||||
|
||||
var f1LargerThanF2 int64 = 0
|
||||
if f.f1() > f.f2() {
|
||||
f1LargerThanF2 = 1
|
||||
}
|
||||
var f2LargerThanF3 int64 = 0
|
||||
if f.f2() > f.f3() {
|
||||
f2LargerThanF3 = 1
|
||||
}
|
||||
|
||||
var f3LargerThanF1 int64 = 0
|
||||
if f.f3() > f.f1() {
|
||||
f3LargerThanF1 = 1
|
||||
}
|
||||
|
||||
var m1LargerThanm2 int64 = 0
|
||||
if f.m1() > f.m2() {
|
||||
m1LargerThanm2 = 1
|
||||
}
|
||||
var m2LargerThanm3 int64 = 0
|
||||
if f.m2() > f.m3() {
|
||||
m2LargerThanm3 = 1
|
||||
}
|
||||
|
||||
var m3LargerThanm1 int64 = 0
|
||||
if f.m3() > f.m1() {
|
||||
m3LargerThanm1 = 1
|
||||
}
|
||||
|
||||
var dt1t2LargerThant3t2 int64 = 0
|
||||
if (f.t2() - f.t1()) > (f.t3() - f.t2()) {
|
||||
dt1t2LargerThant3t2 = 1
|
||||
}
|
||||
|
||||
var df1f2LargerThanf3f2 int64 = 0
|
||||
if Hibiki.Abs(f.f2()-f.f1()) > Hibiki.Abs(f.f3()-f.f2()) {
|
||||
dt1t2LargerThant3t2 = 1
|
||||
}
|
||||
|
||||
//9 bits f in range( 0 - 512) to 8 bits
|
||||
f1Range := int64(f.f1() >> 5)
|
||||
|
||||
//7 bits (0-128) -> 5 bits
|
||||
df2f1 := int64(Hibiki.Abs(f.f2()-f.f1()) >> 2)
|
||||
df3f2 := int64(Hibiki.Abs(f.f3()-f.f2()) >> 2)
|
||||
|
||||
ratioT := int64(float64(f.t2()-f.t1()) / float64(f.t3()-f.t1()) * 64)
|
||||
|
||||
var hash int64 = 0
|
||||
hash += (ratioT & ((1 << 6) - 1)) << 0
|
||||
hash += (f1LargerThanF2 & ((1 << 1) - 1)) << 6
|
||||
hash += (f2LargerThanF3 & ((1 << 1) - 1)) << 7
|
||||
hash += (f3LargerThanF1 & ((1 << 1) - 1)) << 8
|
||||
hash += (m1LargerThanm2 & ((1 << 1) - 1)) << 9
|
||||
hash += (m2LargerThanm3 & ((1 << 1) - 1)) << 10
|
||||
hash += (m3LargerThanm1 & ((1 << 1) - 1)) << 11
|
||||
hash += (dt1t2LargerThant3t2 & ((1 << 1) - 1)) << 12
|
||||
hash += (df1f2LargerThanf3f2 & ((1 << 1) - 1)) << 13
|
||||
hash += (f1Range & ((1 << 8) - 1)) << 14
|
||||
hash += (df2f1 & ((1 << 6) - 1)) << 22
|
||||
hash += (df3f2 & ((1 << 6) - 1)) << 28
|
||||
|
||||
f.hash = &hash
|
||||
return hash
|
||||
}
|
||||
|
||||
func (f *Fingerprint) String() string {
|
||||
return fmt.Sprintf("(%d,%d),(%d,%d),(%d,%d),%d", f.t1(), f.f1(), f.t2(), f.f2(), f.t3(), f.f3(), f.Hash())
|
||||
}
|
||||
|
||||
func (f *Fingerprint) Equals(other *Fingerprint) bool {
|
||||
if other == nil {
|
||||
return false
|
||||
}
|
||||
if other == f {
|
||||
return true
|
||||
}
|
||||
|
||||
sameHash := other.Hash() == f.Hash()
|
||||
//if closer than 100 analysis frames (of e.g. 32ms), than hash is deemed the same).
|
||||
closeInTime := Hibiki.Abs(other.t1()-f.t1()) < 100
|
||||
|
||||
return sameHash && closeInTime
|
||||
}
|
13
strategy/panako/point.go
Normal file
13
strategy/panako/point.go
Normal file
|
@ -0,0 +1,13 @@
|
|||
package panako
|
||||
|
||||
type EventPoint struct {
|
||||
|
||||
// Time The time expressed using an analysis frame index.
|
||||
Time int32
|
||||
|
||||
// Frequency The frequency expressed using the bin number in the constant Q transform.
|
||||
Frequency int32
|
||||
|
||||
// Magnitude The energy value of the element.
|
||||
Magnitude float32
|
||||
}
|
255
strategy/panako/processor.go
Normal file
255
strategy/panako/processor.go
Normal file
|
@ -0,0 +1,255 @@
|
|||
package panako
|
||||
|
||||
import (
|
||||
"git.gammaspectra.live/S.O.N.G/Hibiki"
|
||||
"git.gammaspectra.live/S.O.N.G/Hibiki/utilities"
|
||||
"git.gammaspectra.live/S.O.N.G/goborator"
|
||||
)
|
||||
|
||||
type EventPointProcessor struct {
|
||||
magnitudes [][]float32
|
||||
maxMagnitudes [][]float32
|
||||
magnitudesIndex int
|
||||
|
||||
previousMaxMagnitudes map[int][]float32
|
||||
previousMagnitudes map[int][]float32
|
||||
|
||||
eventPoints []*EventPoint
|
||||
fingerprints []*Fingerprint
|
||||
|
||||
analysisFrameIndex int
|
||||
maxFilterVertical *utilities.LemireMinMaxFilter
|
||||
maxFilterWindowSizeFrequency int
|
||||
maxFilterWindowSizeTime int
|
||||
maxHorizontal []float32
|
||||
gaborator *goborator.Gaborator
|
||||
}
|
||||
|
||||
func NewEventPointProcessor(fftSize int) (*EventPointProcessor, error) {
|
||||
var err error
|
||||
|
||||
ob := &EventPointProcessor{
|
||||
magnitudesIndex: 0,
|
||||
previousMaxMagnitudes: make(map[int][]float32),
|
||||
previousMagnitudes: make(map[int][]float32),
|
||||
analysisFrameIndex: 0,
|
||||
maxFilterWindowSizeFrequency: Hibiki.PANAKO_FREQ_MAX_FILTER_SIZE,
|
||||
maxFilterWindowSizeTime: Hibiki.PANAKO_TIME_MAX_FILTER_SIZE,
|
||||
maxHorizontal: make([]float32, fftSize/2),
|
||||
}
|
||||
|
||||
ob.gaborator = goborator.NewGaborator(
|
||||
Hibiki.PANAKO_AUDIO_BLOCK_SIZE,
|
||||
Hibiki.PANAKO_SAMPLE_RATE,
|
||||
Hibiki.PANAKO_TRANSF_BANDS_PER_OCTAVE,
|
||||
Hibiki.PANAKO_TRANSF_MIN_FREQ,
|
||||
Hibiki.PANAKO_TRANSF_MAX_FREQ,
|
||||
Hibiki.PANAKO_TRANSF_REF_FREQ,
|
||||
Hibiki.PANAKO_TRANSF_TIME_RESOLUTION,
|
||||
)
|
||||
|
||||
ob.magnitudes = make([][]float32, ob.maxFilterWindowSizeTime)
|
||||
for i := range ob.magnitudes {
|
||||
ob.magnitudes[i] = make([]float32, fftSize/2)
|
||||
}
|
||||
|
||||
ob.maxMagnitudes = make([][]float32, ob.maxFilterWindowSizeTime)
|
||||
for i := range ob.magnitudes {
|
||||
ob.maxMagnitudes[i] = make([]float32, fftSize/2)
|
||||
}
|
||||
|
||||
ob.maxFilterVertical, err = utilities.NewLemireMinMaxFilter(ob.maxFilterWindowSizeFrequency, fftSize/2, true)
|
||||
if err != nil {
|
||||
return nil, err
|
||||
}
|
||||
|
||||
return ob, nil
|
||||
}
|
||||
|
||||
func NaiveMaxFilter(data []float32, halfFilterSize int, clamp bool) []float32 {
|
||||
max := make([]float32, len(data))
|
||||
for i := 0; i < len(data); i++ {
|
||||
startIndex := 0
|
||||
if i-halfFilterSize > startIndex {
|
||||
startIndex = i - halfFilterSize
|
||||
}
|
||||
stopIndex := len(data)
|
||||
if i+halfFilterSize < stopIndex {
|
||||
stopIndex = i + halfFilterSize
|
||||
}
|
||||
|
||||
maxValue := float32(-1000000.)
|
||||
for j := startIndex; j <= stopIndex; j++ {
|
||||
if maxValue < data[j] {
|
||||
maxValue = data[j]
|
||||
}
|
||||
}
|
||||
max[i] = maxValue
|
||||
}
|
||||
return max
|
||||
}
|
||||
|
||||
func (e *EventPointProcessor) GetMagnitudes() []float32 {
|
||||
return e.magnitudes[e.magnitudesIndex]
|
||||
}
|
||||
|
||||
func (e *EventPointProcessor) GetFingerprints() []*Fingerprint {
|
||||
return e.fingerprints
|
||||
}
|
||||
|
||||
func (e *EventPointProcessor) GetEventPoints() []*EventPoint {
|
||||
return e.eventPoints
|
||||
}
|
||||
|
||||
func (e *EventPointProcessor) ProcessingFinished() {
|
||||
e.gaborator.ProcessingFinished()
|
||||
|
||||
allMagnitudes := e.gaborator.GetCoefficients()
|
||||
|
||||
for _, currentMagnitudes := range allMagnitudes {
|
||||
e.magnitudes[e.magnitudesIndex] = currentMagnitudes
|
||||
|
||||
//store the frame magnitudes
|
||||
e.previousMagnitudes[e.analysisFrameIndex] = e.magnitudes[e.magnitudesIndex]
|
||||
|
||||
//run a max filter over frequency bins
|
||||
e.maxFilterVertical.MaxFilter(e.magnitudes[e.magnitudesIndex], e.maxMagnitudes[e.magnitudesIndex])
|
||||
//store the max filtered frequency bins
|
||||
e.previousMaxMagnitudes[e.analysisFrameIndex] = e.maxMagnitudes[e.magnitudesIndex]
|
||||
|
||||
//find the horizontal maxima
|
||||
if len(e.previousMaxMagnitudes) == e.maxFilterWindowSizeTime {
|
||||
t := e.analysisFrameIndex - e.maxFilterWindowSizeTime/2
|
||||
|
||||
maxFrame := e.previousMaxMagnitudes[t]
|
||||
frameMagnitudes := e.previousMagnitudes[t]
|
||||
|
||||
for f := 2; f < len(frameMagnitudes)-1; f++ {
|
||||
maxVal := maxFrame[f]
|
||||
currentVal := frameMagnitudes[f]
|
||||
|
||||
if maxVal == currentVal {
|
||||
e.horizontalFilter(f)
|
||||
maxVal = e.maxHorizontal[f]
|
||||
if currentVal == maxVal && currentVal != 0 {
|
||||
prevFrameMagnitudes := e.previousMagnitudes[t-1]
|
||||
nextFrameMagnitudes := e.previousMagnitudes[t+1]
|
||||
|
||||
//add the magnitude of surrounding bins for magnitude estimates more robust against discretization effects
|
||||
totalMagnitude := frameMagnitudes[f] + prevFrameMagnitudes[f] + nextFrameMagnitudes[f]
|
||||
totalMagnitude += frameMagnitudes[f+1] + prevFrameMagnitudes[f+1] + nextFrameMagnitudes[f+1]
|
||||
totalMagnitude += frameMagnitudes[f-1] + prevFrameMagnitudes[f-1] + nextFrameMagnitudes[f-1]
|
||||
|
||||
e.eventPoints = append(e.eventPoints, &EventPoint{
|
||||
Time: int32(t),
|
||||
Frequency: int32(f),
|
||||
Magnitude: totalMagnitude,
|
||||
})
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
//Remove analysis frames that are not needed any more:
|
||||
ix := e.analysisFrameIndex - e.maxFilterWindowSizeTime + 1
|
||||
delete(e.previousMaxMagnitudes, ix)
|
||||
delete(e.previousMagnitudes, ix)
|
||||
}
|
||||
|
||||
//magnitude index counter
|
||||
e.magnitudesIndex++
|
||||
if e.magnitudesIndex == len(e.magnitudes) {
|
||||
e.magnitudesIndex = 0
|
||||
}
|
||||
|
||||
//Increment analysis frame counter
|
||||
e.analysisFrameIndex++
|
||||
}
|
||||
|
||||
e.packEventPointsIntoFingerprints()
|
||||
}
|
||||
func maxInSlice(array []float32) float32 {
|
||||
var max = array[0]
|
||||
for _, value := range array {
|
||||
if max < value {
|
||||
max = value
|
||||
}
|
||||
}
|
||||
return max
|
||||
}
|
||||
|
||||
func (e *EventPointProcessor) horizontalFilter(j int) {
|
||||
for i := 0; i < len(e.maxHorizontal); i++ {
|
||||
e.maxHorizontal[i] = -1000
|
||||
}
|
||||
|
||||
centerFrameIndex := e.analysisFrameIndex - e.maxFilterWindowSizeTime/2
|
||||
startFrameIndex := centerFrameIndex - e.maxFilterWindowSizeTime/2
|
||||
stopFrameIndex := centerFrameIndex + e.maxFilterWindowSizeTime/2
|
||||
|
||||
for i := startFrameIndex; i < stopFrameIndex; i++ {
|
||||
maxFrame := e.previousMagnitudes[i]
|
||||
e.maxHorizontal[j] = maxInSlice(maxFrame)
|
||||
}
|
||||
}
|
||||
|
||||
func (e *EventPointProcessor) packEventPointsIntoFingerprints() {
|
||||
minFreqDistance := int32(Hibiki.PANAKO_FP_MIN_FREQ_DIST)
|
||||
maxFreqDistance := int32(Hibiki.PANAKO_FP_MAX_FREQ_DIST)
|
||||
|
||||
minTimeDistance := int32(Hibiki.PANAKO_FP_MIN_TIME_DIST)
|
||||
maxTimeDistance := int32(Hibiki.PANAKO_FP_MAX_TIME_DIST)
|
||||
|
||||
for i, p1 := range e.eventPoints {
|
||||
|
||||
for j, p2 := range e.eventPoints[i+1:] {
|
||||
|
||||
fDiff := Hibiki.Abs(p1.Frequency - p2.Frequency)
|
||||
tDiff := p2.Time - p1.Time
|
||||
|
||||
if tDiff > maxTimeDistance {
|
||||
break
|
||||
}
|
||||
if tDiff < minTimeDistance {
|
||||
continue
|
||||
}
|
||||
|
||||
if fDiff < minFreqDistance {
|
||||
continue
|
||||
}
|
||||
if fDiff > maxFreqDistance {
|
||||
continue
|
||||
}
|
||||
|
||||
for _, p3 := range e.eventPoints[j+1:] {
|
||||
fDiff := Hibiki.Abs(p2.Frequency - p3.Frequency)
|
||||
tDiff := p3.Time - p2.Time
|
||||
|
||||
if tDiff > maxTimeDistance {
|
||||
break
|
||||
}
|
||||
if tDiff < minTimeDistance {
|
||||
continue
|
||||
}
|
||||
|
||||
if fDiff < minFreqDistance {
|
||||
continue
|
||||
}
|
||||
if fDiff > maxFreqDistance {
|
||||
continue
|
||||
}
|
||||
|
||||
e.fingerprints = append(e.fingerprints, NewFingerprint(p1, p2, p3))
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
func (e *EventPointProcessor) Reset() {
|
||||
e.eventPoints = []*EventPoint{}
|
||||
e.fingerprints = []*Fingerprint{}
|
||||
|
||||
e.analysisFrameIndex = 0
|
||||
e.magnitudesIndex = 0
|
||||
e.previousMagnitudes = make(map[int][]float32)
|
||||
e.previousMaxMagnitudes = make(map[int][]float32)
|
||||
}
|
4
strategy/strategy.go
Normal file
4
strategy/strategy.go
Normal file
|
@ -0,0 +1,4 @@
|
|||
package strategy
|
||||
|
||||
type Strategy interface {
|
||||
}
|
180
utilities/lemire.go
Normal file
180
utilities/lemire.go
Normal file
|
@ -0,0 +1,180 @@
|
|||
package utilities
|
||||
|
||||
import (
|
||||
"fmt"
|
||||
"github.com/gammazero/deque"
|
||||
)
|
||||
|
||||
type LemireMinMaxFilter struct {
|
||||
windowSize int
|
||||
maxFifo *deque.Deque // int
|
||||
minFifo *deque.Deque // int
|
||||
maxVal []float32
|
||||
minVal []float32
|
||||
dataToFilter []float32
|
||||
|
||||
clampEdges bool
|
||||
}
|
||||
|
||||
func NewLemireMinMaxFilter(windowSize, dataLength int, clampEdges bool) (*LemireMinMaxFilter, error) {
|
||||
ob := &LemireMinMaxFilter{
|
||||
windowSize: windowSize,
|
||||
clampEdges: clampEdges,
|
||||
maxFifo: deque.New(windowSize),
|
||||
minFifo: deque.New(windowSize),
|
||||
}
|
||||
|
||||
if clampEdges {
|
||||
if windowSize%2 == 0 {
|
||||
return nil, fmt.Errorf("windowSize should be odd when clamping edges, it is even")
|
||||
}
|
||||
|
||||
ob.maxVal = make([]float32, dataLength)
|
||||
ob.minVal = make([]float32, dataLength)
|
||||
ob.dataToFilter = make([]float32, dataLength+windowSize-1)
|
||||
} else {
|
||||
|
||||
ob.maxVal = make([]float32, dataLength+windowSize-1)
|
||||
ob.minVal = make([]float32, dataLength+windowSize-1)
|
||||
ob.dataToFilter = nil
|
||||
}
|
||||
return ob, nil
|
||||
}
|
||||
|
||||
func (l *LemireMinMaxFilter) GetMinVal() []float32 {
|
||||
return l.minVal
|
||||
}
|
||||
|
||||
func (l *LemireMinMaxFilter) GetMaxVal() []float32 {
|
||||
return l.maxVal
|
||||
}
|
||||
|
||||
// MaxFilter Run only a max filter. The resulting filtered data is stored in maxFiltered
|
||||
//
|
||||
// @param array the data to filter. It should have the same length as given in the constructor.
|
||||
// @param maxFiltered the data to filter. It should have the same length as the data array
|
||||
func (l *LemireMinMaxFilter) MaxFilter(array, maxFiltered []float32) {
|
||||
if l.clampEdges {
|
||||
copy(l.dataToFilter[l.windowSize/2:], array[0:])
|
||||
for j := 0; j < (l.windowSize / 2); j++ {
|
||||
l.dataToFilter[j] = array[0]
|
||||
}
|
||||
for j := len(l.dataToFilter) - l.windowSize/2; j < len(l.dataToFilter); j++ {
|
||||
l.dataToFilter[j] = array[len(array)-1]
|
||||
}
|
||||
array = l.dataToFilter
|
||||
}
|
||||
|
||||
l.maxFifo.PushBack(int(0))
|
||||
|
||||
for i := 1; i < l.windowSize; i++ {
|
||||
if array[i] > array[i-1] { //overshoot
|
||||
l.maxFifo.PopBack()
|
||||
for l.maxFifo.Len() > 0 {
|
||||
if array[i] <= array[l.maxFifo.Back().(int)] {
|
||||
break
|
||||
}
|
||||
l.maxFifo.PopBack()
|
||||
}
|
||||
}
|
||||
l.maxFifo.PushBack(i)
|
||||
}
|
||||
|
||||
for i := l.windowSize; i < len(array); i++ {
|
||||
maxFiltered[i-l.windowSize] = array[l.maxFifo.Front().(int)]
|
||||
|
||||
if array[i] > array[i-1] {
|
||||
l.maxFifo.PopBack()
|
||||
for l.maxFifo.Len() > 0 {
|
||||
if array[i] <= array[l.maxFifo.Back().(int)] {
|
||||
break
|
||||
}
|
||||
l.maxFifo.PopBack()
|
||||
}
|
||||
}
|
||||
l.maxFifo.PushBack(i)
|
||||
|
||||
if i == l.windowSize+l.maxFifo.Front().(int) {
|
||||
l.maxFifo.PopFront()
|
||||
}
|
||||
}
|
||||
|
||||
maxFiltered[len(array)-l.windowSize] = array[l.maxFifo.Front().(int)]
|
||||
l.maxFifo.Clear()
|
||||
}
|
||||
|
||||
// Filter Run the filter. The resulting filtered data can requested by calling GetMaxVal and GetMinVal.
|
||||
func (l *LemireMinMaxFilter) Filter(array []float32) {
|
||||
if l.clampEdges {
|
||||
copy(l.dataToFilter[l.windowSize/2:], array[0:])
|
||||
for j := 0; j < (l.windowSize / 2); j++ {
|
||||
l.dataToFilter[j] = array[0]
|
||||
}
|
||||
for j := len(l.dataToFilter) - l.windowSize/2; j < len(l.dataToFilter); j++ {
|
||||
l.dataToFilter[j] = array[len(array)-1]
|
||||
}
|
||||
array = l.dataToFilter
|
||||
}
|
||||
|
||||
l.maxFifo.Clear()
|
||||
l.minFifo.Clear()
|
||||
|
||||
l.maxFifo.PushBack(int(0))
|
||||
l.minFifo.PushBack(int(0))
|
||||
|
||||
for i := 1; i < l.windowSize; i++ {
|
||||
if array[i] > array[i-1] { //overshoot
|
||||
l.maxFifo.PopBack()
|
||||
for l.maxFifo.Len() > 0 {
|
||||
if array[i] <= array[l.maxFifo.Back().(int)] {
|
||||
break
|
||||
}
|
||||
l.maxFifo.PopBack()
|
||||
}
|
||||
} else {
|
||||
l.minFifo.PopBack()
|
||||
for l.minFifo.Len() > 0 {
|
||||
if array[i] <= array[l.minFifo.Back().(int)] {
|
||||
break
|
||||
}
|
||||
l.minFifo.PopBack()
|
||||
}
|
||||
}
|
||||
l.maxFifo.PushBack(i)
|
||||
l.minFifo.PushBack(i)
|
||||
}
|
||||
|
||||
for i := l.windowSize; i < len(array); i++ {
|
||||
l.maxVal[i-l.windowSize] = array[l.maxFifo.Front().(int)]
|
||||
l.minVal[i-l.windowSize] = array[l.minFifo.Front().(int)]
|
||||
|
||||
if array[i] > array[i-1] { //overshoot
|
||||
l.maxFifo.PopBack()
|
||||
for l.maxFifo.Len() > 0 {
|
||||
if array[i] <= array[l.maxFifo.Back().(int)] {
|
||||
break
|
||||
}
|
||||
l.maxFifo.PopBack()
|
||||
}
|
||||
} else {
|
||||
l.minFifo.PopBack()
|
||||
for l.minFifo.Len() > 0 {
|
||||
if array[i] <= array[l.minFifo.Back().(int)] {
|
||||
break
|
||||
}
|
||||
l.minFifo.PopBack()
|
||||
}
|
||||
}
|
||||
l.maxFifo.PushBack(i)
|
||||
l.minFifo.PushBack(i)
|
||||
|
||||
if i == l.windowSize+l.maxFifo.Front().(int) {
|
||||
l.maxFifo.PopFront()
|
||||
} else if i == l.windowSize+l.minFifo.Front().(int) {
|
||||
l.minFifo.PopFront()
|
||||
}
|
||||
}
|
||||
|
||||
l.maxVal[len(array)-l.windowSize] = array[l.maxFifo.Front().(int)]
|
||||
l.minVal[len(array)-l.windowSize] = array[l.minFifo.Front().(int)]
|
||||
}
|
100
utilities/morton2d/morton2d.go
Normal file
100
utilities/morton2d/morton2d.go
Normal file
|
@ -0,0 +1,100 @@
|
|||
package morton2d
|
||||
|
||||
var mortonTable256 = [...]int64{
|
||||
0x0000, 0x0001, 0x0004, 0x0005, 0x0010, 0x0011, 0x0014, 0x0015,
|
||||
0x0040, 0x0041, 0x0044, 0x0045, 0x0050, 0x0051, 0x0054, 0x0055,
|
||||
0x0100, 0x0101, 0x0104, 0x0105, 0x0110, 0x0111, 0x0114, 0x0115,
|
||||
0x0140, 0x0141, 0x0144, 0x0145, 0x0150, 0x0151, 0x0154, 0x0155,
|
||||
0x0400, 0x0401, 0x0404, 0x0405, 0x0410, 0x0411, 0x0414, 0x0415,
|
||||
0x0440, 0x0441, 0x0444, 0x0445, 0x0450, 0x0451, 0x0454, 0x0455,
|
||||
0x0500, 0x0501, 0x0504, 0x0505, 0x0510, 0x0511, 0x0514, 0x0515,
|
||||
0x0540, 0x0541, 0x0544, 0x0545, 0x0550, 0x0551, 0x0554, 0x0555,
|
||||
0x1000, 0x1001, 0x1004, 0x1005, 0x1010, 0x1011, 0x1014, 0x1015,
|
||||
0x1040, 0x1041, 0x1044, 0x1045, 0x1050, 0x1051, 0x1054, 0x1055,
|
||||
0x1100, 0x1101, 0x1104, 0x1105, 0x1110, 0x1111, 0x1114, 0x1115,
|
||||
0x1140, 0x1141, 0x1144, 0x1145, 0x1150, 0x1151, 0x1154, 0x1155,
|
||||
0x1400, 0x1401, 0x1404, 0x1405, 0x1410, 0x1411, 0x1414, 0x1415,
|
||||
0x1440, 0x1441, 0x1444, 0x1445, 0x1450, 0x1451, 0x1454, 0x1455,
|
||||
0x1500, 0x1501, 0x1504, 0x1505, 0x1510, 0x1511, 0x1514, 0x1515,
|
||||
0x1540, 0x1541, 0x1544, 0x1545, 0x1550, 0x1551, 0x1554, 0x1555,
|
||||
0x4000, 0x4001, 0x4004, 0x4005, 0x4010, 0x4011, 0x4014, 0x4015,
|
||||
0x4040, 0x4041, 0x4044, 0x4045, 0x4050, 0x4051, 0x4054, 0x4055,
|
||||
0x4100, 0x4101, 0x4104, 0x4105, 0x4110, 0x4111, 0x4114, 0x4115,
|
||||
0x4140, 0x4141, 0x4144, 0x4145, 0x4150, 0x4151, 0x4154, 0x4155,
|
||||
0x4400, 0x4401, 0x4404, 0x4405, 0x4410, 0x4411, 0x4414, 0x4415,
|
||||
0x4440, 0x4441, 0x4444, 0x4445, 0x4450, 0x4451, 0x4454, 0x4455,
|
||||
0x4500, 0x4501, 0x4504, 0x4505, 0x4510, 0x4511, 0x4514, 0x4515,
|
||||
0x4540, 0x4541, 0x4544, 0x4545, 0x4550, 0x4551, 0x4554, 0x4555,
|
||||
0x5000, 0x5001, 0x5004, 0x5005, 0x5010, 0x5011, 0x5014, 0x5015,
|
||||
0x5040, 0x5041, 0x5044, 0x5045, 0x5050, 0x5051, 0x5054, 0x5055,
|
||||
0x5100, 0x5101, 0x5104, 0x5105, 0x5110, 0x5111, 0x5114, 0x5115,
|
||||
0x5140, 0x5141, 0x5144, 0x5145, 0x5150, 0x5151, 0x5154, 0x5155,
|
||||
0x5400, 0x5401, 0x5404, 0x5405, 0x5410, 0x5411, 0x5414, 0x5415,
|
||||
0x5440, 0x5441, 0x5444, 0x5445, 0x5450, 0x5451, 0x5454, 0x5455,
|
||||
0x5500, 0x5501, 0x5504, 0x5505, 0x5510, 0x5511, 0x5514, 0x5515,
|
||||
0x5540, 0x5541, 0x5544, 0x5545, 0x5550, 0x5551, 0x5554, 0x5555,
|
||||
}
|
||||
|
||||
var mortonTable256DecodeX = [...]int64{
|
||||
0, 1, 0, 1, 2, 3, 2, 3, 0, 1, 0, 1, 2, 3, 2, 3,
|
||||
4, 5, 4, 5, 6, 7, 6, 7, 4, 5, 4, 5, 6, 7, 6, 7,
|
||||
0, 1, 0, 1, 2, 3, 2, 3, 0, 1, 0, 1, 2, 3, 2, 3,
|
||||
4, 5, 4, 5, 6, 7, 6, 7, 4, 5, 4, 5, 6, 7, 6, 7,
|
||||
8, 9, 8, 9, 10, 11, 10, 11, 8, 9, 8, 9, 10, 11, 10, 11,
|
||||
12, 13, 12, 13, 14, 15, 14, 15, 12, 13, 12, 13, 14, 15, 14, 15,
|
||||
8, 9, 8, 9, 10, 11, 10, 11, 8, 9, 8, 9, 10, 11, 10, 11,
|
||||
12, 13, 12, 13, 14, 15, 14, 15, 12, 13, 12, 13, 14, 15, 14, 15,
|
||||
0, 1, 0, 1, 2, 3, 2, 3, 0, 1, 0, 1, 2, 3, 2, 3,
|
||||
4, 5, 4, 5, 6, 7, 6, 7, 4, 5, 4, 5, 6, 7, 6, 7,
|
||||
0, 1, 0, 1, 2, 3, 2, 3, 0, 1, 0, 1, 2, 3, 2, 3,
|
||||
4, 5, 4, 5, 6, 7, 6, 7, 4, 5, 4, 5, 6, 7, 6, 7,
|
||||
8, 9, 8, 9, 10, 11, 10, 11, 8, 9, 8, 9, 10, 11, 10, 11,
|
||||
12, 13, 12, 13, 14, 15, 14, 15, 12, 13, 12, 13, 14, 15, 14, 15,
|
||||
8, 9, 8, 9, 10, 11, 10, 11, 8, 9, 8, 9, 10, 11, 10, 11,
|
||||
12, 13, 12, 13, 14, 15, 14, 15, 12, 13, 12, 13, 14, 15, 14, 15,
|
||||
}
|
||||
|
||||
var mortonTable256DecodeY = [...]int64{
|
||||
0, 0, 1, 1, 0, 0, 1, 1, 2, 2, 3, 3, 2, 2, 3, 3,
|
||||
0, 0, 1, 1, 0, 0, 1, 1, 2, 2, 3, 3, 2, 2, 3, 3,
|
||||
4, 4, 5, 5, 4, 4, 5, 5, 6, 6, 7, 7, 6, 6, 7, 7,
|
||||
4, 4, 5, 5, 4, 4, 5, 5, 6, 6, 7, 7, 6, 6, 7, 7,
|
||||
0, 0, 1, 1, 0, 0, 1, 1, 2, 2, 3, 3, 2, 2, 3, 3,
|
||||
0, 0, 1, 1, 0, 0, 1, 1, 2, 2, 3, 3, 2, 2, 3, 3,
|
||||
4, 4, 5, 5, 4, 4, 5, 5, 6, 6, 7, 7, 6, 6, 7, 7,
|
||||
4, 4, 5, 5, 4, 4, 5, 5, 6, 6, 7, 7, 6, 6, 7, 7,
|
||||
8, 8, 9, 9, 8, 8, 9, 9, 10, 10, 11, 11, 10, 10, 11, 11,
|
||||
8, 8, 9, 9, 8, 8, 9, 9, 10, 10, 11, 11, 10, 10, 11, 11,
|
||||
12, 12, 13, 13, 12, 12, 13, 13, 14, 14, 15, 15, 14, 14, 15, 15,
|
||||
12, 12, 13, 13, 12, 12, 13, 13, 14, 14, 15, 15, 14, 14, 15, 15,
|
||||
8, 8, 9, 9, 8, 8, 9, 9, 10, 10, 11, 11, 10, 10, 11, 11,
|
||||
8, 8, 9, 9, 8, 8, 9, 9, 10, 10, 11, 11, 10, 10, 11, 11,
|
||||
12, 12, 13, 13, 12, 12, 13, 13, 14, 14, 15, 15, 14, 14, 15, 15,
|
||||
12, 12, 13, 13, 12, 12, 13, 13, 14, 14, 15, 15, 14, 14, 15, 15,
|
||||
}
|
||||
|
||||
func Encode(x, y int32) int64 {
|
||||
return mortonTable256[(y>>8)&0xFF]<<17 | mortonTable256[(x>>8)&0xFF]<<16 | mortonTable256[y&0xFF]<<1 | mortonTable256[x&0xFF]
|
||||
}
|
||||
|
||||
func Decode(c int64) (int32, int32) {
|
||||
|
||||
// Morton codes up to 48 bits
|
||||
if c < (1 << 48) {
|
||||
return decodeHelper(c, &mortonTable256DecodeX), decodeHelper(c, &mortonTable256DecodeY)
|
||||
}
|
||||
|
||||
return 0, 0
|
||||
}
|
||||
|
||||
func decodeHelper(c int64, coord *[256]int64) int32 {
|
||||
var a int64 = 0
|
||||
|
||||
loops := 64 / 9 //integer division
|
||||
|
||||
for i := 0; i < loops; i++ {
|
||||
a |= coord[((c>>(i*8))&0xFF)] << (4 * i)
|
||||
}
|
||||
|
||||
return int32(a)
|
||||
}
|
Loading…
Reference in a new issue