Free line software for linux

Convert::Wiki::Node::Line is a Perl module that represents a horizontal line (aka ruler).

SYNOPSIS

use Convert::Wiki::Node::Line;

my $hr = Convert::Wiki::Node::Line->new( );

print $hr->as_wiki();

A Convert::Wiki::Node::Line represents a horizontal line (aka ruler).

App::SimpleScan::Substitution::Line is a line with optional fixed variable values.

SYNOPSIS

my $line =
App::SimpleScan::Substitution::Line->new(" this ");

# Use only this value when substituting " ".
$line->fix(substituite => change);

# what vars are fixed?
my @fixed_ones = $line->fixed();

# Forget about now.
$line->unfix(substitute);

# Forget all fixed variables.
$line->no_fixed

# Get the line back as a string.
print "$line";

App::SimpleScan::Substitution::Line allows us to associate fixed substitution values with a specific string. This allows us to re-substituted the same value if, during string substitution, we find the variable reappearing as the result of substituting some other variable. This eliminates the "cross-product" bug that appeared in some complex nest substitions.

Approximator Line is an application which allows to synthesize approximation function of one argument. Both coordinates of known points or mathematical expression can be used as input data.
The application uses evolutionary algorithm which allows to find more optimal results. The enhanced evolutionary algorithm allows to avoid long-time hitting to local maximum.
In few hours the application can evaluate milliards of combinations with using of reasonable number of input data points and on contemporary computer. Approximator Line uses multithreading that can help to utilize maximum computation power.
Approximator Lines primary goal is to search of function, which value, most come nearer to the initial data. The preference is given the smallest functions. The weight of this preference is established in options of synthesis.
Search of function is made by the next way:
The random mathematical variant is under construction. Its fitness to the data is calculated. Further the variant is copied and changes. Fitness of the changed variant is calculated. If it is more, the new variant becomes base. It is simplified.
Key parameter of the found function is fitness of its set goal. Fitness is expressed in percentage. Its value depends on a way of the assignment of fitness of a point (it is established in parameters of synthesis). The program uses two basic such as fitness:
General fitness
Calculates on the general points.
Additional fitness
Calculates on general and additional points. It is used for more exact definition of fitness. It also is used for avoidance of a finding of such functions which correspond to the basic points, but in an interval between them strongly differ.
Additional fitness is used for a finding of the most corresponding functions at smaller amount of computing expenses as it calculates only if the basic fitness more than at the previous variant. Besides each of the mentioned above fitness can be normal or effective.
Normal fitness
Fitness in view of amount of elements of expression.
Effective fitness
Fitness without taking into account amount of elements of expression.
In the list of results normal additional conformity and effective additional conformity is accordingly displayed.
By search of the most suitable variant, or in other words synthesis cancelation constant subexprassions is made also.
Synthesis is based on use of random numbers. Functions making expression, operators variables and numbers get out randomly. The application is optimized on speed. So synthesized function in memory represents a tree of mathematical objects. Values of function are calculates by the most effective way. The mutation also is made above a tree of objects.
Usage:
- Determine the form of the input data (coordinates or expression).
- Choose points of your graph. Synthesis will be estimated on them.
- Enter coordinates of points (use autonumbering for simplification of input) or expression.
- Determine a range of value of function, amount of the basic points, amount of additional points.
- Open parameters of synthesis and adjust if it is necessary.
- Save the project.
- Press Start of synthesis.
- Pass to results and see on them.
- Leave the application working on long time.
- Periodically check results. When the application will find, in your opinion, suitable function, press Stop and save results.

Command Line WRAPper is a tool that provides an easy way to build and run commands from input lines, avoiding the use of shell script. It is similar to xargs.

clwrap can make great things with the locate command, and is low resource intensive. It can also do some not-quite-fun works like multiple configure/make/make install after a fresh system installation. In practice, you have to generate a list of files/directories you want to manage, clwrap takes it in standard input and apply the command you want to apply for each files (lines) in input.

But you can do much more, in fact, its up to you to find how to use it ;).

examples:

- copying several files into one specific directory:

locate myfiles | clwrap -e cp {} mydir/

- renaming several files:

ls -1 ultra*
| clwrap -e "echo -n mv -v {}" -e "echo {} | sed s/ultra/ /"
| clwrap -e {}

- running a specific line in the shell history:

history | grep "482" | head -n 1 | sed s/ *[0-9]* *// | clwrap -v -e {}


- try all tv norms and frequency tables possible combinations with scantv:

cat norm
| clwrap -e "cat freq | clwrap -e echo scantv -n {} -f {}"
| clwrap -e {} > file 2>&1

- reformat source code, after a backup of course:

ls -1 | clwrap -e "cp {} {}.orig && flip -u {} && cat {}
| sed s/^[ t]*$//;/^$/d
| indent -kr -bad -bap -bbb -sob -i8 -l100 {} -o {}.tmp
&& mv {} tmp && mv {}.tmp {}"

Command Line calculator "CLC" is the calculator that can calculate direct at the Linux console.

Extract the CLCC file to /usr/bin you might need to login as root or equvalent account, to be able to access it whenever you need it.

Then just write CLCC 67+89 and the answer will be presented to you directly.

CLCC calculates from left to right with no exceptions. CLC also have some extra parameters that is sent to CLC using backslash parameters.

CLCC r2 10/3 this will round the result to 2 decimals you can use 1 to 9 if you want to round the sum of.

the r parameter can also be combined with the other parameters but it must be added first like this

CLCC r3c 10/3 - to get 10 diveded with 3 rounded down to 3 decimals.

CLCC is tested with Ubuntu 6.10 and Puppy OS 2.13 but should work with any Linux version in console mode.

The program is developed using Hotbasic for Linux and is Freeware, hope you find it useful, send and email if you have any questions.

Hotbasic is a basic language that compiles into assembler direct, no interpeter that slows down the code, just pure assembler.

So if you want assembler in Linux but doesnt want to code in nasm, HotBasic is the compiler for you.

Command Line Content Management System is my own command line content management system. Its not a dynamic cms, but a script that takes a source tree and creates a web site out of it.
The idea came to me when i was using m4 for my website to generate the HTML, but i did not like the idea that i was still typing HTML in my pages, even if it was simplified by using macros. I was updating a wiki page somewhere when it hit me: i wanted a command line system that was able to take wiki style input for page content. The result is clcms.
Its in beta state at the moment, mostly to try out some different approaches to various
challenges. But i thought id share it now, so if youre interested and might have some ideas on where to go from here, drop me a line (or a patch). At least it can build this site and the tutorial site, but anything more fancy will probably not work.
Its also a way for me to learn Python, so i might in my ignorance produce some weird constructs here and there. Please let me know, but be gentle.
Main features:
- Updates should be possible with a terminal and an editor
- Content is stored in a directory tree
- Adding pages (or items?) should be as easy as creating a new file and typing some lines in it.
- For default pages/items no config necessary
- No HTML, XML or anything alike for normal usage
- All pages have their binary content (images, download files) in the directory of the page itself
- All output is static, no generating on the fly
Usage:
After untarring the tarball, add < dir>/bin to your path or copy bin/clcms.py to a directory in your path.
You can now go to < dir>/examples/documentation and build the tutorial by running
clcms.py
Now wasnt that easy?
Point your browser to file://< dir>/examples/documentation/out/index.html and see the result of all your hard work.
If it did not work, its not your fault. Just remember that version number.
Enhancements:
- .page files can now contain content attributes.
- Filename extensions are removed and replaced by attribute lines in .page files.
- The page.meta file should now be called page.attr.
- The nomenu option had disappeared in a previous release, and has been put back.