generate pixel perfect output
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 4889
Generate Numly Copyright 1.3
Generate Numly Copyright is a Firefox extension that registers documents and blogs for Numly copyright. more>>
Generate Numly Copyright is a Firefox extension that registers documents and blogs for Numly copyright. Numly Numbers are unique identifiers of electronic media and recognized worldwide by electronic publishing companies and electronic content providers. Numly Numbers are simple and quick to generate and serve as branded identifier for individuals or companies authoring or distributing electronic content and media.
<<less Download (0.006MB)
Added: 2007-06-06 License: MPL (Mozilla Public License) Price:
878 downloads
B::Generate 1.06
B::Generate is a Perl module which you can create your own op trees. more>>
B::Generate is a Perl module which you can create your own op trees.
SYNOPSIS
use B::Generate;
# Do nothing, slowly.
CHECK {
my $null = new B::OP("null",0);
my $enter = new B::OP("enter",0);
my $cop = new B::COP(0, "hiya", 0);
my $leave = new B::LISTOP("leave", 0, $enter, $null);
$leave->children(3);
$enter->sibling($cop);
$enter->next($cop);
$cop->sibling($null);
$null->next($leave);
$cop->next($leave);
# Tell Perl where to find our tree.
B::main_root($leave);
B::main_start($enter);
}
WARNING
This module will create segmentation faults if you dont know how to use it properly. Further warning: sometimes I dont know how to use it properly.
There are lots of other methods and utility functions, but they are not documented here. This is deliberate, rather than just through laziness. You are expected to have read the Perl and XS sources to this module before attempting to do anything with it.
Patches welcome.
Malcolm Beatties B module allows you to examine the Perl op tree at runtime, in Perl space; its the basis of the Perl compiler. But what it doesnt let you do is manipulate that op tree: it wont let you create new ops, or modify old ones. Now you can.
Well, if youre intimately familiar with Perls internals, you can.
B::Generate turns Bs accessor methods into get-set methods. Hence, instead of merely saying
$op2 = $op->next;
you can now say
$op->next($op2);
to set the next op in the chain. It also adds constructor methods to create new ops. This is where it gets really hairy.
new B::OP ( type, flags )
new B::UNOP ( type, flags, first )
new B::BINOP ( type, flags, first, last )
new B::LOGOP ( type, flags, first, other )
new B::LISTOP ( type, flags, first, last )
new B::COP ( flags, name, first )
In all of the above constructors, type is either a numeric value representing the op type (62 is the addition operator, for instance) or the name of the op. ("add")
(Incidentally, if you know about custom ops and have registed them properly with the interpreter, you can create custom ops by name: new B::OP("mycustomop",0), or whatever.)
first, last and other are ops to be attached to the current op; these should be B::OP objects. If you havent created the ops yet, dont worry; give a false value, and fill them in later:
$x = new B::UNOP("negate", 0, undef);
# ... create some more ops ...
$x->first($y);
In addition, one may create a new nextstate operator with
newstate B::op ( flags, label, op)
in the same manner as B::COP::new - this will also, however, add the lineseq op.
Finally, you can set the main root and the starting op by passing ops to the B::main_root and B::main_start functions.
This module can obviously be used for all sorts of fun purposes. The best one will be in conjuction with source filters; have your source filter parse an input file in a foreign language, create an op tree for it and get Perl to execute it. Then email me and tell me how you did it. And why.
<<lessSYNOPSIS
use B::Generate;
# Do nothing, slowly.
CHECK {
my $null = new B::OP("null",0);
my $enter = new B::OP("enter",0);
my $cop = new B::COP(0, "hiya", 0);
my $leave = new B::LISTOP("leave", 0, $enter, $null);
$leave->children(3);
$enter->sibling($cop);
$enter->next($cop);
$cop->sibling($null);
$null->next($leave);
$cop->next($leave);
# Tell Perl where to find our tree.
B::main_root($leave);
B::main_start($enter);
}
WARNING
This module will create segmentation faults if you dont know how to use it properly. Further warning: sometimes I dont know how to use it properly.
There are lots of other methods and utility functions, but they are not documented here. This is deliberate, rather than just through laziness. You are expected to have read the Perl and XS sources to this module before attempting to do anything with it.
Patches welcome.
Malcolm Beatties B module allows you to examine the Perl op tree at runtime, in Perl space; its the basis of the Perl compiler. But what it doesnt let you do is manipulate that op tree: it wont let you create new ops, or modify old ones. Now you can.
Well, if youre intimately familiar with Perls internals, you can.
B::Generate turns Bs accessor methods into get-set methods. Hence, instead of merely saying
$op2 = $op->next;
you can now say
$op->next($op2);
to set the next op in the chain. It also adds constructor methods to create new ops. This is where it gets really hairy.
new B::OP ( type, flags )
new B::UNOP ( type, flags, first )
new B::BINOP ( type, flags, first, last )
new B::LOGOP ( type, flags, first, other )
new B::LISTOP ( type, flags, first, last )
new B::COP ( flags, name, first )
In all of the above constructors, type is either a numeric value representing the op type (62 is the addition operator, for instance) or the name of the op. ("add")
(Incidentally, if you know about custom ops and have registed them properly with the interpreter, you can create custom ops by name: new B::OP("mycustomop",0), or whatever.)
first, last and other are ops to be attached to the current op; these should be B::OP objects. If you havent created the ops yet, dont worry; give a false value, and fill them in later:
$x = new B::UNOP("negate", 0, undef);
# ... create some more ops ...
$x->first($y);
In addition, one may create a new nextstate operator with
newstate B::op ( flags, label, op)
in the same manner as B::COP::new - this will also, however, add the lineseq op.
Finally, you can set the main root and the starting op by passing ops to the B::main_root and B::main_start functions.
This module can obviously be used for all sorts of fun purposes. The best one will be in conjuction with source filters; have your source filter parse an input file in a foreign language, create an op tree for it and get Perl to execute it. Then email me and tell me how you did it. And why.
Download (0.012MB)
Added: 2006-07-04 License: Perl Artistic License Price:
1207 downloads
Data::Generate 0.01
Data::Generate allows you to create various types of synthetic data by parsing regex-like data creation rules. more>>
Data::Generate allows you to create various types of synthetic data by parsing "regex-like" data creation rules.
This module generates data by parsing given text statements (data creation rules). These statements are flexible and powerful regex-like way to control the production of synthetic data. Think about a program that instead of selecting data which matches a regex filter expression, produces it. For example, from the rule [a-c], the generator would produce the array a,b,c. The module works as following:
Specify data creation rules.
my $generator= Data::Generate::parse(VC(24) [0-9][2-3]);
At this step first you define one kind of output datatype (for ex. VC(24)= "output is a string with max length 24") and then with the rest of the expression define what it should look like. If parsing is successful a Data Generator object is instantiated.
Get data
my $Data= $generator->get_unique_data(10);
To really get the data, users must call the get_unique_data method by indicating the desired number of output values. The generator returns the values contained in an array reference. Please remark that output format is fixed according to the data type.
<<lessThis module generates data by parsing given text statements (data creation rules). These statements are flexible and powerful regex-like way to control the production of synthetic data. Think about a program that instead of selecting data which matches a regex filter expression, produces it. For example, from the rule [a-c], the generator would produce the array a,b,c. The module works as following:
Specify data creation rules.
my $generator= Data::Generate::parse(VC(24) [0-9][2-3]);
At this step first you define one kind of output datatype (for ex. VC(24)= "output is a string with max length 24") and then with the rest of the expression define what it should look like. If parsing is successful a Data Generator object is instantiated.
Get data
my $Data= $generator->get_unique_data(10);
To really get the data, users must call the get_unique_data method by indicating the desired number of output values. The generator returns the values contained in an array reference. Please remark that output format is fixed according to the data type.
Download (0.025MB)
Added: 2007-03-31 License: Perl Artistic License Price:
937 downloads
Class::Generate 1.09
Class::Generate is a Perl module that can generate Perl class hierarchies. more>>
Class::Generate is a Perl module that can generate Perl class hierarchies.
SYNOPSIS
use Class::Generate qw(class subclass delete_class);
# Declare class Class_Name, with the following types of members:
class
Class_Name => [
s => $, # scalar
a => @, # array
h => %, # hash
c => Class, # Class
c_a => @Class, # array of Class
c_h => %Class, # hash of Class
&m => body, # method
];
# Allocate an instance of class_name, with members initialized to the
# given values (pass arrays and hashes using references).
$obj = Class_Name->new ( s => scalar,
a => [ values ],
h => { key1 => v1, ... },
c => Class->new,
c_a => [ Class->new, ... ],
c_h => [ key1 => Class->new, ... ] );
# Scalar type accessor:
$obj->s($value); # Assign $value to member s.
$member_value = $obj->s; # Access members value.
# (Class) Array type accessor:
$obj->a([value1, value2, ...]); # Assign whole array to member.
$obj->a(2, $value); # Assign $value to array member 2.
$obj->add_a($value); # Append $value to end of array.
@a = $obj->a; # Access whole array.
$ary_member_value = $obj->a(2); # Access array member 2.
$s = $obj->a_size; # Return size of array.
$value = $obj->last_a; # Return last element of array.
# (Class) Hash type accessor:
$obj->h({ k_1=>v1, ..., k_n=>v_n }) # Assign whole hash to member.
$obj->h($key, $value); # Assign $value to hash member $key.
%hash = $obj->h; # Access whole hash.
$hash_member_value = $obj->h($key); # Access hash member value $key.
$obj->delete_h($key); # Delete slot occupied by $key.
@keys = $obj->h_keys; # Access keys of member h.
@values = $obj->h_values; # Access values of member h.
$another = $obj->copy; # Copy an object.
if ( $obj->equals($another) ) { ... } # Test equality.
subclass s => [ ], -parent => class_name;
The Class::Generate package exports functions that take as arguments a class specification and create from these specifications a Perl 5 class. The specification language allows many object-oriented constructs: typed members, inheritance, private members, required members, default values, object methods, class methods, class variables, and more.
CPAN contains similar packages. Why another? Because object-oriented programming, especially in a dynamic language like Perl, is a complicated endeavor. I wanted a package that would work very hard to catch the errors you (well, I anyway) commonly make. I wanted a package that could help me enforce the contract of object-oriented programming. I also wanted it to get out of my way when I asked.
<<lessSYNOPSIS
use Class::Generate qw(class subclass delete_class);
# Declare class Class_Name, with the following types of members:
class
Class_Name => [
s => $, # scalar
a => @, # array
h => %, # hash
c => Class, # Class
c_a => @Class, # array of Class
c_h => %Class, # hash of Class
&m => body, # method
];
# Allocate an instance of class_name, with members initialized to the
# given values (pass arrays and hashes using references).
$obj = Class_Name->new ( s => scalar,
a => [ values ],
h => { key1 => v1, ... },
c => Class->new,
c_a => [ Class->new, ... ],
c_h => [ key1 => Class->new, ... ] );
# Scalar type accessor:
$obj->s($value); # Assign $value to member s.
$member_value = $obj->s; # Access members value.
# (Class) Array type accessor:
$obj->a([value1, value2, ...]); # Assign whole array to member.
$obj->a(2, $value); # Assign $value to array member 2.
$obj->add_a($value); # Append $value to end of array.
@a = $obj->a; # Access whole array.
$ary_member_value = $obj->a(2); # Access array member 2.
$s = $obj->a_size; # Return size of array.
$value = $obj->last_a; # Return last element of array.
# (Class) Hash type accessor:
$obj->h({ k_1=>v1, ..., k_n=>v_n }) # Assign whole hash to member.
$obj->h($key, $value); # Assign $value to hash member $key.
%hash = $obj->h; # Access whole hash.
$hash_member_value = $obj->h($key); # Access hash member value $key.
$obj->delete_h($key); # Delete slot occupied by $key.
@keys = $obj->h_keys; # Access keys of member h.
@values = $obj->h_values; # Access values of member h.
$another = $obj->copy; # Copy an object.
if ( $obj->equals($another) ) { ... } # Test equality.
subclass s => [ ], -parent => class_name;
The Class::Generate package exports functions that take as arguments a class specification and create from these specifications a Perl 5 class. The specification language allows many object-oriented constructs: typed members, inheritance, private members, required members, default values, object methods, class methods, class variables, and more.
CPAN contains similar packages. Why another? Because object-oriented programming, especially in a dynamic language like Perl, is a complicated endeavor. I wanted a package that would work very hard to catch the errors you (well, I anyway) commonly make. I wanted a package that could help me enforce the contract of object-oriented programming. I also wanted it to get out of my way when I asked.
Download (0.052MB)
Added: 2007-07-31 License: Perl Artistic License Price:
815 downloads
C Minimal Perfect Hashing Library 0.6
C Minimal Perfect Hashing Library is a portable LGPL library to create and to work with minimal perfect hashing functions. more>>
C Minimal Perfect Hashing Library encapsulates the newest and more efficient algorithms in an easy-to-use, production-quality, fast API. The library was designed to work with big entries that cannot fit in the main memory. It has been used successfully for constructing minimal perfect hash functions for sets with more than 100 million of keys, and we intend to expand this number to the order of billion of keys.
Main features:
- Fast.
- Space-efficient with main memory usage carefully documented.
- The best modern algorithms are available (or at least scheduled for implementation :-)).
- Works with in-disk key sets through of using the adapter pattern.
- Serialization of hash functions.
- Portable C code (currently works on GNU/Linux and WIN32 and is reported to work in OpenBSD and Solaris).
- Object oriented implementation.
- Easily extensible.
- Well encapsulated API aiming binary compatibility through releases.
- Free Software.
A perfect hash function maps a static set of n keys into a set of m integer numbers without collisions, where m is greater than or equal to n. If m is equal to n, the function is called minimal.
Minimal perfect hash functions are widely used for memory efficient storage and fast retrieval of items from static sets, such as words in natural languages, reserved words in programming languages or interactive systems, universal resource locations (URLs) in Web search engines, or item sets in data mining techniques. Therefore, there are applications for minimal perfect hash functions in information retrieval systems, database systems, language translation systems, electronic commerce systems, compilers, operating systems, among others.
The use of minimal perfect hash functions is, until now, restricted to scenarios where the set of keys being hashed is small, because of the limitations of current algorithms. But in many cases, to deal with huge set of keys is crucial. So, this project gives to the free software community an API that will work with sets in the order of billion of keys.
Probably, the most interesting application for minimal perfect hash functions is its use as an indexing structure for databases. The most popular data structure used as an indexing structure in databases is the B+ tree. In fact, the B+ tree is very used for dynamic applications with frequent insertions and deletions of records. However, for applications with sporadic modifications and a huge number of queries the B+ tree is not the best option, because practical deployments of this structure are extremely complex, and perform poorly with very large sets of keys such as those required for the new frontiers database applications.
For example, in the information retrieval field, the work with huge collections is a daily task. The simple assignment of ids to web pages of a collection can be a challenging task. While traditional databases simply cannot handle more traffic once the working set of web page urls does not fit in main memory anymore, minimal perfect hash functions can easily scale to hundred of millions of entries, using stock hardware.
As there are lots of applications for minimal perfect hash functions, it is important to implement memory and time efficient algorithms for constructing such functions. The lack of similar libraries in the free software world has been the main motivation to create the C Minimal Perfect Hashing Library (gperf is a bit different, since it was conceived to create very fast perfect hash functions for small sets of keys and CMPH Library was conceived to create minimal perfect hash functions for very large sets of keys). C Minimal Perfect Hashing Library is a portable LGPLed library to generate and to work with very efficient minimal perfect hash functions.
Enhancements:
- This release adds an implementation of a classical minimal perfect hash algorithm called fch.
- This is used as a basis for a new algorithm that can create minimal perfect hashes for billions of keys with less than four bits per key, and is ready to use.
- Suggestions and bugfixes from users have been incorporated.
<<lessMain features:
- Fast.
- Space-efficient with main memory usage carefully documented.
- The best modern algorithms are available (or at least scheduled for implementation :-)).
- Works with in-disk key sets through of using the adapter pattern.
- Serialization of hash functions.
- Portable C code (currently works on GNU/Linux and WIN32 and is reported to work in OpenBSD and Solaris).
- Object oriented implementation.
- Easily extensible.
- Well encapsulated API aiming binary compatibility through releases.
- Free Software.
A perfect hash function maps a static set of n keys into a set of m integer numbers without collisions, where m is greater than or equal to n. If m is equal to n, the function is called minimal.
Minimal perfect hash functions are widely used for memory efficient storage and fast retrieval of items from static sets, such as words in natural languages, reserved words in programming languages or interactive systems, universal resource locations (URLs) in Web search engines, or item sets in data mining techniques. Therefore, there are applications for minimal perfect hash functions in information retrieval systems, database systems, language translation systems, electronic commerce systems, compilers, operating systems, among others.
The use of minimal perfect hash functions is, until now, restricted to scenarios where the set of keys being hashed is small, because of the limitations of current algorithms. But in many cases, to deal with huge set of keys is crucial. So, this project gives to the free software community an API that will work with sets in the order of billion of keys.
Probably, the most interesting application for minimal perfect hash functions is its use as an indexing structure for databases. The most popular data structure used as an indexing structure in databases is the B+ tree. In fact, the B+ tree is very used for dynamic applications with frequent insertions and deletions of records. However, for applications with sporadic modifications and a huge number of queries the B+ tree is not the best option, because practical deployments of this structure are extremely complex, and perform poorly with very large sets of keys such as those required for the new frontiers database applications.
For example, in the information retrieval field, the work with huge collections is a daily task. The simple assignment of ids to web pages of a collection can be a challenging task. While traditional databases simply cannot handle more traffic once the working set of web page urls does not fit in main memory anymore, minimal perfect hash functions can easily scale to hundred of millions of entries, using stock hardware.
As there are lots of applications for minimal perfect hash functions, it is important to implement memory and time efficient algorithms for constructing such functions. The lack of similar libraries in the free software world has been the main motivation to create the C Minimal Perfect Hashing Library (gperf is a bit different, since it was conceived to create very fast perfect hash functions for small sets of keys and CMPH Library was conceived to create minimal perfect hash functions for very large sets of keys). C Minimal Perfect Hashing Library is a portable LGPLed library to generate and to work with very efficient minimal perfect hash functions.
Enhancements:
- This release adds an implementation of a classical minimal perfect hash algorithm called fch.
- This is used as a basis for a new algorithm that can create minimal perfect hashes for billions of keys with less than four bits per key, and is ready to use.
- Suggestions and bugfixes from users have been incorporated.
Download (0.32MB)
Added: 2007-02-25 License: LGPL (GNU Lesser General Public License) Price:
978 downloads
XML::Output 0.03
XML::Output is a Perl module for writing simple XML documents. more>>
XML::Output is a Perl module for writing simple XML documents.
SYNOPSIS
use XML::Output;
open(FH,>file.xml);
my $xo = new XML::Output({fh => *FH});
$xo->open(tagname, {attrname => attrval});
$xo->pcdata(element content);
$xo->close();
close(FH);
ABSTRACT
XML::Output is a Perl module for writing simple XML documents
XML::Output is a Perl module for writing simple XML document. The following methods are provided.
new
$xo = new XML::Output;
Constructs a new XML::Output object.
open
$xo->open(tagname, {attrname => attrval});
Open an element with specified name (and optional attributes)
close
$xo->close;
Close an element
empty
$xo->empty(tagname, {attrname => attrval});
Insert an empty element with specified name (and optional attributes)
pcdata
$xo->pcdata(element content);
Insert text
comment
$xo->comment(comment text);
Insert a comment
xmlstr
print $xo->xmlstr;
Get a string representation of the constructed document
<<lessSYNOPSIS
use XML::Output;
open(FH,>file.xml);
my $xo = new XML::Output({fh => *FH});
$xo->open(tagname, {attrname => attrval});
$xo->pcdata(element content);
$xo->close();
close(FH);
ABSTRACT
XML::Output is a Perl module for writing simple XML documents
XML::Output is a Perl module for writing simple XML document. The following methods are provided.
new
$xo = new XML::Output;
Constructs a new XML::Output object.
open
$xo->open(tagname, {attrname => attrval});
Open an element with specified name (and optional attributes)
close
$xo->close;
Close an element
empty
$xo->empty(tagname, {attrname => attrval});
Insert an empty element with specified name (and optional attributes)
pcdata
$xo->pcdata(element content);
Insert text
comment
$xo->comment(comment text);
Insert a comment
xmlstr
print $xo->xmlstr;
Get a string representation of the constructed document
Download (0.035MB)
Added: 2006-09-07 License: GPL (GNU General Public License) Price:
1144 downloads
Money-From-Internet 1.0
The Ultimate Safe Money Guide -Free Online Money Guide Make Your Online Money The Safe Way And Generate a Daily Income Stream. The best thing I came ... more>> <<less
Download (2117KB)
Added: 2009-04-28 License: Freeware Price: Free
178 downloads
Earn-Money-Internet 1.0
The Ultimate Safe Money Guide -Free Online Money Guide Make Your Online Money The Safe Way And Generate a Daily Income Stream. The best thing I came ... more>> <<less
Download (2117KB)
Added: 2009-04-14 License: Freeware Price: Free
194 downloads
Gestalter 0.7.6
Gestalter is a free vector drawing program. more>>
Gestalter is a free vector drawing program. The user interface is loosely modelled after the famous Illustrator by Adobe. The central element is the Bezier curve used as a base part for almost every other object.
Complex paths are possible, compound paths can be constructed, grouping of elements is enabled and everything can be screened by a mask. Multiple layers are possible, one can choose between two display modes: a antialiased and a wireframe one. The native storage format is a subset of SVG, printing output is Postscript.
You can place pixel images and transform (rotate, skew, scale, etc.) but not edit them (use GIMP for editing pixel image data). You can open the Postscript output of gestalter in GIMP to use your drawings on The Net.
<<lessComplex paths are possible, compound paths can be constructed, grouping of elements is enabled and everything can be screened by a mask. Multiple layers are possible, one can choose between two display modes: a antialiased and a wireframe one. The native storage format is a subset of SVG, printing output is Postscript.
You can place pixel images and transform (rotate, skew, scale, etc.) but not edit them (use GIMP for editing pixel image data). You can open the Postscript output of gestalter in GIMP to use your drawings on The Net.
Download (0.85MB)
Added: 2005-08-05 License: GPL (GNU General Public License) Price:
1544 downloads
Gimp::Pixel 1.211
Gimp::Pixel is a how to operate on raw pixels. more>>
Gimp::Pixel is a how to operate on raw pixels.
***WARNING*** this manpage is no longer up-to-date. See examples/map_to_gradient for a simple raw-pixel-manipulating plug-in. If you bug me enough Ill rewrite this document.
SYNOPSIS
use Gimp;
use PDL; # to make sensible things with the pixels
# Gimp::GimpDrawable - The GimpDrawable structure
# Gimp::Tile - The Tile family of functions.
# Gimp::PixelRgn - The PixelRgn family of functions.
You can access the pixels in a drawable through tiles or pixel regions. This manpage explains how this is done in perl. All classes (Gimp::GimpDrawable, Gimp::Tile, Gimp::PixelRgn) are available with and without the Gimp:: prefix.
<<less***WARNING*** this manpage is no longer up-to-date. See examples/map_to_gradient for a simple raw-pixel-manipulating plug-in. If you bug me enough Ill rewrite this document.
SYNOPSIS
use Gimp;
use PDL; # to make sensible things with the pixels
# Gimp::GimpDrawable - The GimpDrawable structure
# Gimp::Tile - The Tile family of functions.
# Gimp::PixelRgn - The PixelRgn family of functions.
You can access the pixels in a drawable through tiles or pixel regions. This manpage explains how this is done in perl. All classes (Gimp::GimpDrawable, Gimp::Tile, Gimp::PixelRgn) are available with and without the Gimp:: prefix.
Download (0.26MB)
Added: 2006-10-26 License: Perl Artistic License Price:
1112 downloads
Kyra Sprite Engine 2.1.3
Kyra Sprite Engine project is a C++ sprite engine built on SDL. more>>
Kyra Sprite Engine project is a C++ sprite engine built on SDL.
Kyra is a simple, fully featured Sprite engine written in C++. The Kyra engine is suited to 2D, isometric, and quasi-3D games.
It is built on top of SDL for cross platform use. It supports tiles, sprites, and user drawn surfaces.
It has full support for alpha blending, scaling, color transformation, pixel perfect collision detection, OpenGL acceleration, and mouse testing.
It comes with tools to define sprites and import images into the system.
Enhancements:
- Update Kyra to work with the new SDL 1.2.11
- Fixed 64 bit support for Kyra.
<<lessKyra is a simple, fully featured Sprite engine written in C++. The Kyra engine is suited to 2D, isometric, and quasi-3D games.
It is built on top of SDL for cross platform use. It supports tiles, sprites, and user drawn surfaces.
It has full support for alpha blending, scaling, color transformation, pixel perfect collision detection, OpenGL acceleration, and mouse testing.
It comes with tools to define sprites and import images into the system.
Enhancements:
- Update Kyra to work with the new SDL 1.2.11
- Fixed 64 bit support for Kyra.
Download (3.4MB)
Added: 2006-11-08 License: GPL (GNU General Public License) Price:
1081 downloads
XML::Generator::Essex 0.01
XML::Generator::Essex is a Perl module that can generate XML with Essex. more>>
XML::Generator::Essex is a Perl module that can generate XML with Essex.
SYNOPSIS
package My::Generator;
use XML::Generator::Essex;
@ISA = qw( XML::Generator::Essex );
use strict;
sub main { # Called by XML::Generator::Essex->generate().
my $self = shift;
}
## And, to use:
my $g = MY::Generator->new( Handler => $h );
$g->generate( ... );
Provides Essex output primitives like put() and constructors for essex events.
Methods
put
Example Whats emitted
======= ==============
put; ## (whatevers in $_: event, characters, etc)
put "text<<less
SYNOPSIS
package My::Generator;
use XML::Generator::Essex;
@ISA = qw( XML::Generator::Essex );
use strict;
sub main { # Called by XML::Generator::Essex->generate().
my $self = shift;
}
## And, to use:
my $g = MY::Generator->new( Handler => $h );
$g->generate( ... );
Provides Essex output primitives like put() and constructors for essex events.
Methods
put
Example Whats emitted
======= ==============
put; ## (whatevers in $_: event, characters, etc)
put "text<<less
Download (0.042MB)
Added: 2007-07-13 License: Perl Artistic License Price:
833 downloads
Raster3D 2.7c
Raster3D is a powerful set of tools for generating high quality raster images of proteins or other molecules. more>>
Raster3D is a powerful set of tools for generating high quality raster images of proteins or other molecules.
The core program renders spheres, triangles, cylinders, and quadric surfaces with specular highlighting, Phong shading, and shadowing.
It uses an efficient software Z-buffer algorithm that is independent of any graphics hardware.
Main features:
- Raster3D uses a fast Z-buffer algorithm to produce high quality pixel images featuring one shadowing light source, additional non-shadowing light sources, specular highlighting, transparency, and Phong shaded surfaces. Output is in the form of a pixel image with 24 bits of color information per pixel plus one matte channel.
- Raster3D does not depend on graphics hardware. The rendering program currently supports output to files in AVS, JPEG, TIFF, PNG and SGI libimage format. To actually view or manipulate the images produced, you must also have installed an image viewing package (e.g. John Cristys ImageMagick or the SGI libimage utilities). The Raster3D rendering program can be integrated with ImageMagick to expand the flexibility of output formats and interactive use.
- Ancillary programs are provided for the generation of object descriptions based on atomic coordinates stored in PDB format. Although Raster3D is not intended as a general purpose ray-tracing package, nothing in the rendering process is specific to molecular graphics. Some of the algorithms used have been chosen for speed rather than generality, however. They work well for molecular graphics images, but possibly would produce odd results if used for very different types of image.
- Raster3D currently supports rendering six object types: spheres, triangles, planes, smooth-ended cylinders, round-ended cylinders, and quadric surfaces. It also supports the definition of material properties (transparency, bounding planes, color, reflectivity) that apply to groups of objects within the rendered scene.
Enhancements:
- changed the default output format to PNG for all programs
<<lessThe core program renders spheres, triangles, cylinders, and quadric surfaces with specular highlighting, Phong shading, and shadowing.
It uses an efficient software Z-buffer algorithm that is independent of any graphics hardware.
Main features:
- Raster3D uses a fast Z-buffer algorithm to produce high quality pixel images featuring one shadowing light source, additional non-shadowing light sources, specular highlighting, transparency, and Phong shaded surfaces. Output is in the form of a pixel image with 24 bits of color information per pixel plus one matte channel.
- Raster3D does not depend on graphics hardware. The rendering program currently supports output to files in AVS, JPEG, TIFF, PNG and SGI libimage format. To actually view or manipulate the images produced, you must also have installed an image viewing package (e.g. John Cristys ImageMagick or the SGI libimage utilities). The Raster3D rendering program can be integrated with ImageMagick to expand the flexibility of output formats and interactive use.
- Ancillary programs are provided for the generation of object descriptions based on atomic coordinates stored in PDB format. Although Raster3D is not intended as a general purpose ray-tracing package, nothing in the rendering process is specific to molecular graphics. Some of the algorithms used have been chosen for speed rather than generality, however. They work well for molecular graphics images, but possibly would produce odd results if used for very different types of image.
- Raster3D currently supports rendering six object types: spheres, triangles, planes, smooth-ended cylinders, round-ended cylinders, and quadric surfaces. It also supports the definition of material properties (transparency, bounding planes, color, reflectivity) that apply to groups of objects within the rendered scene.
Enhancements:
- changed the default output format to PNG for all programs
Download (MB)
Added: 2006-08-31 License: Other/Proprietary License Price:
1149 downloads
RailsTidy 0.1
RailsTidy is a plugin for Ruby On Rails. more>>
RailsTidy project is a plugin for Ruby On Rails.
Main features:
- validate your rhtml templates,
- validate the html output of your functional tests,
- clean the html generated by rails.
<<lessMain features:
- validate your rhtml templates,
- validate the html output of your functional tests,
- clean the html generated by rails.
Download (0.011MB)
Added: 2006-02-16 License: MIT/X Consortium License Price:
1345 downloads
Money-Affiliate-Program 1.0
The Ultimate Safe Money Guide -Free Online Money Guide Make Your Online Money The Safe Way And Generate a Daily Income Stream. The best thing I came ... more>> <<less
Download (2117KB)
Added: 2009-04-29 License: Freeware Price: Free
180 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 generate pixel perfect output 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
