Page multiplexing method, page multiplexing device, storage medium and electronic apparatus

Patent metadata

Field	Value
Publication number	US-12159125-B2
Application number	US-202318525804-A
Country	US
Kind code	B2
Filing date	Nov 30, 2023
Priority date	Dec 2, 2022
Publication date	Dec 3, 2024
Grant date	Dec 3, 2024

Abstract

Disclosed is a page multiplexing method, a page multiplexing device, a storage medium and an electronic apparatus. After obtaining the page frame information of pages to be configured in a client to be developed, a component relational tree corresponding to the plurality of pages can be determined. The component relational tree is compared with a pre-constructed reference relational tree to determine a target tree structure composed of target components from the reference relational tree. Dependencies between target components in the reference relational tree match those in the component relational tree. The component code of the target component used by the developed client is queried to multiplex the component code. The component relational tree corresponding to pages to be developed can be compared with the reference relational tree corresponding to each page included in the developed client to determine the component code that can be multiplexed.

First claim

What is claimed is:

1. A page multiplexing method, comprising the following steps:
acquiring page frame information of a plurality of pages to be configured in a client to be developed, wherein the page frame information comprises component information to be used by the plurality of pages;
determining a component relational tree corresponding to the pages based on the page frame information, wherein the component relational tree comprises a branch tree corresponding to each page, and for each page, the branch tree corresponding to the page is used for representing dependencies among components comprised in the page;
comparing the component relational tree with a pre-constructed reference relational tree to determine a target tree structure from the reference relational tree, wherein dependencies among target components comprised in the target tree structure are matched with dependencies of the target components in the component relational tree, and the reference relational tree is constructed based on pages in a developed client; and
querying component codes of the target components used by the developed client, and multiplexing the component codes to configure the pages in the client to be developed.

2. The method according to claim 1 , wherein prior to said comparing the component relational tree with the pre-constructed reference relational tree, the method further comprises:
determining the pages in the developed client as reference pages;
determining dependencies among all components in each reference page through a static analysis;
determining component information corresponding to each component in each reference page based on the dependencies; and
constructing the reference relational tree by taking each component in each reference page as a node, wherein for each node in the reference relational tree, the node stores the component information of a component corresponding to the node, wherein the reference relational tree comprises a branch tree corresponding to each reference page; and wherein for each reference page, a branch tree corresponding to the reference page is used for representing dependencies among components comprised in the reference page.

3. The method according to claim 2 , wherein said determining the component information corresponding to each component in each reference page based on the dependencies further comprises:
determining, for each component in each reference page, a component template corresponding to each component from each page code corresponding to each reference page based on the dependencies among all components in each reference page;
converting the component template of the component into a character string;
matching the character string by a preset regular expression to determine a plurality of label structures comprised in the component template;
generating an abstract syntax tree AST based on the plurality of label structures; and
determining component information corresponding to the component according to the AST.

4. The method according to claim 1 , wherein said determining the component relational tree corresponding to the plurality of pages based on the page frame information further comprises:
constructing a component relational tree comprising a branch tree corresponding to each page by taking each component in the page frame information as a node, wherein for each node in the component relational tree, the node stores component information of a component corresponding to the node.

5. The method according to claim 1 , wherein said comparing the component relational tree with the pre-constructed reference relational tree to determine the target tree structure from the reference relational tree further comprises:
comparing each component in the component relational tree with each component in the pre-constructed reference relational tree to determine the target tree structure from the reference relational tree based on a depth-first traversal mode.

6. The method according to claim 5 , wherein said comparing each component in the component relational tree with each component in the pre-constructed reference relational tree to determine the target tree structure from the reference relational tree further comprises:
determining whether each component in the component relational tree is a basic component;
in response to the component being not a basic component, determining whether the component has a child component in the component relational tree;
in response to the component having no child component in the component relational tree, determining whether the pre-constructed reference relational tree has the component;
in response to the reference relational tree having the component, marking the component in the reference relational tree, and determining the marked component as a target component, so as to determine the target tree structure composed of all the target components in the reference relational tree; and
in response to the reference relational tree not having the component, determining whether a next component of the component in the component relational tree is a basic component.

7. The method of claim 6 , further comprising:
in response to the component being a basic component, determining whether the pre-constructed reference relational tree has the component;
in response to the reference relational tree having the component, marking the component in the reference relational tree, and determining the marked component as the target component, so as to determine the target tree structure composed of all the target components in the reference relational tree; and
in response to the reference relational tree not having the component, determining whether a next component of the component in the component relational tree is a basic component.

8. The method of claim 6 , further comprising:
in response to the component having a child component in the component relational tree, determining whether the child component of the component is a basic component in the component relational tree until it is determined that a component has no child component.

9. The method according to claim 6 , wherein after marking the component in the reference relational tree, the method further comprises:
determining whether the component has a child component in the component relational tree;
in response to the component in the component relational tree having a child component, determining whether the component in the reference relational tree has a child component; and
in response to the component in the reference relational tree having no child component, unmarking the component.

10. The method of claim 9 , further comprising:
in response to the component in the component relational tree having no child component, determining whether the next component of the component in the component relational tree is a basic component.

11. The method of claim 9 , further comprising:
in response to the component in the reference relational tree having a child component, determining whether the child component of the component in the component relational tree is a basic component.

12. The method according to claim 1 , wherein the component information at least comprises: a component name, a component path, component dependency data, an event, a child component and a parent component.

13. The method of claim 1 , wherein a storage structure of the component relational tree is based on a double linked list.

14. The method of claim 1 , wherein the component code at least comprises: a component style code and a component logic code; and
wherein said multiplexing the component c

Assignees

• Zhejiang Lab

Inventors

• Zhou Tianshu
• Gao Xin
• Li Jingsong
• Tian Yu

Classifications

• G06F8/433

  Dependency analysis; Data or control flow analysis · CPC title

• G06F9/44

  Arrangements for executing specific programs · CPC title

• Y02D10/00

  Energy efficient computing, e.g. low power processors, power management or thermal management · CPC title

• G06F8/36 Primary

  Software reuse · CPC title