C/C++ Program Perfometer checks the performance of a C/C++ program and separate pieces of code for any metrics (e.g. uclocks, rusage metrics, metrics defined by the user, etc.). The measurement results are represented in detailed/summary reports. The detailed report has results for individual tests, and the summary one has average cost and its analysis. The comparison results are represented in comparative tables for individual comparison groups. The user may set various parameters in order to control the measurement/comparison process: measurement report and detailed measurement report flags, total iteration and tests, measurement scale, and confidence threshold.
n-ary Huffman Template Algorithm allows any kind of weights (costs, frequencies), including non-numerical ones. The {0, 1, ..., n-1} alphabet is used to encode messages. The built tree is an n-ary one. The algorithm is based on a set of template classes: Cell(SYMBOL, WEIGHT), Node(SYMBOL, WEIGHT), InternalNode (SYMBOL, WEIGHT), TerminalNode(SYMBOL, WEIGHT), BasicHuffmanTree(SYMBOL, WEIGHT, ARY), LoadedHuffmanTree(SYMBOL, WEIGHT, ARITY), and DriedHuffmanTree(WEIGHT, ARITY).
Turing Machine (C++ Implementation) is a Turing machine simulation that is defined by a series of input files. These include a metafile containing data related to some Turing machine, a states file containing a list of initial, halting, and internal states, an alphabet file of empty, input, and internal symbols, a transition file of transition rules, and input word files, which detail the input given on a tape.
Re: Reverse planned ? > Do you plan to write a C++ compiler on > your Turing machine ? :-) No, I don't.