| | 226 | |
| | 227 | ---- |
| | 228 | === 11/17/09 === |
| | 229 | |
| | 230 | Modifications on writer have been completed (preliminary checks worked). |
| | 231 | * reverted Db.hupdate to only update. The calling functions should decide whether to insert or update. |
| | 232 | * Mb_id nows checks against serial instead of location in the Identify class |
| | 233 | * update_mb now checks for mb_id. If the ID is present it will update the record |
| | 234 | otherwise it will insert WITHOUT specifying and ID since SQL should autoincremt the ids |
| | 235 | * Nodes are uniquely identified by a triple of (node_id, location_id, motherboar_id). Its assumed that the (node_id,location_id) |
| | 236 | portion is constant. Thus the only change/ update we should check for and preform is to ensure that the motherboard id matches |
| | 237 | for a given node_id, location_id pair. the update_node function only modifies motherboard_id's |
| | 238 | |
| | 239 | Things that need to be done: |
| | 240 | * move all the "checks" into the get methods (depreciate the get methods). check() should simply call the sub_check methods and retain |
| | 241 | a hash of matches for specific data structures (table entries). |
| | 242 | * update can then iterate that hash and call the respective update functions for each give table. |
| | 243 | * the data structure design paradigm should be to have one data structure for each table that needs to be checked / update. It's |
| | 244 | pretty close to this, but needs a little work. |
| | 245 | |