got word database maker 1.3
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 7201
Task Database 1.0
Task Database brings users the convenience of an Adobe AIR application that effectively demonstrates Flex database capabilities. SQL database is created on your desktop. more>>
Task Database 1.0 brings users the convenience of an Adobe AIR application that effectively demonstrates Flex database capabilities. SQL database is created on your desktop.
Adobe Air is a Cross-operating system runtime that lets developers combine HTML, AJAX, Adobe Flash, and Flex technologies to deploy rich Internet applications on the desktop.
Companies like eBay, AOL, and NASDAQ are already using Adobe AIR to deliver engaging RIAs to their users' desktops. To run applications, you will need to first download and install Adobe Air on your computer.
<<less Added: 2009-07-27 License: Freeware Price: FREE
downloads
DataparkSearch 4.52
DataparkSearch Engine is a full-featured open sources web-based search engine released under the GNU General Public License and designed to organize search within a website, group of websites, intranet or local system. more>>
DataparkSearch 4.52 offers users a powerful and functional open sources web-based search engine released under the GNU General Public License and designed to organize search within a website, group of websites, intranet or local system.
DataparkSearch consists of two parts. The first part is indexing mechanism (indexer). Indexer walks over html hypertext references and stores found words and new references into database. The second part is web CGI front-end to provide search using data collected by indexer.
Major Features:
- Support for http, https, ftp, nntp and news URL schemes.
- htdb virtual URL scheme for indexing SQL databases.
- Indexes text/html, text/xml, text/plain, audio/mpeg (mp3) and image/gif mime types natively.
- External parsers support for other document types, including Microsoft Word, Excel, RTF, PowerPoint, Adobe Acrobat PDF and Flash.
- Can index multilingual sites using content negotiation.
- Can search all of the word forms using ispell affixes and dictionaries.
- Synonym, acronym and abbreviation query expansion based on editable dictionaries, specified by language and charset.
- Stop-words, synonyms and acronyms lists.
- Options to query with all words, all words near to each others, any words, or Boolean queries. A subset of VQL (Verity Query Language) is supported.
- Popularity Rank based on a neural network model.
- Results can be sorted by relevancy (using vector calculation), popularity rank as "Goo" (adding weight for incoming links), and "Neo" (neural network model), last modified time, and by "importance" (a combination of relevancy and popularity rank).
- Supports wide range of character sets support with automated character set and language detection.
- Offers an accent insensitive search option.
- Provides phrase segmenting (tokenizing) for Chinese, Japanese, Korean and Thai.
- Includes an indexer and a web CGI front-end, as well as a search module for Apache web server (mod_dpsearch).
- Handles Internationalized Domain Names (IDN).
- Summary Extraction Algorithm automatically sums up each document in several sentences.
- Uses If-Modified-Since for efficient transfer of only changed files.
- Can tweak URLs with session IDs and other weird formats, including some JavaScript link decoding.
- Can perform parallel and multi-threaded indexing for faster updating.
- Flexible update scheduling, including options for checking some sections of a site more frequently.
- Handles basic authentication (user name and password) and cookies.
- Stores a compressed text version of the documents for extracting and viewing.
- Can specify a default character set and language for a server or subdirectory, or a list of possible languages.
- No index tags: , , , Google's special comments , and consider as tags to include/exclude.
- Can specify a content body tag.
- Spell checking for query words with aspell.
- Flexible options and commands to customize search result pages.
- Effective caching gives significant time reduction in search times.
- Query logging stores the query, query parameters and the number of results found.
WareSeeker Editor
Download (2.07MB)
Added: 2009-04-20 License: Freeware Price:
186 downloads
Other version of DataparkSearch
references and stores found words and new references into database. The second part is web CGI ... URL schemes; htdb virtual URL scheme support for indexing SQL databases; text/html, text/xmlLicense:Freeware
references and stores found words and new references into database. The second part is web CGI ... - Storing documents in stored database has been fixed for non-default values of StoredFilesLicense:GPL (GNU General Public License)
references and stores found words and new references nto database. The second part is web CGI ... URL schemes; - htdb virtual URL scheme support for indexing SQL databases; - text/html, textLicense:Freeware
Scramble Words Generator 1.0
Can you raed tihs? Did you konw that it is poissble to raed text eevn wehn the iennr letrets hvae been rraeargned? If youre albe to raed tihs now, t... more>> <<less
Download (0KB)
Added: 2009-04-06 License: Freeware Price: Free
244 downloads
MySQLfs 0.4.0 RC1
MySQLfs is Linux userspace filesystem which stores data in a MySQL database. more>>
MySQLfs is Linux userspace filesystem which stores data in a MySQL database. The project uses FUSE to interface with the kernel.
<<less Download (0.22MB)
Added: 2007-08-16 License: GPL (GNU General Public License) Price:
800 downloads
Sort::Half::Maker 0.03
Sort::Half::Maker is a Perl module to create half-sort subs easily. more>>
Sort::Half::Maker is a Perl module to create half-sort subs easily.
SYNOPSIS
use Sort::Half::Maker qw(make_halfsort);
$sub = make_halfsort(
start => [ qw(x y z) ],
end => [ qw(a b c) ],
fallback => sub { $_[0] cmp $_[1] },
);
@list = sort $sub qw(a y f h w z b t x);
# qw(x y z f h t w a b)
Before anything, what it a half-sort?
A half-sort is a sort subroutine defined by a starting list, an ending list and an ordinary sort subroutine. Elements in the starting list always go first in comparison to others and keep the original order. Elements in the ending list always go last in comparison to others and keep their original order. The remaining elements are sorted via the given ordinary sort subroutine.
An example, please?
Imagine we want to sort the list of key/value pairs of a hash, such that qw(name version abstract license author) come first and qw(meta-spec) comes last, using case-insensitive comparison in-between. With this module, this is done so:
$sub = make_halfsort(
start => [ qw(name version abstract license author) ],
end => [ qw(meta-spec) ],
fallback => sub { lc $_[0] cmp lc $_[1] }
);
my @pairs = map { ($_, $h{$_}) } sort $sub keys(%h);
Why is it good for?
I dont see many uses for it. I played with the concept while writing a patch to improve META.yml generation by ExtUtils::MakeMaker. There we wanted to dump some keys (like name, version, abstract, license, author) before and then the ones the module author provided as extra information.
FUNCTIONS
make_halfsort
$sub = make_halfsort(start => @start_list,
end => @end_list,
fallback => &sort_sub
);
@sorted = sort $sub @unsorted;
Builds a sort subroutine which can be used with sort. It splits the sorted list into (possibly) three partitions: the elements contained in @start_list, the elements contained in @end_list and the remaining ones. For the elements in @start_list and @end_list, the list order is preserved. For the remaining ones, the given sort sub (or the default) is used.
If fallback is ommited, it defaults to use the sort sub sub ($$) { $_[0] cmp $_[1] }.
The arguments start or end may be ommited as well. But if you omit both, you could have done it without a half-sort.
<<lessSYNOPSIS
use Sort::Half::Maker qw(make_halfsort);
$sub = make_halfsort(
start => [ qw(x y z) ],
end => [ qw(a b c) ],
fallback => sub { $_[0] cmp $_[1] },
);
@list = sort $sub qw(a y f h w z b t x);
# qw(x y z f h t w a b)
Before anything, what it a half-sort?
A half-sort is a sort subroutine defined by a starting list, an ending list and an ordinary sort subroutine. Elements in the starting list always go first in comparison to others and keep the original order. Elements in the ending list always go last in comparison to others and keep their original order. The remaining elements are sorted via the given ordinary sort subroutine.
An example, please?
Imagine we want to sort the list of key/value pairs of a hash, such that qw(name version abstract license author) come first and qw(meta-spec) comes last, using case-insensitive comparison in-between. With this module, this is done so:
$sub = make_halfsort(
start => [ qw(name version abstract license author) ],
end => [ qw(meta-spec) ],
fallback => sub { lc $_[0] cmp lc $_[1] }
);
my @pairs = map { ($_, $h{$_}) } sort $sub keys(%h);
Why is it good for?
I dont see many uses for it. I played with the concept while writing a patch to improve META.yml generation by ExtUtils::MakeMaker. There we wanted to dump some keys (like name, version, abstract, license, author) before and then the ones the module author provided as extra information.
FUNCTIONS
make_halfsort
$sub = make_halfsort(start => @start_list,
end => @end_list,
fallback => &sort_sub
);
@sorted = sort $sub @unsorted;
Builds a sort subroutine which can be used with sort. It splits the sorted list into (possibly) three partitions: the elements contained in @start_list, the elements contained in @end_list and the remaining ones. For the elements in @start_list and @end_list, the list order is preserved. For the remaining ones, the given sort sub (or the default) is used.
If fallback is ommited, it defaults to use the sort sub sub ($$) { $_[0] cmp $_[1] }.
The arguments start or end may be ommited as well. But if you omit both, you could have done it without a half-sort.
Download (0.004MB)
Added: 2007-08-08 License: Perl Artistic License Price:
807 downloads
Peptide::Pubmed 1.02
Peptide::Pubmed is a Perl module that can extract peptide sequences from MEDLINE article abstracts. more>>
Peptide::Pubmed is a Perl module that can extract peptide sequences from MEDLINE article abstracts.
SYNOPSIS
use Peptide::Pubmed;
$parser = Peptide::Pubmed->new;
$in = {
PMID => q[15527327],
Author => q[Doe JJ, Smith Q],
Journal => q[J Biological Foo. 2004;8(2):123-30.],
Title => q[Foo, bar and its significance in phage display.],
Abstract =>
q[Peptide sequences EYHHYNK and Arg-Gly-Asp, but not ACCCGTNA or VEGFRI.],
Mesh => q[Genes, p53/genetics; Humans; Bar],
Chemical => q[Multienzyme Complexes; Peptide Library; Foo],
};
$parser->parse_abstract($in);
# get the peptide sequences in 1 letter symbols (select all words where the
# combined word/abstract score is above threshold:
# WordAbstScore >= WordAbstScoreMin):
@seqs = $parser->get_seqs;
print "@seqsn"; # prints: EYHHYNK RGD
EXAMPLES
# same as above, set threshold explicitly:
$parser->WordAbstScoreMin(0.4);
@seqs = $parser->get_seqs;
# set low threshold to get more peptide sequences (but at a cost of getting
# more false positives)
$parser->WordAbstScoreMin(-1);
@seqs = $parser->get_seqs;
print "@seqsn"; # prints: EYHHYNK RGD ACCCGTNA VEGFRI
# reset threshold back:
$parser->WordAbstScoreMin(0.4);
# get more data for the abstract:
$abst = $parser->get_abst;
print "$abst->{AbstScore}n"; # abstract score, in the [0,1] interval
print "$abst->{AbstMtext}n"; # abstract with sequences marked up:
# Peptide sequences EYHHYNK and Arg-Gly-Asp,
# but not ACCCGTNA or VEGFRI.
# get more data for the words, in addition to peptide sequences:
@words = $parser->get_words;
for my $word (@words) {
# combined word/abstract score, in the [0,1] interval
print "$word->{WordAbstScore}n";
# word as found in the abstract, eg Arg-Gly-Asp,
print "$word->{WordOrig}n";
# peptide sequence in 1 letter symbols, eg RGD
print "$word->{WordSequence}n";
}
# There are no mandatory input fields. This will work too, but may give lower score.
$in = {
Abstract =>
q[Peptide sequences EYHHYNK and Arg-Gly-Asp, but not ACCCGTNA or VEGFRI.],
};
$parser->parse_abstract($in);
@words = $parser->get_words;
# No peptide sequences are found in empty input:
$in = undef;
$parser->parse_abstract($in);
@words = $parser->get_words;
<<lessSYNOPSIS
use Peptide::Pubmed;
$parser = Peptide::Pubmed->new;
$in = {
PMID => q[15527327],
Author => q[Doe JJ, Smith Q],
Journal => q[J Biological Foo. 2004;8(2):123-30.],
Title => q[Foo, bar and its significance in phage display.],
Abstract =>
q[Peptide sequences EYHHYNK and Arg-Gly-Asp, but not ACCCGTNA or VEGFRI.],
Mesh => q[Genes, p53/genetics; Humans; Bar],
Chemical => q[Multienzyme Complexes; Peptide Library; Foo],
};
$parser->parse_abstract($in);
# get the peptide sequences in 1 letter symbols (select all words where the
# combined word/abstract score is above threshold:
# WordAbstScore >= WordAbstScoreMin):
@seqs = $parser->get_seqs;
print "@seqsn"; # prints: EYHHYNK RGD
EXAMPLES
# same as above, set threshold explicitly:
$parser->WordAbstScoreMin(0.4);
@seqs = $parser->get_seqs;
# set low threshold to get more peptide sequences (but at a cost of getting
# more false positives)
$parser->WordAbstScoreMin(-1);
@seqs = $parser->get_seqs;
print "@seqsn"; # prints: EYHHYNK RGD ACCCGTNA VEGFRI
# reset threshold back:
$parser->WordAbstScoreMin(0.4);
# get more data for the abstract:
$abst = $parser->get_abst;
print "$abst->{AbstScore}n"; # abstract score, in the [0,1] interval
print "$abst->{AbstMtext}n"; # abstract with sequences marked up:
# Peptide sequences EYHHYNK and Arg-Gly-Asp,
# but not ACCCGTNA or VEGFRI.
# get more data for the words, in addition to peptide sequences:
@words = $parser->get_words;
for my $word (@words) {
# combined word/abstract score, in the [0,1] interval
print "$word->{WordAbstScore}n";
# word as found in the abstract, eg Arg-Gly-Asp,
print "$word->{WordOrig}n";
# peptide sequence in 1 letter symbols, eg RGD
print "$word->{WordSequence}n";
}
# There are no mandatory input fields. This will work too, but may give lower score.
$in = {
Abstract =>
q[Peptide sequences EYHHYNK and Arg-Gly-Asp, but not ACCCGTNA or VEGFRI.],
};
$parser->parse_abstract($in);
@words = $parser->get_words;
# No peptide sequences are found in empty input:
$in = undef;
$parser->parse_abstract($in);
@words = $parser->get_words;
Download (0.35MB)
Added: 2007-08-01 License: Perl Artistic License Price:
814 downloads
WeedIt 2.0.2
WeedIt is a duplicate finger thats using md5 and crc32 to check for duplicates. it got an automaintaining database. more>>
WeedIt is a duplicate finger, thats using md5 and crc32 to check for duplicates. It got an automaintaining database. WeedIt will detect if a file from the db disappears. I may write a more complete readme one day. So far have fun playing with it.
readdb is a tool to translate dbs into plain text usage: readdb < dbname > compiling: gcc -o readdb readdb.c
USAGE: ./weedit -dclnqrs [db to load] [db to save] < directory to scan >
c = clear database
d = delete new dupes
l = load name given
n = dont add files to db
q = quiet mode
r = delete dupes saved in .dat
s = save name given
IF -r is given ./weedit only -lq are supported! DB will be saved after its done!
Enhancements:
- Speed was increased by eliminating the use of memcpy.
- The "v" parameter was added, which shows file system version.
- Symbolic links are no longer followed while scanning.
<<lessreaddb is a tool to translate dbs into plain text usage: readdb < dbname > compiling: gcc -o readdb readdb.c
USAGE: ./weedit -dclnqrs [db to load] [db to save] < directory to scan >
c = clear database
d = delete new dupes
l = load name given
n = dont add files to db
q = quiet mode
r = delete dupes saved in .dat
s = save name given
IF -r is given ./weedit only -lq are supported! DB will be saved after its done!
Enhancements:
- Speed was increased by eliminating the use of memcpy.
- The "v" parameter was added, which shows file system version.
- Symbolic links are no longer followed while scanning.
Download (0.020MB)
Added: 2007-07-26 License: GPL (GNU General Public License) Price:
825 downloads
Databrid 1.3
Databrid is a powerful tool that provides easy access to data and manipulation of data within an Oracle or MySql database. more>>
Databrid is a browsing, retrieval and manipulation tool designed for the novice to the expert user. Databrid works on MySql and Oracle Database (versions 8 and above although not all functionality in the Browser is available for the lower versions). The core functionality of Databrid revolves around the tabbed areas within the Databrid application. The four main tabs in the main screen of Databrid are: SQL Editor, Browser, File and Jobs.
## SQL EDITOR ##
The SQL Editor tab allows you to write and run SQL and PLSQL. The tab provides the ability to use one of more sql autocompletion, word and syntax highlighting editors with automatic case adjustment for keywords. Provided with each editor is a table for displaying SQL query results and a text output area to display DBMS_Output output. Jobs can be run in the background allowing for the execution of multiple statements at any given time.
## BROWSER ##
The Browser tab allows the you to browse various parts of the database schema. The browsing is done via a particular schema user and displays information on tables, views, sequences etc. Features include the generation of database creation statements for tables, views etc, browsing table or view data, truncating tables, etc.
## FILE ##
The File tab allows you work with a CSV (comma delimited text file) and the database without having to load the CSV into the database. This tab has two areas that functionality: CSV Update and Database Update. CSV Update allows you to add additional columns to a CSV using a Select statement, including binding CSV column values to the Select statement. Database Update allows you to update the database using insert, updates, deletes or PLSql by binding the CSV column values into your statement.
## JOBS ##
This tab allows you to view which jobs are currently running or have finished. Jobs that are running can also be stopped.
<<less## SQL EDITOR ##
The SQL Editor tab allows you to write and run SQL and PLSQL. The tab provides the ability to use one of more sql autocompletion, word and syntax highlighting editors with automatic case adjustment for keywords. Provided with each editor is a table for displaying SQL query results and a text output area to display DBMS_Output output. Jobs can be run in the background allowing for the execution of multiple statements at any given time.
## BROWSER ##
The Browser tab allows the you to browse various parts of the database schema. The browsing is done via a particular schema user and displays information on tables, views, sequences etc. Features include the generation of database creation statements for tables, views etc, browsing table or view data, truncating tables, etc.
## FILE ##
The File tab allows you work with a CSV (comma delimited text file) and the database without having to load the CSV into the database. This tab has two areas that functionality: CSV Update and Database Update. CSV Update allows you to add additional columns to a CSV using a Select statement, including binding CSV column values to the Select statement. Database Update allows you to update the database using insert, updates, deletes or PLSql by binding the CSV column values into your statement.
## JOBS ##
This tab allows you to view which jobs are currently running or have finished. Jobs that are running can also be stopped.
Download (3.0MB)
Added: 2007-07-25 License: Freeware Price:
844 downloads
Database Bean Generator 2.1.3
Generator is a command line application to facilitate the construction of small applications that need some database objects. more>>
Generator is an command line application written in java that have the goal to make easy the construction of little applications that needs some database objects stuff.
Database Bean Generator isnt a replacement of complex object persistence solutions, like hibernate or TopLink but it covers a different target. The little java web applications that dont use sofisticated persistence options.
Generator invocation is simple, just type:
java -jar generator.jar -xml (config-file.xml)
where config-file is a xml config file with the definitions to connect to the database and generate the bean classes.
Main features:
- Generates classes to access via custom connection resources to database tables.
- Configuration files are in clear xml format and can be embedded or separate.
- Supports individual or global field updates.
- Supports custom set of Exceptions.
- Provides toXML function for each entity generated.
- Provides automatic generation of finders coonfigured in the xml configuration file.
- Provides some utility static methods via the BdUtils.java class generation.
- Generates an xml file with the database structure.
- Supports configuration of the methods that produces XML (String as CDATA, data as attributes or values, ...)
- Initial support for MySQL and Oracle (Oracle support is in initial stage at this moment).
- Provides an ant task for automatic integration builds.
- Supports transparent renaming of the generated class individual fields.
- Supports normal or CDATA output in individual fields.
- Supports utilization in all database methods with your own external connection.
- Preliminar support of a pluggable logging system (The goal is use log4j integration)
- Support for SEQUENCES in Oracle and AUTOINCREMENT in MySQL
- Support arbitrary raw code and imports from configuration file
- Correct treatment for NULL values of the fields in the generated class
Enhancements:
- Optionally, you may include the extra jars to get JSON support.
- JSON output for finders and generic JSON output for general have been added.
<<lessDatabase Bean Generator isnt a replacement of complex object persistence solutions, like hibernate or TopLink but it covers a different target. The little java web applications that dont use sofisticated persistence options.
Generator invocation is simple, just type:
java -jar generator.jar -xml (config-file.xml)
where config-file is a xml config file with the definitions to connect to the database and generate the bean classes.
Main features:
- Generates classes to access via custom connection resources to database tables.
- Configuration files are in clear xml format and can be embedded or separate.
- Supports individual or global field updates.
- Supports custom set of Exceptions.
- Provides toXML function for each entity generated.
- Provides automatic generation of finders coonfigured in the xml configuration file.
- Provides some utility static methods via the BdUtils.java class generation.
- Generates an xml file with the database structure.
- Supports configuration of the methods that produces XML (String as CDATA, data as attributes or values, ...)
- Initial support for MySQL and Oracle (Oracle support is in initial stage at this moment).
- Provides an ant task for automatic integration builds.
- Supports transparent renaming of the generated class individual fields.
- Supports normal or CDATA output in individual fields.
- Supports utilization in all database methods with your own external connection.
- Preliminar support of a pluggable logging system (The goal is use log4j integration)
- Support for SEQUENCES in Oracle and AUTOINCREMENT in MySQL
- Support arbitrary raw code and imports from configuration file
- Correct treatment for NULL values of the fields in the generated class
Enhancements:
- Optionally, you may include the extra jars to get JSON support.
- JSON output for finders and generic JSON output for general have been added.
Download (1.9MB)
Added: 2007-07-25 License: LGPL (GNU Lesser General Public License) Price:
503 downloads
Large Database Backup 1.0
Large Database Backup is a PHP class can be used to backup large MySQL databases into multiple files. more>>
Large Database Backup is a PHP class can be used to backup large MySQL databases into multiple files.
It can list the tables of a given MySQL database and generate SQL statements to create and insert records with the current values of the table rows, as if it was creating a new database. The class stores the generated SQL statements in files.
A full backup process can be split in multiple iterations to not exceed PHP default script execution time limit. Each iteration dumps a limited number of table rows. An iteration can be executed by a script that redirects the page request to itself at the end to proceed to the next iteration.
<<lessIt can list the tables of a given MySQL database and generate SQL statements to create and insert records with the current values of the table rows, as if it was creating a new database. The class stores the generated SQL statements in files.
A full backup process can be split in multiple iterations to not exceed PHP default script execution time limit. Each iteration dumps a limited number of table rows. An iteration can be executed by a script that redirects the page request to itself at the end to proceed to the next iteration.
Download (MB)
Added: 2007-07-24 License: GPL (GNU General Public License) Price:
503 downloads
MIME::Words 5.420
MIME::Words is a Perl module to deal with RFC-1522 encoded words. more>>
MIME::Words is a Perl module to deal with RFC-1522 encoded words.
SYNOPSIS
Before reading further, you should see MIME::Tools to make sure that you understand where this module fits into the grand scheme of things. Go on, do it now. Ill wait.
Ready? Ok...
use MIME::Words qw(:all);
### Decode the string into another string, forgetting the charsets:
$decoded = decode_mimewords(
To: =?ISO-8859-1?Q?Keld_J=F8rn_Simonsen?= ,
);
### Split string into array of decoded [DATA,CHARSET] pairs:
@decoded = decode_mimewords(
To: =?ISO-8859-1?Q?Keld_J=F8rn_Simonsen?= ,
);
### Encode a single unsafe word:
$encoded = encode_mimeword("xABFranxE7oisxBB");
### Encode a string, trying to find the unsafe words inside it:
$encoded = encode_mimewords("Me and xABFranxE7oisxBB in town");
Fellow Americans, you probably wont know what the hell this module is for. Europeans, Russians, et al, you probably do.
For example, heres a valid MIME header you might get:
From: =?US-ASCII?Q?Keith_Moore?= < moore@cs.utk.edu>
To: =?ISO-8859-1?Q?Keld_J=F8rn_Simonsen?= < keld@dkuug.dk>
CC: =?ISO-8859-1?Q?Andr=E9_?= Pirard < PIRARD@vm1.ulg.ac.be>
Subject: =?ISO-8859-1?B?SWYgeW91IGNhbiByZWFkIHRoaXMgeW8=?=
=?ISO-8859-2?B?dSB1bmRlcnN0YW5kIHRoZSBleGFtcGxlLg==?=
=?US-ASCII?Q?.._cool!?=
The fields basically decode to (sorry, I can only approximate the Latin characters with 7 bit sequences /o and e):
From: Keith Moore < moore@cs.utk.edu>
To: Keld J/orn Simonsen < keld@dkuug.dk>
CC: Andre Pirard < PIRARD@vm1.ulg.ac.be>
Subject: If you can read this you understand the example... cool!
<<lessSYNOPSIS
Before reading further, you should see MIME::Tools to make sure that you understand where this module fits into the grand scheme of things. Go on, do it now. Ill wait.
Ready? Ok...
use MIME::Words qw(:all);
### Decode the string into another string, forgetting the charsets:
$decoded = decode_mimewords(
To: =?ISO-8859-1?Q?Keld_J=F8rn_Simonsen?= ,
);
### Split string into array of decoded [DATA,CHARSET] pairs:
@decoded = decode_mimewords(
To: =?ISO-8859-1?Q?Keld_J=F8rn_Simonsen?= ,
);
### Encode a single unsafe word:
$encoded = encode_mimeword("xABFranxE7oisxBB");
### Encode a string, trying to find the unsafe words inside it:
$encoded = encode_mimewords("Me and xABFranxE7oisxBB in town");
Fellow Americans, you probably wont know what the hell this module is for. Europeans, Russians, et al, you probably do.
For example, heres a valid MIME header you might get:
From: =?US-ASCII?Q?Keith_Moore?= < moore@cs.utk.edu>
To: =?ISO-8859-1?Q?Keld_J=F8rn_Simonsen?= < keld@dkuug.dk>
CC: =?ISO-8859-1?Q?Andr=E9_?= Pirard < PIRARD@vm1.ulg.ac.be>
Subject: =?ISO-8859-1?B?SWYgeW91IGNhbiByZWFkIHRoaXMgeW8=?=
=?ISO-8859-2?B?dSB1bmRlcnN0YW5kIHRoZSBleGFtcGxlLg==?=
=?US-ASCII?Q?.._cool!?=
The fields basically decode to (sorry, I can only approximate the Latin characters with 7 bit sequences /o and e):
From: Keith Moore < moore@cs.utk.edu>
To: Keld J/orn Simonsen < keld@dkuug.dk>
CC: Andre Pirard < PIRARD@vm1.ulg.ac.be>
Subject: If you can read this you understand the example... cool!
Download (0.38MB)
Added: 2007-07-20 License: Perl Artistic License Price:
828 downloads
Database Functions 1.0
Database Functions is a PHP class that can be used to build and execute MySQL database queries. more>>
Database Functions is a PHP class that can be used to build and execute MySQL database queries.
It can build SELECT, INSERT, UPDATE and DELETE queries from lists of parameters and values.
The class can also execute the generated queries and retrieve the SELECT query results into associative arrays.
<<lessIt can build SELECT, INSERT, UPDATE and DELETE queries from lists of parameters and values.
The class can also execute the generated queries and retrieve the SELECT query results into associative arrays.
Download (MB)
Added: 2007-07-19 License: GPL (GNU General Public License) Price:
830 downloads
Template::Alloy::Parse 1.006
Template::Alloy::Parse is a Perl module with common parsing role for creating AST from templates. more>>
Template::Alloy::Parse is a Perl module with common parsing role for creating AST from templates.
The Template::Alloy::Parse role is reponsible for storing the majority of directive parsing code, as well as for delegating to the TT, HTE, Tmpl, and Velocity roles for finding variables and directives.
ROLE METHODS
parse_tree
Used by load_tree. This is the main grammar engine of the program. It delegates to the syntax found in $self->{SYNTAX} (defaults to alloy) and calls the function found in the $SYNTAX hashref. The majority of these syntaxes use methods found in the $DIRECTIVES hashref to parse different DIRECTIVE types for each particular syntax.
A template that looked like the following:
Foo
[%- GET foo -%]
[%- GET bar -%]
Bar
would parse to the following AST:
[
Foo,
[GET, 6, 15, [foo, 0]],
[GET, 22, 31, [bar, 0]],
Bar,
]
The "GET" words represent the directive used. The 6, 15 represent the beginning and ending characters of the directive in the document. The remaining items are the variables necessary for running the particular directive.
parse_expr
Used to parse a variable, an expression, a literal string, or a number. It returns a parsed variable tree. Samples of parsed variables can be found in the VARIABLE PARSE TREE section.
my $str = "1 + 2 * 3";
my $ast = $self->parse_expr($str);
# $ast looks like [[undef, +, 1, [[undef, *, 2, 3], 0]], 0]
parse_args
Allow for the multitudinous ways that TT parses arguments. This allows for positional as well as named arguments. Named arguments can be separated with a "=" or "=>", and positional arguments should be separated by " " or ",". This only returns an array of parsed variables. To get the actual values, you must call play_expr on each value.
dump_parse_tree
This method allows for returning a string of perl code representing the AST of the parsed tree.
It is mainly used for testing.
dump_parse_expr
This method allows for returning a Data::Dumper dump of a parsed variable. It is mainly used for testing.
parse_*
Methods by these names are used by parse_tree to parse the template. These are the grammar. They are used by all of the various template syntaxes Unless otherwise mentioned, these methods are not exposed via the role.
<<lessThe Template::Alloy::Parse role is reponsible for storing the majority of directive parsing code, as well as for delegating to the TT, HTE, Tmpl, and Velocity roles for finding variables and directives.
ROLE METHODS
parse_tree
Used by load_tree. This is the main grammar engine of the program. It delegates to the syntax found in $self->{SYNTAX} (defaults to alloy) and calls the function found in the $SYNTAX hashref. The majority of these syntaxes use methods found in the $DIRECTIVES hashref to parse different DIRECTIVE types for each particular syntax.
A template that looked like the following:
Foo
[%- GET foo -%]
[%- GET bar -%]
Bar
would parse to the following AST:
[
Foo,
[GET, 6, 15, [foo, 0]],
[GET, 22, 31, [bar, 0]],
Bar,
]
The "GET" words represent the directive used. The 6, 15 represent the beginning and ending characters of the directive in the document. The remaining items are the variables necessary for running the particular directive.
parse_expr
Used to parse a variable, an expression, a literal string, or a number. It returns a parsed variable tree. Samples of parsed variables can be found in the VARIABLE PARSE TREE section.
my $str = "1 + 2 * 3";
my $ast = $self->parse_expr($str);
# $ast looks like [[undef, +, 1, [[undef, *, 2, 3], 0]], 0]
parse_args
Allow for the multitudinous ways that TT parses arguments. This allows for positional as well as named arguments. Named arguments can be separated with a "=" or "=>", and positional arguments should be separated by " " or ",". This only returns an array of parsed variables. To get the actual values, you must call play_expr on each value.
dump_parse_tree
This method allows for returning a string of perl code representing the AST of the parsed tree.
It is mainly used for testing.
dump_parse_expr
This method allows for returning a Data::Dumper dump of a parsed variable. It is mainly used for testing.
parse_*
Methods by these names are used by parse_tree to parse the template. These are the grammar. They are used by all of the various template syntaxes Unless otherwise mentioned, these methods are not exposed via the role.
Download (0.14MB)
Added: 2007-07-14 License: Perl Artistic License Price:
832 downloads
phpCodeGenerator 0.2.1
phpCodeGenerator is a free database driven website code generator. more>>
phpCodeGenerator is a free database driven website code generator. This application reads the database and generates a website with the ability to Create, List, Edit, Update, Delete and Search Records.
<<less Download (MB)
Added: 2007-07-12 License: GPL (GNU General Public License) Price:
835 downloads
PHP Database Access Through Arrays 0.7.0
PHP Database Access Through Arrays project can be used to access data stored in MySQL tables like accessing arrays. more>>
PHP Database Access Through Arrays project can be used to access data stored in MySQL tables like accessing arrays. It uses SPL to implement several classes and iterators interfaces to access MySQL databases.
Examples:
$DB[test_table][] = array(
name => first,
value => the first row
);
foreach ($DB[test_table] as $i => $row) {
...
}
$DB[test_table][first][value] = 1st;
unset($DB[test_table][first]);
<<lessExamples:
$DB[test_table][] = array(
name => first,
value => the first row
);
foreach ($DB[test_table] as $i => $row) {
...
}
$DB[test_table][first][value] = 1st;
unset($DB[test_table][first]);
Download (MB)
Added: 2007-07-09 License: LGPL (GNU Lesser General Public License) Price:
839 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 got word database maker 1.3 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
