Emacs 26.1 was recently released. As you would expect from a major release, it comes with lots of new goodies. Being a bit of an Emacs Lisp enthusiast, the two most interesting new features are generators (iter) and native threads (thread). Correction: Generators were actually introduced in Emacs 25.1 (Sept. 2016), not Emacs 26.1. Doh! Update: ThreadSanitizer (TSan) quickly shows that Emacs’ threa
update 2014-01-16 ご指摘頂いたので修正しました。ありがとうございます！ @Jxck_ 動画すごくわかりやすかった！一個、重箱の隅っこなんだけど、convert関数のapplyしてるところ、fn.apply(fn, args) になってるけど fn.apply(this, args) が正しい気がしました！— Kazuhito Hokamura (@hokaccha) 2014, 1月 13 https://gist.github.com/Jxck/8380852 は修正済みです。動画の取り直しは勘弁して下さい(汗 - fn.apply(fn, args); + fn.apply(this, args); intro あけましておめでとうございます。 今年からはてなブログへ移行しました。 去年末くらいから流行っている Express の後継 Koa では JS の新機能ジェ
While you can optimize the heck out of your Python code with `generators` and `generator expressions` I'm more interested in goofing around and solving classic programming questions with the `yield` statement. **note:** For this article, since it's easier to explain things as they happen, I'll be including a lot of inline comments. Let's start with a simple function that returns a sequence of some
The document discusses Python generator functions and expressions, providing examples of how generator functions can be used to iteratively yield values like in a countdown, and how generator expressions are similar to list comprehensions but produce values iteratively instead of building a list. The document also discusses using generators to process data files like summing the bytes transferred
This is the second part of the talk I gave January 24, 2013 at the Ottawa Python Authors Group. Part One introduces Python iterables and iterators and generators. This part covers the advanced use of generators while building an interactive two-player network game. Generators in Depth Generators’ ability to accept as well as produce data is useful for many purposes. The interface to generator obje
This is part one of a talk I gave January 24, 2013 at the Ottawa Python Authors Group Part Two is now also available. Both parts of this presentation are also available as a single IPython Notebook which you can download and run locally, or view with nbviewer.ipython.org. The complete source is available at https://github.com/wardi/iterables-iterators-generators A Gentle Introduction The first few
Alex's Geekery Journal. This blog has been deprecated. Go here for the new /usr/sbin/blog In this post, I’m going to combine two of my favorite topics: recursion and Python’s generators. My aim is to address a real pain point in Python: its lack of tail call optimization. Let’s start with a simple countdown function that counts from start to 0 using recursion: Recursive Countdown
There are only slight differences in the two. You can use the dis module to examine this sort of thing for yourself. Edit: My first version decompiled the generator expression created at module-scope in the interactive prompt. That's slightly different from the OP's version with it used inside a function. I've modified this to match the actual case in the question. As you can see below, the "yield
342 機能強化したジェネレータによるコルーチン¶ PEP: 342 Title: Coroutines via Enhanced Generators Version: $Revision: 45616 $ Last-Modified: $Date: 2006-04-21 17:22:45 +0200 (Fri, 21 Apr 2006) $ Author: Guido van Rossum, Phillip J. Eby Status: Final Type: Standards Track Content-Type: text/plain Created: 10-May-2005 Post-History: はじめに¶ この PEP では単純なコルーチンとして使えるようにジェネレータの API と文法を強化するいくつかの提案をします。 内容は基本的に以下の二つの PEP のアイディア
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
hashbeat: No Use Case: Meshing Part 1 - Generators & Coroutines
hashbeat: No Use Case: Meshing Part 3 - Schedulers
hashbeat: No Use Case: Meshing Part 2 - Tasklets