Browse Prior Art Database

A Method for Representing a Tree structure

IP.com Disclosure Number: IPCOM000131071D
Original Publication Date: 2005-Nov-07
Included in the Prior Art Database: 2005-Nov-07
Document File: 2 page(s) / 36K

Publishing Venue

IBM

Abstract

A Method for Representing a Tree structure

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 100% of the total text.

Page 1 of 2

A Method for Representing a Tree structure

A high performance Tree Widget is presented which will enable hidden nodes and sorting root nodes. The procedure is to use a vector which is a linear structure without pointers. This will allow easy manipulation of the structure without the employment of expensive structural traversal and reassembly.

A usage result is shown below which is represented by a vector. Each index of the vector has a Treenode which contains the depth and any data such as the name or icon to be used. This depth number tells the indentation depth as well as the draw lines. In addition a 1000 is added to the depth number if the node has children. And if the node is expanded the depth number is negative and it if is collapsed the depth number is positive.

The drawing of the lines is directed by the depth number.

1

[This page contains 1 picture or other non-text object]

Page 2 of 2

2

[This page contains 1 picture or other non-text object]