摘要 : One-way, dataflow constraints are commonly used in graphical interface toolkits, programming en- vironments, and circuit applications. Previous papers on dataflow constraints have focused on the design and implementation of indivi... 展开 One-way, dataflow constraints are commonly used in graphical interface toolkits, programming en- vironments, and circuit applications. Previous papers on dataflow constraints have focused on the design and implementation of individual algorithms. In contrast, this article focuses on the lessons we have learned from a decade of implementing competing algorithms in the Garnet and Amulet graphical interface toolkits. These lessons reveal the design and implementation tradeoffs for dif- ferent one-way, constraint satisfaction algorithms. 收起