Hierarchical Tree Reordering for Multi-Level Layouts
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional techniques for reordering items in documents are limited to flat lists and group lists, lacking the capability to efficiently reorder elements in multi-level layouts using hierarchical tree structures.
Innovation Solution
The approach involves creating a hierarchical order tree within a hierarchical tree structure, allowing tagged or reorderable elements to be rearranged across multiple hierarchical levels, thereby reordering content portions in a customizable layout by traversing and manipulating the tree structure.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If conventional reordering techniques are used, then the operation is simple, but the capability is limited to flat lists and group lists only
Solution Approach 1:
The patent implements a hierarchical tree structure where elements can be nested at multiple levels. The reordering operation works within this nested structure by traversing parent-child relationships, allowing elements to be reordered not just in flat lists but across hierarchical levels. This nesting capability enables the system to handle complex multi-level layouts while maintaining a unified reordering mechanism.
Solution Approach 2:
The patent segments the reordering operation into distinct phases: identifying reorderable elements, creating a hierarchical order tree, and performing the actual reordering. By segmenting the complex reordering process into manageable steps, the system can handle hierarchical structures efficiently without overwhelming complexity in any single operation.
2Productivity
If all elements are reordered in the hierarchical structure, then complete reordering is achieved, but resource consumption increases
Solution Approach 1:
The patent extracts only the necessary elements for reordering by identifying tagged elements that are marked as reorderable. Instead of processing the entire hierarchical structure, the system selectively extracts and reorders only the relevant elements, significantly reducing resource consumption while achieving the desired reordering effect.
Solution Approach 2:
The patent applies partial action by reordering only a subset of elements (tagged elements) rather than all elements in the hierarchical structure. This partial reordering approach achieves the necessary functionality while minimizing resource consumption, avoiding the excessive action of processing every element in the tree.
3Ease of operation
If hierarchical levels are maintained strictly, then structural integrity is preserved, but flexibility for reordering is reduced
Solution Approach 1:
The patent introduces dynamics to the hierarchical structure by enabling elements to move between different hierarchical levels during reordering operations. The system maintains the hierarchical structure's stability during normal operation but allows dynamic reconfiguration when reordering is needed, balancing structural integrity with operational flexibility.
Solution Approach 2:
The patent uses an intermediary hierarchical order tree that mediates between the original hierarchical structure and the desired reordered state. This intermediary structure allows flexible reordering operations to be performed without directly compromising the stability of the original hierarchical structure, acting as a buffer that enables change while preserving integrity.
Data Source
AI summary
Techniques are described herein that are capable of reordering a multi-level layout using a hierarchical tree. A hierarchical tree is a tree that includes multiple hierarchical levels. Elements of a document may be arranged among the hierarchical levels to provide a logical representation of the document. The elements may be rearranged among the hierarchical levels to cause portions of content that are represented by the elements to be rearranged in a multi-level layout (e.g., a web page).