CN108628629B - UI updating method, device, equipment and storage medium - Google Patents

UI updating method, device, equipment and storage medium Download PDF

Info

Publication number
CN108628629B
CN108628629B CN201810491144.XA CN201810491144A CN108628629B CN 108628629 B CN108628629 B CN 108628629B CN 201810491144 A CN201810491144 A CN 201810491144A CN 108628629 B CN108628629 B CN 108628629B
Authority
CN
China
Prior art keywords
data
updating
binding relationship
updated
module
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.)
Active
Application number
CN201810491144.XA
Other languages
Chinese (zh)
Other versions
CN108628629A (en
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.)
Netease Hangzhou Network Co Ltd
Original Assignee
Netease Hangzhou Network 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 Netease Hangzhou Network Co Ltd filed Critical Netease Hangzhou Network Co Ltd
Priority to CN201810491144.XA priority Critical patent/CN108628629B/en
Publication of CN108628629A publication Critical patent/CN108628629A/en
Application granted granted Critical
Publication of CN108628629B publication Critical patent/CN108628629B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00Arrangements for software engineering
    • G06F8/60Software deployment
    • G06F8/65Updates
    • 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

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • General Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Security & Cryptography (AREA)
  • Human Computer Interaction (AREA)
  • Stored Programmes (AREA)
  • User Interface Of Digital Computer (AREA)

Abstract

The application provides a UI updating method, a device, equipment and a storage medium, comprising the following steps: updating the first data; and updating the first UI according to the first binding relation between the first data and the first UI. Therefore, developers can separate the UI layer from the data layer only by executing binding mapping once when the interface is opened, and can automatically update the display of the UI layer only by maintaining the logic of the data layer, so that the complexity of UI development is reduced, and the updating efficiency of the UI is improved.

Description

UI updating method, device, equipment and storage medium
Technical Field
The present application relates to the field of computer technologies, and in particular, to a method, an apparatus, a device, and a storage medium for updating a User Interface (UI).
Background
The UI development is the most tedious part of the client development, and particularly in game design, due to the fact that the system is multiple, the code amount occupies more than 80% of the whole client code. The cost performance of optimizing for this part is relatively high.
In the prior art, when a UI needs to be updated, a developer needs to modify a code corresponding to the UI, for example, the code includes an updated UI attribute and a UI logic corresponding to the attribute. However, UI logic is generally cumbersome, and therefore, there is a problem that UI update efficiency is low.
Disclosure of Invention
The application provides a UI updating method, a device, equipment and a storage medium, so that the UI updating efficiency is improved.
In a first aspect, the present application provides a UI updating method, including:
updating the first data;
and updating the first UI according to the first binding relation between the first data and the first UI.
The beneficial effect of this application includes: therefore, developers can separate the UI layer from the data layer only by executing binding mapping once when the interface is opened, and can automatically update the display of the UI layer only by maintaining the logic of the data layer, so that the complexity of UI development is reduced, and the updating efficiency of the UI is improved.
Optionally, before updating the first UI according to the first binding relationship between the first data and the first user interface UI, the method further includes: and establishing a first binding relation between the first data and the first UI.
Optionally, the method further comprises: acquiring a life cycle of the first binding relationship; and when the duration of the first binding relationship reaches the life cycle, removing the first binding relationship.
The beneficial effect of this application includes: the method can automatically remove the first binding relationship without manually removing the first binding relationship by developers.
Optionally, the method further comprises: the first data and the first binding relationship are stored in the form of a weak reference container.
Optionally, the method further comprises: after the first binding relationship is released, the first binding relationship is deleted from the weak reference container.
Based on the characteristics of the weak reference container, when the continuous market of the first data reaches the life cycle of the first data, the UI updating device automatically releases the first binding relationship and deletes the first binding relationship from the weak reference container, so that part of the memory in the weak reference container is released.
Optionally, the method further comprises: establishing a data tree formed by the first data and at least one second data; and after any child node in the data tree is updated, updating the father node of any child node.
Optionally, the method further comprises: establishing a second binding relationship between the parent node and the second UI; and after the father node is updated, updating the second UI according to the second binding relationship.
The beneficial effect of this application includes: by means of establishing the data tree, the incidence relation between data (nodes) is established, so that after any node in the data tree is updated, the corresponding UI is updated, and the UI updating efficiency is improved. Furthermore, as the child nodes and the binding relationship between the nodes and the UI can be increased and deleted at will, the expansibility and maintainability of the data tree corresponding system are improved.
The following provides a UI updating apparatus, a device and a storage medium, and the effects thereof can refer to the technical effects of the method part, which will not be described in detail below.
In a second aspect, the present application provides a UI updating apparatus, comprising:
the first updating module is used for updating the first data;
and the second updating module is used for updating the first UI according to the first binding relation between the first data and the first UI.
Optionally, the apparatus further comprises:
the first establishing module is used for establishing a first binding relationship between the first data and the first UI.
Optionally, the apparatus further comprises:
the acquisition module is used for acquiring the life cycle of the first binding relationship;
and the releasing module is used for releasing the first binding relationship when the duration of the first binding relationship reaches the life cycle.
Optionally, the apparatus further comprises:
and the storage module is used for storing the first data and the first binding relation in the form of a weak reference container.
Optionally, the apparatus further comprises:
and the deleting module is used for deleting the first binding relationship from the weak reference container after the first binding relationship is released.
Optionally, the apparatus further comprises:
the second establishing module is used for establishing a data tree formed by the first data and at least one second data;
and the third updating module is used for updating the father node of any child node after any child node in the data tree is updated.
Optionally, the apparatus further comprises:
the fourth establishing module is used for establishing a second binding relationship between the parent node and the second UI;
and the fourth updating module is used for updating the second UI according to the second binding relationship after the father node is updated.
In a third aspect, the present application provides a UI updating apparatus, including:
a processor and a memory;
the memory is to store instructions for execution by the processor to cause the processor to:
updating the first data; and updating the first UI according to the first binding relation between the first data and the first UI.
Optionally, the processor is further configured to: and establishing a first binding relation between the first data and the first UI.
Optionally, the processor is further configured to: acquiring a life cycle of the first binding relationship; and when the duration of the first binding relationship reaches the life cycle, removing the first binding relationship.
Optionally, the processor is further configured to: the first data and the first binding relationship are stored in the form of a weak reference container.
Optionally, the processor is further configured to: after the first binding relationship is released, the first binding relationship is deleted from the weak reference container.
Optionally, the processor is further configured to: establishing a data tree formed by the first data and at least one second data; and after any child node in the data tree is updated, updating the father node of any child node.
Optionally, the processor is further configured to: establishing a second binding relationship between the parent node and the second UI; and after the father node is updated, updating the second UI according to the second binding relationship.
In a fourth aspect, the present application provides a storage medium comprising instructions for implementing a UI update method.
In a fifth aspect, the present application provides a computer program product comprising instructions for implementing a UI update method.
The application provides a UI updating method, a device, equipment and a storage medium, comprising the following steps: updating the first data; and updating the first UI according to the first binding relation between the first data and the first UI. Therefore, developers can separate the UI layer from the data layer only by executing binding mapping once when the interface is opened, and can automatically update the display of the UI layer only by maintaining the logic of the data layer, so that the complexity of UI development is reduced, and the updating efficiency of the UI is improved.
Drawings
Fig. 1 is a flowchart of a UI updating method according to an embodiment of the present application;
fig. 2 is a schematic diagram of a driving source dobj according to an embodiment of the present disclosure;
FIG. 3 is a flowchart of a UI updating method according to another embodiment of the present application;
FIG. 4 is a data tree diagram of a bonus point game system according to an embodiment of the present application;
fig. 5 is a schematic structural diagram of a UI updating apparatus 500 according to an embodiment of the present application;
fig. 6 is a schematic structural diagram of a UI updating apparatus 600 according to an embodiment of the present application.
Detailed Description
In the prior art, when a UI needs to be updated, a developer needs to modify a code corresponding to the UI, for example, the code includes an updated UI attribute and a UI logic corresponding to the attribute. However, UI logic is generally cumbersome, and therefore, there is a problem that UI update efficiency is low. In order to solve the technical problem, the application provides a UI updating method, device, equipment and storage medium.
Specifically, fig. 1 is a flowchart of a UI updating method according to an embodiment of the present application, and this embodiment illustrates that the UI updating method is applied to a UI updating device. The UI updating device may be a mobile phone, a computer, a digital broadcast terminal, a messaging device, a game console, a tablet device, a medical device, an exercise device, a personal digital assistant, etc., as shown in fig. 1, the method comprising the steps of:
in step S101: the first data is updated.
In step S102: and updating the first UI according to the first binding relation between the first data and the first UI.
Optionally, before step S102, the method further includes: and establishing a first binding relation between the first data and the first UI.
Specifically, the first data is a code corresponding to the attribute to be updated of the first UI, that is, the code is used to implement the attribute to be updated of the first UI. After the first data is updated, the UI updating device may automatically update the first UI according to the first binding relationship.
Further, in the UI development process, the first data may be designed as a driving source dobj, where the driving source dobj includes at least one driving source container, and each driving source container may be configured to store different types of events (data) and binding relationships between the data and the UI. Specifically, fig. 2 is a schematic diagram of a driving source dobj according to an embodiment of the present application, and as shown in fig. 2, the driving source dobj includes:
a drive source container ddict whose key value is an attribute of the drive source dobj, which contains an arbitrary value change event whose trigger condition is: the event is triggered when the first data is arbitrarily changed or added or deleted, and the event triggers the transmission parameter of ddict itself.
A drive source container dlist, which contains two events of a length change event of the first data and an arbitrary value change of the first data. Wherein, the triggering condition of the length change event is as follows: when the first data is added or deleted, the event is triggered. The trigger conditions for the arbitrary value change event are: the event is triggered when the first data is arbitrarily changed or added or deleted.
The driving source container dset, the elements of which are the attributes of the driving source dobj, wherein the values of the attributes in the container are boolean values.
The drive source container ddict, the drive source container dlist, and the drive source container dset are all weakly cited containers. Based on the characteristics of the weak reference container, when the continuous market of the first data reaches the life cycle of the first data, the UI updating device automatically releases the first binding relationship and deletes the first binding relationship from the weak reference container, so that part of the memory in the weak reference container is released.
Further, as shown in fig. 2, the first binding relationship between the first data and the first UI needs to be implemented through interfaces, which include at least, but are not limited to, at least one of the following: a bound (bind) interface, a connected (connect) interface, a disconnected (disconnect) interface, and a unbound (unbound) interface.
The difference between the bind interface and the connect interface is that after the first data is updated, the UI updating device directly updates the first UI according to the first binding relationship through the bind interface. And for the connect interface, the UI updating device executes a binding callback through the connect interface, that is, after the first data is updated, the updated first data is used as an input parameter of a calling function, and the first UI is updated through the calling function, that is, the UI updating device updates the first UI indirectly according to the first binding relationship through the connect interface.
Accordingly, the discrete interface and the discrete interface are both used to release the first binding relationship between the first data and the first UI, and the difference between the two is that the UI updating device directly releases the first binding relationship through the discrete interface. For the disconnect interface, the UI updating device executes a binding callback through the disconnect interface, that is, updated first data is used as an input parameter of a calling function, and the first binding relationship is released through the calling function, that is, the UI updating device indirectly releases the first binding relationship through the disconnect interface.
The UI update method described above is further explained by the following three examples:
example one: taking the animal washing red dot state interface as the first UI, the attributes corresponding to the animal washing red dot state interface include, but are not limited to, at least one of the following: player rating, consumption status, etc. Before the red point state interface of the animal washing is not updated, when the grade of a player reaches a first preset grade, the red point state interface of the animal washing displays the red point, and when the grade of the player does not reach the first preset grade, the red point state interface of the animal washing does not display the red point. After the red point state interface for washing the animals is updated, when the grade of the player reaches a second preset grade, the red point state interface for washing the animals displays red points, and when the grade of the player does not reach the second preset grade, the red point state interface for washing the animals does not display red points. In the embodiment of the application, because the first preset level and the smart animal scouring red spot state interface have the binding relationship, the UI developer does not need to modify the UI logic corresponding to the smart animal scouring red spot state interface, and only needs to update the first preset level to the second preset level.
Example two: before the red point state interface for washing the animals is not updated, when the grade of the animals reaches a third preset grade, the red point state interface for washing the animals displays red points, and when the grade of the animals does not reach the third preset grade, the red point state interface for washing the animals does not display red points. After the red point state interface for washing the animals is updated, when the grade of the animals reaches a fourth preset grade, the red point state interface for washing the animals displays red points, and when the grade of the animals does not reach the fourth preset grade, the red point state interface for washing the animals does not display red points. In the embodiment of the application, because the third preset level and the smart animal scouring red spot state interface have a binding relationship, the UI developer does not need to modify the UI logic corresponding to the smart animal scouring red spot state interface, and only needs to update the third preset level to the fourth preset level.
Example three: before the red point state interface of the animal washing is not updated, when the consumption state is the A state, the red point state interface of the animal washing displays the red point, and when the consumption state is not the A state, the red point state interface of the animal washing does not display the red point. After the red point state interface for washing the animals is updated, when the consumption state is the B state, the red point state interface for washing the animals displays red points, and when the consumption state is not the B state, the red point state interface for washing the animals does not display red points. In the embodiment of the application, because the A state and the smart animal scouring red spot state interface have the binding relationship, a UI developer does not need to modify the UI logic corresponding to the smart animal scouring red spot state interface, and only needs to update the A state to the B state.
The UI implementation framework can be greatly simplified aiming at fussy UI logic, developers only need to bind when opening the interface, the automatic reaction of data updating to the UI interface can be realized, and meanwhile, the binding can be automatically released when the interface is closed.
According to the UI updating method, developers only need to execute binding mapping once when the interface is opened, the UI layer can be separated from the data layer, and display of the UI layer can be automatically updated only by maintaining the logic of the data layer, so that the complexity of UI development is reduced, and the updating efficiency of the UI is improved.
Generally, there may be an association relationship between data corresponding to different UI interfaces, so if an association relationship between data can be established and a UI is updated according to the association relationship and the binding relationship between the data and the UI, for developers, the complexity of UI development is greatly reduced, so as to improve the updating efficiency of the UI.
Specifically, fig. 3 is a flowchart of a UI updating method according to another embodiment of the present application, and as shown in fig. 3, after step S102, the UI updating method further includes the following steps:
step S103: and establishing a data tree consisting of the first data and at least one second data.
Step S104: and after any child node in the data tree is updated, updating the parent node of any child node.
Step S105: and establishing a second binding relationship between the parent node and the second UI.
Step S106: and after the father node is updated, updating the second UI according to the second binding relationship.
For the sake of clarity, the parent node in step S104 may be referred to as parent node a, and the parent node of parent node a may be referred to as parent node B. It should be noted that step S105 and step S106 are optional steps, for example: step S104 is followed by step S105A of updating the parent node B based on the parent node a. And step S106, 106A, establishing a third binding relationship between the father node B and the third UI, and updating the third UI according to the third binding relationship after the father node B is updated.
Further, it is common that the game red dot system is logically broken, wherein the red dot system serves as an auxiliary reminding system, and the red dot display logic alternates with each part of the main body code. The red dot system has larger logic amount, the code amount of the red dot system is usually not inferior to that of a main system, and the red dot system has more logic dispersion states and is difficult to maintain. Therefore, in order to reduce the development complexity of the red dot system, the updating efficiency of the red dot display interface is improved. The present embodiment is described herein with a game bonus system as an example:
first, a data tree of a red dot system is established, for example: fig. 4 is a schematic diagram of a data tree of a game redpoint system according to an embodiment of the present application, where the data tree includes a plurality of nodes, as shown in fig. 4, and a state of the game redpoint includes: and the four child nodes are respectively the player level, the animal level and the consumption state, and whether the player level or the animal level reaches the upper limit or not. The states of the smart animal scouring red points and the four child nodes of the smart animal scouring red points can be regarded as first data or second data, in the code implementation process, the states of the smart animal scouring red points can be used as a driving source dobj, the four child nodes included in the smart animal scouring red points can be used as four weak reference containers, and the four weak reference containers respectively store different types of events.
Likewise, the veterinary culture comprises: and the four child nodes are respectively a player grade, a smart animal grade, a material and a smart animal owner attribute condition. The four child nodes of the smart animal culture can be regarded as the first data or the second data, in the code implementation process, the smart animal culture can be used as a driving source dobj, the four child nodes included in the smart animal culture can be used as four weak reference containers, and the four weak reference containers respectively store different types of events.
Furthermore, the red point of the entrance of the animal is the red point state of the animal washing and the father node of the animal culture.
It should be noted that, in order to embody the binding relationship between the states of the red dots for animal washing, the animal cultivation, and the red dots for animal entrance and their corresponding red dot display UIs, in fig. 4, such binding relationship is shown by dotted lines, and the dotted lines indicate that the data tree shown in fig. 4 does not actually include the red dot display UIs.
After the data tree shown in fig. 4 is established, when any data in the data tree is updated, for example, after the player level in the animal scouring red spot state is updated, the data is automatically transferred and executed upwards, that is, the UI updating device updates the animal scouring red spot state according to the updated player level until all nodes above the player level are updated, and based on the update, the red spot display UI is updated according to the binding relationship between the animal scouring red spot state and the corresponding red spot display UI, and the red spot display UI is updated according to the binding relationship between the animal entry red spot and the corresponding red spot display UI.
Further, on the basis of the data tree shown in fig. 4, child nodes may be added and deleted, and the binding relationship between the nodes and the UI may also be added and deleted.
In summary, in the embodiment of the present application, the association relationship between data (nodes) is established by establishing the data tree, so that after any node in the data tree is updated, the corresponding UI is updated, thereby improving the UI updating efficiency. Furthermore, as the child nodes and the binding relationship between the nodes and the UI can be increased and deleted at will, the expansibility and the maintainability of the red dot system are improved.
Fig. 5 is a schematic structural diagram of a UI updating apparatus 500 according to an embodiment of the present application, and as shown in fig. 5, the UI updating apparatus includes:
a first updating module 501, configured to update the first data.
A second updating module 502, configured to update the first user interface UI according to the first binding relationship between the first data and the first UI.
Optionally, the apparatus further comprises:
a first establishing module 503, configured to establish the first binding relationship between the first data and the first UI.
Optionally, the apparatus further comprises:
an obtaining module 504, configured to obtain a life cycle of the first binding relationship.
A releasing module 505, configured to release the first binding relationship when the duration of the first binding relationship reaches the life cycle.
Optionally, the apparatus further comprises:
a storage module 506, configured to store the first data and the first binding relationship in a form of a weak reference container.
Optionally, the apparatus further comprises:
a deleting module 507, configured to delete the first binding relationship from the weak reference container after the first binding relationship is released.
Optionally, the apparatus further comprises:
a second establishing module 508, configured to establish a data tree formed by the first data and at least one second data.
A third updating module 509, configured to update the parent node of any child node in the data tree after the child node is updated.
Optionally, the apparatus further comprises:
a fourth establishing module 510, configured to establish a second binding relationship between the parent node and the second UI.
And a fourth updating module 511, configured to update the second UI according to the second binding relationship after the parent node is updated.
The UI updating device provided in this embodiment of the present application may be used to execute the UI updating method described above, and the content and effect of the UI updating device may refer to the method embodiment, which is not described in detail herein.
Fig. 6 is a schematic structural diagram of a UI updating apparatus 600 according to an embodiment of the present application, and as shown in fig. 6, the UI updating apparatus includes: a processor 601, a memory 602, and a transceiver 603.
The transceiver 603 is used for signaling interaction between the UI updating device 600 and other devices. The memory 602 is used for storing the execution instructions of the processor 601, so that the processor 51 implements the following method.
The first data is updated.
And updating the first UI according to the first binding relation between the first data and the first UI.
Optionally, the method further comprises: establishing the first binding relationship between the first data and the first UI.
Optionally, the method further comprises: and acquiring the life cycle of the first binding relationship. And when the duration of the first binding relationship reaches the life cycle, removing the first binding relationship.
Optionally, the method further comprises: storing the first data and the first binding relationship in the form of a weak reference container.
Optionally, the method further comprises: deleting the first binding relationship from the weak reference container after the first binding relationship is released.
Optionally, the method further comprises: and establishing a data tree formed by the first data and at least one second data. And after any child node in the data tree is updated, updating the father node of any child node.
Optionally, the method further comprises: and establishing a second binding relationship between the parent node and a second UI. And after the father node is updated, updating the second UI according to the second binding relationship.
Processor 601 may include one or more Application Specific Integrated Circuits (ASICs), Digital Signal Processors (DSPs), Digital Signal Processing Devices (DSPDs), Programmable Logic Devices (PLDs), Field Programmable Gate Arrays (FPGAs), controllers, micro-controllers, microprocessors or other electronic components, and the like.
The memory 602 may be implemented by any type or combination of volatile or non-volatile memory devices, such as Static Random Access Memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic or optical disks.
The UI updating device provided in this embodiment of the present application may be configured to execute the UI updating method described above, and the content and effect of the UI updating device may refer to the method embodiment, which is not described in detail herein.
An embodiment of the present application further provides a storage medium, where the storage medium includes instructions, and the instructions are used to implement the following UI updating method.
The first data is updated.
And updating the first UI according to the first binding relation between the first data and the first UI.
Optionally, the method further comprises: establishing the first binding relationship between the first data and the first UI.
Optionally, the method further comprises: and acquiring the life cycle of the first binding relationship. And when the duration of the first binding relationship reaches the life cycle, removing the first binding relationship.
Optionally, the method further comprises: storing the first data and the first binding relationship in the form of a weak reference container.
Optionally, the method further comprises: deleting the first binding relationship from the weak reference container after the first binding relationship is released.
Optionally, the method further comprises: and establishing a data tree formed by the first data and at least one second data. And after any child node in the data tree is updated, updating the father node of any child node.
Optionally, the method further comprises: and establishing a second binding relationship between the parent node and a second UI. And after the father node is updated, updating the second UI according to the second binding relationship.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This application is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
It will be understood that the present disclosure is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.

Claims (12)

1. A UI update method, comprising:
updating the first data;
updating the first User Interface (UI) according to the first binding relationship between the first data and the first UI;
establishing a data tree formed by the first data and at least one second data;
after any child node in the data tree is updated, updating a father node of any child node;
establishing a second binding relationship between the parent node and a second UI;
and after the father node is updated, updating the second UI according to the second binding relationship.
2. The method of claim 1, before updating the first User Interface (UI) according to the first binding relationship between the first data and the first UI, further comprising:
establishing the first binding relationship between the first data and the first UI.
3. The method of claim 1 or 2, further comprising:
acquiring the life cycle of the first binding relationship;
and when the duration of the first binding relationship reaches the life cycle, removing the first binding relationship.
4. The method of claim 1 or 2, further comprising:
storing the first data and the first binding relationship in the form of a weak reference container.
5. The method of claim 4, further comprising:
deleting the first binding relationship from the weak reference container after the first binding relationship is released.
6. A UI updating apparatus, comprising:
the first updating module is used for updating the first data;
the second updating module is used for updating the first UI according to the first binding relation between the first data and the first UI;
the second establishing module is used for establishing a data tree formed by the first data and at least one second data;
the third updating module is used for updating the father node of any child node after any child node in the data tree is updated;
the fourth establishing module is used for establishing a second binding relationship between the parent node and the second UI;
and the fourth updating module is used for updating the second UI according to the second binding relationship after the father node is updated.
7. The apparatus of claim 6, further comprising:
a first establishing module, configured to establish the first binding relationship between the first data and the first UI.
8. The apparatus of claim 6 or 7, further comprising:
the obtaining module is used for obtaining the life cycle of the first binding relationship;
and the releasing module is used for releasing the first binding relationship when the duration of the first binding relationship reaches the life cycle.
9. The apparatus of claim 6 or 7, further comprising:
a storage module, configured to store the first data and the first binding relationship in a form of a weak reference container.
10. The apparatus of claim 9, further comprising:
and the deleting module is used for deleting the first binding relationship from the weak reference container after the first binding relationship is released.
11. A UI updating apparatus characterized by comprising:
a processor and a memory;
the memory is to store instructions for execution by the processor to cause the processor to implement the UI updating method of any of claims 1-5.
12. A storage medium characterized in that the storage medium comprises instructions for implementing the UI update method according to any of claims 1-5.
CN201810491144.XA 2018-05-21 2018-05-21 UI updating method, device, equipment and storage medium Active CN108628629B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810491144.XA CN108628629B (en) 2018-05-21 2018-05-21 UI updating method, device, equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810491144.XA CN108628629B (en) 2018-05-21 2018-05-21 UI updating method, device, equipment and storage medium

Publications (2)

Publication Number Publication Date
CN108628629A CN108628629A (en) 2018-10-09
CN108628629B true CN108628629B (en) 2022-02-22

Family

ID=63693997

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810491144.XA Active CN108628629B (en) 2018-05-21 2018-05-21 UI updating method, device, equipment and storage medium

Country Status (1)

Country Link
CN (1) CN108628629B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110058915A (en) * 2019-04-19 2019-07-26 努比亚技术有限公司 Interface adaptation adaptation method, device, wearable device and storage medium
CN112190942A (en) * 2020-10-23 2021-01-08 网易(杭州)网络有限公司 Red dot system and data processing method based on red dot system

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101872305A (en) * 2010-06-08 2010-10-27 用友软件股份有限公司 UI (User Interface) performance and service logic separation method and system
CN104484169A (en) * 2014-12-09 2015-04-01 成都视达科信息技术有限公司 Android software user interface generating method and system and Android application system
CN105389315A (en) * 2014-09-04 2016-03-09 阿里巴巴集团控股有限公司 Dynamic webpage refreshing method and device
US9483240B1 (en) * 2015-05-27 2016-11-01 Google Inc. Data binding dependency analysis
CN107391114A (en) * 2017-06-27 2017-11-24 阿里巴巴集团控股有限公司 The page visualizes rendering intent and device

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105528206A (en) * 2015-12-02 2016-04-27 北京邮电大学 Web-based interface generation method

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101872305A (en) * 2010-06-08 2010-10-27 用友软件股份有限公司 UI (User Interface) performance and service logic separation method and system
CN105389315A (en) * 2014-09-04 2016-03-09 阿里巴巴集团控股有限公司 Dynamic webpage refreshing method and device
CN104484169A (en) * 2014-12-09 2015-04-01 成都视达科信息技术有限公司 Android software user interface generating method and system and Android application system
US9483240B1 (en) * 2015-05-27 2016-11-01 Google Inc. Data binding dependency analysis
CN107391114A (en) * 2017-06-27 2017-11-24 阿里巴巴集团控股有限公司 The page visualizes rendering intent and device

Also Published As

Publication number Publication date
CN108628629A (en) 2018-10-09

Similar Documents

Publication Publication Date Title
CN108628629B (en) UI updating method, device, equipment and storage medium
CN103164268B (en) System optimization method and device
CN108495195B (en) Network live broadcast ranking list generation method, device, equipment and storage medium
CN104077104B (en) A kind of display of the notice of mobile terminal notification bar and inspection method
WO2017101663A1 (en) Application guiding method and apparatus, and terminal
US9645834B2 (en) Methods for remote configuration of software applications
CN107426599B (en) Floating layer management method and system
CN103701996B (en) A kind of rapidly opened and closed method of the application notification of mobile terminal
CN103116456A (en) Device and method for achieving folder merging and intelligent terminal
CN105786519B (en) Android device program management method and android device
CN105095749A (en) Status bar notification takeover method and device
CN106874048A (en) A kind of processing method of application program self-starting, device and mobile terminal
US20240171668A1 (en) Method for urgently sending message, apparatus, and storage medium
CN110083355B (en) APP page processing method and device
CN108170424A (en) A kind of self extended method and system based on cloud knowledge base
CN111061549A (en) Multitask management method based on android, intelligent terminal and storage medium
CN115617788B (en) Product cleaning method and device and computer readable storage medium
CN105468344A (en) Floating layer setting method and device, and electronic equipment
CN108804088B (en) Protocol processing method and device
CN105975265A (en) Device based on improved MVP mode
CN109901849A (en) Application program installation method, device, electronic equipment and storage medium
CN110084036A (en) Prevent the method and device of application program self-starting
CN113157377B (en) Method and equipment for realizing control of application part by Android system
CN115016836A (en) Component version management method and device, electronic equipment and system
CN108319420A (en) A kind of picture loading method and device

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
GR01 Patent grant
GR01 Patent grant