CN116088966A - Method and system for loading high-performance tree control - Google Patents

Method and system for loading high-performance tree control Download PDF

Info

Publication number
CN116088966A
CN116088966A CN202310185298.7A CN202310185298A CN116088966A CN 116088966 A CN116088966 A CN 116088966A CN 202310185298 A CN202310185298 A CN 202310185298A CN 116088966 A CN116088966 A CN 116088966A
Authority
CN
China
Prior art keywords
nodes
node
displayable
target
target node
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202310185298.7A
Other languages
Chinese (zh)
Inventor
袁江
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Likong Yuantong Technology Co ltd
Original Assignee
Beijing Likong Yuantong Technology Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Likong Yuantong Technology Co ltd filed Critical Beijing Likong Yuantong Technology Co ltd
Priority to CN202310185298.7A priority Critical patent/CN116088966A/en
Publication of CN116088966A publication Critical patent/CN116088966A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44Arrangements for executing specific programs
    • G06F9/445Program loading or initiating
    • G06F9/44521Dynamic linking or loading; Link editing at or after load time, e.g. Java class loading
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44Arrangements for executing specific programs
    • G06F9/451Execution arrangements for user interfaces
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02PCLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/02Total factory control, e.g. smart factories, flexible manufacturing systems [FMS] or integrated manufacturing systems [IMS]

Abstract

The invention discloses a loading method and a loading system of a high-performance tree control, which relate to the technical field of Web development, and the method comprises the following steps: when a data loading request generated by a target node selected by a user is received, firstly, the number of displayable nodes in a visible area of a tree control is obtained; determining the number of displayable bars of the target node according to the number of displayable nodes; the number of displayable nodes of the target node is the difference value between the number of displayable nodes and the number of parent nodes of the target node and the number of nodes above the target node; secondly, obtaining the number of child nodes under the target node; if the number of the child nodes is smaller than or equal to the displayable number of the target node, selecting all the child nodes as nodes to be loaded; if the number of the child nodes is larger than the number of the displayable target nodes, selecting part of the child nodes as nodes to be loaded according to the number of the displayable target nodes; and finally, carrying out data rendering on the node to be loaded. Because only a small amount of data in the current visible area needs to be loaded, the invention ensures the high efficiency of data loading.

Description

Method and system for loading high-performance tree control
Technical Field
The invention relates to the technical field of Web development, in particular to a loading method and a loading system of a high-performance tree control.
Background
In large industrial internet of things systems, typically at least several hundred thousand points or related data are contained, and problems of loading efficiency are encountered when exposed with a "tree control".
Currently, it is common practice in the industry to employ a "step-and-load" mode, namely: when the parent node is clicked to be unfolded, the data of the child node is dynamically acquired, all data are split after one-time loading, and the loading speed can be effectively improved. However, when tens of thousands of child nodes are encountered under a parent node, the loading speed after the step loading mode is adopted is still very slow.
Disclosure of Invention
The invention aims to provide a loading method and a system for a high-performance tree control with high loading efficiency.
In order to achieve the above object, the present invention provides the following solutions:
a loading method of a high-performance tree control comprises the following steps:
when a data loading request generated by a target node selected by a user is received, acquiring the number of displayable nodes in a visible area of the tree control;
determining the number of displayable bars of the target node according to the number of displayable nodes; the number of the displayable nodes of the target node is the difference value between the number of the displayable nodes and the number of the parent level of the target node and the number of the nodes above;
acquiring the number of child nodes under the target node; if the number of the child nodes is smaller than or equal to the number of the displayable target nodes, selecting all the child nodes as nodes to be loaded; if the number of the child nodes is larger than the number of the target nodes which can be displayed, selecting part of the child nodes as nodes to be loaded according to the number of the target nodes which can be displayed;
and rendering data on the node to be loaded.
Optionally, the number of the displayable nodes is a quotient of the height of the visible area of the tree control and the height of one node in the tree control.
Optionally, the number of the parent level of the target node and the number of the nodes above are calculated by adopting a recursive traversal method, which specifically comprises the following steps:
taking the target node as a node to be circulated, and taking 0 as an initial node number;
judging whether the ul label of the node to be circulated contains a parent class name or not;
if so, adding 1 to the initial node number to obtain a new node number, taking the father node of the node to be circulated as the node to be circulated in the next circulation, taking the new node number as the initial node number in the next circulation, and returning to the step of judging whether the ul label of the node to be circulated contains the father class name;
and if the node number does not contain the initial node number of the current cycle, taking the initial node number of the current cycle as the parent level of the target node and the number of the nodes above the target node.
Optionally, selecting a part of the child nodes as nodes to be loaded according to the number of the displayable target nodes, and specifically includes:
and selecting the first n child nodes in all the child nodes as nodes to be loaded, wherein the number of the first n child nodes is equal to the number of the displayable child nodes of the target node.
Optionally, the selecting a part of the child nodes according to the number of the exposable items of the target node as the nodes to be loaded further includes:
monitoring a data adjustment request generated by a user rolling a scroll bar;
and selecting part of the child nodes as nodes to be loaded according to the data adjustment request.
Optionally, selecting a part of the child nodes as nodes to be loaded according to the data adjustment request specifically includes:
determining the rolling distance of the rolling bar according to the position of the rolling bar after rolling;
determining an initiator node according to the rolling distance;
determining a terminator node according to the number of the target nodes which can be displayed;
and selecting part of the child nodes positioned in the starting child node and the ending child node as nodes to be loaded.
Optionally, the data rendering method is a loadTree method.
Optionally, when receiving a data loading request generated by a user selecting a target node, hiding other nodes at the same level as the target node.
The invention also provides a loading system of the high-performance tree control, which comprises the following steps:
the user request acquisition module is used for acquiring the number of displayable nodes in the visible area of the tree control when receiving a data loading request generated by a target node selected by a user;
the calculation module is used for determining the displayable number of the target node according to the displayable number of the nodes; the number of the displayable nodes of the target node is the difference value between the number of the displayable nodes and the number of the parent level of the target node and the number of the nodes above;
the child node acquisition module is used for acquiring the number of child nodes under the target node; if the number of the child nodes is smaller than or equal to the number of the displayable target nodes, selecting all the child nodes as nodes to be loaded; if the number of the child nodes is larger than the number of the target nodes which can be displayed, selecting part of the child nodes as nodes to be loaded according to the number of the target nodes which can be displayed;
and the data rendering module is used for performing data rendering on the node to be loaded.
Optionally, the child node obtaining module specifically includes:
the scroll bar monitoring unit is used for monitoring a data adjustment request generated by a user for scrolling the scroll bar;
and the data unit can be displayed and is used for selecting part of the child nodes as nodes to be loaded according to the data adjustment request.
According to the specific embodiment provided by the invention, the following technical effects are disclosed: the invention provides a loading method and a system of a high-performance tree control, wherein the method comprises the following steps: when a data loading request generated by a target node selected by a user is received, firstly, the number of displayable nodes in a visible area of a tree control is obtained; determining the number of displayable bars of the target node according to the number of displayable nodes; the number of displayable nodes of the target node is the difference value between the number of displayable nodes and the number of parent nodes of the target node and the number of nodes above the target node; obtaining the number of child nodes under the target node; if the number of the child nodes is smaller than or equal to the displayable number of the target node, selecting all the child nodes as nodes to be loaded; if the number of the child nodes is larger than the number of the displayable target nodes, selecting part of the child nodes as nodes to be loaded according to the number of the displayable target nodes; and finally, carrying out data rendering on the node to be loaded. The invention dynamically maps the node data and the background data in the visual range of the tree control window based on the virtual tree mechanism, and only needs to load a small amount of data in the current visual range, thereby guaranteeing the high efficiency of data loading.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions of the prior art, the drawings that are needed in the embodiments will be briefly described below, it being obvious that the drawings in the following description are only some embodiments of the present invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a schematic diagram of a loading method of a high-performance tree control according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a tree hierarchy provided in an embodiment of the present invention;
FIG. 3 is a flowchart of obtaining the parent level of a target node and the number of nodes above according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of a node to be loaded before a scroll bar is scrolled according to an embodiment of the present invention;
fig. 5 is a schematic diagram of a node to be loaded after a scroll bar is scrolled according to an embodiment of the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
The invention aims to provide a loading method and a system for a high-performance tree control with high loading efficiency.
In order that the above-recited objects, features and advantages of the present invention will become more readily apparent, a more particular description of the invention will be rendered by reference to the appended drawings and appended detailed description.
As shown in fig. 1, the present invention provides a loading method of a high-performance tree control, which includes:
step 1: when a data loading request generated by a target node selected by a user is received, the count of displayable nodes in the visible area of the tree control is obtained.
Step 2: determining the showCount of the target node according to the count of the displayable nodes; the showCount of the target node is the difference value between the showCount of the displayable node and the showParentcount of the parent level of the target node and above.
Step 3: acquiring the number of child nodes under the target node; if the number of the child nodes is smaller than or equal to the showCount of the target node, selecting all the child nodes as nodes to be loaded; and if the number of the child nodes is larger than the showCount of the target node, selecting a part of the child nodes as nodes to be loaded according to the showCount of the target node.
Step 4: and rendering data on the node to be loaded.
In some embodiments, when a data load request generated by a user selecting a target node is received, the sequential addition attributes include: the count of nodes and the showParentCount of the parent level of the target node and the count of nodes above can be displayed.
The method for obtaining the count of displayable nodes in the visible area of the tree control specifically includes the following steps:
as shown in fig. 2, when the user selects the first level_1, the height of the visual area of the tree control and the height of each piece of node data are obtained, for example, the height of the visual area is 330px, the height of each piece of node data is 30px, and the count of the number of displayable nodes in the visual area is 11 through count=parameter (height/30 px).
The method for obtaining the parent level of the target node and the number of the nodes above showParentCount specifically comprises the following steps:
as shown in fig. 3, a recursive traversal method is used to calculate the number showParentCount of the parent level of the target node and above.
Specifically, a target node is used as a node to be circulated, and 0 is used as an initial node number; judging whether the ul label of the node to be circulated contains a parent class name dtree-nav-ul-sid through a hasClass () function, if so, adding 1 to the initial node number to obtain a new node number, taking the parent node of the node to be circulated as the node to be circulated of the next circulation, taking the new node number as the initial node number of the next circulation, and returning to the step of judging whether the ul label of the node to be circulated contains the parent class name dtree-nav-ul-sid; if not, taking the initial node number of the current cycle as the showParentCount of the parent level of the target node and the nodes above.
And calculating the showable number of the target node showCount according to the calculated number of displayable nodes count in the tree control visible area and the number of showparallelcount of the target node father and above nodes by showcount=count-sho wrparkcount.
In some embodiments, after receiving a data loading request generated by a user selecting a target node, the method may include the following steps of:
and obtaining the number of child nodes under the target node.
When the number of the child nodes is smaller than or equal to the showCount of the target node, selecting all the child nodes as nodes to be loaded, and performing data rendering on the nodes to be loaded by adopting a loadTree original method.
As shown in fig. 4, the number of display data counts in the visible area is 11, the target node may display the number of showcounts as 9, the parent level of the target node and the number of showparallelpcount above are 2, if the number of child nodes (second level) under the first level is 9, when the user selects the first level_1, since the number of showparallelpcount of the target node parent level and the number of showCount above is 2, the number of showCount of the target node is 9 at this time, therefore, after the first level_1 is selected, all the child nodes (second level) under the first level_1 are displayed, that is, from the second level_1_1 to the second level_ 1_9.
When the number of the child nodes is larger than the showCount of the target node, selecting the first n child nodes in all the child nodes as nodes to be loaded according to the showCount of the target node, and performing data rendering on the nodes to be loaded by adopting a loadTree original method. Wherein the number of the first n child nodes is equal to the showCount of the target node.
As shown in fig. 4, the number of display data counts in the visible area is 11, the target node may display the number of showcounts as 9, the current node parent and the number of showparallelcount above are 2, if the number of child nodes (second level) under the first level is 15, the number of child nodes under the target node is 15 and is greater than the number of displayable stripes as 9, and the first 9 child nodes in all the child nodes are selected as nodes to be loaded for data rendering through the increase interception of the this.loadtree () function.
In some embodiments, the tree control further adds a monitor scroll bar scroll event, which is used for monitoring a data adjustment request generated by a user scroll bar, and selecting a part of the child nodes as nodes to be loaded according to the data adjustment request. The specific listening scroll processing method may be as follows:
triggering a scorllChange function when a scroll bar rolls, acquiring the distance from the scroll bar to the top as 100px through the scroll lTop attribute of the parent level div of the tree control, and acquiring the number of hidden child nodes above by using a calculation formula star tddex=Math.round (scrollTop/30), wherein at the moment, the number of hidden child nodes is added on the basis of the first child node displayed in the target node before the scroll bar rolls, and calculating the initial child node displayed in the target node after the scroll bar rolls; then adding the showCount of the target node on the basis of the initial sub-node displayed in the target node after the rolling bar rolls, and calculating the termination sub-node displayed in the target node after the rolling bar rolls; and finally, selecting part of the child nodes positioned in the starting child node and the ending child node as nodes to be loaded, and performing data rendering on the nodes to be loaded by adopting a loadTree original method, wherein the nodes to be loaded after the rolling bar rolls are shown in figure 5.
In some embodiments, when a data loading request generated by a user selecting a target node is received, the level of the display data is set as the current node level, so as to ensure that the father level and above nodes are displayed, and other nodes at the same level as the target node are hidden.
Specifically, the parent nodes with more than two levels are closed by default, and child nodes are added when the parent nodes are opened manually, so that the first screen performance is optimized. Wherein, more than two levels refer to the brother nodes above the father level, namely the brother nodes of the father level and the brother nodes of the father level, and the like, and the same goes to the root node. As shown in fig. 2, the second hierarchy_1_1 to the second hierarchy_ 1_9 are all child nodes. The second level_1 is a parent node. Parent and above nodes refer to parent of child level and parent of child level, etc., and so on to the root node.
Through experimental tests, when creating a tree with 10937 nodes to render, only about 0.04 seconds is required.
In this embodiment, the loading method of the high-performance tree control is written based on jquery and native js.
In summary, the invention has the following advantages:
1) The invention dynamically maps the node data and the background data in the visual range of the tree control window based on the virtual tree mechanism, and only needs to load a small amount of data in the current visual range, thereby guaranteeing the high efficiency of data loading.
2) Compared with a virtual tree which can only run under the frame of a VUE in a mature Web front-end component library such as the VUE and the like, the tree control provided by the invention does not depend on a specific frame and is a completely autonomous high-performance tree control.
3) The characteristic of a tree control is reserved, and the follow-up convenient expansion: and adding a hook frame, adding icons before and after the node text, and the like.
4) The standard functions of the tree control are supported, and no configuration is reduced. Many third party "tree controls" can achieve similar loading speed effects, but are reduced by many functions, which can also be said to be non-standard "tree controls" from the underlying mechanism.
In the present specification, each embodiment is described in a progressive manner, and each embodiment is mainly described in a different point from other embodiments, and identical and similar parts between the embodiments are all enough to refer to each other. For the system disclosed in the embodiment, since it corresponds to the method disclosed in the embodiment, the description is relatively simple, and the relevant points refer to the description of the method section.
The principles and embodiments of the present invention have been described herein with reference to specific examples, the description of which is intended only to assist in understanding the methods of the present invention and the core ideas thereof; also, it is within the scope of the present invention to be modified by those of ordinary skill in the art in light of the present teachings. In view of the foregoing, this description should not be construed as limiting the invention.

Claims (10)

1. The loading method of the high-performance tree control is characterized by comprising the following steps of:
when a data loading request generated by a target node selected by a user is received, acquiring the number of displayable nodes in a visible area of the tree control;
determining the number of displayable bars of the target node according to the number of displayable nodes; the number of the displayable nodes of the target node is the difference value between the number of the displayable nodes and the number of the parent level of the target node and the number of the nodes above;
acquiring the number of child nodes under the target node; if the number of the child nodes is smaller than or equal to the number of the displayable target nodes, selecting all the child nodes as nodes to be loaded; if the number of the child nodes is larger than the number of the target nodes which can be displayed, selecting part of the child nodes as nodes to be loaded according to the number of the target nodes which can be displayed;
and rendering data on the node to be loaded.
2. The method for loading a high-performance tree control according to claim 1, wherein the number of displayable nodes is a quotient of the height of the visible area of the tree control and the height of one node in the tree control.
3. The loading method of the high-performance tree control according to claim 1, wherein the number of the parent level of the target node and the nodes above is calculated by adopting a recursive traversal method, and the loading method specifically comprises the following steps:
taking the target node as a node to be circulated, and taking 0 as an initial node number;
judging whether the ul label of the node to be circulated contains a parent class name or not;
if so, adding 1 to the initial node number to obtain a new node number, taking the father node of the node to be circulated as the node to be circulated in the next circulation, taking the new node number as the initial node number in the next circulation, and returning to the step of judging whether the ul label of the node to be circulated contains the father class name;
and if the node number does not contain the initial node number of the current cycle, taking the initial node number of the current cycle as the parent level of the target node and the number of the nodes above the target node.
4. The loading method of the high-performance tree control according to claim 1, wherein selecting a part of the child nodes as nodes to be loaded according to the number of the presentable items of the target node specifically comprises:
and selecting the first n child nodes in all the child nodes as nodes to be loaded, wherein the number of the first n child nodes is equal to the number of the displayable child nodes of the target node.
5. The loading method of the high-performance tree control according to claim 4, wherein the selecting a part of the child nodes as nodes to be loaded according to the exposable number of the target node further comprises:
monitoring a data adjustment request generated by a user rolling a scroll bar;
and selecting part of the child nodes as nodes to be loaded according to the data adjustment request.
6. The loading method of the high-performance tree control according to claim 5, wherein selecting a part of the child nodes as nodes to be loaded according to the data adjustment request specifically comprises:
determining the rolling distance of the rolling bar according to the position of the rolling bar after rolling;
determining an initiator node according to the rolling distance;
determining a terminator node according to the number of the target nodes which can be displayed;
and selecting part of the child nodes positioned in the starting child node and the ending child node as nodes to be loaded.
7. The loading method of the high-performance tree control according to claim 1, wherein the data rendering method is a loadTree method.
8. A method of loading a high performance tree control as recited in claim 1 wherein when a data loading request generated by a user selecting a target node is received, other nodes peer with the target node are hidden.
9. A loading system for a high performance tree control, comprising:
the user request acquisition module is used for acquiring the number of displayable nodes in the visible area of the tree control when receiving a data loading request generated by a target node selected by a user;
the calculation module is used for determining the displayable number of the target node according to the displayable number of the nodes; the number of the displayable nodes of the target node is the difference value between the number of the displayable nodes and the number of the parent level of the target node and the number of the nodes above;
the child node acquisition module is used for acquiring the number of child nodes under the target node; if the number of the child nodes is smaller than or equal to the number of the displayable target nodes, selecting all the child nodes as nodes to be loaded; if the number of the child nodes is larger than the number of the target nodes which can be displayed, selecting part of the child nodes as nodes to be loaded according to the number of the target nodes which can be displayed;
and the data rendering module is used for performing data rendering on the node to be loaded.
10. The loading system of the high-performance tree control according to claim 9, wherein the child node obtaining module specifically comprises:
the scroll bar monitoring unit is used for monitoring a data adjustment request generated by a user for scrolling the scroll bar;
and the data unit can be displayed and is used for selecting part of the child nodes as nodes to be loaded according to the data adjustment request.
CN202310185298.7A 2023-02-21 2023-02-21 Method and system for loading high-performance tree control Pending CN116088966A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310185298.7A CN116088966A (en) 2023-02-21 2023-02-21 Method and system for loading high-performance tree control

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310185298.7A CN116088966A (en) 2023-02-21 2023-02-21 Method and system for loading high-performance tree control

Publications (1)

Publication Number Publication Date
CN116088966A true CN116088966A (en) 2023-05-09

Family

ID=86214145

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310185298.7A Pending CN116088966A (en) 2023-02-21 2023-02-21 Method and system for loading high-performance tree control

Country Status (1)

Country Link
CN (1) CN116088966A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116719598A (en) * 2023-08-11 2023-09-08 北京久其金建科技有限公司 Tree data virtual rolling processing method and device
CN117648153A (en) * 2024-01-29 2024-03-05 太平金融科技服务(上海)有限公司 Rendering display method and device, electronic equipment and storage medium

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070271263A1 (en) * 2006-05-19 2007-11-22 Matchware A/S Displaying Data
CN112506509A (en) * 2020-12-11 2021-03-16 杭州安恒信息技术股份有限公司 Method and related device for realizing tree control supporting big data rendering
CN113590656A (en) * 2021-07-21 2021-11-02 上海淇玥信息技术有限公司 Query data rendering method and device and electronic equipment
CN115659087A (en) * 2022-11-28 2023-01-31 阿里巴巴(中国)有限公司 Page rendering method, system, device, storage medium and program product

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070271263A1 (en) * 2006-05-19 2007-11-22 Matchware A/S Displaying Data
CN112506509A (en) * 2020-12-11 2021-03-16 杭州安恒信息技术股份有限公司 Method and related device for realizing tree control supporting big data rendering
CN113590656A (en) * 2021-07-21 2021-11-02 上海淇玥信息技术有限公司 Query data rendering method and device and electronic equipment
CN115659087A (en) * 2022-11-28 2023-01-31 阿里巴巴(中国)有限公司 Page rendering method, system, device, storage medium and program product

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116719598A (en) * 2023-08-11 2023-09-08 北京久其金建科技有限公司 Tree data virtual rolling processing method and device
CN117648153A (en) * 2024-01-29 2024-03-05 太平金融科技服务(上海)有限公司 Rendering display method and device, electronic equipment and storage medium

Similar Documents

Publication Publication Date Title
US11587044B2 (en) Synchronized conversation-centric message list and message reading pane
CN116088966A (en) Method and system for loading high-performance tree control
US10359919B2 (en) Staged animation of charts for data updates
US8314801B2 (en) Visual state manager for control skinning
CN107729475B (en) Webpage element acquisition method, device, terminal and computer-readable storage medium
MX2012012420A (en) Temporary formatting and charting of selected data.
US10496658B2 (en) Method and system of visually depicting hierarchical data through selective colorization
US20150193390A1 (en) Visited hyperlink appearance based on user activity
US20150205761A1 (en) Unloaded content placeholders
US20140282176A1 (en) Method and system of visualizing rendering data
CN108874393A (en) rendering method, device, storage medium and computer equipment
US8205160B2 (en) Graphical user interface for multi-frame presentation
CN115686509A (en) VUE framework-based tree structure data rendering method, device and medium
US8707196B2 (en) Dynamic, set driven, ribbon, supporting deep merge
CN116955863A (en) Dynamic tree structure rendering method and device based on virtual tree
CN111274308A (en) Node relation graph display method, device and equipment
CN111832271A (en) Data presentation method and device, electronic equipment and storage medium
CN103970846B (en) A kind of data display method and device
CN104133608A (en) Method and device for opening new tab
CN114661370A (en) Resource loading method and device, electronic equipment and computer storage medium
CN117111799A (en) Data display method and device, storage medium and electronic equipment
CN113849164A (en) Data processing method and device, electronic equipment and memory
CN111078785A (en) Method and device for visually displaying data, electronic equipment and storage medium
CN113688336A (en) Page data loading method and loading device
CN111880889A (en) Interface display method and device, electronic equipment and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination