CN112799765A - Intelligent skip method and equipment based on page coding and storage medium - Google Patents
Intelligent skip method and equipment based on page coding and storage medium Download PDFInfo
- Publication number
- CN112799765A CN112799765A CN202110131086.1A CN202110131086A CN112799765A CN 112799765 A CN112799765 A CN 112799765A CN 202110131086 A CN202110131086 A CN 202110131086A CN 112799765 A CN112799765 A CN 112799765A
- Authority
- CN
- China
- Prior art keywords
- page
- navigation
- pages
- transaction
- skipping
- 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
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements 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/44—Arrangements for executing specific programs
- G06F9/451—Execution arrangements for user interfaces
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/08—Payment architectures
- G06Q20/10—Payment architectures specially adapted for electronic funds transfer [EFT] systems; specially adapted for home banking systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/06—Asset management; Financial planning or analysis
Abstract
The invention relates to an intelligent skip method, equipment and storage medium based on page coding, wherein the method comprises the following steps: setting corresponding page codes for different pages, wherein the page codes comprise 7 bits: the 1 st bit code corresponds to a navigation page or a service page identifier; the 2 nd to 3 rd bit codes correspond to the service class; the 4 th bit code corresponds to the service flow program number; the 5 th bit code corresponds to a business process step; the 6 th to 7 th bit codes correspond to page serial numbers; then, based on a preset page jump rule, combining with page coding, defaulting the next page to return to the previous page, so as to respectively realize: jumping between navigation pages; skipping between pages in the same service; skipping between the navigation page and the business process page; skipping among different business process pages; and skipping between the business process page embedded between the two navigation pages and the two navigation pages. Compared with the prior art, the invention can effectively realize flexible skip among pages in a complex service scene.
Description
Technical Field
The invention relates to the technical field of page skipping, in particular to an intelligent skipping method, equipment and a storage medium based on page coding.
Background
The mobile terminal application jump generally implements page jump in two ways, the first is a stack technology (as shown in fig. 1), maintains all current pages in a stack form, and can redirect to a specified page in a stack entering or stack exiting way when a route switching occurs. Although the stack-based jump mode effectively records user access records, the stack-based jump mode is limited by the characteristic of a stack storage mode of 'first in and then out', the flexibility is poor when a specified page is returned, and the dynamic return to the specified page is increasingly difficult according to the requirements of users along with the increase of page levels.
The second is an improvement on the basis of the stack technology, by specifying a returned target page, positioning the relative position of the page in the stack, then popping the relevant page, and further dynamically returning to the specified page. That is, when each page is returned, the target page returned by the page is designated and returned to the corresponding page, and this method requires that when each page is returned, according to different service scenarios of historical access, the judgment logic of the returned page is added, and the page can be returned to the corresponding page, for example: when a user carries out large-amount transfer transaction, the user must pass through an advanced authentication and verification page, at the moment, the specified navigation page can be reached only by returning 4 pages forwards after the completion of the page returning method, if the user does not need to carry out the advanced authentication and verification page when carrying out the small-amount transfer transaction, the specified navigation page can be reached only by returning 3 pages forwards after the completion of the page returning method, and under the two conditions, the user needs to make various judgments on the completion page and can return to the specified position. Compared with a stack mode, the method improves the customer experience, but developers need to consider the return logic of each page. With the increase of page levels, the mutual skip among multiple transaction pages is supported in service, and the return in a complex scene is realized by specifying the returned target page one by one, so that the development difficulty is greatly increased, and unnecessary defects are generated.
Disclosure of Invention
The present invention aims to overcome the defects of the prior art and provide an intelligent skip method, an intelligent skip device and an intelligent skip storage medium based on page coding, so as to realize flexible skip between pages in a complex service scene.
The purpose of the invention can be realized by the following technical scheme: an intelligent skip method based on page coding comprises the following steps:
s1, setting corresponding page codes for different pages, wherein the page codes comprise 7 bits: the 1 st bit code corresponds to a navigation page or a service page identifier;
the 2 nd to 3 rd bit codes correspond to the service class;
the 4 th bit code corresponds to the service flow program number;
the 5 th bit code corresponds to a business process step;
the 6 th to 7 th bit codes correspond to page serial numbers;
s2, based on the preset page jump rule, combining with the page coding, defaulting the next page to return to the previous page, so as to respectively realize:
jumping between navigation pages;
skipping between pages in the same service;
skipping between the navigation page and the business process page;
skipping among different business process pages;
and skipping between the business process page embedded between the two navigation pages and the two navigation pages.
Further, the values of the page coding in step S1 are specifically:
the 1 st bit code value is N, corresponding to a navigation page, and the 1 st bit code value is T, corresponding to a service page;
the 2 nd-3 rd bit codes take values as two letters corresponding to the service type name and are used for identifying the service class to which the page belongs;
the 4 th bit code takes values of 0-9 and A-Z, wherein if the page is a navigation page, the 4 th bit code takes values of 0;
the value of the 5 th bit code is A, B, C, D or 0, wherein if the page is a navigation page, the value of the 5 th bit code is 0, and A, B, C or D corresponds to different business process steps;
and the 6 th-7 th bit codes take values of 01-99 and are used for sequencing a plurality of pages in the same service flow step according to the logical relation.
When the 5 th bit code value is A, filling a relevant page corresponding to information;
when the value is B, corresponding to the authentication check related page;
when the value is C, confirming the relevant page corresponding to the information;
and when the value is D, corresponding to the result related page.
Further, in step S2, the specific process of jumping between navigation pages is: the first navigation page jumps to a second navigation page, and after the jump is completed, the first navigation page and the second navigation page are respectively stacked; and when the second navigation page returns, popping the second navigation page.
Further, in step S2, the specific process of jumping between pages in the same service is as follows: and in the same service class, returning the next page to the previous page by default, and when the relevant page is failed to return, encoding the page in the traversal stack, finding the information filling relevant page closest to the current page, popping up the relevant page, and returning to the information filling relevant page.
Further, in step S2, the specific process of jumping between the navigation page and the business process page is as follows: and jumping between the navigation page and the business process page, returning the next page to the previous page by default, encoding the page in the traversal stack when the result related page is successfully returned, finding the navigation page nearest to the current page, popping the related page, and returning to the navigation page.
Further, in step S2, the specific process of jumping between different service pages is as follows: skipping among a plurality of service pages, returning the next page to the previous page by default, encoding the page in the traversal stack when the relevant page is successfully returned, finding the information filling relevant page nearest to the stack bottom, popping up the relevant page, and returning to the information filling relevant page.
Further, in step S2, the specific process of jumping between the service flow page embedded between the two navigation pages and the two navigation pages is as follows: skipping among the first navigation page, the business process page and the second navigation page, returning the next page to the previous page by default, and when the related page successfully enters another navigation page through the result, encoding the page in the traversal stack, finding the navigation page nearest to the top of the stack, popping the related page, and returning to the navigation page.
A computer device comprises a processor and a memory which are connected in a communication mode, wherein the memory stores a computer readable program, and the processor executes the computer readable program to realize the intelligent skip method based on page coding.
A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, implements the above-mentioned intelligent skip method based on page coding.
Compared with the prior art, the invention has the following advantages:
the method and the device set corresponding page codes for different pages, utilize data information carried by the page codes to directly jump to a target page according to the page codes when a new page is opened, can quickly and accurately determine the position of a current user business process according to the page codes when return buttons are clicked on different pages, follow a designed page jump rule, and can intelligently judge an ideal return position of a user. Different pages can realize the complex logic of multi-scene page skipping only by calling a common skipping method, and the page-by-page independent assignment is not needed to return to the target page. The jump between the pages is rapid and smooth, the page coding rule is clearly designed, and the expandability is high. The page coding table is simple to maintain, and is convenient for counting and positioning page problems, so that the fluency of user operation is effectively improved, and the user experience is further improved.
And secondly, according to the page jump rule provided by the invention, the next page (namely the current page) is returned to the previous page by default, and when the result related page fails or returns successfully, the page in the traversal stack is coded to find the page nearest to the current page or the page nearest to the top of the stack, the related page is popped out, and the page found after the traversal stack is directly returned, so that the return logic of various scenes added to the successful page by developers is reduced, and unnecessary defects caused by excessive logic branches are avoided.
Drawings
FIG. 1 is a diagram illustrating a prior art stack-type process;
FIG. 2 is a schematic flow diagram of the process of the present invention;
FIG. 3 is a diagram illustrating a page coding structure in an embodiment;
FIG. 4 is a schematic diagram illustrating jumping between navigation pages in an embodiment;
FIG. 5 is a diagram illustrating jumping between the same transaction pages in the embodiment;
FIG. 6 is a schematic diagram illustrating jumping between a navigation page and a transaction page in an embodiment;
FIG. 7 is a diagram illustrating jumping between pages of different transactions in an embodiment;
FIG. 8 is a diagram illustrating jumping between a transaction result page and a new navigation page in an embodiment.
Detailed Description
The invention is described in detail below with reference to the figures and specific embodiments.
Examples
As shown in fig. 2, an intelligent skip method based on page coding includes the following steps:
s1, setting corresponding page codes for different pages, wherein the page codes comprise 7 bits: the 1 st bit code corresponds to a navigation page or a service page identifier;
the 2 nd to 3 rd bit codes correspond to the service class;
the 4 th bit code corresponds to the service flow program number;
the 5 th bit code corresponds to a business process step;
the 6 th to 7 th bit codes correspond to page serial numbers;
in the technical scheme of the invention, the page code is a unique code used for identifying the front page; the navigation page is generally a home page of a certain function in the application, and is convenient for guiding a user to browse a page with detailed function content; a business page generally refers to a page in a specific business scenario, for example, a transaction page is a page involved in a specific transaction;
s2, based on the preset page jump rule, combining with the page coding, defaulting the next page to return to the previous page, so as to respectively realize:
jumping between navigation pages;
skipping between pages in the same service;
skipping between the navigation page and the business process page;
skipping among different business process pages;
and skipping between the business process page embedded between the two navigation pages and the two navigation pages.
In step S1, the values of the page code are specifically:
the 1 st bit code value is N, corresponding to a navigation page, and the 1 st bit code value is T, corresponding to a service page;
the 2 nd-3 rd bit codes take values as two letters corresponding to the service type name and are used for identifying the service class to which the page belongs;
the 4 th bit code takes values of 0-9 and A-Z, wherein if the page is a navigation page, the 4 th bit code takes values of 0;
the value of the 5 th bit code is A, B, C, D or 0, wherein if the page is a navigation page, the value of the 5 th bit code is 0, and A, B, C or D corresponds to different business process steps:
when the 5 th bit code value is A, filling the relevant page corresponding to the information;
when the value is B, corresponding to the authentication check related page;
when the value is C, confirming the relevant page corresponding to the information;
when the value is D, corresponding to the result related page;
and the 6 th-7 th bit codes take values of 01-99 and are used for sequencing a plurality of pages in the same service flow step according to the logical relation.
In step S2, the specific process of jumping between navigation pages is: the first navigation page jumps to a second navigation page, and after the jump is completed, the first navigation page and the second navigation page are respectively stacked; and when the second navigation page returns, popping the second navigation page.
The specific process of the skip between pages in the same service is as follows: and in the same service class, returning the next page to the previous page by default, and when the relevant page is failed to return, encoding the page in the traversal stack, finding the information filling relevant page closest to the current page, popping up the relevant page, and returning to the information filling relevant page.
The specific process of jumping between the navigation page and the business process page is as follows: and jumping between the navigation page and the business process page, returning the next page to the previous page by default, encoding the page in the traversal stack when the result related page is successfully returned, finding the navigation page nearest to the current page, popping the related page, and returning to the navigation page.
The specific process of jumping among different service pages is as follows: skipping among a plurality of service pages, returning the next page to the previous page by default, encoding the page in the traversal stack when the relevant page is successfully returned, finding the information filling relevant page nearest to the stack bottom, popping up the relevant page, and returning to the information filling relevant page.
The specific process of jumping between the business process page embedded between the two navigation pages and the two navigation pages is as follows: skipping among the first navigation page, the business process page and the second navigation page, returning the next page to the previous page by default, and when the related page successfully enters another navigation page through the result, encoding the page in the traversal stack, finding the navigation page nearest to the top of the stack, popping the related page, and returning to the navigation page.
In this embodiment, taking a business transaction scenario of a mobile banking as an example, based on the technical solution provided by the present invention, a set page coding structure is shown in fig. 3, and a specific coding value specification is shown in table 1:
TABLE 1
The code of the transaction information is added into the page code, the 1 st bit is used for distinguishing the navigation page and the transaction page, the navigation page is represented by 'N', and the transaction page is represented by 'T'. Digits 2-3 represent the business module, usually named according to English abbreviation of the business module, for example "TR" represents the transfer module and "WM" represents the financing module. The 4 th letter represents the transaction serial number in the service module, and the transactions in the same service module are sequentially arranged. The 5 th letter represents the transaction step, the transaction information filling page is identified as the page of the step A, the authentication tool check is identified as the page of the step B, the information confirmation is identified as the page of the step C, and the transaction result page is identified as the page of the step D according to the transaction characteristics. For example, the 5 th position "a" in "TTR 1a 01" indicates an a page, i.e., a transfer information filling page. The fifth bit "D" in "TCA 1D 01" represents the D step page. The 6 th to 7 th bits represent the page serial number, and the same transaction step comprises a plurality of pages which are sequentially ordered according to the logical relationship.
In the page coding design rule, the transaction page is divided into four steps of ABCD at most, wherein the step A is a related information filling page, the step B is related to an authentication check page, the step C is a related information confirmation page, and the step D is a related transaction result page. The page A is a transaction initial page, the page D is a transaction final page (result page), and if the transaction process is simple, partial steps can be omitted. If the transaction flow is long, the attributive transaction steps can be determined according to the functions of the pages, and if more page information filling page elements cannot be displayed in one page, two pages A01 and A02 can be set, wherein 01 and 02 are sequentially ordered according to the page logical relationship.
In the actual application process, jumping between pages, that is, returning the current page to the previous page by default, needs to follow the following 5 specific jumping rules:
(1) and jumping among navigation pages.
As shown in fig. 4, the navigation page 1 jumps to the navigation page 2, and after the jump is completed, the navigation page 1 and the navigation page 2 are respectively stacked. When returning at the navigation page 2, the navigation page 2 is popped.
An example of an applicable scenario is: and skipping from the financing home page to the my financing page. The financing home page and the my financing page are navigation pages and support the jump and return between the two navigation pages.
(2) Skipping among the same transaction pages, and returning a transaction failure page D to the transaction page A.
As shown in fig. 5, in the same transaction, the next page returns to the previous page by default, but when the transaction D fails, the page code in the traversal stack is used to find the transaction a page closest to the current page, and the page is popped up and returned to the transaction a page.
And (3) jumping among the same transaction pages, wherein if the transaction comprises A, B, C, D four steps, the four steps respectively correspond to a transaction A page, a transaction B page, a transaction C page and a transaction D page. And (3) entering a transaction B page from the transaction A page, entering the transaction B page into the transaction C page, and returning the transaction C page to the transaction B page and returning the transaction B page to the transaction A page. When the page A is traded, the page B, C is traded, and the page D is finally entered, the stack includes the page A, the page B, the page C and the page D according to the stacking rule. Clicking and returning in a transaction D page (failure page), traversing the page codes in the stack to find an A page closest to the current page according to the page codes corresponding to the current page in the stack, sequentially popping the transaction D page, the transaction C page and the transaction B page, and finally returning to the transaction A page.
An example of an applicable scenario is: and during transfer transaction, entering transfer information to fill in a page A, checking a page B by an authentication tool, confirming a page C by transfer information, finally entering a transfer failure page, selecting 'try again' on the page, returning to the page A of the transfer transaction, and pre-filling the page with the data of the page A filled in the last transfer information.
(3) And skipping between the navigation page and the transaction page, wherein the transaction success result page skips to the nearest navigation page.
As shown in fig. 6, the navigation page and the transaction page jump, the subsequent page returns to the previous page by default, but when the transaction D succeeds, the page code in the traversal stack is used to find the navigation page nearest to the current page, and the relevant page is popped and returned to the nearest navigation page.
And (4) jumping between the navigation page and the transaction page, wherein if the transaction comprises A, B, C, D four steps, the four steps respectively correspond to a transaction A page, a transaction B page, a transaction C page and a transaction D page. And entering a transaction A page, a path B page and a path C page from the navigation page 1 as an entrance, and finally entering a transaction result D page, wherein the stack comprises the navigation page 1, the A page, the B page, the C page and the D page according to the stacking rule. Clicking and returning in the page D (successful page), traversing page codes in the stack to find a navigation page closest to the current page, sequentially popping the transaction page D, the transaction page C, the transaction page B and the transaction page A, and returning to the previous navigation page 1.
An example of an applicable scenario is: and during transfer transaction, entering transfer information to fill in a page A, checking a page B by an authentication tool, confirming a page C by transfer information, finally entering a transfer success page, clicking to finish the transfer transaction, returning to a transfer transaction navigation page, and facilitating the user to transfer one account.
(4) And skipping among pages of different transactions, and returning a latter transaction result page to a transaction A page nearest to the stack bottom.
As shown in fig. 7, when the transaction D succeeds, the page code in the traversal stack is used to find the transaction a page closest to the stack bottom, and the page is popped up and returned to the transaction a page.
And jumping among a plurality of transactions (such as transaction one and transaction two), wherein the transaction one A page provides an entrance for jumping to the transaction two A page, the transaction two way trades the B page, the C page and the D page, and the transaction one A page can be returned when the transaction of the D page returns successfully. When the page D is used, the stack comprises a navigation page 1, a transaction page A, a transaction page B, a transaction page C and a transaction page D, when the page D is clicked and returned, the calculated target jumps to the page A of the transaction page I, the transaction page D, the transaction page C, the transaction page B and the transaction page A are sequentially popped, the page A of the transaction page I is entered, and the subsequent process of the transaction is completed.
An example of an applicable scenario is: entering the financing transaction information filling A page, filling the amount of money about to purchase the financing product, finding that the fund in the account is insufficient at the moment, entering the fund transfer transaction A page through the fund transfer transaction A page entrance, transferring the fund to transaction B page, C page and D page through the way, returning to the financing transaction A page after the fund transfer transaction is completed so as to continuously purchase the financing product.
(5) And skipping to a new navigation page for the transaction result page, and skipping to the navigation page nearest to the stack top when returning.
As shown in fig. 8, the navigation page, the transaction page, and the jump between the navigation pages, the following page returns to the previous page by default, but when the page successfully enters another navigation page through transaction D, the page code in the traversal stack is used to find the navigation page nearest to the stack top, the related page is popped up, and the navigation page is returned to.
The transaction embeds a jump between two navigation pages, from navigation page 1 entry into transaction a page, through transaction B, C, D page, and into navigation page 2 with D page as entry. And at the moment, the stack comprises a navigation page 1, a transaction A page, a transaction B page, a transaction C page, a transaction D page and a navigation page 2, clicking the navigation page 2 for returning, traversing page codes in the stack to find the navigation page 1, sequentially popping the navigation page 2, the transaction D page, the transaction C page, the transaction B page and the transaction A page, and returning to the navigation page 1.
An example of an applicable scenario is: and through a financial product detail navigation page inlet, purchasing transaction pages A, B and C by financial, clicking a 'my financial' navigation page after entering a financial product purchase success page D, checking the purchased financial product on the 'my financial' navigation page, and clicking a return to the financial product detail navigation page at the moment.
Based on the technical scheme, the page jump process in the transfer transaction process comprises the following steps:
1. the user transfers money on a mobile phone bank, and normal transfer business logic can be realized by using an intelligent skip method based on page coding according to the transfer business logic.
NTR0001->TTR1A01->TTR1B01->TTR1C01->TTR1D01
Each page is detailed as follows:
NTR 0001: "N" denotes a navigation page and "TR" denotes a transfer transaction
TTR1a 01: "T" denotes the transaction page, "TR" denotes the transfer transaction, and "1" denotes the first transaction in the transfer category-the card number transfer. "a" indicates a step a in the transfer transaction, i.e., the transfer information filling page, and "01" indicates a page number.
TTR1B 01: "T" denotes the transaction page, "TR" denotes the transfer transaction, and "1" denotes the first transaction in the transfer category-the card number transfer. "B" represents the step B in the transfer transaction, namely the transfer transaction authentication check page, and "01" represents the page serial number.
TTR1C 01: "T" denotes the transaction page, "TR" denotes the transfer transaction, and "1" denotes the first transaction in the transfer category-the card number transfer. "C" indicates a C step in the transfer transaction, i.e., a transfer information confirmation page, and "01" indicates a page number.
TTR1D 01: "T" denotes the transaction page, "TR" denotes the transfer transaction, and "1" denotes the first transaction in the transfer category-the card number transfer. "D" represents the step D in the transfer transaction, namely, the transfer result display page, and "01" represents the page serial number.
According to the design of page coding and jump rules, the stacking sequence is NTR0001, TTR1A01, TTR1B01, TTR1C01 and TTR1D01 in sequence, and jump among pages in the transfer process is realized.
2. And when the page returns in the failure of transaction, returning to the target page according to the page coding jump rule.
When the user operates the transfer transaction on the mobile phone bank, the user enters a transfer failure page due to some reasons, and clicks the return button at the upper left corner. In consideration of the operation habit of the user, the user fails to initiate a transfer transaction, and tends to return to the transfer information filling page according to the prompt information of the transfer failure so as to operate a transfer again. After the transfer failure page TTR1D01 is clicked and returned, firstly, the page code corresponding to the existing page in the stack is traversed, the transaction A page TTR1A01 closest to the current page is found, then, the TTR1D01, the TTR1C01 and the TTR1B01 in the stack are sequentially popped out, and finally, the transfer information filling page is returned, so that the user can conveniently change information and initiate a transfer process.
Technical implementation examples: skipping among the same transaction pages, and returning a transaction failure page D to the transaction page A. Jumping among the same transaction pages, when trading D pages, traversing page codes in a stack (channeltack), finding a transaction A page (backIndex identifies the index of the transaction A page which is closest to the current page in the stack), and returning to the transaction A page after realizing the pop related page through a popTo function. Due to the implementation of the common return back () method, the transfer transaction failure page (TTR1D01) can be returned to the transfer transaction information filling page (TTR1A01) by only calling the common back () method when processing the return logic
The code listing 1 below shows the code implementation of the common return method back () component, and the code listing 2 shows the code implementation of the transfer failure page calling the common back () method.
Js code list 1core \ bridge \ index
The embodiment also discloses computer equipment, which comprises a processor and a memory which are in communication connection, wherein the memory stores a computer readable program, and the processor realizes the intelligent skip method based on the page coding when executing the computer readable program.
The embodiment also discloses a computer readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the intelligent skip method based on page coding is realized.
In summary, the technical scheme takes the design of the page coding rule and the page jump rule applied by the mobile terminal as the main support, improves the page jump mode based on the stack, and encapsulates the page jump mode based on the page coding rule and the page jump rule to form a set of public methods, and the pages related to each service can realize flexible jump among the pages in a complex service scene only by calling the public methods. The method and the device have the advantages that the stack mode effectively records the user access records, the flexibility of stack mode jumping is improved, page jumping logic is optimized, and development efficiency is improved.
And when the new page is opened, jumping to a target page according to the page code. And when the return button is clicked on different pages, determining the position of the transaction according to the page code, and returning to the target page according to the page jump rule. Different pages can realize the complex logic of multi-scene page skipping only by calling a common skipping method, and the page-by-page independent assignment is not needed to return to the target page. The jump between the pages is rapid and smooth, the page coding rule is clearly designed, and the expandability is high. The page coding table is simple to maintain, and is convenient for counting and positioning page problems. Effectively improve the smoothness degree of user operation, and then promote customer experience.
In the traditional page jump process, when each page returns, the target page returned by the page is appointed to return to the corresponding page. For example: when a user carries out large-amount transfer transaction, the user must pass through an advanced authentication page, at the moment, the specified navigation page can be reached only by returning 4 pages forwards after the page returning method is completed, if the user does not need to carry out the advanced authentication after the small-amount transfer transaction, the specified navigation page can be reached only by returning 3 pages forwards after the page returning method is completed, and under the two conditions, the user needs to make various judgments on the completed page and can return to the specified position. The disadvantages of this solution are: 1. the cost of page development is too high; 2. the judgment logic is too much, and unnecessary defects are easy to occur. According to the page jump method based on the page coding, when a page is returned after a transaction is successful, the page code in the traversal stack is used for finding the navigation page nearest to the stack top, the page is taken out of the stack and the corresponding navigation page is directly returned, developers do not need to consider whether the user enters the transfer success page through large transfer or small transfer but directly position the page to the nearest navigation page, return logics of various scenes added to the success page by the developers are reduced, and unnecessary defects caused by excessive logic branches are avoided.
The invention can realize page jump in complex scenes. In the process of page jump, the position of user operation is judged through the page code carrying the transaction information, the ideal return position of the user is intelligently judged, the complexity of user operation is reduced, and the user experience is improved. Has the following advantages:
1. the jump between the pages is convenient and smooth.
2. And the page development efficiency is improved.
3. The page coding and the skip rule are clear and definite, and the problems can be quickly positioned and counted.
4. The page coding table is simple to maintain and high in expansibility.
At present, the relevance between different transactions of the mobile application is stronger, and the transactions mutually open an entrance, thereby facilitating the operation of a user. The intelligent skipping method based on the page code can accurately return to an ideal page of a user, accords with the operation habit of the user, and greatly improves the experience of the user.
The technical scheme of the invention is successfully applied to the mobile banking system, and the user can feed back the mobile banking experience to be smooth, convenient and quick. By means of the design of page codes and jump rules, developers can quickly locate problems. And modules, functions or pages are added, so that the maintenance is convenient and quick.
Claims (10)
1. An intelligent skip method based on page coding is characterized by comprising the following steps:
s1, setting corresponding page codes for different pages, wherein the page codes comprise 7 bits: the 1 st bit code corresponds to a navigation page or a service page identifier;
the 2 nd to 3 rd bit codes correspond to the service class;
the 4 th bit code corresponds to the service flow program number;
the 5 th bit code corresponds to a business process step;
the 6 th to 7 th bit codes correspond to page serial numbers;
s2, based on the preset page jump rule, combining with the page coding, defaulting the next page to return to the previous page, so as to respectively realize:
jumping between navigation pages;
skipping between pages in the same service;
skipping between the navigation page and the business process page;
skipping among different business process pages;
and skipping between the business process page embedded between the two navigation pages and the two navigation pages.
2. The intelligent skip method based on page coding according to claim 1, wherein the values of the page coding in step S1 are specifically:
the 1 st bit code value is N, corresponding to a navigation page, and the 1 st bit code value is T, corresponding to a service page;
the 2 nd-3 rd bit codes take values as two letters corresponding to the service type name and are used for identifying the service class to which the page belongs;
the 4 th bit code takes values of 0-9 and A-Z, wherein if the page is a navigation page, the 4 th bit code takes values of 0;
the value of the 5 th bit code is A, B, C, D or 0, wherein if the page is a navigation page, the value of the 5 th bit code is 0, and A, B, C or D corresponds to different business process steps;
and the 6 th-7 th bit codes take values of 01-99 and are used for sequencing a plurality of pages in the same service flow step according to the logical relation.
3. The intelligent skip method based on page coding according to claim 2, wherein when the value of the 5 th bit code is a, the relevant page is filled in corresponding to information;
when the value is B, corresponding to the authentication check related page;
when the value is C, confirming the relevant page corresponding to the information;
and when the value is D, corresponding to the result related page.
4. The intelligent skip method based on page coding according to claim 3, wherein in step S2, the specific process of skipping between navigation pages is: the first navigation page jumps to a second navigation page, and after the jump is completed, the first navigation page and the second navigation page are respectively stacked;
and when the second navigation page returns, popping the second navigation page.
5. The intelligent page jump method according to claim 3, wherein in step S2, the specific process of jumping between pages in the same service is as follows: and in the same service class, returning the next page to the previous page by default, and when the relevant page is failed to return, encoding the page in the traversal stack, finding the information filling relevant page closest to the current page, popping up the relevant page, and returning to the information filling relevant page.
6. The intelligent skip method based on page coding according to claim 3, wherein in step S2, the specific process of skipping between the navigation page and the business process page is as follows: and jumping between the navigation page and the business process page, returning the next page to the previous page by default, encoding the page in the traversal stack when the result related page is successfully returned, finding the navigation page nearest to the current page, popping the related page, and returning to the navigation page.
7. The intelligent skip method based on page coding according to claim 3, wherein in step S2, the specific process of skipping between different service pages is: skipping among a plurality of service pages, returning the next page to the previous page by default, encoding the page in the traversal stack when the relevant page is successfully returned, finding the information filling relevant page nearest to the stack bottom, popping up the relevant page, and returning to the information filling relevant page.
8. The intelligent skip method based on page coding according to claim 3, wherein in step S2, the specific process of skipping between the business process page embedded between the two navigation pages and the two navigation pages is: skipping among the first navigation page, the business process page and the second navigation page, returning the next page to the previous page by default, and when the related page successfully enters another navigation page through the result, encoding the page in the traversal stack, finding the navigation page nearest to the top of the stack, popping the related page, and returning to the navigation page.
9. A computer device comprising a communicatively coupled processor and a memory, the memory storing a computer readable program, the processor implementing the intelligent skip method based on page coding according to any one of claims 1 to 8 when executing the computer readable program.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, implements the intelligent skip method based on page coding according to any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110131086.1A CN112799765B (en) | 2021-01-30 | 2021-01-30 | Intelligent skip method and equipment based on page coding and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110131086.1A CN112799765B (en) | 2021-01-30 | 2021-01-30 | Intelligent skip method and equipment based on page coding and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112799765A true CN112799765A (en) | 2021-05-14 |
| CN112799765B CN112799765B (en) | 2022-10-11 |
Family
ID=75813107
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110131086.1A Active CN112799765B (en) | 2021-01-30 | 2021-01-30 | Intelligent skip method and equipment based on page coding and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112799765B (en) |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101783903A (en) * | 2009-12-25 | 2010-07-21 | 北京惠信博思技术有限公司 | Method for returning page of digital television |
| CN106033372A (en) * | 2015-03-19 | 2016-10-19 | 阿里巴巴集团控股有限公司 | Page switching method and apparatus |
| CN106658124A (en) * | 2016-11-10 | 2017-05-10 | 海信电子科技（深圳）有限公司 | Television page return control method and television |
| CN106815276A (en) * | 2015-11-27 | 2017-06-09 | 阿里巴巴集团控股有限公司 | Method for page jump and device |
| WO2017162072A1 (en) * | 2016-03-25 | 2017-09-28 | 阿里巴巴集团控股有限公司 | Method and device for jumping between pages |
| CN108876594A (en) * | 2018-05-30 | 2018-11-23 | 重庆小雨点小额贷款有限公司 | A kind of repayment method, device, terminal and computer-readable medium |
| CN110286942A (en) * | 2019-07-05 | 2019-09-27 | 北京百佑科技有限公司 | A kind of data configuration method, user terminal and readable storage medium storing program for executing showing the page |
| CN110888594A (en) * | 2018-09-11 | 2020-03-17 | 慧荣科技股份有限公司 | Data storage device and check code processing method thereof |
| CN110968824A (en) * | 2018-09-30 | 2020-04-07 | 北京国双科技有限公司 | Page data processing method and device |
| CN111143723A (en) * | 2019-12-26 | 2020-05-12 | 五八同城信息技术有限公司 | Page jump method and device, electronic equipment and storage medium |
| CN111859198A (en) * | 2019-04-29 | 2020-10-30 | 天津五八到家科技有限公司 | Page jump method, page jump system, client device and server device |
-
2021
- 2021-01-30 CN CN202110131086.1A patent/CN112799765B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101783903A (en) * | 2009-12-25 | 2010-07-21 | 北京惠信博思技术有限公司 | Method for returning page of digital television |
| CN106033372A (en) * | 2015-03-19 | 2016-10-19 | 阿里巴巴集团控股有限公司 | Page switching method and apparatus |
| CN106815276A (en) * | 2015-11-27 | 2017-06-09 | 阿里巴巴集团控股有限公司 | Method for page jump and device |
| US20180278671A1 (en) * | 2015-11-27 | 2018-09-27 | Alibaba Group Holding Limited | Page jump method and apparatus |
| WO2017162072A1 (en) * | 2016-03-25 | 2017-09-28 | 阿里巴巴集团控股有限公司 | Method and device for jumping between pages |
| CN106658124A (en) * | 2016-11-10 | 2017-05-10 | 海信电子科技（深圳）有限公司 | Television page return control method and television |
| CN108876594A (en) * | 2018-05-30 | 2018-11-23 | 重庆小雨点小额贷款有限公司 | A kind of repayment method, device, terminal and computer-readable medium |
| CN110888594A (en) * | 2018-09-11 | 2020-03-17 | 慧荣科技股份有限公司 | Data storage device and check code processing method thereof |
| CN110968824A (en) * | 2018-09-30 | 2020-04-07 | 北京国双科技有限公司 | Page data processing method and device |
| CN111859198A (en) * | 2019-04-29 | 2020-10-30 | 天津五八到家科技有限公司 | Page jump method, page jump system, client device and server device |
| CN110286942A (en) * | 2019-07-05 | 2019-09-27 | 北京百佑科技有限公司 | A kind of data configuration method, user terminal and readable storage medium storing program for executing showing the page |
| CN111143723A (en) * | 2019-12-26 | 2020-05-12 | 五八同城信息技术有限公司 | Page jump method and device, electronic equipment and storage medium |
Non-Patent Citations (4)
| Title |
|---|
| HALLE, S ET AL: "《Exhaustive Exploration of Ajax Web Applications With Selective Jumping》", 《7TH IEEE INTERNATIONAL CONFERENCE ON SOFTWARE TESTING, VERIFICATION AND VALIDATION (ICST)》 * |
| 吴庆涛 等: "《ASP.NET2.0的Web页面导航方式比较与选择》", 《电脑知识与技术（学术交流）》 * |
| 张丽: "《Java Web应用详解》", 31 January 2015 * |
| 李洋洋: "《使用程序静态分析技术识别源程序中的用例结构》", 《万方》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112799765B (en) | 2022-10-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US3581072A (en) | Auction market computation system | |
| CN107395353A (en) | A kind of block chain common recognition method and device | |
| CN108492177A (en) | Domestic assets cross-border transaction method, server and storage medium | |
| CN109242672A (en) | Refund information forecasting method, device and the computer readable storage medium of loan | |
| CN109784703A (en) | Business data processing method, device, computer equipment and storage medium | |
| CN110517138A (en) | Intelligent contract processing method, device, computer equipment and storage medium | |
| CN108734457A (en) | A kind of Withdrawing method unified under cash register system | |
| CN110263145A (en) | A kind of electronic contract signature method and electronic contract sign equipment | |
| CN114090544A (en) | Template generation method, data entry template, data entry method and device | |
| CN108830697A (en) | A kind of industry wealth integral system and method | |
| CN107665462A (en) | Method and system for automatically cross-platform executing shareholder voting | |
| CN110111208A (en) | Declaration form data processing method, device, computer equipment and storage medium | |
| CN109816517A (en) | Based on method for processing business, device, computer equipment and the storage medium for increasing letter | |
| CN109034819A (en) | The report method and device of transaction | |
| CN108765106A (en) | A kind of integrated financial affairs receipt generation method of industry wealth | |
| CN108470305A (en) | Connected transaction recognition methods, device and storage medium | |
| CN112799765B (en) | Intelligent skip method and equipment based on page coding and storage medium | |
| CN114445079A (en) | Document processing method, device, equipment and storage medium | |
| CN109146444A (en) | Virtual account creation method and device, account information update method and device | |
| CN107918863A (en) | Preposition processing and collocation method, device and equipment based on financial product | |
| CN106980920A (en) | A kind of execution method and device of Internet service | |
| CN105094758A (en) | Method and device for avoiding transaction rollback | |
| CN111931885B (en) | Method and device for processing product logistics information | |
| CN108765107A (en) | A kind of data save method under industry wealth integration | |
| CN114265633A (en) | Application parameter configuration and query method of self-service equipment, 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |