Check-in [a36d1b88b0]

Login
Home Timeline Branches Tags Help

Many hyperlinks are disabled.
Use anonymous login to enable hyperlinks.

Overview
Comment:One more editorial fix
Downloads: Tarball | ZIP archive
Timelines: family | ancestors | descendants | both | trunk
Files: files | file ages | folders
SHA3-256: a36d1b88b0ab628dedbaafba446f4b7f39d3a1710973fc834cfeb42e651700e3
User & Date: fvogel 2019-01-13 16:30:32.576
Context
2019-01-13
17:40
Update of TIP 532. check-in: 04480a5df1 user: gcramer tags: trunk
16:30
One more editorial fix check-in: a36d1b88b0 user: fvogel tags: trunk
16:27
Editorial fixes in TIP #532 (not finished - numbering still not fully OK) check-in: 73f04c8063 user: fvogel tags: trunk
Changes
Unified Diff Ignore Whitespace Patch
Changes to tip/532.md.
︙︙
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169


Please refer to the
[bug6e8afe516d](https://core.tcl-lang.org/tk/timeline?r=bug6e8afe516d)
branch of the core Tcl repository.

The event ring has been removed. Revised implementation is working with promoted
event bindings, and remembers the latest event per event type. This technique works
as if we have an inifinite event ring, so no overflow is possible.

Based on tests the performance in time is better than with legacy implementation. This
result is expected, because a triple-nested loop, executed for each incoming event, has
been changed to a quasi-double-nested loop (only in very seldom cases it is still
triple-nested). Furthermore the traversed lists are shorter than with legacy implementation,
because the event ring, always containing 30 items, has been eliminated. Only unbinding
a tag is a bit slower than before. Memory consumption did not change significantly.








|








155
156
157
158
159
160
161
162
163
164
165
166
167
168
169


Please refer to the
[bug6e8afe516d](https://core.tcl-lang.org/tk/timeline?r=bug6e8afe516d)
branch of the core Tcl repository.

The event ring has been removed. Revised implementation is working with promoted
event bindings, and remembers the latest event per event type. This technique works
as if we have an infinite event ring, so no overflow is possible.

Based on tests the performance in time is better than with legacy implementation. This
result is expected, because a triple-nested loop, executed for each incoming event, has
been changed to a quasi-double-nested loop (only in very seldom cases it is still
triple-nested). Furthermore the traversed lists are shorter than with legacy implementation,
because the event ring, always containing 30 items, has been eliminated. Only unbinding
a tag is a bit slower than before. Memory consumption did not change significantly.
︙︙