Proceedings of the 21st European Conference on Object-Oriented Programming (ECOOP), Berlin

Data in object-oriented programming is organized in a hierarchy of classes. The problem of *object-oriented pattern matching* is how to explore this hierarchy from the outside. This usually involves classifying objects by their run-time type, accessing their members, or determining some other characteristic of a group of objects. In this paper we compare six different pattern matching techniques: object-oriented decomposition, visitors, type-tests/type-casts, typecase, case classes, and extractors. The techniques are compared on nine criteria related to conciseness, maintainability and performance. The paper introduces case classes and extractors as two new pattern-matching methods and shows that their combination works well for all of the established criteria.


Editor(s):
Emir, Burak
Kennedy, Andrew
Russo, Claudio
Yu, Dachuan
Presented at:
European Conference on Object-Oriented Programming (ECOOP), Berlin, July 30 - August 03
Year:
2006
Publisher:
Heidelberg, Springer
Keywords:
Laboratories:




 Record created 2007-04-23, last modified 2018-03-17

External link:
Download fulltext
URL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)