CircuitPython - a Python implementation for teaching coding with microcontrollers https://git.suspectdevices.com/suspect-devices/circuitpython/atom?h=v1.9.3 2017-10-24T11:39:36+00:00 2017-10-24T11:39:36+00:00 Damien George damien.p.george@gmail.com 2017-10-24T11:39:36+00:00 urn:sha1:f4059dcc0c5251256a53fcb49f56fdda6e879341 This is the established way of doing it and reduces code size by a little bit. 2017-10-04T01:37:50+00:00 Damien George damien.p.george@gmail.com 2017-10-04T01:37:50+00:00 urn:sha1:a3dc1b1957d2c96d7c60c2c629c95077b03488a1 Header files that are considered internal to the py core and should not normally be included directly are: py/nlr.h - internal nlr configuration and declarations py/bc0.h - contains bytecode macro definitions py/runtime0.h - contains basic runtime enums Instead, the top-level header files to include are one of: py/obj.h - includes runtime0.h and defines everything to use the mp_obj_t type py/runtime.h - includes mpstate.h and hence nlr.h, obj.h, runtime0.h, and defines everything to use the general runtime support functions Additional, specific headers (eg py/objlist.h) can be included if needed. 2017-08-29T03:16:30+00:00 Damien George damien.p.george@gmail.com 2017-08-29T03:04:01+00:00 urn:sha1:58321dd9854d71a96e5db2d361e0efc05d9de8cf The unary-op/binary-op enums are already defined, and there are no arithmetic tricks used with these types, so it makes sense to use the correct enum type for arguments that take these values. It also reduces code size quite a bit for nan-boxing builds. 2017-03-29T15:18:35+00:00 Jan Pochyla jpochyla@gmail.com 2017-02-24T13:14:08+00:00 urn:sha1:e9d7c3ea0ef7b726b093b1abf9cece0c9146d635 Allows to get event time for a head item in the queue. The usecase if waiting for the next event *OR* I/O completion. I/O completion may happen before event triggers, and then wait should continue for the remaining event time (or I/O completion may schedule another earlier event altogether). The new function has a strongly provisional status - it may be converted to e.g. peek() function returning all of the event fields, not just time. 2017-03-07T08:34:09+00:00 Paul Sokolovsky pfalcon@users.sourceforge.net 2017-03-07T08:34:09+00:00 urn:sha1:830ce74f324d3a384e383e840de4ee229c41ba36 By adding back monotonically increasing field in addition to time field. As heapsort is not stable, without this, among entried added and readded at the same time instant, some might be always selected, and some might never be selected, leading to scheduling starvation. 2016-12-23T21:06:29+00:00 Paul Sokolovsky pfalcon@users.sourceforge.net 2016-12-23T21:06:29+00:00 urn:sha1:7327966da73b1c22d6658489c2a032932467e495 This fixes an obvious case of non-fair scheduling of 2 tasks with the same deadline. 2016-12-23T18:11:19+00:00 Paul Sokolovsky pfalcon@users.sourceforge.net 2016-12-23T18:08:08+00:00 urn:sha1:18f12caafc8b0f7d1681d0d2a20b6fec3be9bd84 2016-12-21T21:48:19+00:00 Paul Sokolovsky pfalcon@users.sourceforge.net 2016-12-21T21:48:19+00:00 urn:sha1:1b44987d0ca72fb877026fc96681f064c8fb2b2f 2016-12-21T21:29:32+00:00 Paul Sokolovsky pfalcon@users.sourceforge.net 2016-12-21T21:29:32+00:00 urn:sha1:d02f6a9956760425188f517f3708c76123e53d2a import utimeq, utime # Max queue size, the queue allocated statically on creation q = utimeq.utimeq(10) q.push(utime.ticks_ms(), data1, data2) res = [0, 0, 0] # Items in res are filled up with results q.pop(res) 2016-12-21T21:23:11+00:00 Paul Sokolovsky pfalcon@users.sourceforge.net 2016-12-21T21:23:11+00:00 urn:sha1:ef23399e32f03d251942b7a29c720a9cf72a1c26