30 results about "Assignment" patented technology

Certain currently popular programming languages (such as C++) are highly efficient but can easily bring about memory errors, and certain currently popular programming languages (such as Java) are safe in memories but lower in efficiency. The invention discloses an object-based programming method and an object-based programming system in C language programming, and the system is a convenient, safe and high-efficiency programming framework. The system utilizes the stack technique to efficiently judge the attribute of an 'object' (i.e. a non-generic type variable), also standardizes assignment and other operations on the object, and can release object resources and optimize the efficiency of object usage (or the efficiency of parameter transfer) simultaneously. The system provides defining templates for objects and object-operating functions, so that programmers can conveniently define the objects and the object-operating functions, the objects and functions defined by the defining templates can be conveniently subjected to recursionrecur and can be conveniently nested, invoked and operated in any other complex ways like generic type variables and functions, and the problems of memory safety and efficiency are automatically processed by the templates.

The embodiment of the invention relates to a condition compiling implementation method and device, equipment and a storage medium, and the method comprises the steps: compiling a Dart code of a project, obtaining the information of an import condition in an import statement when the import statement used for importing a non-local library file is compiled, and obtaining the information of the import condition in the import statement; searching the assignment of the import condition from the pre-obtained assignment of the condition in the Dart code, and when the assignment of the import condition meets the preset condition, importing the non-local library file pointed when the assignment of the import condition meets the preset condition into the Dart code for compiling, so that the condition compiling based on the Dart programming language is realized. According to the method, the non-local library file can be imported for compiling in Dart compiling, so that the flexibility of Dart programming is improved, and the limitation of Dart technology application is reduced.

The invention discloses a method and a system for customizing variables in batches. The method comprises the following steps: establishing an assignment table, importing case information into the assignment table, setting case names as line query indexes, and setting variable names of to-be-customized variables at the top end of the assignment table; analyzing the parameter names of the introducedcase information, positioning table tabs of the case information, and finding out case positions of to-be-customized variables; searching a parameter value which is the same as the line query index,taking a line of the parameter value as a test data line, and enabling variable values of the test data line to respectively correspond to variable names at the top end of the assignment table; and executing self-defined variables on the test data line, and circularly assigning all variable values of the test data line to variable names at the top end of the assignment table. According to the embodiment of the invention, the data separation of the test data and the automatic script is realized, the variable names can be quickly subjected to batch parameterized assignment, and the efficiency ofcustom variable assignment is remarkably improved.

The invention discloses a method for realizing definite software operating time in a single task operating environment, which is characterized by comprising the following steps of: (1) programming a function meeting requirements by using a conventional programming method; (2) dividing external input, external output and algorithm of the function definitely; (3) establishing a local variable for the external output; (4) finding out all switch statements in the function; (5) establishing local variables for the external output of all the switch statements; (6) cutting the programs of all the switch statements out of the switch statements, and modifying the output of the switch statements into the local variables of the output of the switch statements; (7) in the switch statements, adding the local variables of the output of the switch statements to an assignment statement output by a switch statement operation result and an assignment statement for a global variable; (8) adding the switch statement operation result to follow-up program operation; (9) assigning the local variable of the external output to the external output; and finally (10) modifying functions called in the program. The invention can ensure that the operating time of the same function is definite without change when outputs and routes are different.

The invention discloses an inter-object conversion and assignment method and device, and relates to the technical field of computer technologies. A specific embodiment of the method comprises the steps of adding annotations to fields of a source object according to a user-defined annotation class; and according to the annotation, assigning the value of the field of the source object to the field of the target object. According to the embodiment, the technical problems that in the prior art, the code amount of conversion and assignment between objects is large, the coupling degree is high, anduniversality is not achieved are solved, and the technical effects that conversion and assignment between objects are more convenient, and the universality of conversion and assignment is greatly improved are achieved.

An extracting unit randomly extracts a block from among the blocks of instruction strings constituting the byte code of a first program and, at the time of execution of the first program, extracts the blocks which are invariably executed before the randomly-extracted block. A dividing unit randomly divides, into a plurality of blocks, the instruction strings constituting the byte code of a second program which enables detection of tampering of the first program. An inserting unit inserts the plurality of blocks, which are obtained by division by the dividing unit, at different positions in the block extracted by the extracting unit, while maintaining the execution sequence written in the second program.

Method, program and system for code optimization. The method includes detecting a sign assignment instruction having an input operand and an output operand identical in size to each other. Analyzing and determining whether a value of the input operand results from an add or subtract operation and if the value is greater than the value prior to the operation. If so then removing the sign assignment instruction on the condition that the input operand and the output operand of the sign assignment instruction have their addresses identical to each other and replacing the sign assignment instruction with a copy instruction for copying the value of the input operand of the sign assignment instruction to a value of the output operand on the condition that the addresses of the input operand and the output operand of the sign assignment instruction are not identical and do not overlap each other.

The invention discloses a variable element assignment sequence and assignment optimization algorithm and a Boolean satisfiability verification algorithm. According to the assignment sequence optimization algorithm for the branch heuristic variables, at least one variable determines an assignment sequence by adopting the following steps: taking a current variable to be assigned as a current variable; searching for associated variables appearing in the same clause with the current variable at the same time; accumulating the number of times that the associated variable and the current variable appear in the same clause at the same time; and selecting the associated variable with the least number of times as a to-be-assigned variable after the current variable. According to the invention, the calculation time of the branch heuristic algorithm can be shortened.

The invention is applied to the field of artificial intelligence, relates to the field of block chains, and discloses a project code automatic optimization method and device, computer equipment and astorage medium. The method comprises the steps of determining a to-be-converted project, wherein a deconstruction assignment conversion tool is installed in the to-be-converted project, and obtaininga configuration file, wherein the configuration file comprises a root directory address of the to-be-converted project, determining whether the to-be-converted project supports a target optimization grammar, if the to-be-converted project supports the target optimization grammar, reading the root directory address in the configuration file through a deconstruction assignment conversion tool, and determining a to-be-deconstructed assignment file according to the root directory address, performing deconstruction assignment conversion on the to-be-deconstructed assignment file through a deconstruction assignment conversion tool so as to optimize the to-be-converted project. According to the method, a user can convert the to-be-deconstructed assignment file through the deconstruction assignment conversion tool without knowing the deconstruction assignment grammar of the ES6, so that automatic optimization of project codes is realized, and the project optimization efficiency is improved.

The invention discloses a method for automatically synthesizing commonly-used cyclic abstracts and generating program specifications. The method comprises the steps of 1, generating an abstract syntax tree of a program to be verified; 2, analyzing the abstract syntax tree generated in the step 1 to generate an abstract of program statements; 3, analyzing the abstract generated in the step 2 to generate specifications of the program statements; 4, performing verification on the specifications generated in the step 3, and therefore proving the characters of the program to be verified in an assistant mode. Cyclic statements of the operation commonly-used data structure are converted into a series of abstract assignment statements, the cyclic statements are effectively extracted, and the cyclic statements can be analyzed by means of an assignment language analysis method. The program characters, particularly the relationship between the program states before and after program execution, are effectively described according to the program specifications generated by the statement abstract, the specifications effectively assist the program verification process, the automatic degree and efficiency of program verification are improved, and burdens of verification workers are relieved.

The invention relates to a programming method of CAN-LonWorks protocol conversion logic. The method includes: defining operators and the priority of each operator; defining the only digital code corresponding to each protocol variable; using operation number and the operators to compile the explicit assignment expression of each protocol variable according to CAN-LonWorks protocol conversion requirements and through operator rules; performing compression conversion on the explicit assignment expressions to encode the explicit assignment expressions into implicit assignment expressions; inspecting the implicit assignment expressions, determining that the inspection is passed if the implicit assignment expressions are correctly analyzed, and adding ending tags 'END' to the tails of the assignment expressions. The programming method programs the conversion logic according to needs to adapt to different application occasions.