CN103309747B - The distribution method of a kind of code file statistics task and device - Google Patents
The distribution method of a kind of code file statistics task and device Download PDFInfo
- Publication number
- CN103309747B CN103309747B CN201310187674.2A CN201310187674A CN103309747B CN 103309747 B CN103309747 B CN 103309747B CN 201310187674 A CN201310187674 A CN 201310187674A CN 103309747 B CN103309747 B CN 103309747B
- Authority
- CN
- China
- Prior art keywords
- code
- code file
- file
- group
- disk space
- 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.)
- Active
Links
Landscapes
- Debugging And Monitoring (AREA)
Abstract
The present invention provides distribution method and the device of a kind of code file statistics task, and the method comprises determining that the disk space value shared by each code file to be counted；According to the disk space value shared by task amount average and each code file, all code files to be counted being divided into N group, described task amount average is equal to the disk space value summation of all code files to be counted and the ratio of N, and described N is the number of statistical module；The N group code file correspondence obtained is distributed to N number of statistical module, described N number of statistical module adds up the code information of each code file in described N group code file parallel.The present invention completes statistics task in the short period to greatest extent, improves the treatment effeciency of computer program, saves the process time.
Description
Technical field
The present invention relates to technical field of computer information processing, particularly relate to a kind of code file statistics task
Distribution method and device.
Background technology
When carrying out computer information processing, it usually needs the code information to code file is added up, and
And be frequently encountered by multiple code file need add up.The statistical used at present is, special at task amount
Time the biggest, the method that multiple statistical module/statistical tool carries out adding up parallel can be used to add fast speed.
But, the distribution of current code file statistics task is random, will multiple code file random assortment
To multiple statistical module/statistical tools, one big file of last residue the most often occurs by a statistics
Module performs statistics, and other statistical module is already without the situation of statistics task, i.e. distribution is uneven
Weighing apparatus, this reduces the treatment effeciency of computer program.
Summary of the invention
The present invention provides distribution method and the device of a kind of code file statistics task, due to balanced realization task
Distribution, improves the treatment effeciency of computer program.
The present invention provides the distribution method of a kind of code file statistics task, including:
Determine the disk space value shared by each code file to be counted；
According to the disk space value shared by task amount average and each code file, by all codes to be counted
File is divided into N group, described task amount average equal to all code files to be counted disk space value summation with
The ratio of N, described N is the number of statistical module；
The N group code file correspondence obtained is distributed to N number of statistical module, by described N number of statistical module
The code information of each code file in the described N group code file of parallel statistics.
Preferably, repeat following steps and obtain N-1 group code file: select from current code set
The code file that disk space value is maximum, time initial, code collection includes all code files to be counted；Really
Whether the disk space value summation of the code file surely selected is less than task amount average, the most then according to task
Amount average and the difference of the disk space value summation of the code file selected, select sky from current code set
Between disk value closest to the code file of this difference, and return that to redefine the disk of the code file selected empty
Between be worth summation whether less than task amount average, if it is not, then the code file currently selected to be formed one group of code
File；
After obtaining N-1 group code file, code file remaining in code collection is formed one group of code file.
Preferably, described N number of statistical module each code literary composition in described N group code file is added up parallel
The code information of part, the most also includes:
Code information for all code files of each statistical module counts collects.
Preferably, farther include: all statistical modules are collected the code information obtained and collects further.
Preferably, described code information include arbitrary or appoint multiple information:
Code quantity, null line number, lines of code, annotation line number, annotation percentage ratio, code percentage ratio,
File size, file date.
The present invention also provides for a kind of code file statistics task distributor, including:
Disk value determines unit, for determining the disk space value shared by each code file to be counted；
Grouped element, for according to the disk space value shared by task amount average and each code file, by institute
Having code file to be counted to be divided into N group, described task amount average is equal to the magnetic of all code files to be counted
Disk space value summation and the ratio of N, described N is the number of statistical module；
Task allocation unit, for the N group code file correspondence obtained is distributed to N number of statistical module,
The code information of each code file in described N group code file is added up parallel by described N number of statistical module.
Preferably, described grouped element, repeat following steps and obtain N-1 group code file: from currently
Selecting the code file that disk space value is maximum in code collection, time initial, code collection includes all to be counted
Code file；Determine whether the disk space value summation of the code file selected is less than task amount average, if
It is, then according to the difference of task amount average with the disk space value summation of the code file selected, from working as former generation
Code set is selected the space disk value code file closest to this difference, and return redefines the generation selected
Whether the disk space value summation of code file is less than task amount average, if it is not, the code literary composition then will currently selected
Part forms one group of code file；
Described grouped element, after obtaining N-1 group code file, by code file group remaining in code collection
Become one group of code file.
Preferably, also include: collection unit, for being added up described N parallel by described N number of statistical module
In group code file after the code information of each code file, for all generations of each statistical module counts
The code information of code file collects.
Preferably, collection unit farther includes to enter for all statistical modules are collected the code information obtained
One step collects.
Preferably, described code information include arbitrary or appoint multiple information:
Code quantity, null line number, lines of code, annotation line number, annotation percentage ratio, code percentage ratio,
File size, file date.
Utilize distribution method and the device of the code file statistics task that the present invention provides, there is following useful effect
Really: the disk space size owing to taking according to each code file estimated code statistics workload, and
Carry out code file statistics task distribution according to task average, therefore can realize average distribution, this
The each statistical module of sample when parallel computation, task amount relatively, the time completed also close to, thus maximum
Limit complete statistical summaries in the short period, improve the treatment effeciency of computer program, save process
Time.
Accompanying drawing explanation
Fig. 1 is the distribution method flow chart of the code file statistics task in the embodiment of the present invention；
The structure chart of the distributor of the code file statistics task in Fig. 2 embodiment of the present invention.
Detailed description of the invention
The distribution method of the code file statistics task with embodiment, the present invention provided below in conjunction with the accompanying drawings and
Device illustrates in greater detail.
Traditional code file statistics task is random assortment, the most often occurs that last residue one is big
File performed statistics by a statistical module, and other statistical module is already without the feelings of statistics task
Condition, i.e. distribution is unbalanced, this reduces the treatment effeciency of computer program.
Applicant studies discovery, owing to the core content in code word file is that code is (except some annotate it
Outward), therefore code file takies the space size of disk and can probably reflect that code information is as many in code
Few, at least between each code file during contrast, there is relative meaning.
To this end, the present embodiment provides the distribution method of a kind of code file statistics task, as it is shown in figure 1, bag
Include following steps:
Step 101, determines the disk space value shared by each code file to be counted；
First obtain each code file to be counted, the magnetic shared by each code can be determined to use existing mode
Disk space value.
Step 102, according to the disk space value shared by task amount average and each code file, will be needed
The code file of statistics is divided into N group, and described task amount average is empty equal to the disk of all code files to be counted
Between be worth the ratio of summation and N, described N is the number of statistical module；
Preferably, the present embodiment, will according to the disk space value shared by task amount average and each code file
When all code files to be counted are divided into N group, make each disk space value summation organizing code file of distribution
With the difference of task amount average in set point, even if the disk space value of each group code file of packet is total
The most close.
Step 103, distributes to N number of statistical module, by described N by the N group code file correspondence obtained
Individual statistical module adds up the code information of each code file in described N group code file parallel.
Statistical module in the present embodiment is the computer journey for code file carries out code information statistics
Sequence, specifically can be loaded into N number of statistical module respectively by N group code file, and each statistical module is responsible for
The statistics of one group of code file, and different code-group corresponding to statistical module is different, specific corresponding to relation
Can be arbitrarily to arrange, as long as one-to-one relationship.
The number of concrete statistical module, can determine according to information such as the loads of current computer program, as
When computer programs process duty ratio is less, suitably increase the number of statistical module, bear at computer program
Lotus is bigger, suitably reduces the number of statistical module.
The distribution method of the code file statistics task that the embodiment of the present invention provides and device, due to according to each generation
The disk space size that code file takies has estimated the task workload of code statistics, and according to task average
Carry out code file statistics task distribution, therefore can realize average distribution, the most each statistical module
When parallel computation, task amount relatively, the time completed also close to, thus to greatest extent shorter
Time completes statistical summaries, improves the treatment effeciency of computer program, saves the process time.
Preferably, the present embodiment is being added up described N group code file parallel by described N number of statistical module
In the code information of each code file, the most also include:
Code information for all code files of each statistical module counts collects.
Preferably, farther include: all statistical modules are collected the code information obtained and collects further.
Specifically can choose whether as required the code information of statistics codes file is collected, and carry out
Collecting of what level.
Preferably, described code information include arbitrary or appoint multiple information: code quantity, null line number,
Lines of code, annotation line number, annotation percentage ratio, code percentage ratio, file size, file date.
In order to realize the task amount distribution more equalized, various ways can be used, as long as each group of distribution
The disk space total value of code file is relatively.The embodiment of the present invention gives one and preferably implements
Mode, specific as follows:
Repeat following steps and obtain N-1 group code file:
1) from current code set, select the code file that disk space value is maximum, code collection time initial
Including all code files to be counted；
2) determine whether the disk space value summation of the code file selected is less than task amount average, if so,
Perform step 3), otherwise perform step 4)；
It should be noted that the code file selected here refers to select from code collection and be not fully complete packet
All code files, it is possible to be one, it is possible to for multiple.
The code file selected i.e. represents that code file is selected from code collection, i.e. in code collection no longer
There is this code file.
Preferably, if selecting code file for the first time, directly the disk space value according to code file is big
Little, determine that whether the disk space value summation of the code file selected is less than task amount average.
If not selecting code file for the first time, then according to the up-to-date difference determined and the up-to-date code selected literary composition
The disk space size of part, determines that the disk space value summation of the code file selected is the most equal less than task amount
Value.
3) according to the difference of task amount average with the disk space value summation of the code file selected, from currently
Code collection is selected the space disk value code file closest to this difference, and returns step 2) the most true
Whether the disk space value summation of the code file surely selected is less than task amount average；
4) code file currently selected is formed one group of code file.
It should be noted that after the code file currently selected is formed one group of code file, currently select
Code file completes packet, is no longer belong to the code file selected.
After obtaining N-1 group code file, code file remaining in code collection is formed one group of code literary composition
Part, thus obtain N group code file.
The disk space value summation of front N-1 group code file owing to using aforesaid way to obtain is equal with task amount
Value is relatively, and the disk space value summation of the code file that therefore last group obtains is the most relatively
Task amount average, thus more balancedly achieve task distribution.
Below with concrete data instance, the distribution method providing code file statistics task of the present invention is the most real
Execute example.
Assume to need to carry out size of code statistics now with 9 code files comprising code, these 9 code literary compositions
It is the most as shown in table 1 that part takies disk space size:
Table 1
| A | B | C | D | E | F | G | H | I |
| 0.7M | 1.4M | 2.7M | 3.3M | 4.8M | 5.0M | 5.6M | 6.4M | 9.4M |
Currently available statistical module has 3, it is therefore desirable to by these code files substantially be divided into 3 groups,
Ensure that the size of this code file of 3 groups is closer to.
First summation: 0.7+1.4+2.7+3.3+4.8+5.0+5.6+6.4+9.4=39.3 is calculated；
The average being divided into 3 parts is: 39.3 ÷ 3=13.1；
Grouping process is as follows:
First group is selected in code file universal class:
First select maximum, be 9.4；
Calculate the difference of average and maximum: 13.1-9.4=3.7；
Code collection is 3.3 closest to difference 3.7；
The file 9.4 and 3.7 selected and 12.7 less than average, difference is 3.7-3.3=0.4, closest
0.4 be 0.7, and 0.7+3.3+9.4=13.4 > 13.1, stop selecting；
Therefore the code file of 0.7,3.3,9.4 correspondences is divided into one group, distribute to a statistical module.
Second group is selected in residue code set:
First select maximum, be now 6.4；
13.1-6.4=6.7, closest to 6.7 be 5.6；
The file 6.4 and 5.6 selected and 12 less than average 13.1, difference is that 6.7-5.6=1.1 is closest
1.1 be 1.4, and 1.4+5.6+6.4=13.4 > 13.1, stop selecting；
1.4, the code file of 5.6,6.4 correspondences is divided into one group, distributes to a statistical module
The code file of remaining 2.7,4.8,5.0 correspondences is divided into one group, distributes to a statistical module.
Final result is:
A, D, I file is assigned to a statistical module；B, G, H file is assigned to a statistics
Module；C, E, F file is assigned to a statistical module.
Owing to code file takies the correspondence that the number of disk space size and size of code is the most rough, because of
This uses the algorithm of the present invention to be allocated being sufficient to, and this algorithm is very simple, and dispensing rate is fast.
Based on same inventive concept, the embodiment of the present invention additionally provides dividing of a kind of code file statistics task
It is equipped with and puts, owing to the principle of this device solution problem is similar to the distribution method of code file statistics task, because of
The enforcement of this this device may refer to the enforcement of method, repeats no more in place of repetition.
As in figure 2 it is shown, the code file statistics task distributor that the embodiment of the present invention provides, including:
Disk value determines unit 201, for determining the disk space shared by each code file to be counted
Value；
Grouped element 202, is used for according to the disk space value shared by task amount average and each code file,
All code files to be counted are divided into N group, and described task amount average is equal to all code files to be counted
The ratio of disk space value summation and N, described N is the number of statistical module；
Task allocation unit 203, for the N group code file correspondence obtained is distributed to N number of statistical module,
The code information of each code file in described N group code file is added up parallel by described N number of statistical module.
Preferably, described grouped element, repeat following steps and obtain N-1 group code file: from currently
Selecting the code file that disk space value is maximum in code collection, time initial, code collection includes all to be counted
Code file；Determine whether the disk space value summation of the code file selected is less than task amount average, if
It is, then according to the difference of task amount average with the disk space value summation of the code file selected, from working as former generation
Code set is selected the space disk value code file closest to this difference, and return redefines the generation selected
Whether the disk space value summation of code file is less than task amount average, if it is not, the code literary composition then will currently selected
Part forms one group of code file；
Described grouped element, after obtaining N-1 group code file, by code file group remaining in code collection
Become one group of code file.
Preferably, this device also includes:
Collection unit, for being added up each in described N group code file parallel by described N number of statistical module
After the code information of individual code file, for the code letter of all code files of each statistical module counts
Breath collects.
Preferably, collection unit farther includes to enter for all statistical modules are collected the code information obtained
One step collects.
Preferably, described code information include arbitrary or appoint multiple information:
Code quantity, null line number, lines of code, annotation line number, annotation percentage ratio, code percentage ratio,
File size, file date.
When the present invention proposes a kind of parallel statistics codes, the distribution method of file task, core is distribution
Front to take disk space size according to each code file be foundation, the average distribution (phase carrying out file
When in estimating roughly).
The present invention is with reference to method, equipment (system) and computer program product according to embodiments of the present invention
The flow chart of product and/or block diagram describe.It should be understood that can by computer program instructions flowchart and
/ or block diagram in each flow process and/or flow process in square frame and flow chart and/or block diagram and/
Or the combination of square frame.These computer program instructions can be provided to general purpose computer, special-purpose computer, embedding
The processor of formula datatron or other programmable data processing device is to produce a machine so that by calculating
The instruction that the processor of machine or other programmable data processing device performs produces for realizing at flow chart one
The device of the function specified in individual flow process or multiple flow process and/or one square frame of block diagram or multiple square frame.
These computer program instructions may be alternatively stored in and computer or the process of other programmable datas can be guided to set
In the standby computer-readable memory worked in a specific way so that be stored in this computer-readable memory
Instruction produce and include the manufacture of command device, this command device realizes in one flow process or multiple of flow chart
The function specified in flow process and/or one square frame of block diagram or multiple square frame.
These computer program instructions also can be loaded in computer or other programmable data processing device, makes
Sequence of operations step must be performed to produce computer implemented place on computer or other programmable devices
Reason, thus the instruction performed on computer or other programmable devices provides for realizing flow chart one
The step of the function specified in flow process or multiple flow process and/or one square frame of block diagram or multiple square frame.
Although preferred embodiments of the present invention have been described, but those skilled in the art once know base
This creativeness concept, then can make other change and amendment to these embodiments.So, appended right is wanted
Ask and be intended to be construed to include preferred embodiment and fall into all changes and the amendment of the scope of the invention.
Obviously, those skilled in the art can carry out various change and modification without deviating from this to the present invention
Bright spirit and scope.So, if the present invention these amendment and modification belong to the claims in the present invention and
Within the scope of its equivalent technologies, then the present invention is also intended to comprise these change and modification.
Claims (8)
1. the distribution method of a code file statistics task, it is characterised in that including:
Determine the disk space value shared by each code file to be counted；
According to the disk space value shared by task amount average and each code file, all code files to be counted being divided into N group, described task amount average is equal to the disk space value summation of all code files to be counted and the ratio of N, and described N is the number of statistical module；Wherein, all code files to be counted are divided into N group, specifically include: repeat following steps and obtain N-1 group code file: selecting the code file that disk space value is maximum from current code set, time initial, code collection includes all code files to be counted；Determine that whether the disk space value summation of the code file selected is less than task amount average, if, then according to the difference of task amount average with the disk space value summation of the code file selected, the space disk value code file closest to this difference is selected from current code set, and whether return redefines the disk space value summation of the code file selected less than task amount average, if it is not, then the code file currently selected to be formed one group of code file；After obtaining N-1 group code file, code file remaining in code collection is formed one group of code file；
The N group code file correspondence obtained is distributed to N number of statistical module, described N number of statistical module adds up the code information of each code file in described N group code file parallel.
2. the method for claim 1, it is characterised in that added up the code information of each code file in described N group code file parallel by described N number of statistical module, the most also include:
Code information for all code files of each statistical module counts collects.
3. method as claimed in claim 2, it is characterised in that farther include:
All statistical modules are collected the code information obtained collect further.
4. the method for claim 1, it is characterised in that described code information include arbitrary or appoint multiple information:
Code quantity, null line number, lines of code, annotation line number, annotation percentage ratio, code percentage ratio, file size, file date.
5. a code file statistics task distributor, it is characterised in that including:
Disk value determines unit, for determining the disk space value shared by each code file to be counted；
Grouped element, for according to the disk space value shared by task amount average and each code file, all code files to be counted are divided into N group, and described task amount average is equal to the disk space value summation of all code files to be counted and the ratio of N, and described N is the number of statistical module；Wherein, described grouped element is when for being divided into N group by all code files to be counted, specifically include: repeat following steps and obtain N-1 group code file: selecting the code file that disk space value is maximum from current code set, time initial, code collection includes all code files to be counted；Determine that whether the disk space value summation of the code file selected is less than task amount average, if, then according to the difference of task amount average with the disk space value summation of the code file selected, the space disk value code file closest to this difference is selected from current code set, and whether return redefines the disk space value summation of the code file selected less than task amount average, if it is not, then the code file currently selected to be formed one group of code file；After obtaining N-1 group code file, code file remaining in code collection is formed one group of code file;
Task allocation unit, for the N group code file correspondence obtained is distributed to N number of statistical module, is added up the code information of each code file in described N group code file parallel by described N number of statistical module.
6. device as claimed in claim 5, it is characterised in that also include:
Collection unit, for being added up parallel in described N group code file after the code information of each code file by described N number of statistical module, the code information for all code files of each statistical module counts collects.
7. device as claimed in claim 6, it is characterised in that collection unit farther includes to collect further for all statistical modules are collected the code information obtained.
8. device as claimed in claim 5, it is characterised in that described code information includes arbitrary or appoints multiple information:
Code quantity, null line number, lines of code, annotation line number, annotation percentage ratio, code percentage ratio, file size, file date.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310187674.2A CN103309747B (en) | 2013-05-20 | 2013-05-20 | The distribution method of a kind of code file statistics task and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310187674.2A CN103309747B (en) | 2013-05-20 | 2013-05-20 | The distribution method of a kind of code file statistics task and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103309747A CN103309747A (en) | 2013-09-18 |
| CN103309747B true CN103309747B (en) | 2016-09-28 |
Family
ID=49135004
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310187674.2A Active CN103309747B (en) | 2013-05-20 | 2013-05-20 | The distribution method of a kind of code file statistics task and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103309747B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106407243A (en) * | 2016-04-19 | 2017-02-15 | 北京新能源汽车股份有限公司 | Method and device for processing capacity information of engineering file |
| CN108681462B (en) * | 2018-05-14 | 2021-06-18 | 贝壳找房(北京)科技有限公司 | Code amount statistical method and device |
| CN117707770A (en) * | 2023-12-14 | 2024-03-15 | 南方电网科学研究院有限责任公司 | Electromagnetic transient simulation parallel computing acceleration method and related device for power system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101017458A (en) * | 2007-03-02 | 2007-08-15 | 北京邮电大学 | Software safety code analyzer based on static analysis of source code and testing method therefor |
| CN102253861A (en) * | 2011-08-01 | 2011-11-23 | 深圳市极限网络科技有限公司 | Method for executing stepwise plug-in computation |
| CN102467570A (en) * | 2010-11-17 | 2012-05-23 | 日电（中国）有限公司 | Connection query system and method for distributed data warehouse |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060184914A1 (en) * | 2005-02-17 | 2006-08-17 | Microsoft Corporation | Random code generation |
-
2013
- 2013-05-20 CN CN201310187674.2A patent/CN103309747B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101017458A (en) * | 2007-03-02 | 2007-08-15 | 北京邮电大学 | Software safety code analyzer based on static analysis of source code and testing method therefor |
| CN102467570A (en) * | 2010-11-17 | 2012-05-23 | 日电（中国）有限公司 | Connection query system and method for distributed data warehouse |
| CN102253861A (en) * | 2011-08-01 | 2011-11-23 | 深圳市极限网络科技有限公司 | Method for executing stepwise plug-in computation |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103309747A (en) | 2013-09-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Chen et al. | An optimal sample allocation strategy for partition-based random search | |
| US7644142B2 (en) | Methods and apparatus to perform process placement for distributed applications | |
| CN104408179A (en) | Method and device for processing data from data table | |
| CN105046443A (en) | Business work order allocation method and system | |
| CN113467938B (en) | Bus resource allocation method and device and related equipment | |
| CN103902384A (en) | Method and device for allocating physical machines for virtual machines | |
| CN103309747B (en) | The distribution method of a kind of code file statistics task and device | |
| CN105869043A (en) | Disperse hot spot database account transfer-in and transfer-out accounting method and device | |
| CN102314336A (en) | Data processing method and system | |
| CN107992516A (en) | Electronic device, the method for data query and storage medium | |
| CN105488134A (en) | Big data processing method and big data processing device | |
| CN105493024B (en) | A kind of data threshold prediction technique and relevant apparatus | |
| CN102201922A (en) | Data charging method and relevant apparatus | |
| CN102393830A (en) | Data processing time acquisition method and device | |
| CN110334018A (en) | A kind of big data introduction method and relevant device | |
| CN117032954B (en) | Memory optimization method, system, equipment and medium for terminal training model | |
| CN104753741A (en) | Network card test performance adjustment method and device | |
| CN105763636A (en) | Optimal host selection method and system in distributed system | |
| CN102279821B (en) | Method and system for transmitting DDR (double data rate) controller port command | |
| CN104461878A (en) | Software quality evaluation method based on user-defined models | |
| CN104570737B (en) | PID controller parameter method for selecting based on random algorithm | |
| CN110442619B (en) | Search result ordering method and device, electronic equipment and storage medium | |
| CN105704173A (en) | Cluster system data distribution method and server | |
| CN105893145A (en) | Task scheduling method and device based on genetic algorithm | |
| CN102495788B (en) | Internal storage counting method and device of embedded system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20170124 Address after: 266100 Shandong Province, Qingdao city Laoshan District Songling Road No. 399 Patentee after: Poly Polytron Technologies Inc Address before: 266071 Laoshan, Qingdao province Hongkong District No. East Road, room 248, room 131 Patentee before: Qingdao Hisense Media Networks Co., Ltd. |