Free case study software for linux

JTestCase is a 100% pure Java, open-source framework that helps in separating test case data from test case units.

Although the following examples show JTestCase used together with junit, please note that JTestCase has no dependence on junit itself.

A moderately complex java projects may comprise hundreds of junit test case. JTestCase helps you organize your test cases in a rationale and efficient way.

To achieve this goal JTestCase provides:

- A propetary XML format to define your test cases in an abstract way.
- Easy-to-use API to retrieve data from XML file and to do assertion.

CLASS HIERARCHY

Hash::Case
is a Tie::StdHash
is a Tie::Hash

SYNOPSIS

use Hash::Case::Lower;
tie my(%lchash), Hash::Case::Lower;
$lchash{StraNGeKeY} = 3;
print keys %lchash; # strangekey

Hash::Case is the base class for various classes which tie special treatment for the casing of keys. Be aware of the differences in implementation: Lower and Upper are tied native hashes: these hashes have no need for hidden fields or other assisting data structured. A case Preserve hash will actually create three hashes.

The following strategies are implemented:

Hash::Case::Lower (native hash)

Keys are always considered lower case. The internals of this module translate any incoming key to lower case before it is used.

Hash::Case::Upper (native hash)

Like the ::Lower, but then all keys are always translated into upper case. This module can be of use for some databases, which do translate everything to capitals as well. To avoid confusion, you may want to have you own internal Perl hash do this as well.

Hash::Case::Preserve

The actual casing is ignored, but not forgotten.

METHODS

tie HASH, TIE, [VALUES,] OPTIONS

Tie the HASH with the TIE package which extends Hash::Case. The OPTIONS differ per implementation: read the manual page for the package you actually use. The VALUES is a reference to an array containing key-value pairs, or a reference to a hash: they fill the initial hash.

Examples:

my %x;
tie %x, Hash::Case::Lower;
$x{Upper} = 3;
print keys %x; # upper

my @y = (ABC => 3, DeF => 4);
tie %x, Hash::Case::Lower, @y;
print keys %x; # abc def

my %z = (ABC => 3, DeF => 4);
tie %x, Hash::Case::Lower, %z;
addPairs PAIRS

Specify an even length list of alternating key and value to be stored in the hash.

addHashData HASH

Add the data of a hash (passed as reference) to the created tied hash. The existing values in the hash remain, the keys are adapted to the needs of the the casing.

setHash HASH

The functionality differs for native and wrapper hashes. For native hashes, this is the same as first clearing the hash, and then a call to addHashData. Wrapper hashes will use the hash you specify here to store the data, and re-create the mapping hash.

CacheTable is a C++ template library that implements a very fast hash map container.
Its particularity, compared with std::hash_map and google::sparse_hash_map, is that it has a fixed size (decided it when it is created) and a random item replacement policy: in case of an "hash collision" the older item is "discarded" and replaced with the new one.
This container is ideal for implementing a caching system, when you want very fast item insertion and retrieval and you know the memory amount you want to dedicate ahead of time.
Enhancements:
- This release fixes a bug with deletion of iterator range, and work continues on more complete documentation.
- The test case has been reorganized to not require external libraries.

Campus Chat Server project is a chat server intended for use in the Cadiz University campus network.
Enhancements:
- hash_maps are now used instead of maps, so the cost of lookup or insertion is O(1) in the average case, instead of O(logn).

Chestnut FTP Search is a web application to search for files on FTP servers. Files can by searched only by file/directory names, nor be file contents. Users can query files by part of the file name, the entire file name, a regular expression, or a shell pattern.
The program is written in Python using web.py framework. To store file indexes PostgreSQL or MySQL is use.
Main features:
- Four search modes: partial match, exact match, regular expression, shell pattern. Every mode can by case sensitive or case insensitive
- Character set can by specified for particular server to allow non ASCII file names.
- Multi-threaded indexer
- i18n support

STuNT is a ticketing system, custom made to cover the needs of Space Hellas. STuNT is a web based application, build with simplicity and ease of use in mind. STuNT was designed to facilitate the work of support technicians and customers technicians while avoiding to add another layer of bureaucracy.
Main features:
- Web based. Minimum javascript used. Works even in text (console) browsers.
- Informational e-mails for each important action.
- Reminder (escalation) e-mails depending on case severity.
- Flie transfer facilities for each case.
- Complete action history for each case.
- Complete reminder e-mail history.