apankrat

12 ms·

61.
by apankrat 6y ago
FD transfer is also used when a process needs to work with files (or devices) that are out of its reach due to the account restrictions. In this case, the process will talk to another process that does have required access, the latter wou
62.
by apankrat 6y ago
Re: a virtual midi device - I don't know the specifics of WebMIDI, but I'd think it should be rather trivial to code on top of any pitch detector, including mine. In terms of licensing - the code is already BSD-2. Re: the another
63.
by apankrat 6y ago
Thanks, yours is very nice too :) For what it's worth, the auto-correlation route is simpler and more reliable. FFT alone is not enough, because the spectrum tends to be rather ambiguous. There's still a pattern to it for every no
64.
by apankrat 6y ago
Had nearly the same idea for the exact same reasons, but wanted it to work on an iPad. Safari has no WebMIDI, so I ended up using WebAudio paired with pitch detection by consensus instead. Here's the result - https://github.
65.
by apankrat 6y ago
Thanks, I haven't heard of the Goertzel algorithm. It's a spectrum-based detection though, so it will have the same issues as other spectrum detectors. Lower notes tend to have harmonics that are stronger than the base frequency.
66.
Show HN: Simple Piano Note Detector(github.com)
14 points by apankrat 6y ago|3 comments
67.
by apankrat 6y ago
Bit flips in RAM happen often enough to be an issue. I make a desktop program with a sizeable installation base and it uses a form paged on-disk storage for larger data sets. The code has a fair amount of asserts in it and one specific asse
68.
by apankrat 6y ago
Yes, it works quite well. Especially if the port prediction part is driven by a dedicated "rendezvous" server rather than delegated to the clients to do. This plus taking care of the long tail (weird NAT combos) and adding a TCP t
69.
by apankrat 6y ago
OK, gave it a try. 1. Sign-up process has too many pointless hurdles. If you have restrictions on the password format, mention them upfront rather than revealing them one at a time after each failed attempt. Better yet, just don't enfo
70.
by apankrat 6y ago
Don't get carried away with misquoting or you end up with a strawman. It's "sscanf() rewrite for a log parsing case", not "sscanf rewrite".
71.
by apankrat 6y ago
Oh, I'm sure it's implementation-specific.
72.
by apankrat 6y ago
Just keep in mind that stdio is really slow, even its fast paths. For example, here's a trivial sscanf() rewrite for a log parsing case that achieves 300x speed-up - https://gist.github.com/apankrat/20776d68d1d97bc
73.
by apankrat 6y ago
Only tangentially related - Data Mechanics was one of contenders for our company name too! It was one of my favourite options in fact. It sounds nice, can be read in two ways, works well when shortened - DataMech. But getting datamech.com p
74.
by apankrat 7y ago
I disagree that it's "brutally" hard, but to each his own. The main issue is that the need is not well-defined and there are competing solutions that aren't as technically elegant, but as robust and as easily deployed. C
75.
by apankrat 7y ago
> I am absolutely shocked it took someone this long Because it's really hard to monetize it. Speaking from the experience. Edit - This particular bicycle gets reinvented on regular basis and in a nearly identical form. While techn
76.
by apankrat 7y ago
Thanks, appreciate the compliment, but there's not much to it really. Do version A, use it, change what's off or annoying, rinse and repeat. At some point it always converges to a stable point. Pretty much the only criteria is to
77.
by apankrat 7y ago
For deleting - yes, you will get a round-trip per delete request. So if they are serialized (which is the case with standard tools), it will be excruciatingly slow indeed. For scanning - you'll get the list of content in chunks. The si
78.
by apankrat 7y ago
A couple of reasons. It takes time to prep a public release. Review the sources, comment them, check formatting, add docs, legalese, build instructions, etc. I really don't like publishing stuff that's not in a proper order. Sec
79.
by apankrat 7y ago
There's no way to delete multiple files with a single syscall. There's also no way to purge the folder of all its contents. At least not on Windows, using an API.
80.
by apankrat 7y ago
It's mentioned on the homepage. There's also "del /f /s /q" to delete just files, followed by "rmdir /q /s" to delete just folders; and there's also "robocopy /mir"
81.
by apankrat 7y ago
Depends on how they are opened. If they aren't opened in FILE_SHARE_DELETE mode, then they will in fact be locked against deletion... because that's exactly what file's current user wanted. Force-deleting a file in this case
82.
by apankrat 7y ago
This is mine. I was meaning to do a Show HN post for it actually, just was waiting for the weekend :) I've been using this internally for several months. For local deletes YMMV. There seem to be some sort of central lock in the NTFS dr
83.
by apankrat 7y ago
Re #2 - If you are on Windows, take a look at IOCP as a queuing mechanism. Use one IOC port to queue work for the threads and use another IOC port to submit completed work back to whoever's listening. Worker threads then merely wait fo
84.
by apankrat 7y ago
I'm a bit less of a dinosaur, but the setup package for my product is still under 3MB. The package carries both 32- and 64-bit versions and the installer itself is 250KB, no dependencies outside of stock Windows supply. This is for an
85.
by apankrat 7y ago
Your recollection is off. LMI bought Hamachi in 2006 and I was involved in the development until 2009. Through that time there were no known issues with older games. Nothing was broken. What was tunneled before was still tunneled the exact
86.
by apankrat 7y ago
Got to compliment you for not having any external dependencies on the site. I really wish this were more commonplace.
87.
by apankrat 7y ago
Same here. bff [1] has no fancy assembly, not even a compiler, just some basic loop unrolling and jump precomputation, but I too wonder how it compares to wc. [1] https://github.com/apankrat/bff/ -- edit -- Found
88.
by apankrat 7y ago
Depends on the project. Lots of cases when there's no need for schema versioning. For example, when two processes need to talk to each other and they both run from the same binary or share the exact same datamodel. Even if they aren&#x
89.
by apankrat 7y ago
Heh, yeah. It wasn't this bad in 2008 when I first got here... though I suspect it's more of a language issue. C++ tends to prompt a discussion of a poorer quality. Every second person is an senior expert that feels obliged to tea
90.
by apankrat 7y ago
OK, will do. I assumed it was obvious that schemas on both ends must match.

More ›