class_docstr: Sorted values view is a dynamic view of the sorted dict's values.
  
  When the sorted dict's values change, the view reflects those changes.
  
  The values view implements the sequence abstract base class.
class_docstr_tok: ["Sorted","values","view","is","a","dynamic","view","of","the","sorted","dict","'s","values",".","When","the","sorted","dict","'s","values","change",",","the","view","reflects","those","changes",".","The","values","view","implements","the","sequence","abstract","base","class","."]
docstr: Lookup value at `index` in sorted values view.
  
  ``siv.__getitem__(index)`` <==> ``siv[index]``
  
  Supports slicing.
  
  Runtime complexity: `O(log(n))` -- approximate.
  
  >>> sd = SortedDict({'a': 1, 'b': 2, 'c': 3})
  >>> svv = sd.values()
  >>> svv[0]
  1
  >>> svv[-1]
  3
  >>> svv[:]
  [1, 2, 3]
  >>> svv[100]
  Traceback (most recent call last):
    ...
  IndexError: list index out of range
  
  :param index: integer or slice for indexing
  :return: value or list of values
  :raises IndexError: if index out of range
docstr_tok: ["Lookup","value","at","`","index","`","in","sorted","values","view",".","``","siv.__getitem__","(","index",")","``","<","==",">","``","siv","[","index","]","``","Supports","slicing",".","Runtime","complexity",":","`","O","(","log","(","n",")",")","`","--","approximate",".",">",">",">","sd","=","SortedDict","(","{","'","a","'",":","1",",","'","b","'",":","2",",","'","c","'",":","3","}",")",">",">",">","svv","=","sd.values","(",")",">",">",">","svv","[","0","]","1",">",">",">","svv","[","-1","]","3",">",">",">","svv","[",":","]","[","1",",","2",",","3","]",">",">",">","svv","[","100","]","Traceback","(","most","recent","call","last",")",":","...","IndexError",":","list","index","out","of","range",":","param","index",":","integer","or","slice","for","indexing",":","return",":","value","or","list","of","values",":","raises","IndexError",":","if","index","out","of","range"]
code: def __getitem__(self, index):
      """Lookup value at `index` in sorted values view.
  
      ``siv.__getitem__(index)`` <==> ``siv[index]``
  
      Supports slicing.
  
      Runtime complexity: `O(log(n))` -- approximate.
  
      >>> sd = SortedDict({'a': 1, 'b': 2, 'c': 3})
      >>> svv = sd.values()
      >>> svv[0]
      1
      >>> svv[-1]
      3
      >>> svv[:]
      [1, 2, 3]
      >>> svv[100]
      Traceback (most recent call last):
        ...
      IndexError: list index out of range
  
      :param index: integer or slice for indexing
      :return: value or list of values
      :raises IndexError: if index out of range
  
      """
      _mapping = self._mapping
      _mapping_list = _mapping._list
  
      if isinstance(index, slice):
          keys = _mapping_list[index]
          return [_mapping[key] for key in keys]
  
      key = _mapping_list[index]
      return _mapping[key]
  
imports: import sys
  import warnings
  from itertools import chain
  from .sortedlist import SortedList, recursive_repr
  from .sortedset import SortedSet
label_desc: Use image node_id 1 for calling the SortedValuesView obj's underlying member method code with example usage: obj.__getitem__(index) and returns: _mapping, unknown