python

Back Open Paginator
08.12.2025 19:32
habr (@habr@zhub.link)

[Перевод] Что нового в PyCharm 2025.3

Команда Python for Devs подготовила краткий разбор нового релиза PyCharm 2025.3. В этой версии JetBrains объединяет пользователей Community с основным дистрибутивом, полностью поддерживает Jupyter при удалённой разработке, делает uv менеджером окружений по умолчанию, внедряет упреждающий анализ данных и расширяет поддержку LSP-инструментов — от Ruff и Pyright до Pyrefly.

habr.com/ru/articles/974656/

#PyCharm #Python #Jupyter #JetBrains #IDE




Show Original Post


08.12.2025 19:28
adw99 (@adw99@mastodon.social)

Content warning:AOC Day 8 Chatter


I just completed "Playground" - Day 8 - Advent of Code 2025

Strange day, in part 1 I had two offsetting bugs that left me correct for the sample data but wrong on the problem set. Fixing the first bug seemed like progress....but left me wrong on the sample data until I found the second bug. 😂

Unusually, part 2 was very quick for me, a couple of small tweaks to part 1 and it worked first try. 🤷‍♂️

adventofcode.com/2025/day/8
github.com/adw99/advent-of-cod




Show Original Post


08.12.2025 19:13
TechKeysX (@TechKeysX@mastodon.social)

S1 EP10 T4 - Machine Learning in Python - Creating Two - Classes in Python





Show Original Post


08.12.2025 19:09
localizethedocs (@localizethedocs@floss.social)

🎉 mlx-docs-l10n is published!

🚀 Preview:

projects.localizethedocs.org/m

🌐 Crowdin:

localizethedocs.crowdin.com/ml

🐙 GitHub:

github.com/localizethedocs/mlx

#Crowdin #GitHub #Sphinx #MLX #AppleSilicon #ML #Python #Cpp




Show Original Post


08.12.2025 19:02
driscollis (@driscollis@mastodon.social)

How to use to generate a password using the secrets module 🐍🔥





Show Original Post


08.12.2025 18:45
sethmlarson (@sethmlarson@mastodon.social)

urllib3 used "DeprecationWarning" for 3 years to deprecate API features and it didn't work, so what do we do instead?

sethmlarson.dev/deprecations-v




Show Original Post


08.12.2025 18:30
pytexas (@pytexas@fosstodon.org)

🚨 URGENT: PyTexas 2026 #CFP extended! 🚨

#PyTexasConference2026 reopened submissions to give the #Python community a bit more breathing room — but only until Friday at 5pm CST. 👀 This is the final cutoff! 💛

Submit now: pytexas.org/2026





Show Original Post


08.12.2025 18:28
feed (@feed@feedsin.space)

PEP 816: WASI Support

This PEP outlines the expected support for WASI by CPython. It contains enough details to know what WASI and WASI SDK version is expected to be supported for any release of CPython while official WASI support is specified in PEP 11.

python




Show Original Post


08.12.2025 18:19
pythonjobsupport (@pythonjobsupport@mastodon.social)

Python Cheat sheet  

Python is a powerful, versatile, and beginner-friendly programming language used in automation, backend development, data ... source

quadexcel.com/wp/python-cheat-




Show Original Post


08.12.2025 17:43
mnvr (@mnvr@mastodon.social)

Day 8 - Finally got to use combinations(xs, 2)! Learnt so much from other folks' solutions (e.g did you know stdlib has Euclidean math.dist?)

Not the fastest (~270 ms), but loved the way it looks otherwise





Show Original Post


08.12.2025 17:43
NatuRandom (@NatuRandom@mastodon.social)

Pelegrina
PH Steve Wells

Idaho, United States

2017-04-27 20:17:00 UTC
inaturalist.org/observations/5

@Aleartory @PropPosters





Show Original Post


08.12.2025 16:23
papajohn (@papajohn@sfba.social)

Content warning:Advent of Code 2025 Day 8 Spoilers


There are two kinds of people today: people that know Kruskal's algorithm and people who don't.

If you do, it's pretty simple. Calculate all the distances (you don't even need sqrt since you just need to compare them), sort the pairs by distance, and add them one-by-one to the working set. I used union find to keep track of the connected components as I added edges. Once you've added 1000 edges, get the three biggest connected components and multiply their sizes together for Part 1. Keep adding until the number of non-connected components reaches 1, and then multiply the X coordinates of the last edge you added for Part 2.

If you don't, you probably eventually did something similar but it was a lot more painful. 🙃

Not my fastest solution, but still just over 500ms on my laptop, and the complexity of reducing it wasn't worth it.

#adventofcode #adventofcode2025 #python #minimumspanningtree #kruskalsalgorithm





Show Original Post


1 ...854 855 856 857 858 859 860 861 862 863 864 ...1571
UP