Main > Free Download Search >

Free set up software for linux

set up

Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 4704
Set up iptables NAT rules 1.2b2

Set up iptables NAT rules 1.2b2


Set up iptables NAT rules is an example IPTables 1.2.1 script for a multi-homed firewall. more>>
Set up iptables NAT rules is an example IPTables 1.2.1 script for a multi-homed firewall.

Please feel free to send me any comments or suggestions.

Current versions and documentation are available at http://www.sentry.net/~obsid/IPTables/rc.scripts.dir/current/

Sample:

## Variables ##
IPTABLES="/usr/local/sbin/iptables" ## Default IPTables >= v. 1.2.0
#IPTABLES="/usr/local/bin/iptables" ## Default IPTables<<less
Download (MB)
Added: 2007-02-14 License: GPL (GNU General Public License) Price:
989 downloads
Set::Hash 0.01

Set::Hash 0.01


Set::Hash is a Perl module with hashes as objects with lots of handy methods and support for method chaining. more>>
Set::Hash is a Perl module with hashes as objects with lots of handy methods (including set comparisons) and support for method chaining.

SYNOPSIS

use Set::Hash;
my $sh1 = Set::Hash->new(name=>"dan",age=>33);
my $sh2 = Set::Hash->new(qw/weight 185 height 72/);
$sh1->length->print; # 2
$sh1->push($sh2); # $sh1 now has weight=>185 and height=>72
$sh1->length->print; # 4
$sh2->values->join(",")->print(1); # 185, 72

Set::Hash allows you to create strings as objects and use OO-style methods on them. Many convenient methods are provided here that appear in the FAQs, the Perl Cookbook or posts from comp.lang.perl.misc. In addition, there are Set methods with corresponding (overloaded) operators for the purpose of Set comparison, i.e. +, ==, etc.

The purpose is to provide built-in methods for operations that people are always asking how to do, and which already exist in languages like Ruby. This should (hopefully) improve code readability and/or maintainability. The other advantage to this module is method-chaining by which any number of methods may be called on a single object in a single statement.

Note that Set::Hash is a subclass of Set::Array, although most of the methods of Set::Array have been overloaded, so youll want to check the documentation for what each method does exactly.

<<less
Download (0.007MB)
Added: 2006-12-18 License: Perl Artistic License Price:
1040 downloads
Set::Array 0.14

Set::Array 0.14


Set::Array Perl module contains arrays as objects with lots of handy methods and support for method chaining. more>>
Set::Array Perl module contains arrays as objects with lots of handy methods (including Set comparisons) and support for method chaining.

SYNOPSIS

my $sao1 = Set::Array->new(1,2,4,"hello",undef);
my $sao2 = Set::Array->new(qw(a b c a b c));
print $sao1->length; # prints 5
$sao2->unique->length->print; # prints 3

Set::Array allows you to create arrays as objects and use OO-style methods on them. Many convenient methods are provided here that appear in the FAQs, the Perl Cookbook or posts from comp.lang.perl.misc. In addition, there are Set methods with corresponding (overloaded) operators for the purpose of Set comparison, i.e. +, ==, etc.

The purpose is to provide built-in methods for operations that people are always asking how to do, and which already exist in languages like Ruby. This should (hopefully) improve code readability and/or maintainability. The other advantage to this module is method-chaining by which any number of methods may be called on a single object in a single statement.

OBJECT BEHAVIOR

The exact behavior of the methods depends largely on the calling context.
Here are the rules:

* If a method is called in void context, the object itself is modified.
* If the method called is not the last method in a chain (i.e. its called in object context), the object itself is modified by that method regardless of the final context or method call.
* If a method is called in list or scalar context, a list or list refererence is returned, respectively. The object itself is NOT modified.

Heres a quick example:

my $sao = Set::Array->new(1,2,3,2,3);
my @uniq = $sao->unique(); # Object unmodified. @uniq contains 3 values.
$sao->unique(); # Object modified, now contains 3 values

Here are the exceptions:

* Methods that report a value, such as boolean methods like exists() or other methods such as at() or as_hash(), never modify the object.
* The methods clear(), delete(), delete_at(), and splice will always modify the object. It seemed much too counterintuitive to call these methods in any context without actually deleting/clearing/substituting the items!
* The methods shift() and pop() will modify the object AND return the value that was shifted or popped from the array. Again, it seemed much too counterintuitive for something like $val = $sao->shift to return a value while leaving the objects list unchanged. If you really want the first or last value without modifying the object, you can always use the first() or last() method, respectively.
* The join() method always returns a string and is really meant for use in conjunction with the print() method.

BOOLEAN METHODS

exists(val) - Returns 1 if val exists within the array, 0 otherwise. If no value (or undef) is passed, then this method will test for the existence of undefined values within the array.
is_empty() - Returns 1 if the array is empty, 0 otherwise. Empty is defined as having a length of 0.

STANDARD METHODS

at(index) - Returns the item at the given index (or undef). A negative index may be used to count from the end of the array. If no value (or undef) is specified, it will look for the first item that is not defined.

clear() - Empties the array (i.e. length becomes 0). You may pass a 1 to this method to set each element of the array to undef rather than truly empty it.

compact() - Removes undefined elements from the array.

count(?val?) - Returns the number of instances of val within the array. If val is not specified (or is undef), the method will return the number of undefined values within the array.

delete(list) - Deletes all items within list from the array that match. This method will crash if list is not defined. If your goal is to delete undefined values from your object, use the compact() method instead.

delete_at(index, ?index?) - Deletes the item at the specified index. If a second index is specified, a range of items is deleted. You may use -1 or the string end to refer to the last element of the array.

duplicates - Returns a list of N-1 elements for each element N in the set. For example, if you have set "X X Y Y Y", this method would return a the list "X Y Y".

fill(val,?start?,?length?) - Sets the selected elements of the array (which may be the entire array) to val. The default value for start is 0. If length is not specified the entire array, however long it may be at the time of the call, will be filled. Alternatively, a quoted integer range may be used.

e.g. $sao->fill(x,3-5);

The array length/size may not be expanded with this call - it is only meant to fill in already-existing elements.

first() - Returns the first element of the array (or undef).

flatten() - Causes a one-dimensional flattening of the array, recursively. That is, for every element that is an array (or hash, or a ref to either an array or hash), extract its elements into the array.

e.g. my $sa = Set::Array->new([1,3,2],{one=>a,two=>b},x,y,z);

$sao->flatten->join(,)->print; # prints "1,3,2,one,a,two,b,x,y,z"

foreach(sub ref) - Iterates over an array, executing the subroutine for each element in the array. If you wish to modify or otherwise act directly on the contents of the array, use $_ within your sub reference.

e.g. To increment all elements in the array by one...

$sao->foreach(sub{ ++$_ });

get - Alias for the indices() method.

index(val) - Returns the index of the first element of the array object that contains val. Returns undef if no value is found.

Note that there is no dereferencing here so if youre looking for an item nested within a ref, use the flatten method first.

indices(val1,?val2?, ?val...?) - Returns an array consisting of the elements at the specified indices or undef if the element is out of range.

A range may also be used. It must be a quoted string in 0..3 format.

join(?char?) - Joins the individual elements of the list into a single string with the elements separated by the value of char. Useful in conjunction with the print() method. If no character is specified, then char defaults to a comma.

e.g. $sao->join(-)->print;

last() - Returns the last element of the array (or undef).

length() - Returns the number of elements within the array.

max() - Returns the maximum value of an array. No effort is made to check for non-numeric data.

pack(template) - Packs the contents of the array into a string (in scalar context) or a single array element (in object or void context).

pop() - Removes the last element from the array. Returns the popped element.

print(?1?) - Prints the contents of the array. If a 1 is provided as an argument, the output will automatically be terminated with a newline.

This also doubles as a contents method, if you just want to make a copy of the array, e.g. my @copy = $sao->print;

Can be called in void or list context, e.g.

$sao->print(); # or... print "Contents of array are: ", $sao->print();

push(list) - Adds list to the end of the array, where list is either a scalar value or a list. Returns an array or array reference in list or scalar context, respectively. Note that it does not return the length in scalar context. Use the length method for that.

reverse() - Reverses the order of the contents of the array.

rindex(val) - Similar to the index() method, except that it returns the index of the last val found within the array.

set(index,value) - Sets the element at index to value, replacing whatever may have already been there.

shift() - Shifts the first element of the array and returns the shifted element.

sort(?coderef?) - Sorts the contents of the array in alphabetical order, or in the order specified by the optional coderef. Use your standard $a and $b variables within your calling program, e.g:

my $sao = Set::Array->new( { name => Berger, salary => 20000 }, { name => Berger, salary => 15000 }, { name => Vera, salary => 25000 }, );
my $subref = sub{ $b->{name} cmp $a->{name} || $b->{salary} $a->{salary} };
$sao14->sort($subref)->flatten->join->print(1);

splice(?offset?,?length?,?list?) - Splice the array starting at position offset up to length elements, and replace them with list. If no list is provided, all elements are deleted. If length is omitted, everything from offset onward is removed.

Returns an array or array ref in list or scalar context, respectively. This method always modifies the object, regardless of context. If your goal was to grab a range of values without modifying the object, use the indices method instead.

unique() - Removes/returns non-unique elements from the list.

unshift(list) - Prepends a scalar or list to array. Note that this method returns an array or array reference in list or scalar context, respectively. It does not return the length of the array in scalar context. Use the length method for that.

ODDBALL METHODS

as_hash() - Returns a hash based on the current array, with each even numbered element (including 0) serving as the key, and each odd element serving as the value. This can be switched by using the key_order option and setting it to odd, in which case the even values serve as the values, and the odd elements serve as the keys. The default is even.

Of course, if you dont care about insertion order, you could just as well do something like, $sao-reverse->as_hash;>

Carp::croaks if the array contains an odd number of elements. This method does not actually modify the object itself in any way. It just returns a plain hash in list context or a hash reference in scalar context. The reference is not blessed, therefore if this method is called as part of a chain, it must be the last method called.

impose(?append/prepend?,string) - Appends or prepends the specified string to each element in the array. Specify the method by using either the keyword append or prepend. The default is append.

randomize() - Randomizes the order of the elements within the array.

rotate(direction) - Moves the last item of the list to the front and shifts all other elements one to the right, or vice-versa, depending on what you pass as the direction - ftol (first to last) or ltof (last to first). The default is ltof.

e.g. my $sao = Set::Array->new(1,2,3);

$sao->rotate(); # order is now 3,1,2

$sao->rotate(ftol); # order is back to 1,2,3

<<less
Download (0.023MB)
Added: 2007-07-23 License: Perl Artistic License Price:
823 downloads
Set::Scalar 1.20

Set::Scalar 1.20


Set::Scalar Perl module contains a basic set of operations. more>>
Set::Scalar Perl module contains a basic set of operations.

SYNOPSIS

use Set::Scalar;
$s = Set::Scalar->new;
$s->insert(a, b);
$s->delete(b);
$t = Set::Scalar->new(x, y, $z);

Creating

$s = Set::Scalar->new;
$s = Set::Scalar->new(@members);

$t = $s->clone;
$t = $s->copy; # clone of clone

Modifying

$s->insert(@members);
$s->delete(@members);
$s->invert(@members); # insert if hasnt, delete if has

$s->clear; # removes all the elements

Note that clear() only releases the memory used by the set to be reused by Perl; it will not reduce the overall memory use.

<<less
Download (0.016MB)
Added: 2007-07-03 License: Perl Artistic License Price:
844 downloads
Set CD-ROM Speed 1.1.6

Set CD-ROM Speed 1.1.6


Set CD-ROM Speed is written in Kommander as a helpful application to set CD-ROM and DVD-ROM drive speed more>> Set CD-ROM Speed 1.1.6 is written in Kommander as a helpful application to set CD-ROM and DVD-ROM drive speed. Since the issues mentioned here apply to CD-ROM and DVD-ROM drives as well as to recorders for these types of media, in this document the name 'CD-ROM drive' will be used to refer to all of these drive types.

Major Features:

  1. Fast CD-ROM drives have one big disadvantage over older and slower models. In order to be able to support high data transfer speeds, the CD-ROM disk must spin very quickly in the disk drive, which results in a lot of noise. This loud humming can make listening to MP3 or OGG music from CD-ROMs a very unpleasant experience and is very annoying at best for other tasks which don't require the CD-ROM to work at full speed.
  2. Using set-cd-rom-speed, you can decrease the drive's speed and thus reduce the annoying noise. The GUI allows choosing three predefined speeds suitable for different tasks and custom speeds provided by the user. The list of available CD-ROM drives is generated based on information from /etc/fstab. This works even if you use supermount-ng or subfs for mounting the CD-ROMs. The program supports multiple languages and several translations are available. It also integrates with KDE by adding an item which allows setting drive speed to the context menu of CD-ROM and DVD-ROM drive icons displayed on the desktop.
Enhancements:
  • Added Czech translation (thanks to Jozef Riha)
  • Fixes in Slovak translation (thanks to Jozef Riha)
  • Two variants of Brazilian Portuguese translation merged into one (thanks to Dherik Barison)

<<less
Added: 2006-10-05 License: GPL Price: FREE
1 downloads
Set photo in Kopete 0.1

Set photo in Kopete 0.1


Set photo in Kopete is a really simple service menu that just sets the current photo as your photo in Kopete. more>>
Set photo in Kopete is a really simple service menu that just sets the current photo as your photo in Kopete, nothing more, nothing less.

It doesnt handle directories containing space yet, if someone have a workaround so that KURL dont escapes all characters that would be nice=)

Just put this file in ~/.kde/share/apps/konqueror/servicemenus or use http://www.kde-look.org/content/show.php?content=11435 to install it.
<<less
Download (MB)
Added: 2007-02-05 License: GPL (GNU General Public License) Price:
993 downloads
Set::Infinite 0.61

Set::Infinite 0.61


Set::Infinite Perl module contains sets of intervals. more>>
Set::Infinite Perl module contains sets of intervals.

SYNOPSIS

use Set::Infinite;

$set = Set::Infinite->new(1,2); # [1..2]
print $set->union(5,6); # [1..2],[5..6]

Set::Infinite is a Set Theory module for infinite sets.

A set is a collection of objects. The objects that belong to a set are called its members, or "elements".

As objects we allow (almost) anything: reals, integers, and objects (such as dates).

We allow sets to be infinite.

There is no account for the order of elements. For example, {1,2} = {2,1}.

There is no account for repetition of elements. For example, {1,2,2} = {1,1,1,2} = {1,2}.

CONSTRUCTOR

new

Creates a new set object:

$set = Set::Infinite->new; # empty set
$set = Set::Infinite->new( 10 ); # single element
$set = Set::Infinite->new( 10, 20 ); # single range
$set = Set::Infinite->new(
[ 10, 20 ], [ 50, 70 ] ); # two ranges

empty set

$set = Set::Infinite->new;

set with a single element

$set = Set::Infinite->new( 10 );

$set = Set::Infinite->new( [ 10 ] );

set with a single span

$set = Set::Infinite->new( 10, 20 );

$set = Set::Infinite->new( [ 10, 20 ] );
# 10 10, open_begin => 0,
b => 20, open_end => 1,
}
);
# 10 new( 10, 20, 100, 200 );

$set = Set::Infinite->new( [ 10, 20 ], [ 100, 200 ] );

$set = Set::Infinite->new(
{
a => 10, open_begin => 0,
b => 20, open_end => 0,
},
{
a => 100, open_begin => 0,
b => 200, open_end => 0,
}
);

The new() method expects ordered parameters.

If you have unordered ranges, you can build the set using union:

@ranges = ( [ 10, 20 ], [ -10, 1 ] );
$set = Set::Infinite->new;
$set = $set->union( @$_ ) for @ranges;

The data structures passed to new must be immutable. So this is not good practice:

$set = Set::Infinite->new( $object_a, $object_b );
$object_a->set_value( 10 );

This is the recommended way to do it:

$set = Set::Infinite->new( $object_a->clone, $object_b->clone );
$object_a->set_value( 10 );

clone / copy

Creates a new object, and copy the object data.

empty_set

Creates an empty set.

If called from an existing set, the empty set inherits the "type" and "density" characteristics.

universal_set

Creates a set containing "all" possible elements.

If called from an existing set, the universal set inherits the "type" and "density" characteristics.

<<less
Download (0.048MB)
Added: 2007-07-07 License: Perl Artistic License Price:
839 downloads
Set::Partition 0.03

Set::Partition 0.03


Set::Partition is a Perl module that can enumerate all arrangements of a set in fixed subsets. more>>
Set::Partition is a Perl module that can enumerate all arrangements of a set in fixed subsets.

SYNOPSIS

use Set::Partition;

my $s = Set::Partition->new(
list => [qw(a b c d e)],
partition => [2, 3],
);
while (my $p = $s->next) {
print join( , map { "(@$_)" } @$p ), $/;
}
# produces
(a b) (c d e)
(a c) (b d e)
(a d) (b c e)
(a e) (b c d)
(b c) (a d e)
(b d) (a c e)
(b e) (a c d)
(c d) (a b e)
(c e) (a b d)
(d e) (a b c)

# or with a hash
my $s = Set::Partition->new(
list => { b => bat, c => cat, d => dog },
partition => [2, 1],
);
while (my $p = $s->next) {
...
}

Set::Partition takes a list or hash of elements and a list numbers that represent the sizes of the partitions into which the list of elements should be arranged.
The resulting object can then be used as an iterator which returns a reference to an array of lists, that represents the original list arranged according to the given partitioning. All possible arrangements are returned, and the object returns undef when the entire combination space has been exhausted.

<<less
Download (0.007MB)
Added: 2007-07-04 License: Perl Artistic License Price:
842 downloads
BugList 1.0.3

BugList 1.0.3


BugList provides a bug/feature tracking system focusing on being easy to set up and use. more>>
BugList provides a bug/feature tracking system focusing on being easy to set up and use.
BugList is a bug/feature tracking system focusing on being easy to set up and use. It is written entirely in PHP, and only relies on PHP and MySQL for setup.
Its feature set matches the requirements of a small to middle sized project. Apart from the standard categorization features, it is very easy to create customized views of the outstanding bugs.
The system supports attachments and makes linking between bugs very easy.
The entire system is used and managed using a Web-interface.
Enhancements:
- This release fixes a couple minor bugs
<<less
Download (0.011MB)
Added: 2007-02-15 License: GPL (GNU General Public License) Price:
987 downloads
SGCE 1.4 Beta

SGCE 1.4 Beta


SGCE is a skin care management system that manages customers, treatment follow-up, product supply, clinic history and more. more>>
SGCE is a skin care management system that manages customers, treatment follow-up, product supply, clinic history, and skin status.

The project is a Web-based management system with Brazilian-Portuguese language support.

Installation:

- Load mysql structure from database-mysql.sql file
- Set up conf.inc.php

<<less
Download (0.028MB)
Added: 2007-06-11 License: GPL (GNU General Public License) Price:
865 downloads
nagios-check_apt 0.1

nagios-check_apt 0.1


nagios-check_apt is a Nagios plugin to check whether there are updates available in Debian apt repositories. more>>
nagios-check_apt is a Nagios plugin to check whether there are updates available in Debian apt repositories.

The project requires "apt-get update" to be run via cron.

Set up cron or any other automation to do an apt-get update periodically. If you neglect this, the plugin will not show updates.

<<less
Download (0.003MB)
Added: 2007-02-28 License: GPL (GNU General Public License) Price:
975 downloads
GStreamer 0.09

GStreamer 0.09


GStreamer is a Perl interface to the GStreamer library. more>>
GStreamer is a Perl interface to the GStreamer library.

SYNOPSIS

use GStreamer -init;

my $loop = Glib::MainLoop -> new();

# set up
my $play = GStreamer::ElementFactory -> make("playbin", "play");
$play -> set(uri => Glib::filename_to_uri $file, "localhost");
$play -> get_bus() -> add_watch(&my_bus_callback, $loop);
$play -> set_state("playing");

# run
$loop -> run();

# clean up
$play -> set_state("null");

sub my_bus_callback {
my ($bus, $message, $loop) = @_;

if ($message -> type & "error") {
warn $message -> error;
$loop -> quit();
}

elsif ($message -> type & "eos") {
$loop -> quit();
}

# remove message from the queue
return TRUE;
}

<<less
Download (0.063MB)
Added: 2007-05-11 License: Perl Artistic License Price:
906 downloads
XBashServ 0.2.1

XBashServ 0.2.1


XBashServ is a program to help set up and run game server programs. more>>
XBashServ is program to help run and manage computer game servers and other general network servers.

It is designed to be easy to use so that you spend less time setting up the server and so that more players have more time to enjoy gaming on it.
<<less
Download (0.066MB)
Added: 2005-04-07 License: GPL (GNU General Public License) Price:
1660 downloads
Set::CrossProduct 1.92

Set::CrossProduct 1.92


Set::CrossProduct is a Perl module that allows you to work with the cross product of two or more sets. more>>
Set::CrossProduct is a Perl module that allows you to work with the cross product of two or more sets.

SYNOPSIS

my $iterator = Set::CrossProduct->new( ARRAY_OF_ARRAYS );

# get the next tuple
my $number_of_tuples = $iterator->cardinality;

# get the next tuple
my $tuple = $iterator->get;

# move back one position
my $tuple = $iterator->unget;

# get the previous tuple without resetting
# the cursor (peek at it)
my $next_tuple = $iterator->next;

# get the previous tuple without resetting
# the cursor
my $last_tuple = $iterator->previous;

# get a random tuple
my $tuple = $iterator->random;

# in list context returns a list of all tuples
my @tuples = $iterator->combinations;

# in scalar context returns an array reference to all tuples
my $tuples = $iterator->combinations;

Given sets S(1), S(2), ..., S(k), each of cardinality n(1), n(2), ..., n(k) respectively, the cross product of the sets is the set CP of ordered tuples such that { | s1 => S(1), s2 => S(2), .... sk => S(k). }
If you do not like that description, how about:

Create a list by taking one item from each array, and do that for all possible ways that can be done, so that the first item in the list is always from the first array, the second item from the second array, and so on.

<<less
Download (0.007MB)
Added: 2007-07-04 License: Perl Artistic License Price:
842 downloads
jsPro R3

jsPro R3


jsPro is a set of Javascript libraries. more>>
jsPro is a set of libraries that extend the core Javascript classes and provide a number of new classes.

The aim is to provide a rich set of object-based functionality to the Javascript language.
<<less
Download (0.050MB)
Added: 2005-04-13 License: LGPL (GNU Lesser General Public License) Price:
1656 downloads
Secleted [ 0 ] software to compare
  • Page: 1 of 5
  • 1
  • 2
  • 3
  • 4
  • 5