Data Abstraction Question
Forgive my ignorance! Can someone help me "think in Lisp" about this?
Imagine a "structure or class" representing a (relational) database Relation
(table if you like), that has Attributes - a "list" of Attribute (column if
you like). (I use the term "list" loosely here to mean some aggregation, the
implementation of which may change.)
I want to abstract the way in which Attributes is implemented (good
programming, able to change later, ...). What is a good Scheme way to deal
with actions comparable to list "map" functions. Is it to implement a "map"
function for Attributes that I pass in functions to get the desired result?
Do I define a method to get-a-list of attributes and then work externally on
that with list functions?
For example I want to build functionality like build-update-stored-procedure,
etc. which could be done by mapping over the Attributes.
Alex
----- Posted via NewsOne.Net: Free (anonymous) Usenet News via the Web -----
http://www.*-*-*.com/ ,000+ groups
NewsOne.Net prohibits users from posting spam. If this or other posts