You say
Quote:
|
And that is why there's no generic answer to your question.
|
But there are heuristics right? So you're saying that, if it's getting thru my thick head

:
A) A knowledge of the data and it's source and the amount of it's possible content is imperative to proper implementation of the system to warrant against the "too little" or "too much" problems.
B) VOs are a possible and probably good choice for RIAs but the precepts of (A) must be kept in mind.
Is that right? Did I interpret it correctly? And if so then would a data structure be able to be devised that had flags and info in it to know these heuristics? By that I mean a "somewhat generic" data class that has for example (this is just off the top of my head) a bool denoting if it's a chunk or the full content. Some numeric variables that provide info as to how much of a chunk it is. Then the specific data class could be developed as a subclass of this somewhat generic class.
For example something like this:
Code:
package myStuff
{
class kindagenericdataclass
{
public var isChunk:Boolean;
public var notsurewhatotherdataisneededrightnow:int;
(other support stuff)
}
}
and then the VO code could be written something like this:
Code:
package program.VO
{class users extends myStuff.kindagenericdataclass
{var name:String; // username
var password:String; // user password
}
}
Does that seem feasible or totally off base to you? If I'm not totally off my rocker here (which may be the case) then do you have any ideas on some of the heuristics that might be used? Or places to look as far as discovering those?
Christopher