CN104881305A - Method and terminal for loading Fragment - Google Patents

Method and terminal for loading Fragment Download PDF

Info

Publication number
CN104881305A
CN104881305A CN201510241016.6A CN201510241016A CN104881305A CN 104881305 A CN104881305 A CN 104881305A CN 201510241016 A CN201510241016 A CN 201510241016A CN 104881305 A CN104881305 A CN 104881305A
Authority
CN
China
Prior art keywords
fragment
node
load
tree construction
loading
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.)
Granted
Application number
CN201510241016.6A
Other languages
Chinese (zh)
Other versions
CN104881305B (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.)
Fujian TQ Digital Co Ltd
Original Assignee
Fujian TQ Digital 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 Fujian TQ Digital Co Ltd filed Critical Fujian TQ Digital Co Ltd
Priority to CN201510241016.6A priority Critical patent/CN104881305B/en
Publication of CN104881305A publication Critical patent/CN104881305A/en
Application granted granted Critical
Publication of CN104881305B publication Critical patent/CN104881305B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention provides a method and a terminal for loading Fragment, wherein the method comprises the following steps: generating a tree structure of a Fragment node; determining position information of the Fragment node in the tree structure; configuring loading state information of the Fragment node; loading the Fragment on a corresponding subnode based on the loading state information of the Fragment node; and unloading the Fragment on a father node or a brother node corresponding to the subnode. By such means, the memory usage can be reduced, the surplus memory can be released in time, the I/O efficiency of terminal equipment can be increased, and the running of a complex program on low-side equipment is possible.

Description

Load method and the terminal of Fragment
Technical field
The present invention relates to Android technical field, especially relate to a kind of method and the terminal that load Fragment.
Background technology
Fragment is the assembly in Android, is used for showing interface content, can accept the operations such as user's click, dragging and user carries out alternately.A complicated Android application is made up of a large amount of Fragment usually, different Fragment shows that different interfaces realizes different operations, when a large amount of Fragment is loaded into internal memory simultaneously, those current memory headrooms not having the Fragment shown to take are wasted, only 1 to 3 Fragment can be shown, if so do not have reasonable management Fragment to have a large amount of internal memories to be wasted the while of general.In another kind of situation, Fragment is loaded into internal memory and relates to magnetic disc i/o operation, speed is comparatively slow, impacts Consumer's Experience.
Summary of the invention
Technical matters to be solved by this invention is: provide a kind of method and the terminal that load Fragment, realizes loading the selectivity of Fragment, unloading and releasing memory space, improves internal memory service efficiency.
In order to solve the problems of the technologies described above, the technical solution used in the present invention is: provide a kind of method loading Fragment, comprising: the tree construction generating Fragment node; Determine the positional information of described Fragment node on described tree construction; The stress state information of described Fragment node is set; The Fragment on corresponding child node is loaded according to the stress state information of described Fragment node; Unload the Fragment on father node corresponding to described child node or sibling.
Wherein, the step generating the tree construction of Fragment node is specially: start-up routine, and program described in initialization; Load JSON description document; Described tree construction is generated according to described JSON description document definition.
Wherein, determine that the step of the positional information of described Fragment node on described tree construction is specially: the relational organization form defining described Fragment; JSON is used to describe described relational organization form; Determine the positional information of the child node of described Fragment, father node and sibling.
Wherein, the step arranging the stress state information of described Fragment node is specially: associate described Fragment to corresponding name, and arrange the path of described Fragment; Determine the contextual information of described Fragment, and contextual information arranges and organizes call relation between different Fragment; One of them that described Fragment is prestrain, delay loading, condition load is set.
Wherein, the Fragment unloaded on father node corresponding to described child node or sibling is specially: the Fragment node that unloading is designated prestrain, delay loading, condition load one of them.
Wherein, comprise according to the step of the Fragment on the child node of the stress state information loading correspondence of described Fragment node: the Fragment that prestrain root node is corresponding; The stress state information of prestrain is needed, the Fragment on the corresponding Fragment child node of prestrain according to child node; The Fragment that delay loading other nodes except root node are corresponding.
For solving the problem, the present invention also provides a kind of terminal loading Fragment, comprising: tree construction unit, for generating the tree construction of Fragment node; Position units, for determining the positional information of described Fragment node on described tree construction; Metamessage unit, for arranging the stress state information of described Fragment node; Loading unit, for loading the Fragment on corresponding child node according to the stress state information of described Fragment node; Unloading unit, for unloading the Fragment on father node corresponding to described child node or sibling.
Wherein, described tree construction unit comprises: program promoter unit, for start-up routine, and program described in initialization; Tree construction generates subelement, for loading JSON description document, and generates described tree construction according to described JSON description document definition.
Wherein, described position units comprises: form definition subelement, for defining the relational organization form of described Fragment; Form descriptor unit, describes described relational organization form for using JSON; Locator unit, for determining the positional information of the child node of described Fragment, father node and sibling.
Wherein, described metamessage unit comprises: key-value pair subelement, for associating described Fragment to corresponding name, and arranges the path of described Fragment; Context subelement, for determining the contextual information of described Fragment, and contextual information arranges and organizes call relation between different Fragment; Metamessage arranges subelement, for arrange described Fragment be prestrain, delay loading, condition load one of them.
Beneficial effect of the present invention is: be different from prior art, the present invention is by generating Fragment node tree construction, and determine its positional information, corresponding stress state information is set, and load, last unloading after Fragment uses, realize the release of memory headroom, therefore when there being a large amount of Fragment to load into internal memory simultaneously, the present invention can realize loading the selectivity of Fragment, unloading, timely releasing memory space, while improving internal memory service efficiency, also improve magnetic disc i/o operating efficiency, realize the feasibility run in low side devices.
Accompanying drawing explanation
Fig. 1 is the schematic flow sheet of the inventive method embodiment one;
Fig. 2 is the schematic flow sheet of the inventive method embodiment one concrete operation step;
Fig. 3 is the structural representation of terminal embodiment two of the present invention;
Fig. 4 is terminal embodiment two concrete structure schematic diagram of the present invention;
Fig. 5 is the process flow diagram of the integrated operation step of method of the present invention and terminal;
Fig. 6 is the interface schematic diagram one of the specific embodiment of the invention;
Fig. 7 is the interface schematic diagram two of the specific embodiment of the invention;
Fig. 8 is the interface schematic diagram three of the specific embodiment of the invention.
Embodiment
By describing technology contents of the present invention in detail, realized object and effect, accompanying drawing is coordinated to be explained below in conjunction with embodiment.
Please refer to Fig. 1, the inventive method embodiment one provides a kind of method loading Fragment, comprises the steps:
S110: the tree construction generating Fragment node;
S120: determine the positional information of described Fragment node on described tree construction;
S130: the stress state information that described Fragment node is set;
S140: load the Fragment on corresponding child node according to the stress state information of described Fragment node;
S150: unload the Fragment on father node corresponding to described child node or sibling.
Usually, those skilled in the art can for the information of the Fragment node that will load, definition generation tree construction, tree is a kind of important nonlinear data structure, the structure organized by branch's relation by data element (being called node in tree).The node that on tree construction, existence one is special, is called root node or root (root).Except root node, all the other nodes are divided into multiple mutually disjoint finite aggregate (or subset), and each subset is also tree-building version.Other nodes on tree construction except root node, may be defined as father node, child node or sibling according to its position on tree construction.Each node represents the metamessage of a Fragment, whether whether the metamessage in the present invention mainly refers to the stress state information of each Fragment node, prestrain, delay loading or whether condition loads stress state information such as (just loading after namely meeting correlated condition) as.Metamessage as a node is prestrain, then, when program starts, will enter internal memory by pre-loaded its.Usual root node is all prestrain, and other all node Fragment can not prestrain, only loads the Fragment of corresponding child node according to the metamessage of node on tree construction.
And in order to not take too much internal memory, being set to delay loading or condition to first message of some nodes loads, just these nodes only have and meet specified conditions or the specific moment loads.The node (comprising prestrain) loaded after using, if when not having a negative impact to whole program after unloading, can unload it, so just can releasing memory.
From foregoing description, beneficial effect of the present invention is: be different from prior art, the inventive method embodiment one is by being Fragment node spanning tree structure, and after upper tree construction determines its positional information, according to actual needs corresponding stress state information is arranged to it, and unload after using.Achieve the abundant use to memory headroom like this, do not take too much internal memory again, improve the travelling speed of respective electronic equipment, as I/O operation etc.
Wherein, as shown in Figure 2, the inventive method embodiment one, when performing step S110, specifically can perform following steps:
S111: start-up routine, and program described in initialization;
S112: load JSON description document;
S113: generate described tree construction according to described JSON description document definition.
When initialize routine, can show the Fragment that root node is corresponding, the Fragment of other nodes can not prestrain.
JSON (JavaScript Object Notation) is a kind of data interchange format of lightweight.It is a subset based on JavaScript (Standard ECMA-2623rd Edition-December 1999).JSON adopts the text formatting being totally independent of language, but also using the custom (comprising C, C++, C#, Java, JavaScript, Perl, Python etc.) being similar to C language family.The data interchange language that these characteristics make JSON become desirable.Be easy to people read and write, be also easy to machine simultaneously and resolve and generate (network transfer speeds).The description document of JSON form is used to be beneficial to very much parsing and the maintenance of program.
In like manner, when performing step S120, may correspond to execution following steps:
S121: the relational organization form defining described Fragment;
S122: use JSON to describe described relational organization form;
S123: the positional information determining the child node of described Fragment, father node and sibling.
First the present invention defines Fragment relational organization form, JSON is used to describe, and provide as follows form, the benefit of this form is used to be beneficial to very much program resolve and maintain easily, all Fragment can be defaulted as delay loading, so only need to specify in configuration file to need pre-loaded Fragment, reduce maintenance load.
The several key word functions occurred in descriptor format are as follows:
" Fragments ": describe each Fragment occurred in application, use the form of key-value pair to represent, wherein Key represents the name of Fragment, and Value represents the complete trails of the class of Fragment
" Context ": the contextual information describing each Fragment, contextual information organizes call relation.
" node ": the node name describing Fragment, node name is the Key in Fragments joint.
" meta ": describe the metamessage of node, easily extensible attribute, such as defines whether preservation state.
" preload ": describe whether prestrain.
" ForceRefresh ": optional, whether description forces refreshing content after entering interface for the second time, when interface content be upgrade from network time, optional selection is forced upgrade interface or do not upgrade interface.
Concrete a description document is exemplified below:
According to foregoing description file, perform step S130 by such as under type:
S131: associate described Fragment to corresponding name, and the path of described Fragment is set;
S132: the contextual information determining described Fragment, and contextual information arranges and organizes call relation between different Fragment;
S133: one of them that described Fragment is prestrain, delay loading, condition load is set.
Fragments node describes all Fragment classes used in program, and specified associations is to a name.Context node describes other Fragment that each Fragment associates, and specifies the metamessage of these Fragment, comprises the information such as whether prestrain.
Wherein, in a specific embodiment, comprise according to the step of the Fragment on the child node of the stress state information loading correspondence of described Fragment node:
The Fragment that prestrain root node is corresponding, this is also that the root node in the present invention can be the main interface of terminal device because root node and other nodes distinct part.
Need the stress state information of prestrain according to child node, prestrain or condition load the Fragment on corresponding Fragment child node; When being in the position of father node, in a particular embodiment, sometimes need the situation according to its child node, pre-loaded or condition loads the Fragment in one or more child node correspondence, to carry out follow-up operation, as entered next interface or returning to previous interface.
The Fragment that delay loading other nodes except root node are corresponding, because root node is all prestrain, other nodes can delay loading as required, to reduce taking of internal memory, only when entering into the step or interface that need loading or prestrain, just do corresponding operation.
In sum, the method of loading Fragment provided by the invention, be different from prior art, the present invention is after start-up routine, use JSON description document to generate tree construction, and describe the relational organization form between node, to determine its position on tree construction, associate Fragment to corresponding name and arrange path, call relation and pre-define different load information simultaneously.When practical operation, user can carry out prestrain to some node as required, condition loads or delay loading, to reduce too much taking device memory, is applicable on the equipment of hardware configuration low side.
Meanwhile, as shown in Figure 3, the present invention also provides a kind of terminal 100 loading Fragment, comprising:
Tree construction unit 110, for generating the tree construction of Fragment node;
Position units 120, for determining the positional information of described Fragment node on described tree construction;
Metamessage unit 130, for arranging the stress state information of described Fragment node;
Loading unit 140, for loading the Fragment on corresponding child node according to the stress state information of described Fragment node;
Unloading unit 150, for unloading the Fragment on father node corresponding to described child node or sibling.
Particularly, as shown in Figure 4, described tree construction unit 110 comprises:
Program promoter unit 111, for start-up routine, and program described in initialization;
Tree construction generates subelement 112, for loading JSON description document, and generates described tree construction according to described JSON description document definition.
Described position units 120 comprises:
Form definition subelement 121, for defining the relational organization form of described Fragment;
Form descriptor unit 122, describes described relational organization form for using JSON;
Locator unit 123, for determining the positional information of the child node of described Fragment, father node and sibling.
Described metamessage unit 130 comprises:
Key-value pair subelement 131, for associating described Fragment to corresponding name, and arranges the path of described Fragment;
Context subelement 132, for determining the contextual information of described Fragment, and contextual information arranges and organizes call relation between different Fragment;
Metamessage arranges subelement 133, for arrange described Fragment be prestrain, delay loading, condition load one of them.
Simultaneously with reference to Fig. 5 ~ 8, Fig. 5 is an one-piece construction process flow diagram of application said method and terminal, Fig. 6 ~ 8 are the working interface schematic diagram when applying the inventive method and terminal respectively, wherein in Fig. 6 ~ 8, hexagonal frame table shows the Fragment loaded into internal memory, the Fragment of the current display of empty wire frame representation, solid box represents the Fragment do not loaded into internal memory, is namely present in the Fragment on disk.Straight line in each frame represents redirect relation therebetween, because can intersect between node, so the Fragment of another node can be jumped to from the Fragment of a node, when arranging, only need safeguard redirect relation therebetween, the pre-defined of the stress state information at different interface can be realized, as prestrain, condition load or delay loading.
Wherein, during program initialization, load JSON description document, according to description document definition spanning tree structure, and show main interface.Specifically as shown in Figure 5, use JSON description document to load, after this JSON description document is resolved, generate the Context information of Fragment list and each node, complete these steps and get final product spanning tree structure, complete the initialization of program, and then show main interface on the terminal device.Usually, the Fragment at main interface can be considered it is root node, and is all prestrain, and the X in Fig. 5, Y are the node metamessage described by JSON.
Namely, if current display is the A node in tree construction, prestrain A all being labeled as occurs during display A can the child node of prestrain, ignore-tag is the node of not prestrain, the node of not prestrain loads when only having user clearly to jump to this kind of interface, unloads after jumping out this kind of interface.
After the Fragment loading root node, obtain the Context information of root node, depending on actual conditions, as can be seen from figures 6 to 8, can pre-loaded FragmentA, FragmentB operate accordingly to enter next interface or to perform on main interface, the Fragment of all current interface associations is present in the list of closing tie-point, is labeled as the interface not having prestrain, loads when only having user clearly to jump to this kind of interface; If current interface does not associate other child nodes Fragment, then represent that list is empty, then represent that this interface does not have operability, now user can select to return back to an interface or directly select to quit a program.
If close the node Fragment that there are prestrain or other load informations in the list of tie-point, then represent that list is not empty, user can select the operation continuing to perform this interface selectable in the next interface entered, as shown in Figure 6, and prestrain FragmentA1, FragmentA2.This step is actually the repetition of above-mentioned steps, therefore also needs to perform determining step, if so, then continues next step operation, otherwise, then return the judgement of the linked list to father node.
At certain node place, when its pass tie-point list is empty, then need to turn back to its father node place, the linked list of traversal father node, if father node linked list is empty, namely represents that this interface does not have operability, be then switched to other interfaces or directly quit a program.If father node linked list is not empty, then the entry obtained in list operates, and performs the stress state information of its correspondence, simultaneously in order to reduce taking of internal memory, execution its load information after, if on operation do not form affect time, this entry can be unloaded in time from internal memory.
Particularly, in Fig. 6 when showing main interface, according to Interface Element information state, now there are 3 Fragment (comprise the Fragment at main interface, main interface visual is root node) in prestrain FragmentA and FragmentB simultaneously in internal memory.
When jumping to FragmentA, as shown in Figure 7, now show FragmentA interface, metamessage according to FragmentA node at this moment describes, prestrain FragmentA1 and FragmentA2, now there are 4 Fragment in internal memory simultaneously, because FragmentB1 is described as not pre-loaded, so can not FragmentB1 be loaded, only have and just load when user clearly selects to jump to FragmentB1, this situation is because some interface user's access frequency is higher, and partly some is lower, prestrain just can not be done in the interface of lower frequency, the Fragment of these prestrains can be configured by metamessage, user is as got back to main interface by return key or jump to FragmentA1, FragmentA2, FragmentB1 is to be switched to other interfaces, when other interfaces all loaded, operation just can complete fast.
When user selects to jump to FragmentA1 interface, as shown in Figure 8, now show FragmentA1 interface, prestrain FragmentC1, now main interface (root node) cannot directly have access to, so can discharge from internal memory, at this moment there are 3 Fragment in internal memory simultaneously.
Owing to being all only have a few active Fragment committed memory at every turn, therefore method of the present invention is applicable on the equipment of low side.
In Fig. 5 after step " judges whether close tie-point list is empty ", if it is empty, then need the father node traveling through current node, the child node of its all prestrain is put into list, Fragment in internal memory is loaded in order to discharge, and this node is the node not directly had access to, can directly redirect go over, , this node may have multiple sources node, its all father node i.e., after obtaining all father nodes, travel through these father nodes, that can judge whether to have loaded from the stress state information of all father nodes but the node of not directly accessing, these nodes are unloaded, release.
In real life, limited memory in Android device, if the available memory space that Android framework distributes to each application is 30M, if all interfaces load into EMS memory occupation 15M simultaneously, that leaves other functions for only has 15M, when Loading Image, (picture takies a large amount of memory headrooms) very easily produces OOM problem (a kind of crash issue caused because of Out of Memory), after using delay loading technology, the Fragment simultaneously loaded into internal memory may only have a few, most internal memory can be saved and leave the use of other functions for, simultaneously again due to prestrain technology, the interface Caton phenomenon that the expense loading Fragment causes can not be caused.
The foregoing is only embodiments of the invention; not thereby the scope of the claims of the present invention is limited; every equivalents utilizing instructions of the present invention and accompanying drawing content to do, or be directly or indirectly used in relevant technical field, be all in like manner included in scope of patent protection of the present invention.

Claims (10)

1. load a method of Fragment, it is characterized in that, comprising:
Generate the tree construction of Fragment node;
Determine the positional information of described Fragment node on described tree construction;
The stress state information of described Fragment node is set;
The Fragment on corresponding child node is loaded according to the stress state information of described Fragment node;
Unload the Fragment on father node corresponding to described child node or sibling.
2. load the method for Fragment according to claim 1, it is characterized in that, the step generating the tree construction of Fragment node is specially:
Start-up routine, and program described in initialization;
Load JSON description document;
Described tree construction is generated according to described JSON description document definition.
3. load the method for Fragment according to claim 1, it is characterized in that, wherein determine that the step of the positional information of described Fragment node on described tree construction is specially:
Define the relational organization form of described Fragment;
JSON is used to describe described relational organization form;
Determine the positional information of the child node of described Fragment, father node and sibling.
4. load the method for Fragment according to claim 1, it is characterized in that, the step wherein arranging the stress state information of described Fragment node is specially:
Associate described Fragment to corresponding name, and the path of described Fragment is set;
Determine the contextual information of described Fragment, and contextual information arranges and organizes call relation between different Fragment;
One of them that described Fragment is prestrain, delay loading, condition load is set.
5. load the method for Fragment according to claim 1, it is characterized in that, the Fragment unloaded on father node corresponding to described child node or sibling is specially: the Fragment node that unloading is designated prestrain, delay loading, condition load one of them.
6. load the method for Fragment according to claim 1, it is characterized in that, wherein comprise according to the step of the Fragment on the child node of the stress state information loading correspondence of described Fragment node:
The Fragment that prestrain root node is corresponding;
The stress state information of prestrain is needed, the Fragment on the corresponding Fragment child node of prestrain according to child node;
The Fragment that delay loading other nodes except root node are corresponding.
7. load a terminal of Fragment, it is characterized in that, comprising:
Tree construction unit, for generating the tree construction of Fragment node;
Position units, for determining the positional information of described Fragment node on described tree construction;
Metamessage unit, for arranging the stress state information of described Fragment node;
Loading unit, for loading the Fragment on corresponding child node according to the stress state information of described Fragment node;
Unloading unit, for unloading the Fragment on father node corresponding to described child node or sibling.
8. load the terminal of Fragment according to claim 7, it is characterized in that, described tree construction unit comprises:
Program promoter unit, for start-up routine, and program described in initialization;
Tree construction generates subelement, for loading JSON description document, and generates described tree construction according to described JSON description document definition.
9. load the terminal of Fragment according to claim 7, it is characterized in that, described position units comprises:
Form definition subelement, for defining the relational organization form of described Fragment;
Form descriptor unit, describes described relational organization form for using JSON;
Locator unit, for determining the positional information of the child node of described Fragment, father node and sibling.
10. load the terminal of Fragment according to claim 7, it is characterized in that, described metamessage unit comprises:
Key-value pair subelement, for associating described Fragment to corresponding name, and arranges the path of described Fragment;
Context subelement, for determining the contextual information of described Fragment, and contextual information arranges and organizes call relation between different Fragment;
Metamessage arranges subelement, for arrange described Fragment be prestrain, delay loading, condition load one of them.
CN201510241016.6A 2015-05-13 2015-05-13 Load Fragment method and terminal Active CN104881305B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510241016.6A CN104881305B (en) 2015-05-13 2015-05-13 Load Fragment method and terminal

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510241016.6A CN104881305B (en) 2015-05-13 2015-05-13 Load Fragment method and terminal

Publications (2)

Publication Number Publication Date
CN104881305A true CN104881305A (en) 2015-09-02
CN104881305B CN104881305B (en) 2018-03-06

Family

ID=53948811

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510241016.6A Active CN104881305B (en) 2015-05-13 2015-05-13 Load Fragment method and terminal

Country Status (1)

Country Link
CN (1) CN104881305B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109683948A (en) * 2018-12-13 2019-04-26 深圳创维-Rgb电子有限公司 System data introduction method, device, electronic product and storage medium

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101963987A (en) * 2010-09-30 2011-02-02 百度在线网络技术(北京)有限公司 Methods and equipments for generating and loading web page file
CN102854853A (en) * 2012-08-13 2013-01-02 北京和利时系统工程有限公司 Cross-platform lightweight distributed control system
US20140282609A1 (en) * 2013-03-14 2014-09-18 Carefusion 303, Inc. Hybrid Service-Oriented Computing Architecture
CN104423932A (en) * 2013-08-21 2015-03-18 上海科泰世纪科技有限公司 Method for calling binary element in Javascript

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101963987A (en) * 2010-09-30 2011-02-02 百度在线网络技术(北京)有限公司 Methods and equipments for generating and loading web page file
CN102854853A (en) * 2012-08-13 2013-01-02 北京和利时系统工程有限公司 Cross-platform lightweight distributed control system
US20140282609A1 (en) * 2013-03-14 2014-09-18 Carefusion 303, Inc. Hybrid Service-Oriented Computing Architecture
CN104423932A (en) * 2013-08-21 2015-03-18 上海科泰世纪科技有限公司 Method for calling binary element in Javascript

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109683948A (en) * 2018-12-13 2019-04-26 深圳创维-Rgb电子有限公司 System data introduction method, device, electronic product and storage medium

Also Published As

Publication number Publication date
CN104881305B (en) 2018-03-06

Similar Documents

Publication Publication Date Title
JP7013466B2 (en) Application data processing methods, equipment, and computer programs
CN108519914B (en) Big data calculation method and system and computer equipment
US8286191B2 (en) Dynamically composing data stream processing applications
US8677366B2 (en) Systems and methods for processing hierarchical data in a map-reduce framework
CN106385329B (en) Processing method, device and the equipment of resource pool
US11134051B2 (en) Apparatus and method for managing notification
US8504501B2 (en) Dynamic constraint satisfaction problem solver
US9020973B2 (en) User interface model driven data access control
CN109634490A (en) A kind of list display method, device, equipment and storage medium
CN104598107A (en) Generating method and system of interface control
CN104657149A (en) Software framework implementation method of management module of storage system
US9235650B2 (en) Efficient conversion of XML data into a model using persistent stores and parallelism
CN103488674A (en) Computing system and method for implementing and controlling thereof
CN116360735A (en) Form generation method, device, equipment and medium
US20110209007A1 (en) Composition model for cloud-hosted serving applications
US7904417B2 (en) Recursive metadata templating
EP4024761A1 (en) Communication method and apparatus for multiple management domains
US10565202B2 (en) Data write/import performance in a database through distributed memory
US9280361B2 (en) Methods and systems for a real time transformation of declarative model and layout into interactive, digital, multi device forms
CN104881305A (en) Method and terminal for loading Fragment
CN104778087B (en) A kind of information processing method and information processing unit
US11893365B2 (en) Semantic design system
CN108762753A (en) Page assembly amending method and equipment
CN109542672A (en) Method and apparatus for recycling the memory block in snapshot storage space
CN112698826B (en) Low code page creation system, method and equipment

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
EXSB Decision made by sipo to initiate substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant