154 reputation
6
bio website
location
age
visits member for 2 years, 9 months
seen Jul 7 at 6:41

Sep
10
comment Algorithm to calculate trajectories from vector field
Thank you, RK4 seems to be the way to go. Strict denseness is not so important, I think I'll go with something heuristic, like marking cells as 'visited' when a trajectory crosses them, and then starting new trajectories on 'non-visited' cells.
Sep
9
comment Algorithm to calculate trajectories from vector field
Yes I need multiple trajectories close to each other (that's what I meant with 'denseness'). And no, u and v are not linear. I don't have any analytical definition for u and v, they are calculated numerically.
Dec
14
comment Does command/query separation apply to a method that creates an object and returns its ID?
Apparently you did not read the link I provided. CQS catch-phrase: Asking a question should not change the answer. In your first method, you have a method ('createA') which provides an 'answer', but it changes the answer every time you ask. In the second method you do not have that, this is the 'goodness' in it. To be clear: I'm no CQS purist, I do not follow it every time.
Dec
13
comment Does command/query separation apply to a method that creates an object and returns its ID?
I did not say the second method is 'good'. I said it follows the CQS paradigm. If you don't follow CQS, I suppose the second method is not good for you. If you want to know why some people try to follow CQS, see http://en.wikipedia.org/wiki/Command-query_separation