CONFIGURABLE HIERARCHICAL TREE VIEW

CONFIGURABLE HIERARCHICAL TREE VIEW

A view is created that includes nodes in a serial sequence of nodes. Hierarchical tree data is received. It can be determined whether a node is a start node of a serial sequence of nodes. Responsive to a determination that the node is a start node of a serial sequence of nodes a collapse control of...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: FARN BRIAN G
Format: Patent
Sprache:eng
Schlagworte:
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator FARN BRIAN G
description A view is created that includes nodes in a serial sequence of nodes. Hierarchical tree data is received. It can be determined whether a node is a start node of a serial sequence of nodes. Responsive to a determination that the node is a start node of a serial sequence of nodes a collapse control of the start node in the serial sequence of nodes is changed to a collapsed state. The computer-implemented process counts intervening nodes between the start node and an end node of the serial sequence of nodes to form a count, hides the intervening nodes to form hidden intervening nodes, creates a segment using the start node with collapse control and the end node using the count in place of the hidden intervening nodes and creates the view using the segments.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2014109015A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2014109015A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2014109015A13</originalsourceid><addsrcrecordid>eNrjZFB29vdz83QPDXJ08nFV8PB0DXIMcvbwdHb0UQgJcnVVCPN0DedhYE1LzClO5YXS3AzKbq4hzh66qQX58anFBYnJqXmpJfGhwUYGhiaGBpYGhqaOhsbEqQIA3uEjhw</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>CONFIGURABLE HIERARCHICAL TREE VIEW</title><source>esp@cenet</source><creator>FARN BRIAN G</creator><creatorcontrib>FARN BRIAN G</creatorcontrib><description>A view is created that includes nodes in a serial sequence of nodes. Hierarchical tree data is received. It can be determined whether a node is a start node of a serial sequence of nodes. Responsive to a determination that the node is a start node of a serial sequence of nodes a collapse control of the start node in the serial sequence of nodes is changed to a collapsed state. The computer-implemented process counts intervening nodes between the start node and an end node of the serial sequence of nodes to form a count, hides the intervening nodes to form hidden intervening nodes, creates a segment using the start node with collapse control and the end node using the count in place of the hidden intervening nodes and creates the view using the segments.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2014</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20140417&amp;DB=EPODOC&amp;CC=US&amp;NR=2014109015A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25542,76516</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20140417&amp;DB=EPODOC&amp;CC=US&amp;NR=2014109015A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>FARN BRIAN G</creatorcontrib><title>CONFIGURABLE HIERARCHICAL TREE VIEW</title><description>A view is created that includes nodes in a serial sequence of nodes. Hierarchical tree data is received. It can be determined whether a node is a start node of a serial sequence of nodes. Responsive to a determination that the node is a start node of a serial sequence of nodes a collapse control of the start node in the serial sequence of nodes is changed to a collapsed state. The computer-implemented process counts intervening nodes between the start node and an end node of the serial sequence of nodes to form a count, hides the intervening nodes to form hidden intervening nodes, creates a segment using the start node with collapse control and the end node using the count in place of the hidden intervening nodes and creates the view using the segments.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2014</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZFB29vdz83QPDXJ08nFV8PB0DXIMcvbwdHb0UQgJcnVVCPN0DedhYE1LzClO5YXS3AzKbq4hzh66qQX58anFBYnJqXmpJfGhwUYGhiaGBpYGhqaOhsbEqQIA3uEjhw</recordid><startdate>20140417</startdate><enddate>20140417</enddate><creator>FARN BRIAN G</creator><scope>EVB</scope></search><sort><creationdate>20140417</creationdate><title>CONFIGURABLE HIERARCHICAL TREE VIEW</title><author>FARN BRIAN G</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2014109015A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2014</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>FARN BRIAN G</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>FARN BRIAN G</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>CONFIGURABLE HIERARCHICAL TREE VIEW</title><date>2014-04-17</date><risdate>2014</risdate><abstract>A view is created that includes nodes in a serial sequence of nodes. Hierarchical tree data is received. It can be determined whether a node is a start node of a serial sequence of nodes. Responsive to a determination that the node is a start node of a serial sequence of nodes a collapse control of the start node in the serial sequence of nodes is changed to a collapsed state. The computer-implemented process counts intervening nodes between the start node and an end node of the serial sequence of nodes to form a count, hides the intervening nodes to form hidden intervening nodes, creates a segment using the start node with collapse control and the end node using the count in place of the hidden intervening nodes and creates the view using the segments.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US2014109015A1
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title CONFIGURABLE HIERARCHICAL TREE VIEW
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-16T07%3A44%3A05IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=FARN%20BRIAN%20G&rft.date=2014-04-17&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2014109015A1%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true