first draft of a merge rule set

[Linas Vepstas]

On Wed, Apr 14, 2004 at 10:01:39AM -0400, Derek Atkins was heard to remark:
Hi,

> >
> > #define GMGNC_COMMODITY_FIELDS(x) {		\
> > 	create_rule(x, "fullname", GMSTRING); 	\
> > 	create_rule(x, "namespace", GMSTRING);	\
> > 	create_rule(x, "mnemonic", GMSTRING); 	\
> > 	create_rule(x, "printname", GMSTRING);	\
> > 	create_rule(x, "exchange_code", GMSTRING); \
> > 	create_rule(x, "fraction", GMINT); 	\
> > 	create_rule(x, "unique_name", GMSTRING); 	\
> > 	create_rule(x, "mark", GMGINT16); 		\
> > 	create_rule(x, "quote_flag", GMGBOOLEAN); 	\
> > 	create_rule(x, "quote_source", GMGNC_QUOTE_SOURCE); }
> >
> > So far, a routine is working to assemble these rule sets into a workable 
> > structure. 
> 
> This is looking AWFULLY similar to the qof-object definitions.

Yep, I jumped out of my chair when I saw this.

Clearly, I missed an earlier email that introduced the idea of 
what you are trying to do.  Can yo run that by me again?
Meanwhile, I'll look for it ... 

> We already need to re-define objects multiple times (C struct,
> QofObject, XML Schema, and SQL Schema)..  I know Linas is trying to

Yep, so if there is a need for an additional feature to map objects to 
something else, let me know now, so that I can get them in.
Just don't say 'use haskell monads'.

>   QofMergeResult qof_object_merge_compare(QofInstance*, QofInstance*);

? what's this do?

> I hope the comparison functions are based in the core objects???

There already are compare funcs, used for sorting the results 
from queries.  Do these need to be enhanced?

--linas


-- 
pub  1024D/01045933 2001-02-01 Linas Vepstas (Labas!) <linas at linas.org>
PGP Key fingerprint = 8305 2521 6000 0B5E 8984  3F54 64A9 9A82 0104 5933