Results of 1 - 10 of about 13 for heaps (0.008 sec.)
- heapq --- ヒープキューアルゴリズム — Python 3.14.8 ドキュメント 12739
- ナビゲーション 索引 モジュール | 次へ | 前へ | Python » 3.14.8 Documentation » The Python standard library » データ型 » heapq --- ヒープキューアルゴリズム テーマ 自動 ライト ダーク | heapq --- ヒープキューアルゴリズム ¶ ソースコード: Lib/he
...y このモジュールではヒープキューアルゴリズムの一実装を提供しています。優先度キューアルゴリズムとしても知られています。 Min-heaps are binary trees for which every parent node has a value less than or equal to any of its children. We refer to this condi...tion as the heap invariant. For min-heaps, this implementation uses lists for which heap[k] <= heap[2*k+1] and heap[k] <= heap[2*k+2] for all k for which the compar...e counted from zero. The interesting property of a min-heap is that its smallest element is always the root, heap[0] . Max-heaps satisfy the reverse invariant: every parent node has a value greater than any of its children. These are implemented as li... - https://man.mtool.work/python/3.14/library/heapq.html
- heapq --- ヒープキューアルゴリズム — Python 3.14.8 ドキュメント 12739
- ナビゲーション 索引 モジュール | 次へ | 前へ | Python » 3.14.8 Documentation » The Python standard library » データ型 » heapq --- ヒープキューアルゴリズム テーマ 自動 ライト ダーク | heapq --- ヒープキューアルゴリズム ¶ ソースコード: Lib/he
...y このモジュールではヒープキューアルゴリズムの一実装を提供しています。優先度キューアルゴリズムとしても知られています。 Min-heaps are binary trees for which every parent node has a value less than or equal to any of its children. We refer to this condi...tion as the heap invariant. For min-heaps, this implementation uses lists for which heap[k] <= heap[2*k+1] and heap[k] <= heap[2*k+2] for all k for which the compar...e counted from zero. The interesting property of a min-heap is that its smallest element is always the root, heap[0] . Max-heaps satisfy the reverse invariant: every parent node has a value greater than any of its children. These are implemented as li... - https://man.mtool.work/python/3.14/library/heapq.html
- Python support for free threading — Python 3.14.8 ドキュメント 9202
- ナビゲーション 索引 モジュール | 次へ | 前へ | Python » 3.14.8 Documentation » Python HOWTO » Python support for free threading テーマ 自動 ライト ダーク | Python support for free threading ¶ Starting with the 3.13 release, CPython has supp
...pects as well but can have some more overhead. In the free-threaded build, mimalloc manages memory in a number of separate heaps (currently four). For example, all GC supporting objects are allocated from their own heap. Using separate heaps means tha...t free memory in one heap cannot be used for an allocation that uses another heap. Also, some heaps are configured to use QSBR (quiescent-state based reclamation) when freeing the memory that backs up the heap (known as "p... - https://man.mtool.work/python/3.14/howto/free-threading-python.html
- Python support for free threading — Python 3.14.8 ドキュメント 9202
- ナビゲーション 索引 モジュール | 次へ | 前へ | Python » 3.14.8 Documentation » Python HOWTO » Python support for free threading テーマ 自動 ライト ダーク | Python support for free threading ¶ Starting with the 3.13 release, CPython has supp
...pects as well but can have some more overhead. In the free-threaded build, mimalloc manages memory in a number of separate heaps (currently four). For example, all GC supporting objects are allocated from their own heap. Using separate heaps means tha...t free memory in one heap cannot be used for an allocation that uses another heap. Also, some heaps are configured to use QSBR (quiescent-state based reclamation) when freeing the memory that backs up the heap (known as "p... - https://man.mtool.work/python/3.14/howto/free-threading-python.html
- What's new in Python 3.14 — Python 3.14.8 ドキュメント 8076
- ナビゲーション 索引 モジュール | 次へ | 前へ | Python » 3.14.8 Documentation » What's New in Python » What's new in Python 3.14 テーマ 自動 ライト ダーク | What's new in Python 3.14 ¶ エディタ : Adam Turner と Hugo van Kemenade この記事では
...collector is now incremental. This means that maximum pause times are reduced by an order of magnitude or more for larger heaps. There are now only two generations: young and old. When gc.collect() is not called directly, the GC is invoked a little l...ot started. (Contributed by Daniel Pope in gh-130914 .) heapq ¶ The heapq module has improved support for working with max-heaps, via the following new functions: heapify_max() heappush_max() heappop_max() heapreplace_max() heappushpop_max() hmac ¶ Ad...e new incremental garbage collector means that maximum pause times are reduced by an order of magnitude or more for larger heaps. Because of this optimization, the meaning of the results of get_threshold() and set_threshold() have changed, along with... - https://man.mtool.work/python/3.14/whatsnew/3.14.html
- What's new in Python 3.14 — Python 3.14.8 ドキュメント 8076
- ナビゲーション 索引 モジュール | 次へ | 前へ | Python » 3.14.8 Documentation » What's New in Python » What's new in Python 3.14 テーマ 自動 ライト ダーク | What's new in Python 3.14 ¶ エディタ : Adam Turner と Hugo van Kemenade この記事では
...collector is now incremental. This means that maximum pause times are reduced by an order of magnitude or more for larger heaps. There are now only two generations: young and old. When gc.collect() is not called directly, the GC is invoked a little l...ot started. (Contributed by Daniel Pope in gh-130914 .) heapq ¶ The heapq module has improved support for working with max-heaps, via the following new functions: heapify_max() heappush_max() heappop_max() heapreplace_max() heappushpop_max() hmac ¶ Ad...e new incremental garbage collector means that maximum pause times are reduced by an order of magnitude or more for larger heaps. Because of this optimization, the meaning of the results of get_threshold() and set_threshold() have changed, along with... - https://man.mtool.work/python/3.14/whatsnew/3.14.html
- メモリ管理 — Python 3.14.8 ドキュメント 7847
- ナビゲーション 索引 モジュール | 次へ | 前へ | Python » 3.14.8 Documentation » Python/C API reference manual » メモリ管理 テーマ 自動 ライト ダーク | メモリ管理 ¶ 概要 ¶ Python におけるメモリ管理には、全ての Python オブジェクトとデータ構造が
...オブジェクトを確保する時にだけ必要です。 In most situations, however, it is recommended to allocate memory from the Python heap specifically because the latter is under control of the Python memory manager. For example, this is required when the inter...PYMEM_DOMAIN_OBJ domains. It cannot be disabled in free-threaded builds. The free-threaded build uses per-thread mimalloc heaps, which allows allocation and deallocation to proceed without locking in most cases. In the default (non-free-threaded) bui... - https://man.mtool.work/python/3.14/c-api/memory.html
- メモリ管理 — Python 3.14.8 ドキュメント 7847
- ナビゲーション 索引 モジュール | 次へ | 前へ | Python » 3.14.8 Documentation » Python/C API reference manual » メモリ管理 テーマ 自動 ライト ダーク | メモリ管理 ¶ 概要 ¶ Python におけるメモリ管理には、全ての Python オブジェクトとデータ構造が
...オブジェクトを確保する時にだけ必要です。 In most situations, however, it is recommended to allocate memory from the Python heap specifically because the latter is under control of the Python memory manager. For example, this is required when the inter...PYMEM_DOMAIN_OBJ domains. It cannot be disabled in free-threaded builds. The free-threaded build uses per-thread mimalloc heaps, which allows allocation and deallocation to proceed without locking in most cases. In the default (non-free-threaded) bui... - https://man.mtool.work/python/3.14/c-api/memory.html
- turtle --- Turtle graphics — Python 3.14.8 ドキュメント 7724
- ナビゲーション 索引 モジュール | 次へ | 前へ | Python » 3.14.8 Documentation » The Python standard library » Graphical user interfaces with Tk » turtle --- Turtle graphics テーマ 自動 ライト ダーク | turtle --- Turtle graphics ¶ ソースコード
...l_hanoi ハノイの塔 Rectangular Turtles as Hanoi discs ( shape() , shapesize() ) nim play the classical nim game with three heaps of sticks against the computer. turtles as nimsticks, event driven (mouse, keyboard) paint 超極小主義的描画プログラム oncl... - https://man.mtool.work/python/3.14/library/turtle.html
- What's New in Python 2.4 — Python 3.14.8 ドキュメント 7724
- ナビゲーション 索引 モジュール | 次へ | 前へ | Python » 3.14.8 Documentation » What's New in Python » What's New in Python 2.4 テーマ 自動 ライト ダーク | What's New in Python 2.4 ¶ 著者 : A.M. Kuchling この文書は 2005 年 3 月 30 日にリリー
...table for handling high volumes of data. In addition, the module has two new functions nlargest() and nsmallest() that use heaps to find the N largest or smallest values in a dataset without the expense of a full sort. (Contributed by Raymond Hettinge... - https://man.mtool.work/python/3.14/whatsnew/2.4.html