cs-obj 20250306__py2.py3-none-any.whl

cs/obj.py

@@ -0,0 +1,550 @@
+#!/usr/bin/python
+#
+# Random stuff for "objects". - Cameron Simpson <cs@cskk.id.au>
+#
+
+r'''
+Convenience facilities for objects.
+'''
+
+from collections import defaultdict
+from copy import copy as copy0
+import sys
+from threading import Lock
+import traceback
+from types import SimpleNamespace
+from weakref import WeakValueDictionary
+
+from cs.deco import OBSOLETE
+
+__version__ = '20250306'
+
+DISTINFO = {
+    'keywords': ["python2", "python3"],
+    'classifiers': [
+        "Programming Language :: Python",
+        "Programming Language :: Python :: 3",
+    ],
+    'install_requires': ['cs.deco'],
+}
+
+T_SEQ = 'SEQUENCE'
+T_MAP = 'MAPPING'
+T_SCALAR = 'SCALAR'
+
+def flavour(obj):
+  """ Return constants indicating the ``flavour'' of an object:
+      * `T_MAP`: DictType, DictionaryType, objects with an __keys__ or keys attribute.
+      * `T_SEQ`: TupleType, ListType, objects with an __iter__ attribute.
+      * `T_SCALAR`: Anything else.
+  """
+  t = type(obj)
+  if isinstance(t, (tuple, list)):
+    return T_SEQ
+  if isinstance(t, dict):
+    return T_MAP
+  if hasattr(obj, '__keys__') or hasattr(obj, 'keys'):
+    return T_MAP
+  if hasattr(obj, '__iter__'):
+    return T_SEQ
+  return T_SCALAR
+
+# pylint: disable=too-few-public-methods
+class O(SimpleNamespace):
+  ''' The `O` class is now obsolete, please subclass `types.SimpleNamespace`
+      or use a dataclass.
+  '''
+
+  callers = set()
+
+  def __init__(self, **kw):
+    frame = traceback.extract_stack(None, 2)[0]
+    caller = (frame[0], frame[1])
+    if caller not in self.callers:
+      self.callers.add(caller)
+      print(
+          "WARNING: %s:%d %s: obsolete use of cs.obj.O, please shift to types.SimpleNamespace."
+          % (frame[0], frame[1], frame[2]),
+          file=sys.stderr
+      )
+    SimpleNamespace.__init__(self, **kw)
+
+def O_merge(o, _conflict=None, _overwrite=False, **kw):
+  ''' Merge key:value pairs from a mapping into an object.
+
+      Ignore keys that do not start with a letter.
+      New attributes or attributes whose values compare equal are
+      merged in. Unequal values are passed to:
+
+          _conflict(o, attr, old_value, new_value)
+
+      to resolve the conflict. If _conflict is omitted or None
+      then the new value overwrites the old if _overwrite is true.
+  '''
+  for attr, value in kw.items():
+    if attr or not attr[0].isalpha():
+      continue
+    try:
+      ovalue = getattr(o, attr)
+    except AttributeError:
+      # new attribute -
+      setattr(o, attr, value)
+    else:
+      if ovalue != value:
+        if _conflict is None:
+          if _overwrite:
+            setattr(o, attr, value)
+        else:
+          _conflict(o, attr, ovalue, value)
+
+def O_attrs(o):
+  ''' Yield attribute names from `o` which are pertinent to `O_str`.
+
+      Note: this calls `getattr(o,attr)` to inspect it in order to
+      prune callables.
+  '''
+  for attr in sorted(dir(o)):
+    if attr[0].isalpha():
+      try:
+        value = getattr(o, attr)
+      except AttributeError:
+        continue
+      if not callable(value):
+        yield attr
+
+def O_attritems(o):
+  ''' Generator yielding `(attr,value)` for relevant attributes of `o`.
+  '''
+  for attr in O_attrs(o):
+    try:
+      value = getattr(o, attr)
+    except AttributeError:
+      continue
+    else:
+      yield attr, value
+
+def O_str(o, no_recurse=False, seen=None):
+  ''' Return a `str` representation of the object `o`.
+
+      Parameters:
+      * `o`: the object to describe.
+      * `no_recurse`: if true, do not recurse into the object's structure.
+        Default: `False`.
+      * `seen`: a set of previously sighted objects
+        to prevent recursion loops.
+  '''
+  if seen is None:
+    seen = set()
+  obj_type = type(o)
+  if obj_type in (str,):
+    return repr(o)
+  if obj_type in (tuple, int, float, bool, list):
+    return str(o)
+  if obj_type is dict:
+    o2 = {k: str(v) for k, v in o.items()}
+    return str(o2)
+  if obj_type is set:
+    return 'set(%s)' % (','.join(sorted([str(item) for item in o])))
+  seen.add(id(o))
+  if no_recurse:
+    attrdesc_strs = [
+        "%s=<%s>" % (pattr, type(pvalue).__name__)
+        for pattr, pvalue in O_attritems(o)
+    ]
+  else:
+    attrdesc_strs = []
+    for pattr, pvalue in O_attritems(o):
+      if id(pvalue) in seen:
+        desc = "<%s>" % (type(pvalue).__name__,)
+      else:
+        desc = "%s=%s" % (
+            pattr, O_str(pvalue, no_recurse=no_recurse, seen=seen)
+        )
+      attrdesc_strs.append(desc)
+  s = "<%s %s>" % (o.__class__.__name__, ",".join(attrdesc_strs))
+  seen.remove(id(o))
+  return s
+
+def copy(obj, **kw):
+  ''' Convenient function to shallow copy an object with simple modifications.
+
+       Performs a shallow copy of `self` using `copy.copy`.
+
+       Treat all keyword arguments as `(attribute,value)` 2-tuples and
+       replace those attributes with the supplied values.
+  '''
+  obj2 = copy0(obj)
+  for attr, value in kw.items():
+    setattr(obj2, attr, value)
+  return obj2
+
+def as_dict(o, selector=None):
+  ''' Return a dictionary with keys mapping to the values of the attributes of `o`.
+
+      Parameters:
+      * `o`: the object to map
+      * `selector`: the optional selection criterion
+
+      If `selector` is omitted or `None`, select "public" attributes,
+      those not commencing with an underscore.
+
+      If `selector` is a `str`, select attributes starting with `selector`.
+
+      Otherwise presume `selector` is callable
+      and select attributes `attr` where `selector(attr)` is true.
+  '''
+  if selector is None:
+    match = lambda attr: attr and not attr.startswith('_')
+  elif isinstance(selector, str):
+    match = lambda attr: attr.startswith(selector)
+  else:
+    match = selector
+  return {attr: getattr(o, attr) for attr in dir(o) if match(attr)}
+
+@OBSOLETE("use cs.obj.as_dict")
+def obj_as_dict(o, **kw):
+  ''' OBSOLETE convesion of an object to a `dict`. Please us `cs.obj.as_dict`.
+  '''
+  raise RuntimeError("please use cs.obj.as_dict")
+
+class Proxy(object):
+  ''' An extremely simple proxy object
+      that passes all unmatched attribute accesses to the proxied object.
+
+      Note that setattr and delattr work directly on the proxy, not the proxied object.
+  '''
+
+  def __init__(self, other):
+    self._proxied = other
+
+  def __getattr__(self, attr):
+    _proxied = object.__getattribute__(self, '_proxied')
+    return getattr(_proxied, attr)
+
+  def __iter__(self):
+    _proxied = object.__getattribute__(self, '_proxied')
+    return iter(_proxied)
+
+  def __len__(self):
+    _proxied = object.__getattribute__(self, '_proxied')
+    return len(_proxied)
+
+class TrackedClassMixin(object):
+  ''' A mixin to track all instances of a particular class.
+
+      This is aimed at checking the global state of objects of a
+      particular type, particularly states like counters. The
+      tracking is attached to the class itself.
+
+      The class to be tracked includes this mixin as a superclass and calls:
+
+          TrackedClassMixin.__init__(class_to_track)
+
+      from its __init__ method. Note that `class_to_track` is
+      typically the class name itself, not `type(self)` which would
+      track the specific subclass. At some relevant point one can call:
+
+          self.tcm_dump(class_to_track[, file])
+
+      `class_to_track` needs a `tcm_get_state` method to return the
+      salient information, such as this from cs.resources.MultiOpenMixin:
+
+          def tcm_get_state(self):
+              return {'opened': self.opened, 'opens': self._opens}
+
+      See cs.resources.MultiOpenMixin for example use.
+  '''
+
+  def __init__(self, cls):
+    try:
+      m = cls.__map
+    except AttributeError:
+      m = cls.__map = {}
+    m[id(self)] = self
+
+  def __state(self, cls):
+    return cls.tcm_get_state(self)
+
+  @staticmethod
+  def tcm_all_state(klass):
+    ''' Generator yielding tracking information
+        for objects of type `klass`
+        in the form `(o,state)`
+        where `o` if a tracked object
+        and `state` is the object's `get_tcm_state` method result.
+    '''
+    m = klass.__map
+    for o in m.values():
+      yield o, klass.__state(o, klass)
+
+  @staticmethod
+  def tcm_dump(klass, f=None):
+    ''' Dump the tracking information for `klass` to the file `f`
+        (default `sys.stderr`).
+    '''
+    if f is None:
+      f = sys.stderr
+    for o, state in TrackedClassMixin.tcm_all_state(klass):
+      print(str(type(o)), id(o), repr(state), file=f)
+
+def singleton(registry, key, factory, fargs, fkwargs):
+  ''' Obtain an object for `key` via `registry` (a mapping of `key`=>object).
+      Return `(is_new,object)`.
+
+      If the `key` exists in the registry, return the associated object.
+      Otherwise create a new object by calling `factory(*fargs,**fkwargs)`
+      and store it as `key` in the `registry`.
+
+      The `registry` may be any mapping of `key`s to objects
+      but will usually be a `weakref.WeakValueDictionary`
+      in order that object references expire as normal,
+      allowing garbage collection.
+
+      *Note*: this function *is not* thread safe.
+      Multithreaded users should hold a mutex.
+
+      See the `SingletonMixin` class for a simple mixin to create
+      singleton classes,
+      which does provide thread safe operations.
+  '''
+  try:
+    instance = registry[key]
+    is_new = False
+  except KeyError:
+    instance = factory(*fargs, **fkwargs)
+    registry[key] = instance
+    is_new = True
+  return is_new, instance
+
+# pylint: disable=too-few-public-methods
+class SingletonMixin:
+  ''' A mixin turning a subclass into a singleton factory.
+
+      *Note*: this mixin overrides `object.__new__`
+      and may not play well with other classes which override `__new__`.
+
+      *Warning*: because of the mechanics of `__new__`,
+      the instance's `__init__` method will always be called
+      after `__new__`,
+      even when a preexisting object is returned.
+      Therefore that method should be sensible
+      even for an already initialised
+      and probably subsequently modified object.
+
+      My suggested approach is to access some attribute,
+      and preemptively return if it already exists.
+      Example:
+
+          def __init__(self, x, y):
+              if 'x' in self.__dict__:
+                  return
+              self.x = x
+              self.y = y
+
+      *Note*: we probe `self.__dict__` above to accomodate classes
+      with a `__getattr__` method.
+
+      *Note*: each class registry has a lock,
+      which ensures that reuse of an object
+      in multiple threads will call the `__init__` method
+      in a thread safe serialised fashion.
+
+      Implementation requirements:
+      a subclass should:
+      * provide a method `_singleton_key(*args,**kwargs)`
+        returning a key for use in the single registry,
+        computed from the positional and keyword arguments
+        supplied on instance creation
+        i.e. those which `__init__` would normally receive.
+        This should have the same signature as `__init__`
+        but using `cls` instead of `self`.
+      * provide a normal `__init__` method
+        which can be safely called again
+        after some earlier initialisation.
+
+      This class is thread safe for the registry operations.
+
+      Example:
+
+          class Pool(SingletonMixin):
+
+              @classmethod
+              def _singleton_key(cls, foo, bah=3):
+                  return foo, bah
+
+              def __init__(self, foo, bah=3):
+                  if hasattr(self, 'foo'):
+                      return
+                 ... normal __init__ stuff here ...
+                 self.foo = foo
+                 ...
+  '''
+
+  # This lock is used to control setup of the per-class registry.
+  # It is shared across all subclasses, but that bypasses any need to call an
+  # __init__ for this mixin. In mitigation, the lock is only used if the class
+  # does not yet have a registry.
+  __global_lock = Lock()
+
+  @classmethod
+  def _singleton_get_registry(cls):
+    ''' Obtain the class singleton registry, creating it on first use.
+    '''
+    try:
+      registry = cls._singleton_registry
+    except AttributeError:
+      with cls.__global_lock:
+        try:
+          registry = cls._singleton_registry
+        except AttributeError:
+          # create the registry and give it its own mutex and multiindex
+          registry = cls._singleton_registry = WeakValueDictionary()
+          registry._singleton_lock = Lock()
+          registry._singleton_also_keys = defaultdict(WeakValueDictionary)
+    return registry
+
+  def __new__(cls, *a, **kw):
+    ''' Prepare a new instance of `cls` if required.
+        Return the instance.
+
+        This creates the class registry if missing,
+        prepares a key from `cls._singleton_key`,
+        then returns the entry from the registry is present,
+        or creates a new entry if not.
+        Note: if the key is `None` a new entry is always created
+        and not recorded in the registry.
+    '''
+    super_new = super().__new__
+
+    # pylint: disable=unused-argument
+    def factory(*fargs, **fkwargs):
+      ''' Prepare a new object; does not yet call `__init__`.
+          This accepts arguments to support use via the `singleton()` function.
+      '''
+      return super_new(cls)
+
+    okey = cls._singleton_key(*a, **kw)
+    if okey is None:
+      # if the returned key is None we always make a new instance
+      # and do not register in the registry
+      instance = factory()
+    else:
+      # normal behaviour:
+      # reuse an existing instance or make a new one
+      registry = cls._singleton_get_registry()
+      with registry._singleton_lock:
+        is_new, instance = singleton(registry, okey, factory, (), {})
+        if is_new:
+          instance._SingletonMixin_key = okey
+        else:
+          assert instance._SingletonMixin_key == okey
+    return instance
+
+  # default hash and equality methods
+  def __hash__(self):
+    return hash(self._SingletonMixin_key)
+
+  def __eq__(self, other):
+    return self is other
+
+  @classmethod
+  def singleton_also_by(cls, also_key, key):
+    ''' Obtain a singleton by a secondary key.
+        Return the instance or `None`.
+
+        Parameters:
+        * `also_key`: the name of the secondary key index
+        * `key`: the key for the index
+    '''
+    registry = cls._singleton_get_registry()
+    with registry._singleton_lock:
+      return registry._singleton_also_keys[also_key].get(key)
+
+  # pylint: disable=no-self-use
+  def _singleton_also_indexmap(self):
+    ''' Return a mapping of secondary key names and their matching key values.
+    '''
+    return {}
+
+  def _singleton_also_index(self):
+    ''' Return a mapping of secondary key names and their matching key values.
+    '''
+    registry = self._singleton_get_registry()
+    with registry._singleton_lock:
+      for also_key, key in self._singleton_also_indexmap().items():
+        registry._singleton_also_keys[also_key][key] = self
+
+  @classmethod
+  def _singleton_instances(cls):
+    ''' Return a list of the current class instances.
+    '''
+    try:
+      registry = cls._singleton_registry
+    except AttributeError:
+      return []
+    else:
+      return list(
+          filter(
+              lambda obj: obj is not None,
+              map(lambda ref: ref(), registry.valuerefs())
+          )
+      )
+
+class Sentinel:
+  ''' A simple class for named sentinels whose `str()` is just the name
+      and whose `==` uses `is`.
+
+      Example:
+
+          >>> from cs.obj import Sentinel
+          >>> MISSING = Sentinel("MISSING")
+          >>> print(MISSING)
+          MISSING
+          >>> other = Sentinel("other")
+          >>> MISSING == other
+          False
+          >>> MISSING == MISSING
+          True
+  '''
+
+  __slots__ = 'name',
+
+  def __init__(self, name):
+    self.name = name
+
+  def __str__(self):
+    return self.name
+
+  def __repr__(self):
+    return "%s(%r)" % (self.__class__.__name__, self.name)
+
+  def __eq__(self, other):
+    return self is other
+
+def public_subclasses(cls, extras=()):
+  ''' Return a set of the subclasses of `cls` which have public names.
+  '''
+  classes = set()
+  q = list(cls.__subclasses__())
+  q.extend(extras)
+  while q:
+    subcls = q.pop(0)
+    if subcls in classes:
+      # seen this one
+      continue
+    if not subcls.__name__.startswith('_'):
+      # public name, include it
+      classes.add(subcls)
+    # append the further subclasses for consideration
+    try:
+      subclasses = subcls.__subclasses__()
+    except TypeError:
+      # type is a subclass of object, but its __subclasses__ is just a function
+      pass
+    else:
+      q.extend(subclasses)
+  return classes
+
+if __name__ == '__main__':
+  import cs.obj_tests
+  cs.obj_tests.selftest(sys.argv)

cs_obj-20250306.dist-info/METADATA

@@ -0,0 +1,333 @@
+Metadata-Version: 2.4
+Name: cs-obj
+Version: 20250306
+Summary: Convenience facilities for objects.
+Keywords: python2,python3
+Author-email: Cameron Simpson <cs@cskk.id.au>
+Description-Content-Type: text/markdown
+Classifier: Programming Language :: Python
+Classifier: Programming Language :: Python :: 3
+Classifier: Development Status :: 4 - Beta
+Classifier: Intended Audience :: Developers
+Classifier: Operating System :: OS Independent
+Classifier: Topic :: Software Development :: Libraries :: Python Modules
+Classifier: License :: OSI Approved :: GNU General Public License v3 or later (GPLv3+)
+Requires-Dist: cs.deco>=20250306
+Project-URL: MonoRepo Commits, https://bitbucket.org/cameron_simpson/css/commits/branch/main
+Project-URL: Monorepo Git Mirror, https://github.com/cameron-simpson/css
+Project-URL: Monorepo Hg/Mercurial Mirror, https://hg.sr.ht/~cameron-simpson/css
+Project-URL: Source, https://github.com/cameron-simpson/css/blob/main/lib/python/cs/obj.py
+
+Convenience facilities for objects.
+
+*Latest release 20250306*:
+* Remove cs.py3 dependency, this module has not worked in python2 for quite a while.
+* copy: drop use of positional parameters.
+
+## <a name="as_dict"></a>`as_dict(o, selector=None)`
+
+Return a dictionary with keys mapping to the values of the attributes of `o`.
+
+Parameters:
+* `o`: the object to map
+* `selector`: the optional selection criterion
+
+If `selector` is omitted or `None`, select "public" attributes,
+those not commencing with an underscore.
+
+If `selector` is a `str`, select attributes starting with `selector`.
+
+Otherwise presume `selector` is callable
+and select attributes `attr` where `selector(attr)` is true.
+
+## <a name="copy"></a>`copy(obj, **kw)`
+
+Convenient function to shallow copy an object with simple modifications.
+
+Performs a shallow copy of `self` using `copy.copy`.
+
+Treat all keyword arguments as `(attribute,value)` 2-tuples and
+replace those attributes with the supplied values.
+
+## <a name="flavour"></a>`flavour(obj)`
+
+Return constants indicating the ``flavour'' of an object:
+* `T_MAP`: DictType, DictionaryType, objects with an __keys__ or keys attribute.
+* `T_SEQ`: TupleType, ListType, objects with an __iter__ attribute.
+* `T_SCALAR`: Anything else.
+
+## <a name="O"></a>Class `O(types.SimpleNamespace)`
+
+The `O` class is now obsolete, please subclass `types.SimpleNamespace`
+or use a dataclass.
+
+## <a name="O_attritems"></a>`O_attritems(o)`
+
+Generator yielding `(attr,value)` for relevant attributes of `o`.
+
+## <a name="O_attrs"></a>`O_attrs(o)`
+
+Yield attribute names from `o` which are pertinent to `O_str`.
+
+Note: this calls `getattr(o,attr)` to inspect it in order to
+prune callables.
+
+## <a name="O_merge"></a>`O_merge(o, _conflict=None, _overwrite=False, **kw)`
+
+Merge key:value pairs from a mapping into an object.
+
+Ignore keys that do not start with a letter.
+New attributes or attributes whose values compare equal are
+merged in. Unequal values are passed to:
+
+    _conflict(o, attr, old_value, new_value)
+
+to resolve the conflict. If _conflict is omitted or None
+then the new value overwrites the old if _overwrite is true.
+
+## <a name="O_str"></a>`O_str(o, no_recurse=False, seen=None)`
+
+Return a `str` representation of the object `o`.
+
+Parameters:
+* `o`: the object to describe.
+* `no_recurse`: if true, do not recurse into the object's structure.
+  Default: `False`.
+* `seen`: a set of previously sighted objects
+  to prevent recursion loops.
+
+## <a name="obj_as_dict"></a>`obj_as_dict(o, **kw)`
+
+OBSOLETE obj_as_dict
+
+OBSOLETE convesion of an object to a `dict`. Please us `cs.obj.as_dict`.
+
+## <a name="Proxy"></a>Class `Proxy`
+
+An extremely simple proxy object
+that passes all unmatched attribute accesses to the proxied object.
+
+Note that setattr and delattr work directly on the proxy, not the proxied object.
+
+## <a name="public_subclasses"></a>`public_subclasses(cls, extras=())`
+
+Return a set of the subclasses of `cls` which have public names.
+
+## <a name="Sentinel"></a>Class `Sentinel`
+
+A simple class for named sentinels whose `str()` is just the name
+and whose `==` uses `is`.
+
+Example:
+
+    >>> from cs.obj import Sentinel
+    >>> MISSING = Sentinel("MISSING")
+    >>> print(MISSING)
+    MISSING
+    >>> other = Sentinel("other")
+    >>> MISSING == other
+    False
+    >>> MISSING == MISSING
+    True
+
+## <a name="singleton"></a>`singleton(registry, key, factory, fargs, fkwargs)`
+
+Obtain an object for `key` via `registry` (a mapping of `key`=>object).
+Return `(is_new,object)`.
+
+If the `key` exists in the registry, return the associated object.
+Otherwise create a new object by calling `factory(*fargs,**fkwargs)`
+and store it as `key` in the `registry`.
+
+The `registry` may be any mapping of `key`s to objects
+but will usually be a `weakref.WeakValueDictionary`
+in order that object references expire as normal,
+allowing garbage collection.
+
+*Note*: this function *is not* thread safe.
+Multithreaded users should hold a mutex.
+
+See the `SingletonMixin` class for a simple mixin to create
+singleton classes,
+which does provide thread safe operations.
+
+## <a name="SingletonMixin"></a>Class `SingletonMixin`
+
+A mixin turning a subclass into a singleton factory.
+
+*Note*: this mixin overrides `object.__new__`
+and may not play well with other classes which override `__new__`.
+
+*Warning*: because of the mechanics of `__new__`,
+the instance's `__init__` method will always be called
+after `__new__`,
+even when a preexisting object is returned.
+Therefore that method should be sensible
+even for an already initialised
+and probably subsequently modified object.
+
+My suggested approach is to access some attribute,
+and preemptively return if it already exists.
+Example:
+
+    def __init__(self, x, y):
+        if 'x' in self.__dict__:
+            return
+        self.x = x
+        self.y = y
+
+*Note*: we probe `self.__dict__` above to accomodate classes
+with a `__getattr__` method.
+
+*Note*: each class registry has a lock,
+which ensures that reuse of an object
+in multiple threads will call the `__init__` method
+in a thread safe serialised fashion.
+
+Implementation requirements:
+a subclass should:
+* provide a method `_singleton_key(*args,**kwargs)`
+  returning a key for use in the single registry,
+  computed from the positional and keyword arguments
+  supplied on instance creation
+  i.e. those which `__init__` would normally receive.
+  This should have the same signature as `__init__`
+  but using `cls` instead of `self`.
+* provide a normal `__init__` method
+  which can be safely called again
+  after some earlier initialisation.
+
+This class is thread safe for the registry operations.
+
+Example:
+
+    class Pool(SingletonMixin):
+
+        @classmethod
+        def _singleton_key(cls, foo, bah=3):
+            return foo, bah
+
+        def __init__(self, foo, bah=3):
+            if hasattr(self, 'foo'):
+                return
+           ... normal __init__ stuff here ...
+           self.foo = foo
+           ...
+
+*`SingletonMixin.__hash__(self)`*:
+default hash and equality methods
+
+*`SingletonMixin.singleton_also_by(also_key, key)`*:
+Obtain a singleton by a secondary key.
+Return the instance or `None`.
+
+Parameters:
+* `also_key`: the name of the secondary key index
+* `key`: the key for the index
+
+## <a name="TrackedClassMixin"></a>Class `TrackedClassMixin`
+
+A mixin to track all instances of a particular class.
+
+This is aimed at checking the global state of objects of a
+particular type, particularly states like counters. The
+tracking is attached to the class itself.
+
+The class to be tracked includes this mixin as a superclass and calls:
+
+    TrackedClassMixin.__init__(class_to_track)
+
+from its __init__ method. Note that `class_to_track` is
+typically the class name itself, not `type(self)` which would
+track the specific subclass. At some relevant point one can call:
+
+    self.tcm_dump(class_to_track[, file])
+
+`class_to_track` needs a `tcm_get_state` method to return the
+salient information, such as this from cs.resources.MultiOpenMixin:
+
+    def tcm_get_state(self):
+        return {'opened': self.opened, 'opens': self._opens}
+
+See cs.resources.MultiOpenMixin for example use.
+
+*`TrackedClassMixin.tcm_all_state(klass)`*:
+Generator yielding tracking information
+for objects of type `klass`
+in the form `(o,state)`
+where `o` if a tracked object
+and `state` is the object's `get_tcm_state` method result.
+
+*`TrackedClassMixin.tcm_dump(klass, f=None)`*:
+Dump the tracking information for `klass` to the file `f`
+(default `sys.stderr`).
+
+# Release Log
+
+
+
+*Release 20250306*:
+* Remove cs.py3 dependency, this module has not worked in python2 for quite a while.
+* copy: drop use of positional parameters.
+
+*Release 20250103*:
+public_subclasses: new optional extras= parameter for additional classes to scan, now returns a set.
+
+*Release 20241009*:
+public_subclasses: catch TypeError from "type.__subclasses__", which is just a function.
+
+*Release 20241005*:
+New public_subclasses(cls) returning all subclasses with public names.
+
+*Release 20220918*:
+* SingletonMixin: change example to probe self__dict__ instead of hasattr, faster and less fragile.
+* New Sentinel class for named sentinel objects, equal only to their own instance.
+
+*Release 20220530*:
+SingletonMixin: add default __hash__ and __eq__ methods to support dict and set membership.
+
+*Release 20210717*:
+SingletonMixin: if cls._singleton_key returns None we always make a new instance and do not register it.
+
+*Release 20210306*:
+SingletonMixin: make singleton_also_by() a public method.
+
+*Release 20210131*:
+SingletonMixin: new _singleton_also_indexmap method to return a mapping of secondary keys to values to secondary lookup, _singleton_also_index() to update these indices, _singleton_also_by to look up a secondary index.
+
+*Release 20210122*:
+SingletonMixin: new _singleton_instances() method returning a list of the current instances.
+
+*Release 20201227*:
+SingletonMixin: correctly invoke __new__, a surprisingly fiddly task to get right.
+
+*Release 20201021*:
+* @OBSOLETE(obj_as_dict), recommend "as_dict()".
+* [BREAKING] change as_dict() to accept a single optional selector instead of various mutually exclusive keywords.
+
+*Release 20200716*:
+SingletonMixin: no longer require special _singleton_init method, reuse default __init__ implicitly through __new__ mechanics.
+
+*Release 20200517*:
+Documentation improvements.
+
+*Release 20200318*:
+* Replace obsolete O class with a new subclass of SimpleNamespace which issues a warning.
+* New singleton() generic factory function and SingletonMixin mixin class for making singleton classes.
+
+*Release 20190103*:
+* New mixin class TrackedClassMixin to track all instances of a particular class.
+* Documentation updates.
+
+*Release 20170904*:
+Minor cleanups.
+
+*Release 20160828*:
+* Use "install_requires" instead of "requires" in DISTINFO.
+* Minor tweaks.
+
+*Release 20150118*:
+move long_description into cs/README-obj.rst
+
+*Release 20150110*:
+cleaned out some old junk, readied metadata for PyPI

cs_obj-20250306.dist-info/RECORD

@@ -0,0 +1,4 @@
+cs/obj.py,sha256=TrkEWW-yM5XxbCOELJwmXDQIfveszC0E50IOv8CYLdA,16579
+cs_obj-20250306.dist-info/WHEEL,sha256=BXjIu84EnBiZ4HkNUBN93Hamt5EPQMQ6VkF7-VZ_Pu0,100
+cs_obj-20250306.dist-info/METADATA,sha256=P3Ib6MGxxJKlA7FSNXPl9X9tEh2pwT8pXPsFzzJFkwk,10926
+cs_obj-20250306.dist-info/RECORD,,

cs_obj-20250306.dist-info/WHEEL

@@ -0,0 +1,5 @@
+Wheel-Version: 1.0
+Generator: flit 3.11.0
+Root-Is-Purelib: true
+Tag: py2-none-any
+Tag: py3-none-any