ch
Feedback
🇺🇦 Python Programming Сhallenges

🇺🇦 Python Programming Сhallenges

前往频道在 Telegram

Размышления на тему решения различных задач по спортивному программированию на Python и не только.

显示更多
839
订阅者
无数据24 小时
无数据7
+1730
帖子存档
Today, around 15:25 GMT +2, I’ll present my talk at @pyconit about debugging Python applications inside the docker and k8s cluster. You can watch it online using the stream link https://2024.pycon.it/en/streaming or attend (Room Lasagna). #pycon #pyconit #k8s

Scalene: a high-performance CPU, GPU and memory profiler for Python https://github.com/plasma-umass/scalene
Scalene: a high-performance CPU, GPU and memory profiler for Python https://github.com/plasma-umass/scalene

Found very intersting approach to count the digits of an integers #python:
from math import floor, log10


def count_digits(n):
    return 1 + floor(log10(n))

In [2]: count_digits(5)
Out[2]: 1

In [3]: count_digits(999)
Out[3]: 3

In [4]: count_digits(1000)
Out[4]: 4

blue is a somewhat less uncompromising code formatter than black, the OG of Python formatters. https://github.com/grantjenks/blue

Performance comparison: counting words in Python, Go, C++, C, AWK, Forth, and Rust https://benhoyt.com/writings/count-words/

It's just a trick It's because unary minus is right-associative and binds tighter than binary minus which is left-associative -12 // 5 => - 3 - (-12 // 5) => +3 The rest is just putting 0 at the start: --0 == 0 and --0--12//5 is parsed as -(-(0)) - (- (12 // 5)) from Twitter https://twitter.com/ericpromislow/status/1362475189125095425?s=21

I can't recall where I saw this originally, but you can use the spaceship operator "--0--" to turn floor division into ceiling division: >>> 12//5 2 >>> --0-- 12//5 3 There's also the ++0++ operator when you want to emphasize that you really *do* mean floor division: >>> ++0++ 12//5 2 from https://bugs.python.org/issue43255#msg387248 But yes, -(-n // d) is the easy (if a little bit cryptic) way to get the ceiling of n / d.

Armin dislikes new PEP regarding structural pattern matching https://twitter.com/mitsuhiko/status/1359263135304187910 btw PEP has been approved! https://www.python.org/dev/peps/pep-0636/

Hypermodern Python 👩‍🚀 🐍 Chapter 1: Setup Chapter 2: Testing Chapter 3: Linting Chapter 4: Typing Chapter 5: Documentation Chapter 6: CI/CD https://cjolowicz.github.io/posts/hypermodern-python-01-setup/

Note #71 The seven rules of a great Git commit message 1. Separate subject from body with a blank line 2. Limit the subject line to 50 characters 3. Capitalize the subject line 4. Do not end the subject line with a period 5. Use the imperative mood in the subject line 6. Wrap the body at 72 characters 7. Use the body to explain what and why vs. how https://chris.beams.io/posts/git-commit/

Asynchronous IO Support for Core and ORM SQLAlchemy 1.4 now supports Python asyncio-compatible database drivers using an all-new asyncio front-end interface to Connection for Core usage as well as Session for ORM use, using the AsyncConnection and AsyncSession objects. https://docs.sqlalchemy.org/en/14/changelog/migration_14.html#asynchronous-io-support-for-core-and-orm

PEP 622 -- Structural Pattern Matching Interesting proposal for python 3.10. The proposed indentation structure is as following:
match some_expression:
    case pattern_1:
        ...
    case pattern_2:
        ...
and example from pep:
match number:
    case 0:
        print("Nothing")
    case 1:
        print("Just one")
    case 2:
        print("A couple")
    case -1:
        print("One less than nothing")
    case 1-1j:
        print("Good luck with that...")
https://www.python.org/dev/peps/pep-0622/

Note #68: The Rules of Optimization Club 1. You do not optimize. 2. You do not optimize, without measuring first. 3. When the performance is not bound by the code, but by external factors, the optimization is over. 4. Only optimize code that already has full unit test coverage. 5. One factor at a time. 6. No unresolved bugs, no schedule pressure. 7. Testing will go on as long as it has to. 8. If this is your first night at Optimization Club, you have to write a test case. from https://wiki.c2.com/?RulesOfOptimizationClub

Restructuring data, the Python way.
>>> import glom
>>> glom.assign({}, "a.b.c.d", 42, missing=dict)
{'a': {'b': {'c': {'d': 42}}}}

# Path-based access for nested structures
>>> target = {'a': {'b': {'c': 'd'}}}
>>> glom(target, 'a.b.c') 
'd'
happy glomming! 😋 https://glom.readthedocs.io/en/latest/