Yes I've been thinking a bit about HashTables and hashMaps. Effectively
that's the closest thing you get to an associative array. And can simulate
a tree. If we concede the ordering of keys then a simple
HashMap would even do the trick if we concatenate the
categoryoption identifiers together, l
Hi Bob,
Good question. I like the idea of an in-memory cache for speed, as you
suggest. You might try using a HashTable where the key is an array of
option value Strings and the value of the HashTable is the optionCombo. As
you process the import, each time you get from the dataElement a
categoryC
Hi
Here's a problem. Apologies, its a long mail, but its a serious business
and needs to be untangled.
Two or more systems have matching dataelements, categorycombos, categories
and categoryoptions. They could be matched on uid, name, code or what
ever. Assuming they also have matching orgunit
3 matches
Mail list logo
