suspect-devices/circuitpython/py/map.c, branch 2.2.4CircuitPython - a Python implementation for teaching coding with microcontrollershttps://git.suspectdevices.com/suspect-devices/circuitpython/atom?h=2.2.42017-07-31T08:35:40+00:00all: Use the name MicroPython consistently in comments2017-07-31T08:35:40+00:00Alexander Steffendevel.20.webmeister@spamgourmet.com2017-06-30T07:22:17+00:00urn:sha1:55f33240f3d7051d4213629e92437a36f1fac50e
There were several different spellings of MicroPython present in comments,
when there should be only one.
py/map: Fix bugs with deletion of elements from OrderedDict.2017-03-03T00:21:19+00:00Damien Georgedamien.p.george@gmail.com2017-03-03T00:21:19+00:00urn:sha1:9275c182708ae80ac62eaf0e4152df7b88163076
There were 2 bugs, now fixed by this patch:
- after deleting an element the len of the dict did not decrease by 1
- after deleting an element searching through the dict could lead to
a seg fault due to there being an MP_OBJ_SENTINEL in the ordered array
py/map: Change mp_uint_t to size_t where appropriate.2017-02-08T00:00:15+00:00Damien Georgedamien.p.george@gmail.com2017-02-08T00:00:15+00:00urn:sha1:af622eb2a6aa50429eb64716e754ee58c3f87c2e
The internal map/set functions now use size_t exclusively for computing
addresses. size_t is enough to reach all of available memory when
computing addresses so is the right type to use. In particular, for
nanbox builds it saves quite a bit of code size and RAM compared to the
original use of mp_uint_t (which is 64-bits on nanbox builds).
py: Declare constant data as properly constant.2016-05-20T11:46:20+00:00Damien Georgedamien.p.george@gmail.com2016-05-20T11:38:15+00:00urn:sha1:3ff16ff52e45d4c0bf1df5fa650b72d6d835451b
Otherwise some compilers (eg without optimisation) will put this read-only
data in RAM instead of ROM.
py/map: Change hash-table allocation policy to be less aggressive.2016-04-15T15:24:46+00:00Damien Georgedamien.p.george@gmail.com2016-04-15T15:24:46+00:00urn:sha1:00137b8c11eb94bbf97d5276d9c4e879ea75fb1d
Small hash tables (eg those used in user class instances that only have a
few members) now only use the minimum amount of memory necessary to hold
the key/value pairs. This can reduce performance for instances that have
many members (because then there are many reallocations/rehashings of the
table), but helps to conserve memory.
See issue #1760.
py/map: Prevent map resize failure from destroying map.2016-04-01T13:36:00+00:00Stephen Kylestephen.kyle@arm.com2016-04-01T09:51:40+00:00urn:sha1:b475327ffa24a95d9855b9ed38cdd8fe13487f4dpy/map: In map lookup, check for fixed map independent of ordered map.2015-12-31T00:24:33+00:00Damien Georgedamien.p.george@gmail.com2015-12-31T00:19:28+00:00urn:sha1:6dde019d933175b5c2608b8da2239846e1730838
It's possible to have a fixed map that is properly hashed (ie not
simply ordered).
py/map: Add fast-path for hashing of map index when it is a qstr.2015-12-26T21:15:47+00:00Damien Georgedamien.p.george@gmail.com2015-12-26T21:15:47+00:00urn:sha1:bbe8d51bd9ab0c848ee833000dcc93eb78bcbcad
Map indicies are most commonly a qstr, and adding a fast-path for hashing
of a qstr increases overall performance of the runtime.
On pyboard there is a 4% improvement in the pystone benchmark for a cost
of 20 bytes of code size. It's about a 2% improvement on unix.
py: Use MP_OBJ_NULL instead of NULL when appropriate.2015-11-20T14:09:20+00:00Damien Georgedamien.p.george@gmail.com2015-11-20T14:09:20+00:00urn:sha1:83229d3ffe5f8b6ba9c9f90e4ff0185dc0bab81bpy/map: Store key/value in earliest possible slot in hash table.2015-11-19T01:27:28+00:00Damien Georgedamien.p.george@gmail.com2015-11-19T01:27:28+00:00urn:sha1:593faf14c4700afd6c2ba6a281e7d48633e4d688
This change makes the code behave how it was supposed to work when first
written. The avail_slot variable is set to the first free slot when
looking for a key (which would come from deleting an entry). So it's
more efficient (for subsequent lookups) to insert a new key into such a
slot, rather than the very last slot that was searched.