Free prime software for linux

Prime Mover is a build tool, not unlike make. It is designed to be small, portable, flexible, powerful, and is very easy to deploy.
Prime Mover can be distributed along with your application source code and does not require your end user to have anything other than a basic C compiler in order to use it.
Main features:
- Automatic dependency checking for C-like files
- Explicit dependency graphs
- Arbitrarily complex rules (its possible to clearly represent far more complex dependency graphs in pm than you can in make)
- Can handle multiple directories at the same time (no more recursive makefiles!)
- Highly scalable (pm can deal with very large builds as easily as very small ones)
- Easy cross-compilation (object files are stored in pms own object file cache, not in your build tree, so you dont have to worry about distinguishing them)
- Build multiple versions of the same application (pm remembers the compiler options used to build every file, and can tell different versions of the same object file apart)
- Easy deployment (all of pms core code consists of exactly file, which can be run on nearly any platform --- no installation or compilation needed!)
- Object oriented design (making it very easy to create your own rules by specialising one of the existing ones)
- A true programming language (if you need it, all the power of the Lua programming language is at your fingertips)
pm differs from make primarily in that all dependencies in pm are explicit. make will attempt to determine what needs to be done to build a file, based on a set of rules that tell it how to transform file types. This works well until you need to have different rules apply to two files of the same type... which then causes make to quickly become unmanageable.
pm avoids this by requiring all rules to be explicit. Thanks to the power of syntactic sugar, it is much less work than it sounds, never fear.
The best explanation is an example, and so here is an example pmfile that will build a simple C program:
-- load the C rules
include "c.pm"
-- default target builds a C program
default = cprogram {
-- cfile transforms a C source file into an object file
cfile "main.c",
cfile "utils.c",
cfile "aux.c",
-- once built, this makes the result available
install = pm.install("myprogram")
}
If this is saved as "pmfile" in the current directory, it can be invoked by simply doing:
./pm
...and it will run.
Enhancements:
- This is a bugfix release that corrects a few niggling issues with {PARENT, ...}, {REDIRECT, ...}, and improving portability.

GTP server simulator is a simple responder for the GTP (GTP prime) protocol that works with the Cisco Content Services Gateway to provide per-user traffic limits.

GTP` (GTP prime) server simulator (it permits any content and provide quadrants for every operation) binaries for Linux (run under Fedora Core 4 and 5).

The binary was tested with Cisco CSG.

GNoise is a wave file editor for Linux. Prime considerations were for it to be speedy and be able to handle big files. So far it can: load and display files, generate a display cache, play the file, cut, copy, paste, (unlimited) undo, mute, fade in/out, reverse, normalize, and more.
The primary design objectives are stability, speed, and the ability to handle big files (i.e. 70MB ripped CD tracks) easily. In fact GNoise is known to work with >500MB files although the author doesnt happen to have any wave files that size laying about.
See the TODO list for things Im considering adding/fixing in the near future. Feel free to send me patches or email, especially for any bugs you encounter.
The custom gtk widgets within GNoise support setting colors through the normal gtkrc mechanisms, there is a sample gtkrc file included, just drop it in ~/.gnoise and edit it to your likings.
Note that GNoise is a destructive editor: all editing operates directly on the soundfile, work on a copy of something you really dont want to lose. Note also that you should not mix the use of the disable undo option on different edits within an editing session (ie. if you start editing a file with undo disabled then leave undos disabled until you close the file, at which point you can turn undo on and re-open the file if you wish to edit with undo capability).
Enhancements:
- Finally did the markers/cue points. Add/delete markers that are saved in a standard cue chunk inside the wave file.

MultiGate is a multi-function security gateway (firewall). Built on Linux and Open Source components, it provides an easy and integrated solution designed to secure and protect networks. MultiGate contains SecurityPlugins that allow quick installation, configuration and operation of various Open Source security modules designed to enhance security and protection capabilities of the gateway.

Built on Linux and other Open Source components, it provides an easy and integrated solution designed to secure and protect networks. Developed in Java, the web server and controlling services provide all installation, configuration and administration functions for the system. The system has been developed with is prime focus being "Ease of Use" for the novice user. Majority of Open Source firewalls are complex to configure and daunting for the first-time user. MultiGate contains many wizards and simplified interface to get the user up and running securely in a short period of time. Advanced users can enable advanced options to allow a better setup of settings and configuration.

MultiGate includes SecurityPlugins that allow quick installation, configuration and operation of various Open Source security modules designed to enhance security and protection capabilities of the gateway. Built on a pluggable framework, extra components can be added or removed to accommodate the exact security requirements needed by the user.

Bit::Vector is an efficient bit vector, set of integers and "big int" math library.

CLASS METHODS

Version

$version = Bit::Vector->Version();

Word_Bits
$bits = Bit::Vector->Word_Bits(); # bits in a machine word

Long_Bits
$bits = Bit::Vector->Long_Bits(); # bits in an unsigned long

new
$vector = Bit::Vector->new($bits); # bit vector constructor

@veclist = Bit::Vector->new($bits,$count);

new_Hex
$vector = Bit::Vector->new_Hex($bits,$string);

new_Bin
$vector = Bit::Vector->new_Bin($bits,$string);

new_Dec
$vector = Bit::Vector->new_Dec($bits,$string);

new_Enum
$vector = Bit::Vector->new_Enum($bits,$string);

Concat_List
$vector = Bit::Vector->Concat_List(@vectors);
OBJECT METHODS
new
$vec2 = $vec1->new($bits); # alternative call of constructor

@veclist = $vec->new($bits,$count);

Shadow
$vec2 = $vec1->Shadow(); # new vector, same size but empty

Clone
$vec2 = $vec1->Clone(); # new vector, exact duplicate

Concat
$vector = $vec1->Concat($vec2);

Concat_List
$vector = $vec1->Concat_List($vec2,$vec3,...);

Size
$bits = $vector->Size();

Resize
$vector->Resize($bits);
$vector->Resize($vector->Size()+5);
$vector->Resize($vector->Size()-5);

Copy
$vec2->Copy($vec1);

Empty
$vector->Empty();

Fill
$vector->Fill();

Flip
$vector->Flip();

Primes
$vector->Primes(); # Sieve of Erathostenes

Reverse
$vec2->Reverse($vec1);

Interval_Empty
$vector->Interval_Empty($min,$max);

Interval_Fill
$vector->Interval_Fill($min,$max);

Interval_Flip
$vector->Interval_Flip($min,$max);

Interval_Reverse
$vector->Interval_Reverse($min,$max);

Interval_Scan_inc
if (($min,$max) = $vector->Interval_Scan_inc($start))

Interval_Scan_dec
if (($min,$max) = $vector->Interval_Scan_dec($start))

Interval_Copy
$vec2->Interval_Copy($vec1,$offset2,$offset1,$length);

Interval_Substitute
$vec2->Interval_Substitute($vec1,$off2,$len2,$off1,$len1);

is_empty
if ($vector->is_empty())

is_full
if ($vector->is_full())

equal
if ($vec1->equal($vec2))

Lexicompare (unsigned)
if ($vec1->Lexicompare($vec2) == 0)
if ($vec1->Lexicompare($vec2) != 0)
if ($vec1->Lexicompare($vec2) < 0)
if ($vec1->Lexicompare($vec2) Lexicompare($vec2) > 0)
if ($vec1->Lexicompare($vec2) >= 0)

Compare (signed)
if ($vec1->Compare($vec2) == 0)
if ($vec1->Compare($vec2) != 0)
if ($vec1->Compare($vec2) < 0)
if ($vec1->Compare($vec2) Compare($vec2) > 0)
if ($vec1->Compare($vec2) >= 0)

to_Hex
$string = $vector->to_Hex();

from_Hex
$vector->from_Hex($string);

to_Bin
$string = $vector->to_Bin();

from_Bin
$vector->from_Bin($string);

to_Dec
$string = $vector->to_Dec();

from_Dec
$vector->from_Dec($string);

to_Enum
$string = $vector->to_Enum(); # e.g. "2,3,5-7,11,13-19"

from_Enum
$vector->from_Enum($string);

Bit_Off
$vector->Bit_Off($index);

Bit_On
$vector->Bit_On($index);

bit_flip
$bit = $vector->bit_flip($index);

bit_test
contains
$bit = $vector->bit_test($index);
$bit = $vector->contains($index);
if ($vector->bit_test($index))
if ($vector->contains($index))

Bit_Copy
$vector->Bit_Copy($index,$bit);

LSB (least significant bit)
$vector->LSB($bit);

MSB (most significant bit)
$vector->MSB($bit);

lsb (least significant bit)
$bit = $vector->lsb();

msb (most significant bit)
$bit = $vector->msb();

rotate_left
$carry = $vector->rotate_left();

rotate_right
$carry = $vector->rotate_right();

shift_left
$carry = $vector->shift_left($carry);

shift_right
$carry = $vector->shift_right($carry);

Move_Left
$vector->Move_Left($bits); # shift left "$bits" positions

Move_Right
$vector->Move_Right($bits); # shift right "$bits" positions

Insert
$vector->Insert($offset,$bits);

Delete
$vector->Delete($offset,$bits);

increment
$carry = $vector->increment();

decrement
$carry = $vector->decrement();

inc
$overflow = $vec2->inc($vec1);

dec
$overflow = $vec2->dec($vec1);

add
$carry = $vec3->add($vec1,$vec2,$carry);
($carry,$overflow) = $vec3->add($vec1,$vec2,$carry);

subtract
$carry = $vec3->subtract($vec1,$vec2,$carry);
($carry,$overflow) = $vec3->subtract($vec1,$vec2,$carry);

Neg
Negate
$vec2->Neg($vec1);
$vec2->Negate($vec1);

Abs
Absolute
$vec2->Abs($vec1);
$vec2->Absolute($vec1);

Sign
if ($vector->Sign() == 0)
if ($vector->Sign() != 0)
if ($vector->Sign() < 0)
if ($vector->Sign() Sign() > 0)
if ($vector->Sign() >= 0)

Multiply
$vec3->Multiply($vec1,$vec2);

Divide
$quot->Divide($vec1,$vec2,$rest);

GCD (Greatest Common Divisor)
$vecgcd->GCD($veca,$vecb);
$vecgcd->GCD($vecx,$vecy,$veca,$vecb);

Power
$vec3->Power($vec1,$vec2);

Block_Store
$vector->Block_Store($buffer);

Block_Read
$buffer = $vector->Block_Read();

Word_Size
$size = $vector->Word_Size(); # number of words in "$vector"

Word_Store
$vector->Word_Store($offset,$word);

Word_Read
$word = $vector->Word_Read($offset);

Word_List_Store
$vector->Word_List_Store(@words);

Word_List_Read
@words = $vector->Word_List_Read();

Word_Insert
$vector->Word_Insert($offset,$count);

Word_Delete
$vector->Word_Delete($offset,$count);

Chunk_Store
$vector->Chunk_Store($chunksize,$offset,$chunk);

Chunk_Read
$chunk = $vector->Chunk_Read($chunksize,$offset);

Chunk_List_Store
$vector->Chunk_List_Store($chunksize,@chunks);

Chunk_List_Read
@chunks = $vector->Chunk_List_Read($chunksize);

Index_List_Remove
$vector->Index_List_Remove(@indices);

Index_List_Store
$vector->Index_List_Store(@indices);

Index_List_Read
@indices = $vector->Index_List_Read();

Or
Union
$vec3->Or($vec1,$vec2);
$set3->Union($set1,$set2);

And
Intersection
$vec3->And($vec1,$vec2);
$set3->Intersection($set1,$set2);

AndNot
Difference
$vec3->AndNot($vec1,$vec2);
$set3->Difference($set1,$set2);

Xor
ExclusiveOr
$vec3->Xor($vec1,$vec2);
$set3->ExclusiveOr($set1,$set2);

Not
Complement
$vec2->Not($vec1);
$set2->Complement($set1);

subset
if ($set1->subset($set2)) # true if $set1 is subset of $set2

Norm
$norm = $set->Norm();
$norm = $set->Norm2();
$norm = $set->Norm3();

Min
$min = $set->Min();

Max
$max = $set->Max();

Multiplication
$matrix3->Multiplication($rows3,$cols3,
$matrix1,$rows1,$cols1,
$matrix2,$rows2,$cols2);

Product
$matrix3->Product($rows3,$cols3,
$matrix1,$rows1,$cols1,
$matrix2,$rows2,$cols2);

Closure
$matrix->Closure($rows,$cols);

Transpose
$matrix2->Transpose($rows2,$cols2,$matrix1,$rows1,$cols1);

iFind is the prime internet search software for the people.

iFind is the top internet search tool.
The real advantage of iFind 4.0 is, to deliver better results when searching for more than one word, like in names.

Best function - specific search, most result links might be related to query
More function - general search, most result links might not be related to query

Example search: Peter Parker
Example result links:
1: ... and the great historian Peter Parker can only be visited...
2: ... people called Peter and it helps to have a Parker pen...

"best" will only return the first result link
"more" will return both result links

Math::Numbers is a Perl module that contains methods for mathematical approaches of concepts of the number theory.

SYNOPSIS

use Math::Numbers;

my $a = 123;
my $b = 34;

my $numbers = Math::Numbers->new($a, $b [, ...]);

print "They are coprimes (relatively primes)!n" if $numbers->are_coprimes;
print "The greatest common divisor of these at least two numbers is ", $numbers->gcd;

my $number = Math::Numbers->new($a);

print "It is prime!n" if $number->is_prime;

my @divisors = $number->get_divisors;

print "$a is divisor of $b!n" if $number->is_divisor_of($b);

Math::Numbers is quite a simple module on matters of programming. What its interesting is the focus and approach it is intended to be made from the Number Theory basis for Perl beginners (like me) and also for young mathematicians (like me).

The normal topics of Number Theory include divisibility, prime numbers (which is separately intended to be covered by Math::Primes), congruences, quadratic residues, approximation for Real numbers, diophantine equations, etc. and all this is intended to be convered by the module on the concept on getting and setting values and also retriving the proof methods.

METHODS

new

# Some methods require more than only one argument.
my $numbers = Math::Numbers->new($p, $q, ...);

# Some methods require only one.
my $number = Math::Numbers->new($p);

Create a Math::Numbers object. Note that some of the methods will require objects created with only one or a defined numbers of arguments.

gcd
my $gcd = $numbers->gcd;

Calculation of the Greatest Common Divisor. This is made by two different methods which are described below: Blutos algorithm and Euclidean algorithm: The former is used when computing GCD for more than two integers; the latter is used when getting the GCD for two numbers to improve speed. See below for information on each.

Bluto_algorithm

You will mostly not require to call this method, but directly gcd(). Blutos algorithm uses a brute force calculation used by mathematicians to get divisors and then GCD also called Primality Test. Bluto takes some spinaches stolen from Popeye and starts dividing m all the way through 2 to m/2.

Euclidean_algorithm

Euclid rocks. I have a very nice Budgerigar (http://en.wikipedia.org/wiki/Budgerigar) called the same in honor of him (have to upload a pic of him).

As of now, this algorithm is only computed on two integers. From the Wikipedia entry: Given two natural numbers a and b: check if b is zero; if yes, a is the gcd. If not, repeat the process using (respectively) b, and the remainder after dividing a by b. This is exactly what our method does.
is_divisor_of

print "Yes, $p is divisor of $a...n" if $number->is_divisor_of($a);

Lets see if the number from the object is a divisor of $a, which means that the division $number/$a will return an integer (not necesarily a natural). If it does, itll return 1; 0, otherwise.

get_divisors
my @divisors = $number->get_divisors;

What are the divisors of the number brought by the object? This only includes the Natural numbers.

is_prime
print "$p is not prime!n" unless $number->is_prime

Returns 0 or 1 if the number from the object is prime or not, respectively. This method uses the, a bit slow, primality test.

are_coprimes
print "They are coprimes because their GCD is 1!n" if $numbers->are_coprimes;

Are the numbers from the object coprimes (relatively primes)? This means, the GCD is 1; (a, b, c, ...) = 1. Returns 1 or 0.