C++ is std::__cxx11::list<std::__shared_ptr<table, (__gnu_cxx::_Lock_policy)0>, std::allocator<std::__shared_ptr<table, (__gnu_cxx::_Lock_policy)0> > >::erase(std::_List_const_iterator<std::__shared_ptr<table, (__gnu_cxx::_Lock_policy)0> >) /usr/include/c++/12/bits/list.tcc:158
your underflow error is someone’s underflow feature (hopefully with -fwrapv)
that works for 2 word names eg is_open or is_file, but in this case is_dialog_file_open is structured like a question, while dialog_file_is_open is structured like a statement
as many iterations as it takes
void* x = &x;
char* ptr = (char*)&x;
while (1) {
printf("%d\n", (unsigned int)*ptr);
ptr--;
}
cosmologists: sin(x) ~= 10
Considering this was written in 2001, I’m not all that worried
a shadow is just a silhouette cast on a surface, so it can move much faster than light. An object moving near the speed of light in front of a small light source that casts a shadow on a very large, very distant object could appear to move billions of times faster than light (though you would need an extremely bright light source for the shadow to be noticeable to the naked eye)
there’s really no upper limit, just how far you’re willing to stretch the definition of “shadow” and “movement”
slow inverse square root:
float slowinvsqrt(float x)
{
const long accuracy = 100000000; // larger number = better accuracy
if (x <= 0.0f) {
return NAN;
}
if (x == 1.0f) {
return 1.0f;
}
if (x < 1.0f) {
return 1.0f / slowinvsqrt(1.0f/x);
}
int max_power = log(accuracy) / log(x);
long pow1 = pow(x, max_power - 1);
long pow2 = pow(x, max_power);
double current = 1.0;
double previous = 1.0;
for (long i = 0; i<10*accuracy; i++) {
current = sin(current);
if (i == pow1) {
previous = current;
}
if (i == pow2) {
return current / previous;
}
}
}
even if you write in assembly, you still may not actually understand what is going on in the machine since processors convert the instructions to “micro-ops”, and let’s not forget hardware bugs like those caused by speculative execution
Oopsie woopsie!
Is there something I should be keeping an eye out for, or preparing for so everything goes smoothly at least with regards to this community?
On the 6th of May, 2028, travel to 2 Augusta Hills Drive, Bakersfield, Kern County, California, United States. At exactly 4 PM local time, place an orange traffic cone on top of the nearest garbage can and await further instructions.
ironically suyu is still up on github
and of course ryujinx hasn’t received any legal threats yet
Youtube actually uses 128kbps opus, which should be significantly better than 160kbps mp3
but the real problem is that you can’t know what quality the uploader used, it all gets recompressed by youtube.
They could do it without recompilation, but something like changing the obfuscation and recompiling for every copy would likely make it much harder to get rid of the watermarks even if you can compare several different copies
(though they could also have multiple watermarked sections so that any group of for example 3 copies would have some section that is identical, but still watermarked and would uniquely identify all three leakers. The amount of data you need the watermarks to contain goes up exponentially with the amount of distinct copies, but if you have say 1000 review copies and want to be resistant to 4 copies being “merged”, you only need to distinguish between 1000^4 combinations so you can theoretically get away with a watermark that only contains about 40 bits of data )
deleted by creator
it is difficult to get a man to understand something, when his salary depends upon his not understanding it
it’s set down diagonally so it fits
I wonder if it’s common for those steganography techniques to have some mechanism for defeating the fairly simple strategy of getting 2 copies of the file from different sources, and looking at the differences between them to expose all the watermarks.
(I’d think you would need sections of watermark that are the same for any 2 or n combinations of copies of the data, which may be pretty easy to do in many cases, though the difference makes detecting the general watermarking strategy massively easier for the un-watermarkers)