Detailed Description
The embodiment of the application provides a visual division method and device for a service index interval and electronic equipment.
In order to make those skilled in the art better understand the technical solutions in the present application, 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 obtained by a person of ordinary skill in the art based on the embodiments in the present application without making any creative effort shall fall within the protection scope of the present application.
Fig. 1 is a flowchart of a visual partitioning method for a service index interval according to an embodiment of the present application. The method of fig. 1 may include:
and S110, displaying a plurality of intervals corresponding to the service indexes according to the entries.
Wherein one entry is used to indicate the range of one interval of the service index.
It should be understood that in the embodiments of the present application, one entry may be represented by two numerical values of a starting point and an ending point. For example, the starting point X1 and the ending point X2, the entry represents the intervals X1 to X2, wherein whether the interval includes endpoint information or not may be customized by the user or predetermined. In particular, when X or more is represented, it can be represented by "X ∞ to +∞"; when X or less is represented, it can be represented by "- ∞toX".
Fig. 2 is a schematic diagram of interval division of a service index according to an embodiment of the present application. In the application scenario of the financial-related service shown in fig. 2, the service may include payment, insurance, loan and financing, or include payment, insurance and loan, or include payment, insurance and financing, or include payment, financing and loan, or be other, and so on. Of course, in addition to the services shown in FIG. 2, the services may include only one or a combination of payments, insurance, loans, financing, and the like. In addition, it should be understood that in other application scenarios, the service may also be other types of services, and the embodiments of the present application are not limited herein. In the embodiment of the present application, the financial related service is taken as an example for illustration.
In the embodiment shown in fig. 2, the index of the business is annual profit, and the index is divided into a plurality of data intervals, such as profit of more than 100 yuan, profit of 51-100 yuan, profit-loss balance, loss of 1-50, loss of 51-100, loss of more than 100 yuan, and the like. Of course, it should be understood that in a specific application, the business index may also be other business indexes, such as monthly average income, monthly maximum income, daily maximum income, and the like.
In the embodiment of the application, the business index of annual profit can be displayed in a visualization mode, and the business index is displayed to the user in the form of an entry, so that the user can perform division adjustment or definition of intervals.
Fig. 3 is a schematic view of a visual partitioning scenario of a business index (annual profit) according to an embodiment of the present application.
Optionally, in some embodiments, step S110 may be implemented as:
and displaying the items corresponding to the intervals from top to bottom according to the initial values of the intervals.
Optionally, the intervals of the service indicators may be displayed from top to bottom in descending order. Such as the annual profit margin indicator shown in fig. 3.
Or, optionally, the intervals of the service indexes may be displayed from top to bottom in descending order of the entries corresponding to the intervals.
Optionally, if the service index does not have a stored interval division result, taking an interval obtained by division based on a preset interval division manner as a plurality of intervals of the service index, and displaying the intervals according to entries.
Or, optionally, if the service index has a stored interval division result, displaying the interval division result stored in the service index according to an entry.
And S120, receiving an adjustment operation on the displayed items.
It should be understood that the adjustment operation of the presented item by the user may include at least one of the following:
an add entry operation;
an operation to delete an entry;
the operation of the entry is modified.
When a user needs to add a new interval to the service index, the operation of adding the entry can be executed, and the starting value and/or the ending value of the newly added entry are/is input.
When a user needs to modify a certain interval of the service index, the operation of modifying the entry can be executed, and the initial value and/or the end value of the modified entry are/is modified.
When the user needs to delete a certain interval of the service index, the operation of deleting the entry can be executed, and the entry is deleted. Of course, it should be understood that after an entry is deleted, the starting and/or ending values of the entries adjacent to the deleted entry may also be adaptively modified. The details are discussed in the following related steps.
And S130, secondarily adjusting the entries related to the overlapped or omitted sections based on the section distribution corresponding to the adjusted entries.
It should be understood that if no overlap occurs and no omission occurs, the interval between two adjacent intervals may be recorded as d, and the value of d may be 0 or a value of a minimum unit of the service index. For example, assuming that the value of a minimum unit of the service index is 1, if d is 1, it can be considered that no overlap and no omission occur between the sections 1 to 50 and 51 to 100, and if d is 0, it can be considered that no overlap and no omission occur between the sections 1 to 50 and 50 to 100.
If in the interval X1-Y1 of item 1 and the interval X2-Y2 of item 2, if X1 > X2 and X1 is less than or equal to Y2+ d, or X1 is less than X2 and X2 is less than or equal to Y1+ d, then item 1 and item 2 are overlapped. Entry 1 and entry 2 are entries that are involved in the overlapping intervals.
If the entry 1 and the entry 2 are two adjacent intervals in all the intervals of the service indicator, X1 > X2 and X1 ≠ Y2+ d, or X1 < X2 and X2 ≠ Y1+ d, it indicates that there is a omission between the two intervals of the entry 1 and the entry 2. Entry 1 and entry 2 are entries that are involved in the interval in which the omission occurs.
In the embodiment of the application, the data interval of the service index is displayed in the form of the entry, and the entry related to the overlapped or omitted interval is secondarily adjusted based on the adjustment of the user on the entry, so that the data interval division result of the service index can be obtained, and the division result of the service index can be efficiently and accurately obtained.
Optionally, the method may further comprise: and obtaining a data interval division result of the service index based on the entry after the secondary adjustment.
Optionally, as shown in fig. 3, step S110 may further include:
and displaying an addition button in a first preset area of two adjacent items, wherein the addition button is used for inserting a new added item between the two adjacent items. The first predetermined area, for example, may be a left portion of a middle line between two adjacent items, as shown in fig. 3. Of course, other positions are not excluded, for example, the right part of the middle line between two adjacent items may be used, and so on.
Further, the method may further comprise:
in response to the clicking operation of the add button, inserting a new added item between two adjacent items corresponding to the add button, wherein the starting value of the new added item is a first numerical value, and/or the ending value of the new added item is a second numerical value, the first numerical value is the ending value + d of the first item of the two adjacent items, the second numerical value is the starting value-d of the second item of the two adjacent items, and the first numerical value is smaller than or equal to the second numerical value,
Wherein d has the meaning as described in step S130.
Optionally, the method further comprises: and displaying a deletion button in a second preset area corresponding to the item, wherein the deletion button is used for deleting the corresponding item. The second preset area may be, for example, the right side of the entry, or the left side of the entry, and so on.
Fig. 4 is a schematic view of a visual partitioning scenario of a business index (annual profit) according to an embodiment of the present application. In fig. 4, a button for a recycle bin flag, which is a delete button for an entry, is placed on the right side of the sections-100 to-50.
Specifically, displaying the delete button in the second preset area corresponding to the entry includes: and when the cursor moves to a second preset area corresponding to the item, displaying a delete button corresponding to the item.
Alternatively, the delete button for the entry may be displayed at all times.
Optionally, in some embodiments, step S120 may be implemented as: receiving a deletion operation on a target entry;
at this time, step S130 may be implemented as: and if the corresponding interval of the target entry is the interval with the minimum value, modifying the end value of the entry corresponding to the interval with the minimum value after the target entry is deleted into the end value of the target entry.
Or, optionally, in some embodiments, step S120 may be implemented as: receiving a deletion operation on a target entry;
at this time, step S130 may be implemented as: and if the corresponding interval of the target entry is the interval with the maximum value, modifying the initial value of the entry corresponding to the interval with the maximum value after the target entry is deleted into the initial value of the target entry.
Or, optionally, in some embodiments, step S120 may be implemented as: receiving a deletion operation on a target item;
at this time, step S130 may be implemented as: if the start value of the target entry is equal to the end value of the first entry and the end value of the target entry is equal to the start value of the second entry, modifying the end value of the first entry to be the start value of the second entry-d or modifying the start value of the second entry to be the end value of the first entry + d;
where d represents the spacing between two adjacent bins where there is no overlap and where there is no omission.
Based on the above-described deletion operation for the entry, the unnecessary entry can be deleted.
Of course, it should be understood that when the delete button is clicked, the delete operation may not be directly issued, but a delete alert may be sent to the user to alert the user whether to confirm the delete. If yes, executing the operation of deleting the entry; and if the answer is cancelled, returning. Fig. 5 is a schematic view of a visual partitioning scenario of a business index (annual profit) according to an embodiment of the present application. As shown in fig. 5, after the delete button corresponding to the entry is clicked, a delete reminder may be sent for the user to confirm.
Of course, it should be understood that step S130 may be determined to be performed after a deletion, modification or addition operation is performed on an entry, or step S130 may be determined to be performed after all adjustment operations on the service index are completed.
For example, in the scenario shown in fig. 4, when the click entry is deleted, step S130 is performed. Of course, before the step S130 is executed, a deletion reminder message may also be popped up as shown in fig. 5.
For another example, in the scenario shown in fig. 6, after the user adds or modifies an item, if the confirmation button on the right side of the item is clicked, step S130 may be performed.
It should be understood that a prompt may also be sent to the user when step S130 is performed. For example, in the application scenario of FIG. 7, a prompt may be sent to the user for an overlap of intervals; for another example, in the application scenario of fig. 8, a prompt for a section omission may be sent to the user. Of course, it is also possible to send out the indications of interval overlap and interval omission at the same time.
Furthermore, it should be understood that the user may directly click the determination button at the lower right corner of the diagrams shown in fig. 2-6 to execute step S130, so as to obtain the interval division result of the service index.
It should be understood that some specific embodiments of performing secondary adjustment on the entry of the service index according to step S130 may be as follows:
Optionally, in some embodiments, S130 may be implemented as:
if the first entry completely overlaps the span of the second entry, one of the first entry and the second entry is deleted.
Fig. 9 is a diagram illustrating a visual partitioning result of a business index (annual profit) according to another embodiment of the present application. As shown in fig. 9, the two entries in the box are identical. At this point, one of the two entries may be deleted.
Optionally, in some embodiments, S130 may be implemented as:
if the first entry and the second entry overlap between the first value and the second value, and a later value of the first entry start value, the first value, the second value, and the first entry end value is greater than an earlier value, the first entry and the second entry are adjusted to:
an entry having a start value that is the start value of the first entry and an end value that is the first value;
entries having a starting value of + d, which is a first value, and an ending value of a second value;
an entry having a starting value of a second value + d and an ending value of the first entry;
where d represents the spacing between two adjacent bins where there is no overlap and where there is no omission.
Alternatively, the first and second entries may be adjusted to:
An entry having a start value of the first entry and an end value of the first value-d;
entries having a start value of a first value and an end value of a second value;
the start value is a second value + d and the end value is an entry of the end value of the first entry.
Where d represents the spacing between two adjacent bins where there is no overlap and where there is no omission.
It is understood, of course, that the first and second values at this point in time are the starting and ending values of the interval for the second entry.
Optionally, in some embodiments, S130 may be implemented as:
if the first entry and the second entry overlap between the first value and the second value, and the latter of the first value, the second value, the first entry end value is greater than the former value, and the first entry start value is equal to the first value, then the first entry and the second entry are adjusted to:
entries having a starting value of a first value and an ending value of a second value;
the start value is the second value + d and the end value is the entry of the end value of the first entry.
Or, if the first entry and the second entry overlap between the first value and the second value, and the latter of the first value, the second value, the first entry end value is greater than the former value, and the first entry start value is equal to the first value, then the first entry and the second entry are adjusted to:
An entry having a start value of a first value and an end value of a second value-d;
the start value is a second value and the end value is an entry of the end value of the first entry.
Optionally, in some embodiments, S130 may be implemented as:
if the first entry and the second entry overlap between the first value and the second value, and the latter of the first entry starting value, the first value, the second value is greater than the former value, and the first entry ending value is equal to the second value, then the first entry and the second entry are adjusted to:
an entry having a start value that is the start value of the first entry and an end value that is the first value;
entries having a starting value of + d, which is a first value, and an ending value of a second value;
where d represents the spacing between two adjacent bins where there is no overlap and where there is no omission.
Or, if the first entry and the second entry overlap between the first value and the second value, and the latter value of the first entry start value, the first value, the second value is greater than the former value, and the first entry end value is equal to the second value, then the first entry and the second entry are adjusted to:
entry-d having a start value that is the start value of the first entry and an end value that is the first value;
Entries having a starting value of a first value and an ending value of a second value;
where d represents the spacing between two adjacent bins where there is no overlap and where there is no omission.
Optionally, in some embodiments, S130 may be implemented as:
if the first entry and the second entry overlap between the first value and the second value, and a later value of the first entry start value, the first value, the second value, and the second entry end value is greater than an earlier value, and the first entry end value is equal to the second value, then the first entry and the second entry are adjusted to:
an entry having a start value that is the start value of the first entry and an end value that is the first value;
entries having a starting value of + d, which is a first value, and an ending value of a second value;
an entry having a starting value of a second value + d and an ending value of a second entry;
where d represents the spacing between two adjacent bins where there is no overlap and where there is no omission.
Or, if the first entry and the second entry overlap between the first value and the second value, and a later value of the first entry start value, the first value, the second value, and the second entry end value is greater than an earlier value, and the first entry end value is equal to the second value, then the first entry and the second entry are adjusted to:
An entry having a start value of the first entry and an end value of the first value-d;
entries having a start value of a first value and an end value of a second value;
an entry having a starting value of a second value + d and an ending value of a second entry;
where d represents the spacing between two adjacent bins where there is no overlap and where there is no omission.
Based on the method executed in S130 in the foregoing embodiment, the situation of overlapping intervals can be solved, and the existence of overlapping intervals in the interval division of the service index is avoided.
Optionally, in some embodiments, S130 may be implemented as:
if the ending value + d of the first entry is smaller than the starting value of the second entry, and the second entry is one of the entries with the starting value not smaller than the starting value of the first entry, the starting value of the third entry is equal to the ending value + d of the first entry, and the ending value of the third entry is equal to the starting value of the second entry;
where d represents the spacing between two adjacent bins where there is no overlap and where there is no omission.
In the embodiments, by adding entries corresponding to the missing intervals, continuity of the service index intervals can be ensured, and missing of the service index intervals is avoided.
It should be understood that after an entry is deleted, the entry may also be modified by means of the embodiments of the present application.
Optionally, the method may further comprise: if the starting value of the target entry is less than or equal to the ending value of the target entry, the target entry is deleted. If the entry starting value is less than or equal to the entry ending value, the entry information is incorrect and can be directly deleted.
The foregoing description has been directed to specific embodiments of this disclosure. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims may be performed in a different order than in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing may also be possible or may be advantageous.
Fig. 10 is a schematic structural diagram of an electronic device according to an embodiment of the present application. Referring to fig. 10, at a hardware level, the electronic device includes a processor, and optionally further includes an internal bus, a network interface, and a memory. The Memory may include a Memory, such as a Random-Access Memory (RAM), and may further include a non-volatile Memory, such as at least 1 disk Memory. Of course, the electronic device may also include hardware required for other services.
The processor, the network interface, and the memory may be connected to each other by an internal bus, which may be an ISA (Industry Standard Architecture) bus, a PCI (Peripheral Component Interconnect) bus, an EISA (Extended Industry Standard Architecture) bus, or the like. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one double-headed arrow is shown in FIG. 10, but this does not indicate only one bus or one type of bus.
And the memory is used for storing programs. In particular, the program may include program code comprising computer operating instructions. The memory may include both memory and non-volatile storage and provides instructions and data to the processor.
The processor reads a corresponding computer program from the nonvolatile memory to the memory and then runs the computer program to form the interval division device of the service index on the logic level. The processor is used for executing the program stored in the memory and is specifically used for executing the following operations:
displaying a plurality of intervals corresponding to the business indexes according to entries, wherein one entry is used for representing the range of one interval of the business indexes;
Receiving an adjustment operation on the displayed items;
and secondarily adjusting the entries related to the overlapped or omitted sections based on the section distribution corresponding to the adjusted entries.
The method performed by the apparatus 1000 for partitioning an interval of a service indicator according to the embodiment shown in fig. 1 of the present application may be applied to a processor, or implemented by a processor. The processor may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the above method may be performed by integrated logic circuits of hardware in a processor or instructions in the form of software. The Processor may be a general-purpose Processor, including a Central Processing Unit (CPU), a Network Processor (NP), and the like; but also Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components. The various methods, steps, and logic blocks disclosed in the embodiments of the present application may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of the method disclosed in connection with the embodiments of the present application may be directly implemented by a hardware decoding processor, or implemented by a combination of hardware and software modules in the decoding processor. The software module may be located in ram, flash memory, rom, prom, or eprom, registers, etc. storage media as is well known in the art. The storage medium is located in a memory, and a processor reads information in the memory and completes the steps of the method in combination with hardware of the processor.
The electronic device may also execute the method in fig. 1 and implement the functions of the service indicator interval dividing apparatus 1000 in the embodiment shown in fig. 1, which are not described herein again in this embodiment of the present application.
Of course, besides the software implementation, the electronic device of the present application does not exclude other implementations, such as a logic device or a combination of software and hardware, and the like, that is, the execution subject of the following processing flow is not limited to each logic unit, and may also be hardware or a logic device.
Embodiments of the present application also provide a computer-readable storage medium storing one or more programs, where the one or more programs include instructions, which when executed by a portable electronic device including a plurality of application programs, enable the portable electronic device to perform the method of the embodiment shown in fig. 1, and are specifically configured to:
displaying a plurality of intervals corresponding to the business indexes according to entries, wherein one entry is used for representing the range of one interval of the business indexes;
receiving an adjustment operation on the displayed items;
and secondarily adjusting the entries related to the overlapped or omitted sections based on the section distribution corresponding to the adjusted entries.
Fig. 11 is a schematic structural diagram of an apparatus 1100 for partitioning an interval of a service index according to an embodiment of the present application. Referring to fig. 11, in a software implementation, an apparatus 1100 for partitioning an interval of a service indicator may include:
the presentation module 1110 is configured to present a plurality of intervals corresponding to the service indicator according to entries, where one entry is used to indicate a range of one interval of the service indicator;
a receiving module 1120, which receives an adjustment operation for the displayed item;
the secondary adjustment module 1130 performs secondary adjustment on the entries related to the overlapped or omitted sections based on the section distribution corresponding to the adjusted entries.
Optionally, the apparatus for dividing an interval of a service index may further include a generating module 1140, which generates a data interval division result of the service index based on the entry after the secondary adjustment.
It should be understood that, in the embodiment of the present application, the apparatus 1100 for dividing the interval of the service indicator may specifically be an application module or an interval defining component, and the embodiment of the present application is not limited herein.
The apparatus 1100 for dividing the service index interval may further perform the method according to the embodiment shown in fig. 1, and the specific implementation may refer to the embodiment shown in fig. 1.
In short, the above description is only a preferred embodiment of the present application, and is not intended to limit the scope of the present application. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the present application shall be included in the protection scope of the present application.
The systems, devices, modules or units illustrated in the above embodiments may be implemented by a computer chip or an entity, or by a product with certain functions. One typical implementation device is a computer. In particular, the computer may be, for example, a personal computer, a laptop computer, a cellular telephone, a camera phone, a smartphone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the system embodiment, since it is substantially similar to the method embodiment, the description is simple, and for the relevant points, reference may be made to the partial description of the method embodiment.