CN103309893A - Character string comparing method and device - Google Patents
Character string comparing method and device Download PDFInfo
- Publication number
- CN103309893A CN103309893A CN2012100687467A CN201210068746A CN103309893A CN 103309893 A CN103309893 A CN 103309893A CN 2012100687467 A CN2012100687467 A CN 2012100687467A CN 201210068746 A CN201210068746 A CN 201210068746A CN 103309893 A CN103309893 A CN 103309893A
- Authority
- CN
- China
- Prior art keywords
- character string
- eigenwert
- character
- cryptographic hash
- obtains
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Abstract
The invention discloses a character string comparing method and device. The character string comparing method comprises the following steps of judging whether each character string has a corresponding abstract character value or not aiming to at least two character strings to be compared; if not, calculating and storing the abstract character values of the character strings; comparing whether the abstract character values of at least two character strings are the same or not; if so, ensuring that the at least two character strings are the same; and if not, ensuring that the at least two character strings are different. If the same judgment operation of repeatedly carrying out mass data processing operation in a service development and implementation environment of Internet exists, the corresponding abstract character values of the character strings are compared to obtain a same judgment result of the character strings, so that a manner of judging the same result by relatively comparing each character string in the two character strings, the data amount of the abstract character values is less than that of the character strings; the calculation amount of a lot of the same judgment operation can greatly reduced through comparing the abstract character values, an operation resource is saved, and the whole character string same judgment efficiency is improved.
Description
Technical field
The application relates to computing machine and calculates the field, relates in particular to a kind of comparative approach and device of character string.
Background technology
At present, in the business development and implementation environment of internet, the task of mass data processing computing is increasing, these mass data processing computings are a bit centered by the character string computing, wherein, whether identical computing has occupied again high ratio to more a plurality of character strings such as a plurality of web page addresses (URL).
Traditional judge character string whether identical computing by realizing such as the Strcmp function, declare the character string of biconditional operation (judging whether identical operation) for two needs, whether identical since each character of head scanning comparison of two character strings, be to have what characters just to need the comparison how many times in the character string, just can obtain two character strings and declare same result.In the mass data processing computing, repeat the ratio height very of declaring biconditional operation.For example, at character string s
1And s
2After declaring together, s
1Also may and s
3, s
4... s
nDeclare biconditional operation, use the same mode of declaring of above-mentioned this character string, each character string is declared with all needing comparison repeatedly just can obtain declaring same result, therefore, whole character string is declared with efficient lower, and the problems referred to above are outstanding especially when especially declaring biconditional operation for very long character string.
Summary of the invention
The embodiment of the present application provides a kind of comparative approach and device of character string, in order to realize in the business development of internet and implementation environment, existing repeat the mass data processing computing declare biconditional operation the time can obtain rapidly the same result of declaring of character string.
The comparative approach of a kind of character string that the embodiment of the present application provides comprises:
For at least two character strings to be compared, judge whether each character string exists corresponding summary eigenwert;
For the character string that does not have corresponding summary eigenwert, calculate and preserve the summary eigenwert of described character string;
Whether the summary eigenwert of more described at least two character strings is identical; If determine that described at least two character strings are identical; If not, determine described at least two character string differences.
The comparison means of a kind of character string that the embodiment of the present application provides comprises:
The first judge module is used for at least two character strings to be compared, judges whether each character string exists corresponding summary eigenwert;
Computing module is used for calculating and preserve the summary eigenwert of described character string for the character string that does not have corresponding summary eigenwert;
The second judge module, whether the summary eigenwert that is used for more described at least two character strings is identical; If determine that described at least two character strings are identical; If not, determine described at least two character string differences.
The beneficial effect of the embodiment of the present application comprises:
The comparative approach of a kind of character string that the embodiment of the present application provides and device at least two character strings to be compared, judge whether each character string exists corresponding summary eigenwert; For the character string that does not have corresponding summary eigenwert, calculate and preserve the summary eigenwert of character string; Whether the summary eigenwert of more at least two character strings is identical; If determine that at least two character strings are identical; If not, determine at least two character string differences.In the business development of internet and implementation environment, exist repeat the mass data processing computing declare biconditional operation the time, obtain the same result of declaring of character string owing to using summary eigenwert corresponding to character string to compare, just can obtain declaring the mode with the result with respect to comparing to each character in two character strings, because the data volume of summary eigenwert is often much smaller than the data volume of character string, the summary eigenwert is compared and obtained declaring same result, the calculated amount of can a large amount of minimizings declaring biconditional operation, this has saved calculation resources, has promoted whole character string and has declared same efficient.
Description of drawings
The process flow diagram of the comparative approach of the character string that Fig. 1 provides for the embodiment of the present application;
The structural representation of the comparison means of the character string that Fig. 2 provides for the embodiment of the present application.
Embodiment
Below in conjunction with accompanying drawing, the comparative approach of the character string that the embodiment of the present application is provided and the embodiment of device are described in detail.
The comparative approach of a kind of character string that the embodiment of the present application provides, as shown in Figure 1, idiographic flow may further comprise the steps:
S101, at least two character strings to be compared, judge whether each character string exists corresponding summary eigenwert; If, execution in step S103; If not, execution in step S102;
S102, for the character string that does not have corresponding summary eigenwert, calculate and preserve the summary eigenwert of character string;
Whether the summary eigenwert of S103, more at least two character strings is identical; If, execution in step S104; If not, execution in step S105;
S104, determine that at least two character strings are identical;
S105, definite at least two character string differences.
In the business development of internet and implementation environment, exist repeat the mass data processing computing declare biconditional operation the time use the embodiment of the present application to provide said method, relatively being converted into of a large amount of character strings compared summary eigenwert corresponding to character string, because the summary eigenwert is a numerical value, particularly, it can be 32 or 64 s' lint-long integer, concrete length is not done restriction at this, with respect to prior art each character in the character string is compared one by one and to be declared at last same result, only need once compare the summary eigenwert and can obtain declaring same result, reduced the calculated amount of declaring biconditional operation, improve operation efficiency, saved calculation resources.Especially grow, declare the more situation of biconditional operation repetition rate in character string, the string comparison method that uses the embodiment of the present application to provide, the lifting of operation efficiency is more obvious.
And, preferably, when the summary eigenwert is set to 64 lint-long integer, use existing 64 hardware architectures, such as: register or comparer etc., just can implement the above-mentioned string comparison method that the application provides.
The below is described in detail the specific implementation of above steps.
In above-mentioned steps S102, calculate the summary eigenwert of character string, can realize by following manner particularly: character string is carried out Hash operation, with the cryptographic hash that the obtains summary eigenwert as character string, because Hash operation belongs to prior art, do not do detailed description at this.
The inventor is when using the summary eigenwert of hash algorithm calculating character string, and namely there is the conflict probability in the probability that the summary eigenwert that discovery exists different character strings to calculate may be identical.Therefore, the inventor creates compound hash algorithm in conjunction with existing hash algorithm and calculates the summary eigenwert, clashes avoiding, and detailed process is as follows:
First character string is carried out at least twice different Hash operation, obtain at least two different cryptographic hash;
Then at least two different cryptographic hash are spliced processing, obtain the summary eigenwert of character string; Perhaps, at least two different cryptographic hash are carried out arithmetical operation after, for example: the addition subtraction multiplication and division computing obtains the summary eigenwert of character string.
In the specific implementation, the inventor finds, twice of character string different cryptographic hash spliced or summary eigenwert that arithmetical operation the obtains probability that just can effectively avoid conflict, therefore, following instantiation all is as the example explanation take twice different Hash operation.
Example one: carry out twice different Hash operation for character string and can use the fingerprint algorithm of the String::HashCode function realization of JAVA JDK to calculate, computing formula is as follows:
Wherein, h
1And h
2Be two different cryptographic hash; P
1And P
2Be prime number, for example: can be 29 and 31, not do restriction at this; S[0], s[1], s[2] ... s[n-1] be respectively the 1st of character string, the 2nd, the 3rd ... the character of n position.
In the specific implementation, realize with following code:
Example two: use respectively the DJBX algorithm of above-mentioned fingerprint algorithm and Daniel professor J.Bernstein invention to calculate for character string, obtain two 32 different cryptographic hash, during implementation, the DJBX algorithm for example can be realized (can also use the code of other versions) with following code:
Above-mentioned example one and example two just illustrate specifically how to calculate cryptographic hash, those skilled in the art can also use other hash functions for example the function of sdbm/FNV carry out the calculating of cryptographic hash, do not do restriction at this.
Calculating two different cryptographic hash h
1And h
2After can use (((long) h1)＜＜32) | (long) h2 formula, with h
1And h
2Be spliced into one 64 summary eigenwert, perhaps, two different cryptographic hash are done the arithmetical operation of addition subtraction multiplication and division after, obtain one 32 summary eigenwert.
And, after calculating summary eigenwert corresponding to character string, this summary eigenwert and character string are preserved together, just can direct repeat when repeating to compare use the summary eigenwert of this character string that calculates, and the make a summary space of eigenwert of storage only needs 8 bytes to get final product.
Preferably, if when carrying out character string comparison, insensitive to the capital and small letter of character string, namely character string more do not distinguished capital and small letter, just can before the summary eigenwert of calculating character string, each character of character string be unified to be converted to upper case or lower case as required get final product.
Based on same inventive concept, the embodiment of the present application also provides a kind of comparison means of character string, because the principle of this device solves problem is similar to the comparative approach of aforementioned a kind of character string, so the enforcement of this device can referring to the enforcement of method, repeat part and repeat no more.
The comparison means of a kind of character string that the embodiment of the present application provides as shown in Figure 2, comprising:
The first judge module 201 is used for at least two character strings to be compared, judges whether each character string exists corresponding summary eigenwert;
The second judge module 203, whether the summary eigenwert that is used for more at least two character strings is identical; If determine that at least two character strings are identical; If not, determine at least two character string differences.
Further, the computing module 202 in the said apparatus, concrete being used for carried out Hash operation to character string, with the cryptographic hash that the obtains summary eigenwert as character string.
Perhaps, further, the computing module 202 in the said apparatus, concrete being used for carried out at least twice different Hash operation to character string, obtains at least two different cryptographic hash; At least two different cryptographic hash are spliced processing, obtain the summary eigenwert of character string.
Further, computing module 202, concrete being used for uses following fingerprint algorithm that character string is carried out different Hash operation twice, obtains two different cryptographic hash h
1And h
2:
Wherein, P
1And P
2Be prime number, s[0], s[1], s[2] ... s[n-1] be respectively the 1st of character string, the 2nd, the 3rd ... the character of n position; Two different cryptographic hash are used (((long) h1)＜＜32) | (long) the h2 formula splices processing, obtains the summary eigenwert of character string.
Perhaps, further, above-mentioned computing module 202, concrete for using fingerprint algorithm and DJBX algorithm respectively character string to be carried out Hash operation, obtain two different cryptographic hash h
1And h
2Described two different cryptographic hash are used (((long) h1)＜＜32) | (long) the h2 formula splices processing, obtains the summary feature of described character string.
Further, the said apparatus that the embodiment of the present application provides as shown in Figure 2, can also comprise: modular converter 204, be used for before the summary eigenwert of computing module 202 calculating character strings, convert character string to string as upper case or lowercase character string according in advance setting.
Through the above description of the embodiments, those skilled in the art can be well understood to the embodiment of the present application and can realize by hardware, also can realize by the mode that software adds necessary general hardware platform.Based on such understanding, the technical scheme of the embodiment of the present application can embody with the form of software product, it (can be CD-ROM that this software product can be stored in a non-volatile memory medium, USB flash disk, portable hard drive etc.) in, comprise some instructions with so that computer equipment (can be personal computer, server, the perhaps network equipment etc.) carry out the described method of each embodiment of the application.
It will be appreciated by those skilled in the art that accompanying drawing is the schematic diagram of a preferred embodiment, the module in the accompanying drawing or flow process might not be that enforcement the application is necessary.
It will be appreciated by those skilled in the art that the module in the device among the embodiment can be distributed in the device of embodiment according to the embodiment description, also can carry out respective change and be arranged in the one or more devices that are different from the present embodiment.The module of above-described embodiment can be merged into a module, also can further split into a plurality of submodules.
Above-mentioned the embodiment of the present application sequence number does not represent the quality of embodiment just to description.
The comparative approach of a kind of character string that the embodiment of the present application provides and device at least two character strings to be compared, judge whether each character string exists corresponding summary eigenwert; For the character string that does not have corresponding summary eigenwert, calculate and preserve the summary eigenwert of character string; Whether the summary eigenwert of more at least two character strings is identical; If determine that at least two character strings are identical; If not, determine at least two character string differences.In the business development of internet and implementation environment, exist repeat the mass data processing computing declare biconditional operation the time, obtain the same result of declaring of character string owing to using summary eigenwert corresponding to character string to compare, just can obtain declaring the mode with the result with respect to comparing to each character in two character strings, because the data volume of summary eigenwert is often much smaller than the data volume of character string, the summary eigenwert is compared and obtained declaring same result, the calculated amount of can a large amount of minimizings declaring biconditional operation, saved calculation resources, promoted whole character string and declared same efficient.
Obviously, those skilled in the art can carry out various changes and modification and the spirit and scope that do not break away from the application to the application.Like this, if these of the application are revised and modification belongs within the scope of the application's claim and equivalent technologies thereof, then the application also is intended to comprise these changes and modification interior.
Claims (10)
1. the comparative approach of a character string is characterized in that, comprising:
For at least two character strings to be compared, judge whether each character string exists corresponding summary eigenwert;
For the character string that does not have corresponding summary eigenwert, calculate and preserve the summary eigenwert of described character string;
Whether the summary eigenwert of more described at least two character strings is identical; If determine that described at least two character strings are identical; If not, determine described at least two character string differences.
2. the method for claim 1 is characterized in that, calculates the summary eigenwert of described character string, specifically comprises:
Described character string is carried out at least twice different Hash operation, obtain at least two different cryptographic hash;
At least two different cryptographic hash are spliced processing, obtain the summary eigenwert of described character string.
3. method as claimed in claim 2 is characterized in that, uses following fingerprint algorithm that character string is carried out different Hash operation twice, obtains two different cryptographic hash h
1And h
2:
Wherein, P
1And P
2Be prime number, s[0], s[1], s[2] ... s[n-1] be respectively the 1st of described character string, the 2nd, the 3rd ... the character of n position;
Described two different cryptographic hash are used (((long) h1)＜＜32) | (long) the h2 formula splices processing, obtains the summary eigenwert of described character string.
4. method as claimed in claim 2 is characterized in that, uses fingerprint algorithm and DJBX algorithm respectively character string to be carried out Hash operation, obtains two different cryptographic hash h
1And h
2
Described two different cryptographic hash are used (((long) h1)＜＜32) | (long) the h2 formula splices processing, obtains the summary feature of described character string.
5. the method for claim 1 is characterized in that, calculates the summary eigenwert of described character string, specifically comprises:
Described character string is carried out Hash operation, with the cryptographic hash that the obtains summary eigenwert as described character string.
6. such as each described method of claim 1-5, it is characterized in that, when to the comparison case-insensitive of character string, before the summary eigenwert of calculating described character string, also comprise: convert described character string to string as upper case or lowercase character string according in advance setting.
7. the comparison means of a character string is characterized in that, comprising:
The first judge module is used for at least two character strings to be compared, judges whether each character string exists corresponding summary eigenwert;
Computing module is used for calculating and preserve the summary eigenwert of described character string for the character string that does not have corresponding summary eigenwert;
The second judge module, whether the summary eigenwert that is used for more described at least two character strings is identical; If determine that described at least two character strings are identical; If not, determine described at least two character string differences.
8. device as claimed in claim 7 is characterized in that, described computing module, and concrete being used for carried out at least twice different Hash operation to described character string, obtains at least two different cryptographic hash; At least two different cryptographic hash are spliced processing, obtain the summary eigenwert of described character string.
9. device as claimed in claim 8 is characterized in that, described computing module, and concrete being used for uses following fingerprint algorithm that character string is carried out different Hash operation twice, obtains two different cryptographic hash h
1And h
2:
Wherein, P
1And P
2Be prime number, s[0], s[1], s[2] ... s[n-1] be respectively the 1st of described character string, the 2nd, the 3rd ... the character of n position; Described two different cryptographic hash are used (((long) h1)＜＜32) | (long) the h2 formula splices processing, obtains the summary eigenwert of described character string.
10. device as claimed in claim 8 is characterized in that, described computing module is concrete for using fingerprint algorithm and DJBX algorithm respectively character string to be carried out Hash operation, obtains two different cryptographic hash h
1And h
2Described two different cryptographic hash are used (((long) h1)＜＜32) | (long) the h2 formula splices processing, obtains the summary feature of described character string.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210068746.7A CN103309893B (en) | 2012-03-15 | 2012-03-15 | The comparative approach of a kind of character string and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210068746.7A CN103309893B (en) | 2012-03-15 | 2012-03-15 | The comparative approach of a kind of character string and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103309893A true CN103309893A (en) | 2013-09-18 |
| CN103309893B CN103309893B (en) | 2016-12-28 |
Family
ID=49135130
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210068746.7A Active CN103309893B (en) | 2012-03-15 | 2012-03-15 | The comparative approach of a kind of character string and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103309893B (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104462322A (en) * | 2014-12-01 | 2015-03-25 | 北京国双科技有限公司 | Method and device for contrasting character strings |
| CN105988889A (en) * | 2015-02-11 | 2016-10-05 | 阿里巴巴集团控股有限公司 | Data check method and apparatus |
| CN105989532A (en) * | 2015-02-28 | 2016-10-05 | 阿里巴巴集团控股有限公司 | Data processing method and device |
| CN106469186A (en) * | 2016-08-29 | 2017-03-01 | 北京像素软件科技股份有限公司 | A kind of method and device of character string comparison |
| CN106685641A (en) * | 2016-12-23 | 2017-05-17 | 光锐恒宇（北京）科技有限公司 | Installation package signature method and device |
| CN109976896A (en) * | 2019-04-09 | 2019-07-05 | 中国联合网络通信集团有限公司 | Business re-scheduling treating method and apparatus |
| CN110858227A (en) * | 2018-08-23 | 2020-03-03 | 中国电信股份有限公司 | Method and device for comparing sets |
| CN111090982A (en) * | 2018-10-24 | 2020-05-01 | 迈普通信技术股份有限公司 | Text comparison method and device, electronic equipment and computer readable storage medium |
| CN111258770A (en) * | 2018-11-30 | 2020-06-09 | 上海寒武纪信息科技有限公司 | Data processing method, processor, data processing device and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPS60142734A (en) * | 1983-12-29 | 1985-07-27 | Fujitsu Ltd | Character string comparator |
| CN1866203A (en) * | 2005-05-20 | 2006-11-22 | 腾讯科技（深圳）有限公司 | Character string quoting method |
| CN101154228A (en) * | 2006-09-27 | 2008-04-02 | 西门子公司 | Partitioned pattern matching method and device thereof |
| CN101807207A (en) * | 2010-03-22 | 2010-08-18 | 北京大用科技有限责任公司 | Method for sharing document based on content difference comparison |
-
2012
- 2012-03-15 CN CN201210068746.7A patent/CN103309893B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPS60142734A (en) * | 1983-12-29 | 1985-07-27 | Fujitsu Ltd | Character string comparator |
| CN1866203A (en) * | 2005-05-20 | 2006-11-22 | 腾讯科技（深圳）有限公司 | Character string quoting method |
| CN101154228A (en) * | 2006-09-27 | 2008-04-02 | 西门子公司 | Partitioned pattern matching method and device thereof |
| CN101807207A (en) * | 2010-03-22 | 2010-08-18 | 北京大用科技有限责任公司 | Method for sharing document based on content difference comparison |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104462322A (en) * | 2014-12-01 | 2015-03-25 | 北京国双科技有限公司 | Method and device for contrasting character strings |
| CN104462322B (en) * | 2014-12-01 | 2018-02-02 | 北京国双科技有限公司 | Character string comparison method and device |
| CN105988889A (en) * | 2015-02-11 | 2016-10-05 | 阿里巴巴集团控股有限公司 | Data check method and apparatus |
| CN105988889B (en) * | 2015-02-11 | 2019-06-14 | 阿里巴巴集团控股有限公司 | A kind of data verification method and device |
| CN105989532A (en) * | 2015-02-28 | 2016-10-05 | 阿里巴巴集团控股有限公司 | Data processing method and device |
| CN106469186A (en) * | 2016-08-29 | 2017-03-01 | 北京像素软件科技股份有限公司 | A kind of method and device of character string comparison |
| CN106685641A (en) * | 2016-12-23 | 2017-05-17 | 光锐恒宇（北京）科技有限公司 | Installation package signature method and device |
| CN110858227A (en) * | 2018-08-23 | 2020-03-03 | 中国电信股份有限公司 | Method and device for comparing sets |
| CN111090982A (en) * | 2018-10-24 | 2020-05-01 | 迈普通信技术股份有限公司 | Text comparison method and device, electronic equipment and computer readable storage medium |
| CN111258770A (en) * | 2018-11-30 | 2020-06-09 | 上海寒武纪信息科技有限公司 | Data processing method, processor, data processing device and storage medium |
| CN111258770B (en) * | 2018-11-30 | 2023-10-10 | 上海寒武纪信息科技有限公司 | Data processing method, processor, data processing device and storage medium |
| CN109976896A (en) * | 2019-04-09 | 2019-07-05 | 中国联合网络通信集团有限公司 | Business re-scheduling treating method and apparatus |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103309893B (en) | 2016-12-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103309893A (en) | Character string comparing method and device | |
| JP5950285B2 (en) | A method for searching a tree using an instruction that operates on data having a plurality of predetermined bit widths, a computer for searching a tree using the instruction, and a computer thereof program | |
| US9383982B2 (en) | Data-parallel computation management | |
| US11106437B2 (en) | Lookup table optimization for programming languages that target synchronous digital circuits | |
| CN108985066B (en) | Intelligent contract security vulnerability detection method, device, terminal and storage medium | |
| CN102129425B (en) | The access method of big object set table and device in data warehouse | |
| CN110737659A (en) | Graph data storage and query method, device and computer readable storage medium | |
| US20150074115A1 (en) | Distributed storage of data | |
| US9690862B2 (en) | Realtime ingestion via multi-corpus knowledge base with weighting | |
| Ortmann et al. | Efficient orbit-aware triad and quad census in directed and undirected graphs | |
| CN111143446A (en) | Data structure conversion processing method and device of data object and electronic equipment | |
| WO2020092135A1 (en) | Extracting web api endpoint data from source code | |
| CN103077254A (en) | Webpage acquiring method and device | |
| CN110941655B (en) | Data format conversion method and device | |
| RU2616164C2 (en) | Methods and device for browser engine work | |
| CN111914987A (en) | Data processing method and device based on neural network, equipment and readable medium | |
| CN113254445A (en) | Real-time data storage method and device, computer equipment and storage medium | |
| CN107357206A (en) | A kind of method, apparatus and system of the computing optimization based on FPGA boards | |
| CN105204883B (en) | A kind of plug-in unit loading processing method and device | |
| KR20200103133A (en) | Method and apparatus for performing extract-transfrom-load procedures in a hadoop-based big data processing system | |
| US8739114B2 (en) | Using infeasible nodes to select branching variables | |
| US10394810B1 (en) | Iterative Z-score calculation for big data using components | |
| CN107291439A (en) | A kind of target delta data construction method and device | |
| US10235415B1 (en) | Iterative variance and/or standard deviation calculation for big data using components | |
| US8549464B2 (en) | Reusing expression graphs in computer programming languages |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: DE Ref document number: 1185963 Country of ref document: HK |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: GR Ref document number: 1185963 Country of ref document: HK |