{
    "mode": "pydoc",
    "parameter": "xxsubtype",
    "section": "",
    "url": "https://www.chedong.com/phpMan.php/pydoc/xxsubtype/json",
    "generated": "2026-06-02T14:27:22Z",
    "sections": {
        "NAME": {
            "content": "xxsubtype\n",
            "subsections": []
        },
        "DESCRIPTION": {
            "content": "xxsubtype is an example module showing how to subtype builtin types from C.\ntestdescr.py in the standard test suite requires it in order to complete.\nIf you don't care about the examples, and don't intend to run the Python\ntest suite, you can recompile Python without Modules/xxsubtype.c.\n",
            "subsections": []
        },
        "CLASSES": {
            "content": "builtins.dict(builtins.object)\nspamdict\nbuiltins.list(builtins.object)\nspamlist\n",
            "subsections": [
                {
                    "name": "class spamdict",
                    "content": "|  Method resolution order:\n|      spamdict\n|      builtins.dict\n|      builtins.object\n|\n|  Methods defined here:\n|\n|  init(self, /, *args, kwargs)\n|      Initialize self.  See help(type(self)) for accurate signature.\n|\n|  getstate(...)\n|      getstate() -> state\n|\n|  setstate(...)\n|      setstate(state)\n|\n|  ----------------------------------------------------------------------\n|  Data descriptors defined here:\n|\n|  state\n|      an int variable for demonstration purposes\n|\n|  ----------------------------------------------------------------------\n|  Methods inherited from builtins.dict:\n|\n|  contains(self, key, /)\n|      True if the dictionary has the specified key, else False.\n|\n|  delitem(self, key, /)\n|      Delete self[key].\n|\n|  eq(self, value, /)\n|      Return self==value.\n|\n|  ge(self, value, /)\n|      Return self>=value.\n|\n|  getattribute(self, name, /)\n|      Return getattr(self, name).\n|\n|  getitem(...)\n|      x.getitem(y) <==> x[y]\n|\n|  gt(self, value, /)\n|      Return self>value.\n|\n|  ior(self, value, /)\n|      Return self|=value.\n|\n|  iter(self, /)\n|      Implement iter(self).\n|\n|  le(self, value, /)\n|      Return self<=value.\n|\n|  len(self, /)\n|      Return len(self).\n|\n|  lt(self, value, /)\n|      Return self<value.\n|\n|  ne(self, value, /)\n|      Return self!=value.\n|\n|  or(self, value, /)\n|      Return self|value.\n|\n|  repr(self, /)\n|      Return repr(self).\n|\n|  reversed(self, /)\n|      Return a reverse iterator over the dict keys.\n|\n|  ror(self, value, /)\n|      Return value|self.\n|\n|  setitem(self, key, value, /)\n|      Set self[key] to value.\n|\n|  sizeof(...)\n|      D.sizeof() -> size of D in memory, in bytes\n|\n|  clear(...)\n|      D.clear() -> None.  Remove all items from D.\n|\n|  copy(...)\n|      D.copy() -> a shallow copy of D\n|\n|  get(self, key, default=None, /)\n|      Return the value for key if key is in the dictionary, else default.\n|\n|  items(...)\n|      D.items() -> a set-like object providing a view on D's items\n|\n|  keys(...)\n|      D.keys() -> a set-like object providing a view on D's keys\n|\n|  pop(...)\n|      D.pop(k[,d]) -> v, remove specified key and return the corresponding value.\n|\n|      If the key is not found, return the default if given; otherwise,\n|      raise a KeyError.\n|\n|  popitem(self, /)\n|      Remove and return a (key, value) pair as a 2-tuple.\n|\n|      Pairs are returned in LIFO (last-in, first-out) order.\n|      Raises KeyError if the dict is empty.\n|\n|  setdefault(self, key, default=None, /)\n|      Insert key with a value of default if key is not in the dictionary.\n|\n|      Return the value for key if key is in the dictionary, else default.\n|\n|  update(...)\n|      D.update([E, ]F) -> None.  Update D from dict/iterable E and F.\n|      If E is present and has a .keys() method, then does:  for k in E: D[k] = E[k]\n|      If E is present and lacks a .keys() method, then does:  for k, v in E: D[k] = v\n|      In either case, this is followed by: for k in F:  D[k] = F[k]\n|\n|  values(...)\n|      D.values() -> an object providing a view on D's values\n|\n|  ----------------------------------------------------------------------\n|  Class methods inherited from builtins.dict:\n|\n|  classgetitem(...) from builtins.type\n|      See PEP 585\n|\n|  fromkeys(iterable, value=None, /) from builtins.type\n|      Create a new dictionary with keys from iterable and values set to value.\n|\n|  ----------------------------------------------------------------------\n|  Static methods inherited from builtins.dict:\n|\n|  new(*args, kwargs) from builtins.type\n|      Create and return a new object.  See help(type) for accurate signature.\n|\n|  ----------------------------------------------------------------------\n|  Data and other attributes inherited from builtins.dict:\n|\n|  hash = None\n"
                },
                {
                    "name": "class spamlist",
                    "content": "|  spamlist(iterable=(), /)\n|\n|  Method resolution order:\n|      spamlist\n|      builtins.list\n|      builtins.object\n|\n|  Methods defined here:\n|\n|  init(self, /, *args, kwargs)\n|      Initialize self.  See help(type(self)) for accurate signature.\n|\n|  getstate(...)\n|      getstate() -> state\n|\n|  setstate(...)\n|      setstate(state)\n|\n|  ----------------------------------------------------------------------\n|  Class methods defined here:\n|\n|  classmeth(...) from builtins.type\n|      classmeth(*args, kw)\n|\n|  ----------------------------------------------------------------------\n|  Static methods defined here:\n|\n|  staticmeth(...)\n|      staticmeth(*args, kw)\n|\n|  ----------------------------------------------------------------------\n|  Data descriptors defined here:\n|\n|  state\n|      an int variable for demonstration purposes\n|\n|  ----------------------------------------------------------------------\n|  Methods inherited from builtins.list:\n|\n|  add(self, value, /)\n|      Return self+value.\n|\n|  contains(self, key, /)\n|      Return key in self.\n|\n|  delitem(self, key, /)\n|      Delete self[key].\n|\n|  eq(self, value, /)\n|      Return self==value.\n|\n|  ge(self, value, /)\n|      Return self>=value.\n|\n|  getattribute(self, name, /)\n|      Return getattr(self, name).\n|\n|  getitem(...)\n|      x.getitem(y) <==> x[y]\n|\n|  gt(self, value, /)\n|      Return self>value.\n|\n|  iadd(self, value, /)\n|      Implement self+=value.\n|\n|  imul(self, value, /)\n|      Implement self*=value.\n|\n|  iter(self, /)\n|      Implement iter(self).\n|\n|  le(self, value, /)\n|      Return self<=value.\n|\n|  len(self, /)\n|      Return len(self).\n|\n|  lt(self, value, /)\n|      Return self<value.\n|\n|  mul(self, value, /)\n|      Return self*value.\n|\n|  ne(self, value, /)\n|      Return self!=value.\n|\n|  repr(self, /)\n|      Return repr(self).\n|\n|  reversed(self, /)\n|      Return a reverse iterator over the list.\n|\n|  rmul(self, value, /)\n|      Return value*self.\n|\n|  setitem(self, key, value, /)\n|      Set self[key] to value.\n|\n|  sizeof(self, /)\n|      Return the size of the list in memory, in bytes.\n|\n|  append(self, object, /)\n|      Append object to the end of the list.\n|\n|  clear(self, /)\n|      Remove all items from list.\n|\n|  copy(self, /)\n|      Return a shallow copy of the list.\n|\n|  count(self, value, /)\n|      Return number of occurrences of value.\n|\n|  extend(self, iterable, /)\n|      Extend list by appending elements from the iterable.\n|\n|  index(self, value, start=0, stop=9223372036854775807, /)\n|      Return first index of value.\n|\n|      Raises ValueError if the value is not present.\n|\n|  insert(self, index, object, /)\n|      Insert object before index.\n|\n|  pop(self, index=-1, /)\n|      Remove and return item at index (default last).\n|\n|      Raises IndexError if list is empty or index is out of range.\n|\n|  remove(self, value, /)\n|      Remove first occurrence of value.\n|\n|      Raises ValueError if the value is not present.\n|\n|  reverse(self, /)\n|      Reverse *IN PLACE*.\n|\n|  sort(self, /, *, key=None, reverse=False)\n|      Sort the list in ascending order and return None.\n|\n|      The sort is in-place (i.e. the list itself is modified) and stable (i.e. the\n|      order of two equal elements is maintained).\n|\n|      If a key function is given, apply it once to each list item and sort them,\n|      ascending or descending, according to their function values.\n|\n|      The reverse flag can be set to sort in descending order.\n|\n|  ----------------------------------------------------------------------\n|  Class methods inherited from builtins.list:\n|\n|  classgetitem(...) from builtins.type\n|      See PEP 585\n|\n|  ----------------------------------------------------------------------\n|  Static methods inherited from builtins.list:\n|\n|  new(*args, kwargs) from builtins.type\n|      Create and return a new object.  See help(type) for accurate signature.\n|\n|  ----------------------------------------------------------------------\n|  Data and other attributes inherited from builtins.list:\n|\n|  hash = None\n"
                }
            ]
        },
        "FUNCTIONS": {
            "content": "",
            "subsections": [
                {
                    "name": "bench",
                    "content": ""
                }
            ]
        },
        "FILE": {
            "content": "(built-in)\n\n",
            "subsections": []
        }
    },
    "summary": "xxsubtype",
    "flags": [],
    "examples": [],
    "see_also": []
}