Class PythonTimeStampedCache<T extends TimeStamped>

    • Field Detail

      • pythonObject

        protected long pythonObject
        Part of JCC Python interface to object
    • Constructor Detail

      • PythonTimeStampedCache

        public PythonTimeStampedCache()
    • Method Detail

      • pythonExtension

        public void pythonExtension​(long pythonObject)
      • pythonExtension

        public long pythonExtension()
      • pythonDecRef

        public void pythonDecRef()
      • getNeighbors

        public Stream<T> getNeighbors​(AbsoluteDate central)
        Get the entries surrounding a central date.

        If the central date is well within covered range, the returned array will be balanced with half the points before central date and half the points after it (depending on n parity, of course). If the central date is near the boundary, then the returned array will be unbalanced and will contain only the n earliest (or latest) entries. A typical example of the later case is leap seconds cache, since the number of leap seconds cannot be arbitrarily increased.

        This method is safe for multiple threads to execute concurrently.

        Specified by:
        getNeighbors in interface TimeStampedCache<T extends TimeStamped>
        Parameters:
        central - central date
        Returns:
        list of cached entries surrounding the specified date. The size of the list is guaranteed to be TimeStampedCache.getMaxNeighborsSize().
        See Also:
        TimeStampedCache.getNeighbors(AbsoluteDate, int)
      • getNeighbors

        public Stream<T> getNeighbors​(AbsoluteDate central,
                                      int n)
        Get the entries surrounding a central date.

        If the central date is well within covered range, the returned array will be balanced with half the points before central date and half the points after it (depending on n parity, of course). If the central date is near the boundary, then the returned array will be unbalanced and will contain only the n earliest (or latest) entries. A typical example of the later case is leap seconds cache, since the number of leap seconds cannot be arbitrarily increased.

        This method is safe for multiple threads to execute concurrently.

        Specified by:
        getNeighbors in interface TimeStampedCache<T extends TimeStamped>
        Parameters:
        central - central date
        n - number of neighbors (cannot exceed TimeStampedCache.getMaxNeighborsSize())
        Returns:
        stream of cached entries surrounding the specified date.