CN113312118A - Main picture pushing method, device, equipment and computer readable storage medium - Google Patents
Main picture pushing method, device, equipment and computer readable storage medium Download PDFInfo
- Publication number
- CN113312118A CN113312118A CN202110609835.7A CN202110609835A CN113312118A CN 113312118 A CN113312118 A CN 113312118A CN 202110609835 A CN202110609835 A CN 202110609835A CN 113312118 A CN113312118 A CN 113312118A
- Authority
- CN
- China
- Prior art keywords
- main
- graph
- main graph
- identification
- sending
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 130
- 230000008569 process Effects 0.000 claims abstract description 87
- 230000006870 function Effects 0.000 claims description 6
- 238000000151 deposition Methods 0.000 claims description 3
- 230000008447 perception Effects 0.000 abstract 1
- 238000010586 diagram Methods 0.000 description 10
- 230000005540 biological transmission Effects 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 238000012217 deletion Methods 0.000 description 2
- 230000037430 deletion Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
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/448—Execution paradigms, e.g. implementations of programming paradigms
- G06F9/4488—Object-oriented
-
- 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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/26—Government or public services
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Tourism & Hospitality (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Marketing (AREA)
- Human Resources & Organizations (AREA)
- Primary Health Care (AREA)
- Strategic Management (AREA)
- General Health & Medical Sciences (AREA)
- General Business, Economics & Management (AREA)
- Economics (AREA)
- Health & Medical Sciences (AREA)
- Educational Administration (AREA)
- Development Economics (AREA)
- General Engineering & Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application discloses a main graph pushing method, a main graph pushing device, main graph pushing equipment and a computer readable storage medium. And under the condition that the main graph with the first identification exists in the main graph list, sending the main graph with the first identification to the reservation system by using a first main graph pushing process, and sending the main graph with the first identification to the departure system by using a second main graph pushing process. Adopt first host computer propelling movement process and second host computer propelling movement process, need not artifical intervention host computer propelling movement process, consequently, can realize the batch propelling movement of host computer, reduce the time that the user spent in the host computer propelling movement work. Under the condition that a host system is not transformed, the main graph is sent by using the first main graph pushing process and the second main graph pushing process, effective perception that the same main graph is pushed to a seat ordering system and a departure system can be achieved, and effectiveness of main graph pushing is improved.
Description
Technical Field
The present application relates to the field of air transportation, and in particular, to a method, an apparatus, a device, and a computer-readable storage medium for pushing a main map.
Background
In the field of air transportation, a main figure refers to an image for indicating the layout of individual seats, channels, and equipment in an aircraft cabin. After the master graph is created or updated, the controller of the airline company needs to push the newly created master graph or the updated master graph to the host system (including the booking system and the departure system).
At present, a controller usually adopts a manual transmission mode to transmit main graphs to a host system one by one, so that the labor cost is high, and the transmission efficiency of the main graphs is low.
Disclosure of Invention
The applicant found that: the main graph is automatically pushed only by feedback of the host system, and the host system comprises two sets of systems, so that feedback information of the two sets of systems needs to be identified and distinguished, and the host system needs to be greatly changed.
Therefore, how to achieve the effectiveness of main image automatic pushing and reduce the amount of change to the existing host system becomes a problem to be solved urgently at present.
The application provides a main graph pushing method, a main graph pushing device, main graph pushing equipment and a computer readable storage medium, and aims to improve the effectiveness of automatic main graph pushing and reduce the change amount of an existing host system.
In order to achieve the above object, the present application provides the following technical solutions:
a principal graph push method, comprising:
storing a main graph obtained in advance into a preset main graph list, and setting an identifier for the main graph based on the on-off state of a preset automatic push switch; the identification comprises a first identification; the first identification is used for indicating that the main graph is in a state to be pushed;
sending the main graph with the first identification to a reservation system by using a first main graph pushing process under the condition that the main graph with the first identification exists in the main graph list, and sending the main graph with the first identification to a departure system by using a second main graph pushing process;
wherein the first and second principal push processes are both for:
traversing the main graph list according to a preset time period to obtain the main graph with the first identification;
sending the main picture with the first identifier;
under the condition that the main graph with the first identification is determined to be successfully sent, replacing the first identification with a second identification, and sending a prompt that the main graph is successfully pushed; the second identification is used for indicating that the main graph is in a state of being pushed successfully.
Optionally, the identifier further includes a third identifier, where the third identifier is used to indicate that the main graph is in a state without push;
on-off state based on predetermined automatic push switch does the principal graph sets up the sign, include:
setting the first identification for the main graph under the condition that the automatic pushing switch is determined to be in an opening state;
setting the third identifier for the main map in a case where it is determined that the automatic push switch is in an off state.
Optionally, before the sending the main graph with the first identifier to a reservation system using a first main graph pushing process, and sending the main graph with the first identifier to a departure system using a second main graph pushing process, the method further includes:
and in the case of receiving the main graph push instruction, replacing the third identification of the main graph indicated by the main graph push instruction with the first identification.
Optionally, the first identifier is further configured to indicate a preset number of times of push failure;
the sending the primary graph with the first identifier, comprising:
sending the main graph with the first identifier under the condition that the pushing failure times are determined to be smaller than the preset threshold value;
the method further comprises the following steps:
and under the condition that the pushing failure times are not smaller than the preset threshold value, prohibiting sending the main graph with the first identification, and sending a prompt of pushing failure of the main graph.
Optionally, after the sending the main map with the first identifier, the method further includes:
and increasing the pushing failure times by one quantity unit under the condition that the main image with the first identification fails to be sent.
Optionally, the sending the main map with the first identifier includes:
acquiring first timestamps of all main graphs in the main graph list; the first timestamp is used for indicating the time for depositing the main map to the main map list;
and sending the main graph with the first identification in the sequence of the first time stamp from early to late.
Optionally, the sending the main map with the first identifier includes:
obtaining the valid period of all main pictures in the main picture list; the validity period is used for indicating the time when the main graph loses the use function;
and sending the main graph with the first identifier according to the order of the valid period from late to early.
A main picture pushing apparatus comprising:
the management unit is used for storing a main graph acquired in advance into a preset main graph list and setting an identifier for the main graph based on the on-off state of a preset automatic push switch; the identification comprises a first identification; the first identification is used for indicating that the main graph is in a state to be pushed;
a sending unit, configured to send the main graph with the first identifier to a reservation system using a first main graph pushing process and send the main graph with the first identifier to a departure system using a second main graph pushing process, if the main graph with the first identifier exists in the main graph list; wherein the first and second principal push processes are both for: traversing the main graph list according to a preset time period to obtain the main graph with the first identification; sending the main picture with the first identifier; under the condition that the main graph with the first identification is determined to be successfully sent, replacing the first identification with a second identification, and sending a prompt that the main graph is successfully pushed; the second identification is used for indicating that the main graph is in a state of being pushed successfully.
A computer-readable storage medium comprising a stored program, wherein the program executes the main picture push method.
A principal graph pushing apparatus comprising: a processor, a memory, and a bus; the processor and the memory are connected through the bus;
the memory is used for storing a program, and the processor is used for executing the program, wherein the main image pushing method is executed when the program runs.
The application provides a technical scheme, deposit the main map that acquires in advance to predetermined main map list to based on predetermined automatic push switch's on-off state, set up the sign for the main map. The identification comprises a first identification used for indicating that the main graph is in a state to be pushed. And under the condition that the main graph with the first identification exists in the main graph list, sending the main graph with the first identification to the reservation system by using a first main graph pushing process, and sending the main graph with the first identification to the departure system by using a second main graph pushing process. Wherein, first host graph propelling movement process and second host graph propelling movement process all are used for: and traversing the main graph list according to a preset time period to obtain a main graph with the first identification, and sending the main graph with the first identification. And under the condition that the main picture with the first identification is determined to be successfully sent, replacing the first identification with the second identification, and sending a prompt that the main picture is successfully pushed. The second identification is used for indicating that the main graph is in a state of being pushed successfully. Because adopt first host computer propelling movement process and second host computer propelling movement process, possess the host computer system propelling movement host computer of first sign, need not artifical intervention host computer propelling movement process, consequently, can realize the batch propelling movement of host computer, reduce the time that the user spent in the push work of host computer. In addition, under the condition that the host system is not transformed, the main graph is sent to the ordering system by using the first main graph pushing process, and the main graph is sent to the departure system by using the second main graph pushing process, so that the same main graph can be pushed to the ordering system and the departure system effectively, and the pushing effectiveness of the main graph is improved.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
FIG. 1a is a schematic diagram of a main graph pushing method according to an embodiment of the present disclosure;
FIG. 1b is a schematic diagram of a main map creation method according to an embodiment of the present disclosure;
FIG. 1c is a schematic diagram of another main graph pushing method provided in the embodiment of the present application;
FIG. 1d is a schematic diagram of another main graph pushing method provided in the embodiment of the present application;
FIG. 1e is a schematic diagram of another main graph pushing method provided in the embodiment of the present application;
FIG. 2 is a schematic diagram of another main graph pushing method provided in the embodiment of the present application;
fig. 3 is a schematic structural diagram of a main graph pushing device according to an embodiment of the present disclosure.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The flow of this application embodiment, can be applied to SEAT system (being existing SEAT management system in the aviation field), it is specific, can be executed by computing equipment, be used for after the user establishes the main map based on front end interface, perhaps updates the main map, call two sets of independent main map propelling movement processes, with newly-built main map, perhaps the main map after updating, send for ordering SEAT system and departure system respectively, thereby effectively reduce the time that the user spent on main map propelling movement work, and under the condition that does not have artifical intervention propelling movement process, and do not reform transform to main map host system, improve the validity of main map propelling movement.
As shown in fig. 1a, a schematic diagram of a main picture pushing method provided in an embodiment of the present application includes the following steps:
s101: the method comprises the steps of storing a main graph obtained in advance into a preset main graph list, setting a first identification for the main graph under the condition that an automatic push switch is determined to be in an on state, and setting a third identification for the main graph under the condition that the automatic push switch is determined to be in an off state.
The first identifier is used to indicate that the main graph is in a state to be pushed and a preset number of times of push failure, and in this embodiment of the present application, an initial value of the number of times of push failure may be set to 0. The third identification is used for indicating that the main graph is in a state without pushing. The main map acquired in advance comprises the newly-built main map and the updated main map.
Alternatively, in a case where the main pattern deletion instruction is received, the main pattern indicated by the main pattern deletion instruction is deleted from the main pattern list.
It should be noted that, if the automatic push switch is in the off state, it is determined that the user does not currently have an intention to directly send the main graph to the host system, and it is also necessary to wait for the user to send the main graph push instruction (that is, it is determined that the user has an intention to send the main graph to the host system), so that a third identifier is set for the main graph, so as to enrich user experience.
In addition, the new creation process of the main graph comprises the following steps: and receiving a main graph creating message sent by a user based on the front-end interface, and creating the main graph based on the information item used for creating the main graph indicated by the main graph creating message. The information items include, but are not limited to, information such as a sequence of slots, a physical layout, a model number, and a seat locking rule. Specifically, the cabin space sequence is used for numbering the seats in the cabin, the physical layout is used for indicating the actual distribution of the seats in the cabin (for example, the seats are distributed according to 15 rows and 6 columns), the model number is used for indicating the model number of the airliner (for example, boeing 747), and the seat locking rule is used for indicating that the seats with preset numbers are locked (for example, the seats with numbers of N11-N15 are locked).
Specifically, a specific implementation process of the main creation by using the SEAT system can be seen in fig. 1b described below. It should be emphasized that the flow and terminology shown in FIG. 1b are well known to those skilled in the art and will not be described herein.
The updating process of the main map can be as follows: and receiving a main graph updating message sent by a user based on the front-end interface, and updating the preset main graph based on the information item used for updating the main graph and indicated by the main graph updating message.
S102: and under the condition of receiving the main graph push instruction, replacing the third identification of the main graph indicated by the main graph push instruction with the first identification.
S103: and under the condition that the main graph with the first identification exists in the main graph list, sending the main graph with the first identification to the reservation system by using a first main graph pushing process, and sending the main graph with the first identification to the departure system by using a second main graph pushing process.
It should be noted that, both the first main graph pushing process and the second main graph pushing process are independent from each other, and their respective execution processes are not affected by the above S101-S102, that is, both the first main graph pushing process and the second main graph pushing process are not affected by the main graph management process, and only the main graph having the first identifier in the main graph list is pushed.
The first main graph pushing process and the second main graph pushing process are used for executing the following steps:
s104: traversing the main graph list according to a preset time period to obtain the main graph with the first identification, and acquiring first time stamps of all the main graphs in the main graph list.
Wherein the first timestamp is used to indicate a time at which the master graph was deposited to the master graph list.
S105: and judging whether the pushing failure times indicated in the first identification are smaller than a preset threshold value.
If the number of times of push failure indicated in the first identifier is less than the preset threshold, S106 is executed, otherwise S112 is executed.
S106: and sending the main graph with the first identification according to the sequence of the first time stamp from early to late.
After execution of S106, execution continues with S107.
Optionally, the validity periods of all the main graphs in the main graph list may be obtained, and the main graphs with the first identifier may be sent in the order from late to early according to the validity periods. Wherein the expiration date is used to indicate when the use function of the main picture is lost.
S107: and judging whether the main picture with the first identification is successfully sent.
And if a success prompt fed back by the host system is received, determining that the main picture with the first identifier is successfully sent, and executing S108. And if a failure prompt fed back by the host system is received, determining that the main picture with the first identifier fails to be sent, and executing S111.
S108: and acquiring a second timestamp of the main graph with the first identifier, and judging whether the second timestamp is greater than the first timestamp.
If the second timestamp is greater than the first timestamp, S109 is performed, otherwise S110 is performed.
Wherein the second timestamp is indicative of a time at which the master graph was sent to the host system.
S109: and replacing the first identifier with the second identifier, and sending a prompt that the main picture is successfully pushed.
Wherein the second identifier is used for indicating that the main graph is in a state of successful push.
S110: and replacing the first identifier with the third identifier, and sending a prompt that the main picture is successfully pushed.
If the second timestamp is not greater than the first timestamp, it may be determined that the user may have updated the main graph with the first identifier in the process of sending the main graph with the first identifier, and in order to enable the user to continue to push the main graph in a subsequent main graph pushing process, the third identifier is used to replace the first identifier.
S111: the number of push failures in the first identity is increased by one quantity unit.
S112: and prohibiting sending the main picture with the first identifier to the host system, and sending a prompt of failure of pushing the main picture.
In conclusion, the main graph with the first identification is pushed to the host system by the first main graph pushing process and the second main graph pushing process without manual intervention in the main graph pushing process, so that batch pushing of the main graphs can be achieved, and time spent by a user in main graph pushing work is reduced. In addition, under the condition that the host system is not transformed, the main graph is sent to the ordering system by using the first main graph pushing process, and the main graph is sent to the departure system by using the second main graph pushing process, so that the same main graph can be pushed to the ordering system and the departure system effectively, and the pushing effectiveness of the main graph is improved.
It should be emphasized that the main image pushing flow mentioned in the above embodiment can be simplified to fig. 1c described below. Specifically, the main push flow mentioned in the above embodiment can be substantially divided into two modes, namely, an automatic push mode and a manual push mode, according to the on/off state of the automatic push switch. When the automatic push switch is in the off state, the main push process mentioned in the above embodiment can be simplified to fig. 1d below. When the automatic push switch is in the on state, the main push process mentioned in the above embodiment can be simplified to fig. 1e below.
In FIG. 1c, "Master Pushing ICS/DCS" represents sending a Master to the order and departure systems, "Add Master" represents creating a Master, "Modify Master" represents updating a Master, "delete Master" represents deleting a Master, "Master Pushing ICS/DCS service" represents sending a Master Using a first Master push Process and a second Master push Process, "ICS" represents the order system, and "DCS" represents the departure system.
In fig. 1d and 1e, "add main graph" represents to create main graph, "modify main graph" represents to update main graph, "delete main graph" represents to delete main graph, "push main graph" represents to send main graph push instruction, "push state" represents to set third identifier for main graph, "push state" represents to set first identifier for main graph, and set push failure number in first identifier to 0, "push service" represents to send main graph using first main graph push process and second main graph push process, "main graph data" represents main graph, "response message" represents prompt fed back by host system, "push state a" represents that main graph is in state to be pushed, "push state Y" represents that main graph is in state of push success, "failure number" represents push failure number, "ICS" represents seat reservation system, "DCS" stands for departure system and "oracle" stands for database.
It should be noted that, S111 mentioned in the foregoing embodiment is an optional specific expression of the main picture pushing method described in this application. In addition, S112 mentioned in the above embodiments is also an optional specific expression of the main picture pushing method described in this application. For this reason, the steps mentioned in the above embodiments can be summarized as the method shown in fig. 2.
As shown in fig. 2, a schematic diagram of another main picture pushing method provided in the embodiment of the present application includes the following steps:
s201: and storing the main picture acquired in advance into a preset main picture list, and setting an identification for the main picture based on the on-off state of a preset automatic push switch.
The marks comprise a first mark, and the first mark is used for indicating that the main graph is in a state to be pushed.
S202: and under the condition that the main graph with the first identification exists in the main graph list, sending the main graph with the first identification to the reservation system by using a first main graph pushing process, and sending the main graph with the first identification to the departure system by using a second main graph pushing process.
The first main graph pushing process and the second main graph pushing process are used for executing the following steps:
s203: and traversing the main graph list according to a preset time period to obtain the main graph with the first identification.
S204: and sending the main picture with the first identifier.
S205: and under the condition that the main picture with the first identification is determined to be successfully sent, replacing the first identification with the second identification, and sending a prompt that the main picture is successfully pushed.
Wherein the second identifier is used for indicating that the main graph is in a state of successful push.
In conclusion, the main graph with the first identification is pushed to the host system by the first main graph pushing process and the second main graph pushing process without manual intervention in the main graph pushing process, so that batch pushing of the main graphs can be achieved, and time spent by a user in main graph pushing work is reduced. In addition, under the condition that the host system is not transformed, the main graph is sent to the ordering system by using the first main graph pushing process, and the main graph is sent to the departure system by using the second main graph pushing process, so that the same main graph can be pushed to the ordering system and the departure system effectively, and the pushing effectiveness of the main graph is improved.
Corresponding to the main graph pushing method provided by the embodiment, the embodiment of the application also provides a main graph pushing device.
As shown in fig. 3, a schematic structural diagram of a main graph pushing apparatus provided in the embodiment of the present application includes:
the management unit 100 is used for storing the pre-acquired main graph into a preset main graph list, and setting an identifier for the main graph based on the switch state of a preset automatic push switch, wherein the identifier comprises a first identifier and a third identifier, the first identifier is used for indicating that the main graph is in a state to be pushed and a preset push failure time, and the third identifier is used for indicating that the main graph is in a state without being pushed.
Wherein, the management unit 100 sets up the specific process of sign for the main map to be based on the on-off state of predetermined automatic push switch: and under the condition that the automatic push switch is determined to be in the on state, setting a first identifier for the main graph, and under the condition that the automatic push switch is determined to be in the off state, setting a third identifier for the main graph.
The management unit 100 is further configured to, in a case where the main graph push instruction is received, replace the third identifier of the main graph indicated by the main graph push instruction with the first identifier.
The sending unit 200 is configured to send the main graph with the first identifier to the reservation system using a first main graph pushing process and send the main graph with the first identifier to the departure system using a second main graph pushing process, when the main graph list has the main graph with the first identifier. Wherein, first host graph propelling movement process and second host graph propelling movement process all are used for: traversing the main graph list according to a preset time period to obtain a main graph with a first identifier, sending the main graph with the first identifier, replacing the first identifier with a second identifier under the condition that the main graph with the first identifier is determined to be successfully sent, and sending a prompt that the main graph is successfully pushed, wherein the second identifier is used for indicating that the main graph is in a state that the main graph is successfully pushed.
The specific process of sending the main map with the first identifier to the host system by the sending unit 500 is as follows: judging whether the pushing failure times is smaller than a preset threshold value or not, sending the main graph with the first identification to the host system under the condition that the pushing failure times is determined to be smaller than the preset threshold value, forbidding sending the main graph with the first identification to the host system under the condition that the pushing failure times is determined to be not smaller than the preset threshold value, sending a prompt of pushing failure of the main graph, and increasing the pushing failure times by a quantity unit under the condition that the main graph with the first identification is determined to be failed to send.
The specific process of the sending unit 500 sending the main map with the first identifier to the host system is as follows: the main graph list is used for storing the main graphs in the main graph list, and the main graphs with the first marks are sent according to the sequence of the first time stamps from morning to night.
The specific process of the sending unit 500 for sending the main map with the first identifier is as follows: the method comprises the steps of obtaining valid periods of all main graphs in a main graph list, wherein the valid periods are used for indicating the time when the main graphs lose the using function, and sending the main graphs with first marks according to the sequence from late to early of the valid periods.
In conclusion, the main graph with the first identification is pushed to the host system by the first main graph pushing process and the second main graph pushing process without manual intervention in the main graph pushing process, so that batch pushing of the main graphs can be achieved, and time spent by a user in main graph pushing work is reduced. In addition, under the condition that the host system is not transformed, the main graph is sent to the ordering system by using the first main graph pushing process, and the main graph is sent to the departure system by using the second main graph pushing process, so that the same main graph can be pushed to the ordering system and the departure system effectively, and the pushing effectiveness of the main graph is improved.
The present application also provides a computer-readable storage medium including a stored program, wherein the program performs the main graph push method provided in the present application.
The application also provides a main picture pushing equipment, including: a processor, a memory, and a bus. The processor is connected with the memory through a bus, the memory is used for storing programs, and the processor is used for running the programs, wherein when the programs run, the main image pushing method provided by the application is executed, and the main image pushing method comprises the following steps:
storing a main graph obtained in advance into a preset main graph list, and setting an identifier for the main graph based on the on-off state of a preset automatic push switch; the identification comprises a first identification; the first identification is used for indicating that the main graph is in a state to be pushed;
sending the main graph with the first identification to a reservation system by using a first main graph pushing process under the condition that the main graph with the first identification exists in the main graph list, and sending the main graph with the first identification to a departure system by using a second main graph pushing process;
wherein the first and second principal push processes are both for:
traversing the main graph list according to a preset time period to obtain the main graph with the first identification;
sending the main picture with the first identifier;
under the condition that the main graph with the first identification is determined to be successfully sent, replacing the first identification with a second identification, and sending a prompt that the main graph is successfully pushed; the second identification is used for indicating that the main graph is in a state of being pushed successfully.
Optionally, the identifier further includes a third identifier, where the third identifier is used to indicate that the main graph is in a state without push;
on-off state based on predetermined automatic push switch does the principal graph sets up the sign, include:
setting the first identification for the main graph under the condition that the automatic pushing switch is determined to be in an opening state;
setting the third identifier for the main map in a case where it is determined that the automatic push switch is in an off state.
Optionally, before the sending the main graph with the first identifier to a reservation system using a first main graph pushing process, and sending the main graph with the first identifier to a departure system using a second main graph pushing process, the method further includes:
and in the case of receiving the main graph push instruction, replacing the third identification of the main graph indicated by the main graph push instruction with the first identification.
Optionally, the first identifier is further configured to indicate a preset number of times of push failure;
the sending the primary graph with the first identifier, comprising:
sending the main graph with the first identifier to the host system under the condition that the pushing failure times are smaller than the preset threshold value;
the method further comprises the following steps:
and under the condition that the pushing failure times are not smaller than the preset threshold value, prohibiting sending the main graph with the first identification to the host system, and sending a prompt of main graph pushing failure.
Optionally, after the sending the main map with the first identifier to the host system, the method further includes:
and increasing the pushing failure times by one quantity unit under the condition that the main image with the first identification fails to be sent.
Optionally, the sending the main map with the first identifier includes:
acquiring first timestamps of all the main pictures in the main picture list; the first timestamp is used for indicating the time for depositing the main map to the main map list;
and sending the main graph with the first identification in the sequence of the first time stamp from early to late.
Optionally, the sending the main map with the first identifier includes:
obtaining the valid period of all the main pictures in the main picture list; the validity period is used for indicating the time when the main graph loses the use function;
and sending the main graph with the first identifier according to the order of the valid period from late to early.
The functions described in the method of the embodiment of the present application, if implemented in the form of software functional units and sold or used as independent products, may be stored in a storage medium readable by a computing device. Based on such understanding, part of the contribution to the prior art of the embodiments of the present application or part of the technical solution may be embodied in the form of a software product stored in a storage medium and including several instructions for causing a computing device (which may be a personal computer, a server, a mobile computing device or a network device) to execute all or part of the steps of the method described in the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
The embodiments are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same or similar parts among the embodiments are referred to each other.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the application. Thus, the present application is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (10)
1. A main graph pushing method is characterized by comprising the following steps:
storing a main graph obtained in advance into a preset main graph list, and setting an identifier for the main graph based on the on-off state of a preset automatic push switch; the identification comprises a first identification; the first identification is used for indicating that the main graph is in a state to be pushed;
sending the main graph with the first identification to a reservation system by using a first main graph pushing process under the condition that the main graph with the first identification exists in the main graph list, and sending the main graph with the first identification to a departure system by using a second main graph pushing process;
wherein the first and second principal push processes are both for:
traversing the main graph list according to a preset time period to obtain the main graph with the first identification;
sending the main picture with the first identifier;
under the condition that the main graph with the first identification is determined to be successfully sent, replacing the first identification with a second identification, and sending a prompt that the main graph is successfully pushed; the second identification is used for indicating that the main graph is in a state of being pushed successfully.
2. The method of claim 1, wherein said identification further comprises a third identification indicating that said main graph is in a push-free state;
on-off state based on predetermined automatic push switch does the principal graph sets up the sign, include:
setting the first identification for the main graph under the condition that the automatic pushing switch is determined to be in an opening state;
setting the third identifier for the main map in a case where it is determined that the automatic push switch is in an off state.
3. The method of claim 2, wherein prior to sending the primary graph with the first identification to a reservation system using a first primary graph push process, and sending the primary graph with the first identification to a departure system using a second primary graph push process, further comprising:
and in the case of receiving the main graph push instruction, replacing the third identification of the main graph indicated by the main graph push instruction with the first identification.
4. The method of claim 1, wherein the first identifier is further used for indicating a preset number of push failures;
the sending the primary graph with the first identifier, comprising:
sending the main graph with the first identifier under the condition that the pushing failure times are determined to be smaller than the preset threshold value;
the method further comprises the following steps:
and under the condition that the pushing failure times are not smaller than the preset threshold value, prohibiting sending the main graph with the first identification, and sending a prompt of pushing failure of the main graph.
5. The method of claim 4, wherein after said sending said primary map with said first identifier, further comprising:
and increasing the pushing failure times by one quantity unit under the condition that the main image with the first identification fails to be sent.
6. The method of claim 1, wherein said sending said primary graph with said first identifier comprises:
acquiring first timestamps of all main graphs in the main graph list; the first timestamp is used for indicating the time for depositing the main map to the main map list;
and sending the main graph with the first identification in the sequence of the first time stamp from early to late.
7. The method of claim 1, wherein said sending said primary graph with said first identifier comprises:
obtaining the valid period of all main pictures in the main picture list; the validity period is used for indicating the time when the main graph loses the use function;
and sending the main graph with the first identifier according to the order of the valid period from late to early.
8. A main picture pushing device, comprising:
the management unit is used for storing a main graph acquired in advance into a preset main graph list and setting an identifier for the main graph based on the on-off state of a preset automatic push switch; the identification comprises a first identification; the first identification is used for indicating that the main graph is in a state to be pushed;
a sending unit, configured to send the main graph with the first identifier to a reservation system using a first main graph pushing process and send the main graph with the first identifier to a departure system using a second main graph pushing process, if the main graph with the first identifier exists in the main graph list; wherein the first and second principal push processes are both for: traversing the main graph list according to a preset time period to obtain the main graph with the first identification; sending the main picture with the first identifier; under the condition that the main graph with the first identification is determined to be successfully sent, replacing the first identification with a second identification, and sending a prompt that the main graph is successfully pushed; the second identification is used for indicating that the main graph is in a state of being pushed successfully.
9. A computer-readable storage medium characterized in that the computer-readable storage medium includes a stored program, wherein the program executes the main picture push method of any one of claims 1 to 7.
10. A principal graph pushing apparatus, comprising: a processor, a memory, and a bus; the processor and the memory are connected through the bus;
the memory is configured to store a program and the processor is configured to execute the program, wherein the program is configured to execute the main graph push method according to any one of claims 1 to 7 when executed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110609835.7A CN113312118A (en) | 2021-06-01 | 2021-06-01 | Main picture pushing method, device, equipment and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110609835.7A CN113312118A (en) | 2021-06-01 | 2021-06-01 | Main picture pushing method, device, equipment and computer readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113312118A true CN113312118A (en) | 2021-08-27 |
Family
ID=77377035
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110609835.7A Pending CN113312118A (en) | 2021-06-01 | 2021-06-01 | Main picture pushing method, device, equipment and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113312118A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105763431A (en) * | 2016-05-06 | 2016-07-13 | 腾讯科技（深圳）有限公司 | Information pushing method, device and system |
| WO2018153271A1 (en) * | 2017-02-27 | 2018-08-30 | 腾讯科技（深圳）有限公司 | Data push method and apparatus, storage medium, and electronic device |
| CN111045835A (en) * | 2019-10-24 | 2020-04-21 | 京东数字科技控股有限公司 | Information pushing method and device, electronic equipment and storage medium |
| CN111464598A (en) * | 2020-03-19 | 2020-07-28 | 中国人民财产保险股份有限公司 | Data pushing method and device |
| CN111880865A (en) * | 2020-07-30 | 2020-11-03 | 广州华多网络科技有限公司 | Multimedia data pushing method and device, electronic equipment and storage medium |
-
2021
- 2021-06-01 CN CN202110609835.7A patent/CN113312118A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105763431A (en) * | 2016-05-06 | 2016-07-13 | 腾讯科技（深圳）有限公司 | Information pushing method, device and system |
| WO2018153271A1 (en) * | 2017-02-27 | 2018-08-30 | 腾讯科技（深圳）有限公司 | Data push method and apparatus, storage medium, and electronic device |
| CN111045835A (en) * | 2019-10-24 | 2020-04-21 | 京东数字科技控股有限公司 | Information pushing method and device, electronic equipment and storage medium |
| CN111464598A (en) * | 2020-03-19 | 2020-07-28 | 中国人民财产保险股份有限公司 | Data pushing method and device |
| CN111880865A (en) * | 2020-07-30 | 2020-11-03 | 广州华多网络科技有限公司 | Multimedia data pushing method and device, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20070223506A1 (en) | Data broadcast schedule system, and apparatus, method recording medium or program thereabout | |
| CN109873873B (en) | Flight data issuing system, flight changing method and message processing method | |
| US7464293B2 (en) | System and method for automated recovery after an error in a batch processing system caused by malformatted or unsupported data | |
| CN103366022B (en) | Information handling system and disposal route thereof | |
| CN102193991B (en) | OLTP(on-line transaction processing)-based data modifying method and system as well as graphic database server | |
| CN111274052A (en) | Data distribution method, server, and computer-readable storage medium | |
| CN112527489A (en) | Task scheduling method, device and equipment and computer readable storage medium | |
| CN105487931A (en) | Method and device for synchronizing intersystem passenger information in real time | |
| CN104902444A (en) | Dynamic restructuring method and system for cluster system | |
| CN107451176B (en) | Data copying method and device | |
| CN112463882A (en) | Data synchronization method, cloud platform and edge terminal | |
| CN112966846A (en) | Passenger signing and transferring method and device, storage medium and electronic equipment | |
| CN111950984A (en) | Method and device for automatically opening departure check-in machine | |
| US8392534B2 (en) | Device for access to data aboard an aircraft | |
| CN113312118A (en) | Main picture pushing method, device, equipment and computer readable storage medium | |
| CN112201081B (en) | Method and device for generating shift-supplementing flight plan | |
| US20070214142A1 (en) | System and method for providing transaction support across a plurality of data structures | |
| CN106325909A (en) | Method and system for updating multiple images in private cloud system | |
| CN103916437A (en) | File release system, device and method | |
| CN110659272A (en) | Data cleaning method and system | |
| CN107844566B (en) | Dump control method and system | |
| CN103023990A (en) | Image file upgrade system and method in stack system | |
| CN110798349B (en) | Configuration distribution and receiving method, equipment and computer readable storage medium | |
| CN115796565B (en) | Flight group determining method and device, electronic equipment and storage medium | |
| CN110942240B (en) | Information processing method, system, terminal 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 |