LSSTApplications: lsst.geom.geometry.

LSSTApplications 10.0+286,10.0+36,10.0+46,10.0-2-g4f67435,10.1+152,10.1+37,11.0,11.0+1,11.0-1-g47edd16,11.0-1-g60db491,11.0-1-g7418c06,11.0-2-g04d2804,11.0-2-g68503cd,11.0-2-g818369d,11.0-2-gb8b8ce7

LSSTDataManagementBasePackage

Inheritance diagram for lsst.geom.geometry._SubList:

Public Member Functions
def	__init__

def	append

def	filter

def	__len__

def	__iter__

Public Attributes
	backingList

	active

	head

	tail

	freeTail

	len

Detailed Description

Class that maintains a sub-list of a backing list in
insertion order. Elements can be deleted in O(1) time.

Definition at line 1919 of file geometry.py.

Constructor & Destructor Documentation

def lsst.geom.geometry._SubList.__init__	(	self,
		backingList
	)

Definition at line 1923 of file geometry.py.

 
     def __init__(self, backingList):
         self.backingList = backingList
         self.active = []
         self.head = -1
         self.tail = -1
         self.freeTail = -1
         self.len = 0

lsst.geom.geometry._SubList.head

head

Definition: geometry.py:1926

lsst.geom.geometry._SubList.backingList

backingList

Definition: geometry.py:1924

lsst.geom.geometry._SubList.len

len

Definition: geometry.py:1929

lsst.geom.geometry._SubList.__init__

def __init__

Definition: geometry.py:1923

lsst.geom.geometry._SubList.tail

tail

Definition: geometry.py:1927

lsst.geom.geometry._SubList.active

active

Definition: geometry.py:1925

lsst.geom.geometry._SubList.freeTail

freeTail

Definition: geometry.py:1928

Member Function Documentation

def lsst.geom.geometry._SubList.__iter__ ( self )

Returns an iterator over all elements in the sub-list.

Definition at line 1976 of file geometry.py.

 
     def __iter__(self):
         """Returns an iterator over all elements in the sub-list.
         """
         h = self.head
         while h != -1:
             t = self.active[h]
             yield self.backingList[t[0]]
             h = t[2]
 
 
 # -- Spherical box partitioning scheme ----

lsst.geom.geometry._SubList.__iter__

def __iter__

Definition: geometry.py:1976

lsst.geom.geometry._SubList.head

head

Definition: geometry.py:1926

lsst.geom.geometry._SubList.backingList

backingList

Definition: geometry.py:1924

lsst.geom.geometry._SubList.active

active

Definition: geometry.py:1925

def lsst.geom.geometry._SubList.__len__ ( self )

Definition at line 1973 of file geometry.py.

 
     def __len__(self):
         return self.len

lsst.geom.geometry._SubList.__len__

def __len__

Definition: geometry.py:1973

lsst.geom.geometry._SubList.len

len

Definition: geometry.py:1929

def lsst.geom.geometry._SubList.append	(	self,
		i
	)

Definition at line 1931 of file geometry.py.

 
     def append(self, i):
         if self.freeTail == -1:
             j = len(self.active)
             self.active.append([i, self.tail, -1])
         else:
             j = self.freeTail
             self.freeTail = self.active[self.freeTail][2]
             self.active[j] = [i, self.tail, -1]
         if self.tail != -1:
             self.active[self.tail][2] = j
         if self.head == -1:
             self.head = j
         self.tail = j
         self.len += 1

lsst.geom.geometry._SubList.head

head

Definition: geometry.py:1926

lsst.geom.geometry._SubList.len

len

Definition: geometry.py:1929

lsst.geom.geometry._SubList.tail

tail

Definition: geometry.py:1927

lsst.geom.geometry._SubList.active

active

Definition: geometry.py:1925

lsst.geom.geometry._SubList.freeTail

freeTail

Definition: geometry.py:1928

lsst.geom.geometry._SubList.append

def append

Definition: geometry.py:1931

def lsst.geom.geometry._SubList.filter	(	self,
		predicate
	)

Removes all elements E in the sub-list for which predicate(E)
evaluates to True.

Definition at line 1946 of file geometry.py.

 
     def filter(self, predicate):
         """Removes all elements E in the sub-list for which predicate(E)
         evaluates to True.
         """
         h = self.head
         while h != -1:
             t = self.active[h]
             if predicate(self.backingList[t[0]]):
                 # Remove element h
                 self.backingList[t[0]] = None
                 self.len -= 1
                 prev = t[1]
                 next = t[2]
                 if next != -1:
                     self.active[next][1] = prev
                 else:
                     self.tail = prev
                 if prev != -1:
                     self.active[prev][2] = next
                 else:
                     self.head = next
                 t[2] = self.freeTail
                 self.freeTail = h
                 h = next
             else:
                 h = t[2]