mirror of
https://github.com/wassname/catalyst.git
synced 2026-07-11 08:03:42 +08:00
5f190395ad
- Adds a new class, ``LabelArray``, which is a subclass of np.ndarray. LabelArray is conceptually similar to pandas.Categorical, in that it stores data with many duplicate values as indices into an array of unique values. For string data with many duplicates (e.g. time-series of tickers or or industry classifications), this provides multiple orders of magnitude of improvement when doing string operations, especially string comparison/matching operations. - Adds a new generic object "specialization" for `AdjustedArrayWindow`, and a corresponding ObjectOverwrite adjustment. - Adds a new ``postprocess`` method to ``zipline.pipeline.term.Term``. This method is called on the final result of any pipeline expression after screen filtering has occurred. The default implementation of ``postprocess`` is identity, but Classifier overrides it to coerce string columns into pandas.Categoricals before presenting them to the user.
572 lines
18 KiB
Python
572 lines
18 KiB
Python
"""
|
|
Tests for Term.
|
|
"""
|
|
from collections import Counter
|
|
from itertools import product
|
|
from unittest import TestCase
|
|
|
|
from zipline.errors import (
|
|
DTypeNotSpecified,
|
|
WindowedInputToWindowedTerm,
|
|
NotDType,
|
|
TermInputsNotSpecified,
|
|
TermOutputsEmpty,
|
|
UnsupportedDType,
|
|
WindowLengthNotSpecified,
|
|
)
|
|
from zipline.pipeline import (
|
|
Classifier,
|
|
CustomFactor,
|
|
Factor,
|
|
Filter,
|
|
TermGraph,
|
|
)
|
|
from zipline.pipeline.data import Column, DataSet
|
|
from zipline.pipeline.data.testing import TestingDataSet
|
|
from zipline.pipeline.term import AssetExists, NotSpecified
|
|
from zipline.pipeline.expression import NUMEXPR_MATH_FUNCS
|
|
from zipline.utils.numpy_utils import (
|
|
bool_dtype,
|
|
complex128_dtype,
|
|
datetime64ns_dtype,
|
|
float64_dtype,
|
|
int64_dtype,
|
|
NoDefaultMissingValue,
|
|
)
|
|
|
|
|
|
class SomeDataSet(DataSet):
|
|
foo = Column(float64_dtype)
|
|
bar = Column(float64_dtype)
|
|
buzz = Column(float64_dtype)
|
|
|
|
|
|
class SubDataSet(SomeDataSet):
|
|
pass
|
|
|
|
|
|
class SubDataSetNewCol(SomeDataSet):
|
|
qux = Column(float64_dtype)
|
|
|
|
|
|
class SomeFactor(Factor):
|
|
dtype = float64_dtype
|
|
window_length = 5
|
|
inputs = [SomeDataSet.foo, SomeDataSet.bar]
|
|
|
|
SomeFactorAlias = SomeFactor
|
|
|
|
|
|
class SomeOtherFactor(Factor):
|
|
dtype = float64_dtype
|
|
window_length = 5
|
|
inputs = [SomeDataSet.bar, SomeDataSet.buzz]
|
|
|
|
|
|
class DateFactor(Factor):
|
|
dtype = datetime64ns_dtype
|
|
window_length = 5
|
|
inputs = [SomeDataSet.bar, SomeDataSet.buzz]
|
|
|
|
|
|
class NoLookbackFactor(Factor):
|
|
dtype = float64_dtype
|
|
window_length = 0
|
|
|
|
|
|
class GenericCustomFactor(CustomFactor):
|
|
dtype = float64_dtype
|
|
window_length = 5
|
|
inputs = [SomeDataSet.foo]
|
|
|
|
|
|
class MultipleOutputs(CustomFactor):
|
|
dtype = float64_dtype
|
|
window_length = 5
|
|
inputs = [SomeDataSet.foo, SomeDataSet.bar]
|
|
outputs = ['alpha', 'beta']
|
|
|
|
|
|
def gen_equivalent_factors():
|
|
"""
|
|
Return an iterator of SomeFactor instances that should all be the same
|
|
object.
|
|
"""
|
|
yield SomeFactor()
|
|
yield SomeFactor(inputs=NotSpecified)
|
|
yield SomeFactor(SomeFactor.inputs)
|
|
yield SomeFactor(inputs=SomeFactor.inputs)
|
|
yield SomeFactor([SomeDataSet.foo, SomeDataSet.bar])
|
|
yield SomeFactor(window_length=SomeFactor.window_length)
|
|
yield SomeFactor(window_length=NotSpecified)
|
|
yield SomeFactor(
|
|
[SomeDataSet.foo, SomeDataSet.bar],
|
|
window_length=NotSpecified,
|
|
)
|
|
yield SomeFactor(
|
|
[SomeDataSet.foo, SomeDataSet.bar],
|
|
window_length=SomeFactor.window_length,
|
|
)
|
|
yield SomeFactorAlias()
|
|
|
|
|
|
def to_dict(l):
|
|
"""
|
|
Convert a list to a dict with keys drawn from '0', '1', '2', ...
|
|
|
|
Example
|
|
-------
|
|
>>> to_dict([2, 3, 4])
|
|
{'0': 2, '1': 3, '2': 4}
|
|
"""
|
|
return dict(zip(map(str, range(len(l))), l))
|
|
|
|
|
|
class DependencyResolutionTestCase(TestCase):
|
|
|
|
def check_dependency_order(self, ordered_terms):
|
|
seen = set()
|
|
|
|
for term in ordered_terms:
|
|
for dep in term.dependencies:
|
|
self.assertIn(dep, seen)
|
|
|
|
seen.add(term)
|
|
|
|
def test_single_factor(self):
|
|
"""
|
|
Test dependency resolution for a single factor.
|
|
"""
|
|
def check_output(graph):
|
|
|
|
resolution_order = list(graph.ordered())
|
|
|
|
self.assertEqual(len(resolution_order), 4)
|
|
self.check_dependency_order(resolution_order)
|
|
self.assertIn(AssetExists(), resolution_order)
|
|
self.assertIn(SomeDataSet.foo, resolution_order)
|
|
self.assertIn(SomeDataSet.bar, resolution_order)
|
|
self.assertIn(SomeFactor(), resolution_order)
|
|
|
|
self.assertEqual(graph.node[SomeDataSet.foo]['extra_rows'], 4)
|
|
self.assertEqual(graph.node[SomeDataSet.bar]['extra_rows'], 4)
|
|
|
|
for foobar in gen_equivalent_factors():
|
|
check_output(TermGraph(to_dict([foobar])))
|
|
|
|
def test_single_factor_instance_args(self):
|
|
"""
|
|
Test dependency resolution for a single factor with arguments passed to
|
|
the constructor.
|
|
"""
|
|
bar, buzz = SomeDataSet.bar, SomeDataSet.buzz
|
|
graph = TermGraph(to_dict([SomeFactor([bar, buzz], window_length=5)]))
|
|
|
|
resolution_order = list(graph.ordered())
|
|
|
|
# SomeFactor, its inputs, and AssetExists()
|
|
self.assertEqual(len(resolution_order), 4)
|
|
self.check_dependency_order(resolution_order)
|
|
self.assertIn(AssetExists(), resolution_order)
|
|
self.assertEqual(graph.extra_rows[AssetExists()], 4)
|
|
|
|
self.assertIn(bar, resolution_order)
|
|
self.assertIn(buzz, resolution_order)
|
|
self.assertIn(SomeFactor([bar, buzz], window_length=5),
|
|
resolution_order)
|
|
self.assertEqual(graph.extra_rows[bar], 4)
|
|
self.assertEqual(graph.extra_rows[buzz], 4)
|
|
|
|
def test_reuse_loadable_terms(self):
|
|
"""
|
|
Test that raw inputs only show up in the dependency graph once.
|
|
"""
|
|
f1 = SomeFactor([SomeDataSet.foo, SomeDataSet.bar])
|
|
f2 = SomeOtherFactor([SomeDataSet.bar, SomeDataSet.buzz])
|
|
|
|
graph = TermGraph(to_dict([f1, f2]))
|
|
resolution_order = list(graph.ordered())
|
|
|
|
# bar should only appear once.
|
|
self.assertEqual(len(resolution_order), 6)
|
|
self.assertEqual(len(set(resolution_order)), 6)
|
|
self.check_dependency_order(resolution_order)
|
|
|
|
def test_disallow_recursive_lookback(self):
|
|
|
|
with self.assertRaises(WindowedInputToWindowedTerm):
|
|
SomeFactor(inputs=[SomeFactor(), SomeDataSet.foo])
|
|
|
|
|
|
class ObjectIdentityTestCase(TestCase):
|
|
|
|
def assertSameObject(self, *objs):
|
|
first = objs[0]
|
|
for obj in objs:
|
|
self.assertIs(first, obj)
|
|
|
|
def assertDifferentObjects(self, *objs):
|
|
id_counts = Counter(map(id, objs))
|
|
((most_common_id, count),) = id_counts.most_common(1)
|
|
if count > 1:
|
|
dupe = [o for o in objs if id(o) == most_common_id][0]
|
|
self.fail("%s appeared %d times in %s" % (dupe, count, objs))
|
|
|
|
def test_instance_caching(self):
|
|
|
|
self.assertSameObject(*gen_equivalent_factors())
|
|
self.assertIs(
|
|
SomeFactor(window_length=SomeFactor.window_length + 1),
|
|
SomeFactor(window_length=SomeFactor.window_length + 1),
|
|
)
|
|
|
|
self.assertIs(
|
|
SomeFactor(dtype=float64_dtype),
|
|
SomeFactor(dtype=float64_dtype),
|
|
)
|
|
|
|
self.assertIs(
|
|
SomeFactor(inputs=[SomeFactor.inputs[1], SomeFactor.inputs[0]]),
|
|
SomeFactor(inputs=[SomeFactor.inputs[1], SomeFactor.inputs[0]]),
|
|
)
|
|
|
|
mask = SomeFactor() + SomeOtherFactor()
|
|
self.assertIs(SomeFactor(mask=mask), SomeFactor(mask=mask))
|
|
|
|
def test_instance_caching_multiple_outputs(self):
|
|
self.assertIs(MultipleOutputs(), MultipleOutputs())
|
|
self.assertIs(
|
|
MultipleOutputs(),
|
|
MultipleOutputs(outputs=MultipleOutputs.outputs),
|
|
)
|
|
self.assertIs(
|
|
MultipleOutputs(
|
|
outputs=[
|
|
MultipleOutputs.outputs[1], MultipleOutputs.outputs[0],
|
|
],
|
|
),
|
|
MultipleOutputs(
|
|
outputs=[
|
|
MultipleOutputs.outputs[1], MultipleOutputs.outputs[0],
|
|
],
|
|
),
|
|
)
|
|
|
|
# Ensure that both methods of accessing our outputs return the same
|
|
# things.
|
|
multiple_outputs = MultipleOutputs()
|
|
alpha, beta = MultipleOutputs()
|
|
self.assertIs(alpha, multiple_outputs.alpha)
|
|
self.assertIs(beta, multiple_outputs.beta)
|
|
|
|
def test_instance_non_caching(self):
|
|
|
|
f = SomeFactor()
|
|
|
|
# Different window_length.
|
|
self.assertIsNot(
|
|
f,
|
|
SomeFactor(window_length=SomeFactor.window_length + 1),
|
|
)
|
|
|
|
# Different dtype
|
|
self.assertIsNot(
|
|
f,
|
|
SomeFactor(dtype=datetime64ns_dtype)
|
|
)
|
|
|
|
# Reordering inputs changes semantics.
|
|
self.assertIsNot(
|
|
f,
|
|
SomeFactor(inputs=[SomeFactor.inputs[1], SomeFactor.inputs[0]]),
|
|
)
|
|
|
|
def test_instance_non_caching_redefine_class(self):
|
|
|
|
orig_foobar_instance = SomeFactorAlias()
|
|
|
|
class SomeFactor(Factor):
|
|
dtype = float64_dtype
|
|
window_length = 5
|
|
inputs = [SomeDataSet.foo, SomeDataSet.bar]
|
|
|
|
self.assertIsNot(orig_foobar_instance, SomeFactor())
|
|
|
|
def test_instance_non_caching_multiple_outputs(self):
|
|
multiple_outputs = MultipleOutputs()
|
|
|
|
# Different outputs.
|
|
self.assertIsNot(
|
|
MultipleOutputs(), MultipleOutputs(outputs=['beta', 'gamma']),
|
|
)
|
|
|
|
# Reordering outputs.
|
|
self.assertIsNot(
|
|
multiple_outputs,
|
|
MultipleOutputs(
|
|
outputs=[
|
|
MultipleOutputs.outputs[1], MultipleOutputs.outputs[0],
|
|
],
|
|
),
|
|
)
|
|
|
|
# Different factors sharing an output name should produce different
|
|
# RecarrayField factors.
|
|
orig_beta = multiple_outputs.beta
|
|
beta, gamma = MultipleOutputs(outputs=['beta', 'gamma'])
|
|
self.assertIsNot(beta, orig_beta)
|
|
|
|
def test_instance_caching_binops(self):
|
|
f = SomeFactor()
|
|
g = SomeOtherFactor()
|
|
for lhs, rhs in product([f, g], [f, g]):
|
|
self.assertIs((lhs + rhs), (lhs + rhs))
|
|
self.assertIs((lhs - rhs), (lhs - rhs))
|
|
self.assertIs((lhs * rhs), (lhs * rhs))
|
|
self.assertIs((lhs / rhs), (lhs / rhs))
|
|
self.assertIs((lhs ** rhs), (lhs ** rhs))
|
|
|
|
self.assertIs((1 + rhs), (1 + rhs))
|
|
self.assertIs((rhs + 1), (rhs + 1))
|
|
|
|
self.assertIs((1 - rhs), (1 - rhs))
|
|
self.assertIs((rhs - 1), (rhs - 1))
|
|
|
|
self.assertIs((2 * rhs), (2 * rhs))
|
|
self.assertIs((rhs * 2), (rhs * 2))
|
|
|
|
self.assertIs((2 / rhs), (2 / rhs))
|
|
self.assertIs((rhs / 2), (rhs / 2))
|
|
|
|
self.assertIs((2 ** rhs), (2 ** rhs))
|
|
self.assertIs((rhs ** 2), (rhs ** 2))
|
|
|
|
self.assertIs((f + g) + (f + g), (f + g) + (f + g))
|
|
|
|
def test_instance_caching_unary_ops(self):
|
|
f = SomeFactor()
|
|
self.assertIs(-f, -f)
|
|
self.assertIs(--f, --f)
|
|
self.assertIs(---f, ---f)
|
|
|
|
def test_instance_caching_math_funcs(self):
|
|
f = SomeFactor()
|
|
for funcname in NUMEXPR_MATH_FUNCS:
|
|
method = getattr(f, funcname)
|
|
self.assertIs(method(), method())
|
|
|
|
def test_parameterized_term(self):
|
|
|
|
class SomeFactorParameterized(SomeFactor):
|
|
params = ('a', 'b')
|
|
|
|
f = SomeFactorParameterized(a=1, b=2)
|
|
self.assertEqual(f.params, {'a': 1, 'b': 2})
|
|
|
|
g = SomeFactorParameterized(a=1, b=3)
|
|
h = SomeFactorParameterized(a=2, b=2)
|
|
self.assertDifferentObjects(f, g, h)
|
|
|
|
f2 = SomeFactorParameterized(a=1, b=2)
|
|
f3 = SomeFactorParameterized(b=2, a=1)
|
|
self.assertSameObject(f, f2, f3)
|
|
|
|
self.assertEqual(f.params['a'], 1)
|
|
self.assertEqual(f.params['b'], 2)
|
|
self.assertEqual(f.window_length, SomeFactor.window_length)
|
|
self.assertEqual(f.inputs, tuple(SomeFactor.inputs))
|
|
|
|
def test_bad_input(self):
|
|
|
|
class SomeFactor(Factor):
|
|
dtype = float64_dtype
|
|
|
|
class SomeFactorDefaultInputs(SomeFactor):
|
|
inputs = (SomeDataSet.foo, SomeDataSet.bar)
|
|
|
|
class SomeFactorDefaultLength(SomeFactor):
|
|
window_length = 10
|
|
|
|
class SomeFactorNoDType(SomeFactor):
|
|
window_length = 10
|
|
inputs = (SomeDataSet.foo,)
|
|
dtype = NotSpecified
|
|
|
|
with self.assertRaises(TermInputsNotSpecified):
|
|
SomeFactor(window_length=1)
|
|
|
|
with self.assertRaises(TermInputsNotSpecified):
|
|
SomeFactorDefaultLength()
|
|
|
|
with self.assertRaises(WindowLengthNotSpecified):
|
|
SomeFactor(inputs=(SomeDataSet.foo,))
|
|
|
|
with self.assertRaises(WindowLengthNotSpecified):
|
|
SomeFactorDefaultInputs()
|
|
|
|
with self.assertRaises(DTypeNotSpecified):
|
|
SomeFactorNoDType()
|
|
|
|
with self.assertRaises(NotDType):
|
|
SomeFactor(dtype=1)
|
|
|
|
with self.assertRaises(NoDefaultMissingValue):
|
|
SomeFactor(dtype=int64_dtype)
|
|
|
|
with self.assertRaises(UnsupportedDType):
|
|
SomeFactor(dtype=complex128_dtype)
|
|
|
|
with self.assertRaises(TermOutputsEmpty):
|
|
MultipleOutputs(outputs=[])
|
|
|
|
def test_bad_output_access(self):
|
|
with self.assertRaises(AttributeError) as e:
|
|
SomeFactor().not_an_attr
|
|
|
|
errmsg = str(e.exception)
|
|
self.assertEqual(
|
|
errmsg, "'SomeFactor' object has no attribute 'not_an_attr'",
|
|
)
|
|
|
|
with self.assertRaises(AttributeError) as e:
|
|
MultipleOutputs().not_an_attr
|
|
|
|
errmsg = str(e.exception)
|
|
self.assertEqual(
|
|
errmsg,
|
|
"Instance of MultipleOutputs has no output called 'not_an_attr'.",
|
|
)
|
|
|
|
with self.assertRaises(ValueError) as e:
|
|
alpha, beta = GenericCustomFactor()
|
|
|
|
errmsg = str(e.exception)
|
|
self.assertEqual(
|
|
errmsg, "GenericCustomFactor does not have multiple outputs.",
|
|
)
|
|
|
|
def test_require_super_call_in_validate(self):
|
|
|
|
class MyFactor(Factor):
|
|
inputs = ()
|
|
dtype = float64_dtype
|
|
window_length = 0
|
|
|
|
def _validate(self):
|
|
"Woops, I didn't call super()!"
|
|
|
|
with self.assertRaises(AssertionError) as e:
|
|
MyFactor()
|
|
|
|
errmsg = str(e.exception)
|
|
self.assertEqual(
|
|
errmsg,
|
|
"Term._validate() was not called.\n"
|
|
"This probably means that you overrode _validate"
|
|
" without calling super()."
|
|
)
|
|
|
|
def test_latest_on_different_dtypes(self):
|
|
factor_dtypes = (float64_dtype, datetime64ns_dtype)
|
|
for column in TestingDataSet.columns:
|
|
if column.dtype == bool_dtype:
|
|
self.assertIsInstance(column.latest, Filter)
|
|
elif (column.dtype == int64_dtype
|
|
or column.dtype.kind in ('O', 'S', 'U')):
|
|
self.assertIsInstance(column.latest, Classifier)
|
|
elif column.dtype in factor_dtypes:
|
|
self.assertIsInstance(column.latest, Factor)
|
|
else:
|
|
self.fail(
|
|
"Unknown dtype %s for column %s" % (column.dtype, column)
|
|
)
|
|
# These should be the same value, plus this has the convenient
|
|
# property of correctly handling `NaN`.
|
|
self.assertIs(column.missing_value, column.latest.missing_value)
|
|
|
|
def test_failure_timing_on_bad_dtypes(self):
|
|
|
|
# Just constructing a bad column shouldn't fail.
|
|
Column(dtype=int64_dtype)
|
|
with self.assertRaises(NoDefaultMissingValue) as e:
|
|
class BadDataSet(DataSet):
|
|
bad_column = Column(dtype=int64_dtype)
|
|
float_column = Column(dtype=float64_dtype)
|
|
int_column = Column(dtype=int64_dtype, missing_value=3)
|
|
|
|
self.assertTrue(
|
|
str(e.exception.args[0]).startswith(
|
|
"Failed to create Column with name 'bad_column'"
|
|
)
|
|
)
|
|
|
|
Column(dtype=complex128_dtype)
|
|
with self.assertRaises(UnsupportedDType):
|
|
class BadDataSetComplex(DataSet):
|
|
bad_column = Column(dtype=complex128_dtype)
|
|
float_column = Column(dtype=float64_dtype)
|
|
int_column = Column(dtype=int64_dtype, missing_value=3)
|
|
|
|
|
|
class SubDataSetTestCase(TestCase):
|
|
def test_subdataset(self):
|
|
some_dataset_map = {
|
|
column.name: column for column in SomeDataSet.columns
|
|
}
|
|
sub_dataset_map = {
|
|
column.name: column for column in SubDataSet.columns
|
|
}
|
|
self.assertEqual(
|
|
{column.name for column in SomeDataSet.columns},
|
|
{column.name for column in SubDataSet.columns},
|
|
)
|
|
for k, some_dataset_column in some_dataset_map.items():
|
|
sub_dataset_column = sub_dataset_map[k]
|
|
self.assertIsNot(
|
|
some_dataset_column,
|
|
sub_dataset_column,
|
|
'subclass column %r should not have the same identity as'
|
|
' the parent' % k,
|
|
)
|
|
self.assertEqual(
|
|
some_dataset_column.dtype,
|
|
sub_dataset_column.dtype,
|
|
'subclass column %r should have the same dtype as the parent' %
|
|
k,
|
|
)
|
|
|
|
def test_add_column(self):
|
|
some_dataset_map = {
|
|
column.name: column for column in SomeDataSet.columns
|
|
}
|
|
sub_dataset_new_col_map = {
|
|
column.name: column for column in SubDataSetNewCol.columns
|
|
}
|
|
sub_col_names = {column.name for column in SubDataSetNewCol.columns}
|
|
|
|
# check our extra col
|
|
self.assertIn('qux', sub_col_names)
|
|
self.assertEqual(
|
|
sub_dataset_new_col_map['qux'].dtype,
|
|
float64_dtype,
|
|
)
|
|
|
|
self.assertEqual(
|
|
{column.name for column in SomeDataSet.columns},
|
|
sub_col_names - {'qux'},
|
|
)
|
|
for k, some_dataset_column in some_dataset_map.items():
|
|
sub_dataset_column = sub_dataset_new_col_map[k]
|
|
self.assertIsNot(
|
|
some_dataset_column,
|
|
sub_dataset_column,
|
|
'subclass column %r should not have the same identity as'
|
|
' the parent' % k,
|
|
)
|
|
self.assertEqual(
|
|
some_dataset_column.dtype,
|
|
sub_dataset_column.dtype,
|
|
'subclass column %r should have the same dtype as the parent' %
|
|
k,
|
|
)
|