US 12,079,454 B1
Weighted scroll for display of hierarchical structures
Matthew Briscoe, Provo, UT (US); Peter Alexander Ciszak, San Francisco, CA (US); Kittisak Sirijaroonchai, San Francisco, CA (US); and Grant Steven Russell, Pleasant Grove, UT (US)
Assigned to Adobe Inc., San Jose, CA (US)
Filed by ADOBE INC., San Jose, CA (US)
Filed on Mar. 21, 2023, as Appl. No. 18/124,304.
Claims priority of provisional application 63/401,552, filed on Aug. 26, 2022.
Int. Cl. G06F 3/0481 (2022.01); G06F 3/0483 (2013.01); G06F 3/0485 (2022.01)
CPC G06F 3/0483 (2013.01) [G06F 3/0481 (2013.01); G06F 3/0485 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A method comprising:
obtaining a first dataset including a first set of nodes maintained in a hierarchical data structure;
causing a portion of the first dataset to be displayed in a user interface;
determining a subset of nodes of the first set of nodes displayed in the user interface;
determining a set of urgency scores based on the subset of nodes, an urgency score of the set of urgency scores indicating a distance relative to an end of the first set of nodes; and
based on at least one urgency score of the set of urgency scores being above a threshold, causing a request for a second dataset including a second set of nodes maintained in the hierarchical data structure to be generated.