Python

the borg files cache can be rather large, because it keeps some information about all files that have been processed recently.

lz4 is a very fast compression / decompression algorithm, so we could try to use it to lower the in-memory footprint of the files cache entries.

before implementing this, we should check how big the savings typically are - to determine whether it is worthwhile doing

Problem: the approximate method can still be slow for many trees
catboost version: master
Operating System: ubuntu 18.04
CPU: i9
GPU: RTX2080

Would be good to be able to specify how many trees to use for shapley. The model.predict and prediction_type versions allow this. lgbm/xgb allow this.

This function needs a unit test.

Guide to how to contribute to an open source project on GitHub.

Test stub: https://github.com/pygame/pygame/blob/main/test/display_test.py#L255-L274
Docs: https://www.pygame.org/docs/ref/display.html#pygame.display.gl_set_attribute
Code to be tested: https://github.com/pygame/pygame/bl

I'd like to request that an additional parameter be added to the GamePadShift API/Module that allows you to define the number of bits to be shifted in. For example, GamePadShift could be used with a Super Nintendo controller if it could be set to s

I have an application which receives log messages from a firewall. The logs are written into a MongoDB. My goal is to process 30'000 messages per second (more or less constantly for 7*24 hours, not as transient peak value)
As peak value I expect app. 50'000 messages per second.

With several settings I reached up to 20'000 msg/sec. but that is not sufficient for our life traffic. The MongoDB ho

hi,
as you know, in SoLoud, the number of filters are limited
we should implement more like different reverbs, fir and irr filters, (these could be used to implement HRTF support), Chorus, One Poll, One Zero, Pole Zero, Two Pole, Two Zero, etc
a library exists called stk under zlib license which already implemented these maybe we can implement some of these out