python 惰性属性_在Python中具有依赖性的惰性数据流(电子表格样式)属性

在这里,这应该是诀窍.

描述符机制(语言实现“属性”)是

足够你想要的

如果代码不在一些角落的情况下,只是写我.

class DependentProperty(object):

def __init__(self, calculate=None, default=None, depends_on=()):

# "name" and "dependence_tree" properties are attributes

# set up by the metaclass of the owner class

if calculate:

self.calculate = calculate

else:

self.default = default

self.depends_on = set(depends_on)

def __get__(self, instance, owner):

if hasattr(self, "default"):

return self.default

if not hasattr(instance, "_" + self.name):

setattr(instance, "_" + self.name,

self.calculate(instance, getattr(instance, "_" + self.name + "_last_value")))

return getattr(instance, "_" + self.name)

def __set__(self, instance, value):

setattr(instance, "_" + self.name + "_last_value", value)

setattr(instance, "_" + self.name, self.calculate(instance, value))

for attr in self.dependence_tree[self.name]:

delattr(instance, attr)

def __delete__(self, instance):

try:

delattr(instance, "_" + self.name)

except AttributeError:

pass

def assemble_tree(name, dict_, all_deps = None):

if all_deps is None:

all_deps = set()

for dependance in dict_[name].depends_on:

all_deps.add(dependance)

assemble_tree(dependance, dict_, all_deps)

return all_deps

def invert_tree(tree):

new_tree = {}

for key, val in tree.items():

for dependence in val:

if dependence not in new_tree:

new_tree[dependence] = set()

new_tree[dependence].add(key)

return new_tree

class DependenceMeta(type):

def __new__(cls, name, bases, dict_):

dependence_tree = {}

properties = []

for key, val in dict_.items():

if not isinstance(val, DependentProperty):

continue

val.name = key

val.dependence_tree = dependence_tree

dependence_tree[key] = set()

properties.append(val)

inverted_tree = {}

for property in properties:

inverted_tree[property.name] = assemble_tree(property.name, dict_)

dependence_tree.update(invert_tree(inverted_tree))

return type.__new__(cls, name, bases, dict_)

if __name__ == "__main__":

# Example and visual test:

class Bla:

__metaclass__ = DependenceMeta

def calc_b(self, x):

print "Calculating b"

return x + self.a

def calc_c(self, x):

print "Calculating c"

return x + self.b

a = DependentProperty(default=10)

b = DependentProperty(depends_on=("a",), calculate=calc_b)

c = DependentProperty(depends_on=("b",), calculate=calc_c)

bla = Bla()

bla.b = 5

bla.c = 10

print bla.a, bla.b, bla.c

bla.b = 10

print bla.b

print bla.c

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值