qp | A didactic on-disk key-value database management system | Key Value Database library

After playing a little bit more with the data output I found a non-elegant way of checking for failed values, for example for the element "LOL":

You need to place the condition in a WHERE clause, but part is the result of a window function and you can't use it directly in the WHERE clause.

You can do it with a subquery:

I think you want order by, not partition by:

Few notes:

• There is no need to convert the frames to PNG first.
• hevc_nvenc applies H.265 codec, and you are using .h264 file extension.
  I tried h264_nvenc, but I got an error, because the resolution is too high (for H.264 NVIDIA encoder).
• result%7d.png should be result%07d.png
• It is recommended to select the pixel format (yuv420p or yuv444p).

Here is the syntax:

Dealing with widgets that have a fixed aspect ratio is not an easy task, and some precautions must be taken in order to ensure that having an "incompatible" parent size doesn't prevent proper display.

In this case, a possible solution is to use a widget for the chessboard that uses a grid layout for all the squares and pieces.
Note that a QLabel isn't a good choice for the chessboard, as it doesn't allow a size smaller than the QPixmap, so a QWidget should be subclassed instead.

The trick is to override the resizeEvent(), ignore the base implementation (which by default adapts the geometry of the layout) and manually set the geometry based on the minimum extent between width and height.

In order to ensure that the layout has proper equal spacings even when a row or column is empty, setRowStretch() and setColumnStretch() must be called for the whole grid size.

Then, you add the pieces directly to the layout, and whenever you need to move them you can just create a helper function that uses addWidget() with the correct row/column (which will automatically "move" the widget to the new position).

Here is a possible implementation.

I fixed this bug in a PR back in Feb 2021. However, it seems that the current release (v 5.7.3) does not have the fix yet. You can do two things (for both of these you would need to know where pyomo is installed, find that out using print(pyomo.__file__) in the python console):

1. Clone the Pyomo github repository (master branch) and use that as your pyomo installation. Hint: you can install pyomo using pip, and then replace the pyomo installation (somewhere in env/lib/site-packages/pyomo) with a symbolic link the repo clone. #lifehack

2. If you have Pyomo 5.7.3 , then you can make the fix yourself. If you go to file: python3.8/site-packages/pyomo/solvers/plugins/solvers/mosek_direct.py then you only need to change line number 253 from mosek_qexp = (qsubi, qsubj, qvals) to mosek_qexp = (qsubj, qsubi, qvals).

The second option should be quicker.

Sorry for the inconvenience. It is a bit confusing why the release does not have this fix yet, but I will raise this issue with the maintainers of the repo.

It turns out that I was partially right and wrong.

1. ffmpeg has multiple levels and amounts of internal buffering, depending on input/output formats, filters and codecs: I just didn't create enough frames to see that happening;
2. interaction with the QProcess should happen in the thread in which it was created;
3. for that reason, data cannot be directly written to the write channel from a different thread, so signals must be used instead;
4. the write channel must be closed (from its same thread) when all data has been written in order to ensure completion of the encoding;

Considering the above, I only use the thread to create the images, then emit a signal with the saved QByteArray of each image; finally, after image creation is completed I wait for the actual completion (based on the showinfo filter output) so that the thread is actually considered finished at that point. Some optimization could be used to queue further image creation in case of multiple jobs, but considering that it probably won't improve performance that much, I prefer the current approach.

Here is the revised code, I tested with different formats and it seems to work as expected.

The fact it obfuscates itself is a good indicator it maybe malicious, if you want to see what it's attempting to run you can;

Comment out this line (like below);

-msse2 is the specific option, so passing that to GCC will work, if you get your build scripts set up to actually do that. https://gcc.gnu.org/onlinedocs/gcc/x86-Options.html#x86-Options

Or better, use -march=native to enable everything your CPU has, if you're building for local use, not for distributing a binary that might have to work on an old-but-not-ancient CPU. (Of course, if you care about performance, it's weird to be building for 32-bit mode. SSE2 is baseline for x86-64. Unless your CPU is too old to support SSE2, e.g. a Pentium III. Or for example, there are embedded x86 CPUs without SSE, like AMD Geode. In that case, a binary built (successfully) with -msse2 will probably crash with an illegal instruction on such a CPU.)

-mfpmath=sse just tells GCC to use SSE for scalar FP math assuming that SSE is available; unrelated to telling GCC to assume the target CPU does support SSE2. It can be good to use it as well for performance, but it's not going to matter in getting your code to compile.

And yes, SSE1/2 intrinsic types like __m128i will only get defined when SSE is enabled, so error: ‘__m128i’ does not name a type is a clear sign that -msse wasn't enabled