Title: Creation of a Generalized Code Solution via Reference Variables and Any Variables


Date: August 1 2014
Clarion Date:
Duration: Two hours and a smidge more

Download Recording

Hosts: Arnold Young, John Hickey, Lisa Daugherty, Mike Hanson


Presenter:


Description:

The presentation will proceed as follows:


· Problem to be Solved


· Project Management Data Model by Contained Functional Area Data Model area


· Identification of the instances of the Problem to be Solved


· Specialized Solution to the Problem


· Down-sides to a Specialized Solution


· Approach to the creation of a Generalized Solution


· Engineering and Implementation of the Generalized Solution


· Follow-on Activities

I have attached the Cheat Sheet I employ of the “Any and Reference Variables and Generalized Procedure Routines Code.”


The “Problem to be Solved Here” is the creation and deployment of a generalized set of Procedure Routine(s) code that transforms one hierarchical collection of database records into an alternative version of that same hierarchical collection of database records without deletion, re-insertion, or disrupting any downstream data structures.


The need arises in both Bills of Materials (BOM) for network data structures, and Single File Recursion (SFR) pure hierarchies.


The base template for either is Phil Carroll’s Ultra Tree, which provides tree display, and initial adds, deletes, modifications. The problem here addresses already existing UltraTree data structures.


A Bill of Materials (BOM) network structure is accomplished with three tables: Part, Assembly, and Assembly Type. In the Metabase System these are referred to as X, X-Structure, and X-Structure Type. The Data Model Diagram throughout the Metabase System for BOM is:


The Single File Recursion (SFR) is accomplished with a single table: Part. In the Metabase System these are referred to as a SFRTable. The Data Model Diagram throughout the Metabase System for SFR is:


The task at hand is to accomplish the problem’s solution for Single File Recursions. Currently the solution involves Embeds and supporting Clarion language code for:


· Local Data, Generated Declarations, <after Window Structure>


· LocalObjectsUltraTree ==> SFRToTree ==> TreeTagManager ==> TakeTagStateChange ==> Code ==> Before ParentCall


· LocalObjectsUltraTree ==> SFRFromTree ==> TreeTagManager ==> TakeTagStateChange ==> Code ==> Before ParentCall


· Control Events ==> ButtonReallocate ==> Accepted ==> after Generated Code

In addition, there are two sets of Procedure Routines as follows:


· The Reference Data equates specification statements that bind the generalized Reference Variables and Any Variables to database tables, keys, and columns


· 23 specific Procedure Routines that accomplish UltraTree Tagging, ReAllocation of the FromTree and ToTree data structures, and Resetting to defaults for subsequent ReAllocation

At the present time, the 23 specific Procedure Routines are copied into each Clarion Procedure as depicted in the diagrams of the attached PDF . A natural and soon to be accomplished will be to “factor” out these 23 specific Procedure Routines to a Metabase Common Procedures DLL.

Announcements:


Old Business: None


New Business: None


Word.Of.The.Day:


Topics Covered:


Additional Downloads: None


Slide Show:


Time Events:

Time
Event
0:00
Webinar Introduction


Webinar Recording


Fourth Rule Of The Webinar:


Discussion:


comments powered by Disqus