[Date Prev] | [Thread Prev] | [Thread Next] | [Date Next] -- [Date Index] | [Thread Index] | [List Home]
Subject: Conceptual Refinement for DITA 1.3: Navigation Tree
Hi Folks Regarding Navigation tree. Its seems that “within every map there is a tree trying to get out”. Or perhaps “there is a publication trying to get out”. Anyhow… It might be interesting to define specific DITA processing functions and name the output of those functions. For example: Define: ditaContent = a set of DITA compliant content that is typically componentized to aid in re-use and re-purpose… Define: filteredContent = filterContent(ditaContent) - filterContent transforms the ditaContent into filteredContent by applying conditional processing attribute exclusions and inclusions… Define: pulledMap = pullMaps(rootMap, filteredContent) - pullMaps is a function on a rootMap and filteredContent whereby all submaps are pulled to construct one “pullMap” according to the following procedure… These functions could be linked such that the output of one is the input of another – similar to the preprocessing done in the OT. Define: preProcessedContent = pullMaps(resolveKeys(filterContent(ditaContent)))) With all that you can simply define navigationTree – if we deem it important. Define: navigationTree = filterNormalTopicRefs(preProcessedContent) This or a similar formal treatment of the “processing” of DITA may give us a rich formal language to concisely define things like navigation trees and other things as well. Jim From: dita@lists.oasis-open.org [mailto:dita@lists.oasis-open.org] On Behalf Of Richard Hamilton
|
[Date Prev] | [Thread Prev] | [Thread Next] | [Date Next] -- [Date Index] | [Thread Index] | [List Home]