class_docstr: Class for storing a list of non-negative integers compactly.
  
  We store them as the smallest size integer array we can get
  away with. When we try to add an integer that is too large,
  we upgrade the array to the smallest word size needed to store
  the new value.
class_docstr_tok: ["Class","for","storing","a","list","of","non-negative","integers","compactly",".","We","store","them","as","the","smallest","size","integer","array","we","can","get","away","with",".","When","we","try","to","add","an","integer","that","is","too","large",",","we","upgrade","the","array","to","the","smallest","word","size","needed","to","store","the","new","value","."]
code: def __init__(self, values: Sequence[int] = ()):
      for code in ARRAY_CODES:
          try:
              underlying = array_or_list(code, values)
              break
          except OverflowError:
              pass
      else:  # pragma: no cover
          raise AssertionError(
              f"Could not create storage for {values!r}"
          )
      if isinstance(underlying, list):
          for v in underlying:
              if not isinstance(v, int) or v < 0:
                  raise ValueError(
                      f"Could not create IntList for {values!r}"
                  )
      self.__underlying = underlying
  
imports: import array
  import sys
  import warnings
  from random import Random
  from typing import Callable, Dict, Generic, Iterable, Iterator, List, Optional, Sequence, Tuple, TypeVar, Union, overload
  from hypothesis.errors import HypothesisWarning
label_desc: Use image node_id 1 to create a new IntList object from inherited base classes: Sequence with example: obj = IntList(values)