what a pain to understand the looooooong documentation before using the desired libraries. There are so many data structrue and function definition, to get one thing, I must follow a pointer with argly name,to get another thing, I must call a strange function.
So can we avoid this??
And we dont want to put extra burdent on library developer to support this.
So I think we may need to do a transitive closure computing to find out all ways of geting to other object, by following pointer and/or calling functions.
Problem of this way is that, we may get huge size of data. But we can overcome this by lazy evluation of haskell.
On the other hand, Maybe my previous idea on general data structrue enumerator is a partial solution to this.
By general data structrue enumerator, I means that we only need to call a special function or invoke a special syntax, and give out the condition expressed in regular expression(or 2D RE for tree like structure?), then give the statement to be executed.
2008年10月14日星期二
订阅:
博文评论 (Atom)
1 条评论:
Maybe my previous idea on generaldata structrue enumerator is a partial solution to this.
By generaldata structrue enumerator, I means that we only need to call a special function or invoke a special syntax, and give out the condition expressed in regular expression(or 2D RE for tree like structure?), then give the statement to be executed.
发表评论