CN113590136B - Method for automatically generating bit domain object in JavaScript language - Google Patents
Method for automatically generating bit domain object in JavaScript language Download PDFInfo
- Publication number
- CN113590136B CN113590136B CN202110906597.6A CN202110906597A CN113590136B CN 113590136 B CN113590136 B CN 113590136B CN 202110906597 A CN202110906597 A CN 202110906597A CN 113590136 B CN113590136 B CN 113590136B
- Authority
- CN
- China
- Prior art keywords
- bit
- value
- domain
- class
- bit field
- 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
- 238000000034 method Methods 0.000 title claims abstract description 33
- 238000013507 mapping Methods 0.000 claims abstract description 11
- 230000006870 function Effects 0.000 claims abstract description 7
- 238000010276 construction Methods 0.000 claims abstract description 5
- 238000007493 shaping process Methods 0.000 claims description 13
- 238000004364 calculation method Methods 0.000 claims description 3
- 238000012545 processing Methods 0.000 claims description 3
- 230000006978 adaptation Effects 0.000 abstract description 4
- 238000010586 diagram Methods 0.000 description 8
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/40—Transformation of program code
- G06F8/51—Source to source
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5011—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
- G06F9/5016—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals the resource being the memory
Abstract
The invention discloses a method for automatically generating a bit domain object in JavaScript language, which comprises the following steps: s1, defining a single structure class of a bit domain; s2, defining a bit domain structure class: entering a bit domain structure class construction function, and automatically generating a complete bit domain class object by using a bit domain class object generating algorithm; s3, defining a bit field class: inheriting the bit domain structure class, designating the bit domain single name and the bit domain single bit width, and defining a bit domain class by the extended implementation of the incoming bit domain mapping table BitMaps. The invention can obtain the JavaScript bit domain object only by designating the bit domain single name (attribute name) and the bit domain single bit width. The bit domain object is used in the JavaScript, so that the interface universality of cross-platform software can be greatly improved, the interface adaptation workload is reduced, the memory occupied by a program is reduced, and the software operation speed is improved.
Description
Technical Field
The invention discloses a method for automatically generating a bit domain object in JavaScript language.
Background
With the rapid development of cross-platform software, the C/C++ middleware program can be rapidly transplanted into a browser to run by means of the WebAssemble technology. Bit structure (struct) and union (unit) are used in the C/C++ middleware program to conveniently construct bit domain objects as parameters, and the method has the characteristic of realizing the expansion of numerical parameters without changing the original interface, thereby bringing greater flexibility and expandability to the program. However, the structural body bit domain and the association data object are not defined in the JavaScript language, so when the C/C++ middleware interface is called by the Web-side JavaScript language, if the function similar to the function of the C/C++ bit object can be realized, the interface universality of cross-platform software is greatly improved, the interface adaptation workload is reduced, and the working efficiency of software development by using the C/C++ middleware by the Web program is greatly improved.
Disclosure of Invention
The invention aims to overcome the defects of the prior art and provide a method for automatically generating the bit domain object in JavaScript language, which only needs to designate the bit domain single name (attribute name) and the bit domain single bit width, can obtain the JavaScript bit domain object by running the algorithm provided by the invention, can greatly increase the interface universality of cross-platform software and reduce the interface adaptation workload.
The aim of the invention is realized by the following technical scheme: a method for automatically generating a bit-domain object in JavaScript language, comprising the steps of:
s1, defining a single structure class of a bit domain;
s2, defining a bit domain structure class: entering a bit domain structure class construction function, and automatically generating a complete bit domain class object by using a bit domain class object generating algorithm;
s3, defining a bit field class: inheriting the bit domain structure class, designating the bit domain single name and the bit domain single bit width, and defining a bit domain class by the extended implementation of the incoming bit domain mapping table BitMaps.
Further, the bitfield single structure class in the step S1 includes the following members:
the member name is used for designating a single name of the bit domain and is used as an attribute name of the bit domain class object;
the member fieldWidth is used for specifying bit number occupied by a bit field single item, namely bit field single item bit width;
the member value mask is a bit field single value mask and is used for correcting the bit field single value assignment bit width and preventing assignment overflow;
the member mask is a bit domain single item identification mask and is used for identifying that the bit domain single item occupies a bit region in the bit domain class complete value all;
the member shift is a bit field single bit offset value of the bit field single item relative to 0bit in the bit field class complete value all.
Further, the specific implementation method of the step S2 is as follows:
s21, initializing a bit field class complete value all to be 0;
s22, initializing temporary variables: initializing an accumulated bit offset value of 0, a bit field object maximum bit width length maxBitLen value of 32 and a bit field object maximum shaping value maxValue value of 0xffffffff;
s23, traversing the bit domain mapping table BitMaps, entering S24 if an unprocessed bit domain single item exists, otherwise, ending the traversal, generating a bit domain class object, and ending the algorithm;
s24, assigning the accumulated bit offset value offset to the single bit offset value shift of the current bit domain;
s25, the maximum shaping value maxValue of the bit field object is integrally moved to the right in an unsigned manner, the bit number obtained by subtracting the single bit width fieldWidth of the bit field from the maximum bit width length maxBitLen of the bit field object is obtained, and the overflow bit number is truncated to obtain a single bit value mask;
s26, integrally moving the bit field single value mask to the left by an accumulated bit offset value offset, then shifting the result to the right by 0bit in an unsigned way, and converting the result into unsigned shaping data to obtain a bit field single identification mask;
s27, accumulating the accumulated bit offset value offset to form a single bit width fieldWidth of the bit field, and updating a calculation result to the accumulated bit offset value offset for calculating and processing a single bit of the next bit field;
and S28, adding an attribute with an attribute name of a bit field single name to the bit field class, and returning to S23.
Further, the specific implementation method of S28 is as follows:
the method for setting the set by the rewriting attribute realizes that the bit field single value is set to the bit field area corresponding to the bit field type integral value all through setting the bit field type attribute value algorithm by combining the bit field type integral value all with bit field single information;
the get method for rewriting the attribute is realized by combining the whole value all of the bit domain class with the single information of the bit domain and obtaining the single value of the bit domain by an algorithm for obtaining the attribute value of the bit domain class.
The specific implementation method of the algorithm for setting the bit domain class attribute value comprises the following steps:
s2811, performing bit inversion operation on a bit field single item identification mask;
s2812, performing bit and operation on the output result of S2811 and a bit field class complete value all;
s2813, performing bit and operation on the input value and the bit field single value mask, and cutting off possible numerical digit overflow of the input value;
s2814, shifting the output value of S2813 leftwards by a bit field single bit offset value shift bit, and shifting the output result rightwards by 0bit unsigned to convert the result into unsigned data;
s2815, performing bit OR operation on the output result of S2812 and the output result of S2814, and assigning the result to the bit field class complete value all.
The specific implementation method of the algorithm for acquiring the bit domain class attribute value comprises the following steps:
s2821, performing bit and operation on the bit field class complete value all and the bit field single item identification mask to obtain a coded value which only retains bit field single item value information;
s2822, shifting the bit field single item bit offset value shift bit to the right in an unsigned manner by the result output in S2821, so as to extract the numerical value corresponding to the bit field single item.
The beneficial effects of the invention are as follows: the invention provides a definition grammar similar to a C/C++ language bit domain object structure, which only needs to designate bit domain single names (attribute names) and bit domain single bit widths in a JavaScript language, and the JavaScript bit domain object can be obtained by running the algorithm provided by the invention. The bit domain object is used in the JavaScript, so that the interface universality of cross-platform software can be greatly improved, the interface adaptation workload is reduced, the memory occupied by a program is reduced, and the software operation speed is improved.
Drawings
FIG. 1 is a flow chart of generating a bitfield class object in accordance with the present invention;
FIG. 2 is a schematic diagram of the present invention for assigning values to variable all by bit field single item and directly using whole values;
FIG. 3 is a schematic diagram of a bit-inverting operation of the bit field single item identification mask;
FIG. 4 is a schematic diagram illustrating the bit AND (≡) operation between the output result of S2811 and the complete value all of the bit field class;
FIG. 5 is a schematic diagram showing the operation of bit AND (& gt) of the input value and the bit field single value mask;
FIG. 6 is a diagram illustrating shifting the output value of S2813 to the left by a single bit offset value shift;
fig. 7 is a schematic diagram of performing bit or (|) operation on the output result of S2812 and the output result of S2814;
FIG. 8 is a schematic diagram showing the bit and (& gt) operation of the bit field class complete value all and the bit field single identification mask;
fig. 9 is a diagram illustrating shifting of the bit field single bit offset value shift to the right unsigned.
Detailed Description
One time bit domain object is defined in C/C++ by bit structure and association as follows. The four-byte space of one unsigned int is used, three information of year, month and day are saved in one 32-bit shaping data, and parameter information can be added by using reserved bits when a program is expanded without influencing the setting and reading of an old data format.
The key of using and expanding the bit domain object in the C/C++ is to define the bit domain name (year_, monta_, day_) and the occupied bit number of the designated bit domain, and the transmission of three parameters of year_, monta_, day_ can be realized by transmitting the shaping value all corresponding to the whole bit domain object by a third party.
Bit domain objects cannot be implemented in JavaScript languages using data definitions like C/c++ bit structures and complexes. The method and the algorithm defined by the invention can realize that only the bit domain name and the bit domain bit number are required to be specified as the C/C++, the bit domain structure definition can be automatically generated by generating the bit domain class object algorithm, the corresponding bit domain value can be set by setting the bit domain class attribute value algorithm, and the corresponding bit domain value can be obtained by obtaining the bit domain class attribute value algorithm.
The technical scheme of the invention is further described below with reference to the accompanying drawings.
A method for automatically generating a bit-domain object in JavaScript language, comprising the steps of:
s1, defining a bit domain single structure class (in the embodiment, the bit domain single structure class is BitItem): the bitfield single structure class includes the following members:
the member name is used for designating a single name of the bit domain and is used as an attribute name of the bit domain class object;
the member fieldWidth is used for specifying bit number occupied by a bit field single item, namely bit field single item bit width;
the member value mask is a bit field single value mask and is used for correcting the bit field single value assignment bit width and preventing assignment overflow;
the member mask is a bit domain single item identification mask and is used for identifying that the bit domain single item occupies a bit region in the bit domain class complete value all;
the member shift is a bit field single bit offset value of the bit field single item relative to 0bit in the bit field class complete value all.
The specific procedure is as follows:
s2, defining a bit domain structure class: entering a bit domain structure class construction function, and automatically generating a complete bit domain class object by using a bit domain class object generating algorithm; as shown in fig. 1, the specific implementation method is as follows:
s21, initializing a bit field class complete value all to be 0;
s22, initializing temporary variables: initializing an accumulated bit offset value of 0, a bit field object maximum bit width length maxBitLen value of 32 and a bit field object maximum shaping value maxValue value of 0xffffffff;
s23, traversing the bit domain mapping table BitMaps, entering S24 if an unprocessed bit domain single item exists, otherwise, ending the traversal, generating a bit domain class object, and ending the algorithm;
s24, assigning the accumulated bit offset value offset to the single bit offset value shift of the current bit domain;
s25, the maximum shaping value maxValue of the bit field object is integrally moved to the right in an unsigned manner, the bit number obtained by subtracting the single bit width fieldWidth of the bit field from the maximum bit width length maxBitLen of the bit field object is obtained, and the overflow bit number is truncated to obtain a single bit value mask;
s26, integrally moving the bit field single value mask to the left by an accumulated bit offset value offset, then shifting the result to the right by 0bit in an unsigned way, and converting the result into unsigned shaping data to obtain a bit field single identification mask;
s27, accumulating the accumulated bit offset value offset to form a single bit width fieldWidth of the bit field, and updating a calculation result to the accumulated bit offset value offset for calculating and processing a single bit of the next bit field;
and S28, adding an attribute with an attribute name of a bit field single name to the bit field class, and returning to S23.
The specific procedure of step S2 is as follows:
example use code:
let dateDemo＝new DateDemo()；
after the example DateDemo object is processed by the generated bit domain class object algorithm, bit domain single item internal information shown in the following table is obtained:
in particular, for a better demonstration bit operation process, the values mask and mask are converted into binary values as follows:
the specific implementation method of the step S28 is as follows:
the method for setting the set by the rewriting attribute realizes that the bit field single value is set to the bit field area corresponding to the bit field type integral value all through setting the bit field type attribute value algorithm by combining the bit field type integral value all with bit field single information;
the specific implementation method of the set bit domain class attribute value algorithm comprises the following steps: in an exemplary operation, the first behavior bit-field object assigns an initial value 20210601, and the bit-field object assigns the following:
dateDemo.year_＝2021；
dateDemo.month_＝6；
dateDemo.day_＝1；
or directly initializing variable all by directly using the complete value as follows:
dateDemo.all＝0x07E50601；
the result outputs of the two modes are identical, the same assignment effect can be obtained, and corresponding binary data are shown in fig. 2.
When the code datedemo.montath+=7 is used; when the month is modified to 7, the operation steps of the algorithm using the set bit domain class attribute value are as follows:
s2811, performing bit inversion (to) operation on a bit field single item identification mask; the original data and the inverted data in this embodiment are shown in fig. 3;
s2812, carrying out bit and (& gt) operation on the output result of S2811 and a bit field class complete value all, thereby clearing 0 a bit field area corresponding to a related bit field single value, as shown in fig. 4;
s2813, performing bit and (& gt) operation on the input value and the bit field single value mask, wherein the bit and (& gt) operation is used for intercepting possible numerical digit overflow of the input value, as shown in FIG. 5;
s2814, shifting the output value of S2813 leftwards by a bit field single bit offset value shift bit, and shifting the output result rightwards by 0bit unsigned, so as to convert the result into unsigned data, as shown in FIG. 6;
s2815, carrying out bit or (|) operation on the output result of S2812 and the output result of S2814, and assigning the result to the bit field type complete value all so as to update the bit field attribute value to the corresponding bit region of the bit field type complete value all. Hexadecimal data corresponding to the complete value all of the bit field class is expressed as 0x07E50701 and is used for expressing date 20210701, and the operation process of binary expression is shown in FIG. 7.
The get method for rewriting the attribute is realized by combining the whole value all of the bit domain class with the single information of the bit domain and obtaining the single value of the bit domain by an algorithm for obtaining the attribute value of the bit domain class. The specific implementation method of the algorithm for obtaining the bit domain class attribute value comprises the following steps:
s2821, performing bit and operation on the bit field class complete value all and the bit field single item identification mask to obtain a coded value which only retains bit field single item information, as shown in FIG. 8;
s2822, shifting the result output in S2821 to the right by the shift value shift of the single bit of the bit field unsigned, thereby extracting the value corresponding to the single bit of the bit field, as shown in FIG. 9, and the extracted result is the value 6.
S3, defining a bit field class: inheriting the bit domain structure class, designating the bit domain single name and the bit domain single bit width, and defining a bit domain class by the extended implementation of the incoming bit domain mapping table BitMaps.
The specific procedures are as follows:
the invention organizes the bit domain single item into a bit domain mapping table (BitMaps) through a JavaScript array form, and the bit domain mapping table is expressed as follows:
[
new BitItem('day_' ,5),
new BitItem('reserve_0_' ,3),
new BitItem('month_' ,4),
new BitItem('reserve_1_' ,4),
new BitItem('year_' ,16),
]
the bitfield mapping table (BitMaps) is submitted to the constructors of bitfield structure classes (BitFields) for use. In the construction function of the bitfield structure class (BitFields), the bitfield mapping table (BitMaps) is traversed, and a bitfield single bit offset value (shift), a bitfield single value mask (value mask) and a bitfield single identification mask (mask) are calculated in sequence by using a bitfield class object generating algorithm.
The algorithm is also suitable for the operation scene of less or more than 32-bit shaping data, namely the temporary variable maxBitLen with the maximum bit width of the bit field object and the temporary variable maxValue with the maximum shaping value of the bit field object can be flexibly defined according to actual conditions. The algorithm idea of the invention is not limited to be applied to JavaScript languages, other programming languages without native bitfield objects, but the programming languages supporting bitwise operation can also be applied to the algorithm to generate bitfield objects.
Those of ordinary skill in the art will recognize that the embodiments described herein are for the purpose of aiding the reader in understanding the principles of the present invention and should be understood that the scope of the invention is not limited to such specific statements and embodiments. Those of ordinary skill in the art can make various other specific modifications and combinations from the teachings of the present disclosure without departing from the spirit thereof, and such modifications and combinations remain within the scope of the present disclosure.
Claims (1)
1. A method for automatically generating a bit-domain object in JavaScript language, comprising the steps of:
s1, defining a single structure class of a bit domain; the bitfield single structure class includes the following members:
the member name is used for designating a single name of the bit domain and is used as an attribute name of the bit domain class object;
the member fieldWidth is used for specifying bit number occupied by a bit field single item, namely bit field single item bit width;
the member value mask is a bit field single value mask and is used for correcting the bit field single value assignment bit width and preventing assignment overflow;
the member mask is a bit domain single item identification mask and is used for identifying that the bit domain single item occupies a bit region in the bit domain class complete value all;
the member shift is a bit field single bit offset value of a bit field single item relative to 0bit in a bit field class complete value all;
s2, defining a bit domain structure class: entering a bit domain structure class construction function, and automatically generating a complete bit domain class object by using a bit domain class object generating algorithm; the specific implementation method comprises the following steps:
s21, initializing a bit field class complete value all to be 0;
s22, initializing temporary variables: initializing an accumulated bit offset value of 0, a bit field object maximum bit width length maxBitLen value of 32 and a bit field object maximum shaping value maxValue value of 0xffffffff;
s23, traversing the bit domain mapping table BitMaps, entering S24 if an unprocessed bit domain single item exists, otherwise, ending the traversal, generating a bit domain class object, and ending the algorithm;
s24, assigning the accumulated bit offset value offset to the single bit offset value shift of the current bit domain;
s25, the maximum shaping value maxValue of the bit field object is integrally moved to the right in an unsigned manner, the bit number obtained by subtracting the single bit width fieldWidth of the bit field from the maximum bit width length maxBitLen of the bit field object is obtained, and the overflow bit number is truncated to obtain a single bit value mask;
s26, integrally moving the bit field single value mask to the left by an accumulated bit offset value offset, then shifting the result to the right by 0bit in an unsigned way, and converting the result into unsigned shaping data to obtain a bit field single identification mask;
s27, accumulating the accumulated bit offset value offset to form a single bit width fieldWidth of the bit field, and updating a calculation result to the accumulated bit offset value offset for calculating and processing a single bit of the next bit field;
s28, adding an attribute with an attribute name of a bit field single name to the bit field class, and returning to S23; the specific implementation method comprises the following steps:
the method for setting the set by the rewriting attribute realizes that the bit field single value is set to the bit field area corresponding to the bit field type integral value all through setting the bit field type attribute value algorithm by combining the bit field type integral value all with bit field single information; the specific implementation method of the set bit domain class attribute value algorithm comprises the following steps:
s2811, performing bit inversion operation on a bit field single item identification mask;
s2812, performing bit and operation on the output result of S2811 and a bit field class complete value all;
s2813, performing bit and operation on the input value and the bit field single value mask, and cutting off possible numerical digit overflow of the input value;
s2814, shifting the output value of S2813 leftwards by a bit field single bit offset value shift bit, and shifting the output result rightwards by 0bit unsigned to convert the result into unsigned data;
s2815, performing bit OR operation on the output result of S2812 and the output result of S2814, and assigning the result to a bit field class complete value all;
the get method is realized through the complete value all of the bit domain class and the single information of the bit domain, and the single value of the bit domain is obtained through the attribute value algorithm of the bit domain class; the specific implementation method of the algorithm for obtaining the bit domain class attribute value comprises the following steps:
s2821, performing bit and operation on the bit field class complete value all and the bit field single item identification mask to obtain a coded value which only retains bit field single item value information;
s2822, shifting the bit field single item bit offset value shift bit to the right in an unsigned manner by the result output in the S2821, so as to extract the numerical value corresponding to the bit field single item;
s3, defining a bit field class: inheriting the bit domain structure class, designating the bit domain single name and the bit domain single bit width, and defining a bit domain class by the extended implementation of the incoming bit domain mapping table BitMaps.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110906597.6A CN113590136B (en) | 2021-08-09 | 2021-08-09 | Method for automatically generating bit domain object in JavaScript language |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110906597.6A CN113590136B (en) | 2021-08-09 | 2021-08-09 | Method for automatically generating bit domain object in JavaScript language |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113590136A CN113590136A (en) | 2021-11-02 |
| CN113590136B true CN113590136B (en) | 2024-02-27 |
Family
ID=78256178
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110906597.6A Active CN113590136B (en) | 2021-08-09 | 2021-08-09 | Method for automatically generating bit domain object in JavaScript language |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113590136B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6378127B1 (en) * | 1998-09-21 | 2002-04-23 | Microsoft Corporation | Software installation and validation using custom actions |
| CN101222365A (en) * | 2008-01-23 | 2008-07-16 | 中兴通讯股份有限公司 | Similar C structure interface packet processing method |
| CN102929682A (en) * | 2012-12-06 | 2013-02-13 | 盛科网络（苏州）有限公司 | Preprocessing method and device for automatically extending TCL (Tool Command Language) |
| CN103338219A (en) * | 2013-05-15 | 2013-10-02 | 北京奇虎科技有限公司 | Terminal device performance evaluation information acquisition and processing method, and corresponding device and processing system thereof |
| CN106126486A (en) * | 2016-06-30 | 2016-11-16 | 童晓冲 | Temporal information coded method, encoded radio search method, coding/decoding method and device |
| CN111381826A (en) * | 2018-12-29 | 2020-07-07 | 北京奇虎科技有限公司 | Method and device for generating syntax tree of code file and electronic equipment |
| CN112114792A (en) * | 2020-09-14 | 2020-12-22 | 中国船舶重工集团公司第七0九研究所 | Code generation method and system for converting universal C/C + + structured object into JSON object |
| CN113157254A (en) * | 2021-02-20 | 2021-07-23 | 井芯微电子技术(天津)有限公司 | Programmable hardware logic architecture realized based on P4 language and logic realization method |
-
2021
- 2021-08-09 CN CN202110906597.6A patent/CN113590136B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6378127B1 (en) * | 1998-09-21 | 2002-04-23 | Microsoft Corporation | Software installation and validation using custom actions |
| CN101222365A (en) * | 2008-01-23 | 2008-07-16 | 中兴通讯股份有限公司 | Similar C structure interface packet processing method |
| CN102929682A (en) * | 2012-12-06 | 2013-02-13 | 盛科网络（苏州）有限公司 | Preprocessing method and device for automatically extending TCL (Tool Command Language) |
| CN103338219A (en) * | 2013-05-15 | 2013-10-02 | 北京奇虎科技有限公司 | Terminal device performance evaluation information acquisition and processing method, and corresponding device and processing system thereof |
| CN106126486A (en) * | 2016-06-30 | 2016-11-16 | 童晓冲 | Temporal information coded method, encoded radio search method, coding/decoding method and device |
| CN111381826A (en) * | 2018-12-29 | 2020-07-07 | 北京奇虎科技有限公司 | Method and device for generating syntax tree of code file and electronic equipment |
| CN112114792A (en) * | 2020-09-14 | 2020-12-22 | 中国船舶重工集团公司第七0九研究所 | Code generation method and system for converting universal C/C + + structured object into JSON object |
| CN113157254A (en) * | 2021-02-20 | 2021-07-23 | 井芯微电子技术(天津)有限公司 | Programmable hardware logic architecture realized based on P4 language and logic realization method |
Non-Patent Citations (2)
| Title |
|---|
| A Configuration-Based Method For Conversion Between Binary Structure Data And JSON;Huakai Zhao等;《2019 IEEE 4th Advanced Information Technology, Electronic and Automation Control Conference (IAEAC)》;第2329 - 2332页 * |
| 基于Node.js的AIS通信服务器设计;姜峰;《cnki优秀硕士学位论文全文库 工程科技Ⅱ辑》(第03期);第C036-219页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113590136A (en) | 2021-11-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113806403B (en) | Method for reducing search matching logic resources in intelligent network card/DPU | |
| WO2020232569A1 (en) | Database access layer representation method and device | |
| CN105512324A (en) | Front end module loader for partial renewal of package file | |
| JPH032932A (en) | Rank deciding method for class of object pointing language and method deciding method applying the deciding method | |
| CN113590136B (en) | Method for automatically generating bit domain object in JavaScript language | |
| CN112286575A (en) | Intelligent contract similarity detection method and system based on graph matching model | |
| CN105591915A (en) | Maintenance method and apparatus of routing table | |
| US5301260A (en) | Inference processor using data consistency holder | |
| CN109491660B (en) | Locomotive event data dynamic analysis method | |
| CN115576603B (en) | Method and device for acquiring variable values in code segment | |
| CN111428441B (en) | Information system cross-platform application oriented Chinese character code conversion method and equipment | |
| CN108647338B (en) | bitmap calculation method, device, equipment and storage medium | |
| US20230409869A1 (en) | Process for transforming a trained artificial neuron network | |
| DE69819543D1 (en) | METHOD AND DEVICE FOR PROCESSING A REQUEST ACCORDING TO A BOOLE CONTROL | |
| JP2609820B2 (en) | Program management method | |
| CN116841622B (en) | Address self-increasing memory instruction generation method, device, equipment and medium | |
| US20170249196A1 (en) | Interacting with a source object via a virtual object | |
| JPH04100324A (en) | Decoding system for variable length code | |
| CN116009994A (en) | Function block calling method, device, equipment and medium of industrial control configuration software | |
| CN114676289A (en) | Processing method, device, terminal and storage medium of prefix tree | |
| US20190356585A1 (en) | Control system and path information generating method | |
| CN115438653A (en) | Telemetry data analysis expression repeated calculation method and system | |
| JPS6134620A (en) | Inputting method to computer | |
| CN116796289A (en) | Operator processing method and device, electronic equipment and storage medium | |
| CN116450490A (en) | Conditional statement value determining method, device and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |