automated logic
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 854
Automated Linux From Scratch 2.2
Automated Linux From Scratch creates the generic framework for an extendable system builder and package installer. more>>
Automated Linux From Scratch (ALFS) is a project that creates the generic framework for an extendable system builder and package installer.
Why would I want to use ALFS?
After having gone through the LFS and BLFS books more than 2 or 3 times, you will quickly appreciate the ability to automate the task of compiling the software you want for your systems.
What can I do with ALFS?
The goal of ALFS is to automate the process of creating an LFS system. It seeks to make the process of building LFS easier and more efficient while still providing flexibility by granting the user total control and insight into the compilation and management of his LFS build.
How is ALFS implemented?
nALFS
The first ALFS implementation was nALFS by Neven Has. nALFS is a small program written in C. It first parses an XML profile that contains information concerning the LFS build process into a series of internal commands. It can then execute these at your discretion, thus automating the compilation of LFS.
jhalfs
Currently, the official implementation is jhalfs. Originally created by Jeremy Huntwork, but since developed and maintained by Manuel Canales Esparcia and George Boudreau, jhalfs has become a light-weight, practical method of automating an LFS build. jhalfs is a Bash shell script that makes use of Subversion and xsltproc to first download the XML sources of the Linux From Scratch book and then extract any necessary commands, placing them into executable shell scripts. If you do not already have the necessary source packages in place on your system jhalfs can fetch them. Finally, jhalfs generates a Makefile which will control the execution of the shell scripts, allowing for recovery if the build should encounter an error. Since jhalfs extracts its commands to run directly from the LFS book, there are no profiles to edit or maintain.
Note: The 2.2 version of jhalfs has been released. A tarball can been downloaded from http://www.linuxfromscratch.org/alfs/downloads/jhalfs/stable/.
alfs
There are many in-depth features that have been requested for future ALFS implementations. Because of this, development has been slated for an entirely new build tool which will be called alfs. To see a list of features that will appear in alfs, please read our Software Requirements Specification. If you wish to help develop this new tool, please subscribe to the alfs-discuss mailing list and leave a note there explaining your desire to help.
<<lessWhy would I want to use ALFS?
After having gone through the LFS and BLFS books more than 2 or 3 times, you will quickly appreciate the ability to automate the task of compiling the software you want for your systems.
What can I do with ALFS?
The goal of ALFS is to automate the process of creating an LFS system. It seeks to make the process of building LFS easier and more efficient while still providing flexibility by granting the user total control and insight into the compilation and management of his LFS build.
How is ALFS implemented?
nALFS
The first ALFS implementation was nALFS by Neven Has. nALFS is a small program written in C. It first parses an XML profile that contains information concerning the LFS build process into a series of internal commands. It can then execute these at your discretion, thus automating the compilation of LFS.
jhalfs
Currently, the official implementation is jhalfs. Originally created by Jeremy Huntwork, but since developed and maintained by Manuel Canales Esparcia and George Boudreau, jhalfs has become a light-weight, practical method of automating an LFS build. jhalfs is a Bash shell script that makes use of Subversion and xsltproc to first download the XML sources of the Linux From Scratch book and then extract any necessary commands, placing them into executable shell scripts. If you do not already have the necessary source packages in place on your system jhalfs can fetch them. Finally, jhalfs generates a Makefile which will control the execution of the shell scripts, allowing for recovery if the build should encounter an error. Since jhalfs extracts its commands to run directly from the LFS book, there are no profiles to edit or maintain.
Note: The 2.2 version of jhalfs has been released. A tarball can been downloaded from http://www.linuxfromscratch.org/alfs/downloads/jhalfs/stable/.
alfs
There are many in-depth features that have been requested for future ALFS implementations. Because of this, development has been slated for an entirely new build tool which will be called alfs. To see a list of features that will appear in alfs, please read our Software Requirements Specification. If you wish to help develop this new tool, please subscribe to the alfs-discuss mailing list and leave a note there explaining your desire to help.
Download (0.15MB)
Added: 2007-07-02 License: GPL (GNU General Public License) Price:
849 downloads
Math::Logic 1.19
Math::Logic is a Perl module that provides pure 2, 3 or multi-value logic. more>>
Math::Logic is a Perl module that provides pure 2, 3 or multi-value logic.
SYNOPSIS
use Math::Logic qw( $TRUE $FALSE $UNDEF $STR_TRUE $STR_FALSE $STR_UNDEF ) ;
# 1 0 -1 TRUE FALSE UNDEF
use Math::Logic :NUM ; # $TRUE $FALSE $UNDEF -- what you normally want
use Math::Logic :ALL ; # All the constants
use Math::Logic :STR ; # $STR_TRUE $STR_FALSE $STR_UNDEF
# 2-degree logic
my $true = Math::Logic->new( -value => $TRUE, -degree => 2 ) ;
my $false = Math::Logic->new( -value => $FALSE, -degree => 2 ) ;
my $x = Math::Logic->new_from_string( TRUE,2 ) ;
print "true" if $true ;
# 3-degree logic (non-propagating)
my $true = Math::Logic->new( -value => $TRUE, -degree => 3 ) ;
my $false = Math::Logic->new( -value => $FALSE, -degree => 3 ) ;
my $undef = Math::Logic->new( -value => $UNDEF, -degree => 3 ) ;
my $x = Math::Logic->new_from_string( FALSE,3 ) ;
print "true" if ( $true | $undef ) == $TRUE ;
# 3-degree logic (propagating)
my $true = Math::Logic->new( -value => $TRUE, -degree => 3, -propagate => 1 ) ;
my $false = Math::Logic->new( -value => $FALSE, -degree => 3, -propagate => 1 ) ;
my $undef = Math::Logic->new( -value => $UNDEF, -degree => 3, -propagate => 1 ) ;
my $x = Math::Logic->new_from_string( ( UNDEF, 3, -propagate ) ) ;
print "undef" if ( $true | $undef ) == $UNDEF ;
# multi-degree logic
my $True = 100 ; # Define our own true
my $False = $FALSE ;
my $true = Math::Logic->new( -value => $True, -degree => $True ) ;
my $very = Math::Logic->new( -value => 67, -degree => $True ) ;
my $fairly = Math::Logic->new( -value => 33, -degree => $True ) ;
my $false = Math::Logic->new( -value => $False, -degree => $True ) ;
my $x = Math::Logic->new_from_string( "25,$True" ) ;
print "maybe" if ( $very | $fairly ) > 50 ;
# We can have arbitrarily complex expressions; the result is a Math::Logic
# object; all arguments must be Math::Logic objects or things which can be
# promoted into such and must all be compatible. The outcome depends on
# which kind of logic is being used.
my $xor = ( $x | $y ) & ( ! ( $x & $y ) ) ;
# This is identical to:
my $xor = $x ^ $y ;
Perls built-in logical operators, and, or, xor and not support 2-value logic. This means that they always produce a result which is either true or false. In fact perl sometimes returns 0 and sometimes returns undef for false depending on the operator and the order of the arguments. For "true" Perl generally returns the first value that evaluated to true which turns out to be extremely useful in practice. Given the choice Perls built-in logical operators are to be preferred -- but when you really want pure 2-degree logic or 3-degree logic or multi-degree logic they are available through this module.
The only 2-degree logic values are 1 (TRUE) and 0 (FALSE).
The only 3-degree logic values are 1 (TRUE), 0 (FALSE) and -1 (UNDEF). Note that UNDEF is -1 not undef!
The only multi-degree logic values are 0 (FALSE)..-degree -- the value of TRUE is equal to the degree, usually 100.
The -degree is the maximum value (except for 2 and 3-degree logic); i.e. logic of n-degree is n+1-value logic, e.g. 100-degree logic has 101 values, 0..100.
Although some useful constants may be exported, this is an object module and the results of logical comparisons are Math::Logic objects.
<<lessSYNOPSIS
use Math::Logic qw( $TRUE $FALSE $UNDEF $STR_TRUE $STR_FALSE $STR_UNDEF ) ;
# 1 0 -1 TRUE FALSE UNDEF
use Math::Logic :NUM ; # $TRUE $FALSE $UNDEF -- what you normally want
use Math::Logic :ALL ; # All the constants
use Math::Logic :STR ; # $STR_TRUE $STR_FALSE $STR_UNDEF
# 2-degree logic
my $true = Math::Logic->new( -value => $TRUE, -degree => 2 ) ;
my $false = Math::Logic->new( -value => $FALSE, -degree => 2 ) ;
my $x = Math::Logic->new_from_string( TRUE,2 ) ;
print "true" if $true ;
# 3-degree logic (non-propagating)
my $true = Math::Logic->new( -value => $TRUE, -degree => 3 ) ;
my $false = Math::Logic->new( -value => $FALSE, -degree => 3 ) ;
my $undef = Math::Logic->new( -value => $UNDEF, -degree => 3 ) ;
my $x = Math::Logic->new_from_string( FALSE,3 ) ;
print "true" if ( $true | $undef ) == $TRUE ;
# 3-degree logic (propagating)
my $true = Math::Logic->new( -value => $TRUE, -degree => 3, -propagate => 1 ) ;
my $false = Math::Logic->new( -value => $FALSE, -degree => 3, -propagate => 1 ) ;
my $undef = Math::Logic->new( -value => $UNDEF, -degree => 3, -propagate => 1 ) ;
my $x = Math::Logic->new_from_string( ( UNDEF, 3, -propagate ) ) ;
print "undef" if ( $true | $undef ) == $UNDEF ;
# multi-degree logic
my $True = 100 ; # Define our own true
my $False = $FALSE ;
my $true = Math::Logic->new( -value => $True, -degree => $True ) ;
my $very = Math::Logic->new( -value => 67, -degree => $True ) ;
my $fairly = Math::Logic->new( -value => 33, -degree => $True ) ;
my $false = Math::Logic->new( -value => $False, -degree => $True ) ;
my $x = Math::Logic->new_from_string( "25,$True" ) ;
print "maybe" if ( $very | $fairly ) > 50 ;
# We can have arbitrarily complex expressions; the result is a Math::Logic
# object; all arguments must be Math::Logic objects or things which can be
# promoted into such and must all be compatible. The outcome depends on
# which kind of logic is being used.
my $xor = ( $x | $y ) & ( ! ( $x & $y ) ) ;
# This is identical to:
my $xor = $x ^ $y ;
Perls built-in logical operators, and, or, xor and not support 2-value logic. This means that they always produce a result which is either true or false. In fact perl sometimes returns 0 and sometimes returns undef for false depending on the operator and the order of the arguments. For "true" Perl generally returns the first value that evaluated to true which turns out to be extremely useful in practice. Given the choice Perls built-in logical operators are to be preferred -- but when you really want pure 2-degree logic or 3-degree logic or multi-degree logic they are available through this module.
The only 2-degree logic values are 1 (TRUE) and 0 (FALSE).
The only 3-degree logic values are 1 (TRUE), 0 (FALSE) and -1 (UNDEF). Note that UNDEF is -1 not undef!
The only multi-degree logic values are 0 (FALSE)..-degree -- the value of TRUE is equal to the degree, usually 100.
The -degree is the maximum value (except for 2 and 3-degree logic); i.e. logic of n-degree is n+1-value logic, e.g. 100-degree logic has 101 values, 0..100.
Although some useful constants may be exported, this is an object module and the results of logical comparisons are Math::Logic objects.
Download (0.012MB)
Added: 2007-07-02 License: Perl Artistic License Price:
847 downloads
Partition Logic 0.68
Partition Logic is a standalone partitioning tool for PC-compatible computers. more>>
Partition Logic is a free hard disk partitioning and data management tool. It can create, delete, format, and move partitions and modify their attributes. It can copy entire hard disks from one to another.
Partition Logic is free software, based on the Visopsys operating system. It boots from a CD or floppy disk and runs as a standalone system, independent of your regular operating system.
Partition Logic is intended to become a free alternative to such commercial programs as Partition Magic, Drive Image, and Norton Ghost...
<<lessPartition Logic is free software, based on the Visopsys operating system. It boots from a CD or floppy disk and runs as a standalone system, independent of your regular operating system.
Partition Logic is intended to become a free alternative to such commercial programs as Partition Magic, Drive Image, and Norton Ghost...
Download (1.2MB)
Added: 2007-05-11 License: GPL (GNU General Public License) Price:
913 downloads
InterLOGIC 0.3
InterLOGIC game is based on an old Amiga logic game Balls. more>>
InterLOGIC game is based on an old Amiga logic game Balls. This is a graphically enhanced release of our project from 1999, and now, five years after initial release, it is made available to public.
The object of the game is to move differently colored balls through the maze, connecting it with the other same collored balls.
Two or more connected same-colored balls will disappear, and you should clean the whole maze and finish the level.
The balls are connected if they are in 90 degrees position to each other, in a row or a corner (cannot be connected diagonally).This release contains 30 mind-breaking levels for you to solve.
<<lessThe object of the game is to move differently colored balls through the maze, connecting it with the other same collored balls.
Two or more connected same-colored balls will disappear, and you should clean the whole maze and finish the level.
The balls are connected if they are in 90 degrees position to each other, in a row or a corner (cannot be connected diagonally).This release contains 30 mind-breaking levels for you to solve.
Download (1.5MB)
Added: 2005-09-30 License: Freeware Price:
1485 downloads
Automated Argument Helper 1.2.2
Aargh is a code generator, written in C++ and licensed under the terms of the GNU General Public License (GPL). more>>
Aargh is a code generator, written in C++ and licensed under the terms of the GNU General Public License (GPL). It generates C++ code to parse a command line, using the getopt() facility available in UNIX and UNIX-like environments.
Automated Argument Helper project supports command-line options with integer arguments, string arguments, and no arguments. The generated code is commented and carefully indented for readability.
Its nice to have lots of command line options, but its a real pain to code for them.
Not that its difficult. Its just tedious, time-consuming, error prone, and no fun. I used to wince at the thought of adding command line options.
Not any more. All I have to do is define the options I want in a small XML file, and run it through aargh. Instantly I have C++ source code that I can compile and link into my program.
If I need to add another option, or otherwise change the rules, I can edit the XML and regenerate the code. No muss, no fuss. Now I can spend more time on the interesting parts of the project.
To use aargh, write an XML file to describe the options you want. When aargh reads the file, it generates two C++ files.
One file is a header that declares a class to represent the options. By default this class is named "Opts," but you can specify a different name. The other file is the implementation of Opts, or whatever you decide to call it. The Opts class provides member functions to parse the command line and return the results.
In your own code, declare an instance of Opts and call Opts::get() to parse the command line, passing it the argc and argv arguments from main(). Opts::get() returns zero if the command line follows the rules that you have outlined in the XML file, or non-zero otherwise. If the parsing is successful, the Opts object stores the results and makes them available to your program by a series of accessor functions.
Main features:
- You can enforce upper and/or lower limits on the number of non-option arguments.
- You can distinguish between options that take arguments and those that dont.
- You can specify that an option is required.
- You can require that the argument to an option be a non-negative integer.
- For an integer argument you can enforce upper and/or lower limits.
- For a string argument you can enforce upper and/or lower limits on the string length.
- For a string argument you can call a function of your own to validate the argument.
- You can allow multiple occurrences of the same option. In that case the generated code builds an STL vector to hold the arguments. By default the generated software allows only one occurrence of any given option.
Enhancements:
- You can now specify the location of the generated header file independently of its name.
- This feature may make it easier to incorporate aargh into complex build environments.
<<lessAutomated Argument Helper project supports command-line options with integer arguments, string arguments, and no arguments. The generated code is commented and carefully indented for readability.
Its nice to have lots of command line options, but its a real pain to code for them.
Not that its difficult. Its just tedious, time-consuming, error prone, and no fun. I used to wince at the thought of adding command line options.
Not any more. All I have to do is define the options I want in a small XML file, and run it through aargh. Instantly I have C++ source code that I can compile and link into my program.
If I need to add another option, or otherwise change the rules, I can edit the XML and regenerate the code. No muss, no fuss. Now I can spend more time on the interesting parts of the project.
To use aargh, write an XML file to describe the options you want. When aargh reads the file, it generates two C++ files.
One file is a header that declares a class to represent the options. By default this class is named "Opts," but you can specify a different name. The other file is the implementation of Opts, or whatever you decide to call it. The Opts class provides member functions to parse the command line and return the results.
In your own code, declare an instance of Opts and call Opts::get() to parse the command line, passing it the argc and argv arguments from main(). Opts::get() returns zero if the command line follows the rules that you have outlined in the XML file, or non-zero otherwise. If the parsing is successful, the Opts object stores the results and makes them available to your program by a series of accessor functions.
Main features:
- You can enforce upper and/or lower limits on the number of non-option arguments.
- You can distinguish between options that take arguments and those that dont.
- You can specify that an option is required.
- You can require that the argument to an option be a non-negative integer.
- For an integer argument you can enforce upper and/or lower limits.
- For a string argument you can enforce upper and/or lower limits on the string length.
- For a string argument you can call a function of your own to validate the argument.
- You can allow multiple occurrences of the same option. In that case the generated code builds an STL vector to hold the arguments. By default the generated software allows only one occurrence of any given option.
Enhancements:
- You can now specify the location of the generated header file independently of its name.
- This feature may make it easier to incorporate aargh into complex build environments.
Download (0.16MB)
Added: 2006-04-14 License: GPL (GNU General Public License) Price:
1288 downloads
Nagios Automated Configuration Engine 0.4
NACE is a generic query engine used to automatically create host and service definitions for hosts on the network. more>>
NACE is a generic query engine used to automatically create host and service definitions for hosts on the network.
It is intended to be used in a shell script at regular intervals by an experienced Nagios administrator to perform a query against the supplied host list. It then creates host and service definitions using the parameters supplied in the query.
<<lessIt is intended to be used in a shell script at regular intervals by an experienced Nagios administrator to perform a query against the supplied host list. It then creates host and service definitions using the parameters supplied in the query.
Download (0.024MB)
Added: 2005-11-15 License: GPL (GNU General Public License) Price:
1445 downloads
phpautotest 1.0.3
phpautotest is a tool for conducting automated regression tests on PHP-driven Web sites. more>>
phpautotest is a tool for conducting automated regression tests on PHP-driven Web sites. Variable values as well as HTTP output can be tested.
HTTP output is tested using regular expressions.
<<lessHTTP output is tested using regular expressions.
Download (0.18MB)
Added: 2006-05-11 License: MIT/X Consortium License Price:
1264 downloads
Diplomacy Automated Email Judge 1.7.6
Njudge is an automated judge for Diplomacy games, based on Ken Lowe software. more>>
Njudge is an automated judge for Diplomacy games, based on Ken Lowe software.
Installation:
1. Create a system user account (i.e. judge) and its home directory
(i.e. /home/judge) It is recommended to lock the password for this
account as you should never need to login as this user.
2. `cd to the directory containing the packages source code and type
`./configure to configure the package for your system. If youre
using `csh on an old version of System V, you might need to type
`sh ./configure instead to prevent `csh from trying to execute
`configure itself.
By default it will set up the judge in /home/judge as user judge with
an email address of judge@localhost and sendmail in /usr/sbin.
If you chose a different user and directory in step 1, or if judge
email should come from a different domain, you can give the configure
script flags to override the defaults. The flags are:
--with-dir=DIR
--with-user=NAME
--with-domain=DOMAIN
--with-sendmail=SENDMAIL
for example to set up the judge in /home/jaldhar/dip as user
jaldhar and email judge@braincells.com and sendmail in /usr/ucb, you
would do:
./configure --with-dir=/home/jaldhar/dip --with-user=jaldhar --with-domain=braincells.com --with-sendmail=/usr/ucb
There are many other flags you can give (type ./configure --help
for a full list) but these are the main ones youre likely to use.
Running `configure takes awhile. While running, it prints some
messages telling which features it is checking for.
3. Type `make to compile the package.
4. If this is a new install:
Type `make install to install the programs, any data files and
documentation. You will have to edit a few configuration files
before the judge will become operation.
If this is an upgrade from an older version;
Type make upgrade to install the new programs only.
*Note* compiled programs will not be stripped of debug and other extra
information. If you want to make compiled programs a little smaller,
you can type make install-strip or make upgrade-strip instead. This
may give a few harmless errors (when it tries to strip scripts) but you
can ignore them.
If you just want to rebuild the map files (because e.g. you added a new
variant,) type make remap.
5. You can remove the program binaries and object files from the
source code directory by typing `make clean. To also remove the
files that `configure created (so you can compile the package for
a different kind of computer), type `make distclean.
Enhancements:
- Major bugfixes
<<lessInstallation:
1. Create a system user account (i.e. judge) and its home directory
(i.e. /home/judge) It is recommended to lock the password for this
account as you should never need to login as this user.
2. `cd to the directory containing the packages source code and type
`./configure to configure the package for your system. If youre
using `csh on an old version of System V, you might need to type
`sh ./configure instead to prevent `csh from trying to execute
`configure itself.
By default it will set up the judge in /home/judge as user judge with
an email address of judge@localhost and sendmail in /usr/sbin.
If you chose a different user and directory in step 1, or if judge
email should come from a different domain, you can give the configure
script flags to override the defaults. The flags are:
--with-dir=DIR
--with-user=NAME
--with-domain=DOMAIN
--with-sendmail=SENDMAIL
for example to set up the judge in /home/jaldhar/dip as user
jaldhar and email judge@braincells.com and sendmail in /usr/ucb, you
would do:
./configure --with-dir=/home/jaldhar/dip --with-user=jaldhar --with-domain=braincells.com --with-sendmail=/usr/ucb
There are many other flags you can give (type ./configure --help
for a full list) but these are the main ones youre likely to use.
Running `configure takes awhile. While running, it prints some
messages telling which features it is checking for.
3. Type `make to compile the package.
4. If this is a new install:
Type `make install to install the programs, any data files and
documentation. You will have to edit a few configuration files
before the judge will become operation.
If this is an upgrade from an older version;
Type make upgrade to install the new programs only.
*Note* compiled programs will not be stripped of debug and other extra
information. If you want to make compiled programs a little smaller,
you can type make install-strip or make upgrade-strip instead. This
may give a few harmless errors (when it tries to strip scripts) but you
can ignore them.
If you just want to rebuild the map files (because e.g. you added a new
variant,) type make remap.
5. You can remove the program binaries and object files from the
source code directory by typing `make clean. To also remove the
files that `configure created (so you can compile the package for
a different kind of computer), type `make distclean.
Enhancements:
- Major bugfixes
Download (0.71MB)
Added: 2006-08-25 License: Other/Proprietary License Price:
1163 downloads
Automated support for compound RPC calls 0.2
Automated support for compound RPC calls is a project which augments RPCGEN to support NFSv4-style compound procedures. more>>
Automated support for compound RPC calls is a project which augments RPCGEN to support NFSv4-style compound procedures.
NFSv4 specifies that the RPC calls be batched into a "compound" call. There is no support for this in RPCGEN.
By rearranging the ONC IDL for NFSv4 into AutoGen definitions, these templates will emit the original IDL *plus* all the code to package, send, distribute, collect, return, and dispatch the results.
The distributed program author merely needs to call and supply server procedures for the routines specified in the IDL.
Templates for these calls and service routines is provided, too. The NFSv4 definitions are included.
<<lessNFSv4 specifies that the RPC calls be batched into a "compound" call. There is no support for this in RPCGEN.
By rearranging the ONC IDL for NFSv4 into AutoGen definitions, these templates will emit the original IDL *plus* all the code to package, send, distribute, collect, return, and dispatch the results.
The distributed program author merely needs to call and supply server procedures for the routines specified in the IDL.
Templates for these calls and service routines is provided, too. The NFSv4 definitions are included.
Download (0.022MB)
Added: 2007-04-05 License: BSD License Price:
938 downloads
Math::Logic::Predicate 0.03
Math::Logic::Predicate is a Perl module to manage and query a predicate assertion database. more>>
Math::Logic::Predicate is a Perl module to manage and query a predicate assertion database.
SYNOPSIS
use Math::Logic::Predicate;
$db = new Math::Logic::Predicate;
# Enter some predicates into the database
$db->add(retract( smart(_) );
# Make a query
$query = $db->parse( human(H) & name(H, X) ? );
$iter = $db->match($query, $iter);
# Get the results
$name = $db->get($iter, X);
# Store it in a rule
$db->add( human_name(H, N) := human(H) & name(H, N). );
# Use it in a query
$iter = $db->match( human_name(lister, N) ? );
# Save it to a file
use Storable;
store($db->rules, red_dwarf);
<<lessSYNOPSIS
use Math::Logic::Predicate;
$db = new Math::Logic::Predicate;
# Enter some predicates into the database
$db->add(retract( smart(_) );
# Make a query
$query = $db->parse( human(H) & name(H, X) ? );
$iter = $db->match($query, $iter);
# Get the results
$name = $db->get($iter, X);
# Store it in a rule
$db->add( human_name(H, N) := human(H) & name(H, N). );
# Use it in a query
$iter = $db->match( human_name(lister, N) ? );
# Save it to a file
use Storable;
store($db->rules, red_dwarf);
Download (0.017MB)
Added: 2006-09-28 License: Perl Artistic License Price:
1121 downloads
Class::AbstractLogic 0.01_01
Class::AbstractLogic is a Perl module to handle Logic Abstractions. more>>
Class::AbstractLogic is a Perl module to handle Logic Abstractions.
SYNOPSIS
# the logic class definition
package My::Logic::Foo;
use Class::AbstractLogic-base;
# a logic action
action add,
needs [qw(a b)],
verify { a => sub { /^d+$/ }, b => sub { /^d+$/ } },
sub { $_{a} + $_{b} };
1;
...
# logic module manager creation
use Class::AbstractLogic;
my $calm = Class::AbstractLogic::Manager->new;
# loading a logic class
$calm->load_logic(Foo => My::Logic::Foo);
# requesting a result from a logic method
my $result = $calm->logic(Foo)->add(a => 11, b => 12);
# $result will be false if an exception was caught
if ($result) {
print result was . $result->value . "n";
}
else {
print exception raised: . $result->key . "n";
print error message: . $result->error . "n";
}
<<lessSYNOPSIS
# the logic class definition
package My::Logic::Foo;
use Class::AbstractLogic-base;
# a logic action
action add,
needs [qw(a b)],
verify { a => sub { /^d+$/ }, b => sub { /^d+$/ } },
sub { $_{a} + $_{b} };
1;
...
# logic module manager creation
use Class::AbstractLogic;
my $calm = Class::AbstractLogic::Manager->new;
# loading a logic class
$calm->load_logic(Foo => My::Logic::Foo);
# requesting a result from a logic method
my $result = $calm->logic(Foo)->add(a => 11, b => 12);
# $result will be false if an exception was caught
if ($result) {
print result was . $result->value . "n";
}
else {
print exception raised: . $result->key . "n";
print error message: . $result->error . "n";
}
Download (0.016MB)
Added: 2007-08-01 License: Perl Artistic License Price:
814 downloads
Jameleon 3.3-M4
Jameleon is an automated testing framework that can be used by technical and non-technical users alike. more>>
Jameleon project is an automated testing framework that can be used by technical and non-technical users alike.
One of the main concepts behind it is to create a group of keywords or tags that represent different screens of an application. All of the logic required to automate each particular screen can be defined in Java and mapped to these keywords.
The keywords can then be organized with different data sets to form test scripts without requiring an in-depth knowledge of how the application works. The test scripts are then used to automate testing efforts and to generate manual test case documentation.
Jameleon was designed to test many kinds of applications. To make this possible, Jameleon was designed with a plug-in model. Currently, there are five plug-ins offered;
- A JUnit plug-in which can be used to test at a white box level. All JUnit function tags can be used in conjunction with other plug-ins.
- A Jiffie plug-in which drives Internet Explorer and can therefore only be run on Windows. Most testers like this plug-in the most.
- An HttpUnit plug-in which emulates a browser. Most developers like this plug-in the most.
- A 3270 (Jagacy) plug-in which is used to automate mainframe applications.
- A jWebUnit plug-in which is the most basic among the provided plug-ins and currently has no generic tags other than a session tag.
If Jameleon doesnt have some feature or plug-in, please feel free to request it as a feature via the Request a Feature link. Implementing Jameleon plug-ins is simple and can usually be done in less than a hour.
Even though it would be possible to write unit tests using Jameleon, Jameleon was designed with integration, regression, functional, and acceptance-level testing in mind. Most bugs are found and fixed by good unit tests. However, this does not eliminate the need to test the application as a whole.
Enhancements:
- This release includes four new features and fixes four bugs.
- A notable new feature is an experimental Selenium plug-in.
- One of the fixed bugs includes a fix to a performance slow-down in the Jiffie plug-in introduced back in the 3.3-M2 release.
<<lessOne of the main concepts behind it is to create a group of keywords or tags that represent different screens of an application. All of the logic required to automate each particular screen can be defined in Java and mapped to these keywords.
The keywords can then be organized with different data sets to form test scripts without requiring an in-depth knowledge of how the application works. The test scripts are then used to automate testing efforts and to generate manual test case documentation.
Jameleon was designed to test many kinds of applications. To make this possible, Jameleon was designed with a plug-in model. Currently, there are five plug-ins offered;
- A JUnit plug-in which can be used to test at a white box level. All JUnit function tags can be used in conjunction with other plug-ins.
- A Jiffie plug-in which drives Internet Explorer and can therefore only be run on Windows. Most testers like this plug-in the most.
- An HttpUnit plug-in which emulates a browser. Most developers like this plug-in the most.
- A 3270 (Jagacy) plug-in which is used to automate mainframe applications.
- A jWebUnit plug-in which is the most basic among the provided plug-ins and currently has no generic tags other than a session tag.
If Jameleon doesnt have some feature or plug-in, please feel free to request it as a feature via the Request a Feature link. Implementing Jameleon plug-ins is simple and can usually be done in less than a hour.
Even though it would be possible to write unit tests using Jameleon, Jameleon was designed with integration, regression, functional, and acceptance-level testing in mind. Most bugs are found and fixed by good unit tests. However, this does not eliminate the need to test the application as a whole.
Enhancements:
- This release includes four new features and fixes four bugs.
- A notable new feature is an experimental Selenium plug-in.
- One of the fixed bugs includes a fix to a performance slow-down in the Jiffie plug-in introduced back in the 3.3-M2 release.
Download (3.8MB)
Added: 2006-12-15 License: LGPL (GNU Lesser General Public License) Price:
1046 downloads
KlamAV 0.41
KlamAV provides ClamAV protection for the KDE desktop. more>>
KlamAV provides ClamAV protection for the KDE desktop. KlamAV includes on access scanning, manual scanning, quarantine management, downloading of updates, mail scanning, and automated installation.
Main features:
- On Access Scanning
- Manual Scanning
- Quarantine Management
- Downloading Updates
- Mail Scanning (KMail/Evolution)
- Automated Installation
- Dazuko pre-package
Enhancements:
- Make compatible with ClamAV 0.90
<<lessMain features:
- On Access Scanning
- Manual Scanning
- Quarantine Management
- Downloading Updates
- Mail Scanning (KMail/Evolution)
- Automated Installation
- Dazuko pre-package
Enhancements:
- Make compatible with ClamAV 0.90
Download (2.3MB)
Added: 2007-02-26 License: GPL (GNU General Public License) Price:
976 downloads
Puzzled 1.3
Puzzled project is a program which helps you solve complex grid-type logic problems. more>>
Puzzled project is a program which helps you solve complex grid-type logic problems.
Puzzled is a program which will ultimately help you solve complex grid-type logic problems by understanding pseudo-English translations of the clues provided with the problem.
It can automatically reassess clues containing comparative information (or, more than, less than, next to), and it has the persistent software preferences characteristic.
It comes with a pseudo-English language parser which supports the following relationships: is, is not, more than, less than, next to, not next to, and, or, and shorthand equivalents.
Main features:
- Possibility to open and save problem files
- Automatic reassessment of clues containing comparative information (or, more than, less than, next to)
- Persistent software preferences
- Positionable toolbar
- Pseudo-english language parser supports the following relationships: is, is not, more than, less than, next to, not next to, and, or and their shorthand equivalent (=, !=, >,<<less
Puzzled is a program which will ultimately help you solve complex grid-type logic problems by understanding pseudo-English translations of the clues provided with the problem.
It can automatically reassess clues containing comparative information (or, more than, less than, next to), and it has the persistent software preferences characteristic.
It comes with a pseudo-English language parser which supports the following relationships: is, is not, more than, less than, next to, not next to, and, or, and shorthand equivalents.
Main features:
- Possibility to open and save problem files
- Automatic reassessment of clues containing comparative information (or, more than, less than, next to)
- Persistent software preferences
- Positionable toolbar
- Pseudo-english language parser supports the following relationships: is, is not, more than, less than, next to, not next to, and, or and their shorthand equivalent (=, !=, >,<<less
Download (0.11MB)
Added: 2006-10-19 License: GPL (GNU General Public License) Price:
1107 downloads
Balmail 1.0
Balmail project is a small Perl script which sends an automated daily work report to your boss via e-mail. more>>
Balmail project is a small Perl script which sends an automated daily work report to your boss via e-mail.
balmail will email a daily report to your boss (or team leader) satisfying their need to quantify your daily technical acheivements. It can be customised to fit your typical list of one line tasks, and will automatically decide which you have done and how many each day.
Care has been taken to ensure that the e-mail does not appear to be automated, by varying the time the mail gets sent, the subject lines and the content each day.
A holiday feature ensures mail doesnt get sent whilst you are away.
<<lessbalmail will email a daily report to your boss (or team leader) satisfying their need to quantify your daily technical acheivements. It can be customised to fit your typical list of one line tasks, and will automatically decide which you have done and how many each day.
Care has been taken to ensure that the e-mail does not appear to be automated, by varying the time the mail gets sent, the subject lines and the content each day.
A holiday feature ensures mail doesnt get sent whilst you are away.
Download (0.005MB)
Added: 2006-11-16 License: GPL (GNU General Public License) Price:
1073 downloads
Secleted [ 0 ] software to compare
Copyright Notice:
Software piracy is theft, Using crack, password, serial numbers, registration codes, key generators is illegal and prevent future software development. The above automated logic search only lists software in full, demo and trial versions for free download. Download links are directly from our mirror sites or publisher sites, torrent files or links from rapidshare.com, yousendit.com or megaupload.com are not allowed