Apologies for the sparsely written issue, I can add more details after an impending de

Closed via <a class="commit-link" data-hovercard-type="commit" data-hovercard-url="htt

Removing the last hash from a database about audfprint HOT 2 CLOSED

dpwe commented on July 17, 2024

Removing the last hash from a database

from audfprint.

Comments (2)

dpwe commented on July 17, 2024

It turns out that removing the first item added to a database is a special case, because empty hash table entries look like they belong to ID 0. I could fix this, but I'm already worried that this operation could exhaust memory, and the bug is not fatal at the moment, it just reports that it has removed a very large number of hashes (and it's slow).

However, the actual crash reported above is now fixed. Thanks for the clear report!

from audfprint.

dpwe commented on July 17, 2024

Closed via dd0b2b9

from audfprint.

Related Issues (20)

How to Debug a Non Match HOT 5
Multiple input and adding live audio option HOT 3
Incorrect time range HOT 1
Incorrect Time range. HOT 1
Convert .afpk files to mp3? HOT 1
Problem with "spreadpeaksinvector"
Reduce memory usage HOT 2
Use audfprint as a module
How to increase bits for storing IDs and timestamp?
illustrate
Scan every folder in every fingerprint base named as folder HOT 3
UNICODE chaaracters ERROR HOT 11
Show more than 1 finded matched names in results. HOT 4
Can this algorithm load the historical features into memory first, so that the matching speed is improved, but I don't know how to modify your basic code HOT 7
Hello, if the song is 1 million (the duration of the song is about 3 minutes), the matching time is very slow, how to optimize it? HOT 1
I found that according to The time and hash generated by audfprint are not continuous in time, which led me to use the binary method to search for the same hash, conduct a statistical ranking of the number of hashes, and search for the original version of individual audio (the climax audio), and the ranking is not the first.
I found that some match matches are inaccurate. I want to know, is the time and hash generated by this audfprint continuous at the start-end time, or is it a peak value, which leads to the fact that if one song is 1 minute, another song 3 minutes, there are a lot of hashes in the previous minute in the last two minutes of the next song, which leads to the fact that the hash statistics are larger than one minute, resulting in inaccurate sorting, then the match situation is inaccurate, how to optimize this? HOT 2
output matching different between windows and linux. I created a database of filehashes which is around 340MB. When i try to query around 100 mp3 files my output is different between my windows machine and my raspberri pi. The database is identical, the query is identical but the windows machine finds significantly more matches. Both are running python 3.9. Database was created on the windows machine and transfered to the pi. Anyone encountered something similar? HOT 7
Question about concatenate afpk files HOT 2
How to avoid big % Dropped HOT 5

Removing the last hash from a database about audfprint HOT 2 CLOSED

Comments (2)

Related Issues (20)

Recommend Projects

React

Vue.js

Typescript

TensorFlow

Django

Laravel

D3

Recommend Topics

javascript

web

server

Machine learning

Visualization

Game

Recommend Org

Facebook

Microsoft

Google

Alibaba

D3

Tencent