Mailman 3 September 2024 - Python-list

Common objects for CLI commands with Typer
by Loris Bennett Oct. 16, 2024

Oct. 16, 2024

Hi, Apologies if the following description is to brief - I can expand if no one knows what I'm on about, but maybe a short description is enough. I am developing a command line application using Typer. Most commands need to do something in a database and also do LDAP stuff. Currently each command creates its own Database and LDAP objects, since each command forms an entry point to the program. With Typer, is there a way I can define the equivalent of class attributes at a single point which are then available to all commands? Cheers, Loris -- This signature is currently under constuction.

5 5

How to stop a specific thread in Python 2.7?
by marc nicole Oct. 11, 2024

Oct. 11, 2024

Hello guys, I want to know how to kill a specific running thread (say by its id) for now I run and kill a thread like the following: # start thread thread1 = threading.Thread(target= self.some_func(), args=( ...,), ) thread1.start() # kill the thread event_thread1 = threading.Event() event_thread1.set() I know that set() will kill all running threads, but if there was thread2 as well and I want to kill only thread1? Thanks!

4 8

Re: Beazley's Problem
by Annada Behera Oct. 6, 2024

Oct. 6, 2024

The "next-level math trick" Newton-Raphson has nothing to do with functional programming. I have written solvers in purely iterative style. As far as I know, Newton-Raphson is the opposite of functional programming as you iteratively solve for the root. Functional programming is stateless where you are not allowed to store any state (current best guess root). -----Original Message----- From: Paul Rubin <no.email(a)nospam.invalid> Subject: Re: Beazley's Problem Date: 09/22/2024 01:49:50 AM Newsgroups: comp.lang.python ram(a)zedat.fu-berlin.de (Stefan Ram) writes: > It's hella rad to see you bust out those "next-level math tricks" > with just a single line each! You might like: https://www.cs.kent.ac.uk/people/staff/dat/miranda/whyfp90.pdf The numerics stuff starts on page 9.

2 1

Help with Streaming and Chunk Processing for Large JSON Data (60 GB) from Kenna API
by Asif Ali Hirekumbi Oct. 3, 2024

Oct. 3, 2024

Dear Python Experts, I am working with the Kenna Application's API to retrieve vulnerability data. The API endpoint provides a single, massive JSON file in gzip format, approximately 60 GB in size. Handling such a large dataset in one go is proving to be quite challenging, especially in terms of memory management. I am looking for guidance on how to efficiently stream this data and process it in chunks using Python. Specifically, I am wondering if there’s a way to use the requests library or any other libraries that would allow us to pull data from the API endpoint in a memory-efficient manner. Here are the relevant API endpoints from Kenna: - Kenna API Documentation <https://apidocs.kennasecurity.com/reference/welcome> - Kenna Vulnerabilities Export <https://apidocs.kennasecurity.com/reference/retrieve-data-export> If anyone has experience with similar use cases or can offer any advice, it would be greatly appreciated. Thank you in advance for your help! Best regards Asif Ali

9 22

ANN: Python Meeting Düsseldorf - 02.10.2024
by eGenix Team Sept. 30, 2024

Sept. 30, 2024

/This announcement is in German since it targets a local user group//meeting in Düsseldorf, Germany/ Ankündigung Python Meeting Düsseldorf - Oktober 2024 <https://www.egenix.com/company/news/Python-Meeting-Duesseldorf-2024-10-02> Ein Treffen von Python Enthusiasten und Interessierten in ungezwungener Atmosphäre. *02.10.2024, 18:00 Uhr* Raum 1, 2.OG im Bürgerhaus Stadtteilzentrum Bilk <http://www.duesseldorf.de/jugendamt/fam/famfoe/bueh/ac/index.shtml> Düsseldorfer Arcaden <http://www.duesseldorf-arcaden.de/anfahrt.html>, Bachstr. 145, 40217 Düsseldorf <http://maps.google.com/maps?q=51.209169,6.775339&layer=c&sll=51.209353,6.77…> Programm Bereits angemeldete Vorträge: * Detlef Lannert: /*pyinfra als Alternative zu Ansible */ * Marc-André Lemburg: /*Rapid web app development with Panel */ * Detlef Lannert: /*Low-cost-Objekte als Alternativen zu Dictionaries? */ * Charlie Clark: /*Editieren von ZIP Dateien mit Python*/ Weitere Vorträge können gerne noch angemeldet werden. Bei Interesse, bitte unter info(a)pyddf.de melden. Startzeit und Ort Wir treffen uns um 18:00 Uhr im Bürgerhaus in den Düsseldorfer Arcaden. Das Bürgerhaus teilt sich den Eingang mit dem Schwimmbad und befindet sich an der Seite der Tiefgarageneinfahrt der Düsseldorfer Arcaden. Über dem Eingang steht ein großes "Schwimm’ in Bilk" Logo. Hinter der Tür direkt links zu den zwei Aufzügen, dann in den 2. Stock hochfahren. Der Eingang zum Raum 1 liegt direkt links, wenn man aus dem Aufzug kommt. >>> Eingang in Google Street View <http://bit.ly/11sCfiw> *⚠️ Wichtig*: Bitte nur dann anmelden, wenn ihr absolut sicher seid, dass ihr auch kommt. Angesichts der begrenzten Anzahl Plätze, haben wir kein Verständnis für kurzfristige Absagen oder No-Shows. Einleitung Das Python Meeting Düsseldorf <http://pyddf.de/> ist eine regelmäßige Veranstaltung in Düsseldorf, die sich an Python Begeisterte aus der Region wendet. Einen guten Überblick über die Vorträge bietet unser PyDDF YouTube-Kanal <http://www.youtube.com/pyddf/>, auf dem wir Videos der Vorträge nach den Meetings veröffentlichen. Veranstaltet wird das Meeting von der eGenix.com GmbH <https://www.egenix.com/>, Langenfeld, in Zusammenarbeit mit Clark Consulting & Research <http://www.clark-consulting.eu/>, Düsseldorf: Format Das Python Meeting Düsseldorf <http://pyddf.de/> nutzt eine Mischung aus (Lightning) Talks und offener Diskussion. Vorträge können vorher angemeldet werden, oder auch spontan während des Treffens eingebracht werden. Ein Beamer mit HDMI und FullHD Auflösung steht zur Verfügung. (Lightning) Talk Anmeldung bitte formlos per EMail an info(a)pyddf.de <mailto:info@pyddf.de?subject=Anmeldung Lightning Talk Python Meeting Düsseldorf> Kostenbeteiligung Das Python Meeting Düsseldorf <http://pyddf.de/> wird von Python Nutzern für Python Nutzer veranstaltet. Da Tagungsraum, Beamer, Internet und Getränke Kosten produzieren, bitten wir die Teilnehmer um einen Beitrag in Höhe von EUR 10,00 inkl. 19% Mwst. Schüler und Studenten zahlen EUR 5,00 inkl. 19% Mwst. Wir möchten alle Teilnehmer bitten, den Betrag in bar mitzubringen. Anmeldung Da wir nur 25 Personen in dem angemieteten Raum empfangen können, möchten wir bitten, sich vorher anzumelden. *Meeting Anmeldung* bitte per Meetup <https://www.meetup.com/Python-Meeting-Dusseldorf/> Weitere Informationen Weitere Informationen finden Sie auf der Webseite des Meetings: https://pyddf.de/ Viel Spaß ! -- Marc-Andre Lemburg eGenix.com Professional Python Services directly from the Experts (#1, Sep 30 2024) >>> Python Projects, Coaching and Support ... https://www.egenix.com/ >>> Python Product Development ... https://consulting.egenix.com/ ________________________________________________________________________ ::: We implement business ideas - efficiently in both time and costs ::: eGenix.com Software, Skills and Services GmbH Pastor-Loeh-Str.48 D-40764 Langenfeld, Germany. CEO Dipl.-Math. Marc-Andre Lemburg Registered at Amtsgericht Duesseldorf: HRB 46611 https://www.egenix.com/company/contact/ https://www.malemburg.com/

1 0

Re: Beazley's Problem
by Annada Behera Sept. 24, 2024

Sept. 24, 2024

-----Original Message----- From: Paul Rubin <no.email(a)nospam.invalid> Subject: Re: Beazley's Problem Date: 09/24/2024 05:52:27 AM Newsgroups: comp.lang.python >> def f_prime(x: float) -> float: >> return 2*x > >You might enjoy implementing that with automatic differentiation (not >to be confused with symbolic differentiation) instead. > >http://blog.sigfpe.com/2005/07/automatic-differentiation.html Before I knew automatic differentiation, I thought neural networks backpropagation was magic. Although coding up backward mode autodiff is little trickier than forward mode autodiff. (a) Forward-mode autodiff takes less space (just a dual component of every input variable) but needs more time to compute. For any function: f:R->R^m, forward mode can compute the derivates in O(m^0)=O(1) time, but O(m) time for f:R^m->R. (b) Reverse-mode autodiff requires you build a computation graph which takes space but is faster. For function: f:R^m->R, they can run in O(m^0)=O(1) time and vice versa ( O(m) time for f:R->R^m ). Almost all neural network training these days use reverse-mode autodiff.

1 0

Bug in 3.12.5
by Martin Nilsson Sept. 20, 2024

Sept. 20, 2024

Dear Sirs ! The attached program doesn’t work in 3.12.5, but in 3.9 it worked. Best Regards Martin Nilsson

2 1

Re: Bug in 3.12.5
by Keith Thompson Sept. 20, 2024

Sept. 20, 2024

Martin Nilsson <martin.nilsson4(a)skola.malmo.se> writes: > The attached program doesn’t work in 3.12.5, but in 3.9 it worked. Attachments don't show up either on the mailing list or the newsgroup. Try again with the program inline in your post (if it's not too long). -- Keith Thompson (The_Other_Keith) Keith.S.Thompson+u(a)gmail.com void Void(void) { Void(); } /* The recursive call of the void */

1 0

Re: Trouble with mocking
by Mark Bourne Sept. 20, 2024

Sept. 20, 2024

Norman Robins wrote: > I'm somewhat new to mocking for unit tests. > > I have some code like this: > > In foo/bar/baz.py I have 2 function I want to mock, one calls the other" > def function1_to_mock(): > . > . > . > > def function2_to_mock(): > function1_to_mock() > > In foo/bar/main.py I import 1 of these and call it" > from .baz import function2_to_mock > > def some_function(): > function1_to_mock() I'm assuming this is supposed to be calling `function2_to_mock`? (Otherwise the import should be for `function1_to_mock`, but then the fact `function2_to_mock` also calls `function1_to_mock` would be irrelevant) > . > . > . > > I want to mock both function1_to_mock and function2_to_mock > > In my test I do this: > > def function1_to_mock(kid): > return MOCKED_VALUE > > @pytest.fixture(autouse=True) > def mock_dependencies(): > with patch(foo.bar.baz.function1_to_mock') as mock_function1_to_mock, \ > patch('foo.bar.main.function2_to_mock') as mock_function2_to_mock: > mock_function2_to_mock.return_value = { > 'this': 'that > } > yield mock_function1_to_mock, mock_function2_to_mock > > def test_main(mock_dependencies): > some_function() > > When some_function is called the real function1_to_mock is called instead > of my mock. > > Can someone please let me know how to properly mock these 2 functions. > > Thanks! In `foo/bar/main.py`, the line: ``` from .baz import function2_to_mock ``` creates a reference named `function2_to_mock` in `main.py` referring to the method in `foo/bar/baz.py`. When you patch `foo.bar.baz.function2_to_mock`, you're patching the reference in `foo.bar.baz`, but the reference in `foo.bar.main` still refers to the original function object. There are at least a couple of ways around this. The way I prefer is to change `main.py` to import the `baz` module rather than just the function: ``` > from . import baz > > def some_function(): > baz.function2_to_mock() ``` Here, `main.py` has a reference to the `baz` module rather than the individual function object. It looks up `function2_to_mock` in `baz` just before calling it so, when the `baz` module is patched so that `baz.function2_to_mock` refers to a mock, the call in main.py` gets the mock and calls that rather than the original function. There no memory saving by importing just the functions you need from `baz` - the whole module is still loaded on import and remains in memory, it's just that `main` only gets a reference to the one function. The effect is similar to doing something like: ``` from . import baz function2_to_mock = baz.function2_to_mock del baz ``` ...including the fact that, after the import, the reference to `function2_to_mock` in `main` is just a copy of the reference in `baz`, hence not getting updated by the patch. The other way around it is to patch `main.function2_to_mock` instead of patching `foo.bar.baz.function2_to_mock`. See also the documentation under "where to patch" at <https://docs.python.org/3/library/unittest.mock.html#where-to-patch>. Note that, since you're patching `function2_to_mock`, you don't necessarily need to patch `function1_to_mock` as well. The mock of `function2_to_mock` won't call `function1_to_mock` (or its mock) regardless of whether `function1_to_mock` has been patched, unless you set the mock of `function2_to_mock` to do so. You don't necessarily need to patch `function1_to_mock`, unless of course there are other calls to it that you need to mock. -- Mark.

1 0

ANN: A new version (0.5.3) of python-gnupg has been released.
by Vinay Sajip Sept. 20, 2024

Sept. 20, 2024

What Changed?============= This is an enhancement and bug-fix release, and all users are encouraged to upgrade. Brief summary: - * Fix #117: Add WKD (Web Key Directory) support for auto-locating keys. Thanks to Myzel394 for the patch. * Fix #237: Ensure local variable is initialized even when an exception occurs. - * Fix #239: Remove logging of decryption result. This release [2] has been signed with my code signing key: Vinay Sajip (CODE SIGNING KEY) <vinay_sajip at yahoo.co.uk> Fingerprint: CA74 9061 914E AC13 8E66 EADB 9147 B477 339A 9B86 Recent changes to PyPI don't show the GPG signature with the download links. An alternative download source where the signatures are available is at [4]. The source code repository is at [1]. Documentation is available at [5]. As always, your feedback is most welcome (especially bug reports [3], patches and suggestions for improvement, or any other points via this group). Enjoy! Cheers Vinay Sajip [1] https://github.com/vsajip/python-gnupg [2] https://pypi.org/project/python-gnupg/0.5.3 [3] https://github.com/vsajip/python-gnupg/issues [4] https://github.com/vsajip/python-gnupg/releases/ [5] python-gnupg - A Python wrapper for GnuPG

1 0