Information searching method, device, equipment and storage medium

文档序号：134974 发布日期：2021-10-22 浏览：40次中文

阅读说明：本技术 一种信息查找方法、装置、设备及存储介质 (Information searching method, device, equipment and storage medium ) 是由周昊楠陈逸飏李慧妍陈凌峰陆秉君杨星于 2021-07-23 设计创作，主要内容包括：本发明实施例公开了一种信息查找方法、装置、设备及存储介质。该方法包括：在检测到信息查找事件时,获取与信息查找事件对应的待查找信息所在的显示查找表贴图、及待查找信息在显示查找表贴图中的待查找标识,其中,待查找标识是显示查找表贴图中存储的各信息标识中的一个；确定信息标识在显示查找表贴图中的标识存储位置,并判断标识存储位置下的信息标识是否为待查找标识；将显示查找表贴图中存储的与待查找标识一致的信息标识对应的信息作为待查找信息。本发明实施例的技术方案,可以提高待查找信息的查找速度。(The embodiment of the invention discloses an information searching method, an information searching device, information searching equipment and a storage medium. The method comprises the following steps: when an information searching event is detected, acquiring a display searching table map where to-be-searched information corresponding to the information searching event is located and an to-be-searched identifier of the to-be-searched information in the display searching table map, wherein the to-be-searched identifier is one of information identifiers stored in the display searching table map; determining an identifier storage position of the information identifier in the display lookup table map, and judging whether the information identifier under the identifier storage position is the identifier to be searched; and taking the information corresponding to the information identifier which is stored in the display lookup table map and is consistent with the identifier to be searched as the information to be searched. The technical scheme of the embodiment of the invention can improve the searching speed of the information to be searched.)

1. An information search method, comprising:

when an information search event is detected, acquiring a display lookup table map where to-be-searched information corresponding to the information search event is located and a to-be-searched identifier of the to-be-searched information in the display lookup table map, wherein the to-be-searched identifier is one of information identifiers stored in the display lookup table map;

determining an identifier storage position of the information identifier in the display lookup table map, and judging whether the information identifier in the identifier storage position is the identifier to be searched;

And taking the information corresponding to the information identifier which is stored in the display lookup table map and is consistent with the identifier to be searched as the information to be searched.

2. The method according to claim 1, wherein the identifier storage location of each information identifier is respectively adjacent to an information storage location of information corresponding to the information identifier in the display lookup table map, and the using information corresponding to the information identifier stored in the display lookup table map and corresponding to the identifier to be searched as the information to be searched comprises:

determining a target storage position of the information identifier consistent with the identifier to be searched in the display lookup table map from each identifier storage position;

and acquiring preset adjacent relations between each identification storage position and each information storage position, determining adjacent storage positions adjacent to the target storage position in each information storage position according to the adjacent relations, and taking the information stored in the adjacent storage positions in the display lookup table map as the information to be searched.

3. The method according to claim 2, wherein for each of the identification storage locations, the adjacent relationship is an adjacent direction of the information storage location adjacent to the identification storage location relative to the identification storage location, and the information to be searched occupies a preset number of the information storage locations in the display look-up table map; accordingly, the method can be used for solving the problems that,

Determining an adjacent storage location adjacent to the target storage location in each of the information storage locations according to the adjacent relationship, including:

determining, from each of the information storage locations, an immediate storage location that is located in the adjacent direction of and immediately adjacent to the target storage location;

the preset number of the information storage locations that are consecutive in the adjacent direction from the immediate storage location are taken as adjacent storage locations adjacent to the target storage location.

4. The method according to claim 1, wherein the determining whether the information identifier in the identifier storage location is the identifier to be searched comprises:

acquiring a current storage position in each identification storage position, and judging whether the information identification in the current storage position is the identification to be searched;

if not, updating the next identifier storage position of the current storage position to be the current storage position, and repeatedly executing the step of judging whether the information identifier in the current storage position is the identifier to be searched until the information identifier consistent with the identifier to be searched is searched.

5. The method of claim 1, further comprising:

respectively acquiring preset expected search probabilities of the information corresponding to each information identifier, and sequencing the expected search probabilities;

for each current identifier in the information identifiers, determining the data storage positions of the current identifier and the information corresponding to the current identifier in the display lookup table map to be constructed according to the sorting position of the expected search probability of the current identifier in a sorting result;

and storing the current identification and the information corresponding to the current identification according to the data storage position, and constructing the display lookup table map.

6. The method of claim 1, wherein the information to be searched comprises at least two parent information to be searched, and each parent information to be searched comprises at least two child information to be searched;

the display lookup table map comprises at least two groups of color channels, each group of color channels comprises four color channels, and each color channel comprises a red channel, a green channel, a blue channel and a transparent channel;

the display lookup table map is constructed in advance by the following steps:

Acquiring a display lookup table map to be constructed;

for each parent information to be searched in the information to be searched, determining a target identifier corresponding to the information to be searched in each information identifier, and extracting target child information from each child information to be searched in the parent information to be searched;

and sequentially storing the target identification and all the target sub-information under the information to be searched in each color channel in the display lookup table map according to a definition rule to obtain the constructed display lookup table map.

7. The method according to claim 6, wherein the sequentially storing the target identifier and all the target sub-information under the information to be searched in each color channel in the display look-up table map according to a definition rule comprises:

acquiring the information quantity of all the target sub-information under the information to be searched, wherein each target sub-information occupies one color channel in the display lookup table map;

the definition rule comprises that the target identification is in front of the target sub information, the target identification is stored in a first channel of the color channels of the display lookup table map, and the target sub information is sequentially stored in the color channels with the information quantity under the first channel;

Or, the definition rule includes that the target sub information is before and the target identifier is after, and the target sub information is sequentially stored in the second channel of the information quantity in each color channel of the display lookup table map, and the target identifier is stored in the next color channel of the last color channel in each second channel.

8. An information lookup apparatus, comprising:

the device comprises an identifier acquisition module and a searching module, wherein the identifier acquisition module is used for acquiring a display lookup table map where to-be-searched information corresponding to an information searching event is located and an identifier to be searched of the to-be-searched information in the display lookup table map when the information searching event is detected, wherein the identifier to be searched is one of information identifiers stored in the display lookup table map;

the identification judging module is used for determining an identification storage position of the information identification in the display lookup table mapping and judging whether the information identification in the identification storage position is the identification to be searched;

and the information searching module is used for taking the information corresponding to the information identifier which is stored in the display lookup table map and is consistent with the identifier to be searched as the information to be searched.

9. An information lookup apparatus, comprising:

one or more processors;

a memory for storing one or more programs;

when executed by the one or more processors, cause the one or more processors to implement the information lookup method as claimed in any one of claims 1-7.

10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the information lookup method according to any one of claims 1 to 7.

Technical Field

The embodiment of the invention relates to the field of computer application, in particular to an information searching method, device, equipment and storage medium.

Background

In the development process of many Application programs (APPs), interface development is involved, and taking color development in the development process of an interface as an example, a computer needs to search corresponding color information in a color storage area according to color setting of an artist and render a color corresponding to the color information.

In the process of implementing the invention, the inventor finds that the following technical problems exist in the prior art: because the information quantity is huge, the information searching speed of the existing information searching scheme is low.

Disclosure of Invention

The embodiment of the invention provides an information searching method, an information searching device, information searching equipment and a storage medium, and solves the problem of low information searching speed.

In a first aspect, an embodiment of the present invention provides an information searching method, which may include:

when an information searching event is detected, acquiring a display searching table map where to-be-searched information corresponding to the information searching event is located and an to-be-searched identifier of the to-be-searched information in the display searching table map, wherein the to-be-searched identifier is one of information identifiers stored in the display searching table map;

determining an identifier storage position of the information identifier in the display lookup table map, and judging whether the information identifier under the identifier storage position is the identifier to be searched;

and taking the information corresponding to the information identifier which is stored in the display lookup table map and is consistent with the identifier to be searched as the information to be searched.

In a second aspect, an embodiment of the present invention further provides an information searching apparatus, which may include:

The device comprises an identifier acquisition module, a display lookup table map and an identifier to be searched, wherein the identifier acquisition module is used for acquiring the display lookup table map where the information to be searched corresponding to the information search event is located and the identifier to be searched of the information to be searched in the display lookup table map when the information search event is detected, and the identifier to be searched is one of the information identifiers stored in the display lookup table map;

the identification judgment module is used for determining the identification storage position of the information identification in the display lookup table mapping and judging whether the information identification in the identification storage position is the identification to be searched;

In a third aspect, an embodiment of the present invention further provides an information search device, where the information search device may include:

one or more processors;

a memory for storing one or more programs;

when the one or more programs are executed by the one or more processors, the one or more processors implement the information lookup method provided by any embodiment of the invention.

In a fourth aspect, an embodiment of the present invention further provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the information searching method provided in any embodiment of the present invention.

According to the technical scheme of the embodiment of the invention, on the basis that a group of information and an information identifier for identifying the group of information are stored in the LUT map, when an information search event is detected, the LUT map where the information to be searched corresponding to the information search event is located and the identifier to be searched of the information to be searched in the LUT map can be obtained, and at the moment, only which one of the information identifiers to be searched is can be determined, but the identifier to be searched is not stored in which identifier storage position in the LUT map; furthermore, the identifier storage positions of the information identifiers in the LUT map are determined, and then the identifiers to be searched are found from the information identifiers stored in the identifier storage positions, namely, the information identifiers stored in the identifier storage positions can be loaded firstly, then the identifiers to be searched are found from the loaded information identifiers, and at the moment, the identifier to be searched can be determined to be stored in the identifier storage positions in the LUT map; therefore, the information corresponding to the information identifier which is stored in the LUT map and is consistent with the identifier to be searched can be used as the information to be searched, that is, the information stored in the LUT map at the position corresponding to the identifier storage position for storing the identifier to be searched is used as the information to be searched. According to the technical scheme, a group of information and the information identification used for identifying the group of information are stored in the LUT map, and the number of the information identification is limited relative to the huge number of information, so that all the information identifications stored in the LUT map can be loaded in the process of information searching, then the identification to be searched is searched from the loaded information identifications, and then the corresponding information to be searched is searched in the LUT map according to the identification to be searched, so that the effect of improving the searching speed of the information to be searched is achieved by reducing the searching times.

Drawings

Fig. 1 is a flowchart of an information searching method according to a first embodiment of the present invention;

FIG. 2 is a flowchart of an information searching method according to a second embodiment of the present invention;

fig. 3 is a flowchart of an information searching method in the third embodiment of the present invention;

fig. 4 is a flowchart of an information searching method in the fourth embodiment of the present invention;

fig. 5a is a first schematic diagram of an alternative example of an information search method in a fourth embodiment of the present invention;

fig. 5b is a second schematic diagram of an alternative example of an information searching method in the fourth embodiment of the present invention;

fig. 5c is a system structure diagram of an alternative example in an information searching method in the fourth embodiment of the present invention;

fig. 6 is a block diagram of an information search apparatus according to a fifth embodiment of the present invention;

fig. 7 is a schematic structural diagram of an information search apparatus in a sixth embodiment of the present invention.

Detailed Description

The present invention will be described in further detail with reference to the accompanying drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the invention and are not limiting of the invention. It should be further noted that, for the convenience of description, only some of the structures related to the present invention are shown in the drawings, not all of the structures.

Before the embodiment of the present invention is described, an application scenario of the embodiment of the present invention is exemplarily described: taking color development in the interface development process as an example, the computer needs to store various color information in the color storage area in advance, and then the computer can search corresponding color information in the color storage area according to the color setting of the art personnel, wherein the color storage area can be the attribute of the vertex of each object in a certain interface, for example, the color information of a square leaf is stored in the attributes of four vertices of the leaf; the method can also be used for generating a map similar to a mask, the positions of all vertexes in the map are in one-to-one correspondence with the positions of all vertexes of objects in an interface, the model of the leaves is stored in the map, the color information of the map is the color information of the leaves, namely the appearance of the map is completely consistent with the appearance of the leaves, when the map is attached to the leaves, the computer can search the color information in the attributes of all vertexes from the map, and then the searched color information is stored in the attributes of the corresponding vertexes of the leaves.

It should be noted that, in practical applications, taking the leaves in the interface as an example, the color information related to various leaves in one interface may be only a few, and if the color information of each leaf is written to a corresponding vertex or a map, when a certain color information is changed, the vertex or the map related to the color information needs to be changed one by one, which is tedious to operate. Moreover, when searching for color information from the color storage area, the CPU reads data from the color storage area, and the data reading speed is slow, which directly affects the searching speed of color information.

In order to solve the above problems, the inventors have proposed to apply a Look-Up-Table (LUT) map originally applied to a filter to a color information storage, while fully studying various prior arts. Specifically, in the original LUT mapping, the pixel value of each pixel in one picture is subjected to a preset transformation, such as contrast adjustment, gray level enhancement, and the like, to obtain another pixel value corresponding to the pixel value, so as to obtain a filtered picture corresponding to the picture. The LUT map is a picture in appearance, which is essentially an Excel table. When the LUT map is applied to color information storage, the leaf is taken as an example here, and various color information of the leaf can be respectively stored in one LUT map, so that when a certain color information is modified, the LUT map corresponding to the color information can be directly modified, namely, the modification of one color information can be completed by one operation, and the operation convenience is high; in addition, for the color storage area such as LUT mapping, data is read from the color storage area based on the GPU, and compared with a reading mode of a CPU, the data reading speed is higher, so that the searching speed of color information is improved.

On this basis, optionally, continuing with the color information in the above as an example, one LUT map may be understood as one profile, each LUT map has its own file name, and an index table (index) of the system may record in what profile the color information of the first kind is stored in, so that when the color information of the nth kind needs to be searched, the computer may determine from the index in which profile the color information of the nth kind is stored, and then read the color information from the profile. However, since the difficulty of searching for a file name by a computer is much greater than the difficulty of searching for data in a certain LUT map, various color information of leaves can be stored in one LUT map, and even color information of various objects such as leaves, streets, sky, etc. can be stored in one LUT map, and at this time, an index can record where the first color information is stored in the LUT map.

On the basis, in order to find a certain color information from the LUT map storing a plurality of color information, all the color information in the LUT map may be loaded once, and then each color information may be identified from front to back based on the index until the required color information is found. However, the above scheme still has a problem of low color information search speed due to the large amount of color information.

Example one

Fig. 1 is a flowchart of an information searching method according to an embodiment of the present invention. The embodiment is applicable to the case of searching information, in particular to the case of searching information through each information identifier stored in the LUT map. The method can be executed by the information searching device provided by the embodiment of the invention, the device can be realized by software and/or hardware, the device can be integrated on information searching equipment, and the equipment can be various user terminals or servers.

Referring to fig. 1, the method of the embodiment of the present invention specifically includes the following steps:

s110, when an information searching event is detected, obtaining a display searching table map where to-be-searched information corresponding to the information searching event is located and to-be-searched identification of the to-be-searched information in the display searching table map, wherein the to-be-searched identification is one of all information identifications stored in the display searching table map.

The information search event may be an event actively triggered by a user or automatically triggered at a preset time by the information search device for implementing information search, the information to be searched may be one, two or more pieces of information to be searched corresponding to the information search event, and the information may be various types of information, such as color information, fixed point information, and the like, which is not specifically limited herein. The display look-up table map may be a LUT map in which the information to be looked up is located, that is, the LUT map in which the information to be looked up is stored. Because one, two or more LUT maps may be stored in the computer, when an information search event is detected, the LUT map in which the information to be searched corresponding to the information search event is stored may be obtained first, so that the information to be searched can be searched from the LUT map in the following.

It should be noted that, in addition to storing the information to be searched, the LUT map may also store a to-be-searched identifier corresponding to the information to be searched, where the to-be-searched identifier may be one of the information identifiers stored in the LUT map, and the information identifier may be a symbol used for identifying a group of information including at least one information stored in the LUT map, and may identify what the group of information is. In practical applications, the information identifier may be represented by various ways, such as an arabic numeral (i.e., a number), an english letter, a punctuation mark, and the like, which is not specifically limited herein. The advantage of setting information identifiers in the LUT map is that one information identifier may correspond to a group of information, i.e., the number of information identifiers is limited relative to a large number of information identifiers, so that subsequently, all the information identifiers in the LUT map may be loaded at one time, and then the identifier to be searched is searched from the information identifiers, and then the corresponding information to be searched is searched in the LUT map according to the identifier to be searched, thereby increasing the speed of searching the information to be searched.

S120, determining the identifier storage position of the information identifier in the display lookup table map, and judging whether the information identifier in the identifier storage position is the identifier to be searched.

In practical application, optionally, which positions in one LUT map are the identification storage positions can be determined by the information identification storage rule stored in the definition module, for example, the position information of each identification storage position can be directly set in the information identification storage rule, or the setting rule of each identification storage position can be set, for example, what position the 1 st identification storage position is located in the LUT map and several positions are spaced between two adjacent identification storage positions, so that the position information of any identification storage position can be calculated, and the like, which is not specifically limited herein. In addition, the definition module may further store a predefined information storage rule for determining where the information corresponding to the information identifier is stored in the LUT map, and the like, which are not specifically limited herein. After determining each identifier storage location, the information identifiers stored in each identifier storage location may be loaded, and then the identifier to be searched is searched from the loaded information identifiers, that is, the identifier to be searched may be searched by determining whether the information identifier stored in each identifier storage location is the identifier to be searched.

In practical application, optionally, the process of searching for the identifier to be searched may have multiple implementation manners, such as sequentially reading each information identifier from front to back or from back to front according to the identifier storage location of each information identifier in the LUT map, randomly reading each information identifier sequentially or simultaneously, and the like; for another example, in the reading process of the information identifier, all the information identifiers may be read first, and then the identifier to be searched is found from each information identifier based on the reading result, or it is determined whether the read information identifier is the identifier to be searched in the process of sequentially reading each information identifier, and then the reading of the remaining unread information identifiers is stopped after the identifier to be searched is read, and so on.

For example, the determining whether the information identifier in the identifier storage location is the identifier to be searched may include: acquiring a current storage position in each identification storage position, and judging whether an information identification in the current storage position is an identification to be searched; if not, updating the next identifier storage position of the current storage position to the current storage position, and repeatedly executing the step of judging whether the information identifier in the current storage position is the identifier to be searched until the information identifier consistent with the identifier to be searched is searched. The current storage position can be an identification storage position to be subjected to information identification judgment in each identification storage position, and if the information identification stored in the current storage position is the identification to be searched, the identification to be searched is searched; otherwise, the next identifier storage location of the current storage location may be used as the current storage location, and then it is determined again whether the information identifier stored in the current storage location is the identifier to be searched, and so on. According to the technical scheme, whether the information identifier at the identifier storage position is the identifier to be searched can be sequentially judged from front to back, and the judgment is stopped after the identifier to be searched is searched, so that the effect of quickly searching the identifier to be searched is achieved.

S130, the information corresponding to the information identifier which is stored in the display lookup table map and is consistent with the identifier to be searched is used as the information to be searched.

As described above, at least one set of information may be stored in the LUT map, and the information corresponding to the identifier to be searched is the information to be searched. On this basis, optionally, for each information identifier, a position relationship between a storage location of the information identifier in the LUT map (i.e., an identifier storage location) and a storage location of information corresponding to the information identifier in the LUT map (i.e., an information storage location) may be stored in the definition module in advance, so that the position relationship may be obtained from the definition module, and then the information storage location of the information to be searched corresponding to the identifier to be searched in the LUT map is determined by combining the identifier storage location of the identifier to be searched, and then the information to be searched is read from the information storage locations, that is, the information stored in the information storage locations is the information to be searched corresponding to the identifier to be searched. In practical applications, optionally, the above-mentioned position relationship may be an adjacent relationship, such as that the information identifier is in front of, behind, to the left of, or to the right of the corresponding information, or a non-adjacent relationship, such as that all the information identifiers are continuously stored together and all the information identifiers are continuously stored together, at this time, the two identifiers may be stored in different storage areas in the same LUT map, or may be stored in different LUT maps, which is not specifically limited herein.

Example two

Fig. 2 is a flowchart of an information searching method according to a second embodiment of the present invention. The present embodiment is optimized based on the above technical solutions. In this embodiment, optionally, the identifier storage location of each information identifier is respectively adjacent to the information storage location of the information corresponding to the information identifier in the display lookup table map, and taking the information corresponding to the information identifier which is stored in the display lookup table map and is consistent with the identifier to be searched as the information to be searched, which may include: determining a target storage position of an information identifier consistent with the identifier to be searched in the display lookup table map from each identifier storage position; and acquiring preset adjacent relations between each identification storage position and each information storage position, determining adjacent storage positions adjacent to the target storage position in each information storage position according to the adjacent relations, and taking the information stored in the adjacent storage positions in the display lookup table map as the information to be searched. The same or corresponding terms as those in the above embodiments are not explained in detail herein.

Referring to fig. 2, the method of the present embodiment may specifically include the following steps:

s210, when an information search event is detected, acquiring a displayed lookup table map where to-be-searched information corresponding to the information search event is located and an to-be-searched identifier of the to-be-searched information in the displayed lookup table map, wherein the to-be-searched identifier is one of the information identifiers stored in the displayed lookup table map.

S220, determining the identifier storage position of the information identifier in the display lookup table map, and judging whether the information identifier in the identifier storage position is the identifier to be searched.

And S230, respectively enabling the identifier storage position of each information identifier to be adjacent to the information storage position of the information corresponding to the information identifier in the displayed lookup table map, and determining the target storage position of the information identifier which is consistent with the identifier to be searched in the displayed lookup table map from each identifier storage position.

The identifier storage location may be a location in the LUT map for storing the information identifier, and the information storage location may be a location in the LUT map for storing information, and for each information identifier, the identifier storage location where the information identifier is located and the information storage location where the information corresponding to the information identifier is located may be adjacent in space, for example, the identifier storage location may be located in front of, behind, to the left of, or to the right of the information storage location, and so on. Of course, if the information corresponding to the information identifier is a group of information, the information storage locations of the group of information may be considered as a whole, i.e., the identifier storage location may be in front of, behind, to the left of, to the right of, etc. the whole.

In practical application, optionally, all the information identifiers in the LUT map may be loaded first, and then the identifier to be searched is searched from the loaded information identifiers, so that the identifier storage location where the identifier to be searched is located is used as the target storage location.

S240, acquiring preset adjacent relations between each identification storage position and each information storage position, determining adjacent storage positions adjacent to the target storage position in each information storage position according to the adjacent relations, and taking information stored in the adjacent storage positions in the display lookup table map as information to be searched.

Wherein, the identification storage position and the information storage position with corresponding relation (namely the position of the information identification and the information with corresponding relation) are adjacent in space, the identification storage position and the information storage position without corresponding relation are not adjacent in space, and whether a certain identification storage location and a certain information storage location are spatially adjacent has been previously set, therefore, the preset adjacent relation between each mark storage position and each information storage position can be obtained firstly, the adjacent relation may be adjacent in space or not adjacent in space, and then the adjacent storage position adjacent to the target storage position in each information storage position is determined according to the adjacent relation, i.e. the neighboring storage locations may be information storage locations spatially neighboring the target storage location, information stored in adjacent memory locations in the LUT map can thus be used as information to be looked up.

According to the technical scheme of the embodiment of the invention, the identifier storage position where the information identifier with the corresponding relation is located is adjacent to the information storage position where the information is located in space, the target storage position of the information identifier which is consistent with the identifier to be searched in the LUT map can be determined from each identifier storage position, then the adjacent storage position which is adjacent to the target storage position is determined from each information storage position according to the preset adjacent relation between each identifier storage position and each information storage position, and the information stored in the adjacent storage position in the LUT map is used as the information to be searched, so that the effect of quickly searching the information to be searched is achieved through the position relation between the information identifier and the information.

According to an optional technical scheme, aiming at each identification storage position, the adjacent relation comprises the adjacent direction of an information storage position adjacent to the identification storage position relative to the identification storage position, and the information to be searched occupies a preset number of information storage positions in a display lookup table map; determining an adjacent storage location adjacent to the target storage location in the information storage locations according to the adjacent relationship may include: determining, from the information storage locations, an immediately adjacent storage location that is located in a direction adjacent to and immediately adjacent to the target storage location; a preset number of consecutive information storage locations in the adjacent direction from the immediate storage location is taken as an adjacent storage location adjacent to the target storage location. Since the information corresponding to an information identifier may be a group of information including at least one information, and the number of information storage locations occupied by each information in the LUT map may be one, two, or more, at this time, the information storage locations where the group of information is located may be considered as a whole, and then the information storage location spatially adjacent to an identifier storage location may be located in an adjacent direction of the identifier storage location, such as above, below, left, or right, and so on; on this basis, considering that the number of information storage locations occupied by each group of information in the LUT map (referred to herein as a preset number because it is a preset number) may be one, two or more, for each information storage location and identification storage location having a corresponding relationship, which means that some information storage locations are spatially immediately adjacent to the identification storage location (i.e., adjacent to each other without any spatial pattern therebetween), and some information storage locations are spatially adjacent to the identification storage location (i.e., adjacent to each other with at least one spatial pattern therebetween), it is possible to first determine, from each information storage location, an immediately adjacent storage location that is located in an adjacent direction to the target storage location and immediately adjacent to the target storage location, and then to take, as adjacent storage locations adjacent to the target storage location, a preset number of spatially consecutive information storage locations in the adjacent direction from the immediately adjacent storage location, this achieves the effect of a fast determination of adjacent memory locations.

EXAMPLE III

Fig. 3 is a flowchart of an information searching method provided in the third embodiment of the present invention. The present embodiment is optimized based on the above technical solutions. In this embodiment, optionally, the information searching method may further include: respectively acquiring preset expected search probabilities of the information corresponding to each information identifier, and sequencing the expected search probabilities; aiming at each current mark in each information mark, determining the data storage position of the current mark and the information corresponding to the current mark in a display lookup table map to be constructed according to the ranking position of the expected lookup probability of the current mark in a ranking result; and storing the current identification and the information corresponding to the current identification according to the data storage position, and constructing a display lookup table map. The same or corresponding terms as those in the above embodiments are not explained in detail herein.

Referring to fig. 3, the method of this embodiment may specifically include the following steps:

s310, preset expected searching probabilities of the information corresponding to each information identification are respectively obtained, and the expected searching probabilities are sequenced.

For each information identifier, the expected search probability of the information corresponding to the information identifier may be a search probability expected in advance that the information may appear during information search, which may be embodied in one information search process, and the information is the probability of the information to be searched. The expected search probabilities are sorted, and the sorting manner may be sorting from large to small, or sorting from small to large, which is not specifically limited herein. It should be noted that the expected search probability may be a preset value according to the actual requirement, and it is matched with the subsequent steps, thereby achieving the effect of constructing the LUT map corresponding to the actual requirement.

S320, aiming at each current mark in the information marks, determining the data storage positions of the current mark and the information corresponding to the current mark in the display lookup table mapping to be constructed according to the sorting position of the expected searching probability of the current mark in the sorting result.

The current identifier may be one of the information identifiers, and the expected search probability corresponding to the current identifier may be embodied in that, in one information search process, the information corresponding to the current identifier is the information to be searched, or the probability that the current identifier is the identifier to be searched. On the basis of the information to be searched, in order to further improve the searching speed of the information to be searched, the information identifier which is more likely to be used as the identifier to be searched can be stored in the identifier storage position at the front of the comparison of the LUT maps, and the information identifier which is less likely to be used as the identifier to be searched can be stored in the identifier storage position at the back of the comparison of the LUT maps. Therefore, for each current identifier, the rank position of the expected search probability of the current identifier in the ranking result can be used to determine the probability that the current identifier is used as the identifier to be searched in each information identifier, and then the data storage position of the current identifier and the information corresponding to the current identifier in the LUT to be constructed is determined. In practical applications, optionally, in addition to the sorting locations, the data storage locations may be determined jointly by combining how many information storage locations (i.e., the preset number set forth above) are occupied by each group of information in the LUT, and the arrangement manner between the groups of information, for example, assuming that the preset number is 15, the information identifiers occupy 1 identifier storage location in the LUT, and the arrangement manner is sequential arrangement, when sorting is performed in a large-to-small manner, the current identifier and information corresponding to the expected search probability sorted at the nth bit may be stored at positions from 16 (N-1) +1 to 16 × N in the LUT. Optionally, the data storage locations may include an identifier storage location of the current identifier in the LUT to be constructed and an information storage location of the information corresponding to the current identifier in the LUT to be constructed, so that the identifier storage location of the current identifier in the LUT to be constructed may be determined according to the sorting location, and then the information storage location of the information corresponding to the current identifier in the LUT to be constructed may be determined according to a preset location relationship between the identifier storage location and the information storage location having a corresponding relationship; of course, the information storage position of the information corresponding to the current identifier in the to-be-constructed LUT map may also be determined according to the sorting position, and then the identifier storage position of the current identifier in the to-be-constructed LUT map may be determined by combining the position relationship; etc., and are not specifically limited herein.

S330, storing the current identification and the information corresponding to the current identification according to the data storage position, and constructing a display lookup table map.

And when the information identifications and the information corresponding to the information identifications are stored completely, the corresponding LUT map is constructed completely.

S340, when the information searching event is detected, obtaining a displayed searching table map where the information to be searched corresponding to the information searching event is located and an identifier to be searched of the information to be searched in the displayed searching table map, wherein the identifier to be searched is one of the information identifiers stored in the displayed searching table map.

S350, determining the identifier storage position of the information identifier in the display lookup table map, and judging whether the information identifier in the identifier storage position is the identifier to be searched.

And S360, taking the information corresponding to the information identifier which is stored in the display lookup table map and is consistent with the identifier to be searched as the information to be searched.

According to the technical scheme of the embodiment of the invention, expected search probabilities of information corresponding to each information identifier are sequenced, and the expected search probabilities can embody the probability that the information identifier is used as the identifier to be searched (or the information is used as the information to be searched) in one information search process; and for each current identifier in the information identifiers, determining the data storage positions of the current identifier and the information corresponding to the current identifier in the LUT map to be constructed according to the sorting position of the expected searching probability of the current identifier in the sorting result, namely determining the storage positions of the current identifier and the information corresponding to the current identifier in the LUT map according to the probability of the current identifier and the information corresponding to the current identifier serving as searching targets in the process of one-time information searching, so as to store the current identifier and the information corresponding to the current identifier according to the storage positions and construct the LUT map. According to the technical scheme, in the process of constructing the LUT map, the sequence of the information identifications and/or the information corresponding to the information identifications in the LUT map is determined according to the expected search probability, and then the storage work of the information identifications and the corresponding information is completed according to the sequence of the storage, so that when information search is subsequently carried out in the LUT map constructed in the way, because the information identifications which are more likely to be used as the identifications to be searched are stored in the identification storage positions which are more front in the LUT map, the identifications to be searched can be found out more likely through fewer search times, and the search speed of the information to be searched is further improved.

An optional technical solution, in order to further improve the speed of searching for the information to be searched, the information searching method may further include: respectively determining information corresponding to each information identifier as actual searching frequency of the information to be searched, and sequencing the actual searching frequency; and aiming at each current identifier in the information identifiers, adjusting the data storage positions of the current identifier and the information corresponding to the current identifier in the constructed LUT map according to the sorting position of the actual searching frequency of the current identifier in the sorting result, and updating the LUT map according to the adjustment result. The actual search frequency of a certain information (or a certain information identifier) may be a frequency that is counted in an actually occurring information search process and that takes the certain information as information to be searched (or takes the certain information identifier as an identifier to be searched), which may present a real search situation of each information (or each information identifier) at the current time. Therefore, the information identifiers and the data storage positions of the information stored in the LUT map can be adjusted based on the sorting position of each actual searching frequency in the sorting result, and the information identifiers and the corresponding information with higher actual searching frequency are stored in the more front data storage positions of the LUT map, so that the adjusted LUT map is more suitable for the searching condition at the current moment, and the searching speed of the information to be searched is further improved.

Example four

Fig. 4 is a flowchart of an information searching method provided in the fourth embodiment of the present invention. The present embodiment is optimized based on the above technical solutions. In this embodiment, optionally, the information to be searched may include at least two pieces of parent information to be searched, where each piece of parent information to be searched includes at least two pieces of child information to be searched; the display lookup table map comprises at least two groups of color channels, each group of color channels comprises four color channels, and each color channel comprises a red channel, a green channel, a blue channel and a transparent channel; displaying the lookup table map can be constructed in advance by the following steps: obtaining a display lookup table map to be constructed; determining a target identifier corresponding to the information to be searched in each information identifier for each parent information to be searched in the information to be searched, and extracting target child information from each child information to be searched in the parent information to be searched; and sequentially storing the target identification and all target sub-information under the information to be searched in each color channel in the display lookup table map according to a definition rule to obtain the constructed display lookup table map. The same or corresponding terms as those in the above embodiments are not explained in detail herein.

Referring to fig. 4, the method of this embodiment may specifically include the following steps:

s410, obtaining a display lookup table map to be constructed, wherein the display lookup table map comprises at least two groups of color channels, each group of color channels comprises four color channels, and each color channel comprises a red channel, a green channel, a blue channel and a transparent channel.

Wherein the LUT map comprises at least two groups of color channels, each group of color channels comprising four color channels, which may comprise a red channel, a green channel, a blue channel and a transparent channel, i.e. a certain color channel may be one of the red channel, the green channel, the blue channel and the transparent channel.

S420, the information to be searched may include at least two pieces of parent information to be searched, each piece of parent information to be searched includes at least two pieces of child information to be searched, for each piece of parent information to be searched in the information to be searched, a target identifier corresponding to the information to be searched in each information identifier is determined, and the target child information is extracted from each piece of child information to be searched in the parent information to be searched.

The information to be searched may be a set of information including at least two pieces of parent information to be searched, the parent information to be searched may be information to be searched in the set of information, and each piece of parent information to be searched may include at least two pieces of child information to be searched. In practical application, for the parent information to be searched, not all the child information to be searched is information with actual value, exemplarily, taking the parent information to be searched as color information, each color information may include red information, green information, blue information and transparent information, and in a normal case, in an interface development process, the transparent information under each color information may be uniformly set to a numerical value, so that in order to improve convenience of setting the transparent information and store more color information in the LUT maps of the same size, the transparent information under each color information may be extracted, and the extracted transparent information is adjusted based on a preset controller, so that adjustment of the transparent information under all the color information can be completed by one-time adjustment, and convenience of operation is high; furthermore, compared to the case of storing one color information based on four color channels in the LUT map, since the transparent information has been extracted from each color information, one color information can be stored based on three color channels in the LUT map at this time, whereby more color information can be stored in the same size LUT map, improving the storage performance of the LUT map. Therefore, when constructing the LUT map, for each parent information to be searched in the information to be searched, the information identifier corresponding to the information to be searched in each information identifier is used as a target identifier, and target sub information is extracted from each child information to be searched of the parent information to be searched, where the target sub information may be the child information to be searched which is determined according to actual requirements and has actual value in each child information to be searched.

And S430, sequentially storing the target identification and all target sub-information under the information to be searched in each color channel in the display lookup table map according to a definition rule to obtain the constructed display lookup table map.

The definition rule may be a preset rule stored in the definition module, which is related to how the target identifier and the target sub information are stored in the LUT map, for example, a rule related to a sequence of storing the target identifier and each target sub information, a rule related to which color channel each target sub information is stored in, and the like, which is not specifically limited herein. For example, continuing to take color information as an example, the definition rule may be to store each target sub-information first and then store the target identifier, and each target sub-information under one color information is stored in sequence according to the order of red information, green information, and blue information, that is, at this time, there is no strict one-to-one correspondence between the target sub-information and the color channel. Of course, the above is described by taking the target sub information as red information, green information and blue information respectively, and in practical applications, the target sub information may be at least one of the red information, the green information and the blue information, and is not limited specifically herein. Therefore, all the target sub-information and the target identification under the information to be searched can be sequentially stored in each color channel of the LUT map according to the definition rule, and the constructed LUT map is obtained.

S440, when the information search event is detected, acquiring a displayed lookup table map where the to-be-searched information corresponding to the information search event is located and an to-be-searched identifier of the to-be-searched information in the displayed lookup table map, wherein the to-be-searched identifier is one of the information identifiers stored in the displayed lookup table map.

S450, determining the identifier storage position of the information identifier in the display lookup table map, and judging whether the information identifier in the identifier storage position is the identifier to be searched.

And S460, taking the information corresponding to the information identifier which is stored in the display lookup table map and is consistent with the identifier to be searched as the information to be searched.

The technical proposal of the embodiment of the invention is that the information to be searched comprises at least two pieces of father information to be searched, each piece of father information to be searched comprises at least two pieces of son information to be searched, and the display look-up table map comprises at least two groups of color channels, each group of color channels comprising four color channels, each color channel comprising a red channel, a green channel, a blue channel and a transparent channel, on the basis, aiming at each information to be searched, the target identification corresponding to the information to be searched and the target sub information extracted from each sub information to be searched of each father information to be searched of the information to be searched can be sequentially stored in each color channel in the LUT map according to the definition rule, thereby achieving the effect of constructing the LUT map based on the compressed information to be searched, the method and the device can store more information to be searched in the LUT map with the same size, and improve the storage performance of the LUT map.

An optional technical solution is to sequentially store the target identifier and all target sub-information under the information to be searched in each color channel in the display look-up table map according to a definition rule, and may include: acquiring the information quantity of all target sub-information under the information to be searched, wherein each target sub-information respectively occupies one color channel in the LUT map, and the information quantity is the channel quantity of the color channels occupied by the information to be searched in the LUT map; defining the rule to include that the target identifier is before and the target sub-information is after, storing the target identifier in a first channel of the color channels of the LUT map, and then sequentially storing the target sub-information in a next information number of color channels of the first channel, for example, assuming that the information number is 15 and the first channel is a 1 st color channel in the LUT map, 15 target sub-information may be sequentially stored in 2 nd to 16 th color channels in the LUT map; or, the defining rule includes that the target sub information is before and the target identifier is after, sequentially storing each target sub information in the second channel of the information amount in each color channel of the LUT map, and storing the target identifier in the next color channel of the last second channel in each second channel, for example, assuming that the information amount is 15, the second channel is the 1 st to 15 th color channels in the LUT map, and at this time, the last second channel in each second channel is the 15 th color channel, so that the 15 target sub information may be sequentially stored in the 1 st to 15 th color channels, and the target identifier is stored in the 16 th color channel.

To better understand the application of the color channels in the information search process, for example, continuing to take color information as an example, the definition rule is that the target sub information is before and the target is identified after, referring to fig. 5a, a set of color information identified as I1 and a set of color information identified as I2 are stored in the LUT, each set of color information includes 5 color information, and each color information includes red information, green information, and blue information, that is, each color information occupies 3 color channels in the LUT. Specifically, each cell may represent a color channel, the bold letter at the upper left corner in each cell may represent that the color channel is a red channel (R), a green channel (G), a blue channel (B), or a transparent channel (a), and the italic letter at the lower right corner in each cell may represent that red information (R1/R2/R3/R4/R5/R6/R7/R8/R9/R10), green information (G1/G2/G3/G4/G5/G6/G7/G8/G9/G10), or blue information (B1/B2/B3/B4/B5/B6/B7/B8/B9/B10) is stored in the color channel. In the information searching process, optionally, assuming that the identifier to be searched is I1, it may be determined first which identifier is stored in the storage location (i.e., the color channel where I1 and I2 are located) is I1, and after the color channel where I1 is located is found, information stored in 15 color channels before the color channel (R1/R2/R3/R4/R5/G1/G2/G3/G4/G5/B1/B2/B3/B4/B5) is used as the information to be searched. It should be noted that, in practical applications, optionally, the order of storing the red information (R), the green information (G), and the blue information (B) in the LUT may be set according to practical situations, as shown in fig. 5B, which is not specifically limited herein. Still optionally, referring to fig. 5c, the definition rule may be stored in a definition module, and besides, the definition module may also store rules related to a group of color information formed by several pieces of color information, which color sub information of red information, green information, blue information, and transparent information under each color information is compressed, what the order of storing the compressed color sub information in the LUT map is, under which color channels each information identifier is stored, and the like, which are not specifically limited herein. Therefore, the related rules can be read from the definition module based on the system interface to store and search the information, so that the constructed LUT map and the information to be searched from the LUT map are ensured to be consistent with the actual requirements, and the user experience is better.

EXAMPLE five

Fig. 6 is a block diagram of an information search apparatus according to a fifth embodiment of the present invention, where the apparatus is configured to execute the information search method according to any of the embodiments. The device and the information searching method of the embodiments belong to the same inventive concept, and details which are not described in detail in the embodiments of the information searching device can refer to the embodiments of the information searching method. Referring to fig. 6, the apparatus may specifically include: an identity acquisition module 510, an identity determination module 520, and an information lookup module 530.

The identifier obtaining module 510 is configured to, when an information search event is detected, obtain a displayed lookup table map in which to-be-searched information corresponding to the information search event is located and a to-be-searched identifier of the to-be-searched information in the displayed lookup table map, where the to-be-searched identifier is one of information identifiers stored in the displayed lookup table map;

an identifier determining module 520, configured to determine an identifier storage location of the information identifier in the display lookup table map, and determine whether the information identifier in the identifier storage location is an identifier to be searched;

and the information searching module 530 is configured to use information corresponding to the information identifier which is stored in the display lookup table map and is consistent with the identifier to be searched as the information to be searched.

Optionally, the identifier storage location of each information identifier is respectively adjacent to the information storage location of the information corresponding to the information identifier in the display lookup table map, and the information searching module 530 may include:

the target storage position determining unit is used for determining a target storage position of the information identifier which is consistent with the identifier to be searched in the display lookup table map from each identifier storage position;

and the information searching unit is used for acquiring preset adjacent relations between each identification storage position and each information storage position, determining adjacent storage positions adjacent to the target storage position in each information storage position according to the adjacent relations, and taking the information stored in the adjacent storage positions in the display lookup table map as the information to be searched.

On the basis, optionally, for each identifier storage position, the adjacent relation can be the adjacent direction of the information storage position adjacent to the identifier storage position relative to the identifier storage position, and the information to be searched occupies a preset number of information storage positions in the display lookup table map; the information searching unit may include:

an immediate vicinity storage position determination subunit operable to determine, from among the information storage positions, an immediate vicinity storage position located in an adjacent direction to the target storage position and immediately adjacent to the target storage position;

An adjacent storage location determining subunit for regarding a preset number of consecutive information storage locations in the adjacent direction from the immediately adjacent storage location as adjacent storage locations adjacent to the target storage location.

Optionally, the identifier obtaining module 510 may include:

the to-be-searched identifier judging unit is used for acquiring the current storage position in each identifier storage position and judging whether the information identifier in the current storage position is the to-be-searched identifier or not;

and the identifier obtaining unit is used for updating the next identifier storage position of the current storage position to the current storage position if the current identifier storage position is not the current storage position, and repeatedly executing the step of judging whether the information identifier in the current storage position is the identifier to be searched until the information identifier consistent with the identifier to be searched is searched.

Optionally, the information searching apparatus may further include:

the expected search probability ordering module is used for respectively acquiring preset expected search probabilities of the information corresponding to each information identifier and ordering the expected search probabilities;

the storage position determining module is used for determining the data storage positions of the current identification and the information corresponding to the current identification in the display lookup table chartlet to be constructed according to the ranking position of the expected lookup probability of the current identification in the ranking result aiming at each current identification in each information identification;

And the first display lookup table map construction module is used for storing the current identifier and the information corresponding to the current identifier according to the data storage position and constructing the display lookup table map.

Optionally, the information to be searched includes at least two pieces of parent information to be searched, and each piece of parent information to be searched includes at least two pieces of child information to be searched;

the above information searching apparatus may further include:

the display lookup table map obtaining module is used for obtaining a display lookup table map to be constructed;

the target sub information extraction module is used for determining a target identifier corresponding to the information to be searched in each information identifier aiming at each father information to be searched in the information to be searched and extracting target sub information from each sub information to be searched in the father information to be searched;

and the second display lookup table map construction module is used for sequentially storing the target identification and all target sub-information under the information to be searched in each color channel in the display lookup table map according to a definition rule to obtain the constructed display lookup table map.

On this basis, optionally, the second display lookup table map building module may include:

the information quantity obtaining unit is used for obtaining the information quantity of all target sub-information under the information to be searched, wherein each target sub-information respectively occupies one color channel in the display of the lookup table mapping;

the second display lookup table mapping construction unit is used for defining rules including that the target identification is in front and the target sub information is behind, storing the target identification in a first channel of all color channels of the display lookup table mapping, and sequentially storing all the target sub information in color channels with the next information quantity of the first channel;

or, the definition rule includes that the target sub-information is before and the target identifier is after, each target sub-information is sequentially stored in the second channel displaying the information quantity in each color channel of the look-up table map, and the target identifier is stored in the next color channel of the last second channel in each second channel.

In the information searching apparatus provided in the fifth embodiment of the present invention, on the basis that a group of information and an information identifier for identifying the group of information are both stored in an LUT, when an information searching event is detected by an identifier obtaining module, an LUT where information to be searched corresponding to the information searching event is located and an identifier to be searched of the information to be searched in the LUT can be obtained, and at this time, only which identifier of each information identifier is to be searched can be determined, but which identifier storage location in the LUT cannot be determined in which identifier storage location the identifier to be searched is stored; furthermore, the identifier storage positions of the information identifiers in the LUT mapping are determined through the identifier judgment module, and then the identifiers to be searched are found from the information identifiers stored in the identifier storage positions, namely, the information identifiers stored in the identifier storage positions can be loaded firstly, then the identifiers to be searched are found from the loaded information identifiers, and at the moment, the storage positions of the identifiers to be searched in the LUT mapping can be determined; therefore, the information corresponding to the information identifier which is stored in the LUT map and is consistent with the identifier to be searched can be used as the information to be searched through the information searching module, namely the information which is stored in the LUT map at the position corresponding to the identifier storage position for storing the identifier to be searched is used as the information to be searched. According to the device, a group of information and the information identification used for identifying the group of information are stored in the LUT map, and the number of the information identification is limited relative to the huge number of information, so that all the information identifications stored in the LUT map can be loaded in the process of information searching, then the identification to be searched is searched from the loaded information identifications, and then the corresponding information to be searched is searched in the LUT map according to the identification to be searched, so that the effect of improving the searching speed of the information to be searched is achieved by reducing the searching times.

The information searching device provided by the embodiment of the invention can execute the information searching method provided by any embodiment of the invention, and has the corresponding functional modules and beneficial effects of the executing method.

It should be noted that, in the embodiment of the information search apparatus, each included unit and each included module are only divided according to functional logic, but are not limited to the above division as long as the corresponding function can be implemented; in addition, specific names of the functional units are only for convenience of distinguishing from each other, and are not used for limiting the protection scope of the present invention.

EXAMPLE six

Fig. 7 is a schematic structural diagram of an information search apparatus according to a sixth embodiment of the present invention, and referring to fig. 7, the apparatus includes a memory 610, a processor 620, an input device 630, and an output device 640. The number of processors 620 in the device may be one or more, and one processor 620 is taken as an example in fig. 7; the memory 610, processor 620, input device 630, and output device 640 in the apparatus may be connected by a bus or other means, such as by bus 650 in fig. 7.

The memory 610, as a computer-readable storage medium, may be used for storing software programs, computer-executable programs, and modules, such as program instructions/modules corresponding to the information searching method in the embodiment of the present invention (for example, the identifier obtaining module 510, the identifier determining module 520, and the information searching module 530 in the information searching apparatus). The processor 620 executes various functional applications of the device and data processing by executing software programs, instructions and modules stored in the memory 610, that is, implements the information search method described above.

The memory 610 may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application program required for at least one function; the storage data area may store data created according to use of the device, and the like. Further, the memory 610 may include high speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid state storage device. In some examples, memory 610 may further include memory located remotely from processor 620, which may be connected to devices through a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.

The input device 630 may be used to receive input numeric or character information and generate key signal inputs related to user settings and function controls of the device. The output device 640 may include a display device such as a display screen.

EXAMPLE seven

A seventh embodiment of the present invention provides a storage medium containing computer-executable instructions, which when executed by a computer processor, perform a method for information search, the method including:

When an information searching event is detected, acquiring a display searching table map where to-be-searched information corresponding to the information searching event is located and an to-be-searched identifier of the to-be-searched information in the display searching table map, wherein the to-be-searched identifier is one of information identifiers stored in the display searching table map;

Of course, the storage medium provided by the embodiment of the present invention contains computer-executable instructions, and the computer-executable instructions are not limited to the operations of the method described above, and may also perform related operations in the information searching method provided by any embodiment of the present invention.

From the above description of the embodiments, it is obvious for those skilled in the art that the present invention can be implemented by software and necessary general hardware, and certainly, can also be implemented by hardware, but the former is a better embodiment in many cases. With this understanding, the technical solutions of the present invention may be embodied in the form of a software product, which can be stored in a computer-readable storage medium, such as a floppy disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a FLASH Memory (FLASH), a hard disk or an optical disk of a computer, and includes instructions for enabling a computer device (which may be a personal computer, a server, or a network device) to execute the methods according to the embodiments of the present invention.

It is to be noted that the foregoing is only illustrative of the preferred embodiments of the present invention and the technical principles employed. It will be understood by those skilled in the art that the present invention is not limited to the particular embodiments described herein, but is capable of various obvious changes, rearrangements and substitutions as will now become apparent to those skilled in the art without departing from the scope of the invention. Therefore, although the present invention has been described in greater detail by the above embodiments, the present invention is not limited to the above embodiments, and may include other equivalent embodiments without departing from the spirit of the present invention, and the scope of the present invention is determined by the scope of the appended claims.

23页详细技术资料下载

Information searching method, device, equipment and storage medium

相关技术

网友询问留言