BaseRelation¶
- class lsst.daf.relation.BaseRelation¶
Bases:
object
An implementation-focused target class for concrete
Relation
objects.This class provides method implementations for much of the
Relation
interface and is actually inherited from (unlikeRelation
itself) by all concrete relations. It should only be used outside of thelsst.daf.relation
package when needed forisinstance
checks.Attributes Summary
Whether a
join
to this relation will result in the other relation being returned directly (bool
).Whether this relation has no real content (
bool
).Methods Summary
attach_payload
(payload)Attach an engine-specific
payload
to this relation.chain
(rhs)Return a new relation with all rows from this relation and another.
join
(rhs[, predicate, backtrack, transfer])Return a new relation that joins this one to the given one.
materialized
([name, name_prefix])Return a new relation that indicates that this relation's payload should be cached after it is first processed.
sorted
(terms, *[, preferred_engine, ...])Return a new relation that sorts rows according to a sequence of column expressions.
transferred_to
(destination)Return a new relation that transfers this relation to a new engine.
with_calculated_column
(tag, expression, *[, ...])Return a new relation that adds a calculated column to this one.
with_only_columns
(columns, *[, ...])Return a new relation whose columns are a subset of this relation's.
with_rows_satisfying
(predicate, *[, ...])Return a new relation that filters out rows via a boolean expression.
without_duplicates
(*[, preferred_engine, ...])Return a new relation that removes any duplicate rows from this one.
Attributes Documentation
- is_join_identity¶
Whether a
join
to this relation will result in the other relation being returned directly (bool
).Join identity relations have exactly one row and no columns.
See also
- is_trivial¶
Whether this relation has no real content (
bool
).A trivial relation is either a
join identity
with no columns and exactly one row, or a relation with an arbitrary number of columns and no rows (i.e.min_rows==max_rows==0
).
Methods Documentation
- attach_payload(payload: Any) None ¶
Attach an engine-specific
payload
to this relation.This method may be called exactly once on a
Relation
instance that was not initialized with apayload
, despite the fact thatRelation
objects are otherwise considered immutable.- Parameters:
- payload
Engine-specific content to attach.
- Raises:
- TypeError
Raised if this relation already has a payload, or can never have a payload.
TypeError
is used here for consistency with other attempts to assign to an attribute of an immutable object.
- chain(rhs: Relation) Relation ¶
Return a new relation with all rows from this relation and another.
This is a convenience method that constructs and applies a
Chain
operation.- Parameters:
- rhs
Relation
Other relation to chain to
self
. Must have the same columns and engine asself
.
- rhs
- Returns:
- relation
Relation
New relation with all rows from both relations. If the engine
preserves order
for chains, all rows fromself
will appear before all rows fromrhs
, in their original order. This method never returns an operand directly, even if the other hasmax_rows==0
, as it is assumed that even relations with no rows are useful to preserve in the tree fordiagnostics
.
- relation
- Raises:
- ColumnError
Raised if the two relations do not have the same columns.
- EngineError
Raised if the two relations do not have the same engine.
- RowOrderError
Raised if
self
orrhs
is unnecessarily ordered; seeexpect_unordered
.
- join(rhs: Relation, predicate: Predicate | None = None, *, backtrack: bool = True, transfer: bool = False) Relation ¶
Return a new relation that joins this one to the given one.
This is a convenience method that constructs and applies a
Join
operation, viaPartialJoin.apply
.- Parameters:
- rhs
Relation
Relation to join to
self
.- predicate
Predicate
, optional Boolean expression that must evaluate to true in order to join a a pair of rows, in addition to an implicit equality constraint on any columns in both relations.
- backtrack
bool
, optional If
True
(default) andself.engine != rhs.engine
, attempt to insert this join before a transfer upstream ofself
, as long as this can be done without breaking up any locked relations or changing the resulting relation content.- transfer
bool
, optional If
True
(False
is default) andself.engine != rhs.engine
, insert a newTransfer
before theJoin
. Ifbacktrack
is also true, the transfer is added only if the backtrack attempt fails.
- rhs
- Returns:
- relation
Relation
New relation that joins
self
torhs
. May beself
orrhs
if the other is ajoin identity
.
- relation
- Raises:
- ColumnError
Raised if the given predicate requires columns not present in
self
orrhs
.- EngineError
Raised if it was impossible to insert this operation in
rhs.engine
via backtracks or transfers onself
, or if the predicate was not supported by the engine.- RowOrderError
Raised if
self
orrhs
is unnecessarily ordered; seeexpect_unordered
.
Notes
This method does not treat
self
andrhs
symmetrically: it always considersrhs
fixed, and only backtracks into or considers applying transfers toself
.
- materialized(name: str | None = None, *, name_prefix: str = 'materialization') Relation ¶
Return a new relation that indicates that this relation’s payload should be cached after it is first processed.
This is a convenience method that constructs and applies a
Materialization
operation.- Parameters:
- name
str
, optional Name to use for the cached payload within the engine (e.g. the name for a temporary table in SQL). If not provided, a name will be created via a call to
Engine.get_relation_name
.- name_prefix
str
, optional Prefix to pass to
Engine.get_relation_name
; ignored ifname
is provided. Unlike most operations,Materialization
relations are locked by default, since they reflect user intent to mark a specific tree as cacheable.
- name
- Returns:
- relation
Relation
New relation that marks its upstream tree for caching. May be
self
if it is already aLeafRelation
or another materialization (in which case the given name or name prefix will be ignored).
- relation
- Raises:
See also
- sorted(terms: Sequence[SortTerm], *, preferred_engine: Engine | None = None, backtrack: bool = True, transfer: bool = False, require_preferred_engine: bool = False) Relation ¶
Return a new relation that sorts rows according to a sequence of column expressions.
This is a convenience method that constructs and applies a
Sort
operation.- Parameters:
- terms
Sequence
[SortTerm
] Ordered sequence of column expressions to sort on, with whether to apply them in ascending or descending order.
- preferred_engine
Engine
, optional Engine that the operation would ideally be performed in. If this is not equal to
self.engine
, thebacktrack
,transfer
, andrequire_preferred_engine
arguments control the behavior.- backtrack
bool
, optional If
True
(default) and the current engine is not the preferred engine, attempt to insert this sort before a transfer upstream of the current relation, as long as this can be done without breaking up any locked relations or changing the resulting relation content.- transfer
bool
, optional If
True
(False
is default) and the current engine is not the preferred engine, insert a newTransfer
before theSort
. Ifbacktrack
is also true, the transfer is added only if the backtrack attempt fails.- require_preferred_engine
bool
, optional If
True
(False
is default) and the current engine is not the preferred engine, raiseEngineError
. Ifbacktrack
is also true, the exception is only raised if the backtrack attempt fails. Ignored iftransfer
is true.
- terms
- Returns:
- relation
Relation
New relation with sorted rows. Will be
self
ifterms
is empty. Ifself
is already a sort operation relation, the operations will be merged by concatenating their terms, which may result in duplicate sort terms that have no effect.
- relation
- Raises:
- transferred_to(destination: Engine) Relation ¶
Return a new relation that transfers this relation to a new engine.
This is a convenience method that constructs and applies a
Transfer
operation.
- with_calculated_column(tag: ColumnTag, expression: ColumnExpression, *, preferred_engine: Engine | None = None, backtrack: bool = True, transfer: bool = False, require_preferred_engine: bool = False) Relation ¶
Return a new relation that adds a calculated column to this one.
This is a convenience method chat constructs and applies a
Calculation
operation.- Parameters:
- tag
ColumnTag
Identifier for the new column.
- expression
ColumnExpression
Expression used to populate the new column.
- preferred_engine
Engine
, optional Engine that the operation would ideally be performed in. If this is not equal to
self.engine
, thebacktrack
,transfer
, andrequire_preferred_engine
arguments control the behavior.- backtrack
bool
, optional If
True
(default) and the current engine is not the preferred engine, attempt to insert this calculation before a transfer upstream of the current relation, as long as this can be done without breaking up any locked relations or changing the resulting relation content.- transfer
bool
, optional If
True
(False
is default) and the current engine is not the preferred engine, insert a newTransfer
before theCalculation
. Ifbacktrack
is also true, the transfer is added only if the backtrack attempt fails.- require_preferred_engine
bool
, optional If
True
(False
is default) and the current engine is not the preferred engine, raiseEngineError
. Ifbacktrack
is also true, the exception is only raised if the backtrack attempt fails. Ignored iftransfer
is true.
- tag
- Returns:
- relation
Relation
Relation that contains the calculated column.
- relation
- Raises:
- ColumnError
Raised if the expression requires columns that are not present in
self.columns
, or iftag
is already present inself.columns
.- EngineError
Raised if
require_preferred_engine=True
and it was impossible to insert this operation in the preferred engine, or if the expression was not supported by the engine.
- with_only_columns(columns: Set[ColumnTag], *, preferred_engine: Engine | None = None, backtrack: bool = True, transfer: bool = False, require_preferred_engine: bool = False) Relation ¶
Return a new relation whose columns are a subset of this relation’s.
This is a convenience method that constructs and applies a
Projection
operation.- Parameters:
- columns
Set
[ColumnTag
] Columns to be propagated to the new relation; must be a subset of
self.columns
.- preferred_engine
Engine
, optional Engine that the operation would ideally be performed in. If this is not equal to
self.engine
, thebacktrack
,transfer
, andrequire_preferred_engine
arguments control the behavior.- backtrack
bool
, optional If
True
(default) and the current engine is not the preferred engine, attempt to insert this projection before a transfer upstream of the current relation, as long as this can be done without breaking up any locked relations or changing the resulting relation content.- transfer
bool
, optional If
True
(False
is default) and the current engine is not the preferred engine, insert a newTransfer
before theProjection
. Ifbacktrack
is also true, the transfer is added only if the backtrack attempt fails.- require_preferred_engine
bool
, optional If
True
(False
is default) and the current engine is not the preferred engine, raiseEngineError
. Ifbacktrack
is also true, the exception is only raised if the backtrack attempt fails. Ignored iftransfer
is true.
- columns
- Returns:
- relation
Relation
New relation with only the given columns. Will be
self
ifcolumns == self.columns
.
- relation
- Raises:
- ColumnError
Raised if
columns
is not a subset ofself.columns
.- EngineError
Raised if
require_preferred_engine=True
and it was impossible to insert this operation in the preferred engine.
- with_rows_satisfying(predicate: Predicate, *, preferred_engine: Engine | None = None, backtrack: bool = True, transfer: bool = False, require_preferred_engine: bool = False) Relation ¶
Return a new relation that filters out rows via a boolean expression.
This is a convenience method that constructions and applies a
Selection
operation.- Parameters:
- predicate
Predicate
Boolean expression that evaluates to
False
for rows that should be included andFalse
for rows that should be filtered out.- preferred_engine
Engine
, optional Engine that the operation would ideally be performed in. If this is not equal to
self.engine
, thebacktrack
,transfer
, andrequire_preferred_engine
arguments control the behavior.- backtrack
bool
, optional If
True
(default) and the current engine is not the preferred engine, attempt to insert this selection before a transfer upstream of the current relation, as long as this can be done without breaking up any locked relations or changing the resulting relation content.- transfer
bool
, optional If
True
(False
is default) and the current engine is not the preferred engine, insert a newTransfer
before theSelection
. Ifbacktrack
is also true, the transfer is added only if the backtrack attempt fails.- require_preferred_engine
bool
, optional If
True
(False
is default) and the current engine is not the preferred engine, raiseEngineError
. Ifbacktrack
is also true, the exception is only raised if the backtrack attempt fails. Ignored iftransfer
is true.
- predicate
- Returns:
- relation
Relation
New relation with only the rows that satisfy the given predicate. May be
self
if the predicate istrivially True
.
- relation
- Raises:
- ColumnError
Raised if
predicate.columns_required
is not a subset ofself.columns
.- EngineError
Raised if
require_preferred_engine=True
and it was impossible to insert this operation in the preferred engine, or if the expression was not supported by the engine.
- without_duplicates(*, preferred_engine: Engine | None = None, backtrack: bool = True, transfer: bool = False, require_preferred_engine: bool = False) Relation ¶
Return a new relation that removes any duplicate rows from this one.
This is a convenience method that constructs and applies a
Deduplication
operation.- Parameters:
- preferred_engine
Engine
, optional Engine that the operation would ideally be performed in. If this is not equal to
self.engine
, thebacktrack
,transfer
, andrequire_preferred_engine
arguments control the behavior.- backtrack
bool
, optional If
True
(default) and the current engine is not the preferred engine, attempt to insert this deduplication before a transfer upstream of the current relation, as long as this can be done without breaking up any locked relations or changing the resulting relation content.- transfer
bool
, optional If
True
(False
is default) and the current engine is not the preferred engine, insert a newTransfer
before theDeduplication
. Ifbacktrack
is also true, the transfer is added only if the backtrack attempt fails.- require_preferred_engine
bool
, optional If
True
(False
is default) and the current engine is not the preferred engine, raiseEngineError
. Ifbacktrack
is also true, the exception is only raised if the backtrack attempt fails. Ignored iftransfer
is true.
- preferred_engine
- Returns:
- relation
Relation
Relation with no duplicate rows. This may be
self
if it can be determined that there is no duplication already, but this is not guaranteed.
- relation
- Raises:
- EngineError
Raised if
require_preferred_engine=True
and it was impossible to insert this operation in the preferred engine.