micropython/py/mpqstrraw.h

// All the qstr definitions in this file are available as constants.
// That is, they are in ROM and you can reference them simple as MP_QSTR_xxxx.

Q(__build_class__)
Q(__class__)
Q(__doc__)
Q(__init__)
Q(__locals__)
Q(__main__)
Q(__module__)
Q(__name__)
Q(__next__)
Q(__qualname__)
Q(__repl_print__)

Q(assertion_error)
Q(micropython)
Q(byte_code)
Q(native)
Q(viper)
Q(asm_thumb)

Q(Ellipsis)
Q(StopIteration)

Q(AttributeError)
Q(IndexError)
Q(KeyError)
Q(NameError)
Q(TypeError)
Q(SyntaxError)
Q(ValueError)

Q(abs)
Q(all)
Q(any)
Q(bool)
Q(callable)
Q(chr)
Q(complex)
Q(dict)
Q(divmod)
Q(float)
Q(hash)
Q(int)
Q(iter)
Q(len)
Q(list)
Q(max)
Q(min)
Q(next)
Q(ord)
Q(pow)
Q(print)
Q(range)
Q(set)
Q(sum)
Q(type)

Q(append)
Q(pop)
Q(sort)
Q(join)
Q(format)
Split qstr into pools, and put initial pool in ROM. Qstr's are now split into a linked-list of qstr pools. This has 2 benefits: the first pool can be in ROM (huge benefit, since we no longer use RAM for the core qstrs), and subsequent pools use m_new for the next pool instead of m_renew (thus avoiding a huge single table for all the qstrs). Still would be better to use a hash table, but this scheme takes us part of the way (eventually convert the pools to hash tables). Also fixed bug with import. Also improved the way the module code is referenced (not magic number 1 anymore). 2014-01-04 15:57:35 +00:00			`// All the qstr definitions in this file are available as constants.`
			`// That is, they are in ROM and you can reference them simple as MP_QSTR_xxxx.`

			`Q(__build_class__)`
			`Q(__class__)`
			`Q(__doc__)`
			`Q(__init__)`
			`Q(__locals__)`
			`Q(__main__)`
			`Q(__module__)`
			`Q(__name__)`
			`Q(__next__)`
			`Q(__qualname__)`
			`Q(__repl_print__)`

			`Q(assertion_error)`
			`Q(micropython)`
			`Q(byte_code)`
			`Q(native)`
			`Q(viper)`
			`Q(asm_thumb)`

Add ellipsis object. 2014-01-04 18:44:46 +00:00			`Q(Ellipsis)`
Split qstr into pools, and put initial pool in ROM. Qstr's are now split into a linked-list of qstr pools. This has 2 benefits: the first pool can be in ROM (huge benefit, since we no longer use RAM for the core qstrs), and subsequent pools use m_new for the next pool instead of m_renew (thus avoiding a huge single table for all the qstrs). Still would be better to use a hash table, but this scheme takes us part of the way (eventually convert the pools to hash tables). Also fixed bug with import. Also improved the way the module code is referenced (not magic number 1 anymore). 2014-01-04 15:57:35 +00:00			`Q(StopIteration)`

			`Q(AttributeError)`
			`Q(IndexError)`
			`Q(KeyError)`
			`Q(NameError)`
			`Q(TypeError)`
			`Q(SyntaxError)`
			`Q(ValueError)`

			`Q(abs)`
			`Q(all)`
			`Q(any)`
			`Q(bool)`
			`Q(callable)`
			`Q(chr)`
			`Q(complex)`
			`Q(dict)`
			`Q(divmod)`
			`Q(float)`
			`Q(hash)`
			`Q(int)`
			`Q(iter)`
			`Q(len)`
			`Q(list)`
			`Q(max)`
			`Q(min)`
			`Q(next)`
			`Q(ord)`
			`Q(pow)`
			`Q(print)`
			`Q(range)`
			`Q(set)`
			`Q(sum)`
			`Q(type)`

			`Q(append)`
			`Q(pop)`
			`Q(sort)`
			`Q(join)`
			`Q(format)`