Main > Free Download Search >

Free outer software for linux

outer

Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 26
IGE - Outer Space 0.5.65

IGE - Outer Space 0.5.65


IGE - Outer Space is an on-line strategy game with SciFi theme. more>>
IGE - Outer Space is an on-line strategy game with SciFi theme.

IGE - Outer Space is an on-line strategy game which takes place in the dangerous universe. You must become the commander of many stars, planets, and great fleets and you will struggle for survival with other commanders.

Outer Space communicates with the server in the same way as your browser, but you will need a special client to play it. Using this client you can create an account on the server and you can start to explore the world of the Outer Space.

<<less
Download (MB)
Added: 2007-08-13 License: GPL (GNU General Public License) Price:
805 downloads
Orbit-Hopper 1.13

Orbit-Hopper 1.13


Orbit-Hopper is a game where you must jump from platform to platform in outer space. more>>
Orbit-Hopper is a game where you must jump from platform to platform in outer space.
Gameplay: Navigate a spaceship through 70+ levels by jumping over gaps and using special floor attributes such as jump-pads or speed-ups.
Game features different game modes:
- Time-Attack: Reach the end of a level as fast as possible to enter the highscore.
- Campaign: Finish all levels & beat all enemies without losing too much lives.
- Multiplayer (Split-screen): Mode 1: Reach your enemies "castle" to decrease his lives. Mode 2: Faster player wins.
Leveleditor is included. Zip includes Linux & Windows version.
<<less
Download (1.9MB)
Added: 2006-12-10 License: GPL (GNU General Public License) Price:
1050 downloads
SQL::Routine 0.70.3

SQL::Routine 0.70.3


SQL::Routine is a Perl module to specify all database tasks with SQL routines. more>>
SQL::Routine is a Perl module to specify all database tasks with SQL routines.

SYNOPSIS

This executable code example shows how to define some simple database tasks with SQL::Routine; it only shows a tiny fraction of what the module is capable of, since more advanced features are not shown for brevity.

use SQL::Routine;

eval {
# Create a model/container in which all SQL details are to be stored.
# The two boolean options being set true here permit all the subsequent code to be as concise,
# easy to read, and most SQL-string-like as possible, at the cost of being slower to execute.
my $model = SQL::Routine->new_container();
$model->auto_set_node_ids( 1 );
$model->may_match_surrogate_node_ids( 1 );

# This defines 4 scalar/column/field data types (1 number, 2 char strings, 1 enumerated value type)
# and 2 row/table data types; the former are atomic and the latter are composite.
# The former can describe individual columns of a base table (table) or viewed table (view),
# while the latter can describe an entire table or view.
# Any of these can describe a domain schema object or a stored procedures variables data type.
# See also the person and person_with_parents table+view defs further below; these data types help describe them.
$model->build_child_node_trees( [
[ scalar_data_type, { si_name => entity_id , base_type => NUM_INT , num_precision => 9, }, ],
[ scalar_data_type, { si_name => alt_id , base_type => STR_CHAR, max_chars => 20, char_enc => UTF8, }, ],
[ scalar_data_type, { si_name => person_name, base_type => STR_CHAR, max_chars => 100, char_enc => UTF8, }, ],
[ scalar_data_type, { si_name => person_sex , base_type => STR_CHAR, max_chars => 1, char_enc => UTF8, }, [
[ scalar_data_type_opt, M, ],
[ scalar_data_type_opt, F, ],
], ],
[ row_data_type, person, [
[ row_data_type_field, { si_name => person_id , scalar_data_type => entity_id , }, ],
[ row_data_type_field, { si_name => alternate_id, scalar_data_type => alt_id , }, ],
[ row_data_type_field, { si_name => name , scalar_data_type => person_name, }, ],
[ row_data_type_field, { si_name => sex , scalar_data_type => person_sex , }, ],
[ row_data_type_field, { si_name => father_id , scalar_data_type => entity_id , }, ],
[ row_data_type_field, { si_name => mother_id , scalar_data_type => entity_id , }, ],
], ],
[ row_data_type, person_with_parents, [
[ row_data_type_field, { si_name => self_id , scalar_data_type => entity_id , }, ],
[ row_data_type_field, { si_name => self_name , scalar_data_type => person_name, }, ],
[ row_data_type_field, { si_name => father_id , scalar_data_type => entity_id , }, ],
[ row_data_type_field, { si_name => father_name, scalar_data_type => person_name, }, ],
[ row_data_type_field, { si_name => mother_id , scalar_data_type => entity_id , }, ],
[ row_data_type_field, { si_name => mother_name, scalar_data_type => person_name, }, ],
], ],
] );

# This defines the blueprint of a database catalog that contains a single schema and a single virtual user which owns the schema.
my $catalog_bp = $model->build_child_node_tree( catalog, Gene Database, [
[ owner, Lord of the Root, ],
[ schema, { si_name => Gene Schema, owner => Lord of the Root, }, ],
] );
my $schema = $catalog_bp->find_child_node_by_surrogate_id( Gene Schema );

# This defines a base table (table) schema object that lives in the aforementioned database catalog.
# It contains 6 columns, including a not-null primary key (having a trivial sequence generator to give it
# default values), another not-null field, a surrogate key, and 2 self-referencing foreign keys.
# Each row represents a single person, for each storing up to 2 unique identifiers, name, sex, and the parents unique ids.
my $tb_person = $schema->build_child_node_tree( table, { si_name => person, row_data_type => person, }, [
[ table_field, { si_row_field => person_id, mandatory => 1, default_val => 1, auto_inc => 1, }, ],
[ table_field, { si_row_field => name , mandatory => 1, }, ],
[ table_index, { si_name => primary , index_type => UNIQUE, }, [
[ table_index_field, person_id, ],
], ],
[ table_index, { si_name => ak_alternate_id, index_type => UNIQUE, }, [
[ table_index_field, alternate_id, ],
], ],
[ table_index, { si_name => fk_father, index_type => FOREIGN, f_table => person, }, [
[ table_index_field, { si_field => father_id, f_field => person_id } ],
], ],
[ table_index, { si_name => fk_mother, index_type => FOREIGN, f_table => person, }, [
[ table_index_field, { si_field => mother_id, f_field => person_id } ],
], ],
] );

# This defines a viewed table (view) schema object that lives in the aforementioned database catalog.
# It left-outer-joins the person table to itself twice and returns 2 columns from each constituent, for 6 total.
# Each row gives the unique id and name each for 3 people, a given person and that persons 2 parents.
my $vw_pwp = $schema->build_child_node_tree( view, { si_name => person_with_parents,
view_type => JOINED, row_data_type => person_with_parents, }, [
( map { [ view_src, { si_name => $_, match => person, }, [
map { [ view_src_field, $_, ], } ( person_id, name, father_id, mother_id, ),
], ], } (self) ),
( map { [ view_src, { si_name => $_, match => person, }, [
map { [ view_src_field, $_, ], } ( person_id, name, ),
], ], } ( father, mother, ) ),
[ view_field, { si_row_field => self_id , src_field => [person_id,self ], }, ],
[ view_field, { si_row_field => self_name , src_field => [name ,self ], }, ],
[ view_field, { si_row_field => father_id , src_field => [person_id,father], }, ],
[ view_field, { si_row_field => father_name, src_field => [name ,father], }, ],
[ view_field, { si_row_field => mother_id , src_field => [person_id,mother], }, ],
[ view_field, { si_row_field => mother_name, src_field => [name ,mother], }, ],
[ view_join, { lhs_src => self, rhs_src => father, join_op => LEFT, }, [
[ view_join_field, { lhs_src_field => father_id, rhs_src_field => person_id } ],
], ],
[ view_join, { lhs_src => self, rhs_src => mother, join_op => LEFT, }, [
[ view_join_field, { lhs_src_field => mother_id, rhs_src_field => person_id } ],
], ],
] );

# This defines the blueprint of an application that has a single virtual connection descriptor to the above database.
my $application_bp = $model->build_child_node_tree( application, Gene App, [
[ catalog_link, { si_name => editor_link, target => $catalog_bp, }, ],
] );

# This defines another scalar data type, which is used by some routines that follow below.
my $sdt_login_auth = $model->build_child_node( scalar_data_type, { si_name => login_auth,
base_type => STR_CHAR, max_chars => 20, char_enc => UTF8, } );

# This defines an application-side routine/function that connects to the Gene Database, fetches all
# the records from the person_with_parents view, disconnects the database, and returns the fetched records.
# It takes run-time arguments for a user login name and password that are used when connecting.
my $rt_fetch_pwp = $application_bp->build_child_node_tree( routine, { si_name => fetch_pwp,
routine_type => FUNCTION, return_cont_type => RW_ARY, return_row_data_type => person_with_parents, }, [
[ routine_arg, { si_name => login_name, cont_type => SCALAR, scalar_data_type => $sdt_login_auth }, ],
[ routine_arg, { si_name => login_pass, cont_type => SCALAR, scalar_data_type => $sdt_login_auth }, ],
[ routine_var, { si_name => conn_cx, cont_type => CONN, conn_link => editor_link, }, ],
[ routine_stmt, { call_sroutine => CATALOG_OPEN, }, [
[ routine_expr, { call_sroutine_cxt => CONN_CX, cont_type => CONN, valf_p_routine_item => conn_cx, }, ],
[ routine_expr, { call_sroutine_arg => LOGIN_NAME, cont_type => SCALAR, valf_p_routine_item => login_name, }, ],
[ routine_expr, { call_sroutine_arg => LOGIN_PASS, cont_type => SCALAR, valf_p_routine_item => login_pass, }, ],
], ],
[ routine_var, { si_name => pwp_ary, cont_type => RW_ARY, row_data_type => person_with_parents, }, ],
[ routine_stmt, { call_sroutine => SELECT, }, [
[ view, { si_name => query_pwp, view_type => ALIAS, row_data_type => person_with_parents, }, [
[ view_src, { si_name => s, match => $vw_pwp, }, ],
], ],
[ routine_expr, { call_sroutine_cxt => CONN_CX, cont_type => CONN, valf_p_routine_item => conn_cx, }, ],
[ routine_expr, { call_sroutine_arg => SELECT_DEFN, cont_type => SRT_NODE, act_on => query_pwp, }, ],
[ routine_expr, { call_sroutine_arg => INTO, query_dest => pwp_ary, cont_type => RW_ARY, }, ],
], ],
[ routine_stmt, { call_sroutine => CATALOG_CLOSE, }, [
[ routine_expr, { call_sroutine_cxt => CONN_CX, cont_type => CONN, valf_p_routine_item, conn_cx, }, ],
], ],
[ routine_stmt, { call_sroutine => RETURN, }, [
[ routine_expr, { call_sroutine_arg => RETURN_VALUE, cont_type => RW_ARY, valf_p_routine_item => pwp_ary, }, ],
], ],
] );

# This defines an application-side routine/procedure that inserts a set of records, given in an argument,
# into the person table. It takes an already opened db connection handle to operate through as a
# context argument (which would represent the invocant if this routine was wrapped in an object-oriented interface).
my $rt_add_people = $application_bp->build_child_node_tree( routine, { si_name => add_people, routine_type => PROCEDURE, }, [
[ routine_context, { si_name => conn_cx, cont_type => CONN, conn_link => editor_link, }, ],
[ routine_arg, { si_name => person_ary, cont_type => RW_ARY, row_data_type => person, }, ],
[ routine_stmt, { call_sroutine => INSERT, }, [
[ view, { si_name => insert_people, view_type => INSERT, row_data_type => person, ins_p_routine_item => person_ary, }, [
[ view_src, { si_name => s, match => $tb_person, }, ],
], ],
[ routine_expr, { call_sroutine_cxt => CONN_CX, cont_type => CONN, valf_p_routine_item => conn_cx, }, ],
[ routine_expr, { call_sroutine_arg => INSERT_DEFN, cont_type => SRT_NODE, act_on => insert_people, }, ],
], ],
] );

# This defines an application-side routine/function that fetches one record
# from the person table which matches its argument.
my $rt_get_person = $application_bp->build_child_node_tree( routine, { si_name => get_person,
routine_type => FUNCTION, return_cont_type => ROW, return_row_data_type => person, }, [
[ routine_context, { si_name => conn_cx, cont_type => CONN, conn_link => editor_link, }, ],
[ routine_arg, { si_name => arg_person_id, cont_type => SCALAR, scalar_data_type => entity_id, }, ],
[ routine_var, { si_name => person_row, cont_type => ROW, row_data_type => person, }, ],
[ routine_stmt, { call_sroutine => SELECT, }, [
[ view, { si_name => query_person, view_type => JOINED, row_data_type => person, }, [
[ view_src, { si_name => s, match => $tb_person, }, [
[ view_src_field, person_id, ],
], ],
[ view_expr, { view_part => WHERE, cont_type => SCALAR, valf_call_sroutine => EQ, }, [
[ view_expr, { call_sroutine_arg => LHS, cont_type => SCALAR, valf_src_field => person_id, }, ],
[ view_expr, { call_sroutine_arg => RHS, cont_type => SCALAR, valf_p_routine_item => arg_person_id, }, ],
], ],
], ],
[ routine_expr, { call_sroutine_cxt => CONN_CX, cont_type => CONN, valf_p_routine_item => conn_cx, }, ],
[ routine_expr, { call_sroutine_arg => SELECT_DEFN, cont_type => SRT_NODE, act_on => query_person, }, ],
[ routine_expr, { call_sroutine_arg => INTO, query_dest => person_row, cont_type => RW_ARY, }, ],
], ],
[ routine_stmt, { call_sroutine => RETURN, }, [
[ routine_expr, { call_sroutine_arg => RETURN_VALUE, cont_type => ROW, valf_p_routine_item => person_row, }, ],
], ],
] );

# This defines 6 database engine descriptors and 2 database bridge descriptors that we may be using.
# These details can help external code determine such things as what string-SQL flavors should be
# generated from the model, as well as which database features can be used natively or have to be emulated.
# The si_name has no meaning to code and is for users; the other attribute values should have meaning to said external code.
$model->build_child_node_trees( [
[ data_storage_product, { si_name => SQLite v3.2 , product_code => SQLite_3_2 , is_file_based => 1, }, ],
[ data_storage_product, { si_name => MySQL v5.0 , product_code => MySQL_5_0 , is_network_svc => 1, }, ],
[ data_storage_product, { si_name => PostgreSQL v8, product_code => PostgreSQL_8, is_network_svc => 1, }, ],
[ data_storage_product, { si_name => Oracle v10g , product_code => Oracle_10_g , is_network_svc => 1, }, ],
[ data_storage_product, { si_name => Sybase , product_code => Sybase , is_network_svc => 1, }, ],
[ data_storage_product, { si_name => CSV , product_code => CSV , is_file_based => 1, }, ],
[ data_link_product, { si_name => Microsoft ODBC v3, product_code => ODBC_3, }, ],
[ data_link_product, { si_name => Oracle OCI*8, product_code => OCI_8, }, ],
[ data_link_product, { si_name => Generic Rosetta Engine, product_code => Rosetta::Engine::Generic, }, ],
] );

# This defines one concrete instance each of the database catalog and an application using it.
# This concrete database instance includes two concrete user definitions, one that can owns
# the schema and one that can only edit data. The concrete application instance includes
# a concrete connection descriptor going to this concrete database instance.
# Note that user descriptions are only stored in a SQL::Routine model when that model is being used to create
# database catalogs and/or create or modify database users; otherwise user should not be kept for security sake.
$model->build_child_node_trees( [
[ catalog_instance, { si_name => test, blueprint => $catalog_bp, product => PostgreSQL v8, }, [
[ user, { si_name => ronsealy, user_type => SCHEMA_OWNER, match_owner => Lord of the Root, password => K34dsD, }, ],
[ user, { si_name => joesmith, user_type => DATA_EDITOR, password => fdsKJ4, }, ],
], ],
[ application_instance, { si_name => test app, blueprint => $application_bp, }, [
[ catalog_link_instance, { blueprint => editor_link, product => Microsoft ODBC v3, target => test, local_dsn => keep_it, }, ],
], ],
] );

# This defines another concrete instance each of the database catalog and an application using it.
$model->build_child_node_trees( [
[ catalog_instance, { si_name => production, blueprint => $catalog_bp, product => Oracle v10g, }, [
[ user, { si_name => florence, user_type => SCHEMA_OWNER, match_owner => Lord of the Root, password => 0sfs8G, }, ],
[ user, { si_name => thainuff, user_type => DATA_EDITOR, password => 9340sd, }, ],
], ],
[ application_instance, { si_name => production app, blueprint => $application_bp, }, [
[ catalog_link_instance, { blueprint => editor_link, product => Oracle OCI*8, target => production, local_dsn => ship_it, }, ],
], ],
] );

# This defines a third concrete instance each of the database catalog and an application using it.
$model->build_child_node_trees( [
[ catalog_instance, { si_name => laptop demo, blueprint => $catalog_bp, product => SQLite v3.2, file_path => Move It, }, ],
[ application_instance, { si_name => laptop demo app, blueprint => $application_bp, }, [
[ catalog_link_instance, { blueprint => editor_link, product => Generic Rosetta Engine, target => laptop demo, }, ],
], ],
] );

# This line will run some correctness tests on the model that were not done
# when the model was being populated for execution speed efficiency.
$model->assert_deferrable_constraints();

# This line will dump the contents of the model in pretty-printed XML format.
# It can be helpful when debugging your programs that use SQL::Routine.
print $model->get_all_properties_as_xml_str( 1 );
};
$@ and print error_to_string($@);

# SQL::Routine throws object exceptions when it encounters bad input; this function
# will convert those into human readable text for display by the try/catch block.
sub error_to_string {
my ($message) = @_;
if (ref $message and UNIVERSAL::isa( $message, Locale::KeyedText::Message )) {
my $translator = Locale::KeyedText->new_translator( [SQL::Routine::L::], [en] );
my $user_text = $translator->translate_message( $message );
return q{internal error: cant find user text for a message: }
. $message->as_string() . . $translator->as_string();
if !$user_text;
return $user_text;
}
return $message; # if this isnt the right kind of object
}

Note that one key feature of SQL::Routine is that all of a models pieces are linked by references rather than by name as in SQL itself. For example, the name of the person table is only stored once internally; if, after executing all of the above code, you were to run "$tb_person->set_attribute( si_name, The Huddled Masses );", then all of the other parts of the model that referred to the table would not break, and an XML dump would show that all the references now say The Huddled Masses.

For some more (older) examples of SQL::Routine in use, see its test suite code.

<<less
Download (0.17MB)
Added: 2006-09-12 License: Perl Artistic License Price:
1137 downloads
AdaControl 1.6r8

AdaControl 1.6r8


AdaControl is a free tool that detects the use of various kinds of constructs in Ada programs. more>>
AdaControl is a free (GMGPL) tool that detects the use of various kinds of constructs in Ada programs. AdaControls first goal is to control proper usage of style or programming rules, but it can also be used as a powerful tool to search for use (or non-use) of various forms of programming styles or design patterns. Searched elements range from very simple, like the occurrence of certaine entities, declarations, or statements, to very sophisticated, like verifying that certain programming patterns are being obeyed..
Which elements or constructs are searched is defined by a set of rules; the following table gives a short summary of rules currently checked by AdaControl. The number in parentheses after the rule name gives the number of subrules, if any. Considering all possible rules and subrules, this makes 216 tests that can be performed currently by AdaControl!
- Abnormal_Function_Return Controls a design pattern that ensures that a function always returns a result .
- Allocators Controls ocurrences of allocators, either all of them, or those targeting specified types.
- Array_Declarations (x2) Controls several metrics in array declarations.
- Barrier_Expressions Controls elements allowed in the expression of protected entries barriers
- Case_Statement (x4) Controls several metrics in case statements.
- Control_Characters Controls occurrences of control characters (like tabs) in the source.
- Declarations (x75) Controls occurrences of certain Ada declarations.
- Default_Parameter Controls subprogram calls and generic instantiations that use (or not) the default value for a given parameter.
- Directly_Accessed_Globals Controls a design pattern that ensures that all global variables are accessed only through dedicated subprograms.
- Entities Controls occurrences of any Ada entity.
- Entity_Inside_Exception Controls occurrences of entities inside exception handlers.
- Exception_Propagation (x4) Controls that certain subprograms (or tasks) cannot propagate exceptions, or that no elaboration can propagate exceptions.
- Expressions (x9) Controls usage of certain forms of expressions
- Global_References Controls unsynchronized accesses to global variables.
- Header_Comments (x2) Controls the presence of comments at the start of each module.
- If_For_Case Controls if statements that could be replaced by case statements.
- Instantiations Controls generic instantiations, either all of them, or those that use specified entities.
- Insufficient_Parameters Controls the use of positional parameters in calls where the value does not provide sufficient information.
- Local_Hiding Controls occurrences of local identifiers that hide an identical outer one.
- Local_Instantiation Controls instantiations in local scopes.
- Max_Blank_Lines Controls the occurrence of more than a specified number of consecutive empty lines.
- Max_Call_Depth Controls the maximum depth of subprogram calls.
- Max_Line_Length Controls maximal length of source lines.
- Max_Nesting Controls scopes nested more deeply than a given limit.
- Max_Parameters (x6) Controls the maximum numbers of parameters in callable entities (procedures, functions and entries)
- Max_Statement_Nesting (x5) Controls composite statements nested more deeply than a given limit.
- Movable_Accept_Statements Controls statements that could be moved outside an accept statement.
- Naming_Convention Controls the form of allowed (or forbidden) names in declarations.
- No_Safe_Initialization Controls a design pattern that ensures that any variable is initialized before being used.
- Non_Static (x3) Controls non static expressions in index or discriminant constraints, or in instantiations.
- Not_Elaboration_Calls Controls subprogram calls performed from places outside package elaboration code.
- Other_Dependencies Controls semantic dependencies to other units than those indicated
- Parameter_Aliasing Controls subprograms and entry calls where a variable is provided to more than one [in] out parameter.
- Potentially_Blocking_Operations Controls the use of potentially blocking operations from within protected operations.
- Pragmas Controls the use of specific pragmas.
- Real_Operators Controls occurrences of = or /= operators on real types.
- Reduceable_Scope Controls declarations that could be move to more deeply nested scopes.
- Representation_Clauses Controls occurrences of representation clauses.
- Return_Type Controls the use of certain kinds of types as return types of functions.
- Side_Effect_Parameters Controls subprogram calls and generic instantiations that call functions with side effect, thus creating a dependance to the order of evaluation.
- Silent_Exceptions Controls exception handlers that do not reraise exceptions nor call indicated subprograms.
- Simplifiable_Expressions (x4) Controls occurrences of various forms of expressions that could be simplified.
- Special_Comments Controls the presence of certain string patterns in comments.
- Statements (x42) Controls occurrences of Ada statements.
- Style (x12) Controls various forms of constructs generally recommended in style rules.
- Terminating_Tasks Controls a design pattern that ensures that tasks never terminate.
- Uncheckable (x3) Controls constructs that are not statically checkable by other rules
- Unnecessary_Use_Clause Controls use clauses on packages, where no element of the package is referred to within the scope of the use clause.
- Unsafe_Paired_Calls Controls a design pattern that ensures that certain calls are allways paired (like P/V procedures).
- Unsafe_Unchecked_Conversion Controls instantiations of Unchecked_Conversion between types of different or unspecified sizes.
- Usage (x5) Controls usage of objects under certain conditions (in package specifications, read, written modified...).
- Use_Clauses Controls occurrences of use clauses, except for indicated packages.
- With_Clauses (x3) Controls proper usage of with clauses.
Enhancements:
- This release adds rules to check that header comments match a given pattern.
- It has indication of possible false positives and false negatives due to non-statically analyzable constructs.
- There is a fine definition of constructs allowed in entry barriers (including the one of the Ravenscar profile).
- There is better integration into GPS, and much more.
<<less
Download (1.0MB)
Added: 2006-12-08 License: GMGPL (GNAT Modified GPL) Price:
1050 downloads
Scum of the Universe 1.0

Scum of the Universe 1.0


Scum of the Universe is a space trading game that combines two genres: arcade and strategy. more>>
Scum of the Universe is a space trading game that combines two genres: arcade and strategy. On one side, its a classic vertical-scrolling space shooter game. On the other side, it is an adventure and strategy. You should choose whether youll be an independent space trader, firearms smuggler, fierce freedom-fighter or something in between.

Following the main storyline, you go through the galaxy from one planet to another. Space travel requires fuel, so you need to keep earning money to buy it. You can also buy various upgrades for your spaceship and weapons that affect the arcade part of the game. The storyline itself is not linear. There are also some points where youll need to make decisions that will determine your destiny.

For thousands of years, people of planet Xen have colonized the planets in their galaxy. As time went by, many colonies grew unhappy about their status, as everything was controlled by Xen. Some of them organized military units and declared independence. You can see the status of each planet by "Rebel Sentiment" indicator. Planets with RS higher than 50% are ruled by the Rebel government, and Rebel laws apply.

Trading firearms is legal on planets ruled by Rebels, as they need as much firepower as they can get. On the other hand, Empire forbid all the trading with firearms and other ground weaponry as they wish to maintain their military advantage. One of the ways to make a lot of money is to buy cheap guns at Empire planets and sell them for a lot of money on Rebel planets where demand is extremely high. But be careful as youll need to fight Empire fleet once they find out youre a smuggler.

Beside the raging war between Xen Empire and the rebels there is increased activity of alien species, who destroy human ships. The stronger alien activity, the more waves of alien ships youll need to defeat in each planets outer orbit. Some of the aliens you destroy may drop artifacts (big blue ones) which you can sell at any space station for 20credits a piece.

<<less
Download (3.6MB)
Added: 2007-06-01 License: Freeware Price:
877 downloads
Esper 0.8.0

Esper 0.8.0


Esper is a 100% Java component for CEP and ESP applications. more>>
Esper project is a 100% Java component for CEP and ESP applications.
Main features:
- Event Pattern Matching
- Logical and temporal event correlation
- Crontab-like timer at operator
- Lifecyle of pattern can be controlled by timer and via operators
- Pattern-matched events provided to listeners
- Event Stream Processing
- Time-based, interval-based and lenght-based event windows
- Grouping, aggregation, sorting, filtering
- Tailored SQL-like query language using select and where clause
- Inner-Join of two or more event streams, outer joins
- Dynamically generated indexes
- Supports both listener (push) and consumer (pull) model
- Supports event-type inheritance and polymorphism as provided by the Java language
- Event properties can be simple, indexed, mapped or nested
- Supports externally-supplied time as well as Java system time
- Supports multiple independent Esper engines per JavaVM. Each engine instance itself is NOT multithread-safe, requiring workload structuring per engine if necessary (also see FAQ on multithread-safety).
Version restrictions:
- Esper requires a Java Virtual Machine version 5.0 runtime, or above.
- Esper will not work with JavaVM versions 1.4.2 or below.
- A Esper engine instance itself is NOT multithread-safe, i.e. 2 or more threads sending events to the same engine instance is not supported. However multiple engine instances with a maximum of one thread per engine instance is supported.
<<less
Download (4.6MB)
Added: 2006-03-27 License: LGPL (GNU Lesser General Public License) Price:
1309 downloads
tvmet 1.7.2

tvmet 1.7.2


tvmet is a Vector and Matrix template library uses Meta Templates and Expression Templates to evaluate results at compile time. more>>
tvmet is a Vector and Matrix template library that uses Meta Templates and Expression Templates (ET) to evaluate results at compile time, thus making it fast for low-end systems.
Temporaries are avoided because of this. The produced code is similar to hand-coded code, but the quality of the code still depends on the compiler and its version. The dimensions for vectors and matrices are static and bounded at compile time using template arguments.
Main features:
- Matrices and Vectors with fixed sizes (of course), the data is stored in a static array.
- compile time dimension check for Vectors and Matrices to preserve the mathematical meaning.
- vector, matrix, matrix-matrix and matrix-vector fast operations:
- complete set of standard arithmetic operations for Vectors and Matrices (blitz++ supports this only for TinyVector).
- complete set of standard compare operations for Vectors and Matrices as well as ternary functions like a ? b : c (see eval for use).
- binary and unary operations.
- meta template use for Matrix-Matrix-Product $M,M$, Matrix-Transpose $M^T$ and Matrix-Vector-Product $M,x$ functions and operators.
- meta template for special functions like $M^T, x$, $M^T,M$, $M,M^T$ and $(M,M)^T$ functions, see ... special Meta-Template Functions.
- simple Matrix rows and column access as a Vector.
- chaining of matrix and vector expressions is possible and working.
- Vector inner and outer product (dot and cross product).
- special handling for the aliasing problem - see ... about aliasing.
- STL iterator interface. This opens the door to all sorts of great STL applications.
- type promotion (for handling Matrices and Vectors of differing types).
- works on self defined types such as the std::complex type.
- makes no use of exceptions. Therefore you can use it for embedded systems or in Linux kernel space.
- nice expression level printing for debugging purposes (print the expanded expression tree).
- good documentation with examples.
- regression tests for nearly all operations and functions.
- support for several compilers (see Compiler Support).
- written as a pure class and template library, no binary libraries and versioning are needed - designed to avoid code blot due to the use of templates.
- ISO/IEC 14882:1998 compliant.
<<less
Download (MB)
Added: 2007-06-26 License: LGPL (GNU Lesser General Public License) Price:
852 downloads
StelsDBF 2.0

StelsDBF 2.0


StelsDBF is a DBF JDBC type 4 driver that allows to perform SQL queries and other JDBC operations on DBF files. more>>
StelsDBF is a DBF JDBC type 4 driver that allows to perform SQL queries and other JDBC operations on DBF files (dBase III/ IV/ V, xBase, FoxPro, FoxBase, Clipper).
StelsDBF driver is completely platform-independent and does not require installing additional client or server software to provide access to DBF files. It can be effectively used to create, process and export DBF databases in your Java applications.
Main features:
- It supports most keywords of ANSI SQL92
- It supports inner and outer table joins
- It supports CREATE, INSERT, UPDATE and DELETE statements
- It supports transactions
- It supports aggregate, converting, string and user-defined SQL functions
- It is a platform independent
<<less
Download (0.23MB)
Added: 2007-01-31 License: Freely Distributable Price:
1001 downloads
Ticket-IT 3.0

Ticket-IT 3.0


Ticket-IT is a tool for the creation, management, and accompaniment of tickets. more>>
Ticket-IT is a tool for the creation, management, and accompaniment of tickets.
Ticket-IT is a tool directed towards companies that need a better integration and distribution of informantion about service to customers, support, development of products, callcenter, etc, among its several departments.
Ticket-IT has resource of easy utilization, concentration display and distribution of information, making possible its total adaptation to most distintc institutes and applications, being a perfect tool to HelpDesk, CallCenter and online support.
Main features:
Control and management of access
- User registration;
- Group registration;
- Access permission and actions based in group;
- Schedule of events;
- Users profile, top-configured;
Integration among sectors/departments
- Control of context categories, making possible the organization and cataloging of calls (tickets) being made or already made;
- Assign of users group per categories;
- Forwarding ticket to outer users that will be able to display calls and post comments;
- Partial or total ticket forwarding, making possible to manage information and function of the contributors of your company;
Information distribution
- Alerts via e-mail about create, opening, proceeding, close and re-opening or comments of tickets to those involved in categories;
- Main display of personal tickets, or collaborating, getting fast access to tickets, making service easier;
- Exchanging information based in a simple fulfilling of information, which due to Ticket-IT utomation, distribute it to those involved in the process;
- Protocol forwarding to outer agent access (customers, reps, etc) without the necessity of user and password;;
Enhancements:
- This release implements a Web installer and an option for personalization of the feedback message.
- The item "User of Companies" has already been implemented, along with its existing resources.
- A mask was applied (ticket comments and feedback) for guest users, so they will see the groups name instead of the users name in comments.
- Some minor bugs have been fixed.
- The gettext internationalization schema has been finished.
- The English (US) translation is done.
- There are some visual improvements.
<<less
Download (0.25MB)
Added: 2007-01-29 License: GPL (GNU General Public License) Price:
1008 downloads
Avanor, the Land of Mystery 0.5.8

Avanor, the Land of Mystery 0.5.8


Avanor is rapidly-growing Rogue-like game with an easy ADOM-like user interface. more>>
Avanor, the Land of Mystery is rapidly-growing Rogue-like game with an easy ADOM-like user interface. It has countryside and subterranean areas to explore, a quest system, and some original features.
Moving and locations
1 - south-west
2 - south
3 - south-east
4 - west
5 - current position
6 - east
7 - north-west
8 - north
9 - north-east
w + direction - walk in direction until something interesting is found
~ - rest a while (for debugging purposes only)
o - open a door
c - close a door
< - go up stairs
> - go down stairs
l - look at a location
Dealing with objects
e - equip an item
i - display your inventory
d - drop an item
, - pick up an item
E - eat an item of food
D - drink a potion
! - mix potions
r - read a book or scroll
s or _ - sacrifice an item
O - open a chest
g - give an item to somebody
u - use a tool
P - quick pay
Characteristics and skills
A - display your skill levels
a - use a skill
q - display the quests you have undertaken
@ - display your character details
W - display your weapon skills
x - display experience needed to gain next level
Combat and spellcasting
t - target an opponent
p - pray to the gods for aid
T - change your combat tactics
Z - cast a spell
^Z - repeat the last spell cast
# - display your elemental magic levels (not yet used)
Miscellaneous commands
U - use outer objects
R - show list of alchemy recipes
C - chat with somebody
S - save the game
Q - quit the game
M - display previously shown messages
0 - recenter the screen on the player
[ - make screenshot
? - display this manual
Enhancements:
- Fixed bug with traps
- Support for compilation with modern compilers
- FHS compatibility and Gentoo Linux ebuild
<<less
Download (MB)
Added: 2006-06-01 License: GPL (GNU General Public License) Price:
1243 downloads
Intellidiscs 1.1

Intellidiscs 1.1


Intellidiscs is a Remake of Tron: Deadly Discs for the classic Intellivision console. more>>
Intellidiscs is a Remake of Tron: Deadly Discs for the classic Intellivision console. Its also one of the few, if not the first, Tron freeware games that has nothing to do with light-cycles.

Basically, you run around in an arena fighting off bad guys with your disc. There are four different varieties of bad guy, and one of them has three different varieties of disc. More difficult enemies appear as your score increases, with the most difficult showing up if you can reach 1,000,000 points.

Bad guys enter through doors on the sides of the arena. You can jam these doors open by either hitting them with your disc, or by running into them. If you jam open doors that are opposite each other, you can run in one side and come out the other. This is very important to your survival.

If you jam enough doors, eventually a recognizer will be dispatched to fix them. If you can hit the recognizer when its eye is open, it will stop fixing the doors and leave the arena. Plus, you get lots of points for this.

You can take three hits before you die, and every hit makes you slower! You will eventually recover from damage, regaining your speed as well. Touching the recognizer kills you instantly, so dont do it.

Default controls are the familiar WASD to move, and the outer keys of numpad (1, 2, 3, 4, 6, 7, 8, 9, non-Mac users turn Num Lock on!) throw your disc in any of eight directions. If you press one of the throw keys while your disc is in flight, it will return to you. Discs are harmless when returning. If you move away from your disc as it is flying back, it will never catch up to you, you must stop and catch it. All of the controls can be changed from the main menu.

<<less
Download (2.8MB)
Added: 2007-05-01 License: Freeware Price:
908 downloads
The Attack of Mutant Fruits for linux 1.0

The Attack of Mutant Fruits for linux 1.0


The Earth have a new enemy,The Mutant Fruits are crossing the galaxy . more>> When Human Beings have been destroyed themselves ... who will replace them?. Trying to avoid the disaster, The Earth Alliance sent to another planets the main fruits and vegatables seeds to have an ecological reserve, but maybe ... is late. Most of seeds mutanted to new species.
The Earth have a new enemy, from outer space, The Mutant Fruits are crossing the galaxy to conquest our world.
Who will be our hero?
Features
* 10 worlds around the galaxy.
* 8 original melodies. Pump up the volume and enjoy it.
* 3 different weapons and shields to destroy the enemies.
* Keyboard and Joystick support. Ready for arcade systems.
<<less
Download (14MB)
Added: 2009-04-03 License: Freeware Price:
204 downloads
tcpproxy 2.0.0 Beta 13

tcpproxy 2.0.0 Beta 13


tcpproxy project is a proxy (or tunnel or redirector) for TCP/IP protocols. more>>
tcpproxy project is a proxy (or tunnel or redirector) for TCP/IP protocols. In standalone mode it waits for incoming connections forwarding them to another machine or starting a local server program.
Several programs with this function or something similiar are around. However, tcpproxys design goal was to let it operate on some kind of firewall.
Main features:
- Extensive logging to syslog,
- Interface based configuration,
- can bind to a particular interface on a multi-homed host,
- sets environment variables before calling a local server program,
- support for external access control programs,
- can be started from inetd or run in standalone mode.
tcpproxy was created with a transparent TCP proxy in mind. When its used to start local server programs (e.g. an FTP server) it can however also work as "port multiplexer" since it requires different configurations for different interfaces (there are no defaults).
Interface based configuration
tcpproxys services are always bound to a certain interface. Suppose you have a multi-homed host (e.g. a firewall) with the IP numbers 192.168.0.1 (part of your LAN) and 10.11.12.13 (connected to the Internet). The configuration
port 119
interface 192.168.0.1
server news.provider.com
forwards then any connection made to your local interface on the NNTP port to the machine news.provider.com. The providers news server appears now to run on your firewall. Furthermore, if you for each port only a single interface where you want to have tcpproxys service, tcpproxy will not even bind to the others. For the example above this means that someone trying to connect to your external interface would only see a closed port.
Now suppose you want to use a second NNTP server from your LAN. You would first configure a second IP number on your internal interface, e.g. 192.168.0.2 and then reconfigure tcpproxy:
port 119
interface 192.168.0.1
server news.provider.com
interface 192.168.0.2
server news.freshmeat.com
Depending on the incoming interface of a client request the connection is forwarded to one of the servers.
In this case the firewalls external interface is opened on port 119 and a port scan would show that theres some kind of service. If however someone connects to the outer interface the connection is immediatly dropped, simply because tcpproxy isnt configured to handle request on the interface 10.11.12.13 and tcpproxy doesnt accept service defaults.
If you like you can extend this configuration to
port 119
interface 192.168.0.1
server news.provider.com
interface 192.168.0.2
server news.freshmeat.com
interface 10.11.12.13
exec /bin/date
for the scanners amusement. But you might also want to write a message to your systems syslog.
Access control
tcpproxy implements access control by calling external, user provided, script, the so called "access control programs" (or in short: acps). I implemented them because I wanted to be able to deny service usage based on anything I like, not just on the clients IP number or its name.
<<less
Download (0.037MB)
Added: 2007-04-18 License: GPL (GNU General Public License) Price:
919 downloads
RPL/2 4.00.prerelease.0

RPL/2 4.00.prerelease.0


RPL/2 is a programming language for computations. more>>
RPL/2 is a special language, and could be the strange child of forbidden love between Lisp and Forth. The reversed polish notation and the definitional working come from Forth, only keeping an anonymous stack; the control structures come from Lisp. What a brilliant genealogy !
This language has very weak typing, if any typing at all. The variables are declared on-the-fly at their first use, and the type of the data to store at that time is used. So the same variable X might contain a complex matrix and a few moments later, a string.In fact, using variables is not very common, because everything can be done directly with objects present in the stack.
The five hundred and twenty-five thousand lines of code (!) can be cleanly compiled. The language is fully usable (I do so every day); RPL/2 scripts can be run, and external compiled routines might be called. The interface with the outer world is a C interface.
The usable and working data types are as follows:
- Binary integers (64 bits);
- Signed integers (64 bits);
- Real numbers (64 bits);
- Complex numbers (2*64 bits);
- Strings (any length);
- Lists;
- Complex,real or integer vectors;
- Complex,real or integer matrices;
- Names;
- Algebraic expressions;
- Expressions stated in reverse polish notation.
At the time of this writing, built-in definitions are:
- The whole set of stack management operations;
- The functions related to local and global variables,as well as sub-definitions jumping;
- Defined and undefined loops,with or without a counter;
- Comparison functions;
- Testing instructions;
- Functions dealing with trigonometry;
- Logarithmical functions;
- Advanced calculations on matrices (LU decomposition,generalized eigenvalues)
- Evaluation functions EVAL and ->NUM;
- and many others...
Enhancements:
- An examples subdirectory was added. Major bugs were fixed in interface_tex.c, tex.h, ->HMS, and recherche_variable().
- When an expression is evaluated in a function, all variables set in this function must be visible in the expression.
- LAST stack is saved in rplcore.
- A major bug was fixed when rpl is called with an empty file.
- Libtool support was removed.
- Two new scripts (rplc and rpllink) are provided to use librpl.a.
- Trace output now contains PID.
- rpl-core was renamed to rpl-code-$PID.
- The librpl entry point was modified to return results as an array of strings.
- The -S option was added.
- VERSION was modified to return a list.
<<less
Download (7.7MB)
Added: 2007-07-25 License: GPL (GNU General Public License) Price:
823 downloads
Cego 2.3.10

Cego 2.3.10


Cego implements a relational and transactional database system with support for the SQL query language. more>>

Cego 2.3.10 won't make you disappointed cause it can be invoked in creation mode, batch mode ( single threaded ) or daemon mode ( multi threaded ) to serve client requests.

Major Features:

  1. cgclt is the database client program for accessing the database as a database user. The client program can be invoked in batch mode to process a sql script or interactive mode to use it as an interactive shell.In both modes, several database information queries and any kind of query SQL queries are sent to the server daemon and the corresponding result is received.
  2. To enable applications to access Cego, four API's are provided by the framework. The Cego JDBC driver can be used as the standard database access for any Java applications. For Perl applications, a DBD interface is provided which must be used in combination with the DBI driver. As third ( and more sophisticated ), Cego provides a C++ and a plain C library which can be used for plain and direct access.
  3. cgadm is a database administration program for accessing the database as a database administrator. Tablesets can be defined and created or dropped and removed. Furthermore, any registered tableset in the database can be started and stopped, recovered, expanded and so on. cgadm provides management of distributed tablesets among several nodes ( tableset switch, copy and relocation features ).
  4. Another administration frontend for GUI users is the CegoAdm program. In fact, it implements the same functionality as the cgadm console program but offers a intuitive user interface. A dedicated user documentation is available soon.

Enhancements: Further optimization on join logic ( treating appropriate predicates in where-condition before joining inner and outer tables

<<less
Added: 2009-07-26 License: GPL Price: FREE
downloads
Secleted [ 0 ] software to compare
  • Page: 1 of 2
  • 1
  • 2