lsst.obs.base.gen2to3.repoConverter.MostRecentlyUsedStack Class Reference

Inheritance diagram for lsst.obs.base.gen2to3.repoConverter.MostRecentlyUsedStack:

Public Member Functions
def	__init__ (self)
def	__iter__ (self)
def	apply
def	push (self, element)

Detailed Description

A simple container that maintains a most-recently-used ordering.

Definition at line 50 of file repoConverter.py.

Constructor & Destructor Documentation

__init__()

def lsst.obs.base.gen2to3.repoConverter.MostRecentlyUsedStack.__init__

(

self

)

Definition at line 54 of file repoConverter.py.

    def __init__(self):
        self._elements = []

Member Function Documentation

__iter__()

def lsst.obs.base.gen2to3.repoConverter.MostRecentlyUsedStack.__iter__

(

self

)

Definition at line 57 of file repoConverter.py.

    def __iter__(self):
        # Iterate in reverse order so we can keep the most recent element used
        # at the end of the list.  We want to use the end rather than the
        # beginning because appending to lists is much more efficient than
        # inserting at the beginning.
        yield from reversed(self._elements)

apply()

def lsst.obs.base.gen2to3.repoConverter.MostRecentlyUsedStack.apply	(		self,
			func
	)

Definition at line 64 of file repoConverter.py.

    def apply(self, func: Callable[[T], Any]) -> Any:
        """Apply a function to elements until it returns a value that coerces
        to `True`, and move the corresponding element to the front of the
        stack.

        Parameters
        ----------
        func : callable
            Callable object.

        Returns
        -------
        value : `object`
            The first value returned by ``func`` that coerces to `True`.
        """
        for n, element in enumerate(self):
            result = func(element)
            if result:
                break
        else:
            return None
        # Move the extractor that matched to the back of the list (note that
        # n indexes from the back of the internal list).
        if n != 0:
            # i indexes from the front of the internal list.
            i = len(self._elements) - 1 - n
            assert self._elements[i] is element
            del self._elements[i]
            self._elements.append(element)
        return result

push()

def lsst.obs.base.gen2to3.repoConverter.MostRecentlyUsedStack.push	(		self,
			element
	)

Add a new element to the front of the stack.

Definition at line 95 of file repoConverter.py.

    def push(self, element):
        """Add a new element to the front of the stack.
        """
        self._elements.append(element)


@dataclass

---

The documentation for this class was generated from the following file:

• /j/snowflake/release/lsstsw/stack/Linux64/obs_base/19.0.0-12-g6990b2c/python/lsst/obs/base/gen2to3/repoConverter.py