Augmenting the display of data in a tree format

Abstract

The method includes identifying a tree data structure. The method includes identifying one or more features in the identified tree data structure, wherein the one or more features comprise at least one of: a node of the tree data structure, an object of the tree data structure, an array of the tree data structure, an object property of the tree data structure, and a root of the tree data structure. The method includes determining whether one of the one or more identified features matches a feature that initiates execution of a rule, wherein the rule defines augmentations to the tree data structure based upon one or more features in the tree data structure. The method includes augmenting the identified tree data structure based upon the determined one or more matches of the one or more identified features and the feature that initiates execution of the rule.

What is claimed is: 
     
         1 . A method for augmenting data tree structures, the method comprising:
 identifying, by one or more computer processors, a tree data structure;   identifying, by one or more computer processors, one or more features in the identified tree data structure, wherein the one or more features comprise at least one of: a node of the tree data structure, an object of the tree data structure, an array of the tree data structure, an object property of the tree data structure, and a root of the tree data structure, wherein identifying one or more features of the identified tree data structure comprises:
 identifying, by one or more computer processors, a path of a node in the tree data structure that matches a regular expression; 
   determining, by one or more computer processors, whether one of the one or more identified features matches a feature that initiates execution of a rule, wherein the rule defines augmentations to the tree data structure based upon one or more features in the tree data structure, wherein a feature that initiates execution of a rule comprises one of:
 determining, by one or more computer processors, that a node path matches a regular expression, 
 determining, by one or more computer processors, that a child node path maps to a preset value, 
 determining, by one or more computer processors, that a child node path maps to a value that evaluates to a preset value, and 
 determining, by one or more computer processors, that a child node path exists; and 
 identifying, by one or more computer processors, a child node in the tree data structure and determining, by one or more computer processors, if one or more features of the child node of the tree data structure match a feature that initiates execution of a rule, wherein features of the child node comprise at least one of: a type of the child node, a value of the child node, and an existence of the child node; and 
   in response to determining that one or more identified features match at feature that initiates execution of a rule, augmenting, by one or more computer processors, the identified tree data structure based upon the determined one or more matches of the one or more identified features and the feature that initiates execution of the rule, wherein augmenting the identified data tree structure further comprises:
 identifying, by one or more computer processors, a first feature of the one or more identified features determined to match the feature that initiates execution of the rule; and 
 augmenting, by one or more computer processors, the identified first feature of the one or more identified features, wherein augmenting comprises one or more of:
 naming a node of the tree data structure, coloring a node of the tree data structure, expanding a node of the tree data structure, excluding a node from a tree data structure, adding static text before a name in the tree data structure, adding static text after a name in the tree data structure, adding text both before and after a name in the tree data structure, expanding a parent node of the node in the tree data structure based on a feature of the node.