[2] | 1 | .. highlightlang:: c
|
---|
| 2 |
|
---|
| 3 | .. _dictobjects:
|
---|
| 4 |
|
---|
| 5 | Dictionary Objects
|
---|
| 6 | ------------------
|
---|
| 7 |
|
---|
| 8 | .. index:: object: dictionary
|
---|
| 9 |
|
---|
| 10 |
|
---|
[391] | 11 | .. c:type:: PyDictObject
|
---|
[2] | 12 |
|
---|
[391] | 13 | This subtype of :c:type:`PyObject` represents a Python dictionary object.
|
---|
[2] | 14 |
|
---|
| 15 |
|
---|
[391] | 16 | .. c:var:: PyTypeObject PyDict_Type
|
---|
[2] | 17 |
|
---|
| 18 | .. index::
|
---|
| 19 | single: DictType (in module types)
|
---|
| 20 | single: DictionaryType (in module types)
|
---|
| 21 |
|
---|
[391] | 22 | This instance of :c:type:`PyTypeObject` represents the Python dictionary
|
---|
[2] | 23 | type. This is exposed to Python programs as ``dict`` and
|
---|
| 24 | ``types.DictType``.
|
---|
| 25 |
|
---|
| 26 |
|
---|
[391] | 27 | .. c:function:: int PyDict_Check(PyObject *p)
|
---|
[2] | 28 |
|
---|
| 29 | Return true if *p* is a dict object or an instance of a subtype of the dict
|
---|
| 30 | type.
|
---|
| 31 |
|
---|
| 32 | .. versionchanged:: 2.2
|
---|
| 33 | Allowed subtypes to be accepted.
|
---|
| 34 |
|
---|
| 35 |
|
---|
[391] | 36 | .. c:function:: int PyDict_CheckExact(PyObject *p)
|
---|
[2] | 37 |
|
---|
| 38 | Return true if *p* is a dict object, but not an instance of a subtype of
|
---|
| 39 | the dict type.
|
---|
| 40 |
|
---|
| 41 | .. versionadded:: 2.4
|
---|
| 42 |
|
---|
| 43 |
|
---|
[391] | 44 | .. c:function:: PyObject* PyDict_New()
|
---|
[2] | 45 |
|
---|
| 46 | Return a new empty dictionary, or *NULL* on failure.
|
---|
| 47 |
|
---|
| 48 |
|
---|
[391] | 49 | .. c:function:: PyObject* PyDictProxy_New(PyObject *dict)
|
---|
[2] | 50 |
|
---|
| 51 | Return a proxy object for a mapping which enforces read-only behavior.
|
---|
| 52 | This is normally used to create a proxy to prevent modification of the
|
---|
| 53 | dictionary for non-dynamic class types.
|
---|
| 54 |
|
---|
| 55 | .. versionadded:: 2.2
|
---|
| 56 |
|
---|
| 57 |
|
---|
[391] | 58 | .. c:function:: void PyDict_Clear(PyObject *p)
|
---|
[2] | 59 |
|
---|
| 60 | Empty an existing dictionary of all key-value pairs.
|
---|
| 61 |
|
---|
| 62 |
|
---|
[391] | 63 | .. c:function:: int PyDict_Contains(PyObject *p, PyObject *key)
|
---|
[2] | 64 |
|
---|
| 65 | Determine if dictionary *p* contains *key*. If an item in *p* is matches
|
---|
| 66 | *key*, return ``1``, otherwise return ``0``. On error, return ``-1``.
|
---|
| 67 | This is equivalent to the Python expression ``key in p``.
|
---|
| 68 |
|
---|
| 69 | .. versionadded:: 2.4
|
---|
| 70 |
|
---|
| 71 |
|
---|
[391] | 72 | .. c:function:: PyObject* PyDict_Copy(PyObject *p)
|
---|
[2] | 73 |
|
---|
| 74 | Return a new dictionary that contains the same key-value pairs as *p*.
|
---|
| 75 |
|
---|
| 76 | .. versionadded:: 1.6
|
---|
| 77 |
|
---|
| 78 |
|
---|
[391] | 79 | .. c:function:: int PyDict_SetItem(PyObject *p, PyObject *key, PyObject *val)
|
---|
[2] | 80 |
|
---|
| 81 | Insert *value* into the dictionary *p* with a key of *key*. *key* must be
|
---|
| 82 | :term:`hashable`; if it isn't, :exc:`TypeError` will be raised. Return
|
---|
| 83 | ``0`` on success or ``-1`` on failure.
|
---|
| 84 |
|
---|
| 85 |
|
---|
[391] | 86 | .. c:function:: int PyDict_SetItemString(PyObject *p, const char *key, PyObject *val)
|
---|
[2] | 87 |
|
---|
| 88 | .. index:: single: PyString_FromString()
|
---|
| 89 |
|
---|
| 90 | Insert *value* into the dictionary *p* using *key* as a key. *key* should
|
---|
[391] | 91 | be a :c:type:`char\*`. The key object is created using
|
---|
[2] | 92 | ``PyString_FromString(key)``. Return ``0`` on success or ``-1`` on
|
---|
| 93 | failure.
|
---|
| 94 |
|
---|
| 95 |
|
---|
[391] | 96 | .. c:function:: int PyDict_DelItem(PyObject *p, PyObject *key)
|
---|
[2] | 97 |
|
---|
| 98 | Remove the entry in dictionary *p* with key *key*. *key* must be hashable;
|
---|
| 99 | if it isn't, :exc:`TypeError` is raised. Return ``0`` on success or ``-1``
|
---|
| 100 | on failure.
|
---|
| 101 |
|
---|
| 102 |
|
---|
[391] | 103 | .. c:function:: int PyDict_DelItemString(PyObject *p, char *key)
|
---|
[2] | 104 |
|
---|
| 105 | Remove the entry in dictionary *p* which has a key specified by the string
|
---|
| 106 | *key*. Return ``0`` on success or ``-1`` on failure.
|
---|
| 107 |
|
---|
| 108 |
|
---|
[391] | 109 | .. c:function:: PyObject* PyDict_GetItem(PyObject *p, PyObject *key)
|
---|
[2] | 110 |
|
---|
| 111 | Return the object from dictionary *p* which has a key *key*. Return *NULL*
|
---|
| 112 | if the key *key* is not present, but *without* setting an exception.
|
---|
| 113 |
|
---|
| 114 |
|
---|
[391] | 115 | .. c:function:: PyObject* PyDict_GetItemString(PyObject *p, const char *key)
|
---|
[2] | 116 |
|
---|
[391] | 117 | This is the same as :c:func:`PyDict_GetItem`, but *key* is specified as a
|
---|
| 118 | :c:type:`char\*`, rather than a :c:type:`PyObject\*`.
|
---|
[2] | 119 |
|
---|
| 120 |
|
---|
[391] | 121 | .. c:function:: PyObject* PyDict_Items(PyObject *p)
|
---|
[2] | 122 |
|
---|
[391] | 123 | Return a :c:type:`PyListObject` containing all the items from the
|
---|
[2] | 124 | dictionary, as in the dictionary method :meth:`dict.items`.
|
---|
| 125 |
|
---|
| 126 |
|
---|
[391] | 127 | .. c:function:: PyObject* PyDict_Keys(PyObject *p)
|
---|
[2] | 128 |
|
---|
[391] | 129 | Return a :c:type:`PyListObject` containing all the keys from the dictionary,
|
---|
[2] | 130 | as in the dictionary method :meth:`dict.keys`.
|
---|
| 131 |
|
---|
| 132 |
|
---|
[391] | 133 | .. c:function:: PyObject* PyDict_Values(PyObject *p)
|
---|
[2] | 134 |
|
---|
[391] | 135 | Return a :c:type:`PyListObject` containing all the values from the
|
---|
[2] | 136 | dictionary *p*, as in the dictionary method :meth:`dict.values`.
|
---|
| 137 |
|
---|
| 138 |
|
---|
[391] | 139 | .. c:function:: Py_ssize_t PyDict_Size(PyObject *p)
|
---|
[2] | 140 |
|
---|
| 141 | .. index:: builtin: len
|
---|
| 142 |
|
---|
| 143 | Return the number of items in the dictionary. This is equivalent to
|
---|
| 144 | ``len(p)`` on a dictionary.
|
---|
| 145 |
|
---|
| 146 | .. versionchanged:: 2.5
|
---|
[391] | 147 | This function returned an :c:type:`int` type. This might require changes
|
---|
[2] | 148 | in your code for properly supporting 64-bit systems.
|
---|
| 149 |
|
---|
| 150 |
|
---|
[391] | 151 | .. c:function:: int PyDict_Next(PyObject *p, Py_ssize_t *ppos, PyObject **pkey, PyObject **pvalue)
|
---|
[2] | 152 |
|
---|
| 153 | Iterate over all key-value pairs in the dictionary *p*. The
|
---|
[391] | 154 | :c:type:`Py_ssize_t` referred to by *ppos* must be initialized to ``0``
|
---|
[2] | 155 | prior to the first call to this function to start the iteration; the
|
---|
| 156 | function returns true for each pair in the dictionary, and false once all
|
---|
| 157 | pairs have been reported. The parameters *pkey* and *pvalue* should either
|
---|
[391] | 158 | point to :c:type:`PyObject\*` variables that will be filled in with each key
|
---|
[2] | 159 | and value, respectively, or may be *NULL*. Any references returned through
|
---|
| 160 | them are borrowed. *ppos* should not be altered during iteration. Its
|
---|
| 161 | value represents offsets within the internal dictionary structure, and
|
---|
| 162 | since the structure is sparse, the offsets are not consecutive.
|
---|
| 163 |
|
---|
| 164 | For example::
|
---|
| 165 |
|
---|
| 166 | PyObject *key, *value;
|
---|
| 167 | Py_ssize_t pos = 0;
|
---|
| 168 |
|
---|
| 169 | while (PyDict_Next(self->dict, &pos, &key, &value)) {
|
---|
| 170 | /* do something interesting with the values... */
|
---|
| 171 | ...
|
---|
| 172 | }
|
---|
| 173 |
|
---|
| 174 | The dictionary *p* should not be mutated during iteration. It is safe
|
---|
| 175 | (since Python 2.1) to modify the values of the keys as you iterate over the
|
---|
| 176 | dictionary, but only so long as the set of keys does not change. For
|
---|
| 177 | example::
|
---|
| 178 |
|
---|
| 179 | PyObject *key, *value;
|
---|
| 180 | Py_ssize_t pos = 0;
|
---|
| 181 |
|
---|
| 182 | while (PyDict_Next(self->dict, &pos, &key, &value)) {
|
---|
| 183 | int i = PyInt_AS_LONG(value) + 1;
|
---|
| 184 | PyObject *o = PyInt_FromLong(i);
|
---|
| 185 | if (o == NULL)
|
---|
| 186 | return -1;
|
---|
| 187 | if (PyDict_SetItem(self->dict, key, o) < 0) {
|
---|
| 188 | Py_DECREF(o);
|
---|
| 189 | return -1;
|
---|
| 190 | }
|
---|
| 191 | Py_DECREF(o);
|
---|
| 192 | }
|
---|
| 193 |
|
---|
| 194 | .. versionchanged:: 2.5
|
---|
[391] | 195 | This function used an :c:type:`int *` type for *ppos*. This might require
|
---|
[2] | 196 | changes in your code for properly supporting 64-bit systems.
|
---|
| 197 |
|
---|
| 198 |
|
---|
[391] | 199 | .. c:function:: int PyDict_Merge(PyObject *a, PyObject *b, int override)
|
---|
[2] | 200 |
|
---|
| 201 | Iterate over mapping object *b* adding key-value pairs to dictionary *a*.
|
---|
[391] | 202 | *b* may be a dictionary, or any object supporting :c:func:`PyMapping_Keys`
|
---|
| 203 | and :c:func:`PyObject_GetItem`. If *override* is true, existing pairs in *a*
|
---|
[2] | 204 | will be replaced if a matching key is found in *b*, otherwise pairs will
|
---|
| 205 | only be added if there is not a matching key in *a*. Return ``0`` on
|
---|
| 206 | success or ``-1`` if an exception was raised.
|
---|
| 207 |
|
---|
| 208 | .. versionadded:: 2.2
|
---|
| 209 |
|
---|
| 210 |
|
---|
[391] | 211 | .. c:function:: int PyDict_Update(PyObject *a, PyObject *b)
|
---|
[2] | 212 |
|
---|
| 213 | This is the same as ``PyDict_Merge(a, b, 1)`` in C, or ``a.update(b)`` in
|
---|
| 214 | Python. Return ``0`` on success or ``-1`` if an exception was raised.
|
---|
| 215 |
|
---|
| 216 | .. versionadded:: 2.2
|
---|
| 217 |
|
---|
| 218 |
|
---|
[391] | 219 | .. c:function:: int PyDict_MergeFromSeq2(PyObject *a, PyObject *seq2, int override)
|
---|
[2] | 220 |
|
---|
| 221 | Update or merge into dictionary *a*, from the key-value pairs in *seq2*.
|
---|
| 222 | *seq2* must be an iterable object producing iterable objects of length 2,
|
---|
| 223 | viewed as key-value pairs. In case of duplicate keys, the last wins if
|
---|
| 224 | *override* is true, else the first wins. Return ``0`` on success or ``-1``
|
---|
| 225 | if an exception was raised. Equivalent Python (except for the return
|
---|
| 226 | value)::
|
---|
| 227 |
|
---|
| 228 | def PyDict_MergeFromSeq2(a, seq2, override):
|
---|
| 229 | for key, value in seq2:
|
---|
| 230 | if override or key not in a:
|
---|
| 231 | a[key] = value
|
---|
| 232 |
|
---|
| 233 | .. versionadded:: 2.2
|
---|