pairTypes
index
/users/schrei_f/src/py4CAtS/lite/src/pairTypes.py

A collection of some special data types.

 
Classes
       
builtins.list(builtins.object)
ListOfInts
builtins.object
Interval
PairOfFloats
PairOfInts

 
class Interval(builtins.object)
    A kind of sequence / set with just two float elements definind an interval/range.
 
  Methods defined here:
__add__(self, other)
__bool__(self)
__cmp__(self, other)
Interval comparison using cmp(Interval(,),Interval(,)),  returns -1, 0, or +1.
__contains__(self, other)
__div__(self, other)
__eq__(self, other)
Interval equality test with ==
__init__(self, *limits)
Initialize self.  See help(type(self)) for accurate signature.
__len__(self)
__mul__(self, other)
__radd__(self, other)
__rdiv__(self, other)
__repr__(self)
Return repr(self).
__rmul__(self, other)
__str__(self)
Return str(self).
__sub__(self, other)
approx(self, other, eps=0.001)
grid(self, nPoints=11, logGrid=False)
Generate an equidistant, uniform grid with nPoints-1 intervals.
inside(self, value)
Test if other is inside the interval, i.e., lower<value<upper.
intersect(self, other)
Return the common intersect of two intervals.
limits(self)
member(self, value)
Test if other is inside the interval, i.e., lower<=value<=upper.
overlap(self, other)
Test if the two intervals have a common intersect.
part(self, other)
Test if interval is inside other .
shift(self, other)
shift the interval limits by a constant.
size(self)

Data descriptors defined here:
__dict__
dictionary for instance variables (if defined)
__weakref__
list of weak references to the object (if defined)

Data and other attributes defined here:
__hash__ = None

 
class ListOfInts(builtins.list)
    A special list with only integers allowed.
 
 
Method resolution order:
ListOfInts
builtins.list
builtins.object

Methods defined here:
__add__(self, other)
Return self+value.
__iadd__(self, other)
Implement self+=value.
__init__(self, *someList)
Initialize self.  See help(type(self)) for accurate signature.
__setitem__(self, i, item)
Set self[key] to value.
append(self, item)
L.append(object) -> None -- append object to end
extend(self, otherList)
L.extend(iterable) -> None -- extend list by appending elements from the iterable
insert(self, index, item)
L.insert(index, object) -- insert object before index

Data descriptors defined here:
__dict__
dictionary for instance variables (if defined)
__weakref__
list of weak references to the object (if defined)

Methods inherited from builtins.list:
__contains__(self, key, /)
Return key in self.
__delitem__(self, key, /)
Delete self[key].
__eq__(self, value, /)
Return self==value.
__ge__(self, value, /)
Return self>=value.
__getattribute__(self, name, /)
Return getattr(self, name).
__getitem__(...)
x.__getitem__(y) <==> x[y]
__gt__(self, value, /)
Return self>value.
__imul__(self, value, /)
Implement self*=value.
__iter__(self, /)
Implement iter(self).
__le__(self, value, /)
Return self<=value.
__len__(self, /)
Return len(self).
__lt__(self, value, /)
Return self<value.
__mul__(self, value, /)
Return self*value.n
__ne__(self, value, /)
Return self!=value.
__new__(*args, **kwargs) from builtins.type
Create and return a new object.  See help(type) for accurate signature.
__repr__(self, /)
Return repr(self).
__reversed__(...)
L.__reversed__() -- return a reverse iterator over the list
__rmul__(self, value, /)
Return self*value.
__sizeof__(...)
L.__sizeof__() -- size of L in memory, in bytes
clear(...)
L.clear() -> None -- remove all items from L
copy(...)
L.copy() -> list -- a shallow copy of L
count(...)
L.count(value) -> integer -- return number of occurrences of value
index(...)
L.index(value, [start, [stop]]) -> integer -- return first index of value.
Raises ValueError if the value is not present.
pop(...)
L.pop([index]) -> item -- remove and return item at index (default last).
Raises IndexError if list is empty or index is out of range.
remove(...)
L.remove(value) -> None -- remove first occurrence of value.
Raises ValueError if the value is not present.
reverse(...)
L.reverse() -- reverse *IN PLACE*
sort(...)
L.sort(key=None, reverse=False) -> None -- stable sort *IN PLACE*

Data and other attributes inherited from builtins.list:
__hash__ = None

 
class PairOfFloats(builtins.object)
    A kind of sequence / set with just two float elements.
 
  Methods defined here:
__add__(self, other)
__div__(self, other)
__eq__(self, other)
Return self==value.
__init__(self, *pair)
Initialize self.  See help(type(self)) for accurate signature.
__mul__(self, other)
__radd__(self, other)
__rdiv__(self, other)
__repr__(self)
Return repr(self).
__rmul__(self, other)
__rsub__(self, other)
__str__(self)
Return str(self).
__sub__(self, other)
approx(self, other, eps=0.001)
list(self)
max(self)
min(self)
swap(self)

Data descriptors defined here:
__dict__
dictionary for instance variables (if defined)
__weakref__
list of weak references to the object (if defined)

Data and other attributes defined here:
__hash__ = None

 
class PairOfInts(builtins.object)
    A kind of sequence / set with just two integer elements.
 
  Methods defined here:
__add__(self, other)
__div__(self, other)
__eq__(self, other)
Return self==value.
__init__(self, *pair)
Initialize self.  See help(type(self)) for accurate signature.
__mul__(self, other)
__radd__(self, other)
__rdiv__(self, other)
__repr__(self)
Return repr(self).
__rmul__(self, other)
__rsub__(self, other)
__str__(self)
Return str(self).
__sub__(self, other)
distinct(self)
list(self)
max(self)
min(self)

Data descriptors defined here:
__dict__
dictionary for instance variables (if defined)
__weakref__
list of weak references to the object (if defined)

Data and other attributes defined here:
__hash__ = None